/export/starexec/sandbox2/solver/bin/starexec_run_default /export/starexec/sandbox2/benchmark/theBenchmark.c /export/starexec/sandbox2/output/output_files -------------------------------------------------------------------------------- Ultimate: Cannot open display: This is Ultimate 0.1.25-34f2e62 [2020-07-01 13:11:52,219 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-07-01 13:11:52,221 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-07-01 13:11:52,232 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-07-01 13:11:52,233 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-07-01 13:11:52,234 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-07-01 13:11:52,235 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-07-01 13:11:52,236 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-07-01 13:11:52,238 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-07-01 13:11:52,239 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-07-01 13:11:52,240 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-07-01 13:11:52,241 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-07-01 13:11:52,241 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-07-01 13:11:52,242 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-07-01 13:11:52,243 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-07-01 13:11:52,244 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-07-01 13:11:52,244 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-07-01 13:11:52,245 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-07-01 13:11:52,247 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-07-01 13:11:52,249 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-07-01 13:11:52,250 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-07-01 13:11:52,251 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-07-01 13:11:52,252 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-07-01 13:11:52,253 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-07-01 13:11:52,255 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-07-01 13:11:52,255 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-07-01 13:11:52,256 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-07-01 13:11:52,256 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-07-01 13:11:52,257 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-07-01 13:11:52,258 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-07-01 13:11:52,258 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-07-01 13:11:52,259 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-07-01 13:11:52,259 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-07-01 13:11:52,260 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-07-01 13:11:52,261 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-07-01 13:11:52,261 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-07-01 13:11:52,262 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-07-01 13:11:52,262 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-07-01 13:11:52,262 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-07-01 13:11:52,263 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-07-01 13:11:52,264 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-07-01 13:11:52,264 INFO L101 SettingsManager]: Beginning loading settings from /export/starexec/sandbox2/solver/bin/./../termcomp2017.epf [2020-07-01 13:11:52,278 INFO L113 SettingsManager]: Loading preferences was successful [2020-07-01 13:11:52,279 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-07-01 13:11:52,280 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-07-01 13:11:52,280 INFO L138 SettingsManager]: * Rewrite not-equals=true [2020-07-01 13:11:52,280 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-07-01 13:11:52,280 INFO L138 SettingsManager]: * Minimize states using LBE with the strategy=SINGLE [2020-07-01 13:11:52,280 INFO L138 SettingsManager]: * Use SBE=true [2020-07-01 13:11:52,281 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2020-07-01 13:11:52,281 INFO L138 SettingsManager]: * Use old map elimination=false [2020-07-01 13:11:52,281 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2020-07-01 13:11:52,281 INFO L138 SettingsManager]: * Buchi interpolant automaton construction strategy=DANDELION [2020-07-01 13:11:52,281 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2020-07-01 13:11:52,282 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2020-07-01 13:11:52,282 INFO L138 SettingsManager]: * Construct termination proof for TermComp=true [2020-07-01 13:11:52,282 INFO L138 SettingsManager]: * Command for external solver (GNTA synthesis)=z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 [2020-07-01 13:11:52,282 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-07-01 13:11:52,282 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2020-07-01 13:11:52,282 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-07-01 13:11:52,283 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-07-01 13:11:52,283 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2020-07-01 13:11:52,283 INFO L138 SettingsManager]: * How to treat unsigned ints differently from normal ones=IGNORE [2020-07-01 13:11:52,283 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-07-01 13:11:52,283 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-07-01 13:11:52,283 INFO L138 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2020-07-01 13:11:52,284 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:5000 [2020-07-01 13:11:52,284 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-07-01 13:11:52,284 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-07-01 13:11:52,284 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-07-01 13:11:52,284 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-07-01 13:11:52,450 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2020-07-01 13:11:52,464 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-07-01 13:11:52,468 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-07-01 13:11:52,469 INFO L271 PluginConnector]: Initializing CDTParser... [2020-07-01 13:11:52,470 INFO L275 PluginConnector]: CDTParser initialized [2020-07-01 13:11:52,470 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /export/starexec/sandbox2/benchmark/theBenchmark.c [2020-07-01 13:11:52,532 INFO L220 CDTParser]: Created temporary CDT project at /export/starexec/sandbox2/tmp/BenchExec_run_LYV_BQ/tmp/6daae9a43f1b4c5fbfc67139111267ae/FLAG0442d21d0 [2020-07-01 13:11:52,865 INFO L306 CDTParser]: Found 1 translation units. [2020-07-01 13:11:52,866 INFO L160 CDTParser]: Scanning /export/starexec/sandbox2/benchmark/theBenchmark.c [2020-07-01 13:11:52,866 WARN L117 ultiparseSymbolTable]: System include stdlib.h could not be resolved by CDT -- only built-in system includes are available. [2020-07-01 13:11:52,872 INFO L349 CDTParser]: About to delete temporary CDT project at /export/starexec/sandbox2/tmp/BenchExec_run_LYV_BQ/tmp/6daae9a43f1b4c5fbfc67139111267ae/FLAG0442d21d0 [2020-07-01 13:11:53,271 INFO L357 CDTParser]: Successfully deleted /export/starexec/sandbox2/tmp/BenchExec_run_LYV_BQ/tmp/6daae9a43f1b4c5fbfc67139111267ae [2020-07-01 13:11:53,282 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-07-01 13:11:53,283 INFO L131 ToolchainWalker]: Walking toolchain with 7 elements. [2020-07-01 13:11:53,284 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-07-01 13:11:53,285 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-07-01 13:11:53,288 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-07-01 13:11:53,289 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 01.07 01:11:53" (1/1) ... [2020-07-01 13:11:53,292 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@574b28fd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.07 01:11:53, skipping insertion in model container [2020-07-01 13:11:53,292 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 01.07 01:11:53" (1/1) ... [2020-07-01 13:11:53,301 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-07-01 13:11:53,317 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-07-01 13:11:53,537 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-01 13:11:53,549 INFO L203 MainTranslator]: Completed pre-run [2020-07-01 13:11:53,565 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-01 13:11:53,580 INFO L208 MainTranslator]: Completed translation [2020-07-01 13:11:53,580 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.07 01:11:53 WrapperNode [2020-07-01 13:11:53,581 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-07-01 13:11:53,581 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-07-01 13:11:53,582 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-07-01 13:11:53,582 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-07-01 13:11:53,591 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.07 01:11:53" (1/1) ... [2020-07-01 13:11:53,599 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.07 01:11:53" (1/1) ... [2020-07-01 13:11:53,621 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-07-01 13:11:53,621 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-07-01 13:11:53,621 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-07-01 13:11:53,621 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-07-01 13:11:53,631 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.07 01:11:53" (1/1) ... [2020-07-01 13:11:53,631 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.07 01:11:53" (1/1) ... [2020-07-01 13:11:53,633 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.07 01:11:53" (1/1) ... [2020-07-01 13:11:53,633 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.07 01:11:53" (1/1) ... [2020-07-01 13:11:53,637 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.07 01:11:53" (1/1) ... [2020-07-01 13:11:53,642 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.07 01:11:53" (1/1) ... [2020-07-01 13:11:53,644 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.07 01:11:53" (1/1) ... [2020-07-01 13:11:53,645 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-07-01 13:11:53,646 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-07-01 13:11:53,646 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-07-01 13:11:53,646 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-07-01 13:11:53,647 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.07 01:11:53" (1/1) ... No working directory specified, using /export/starexec/sandbox2/solver/bin/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:5000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:5000 [2020-07-01 13:11:53,719 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-07-01 13:11:53,720 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-07-01 13:11:53,720 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-07-01 13:11:53,720 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2020-07-01 13:11:53,720 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-07-01 13:11:53,720 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-07-01 13:11:53,982 INFO L290 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-07-01 13:11:53,983 INFO L295 CfgBuilder]: Removed 6 assume(true) statements. [2020-07-01 13:11:53,987 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.07 01:11:53 BoogieIcfgContainer [2020-07-01 13:11:53,987 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-07-01 13:11:53,988 INFO L113 PluginConnector]: ------------------------BlockEncodingV2---------------------------- [2020-07-01 13:11:53,988 INFO L271 PluginConnector]: Initializing BlockEncodingV2... [2020-07-01 13:11:53,990 INFO L275 PluginConnector]: BlockEncodingV2 initialized [2020-07-01 13:11:53,991 INFO L185 PluginConnector]: Executing the observer BlockEncodingObserver from plugin BlockEncodingV2 for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.07 01:11:53" (1/1) ... [2020-07-01 13:11:54,006 INFO L313 BlockEncoder]: Initial Icfg 37 locations, 40 edges [2020-07-01 13:11:54,007 INFO L258 BlockEncoder]: Using Remove infeasible edges [2020-07-01 13:11:54,008 INFO L263 BlockEncoder]: Using Maximize final states [2020-07-01 13:11:54,009 INFO L270 BlockEncoder]: Using Minimize states even if more edges are added than removed.=false [2020-07-01 13:11:54,009 INFO L276 BlockEncoder]: Using Minimize states using LBE with the strategy=SINGLE [2020-07-01 13:11:54,011 INFO L296 BlockEncoder]: Using Remove sink states [2020-07-01 13:11:54,012 INFO L171 BlockEncoder]: Using Apply optimizations until nothing changes=true [2020-07-01 13:11:54,012 INFO L179 BlockEncoder]: Using Rewrite not-equals [2020-07-01 13:11:54,035 INFO L185 BlockEncoder]: Using Use SBE [2020-07-01 13:11:54,071 INFO L200 BlockEncoder]: SBE split 19 edges [2020-07-01 13:11:54,076 INFO L70 emoveInfeasibleEdges]: Removed 2 edges and 0 locations because of local infeasibility [2020-07-01 13:11:54,078 INFO L71 MaximizeFinalStates]: 0 new accepting states [2020-07-01 13:11:54,105 INFO L100 BaseMinimizeStates]: Removed 10 edges and 5 locations by large block encoding [2020-07-01 13:11:54,108 INFO L70 RemoveSinkStates]: Removed 1 edges and 1 locations by removing sink states [2020-07-01 13:11:54,110 INFO L70 emoveInfeasibleEdges]: Removed 0 edges and 0 locations because of local infeasibility [2020-07-01 13:11:54,110 INFO L71 MaximizeFinalStates]: 0 new accepting states [2020-07-01 13:11:54,115 INFO L100 BaseMinimizeStates]: Removed 2 edges and 1 locations by large block encoding [2020-07-01 13:11:54,115 INFO L70 RemoveSinkStates]: Removed 0 edges and 0 locations by removing sink states [2020-07-01 13:11:54,116 INFO L70 emoveInfeasibleEdges]: Removed 0 edges and 0 locations because of local infeasibility [2020-07-01 13:11:54,116 INFO L71 MaximizeFinalStates]: 0 new accepting states [2020-07-01 13:11:54,116 INFO L100 BaseMinimizeStates]: Removed 0 edges and 0 locations by large block encoding [2020-07-01 13:11:54,117 INFO L70 RemoveSinkStates]: Removed 0 edges and 0 locations by removing sink states [2020-07-01 13:11:54,118 INFO L313 BlockEncoder]: Encoded RCFG 30 locations, 56 edges [2020-07-01 13:11:54,118 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 01.07 01:11:54 BasicIcfg [2020-07-01 13:11:54,118 INFO L132 PluginConnector]: ------------------------ END BlockEncodingV2---------------------------- [2020-07-01 13:11:54,120 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-07-01 13:11:54,120 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-07-01 13:11:54,123 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-07-01 13:11:54,124 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 01.07 01:11:53" (1/4) ... [2020-07-01 13:11:54,125 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@42ae33c2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 01.07 01:11:54, skipping insertion in model container [2020-07-01 13:11:54,125 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.07 01:11:53" (2/4) ... [2020-07-01 13:11:54,125 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@42ae33c2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 01.07 01:11:54, skipping insertion in model container [2020-07-01 13:11:54,126 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.07 01:11:53" (3/4) ... [2020-07-01 13:11:54,126 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@42ae33c2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 01.07 01:11:54, skipping insertion in model container [2020-07-01 13:11:54,126 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 01.07 01:11:54" (4/4) ... [2020-07-01 13:11:54,128 INFO L109 eAbstractionObserver]: Analyzing ICFG theBenchmark.c_BEv2 [2020-07-01 13:11:54,139 INFO L157 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:ForwardPredicates Determinization: PREDICATE_ABSTRACTION [2020-07-01 13:11:54,148 INFO L169 ceAbstractionStarter]: Appying trace abstraction to program that has 18 error locations. [2020-07-01 13:11:54,163 INFO L251 AbstractCegarLoop]: Starting to check reachability of 18 error locations. [2020-07-01 13:11:54,188 INFO L375 AbstractCegarLoop]: Interprodecural is true [2020-07-01 13:11:54,189 INFO L376 AbstractCegarLoop]: Hoare is true [2020-07-01 13:11:54,189 INFO L377 AbstractCegarLoop]: Compute interpolants for ForwardPredicates [2020-07-01 13:11:54,189 INFO L378 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-07-01 13:11:54,189 INFO L379 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-07-01 13:11:54,189 INFO L380 AbstractCegarLoop]: Difference is false [2020-07-01 13:11:54,190 INFO L381 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-07-01 13:11:54,190 INFO L385 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-07-01 13:11:54,205 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states. [2020-07-01 13:11:54,211 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2020-07-01 13:11:54,211 INFO L414 BasicCegarLoop]: Found error trace [2020-07-01 13:11:54,212 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1] [2020-07-01 13:11:54,212 INFO L427 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION]=== [2020-07-01 13:11:54,218 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 13:11:54,218 INFO L82 PathProgramCache]: Analyzing trace with hash 129027, now seen corresponding path program 1 times [2020-07-01 13:11:54,228 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 13:11:54,229 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1076003658] [2020-07-01 13:11:54,229 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 13:11:54,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 13:11:54,415 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-01 13:11:54,416 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1076003658] [2020-07-01 13:11:54,417 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-01 13:11:54,417 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-07-01 13:11:54,418 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [277512139] [2020-07-01 13:11:54,423 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-01 13:11:54,423 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-01 13:11:54,437 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-01 13:11:54,438 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-01 13:11:54,440 INFO L87 Difference]: Start difference. First operand 30 states. Second operand 3 states. [2020-07-01 13:11:54,605 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-01 13:11:54,605 INFO L93 Difference]: Finished difference Result 30 states and 56 transitions. [2020-07-01 13:11:54,606 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-01 13:11:54,607 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2020-07-01 13:11:54,608 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-01 13:11:54,621 INFO L225 Difference]: With dead ends: 30 [2020-07-01 13:11:54,621 INFO L226 Difference]: Without dead ends: 26 [2020-07-01 13:11:54,625 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-01 13:11:54,643 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2020-07-01 13:11:54,661 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 26. [2020-07-01 13:11:54,662 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2020-07-01 13:11:54,663 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 48 transitions. [2020-07-01 13:11:54,665 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 48 transitions. Word has length 3 [2020-07-01 13:11:54,666 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-01 13:11:54,666 INFO L479 AbstractCegarLoop]: Abstraction has 26 states and 48 transitions. [2020-07-01 13:11:54,666 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-01 13:11:54,667 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 48 transitions. [2020-07-01 13:11:54,667 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2020-07-01 13:11:54,667 INFO L414 BasicCegarLoop]: Found error trace [2020-07-01 13:11:54,667 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1] [2020-07-01 13:11:54,669 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-07-01 13:11:54,669 INFO L427 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION]=== [2020-07-01 13:11:54,669 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 13:11:54,670 INFO L82 PathProgramCache]: Analyzing trace with hash 129029, now seen corresponding path program 1 times [2020-07-01 13:11:54,670 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 13:11:54,670 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [919009734] [2020-07-01 13:11:54,670 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 13:11:54,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 13:11:54,710 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-01 13:11:54,710 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [919009734] [2020-07-01 13:11:54,710 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-01 13:11:54,711 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-07-01 13:11:54,711 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1156956252] [2020-07-01 13:11:54,712 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-01 13:11:54,713 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-01 13:11:54,713 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-01 13:11:54,713 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-01 13:11:54,713 INFO L87 Difference]: Start difference. First operand 26 states and 48 transitions. Second operand 3 states. [2020-07-01 13:11:54,804 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-01 13:11:54,804 INFO L93 Difference]: Finished difference Result 26 states and 48 transitions. [2020-07-01 13:11:54,805 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-01 13:11:54,805 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2020-07-01 13:11:54,805 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-01 13:11:54,806 INFO L225 Difference]: With dead ends: 26 [2020-07-01 13:11:54,806 INFO L226 Difference]: Without dead ends: 22 [2020-07-01 13:11:54,807 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-01 13:11:54,807 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2020-07-01 13:11:54,810 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 22. [2020-07-01 13:11:54,811 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2020-07-01 13:11:54,811 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 40 transitions. [2020-07-01 13:11:54,812 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 40 transitions. Word has length 3 [2020-07-01 13:11:54,812 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-01 13:11:54,812 INFO L479 AbstractCegarLoop]: Abstraction has 22 states and 40 transitions. [2020-07-01 13:11:54,812 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-01 13:11:54,812 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 40 transitions. [2020-07-01 13:11:54,813 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2020-07-01 13:11:54,813 INFO L414 BasicCegarLoop]: Found error trace [2020-07-01 13:11:54,813 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2020-07-01 13:11:54,813 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-07-01 13:11:54,813 INFO L427 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION]=== [2020-07-01 13:11:54,814 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 13:11:54,814 INFO L82 PathProgramCache]: Analyzing trace with hash 3998668, now seen corresponding path program 1 times [2020-07-01 13:11:54,814 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 13:11:54,814 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2070203017] [2020-07-01 13:11:54,814 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 13:11:54,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 13:11:54,845 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-01 13:11:54,846 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2070203017] [2020-07-01 13:11:54,846 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-01 13:11:54,846 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-07-01 13:11:54,846 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1667111787] [2020-07-01 13:11:54,847 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-01 13:11:54,847 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-01 13:11:54,847 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-01 13:11:54,847 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-01 13:11:54,847 INFO L87 Difference]: Start difference. First operand 22 states and 40 transitions. Second operand 3 states. [2020-07-01 13:11:54,922 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-01 13:11:54,922 INFO L93 Difference]: Finished difference Result 22 states and 40 transitions. [2020-07-01 13:11:54,923 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-01 13:11:54,923 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 4 [2020-07-01 13:11:54,923 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-01 13:11:54,924 INFO L225 Difference]: With dead ends: 22 [2020-07-01 13:11:54,924 INFO L226 Difference]: Without dead ends: 21 [2020-07-01 13:11:54,924 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-01 13:11:54,925 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2020-07-01 13:11:54,928 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 21. [2020-07-01 13:11:54,928 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2020-07-01 13:11:54,929 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 38 transitions. [2020-07-01 13:11:54,929 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 38 transitions. Word has length 4 [2020-07-01 13:11:54,929 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-01 13:11:54,929 INFO L479 AbstractCegarLoop]: Abstraction has 21 states and 38 transitions. [2020-07-01 13:11:54,929 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-01 13:11:54,929 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 38 transitions. [2020-07-01 13:11:54,930 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2020-07-01 13:11:54,930 INFO L414 BasicCegarLoop]: Found error trace [2020-07-01 13:11:54,930 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2020-07-01 13:11:54,930 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-07-01 13:11:54,930 INFO L427 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION]=== [2020-07-01 13:11:54,930 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 13:11:54,931 INFO L82 PathProgramCache]: Analyzing trace with hash 3998670, now seen corresponding path program 1 times [2020-07-01 13:11:54,931 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 13:11:54,931 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [848028104] [2020-07-01 13:11:54,931 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 13:11:54,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 13:11:54,966 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-01 13:11:54,966 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [848028104] [2020-07-01 13:11:54,966 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-01 13:11:54,966 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-07-01 13:11:54,967 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [409088430] [2020-07-01 13:11:54,967 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-01 13:11:54,967 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-01 13:11:54,968 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-01 13:11:54,968 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-01 13:11:54,968 INFO L87 Difference]: Start difference. First operand 21 states and 38 transitions. Second operand 3 states. [2020-07-01 13:11:55,038 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-01 13:11:55,039 INFO L93 Difference]: Finished difference Result 21 states and 38 transitions. [2020-07-01 13:11:55,039 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-01 13:11:55,039 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 4 [2020-07-01 13:11:55,040 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-01 13:11:55,040 INFO L225 Difference]: With dead ends: 21 [2020-07-01 13:11:55,040 INFO L226 Difference]: Without dead ends: 20 [2020-07-01 13:11:55,041 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-01 13:11:55,041 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2020-07-01 13:11:55,044 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 20. [2020-07-01 13:11:55,044 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2020-07-01 13:11:55,044 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 36 transitions. [2020-07-01 13:11:55,045 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 36 transitions. Word has length 4 [2020-07-01 13:11:55,045 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-01 13:11:55,045 INFO L479 AbstractCegarLoop]: Abstraction has 20 states and 36 transitions. [2020-07-01 13:11:55,045 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-01 13:11:55,045 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 36 transitions. [2020-07-01 13:11:55,046 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2020-07-01 13:11:55,046 INFO L414 BasicCegarLoop]: Found error trace [2020-07-01 13:11:55,046 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2020-07-01 13:11:55,046 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-07-01 13:11:55,046 INFO L427 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION]=== [2020-07-01 13:11:55,046 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 13:11:55,047 INFO L82 PathProgramCache]: Analyzing trace with hash 123959992, now seen corresponding path program 1 times [2020-07-01 13:11:55,047 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 13:11:55,047 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [700069695] [2020-07-01 13:11:55,047 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 13:11:55,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 13:11:55,081 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-01 13:11:55,081 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [700069695] [2020-07-01 13:11:55,082 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-01 13:11:55,082 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-07-01 13:11:55,082 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [635215146] [2020-07-01 13:11:55,082 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-01 13:11:55,083 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-01 13:11:55,083 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-01 13:11:55,083 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-01 13:11:55,083 INFO L87 Difference]: Start difference. First operand 20 states and 36 transitions. Second operand 3 states. [2020-07-01 13:11:55,158 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-01 13:11:55,158 INFO L93 Difference]: Finished difference Result 20 states and 36 transitions. [2020-07-01 13:11:55,159 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-01 13:11:55,159 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 5 [2020-07-01 13:11:55,159 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-01 13:11:55,160 INFO L225 Difference]: With dead ends: 20 [2020-07-01 13:11:55,160 INFO L226 Difference]: Without dead ends: 16 [2020-07-01 13:11:55,160 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-01 13:11:55,161 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states. [2020-07-01 13:11:55,163 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 16. [2020-07-01 13:11:55,164 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2020-07-01 13:11:55,164 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 28 transitions. [2020-07-01 13:11:55,164 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 28 transitions. Word has length 5 [2020-07-01 13:11:55,165 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-01 13:11:55,165 INFO L479 AbstractCegarLoop]: Abstraction has 16 states and 28 transitions. [2020-07-01 13:11:55,165 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-01 13:11:55,165 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 28 transitions. [2020-07-01 13:11:55,165 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2020-07-01 13:11:55,165 INFO L414 BasicCegarLoop]: Found error trace [2020-07-01 13:11:55,165 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2020-07-01 13:11:55,166 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-07-01 13:11:55,166 INFO L427 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION]=== [2020-07-01 13:11:55,166 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 13:11:55,166 INFO L82 PathProgramCache]: Analyzing trace with hash 123959994, now seen corresponding path program 1 times [2020-07-01 13:11:55,166 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 13:11:55,167 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1212462662] [2020-07-01 13:11:55,167 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 13:11:55,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 13:11:55,194 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-01 13:11:55,195 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1212462662] [2020-07-01 13:11:55,195 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-01 13:11:55,195 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-07-01 13:11:55,195 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1155683165] [2020-07-01 13:11:55,196 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-01 13:11:55,196 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-01 13:11:55,196 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-01 13:11:55,196 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-01 13:11:55,196 INFO L87 Difference]: Start difference. First operand 16 states and 28 transitions. Second operand 3 states. [2020-07-01 13:11:55,247 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-01 13:11:55,247 INFO L93 Difference]: Finished difference Result 20 states and 28 transitions. [2020-07-01 13:11:55,248 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-01 13:11:55,248 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 5 [2020-07-01 13:11:55,248 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-01 13:11:55,249 INFO L225 Difference]: With dead ends: 20 [2020-07-01 13:11:55,249 INFO L226 Difference]: Without dead ends: 16 [2020-07-01 13:11:55,249 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-01 13:11:55,249 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states. [2020-07-01 13:11:55,252 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 16. [2020-07-01 13:11:55,252 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2020-07-01 13:11:55,253 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 24 transitions. [2020-07-01 13:11:55,253 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 24 transitions. Word has length 5 [2020-07-01 13:11:55,253 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-01 13:11:55,253 INFO L479 AbstractCegarLoop]: Abstraction has 16 states and 24 transitions. [2020-07-01 13:11:55,253 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-01 13:11:55,253 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 24 transitions. [2020-07-01 13:11:55,254 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2020-07-01 13:11:55,254 INFO L414 BasicCegarLoop]: Found error trace [2020-07-01 13:11:55,254 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2020-07-01 13:11:55,254 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-07-01 13:11:55,255 INFO L427 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION]=== [2020-07-01 13:11:55,255 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 13:11:55,255 INFO L82 PathProgramCache]: Analyzing trace with hash 123959995, now seen corresponding path program 1 times [2020-07-01 13:11:55,256 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 13:11:55,256 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1926547661] [2020-07-01 13:11:55,256 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 13:11:55,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 13:11:55,301 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-01 13:11:55,302 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1926547661] [2020-07-01 13:11:55,302 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-01 13:11:55,302 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-07-01 13:11:55,302 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2097528532] [2020-07-01 13:11:55,303 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-01 13:11:55,303 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-01 13:11:55,303 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-01 13:11:55,303 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-01 13:11:55,303 INFO L87 Difference]: Start difference. First operand 16 states and 24 transitions. Second operand 3 states. [2020-07-01 13:11:55,371 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-01 13:11:55,371 INFO L93 Difference]: Finished difference Result 16 states and 24 transitions. [2020-07-01 13:11:55,372 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-01 13:11:55,372 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 5 [2020-07-01 13:11:55,372 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-01 13:11:55,372 INFO L225 Difference]: With dead ends: 16 [2020-07-01 13:11:55,372 INFO L226 Difference]: Without dead ends: 0 [2020-07-01 13:11:55,373 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-01 13:11:55,374 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2020-07-01 13:11:55,374 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2020-07-01 13:11:55,374 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2020-07-01 13:11:55,374 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2020-07-01 13:11:55,374 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 5 [2020-07-01 13:11:55,374 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-01 13:11:55,375 INFO L479 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-07-01 13:11:55,375 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-01 13:11:55,375 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-07-01 13:11:55,375 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-01 13:11:55,375 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2020-07-01 13:11:55,378 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2020-07-01 13:11:55,450 INFO L268 CegarLoopResult]: For program point L9(line 9) no Hoare annotation was computed. [2020-07-01 13:11:55,451 INFO L268 CegarLoopResult]: For program point L9-1(lines 9 11) no Hoare annotation was computed. [2020-07-01 13:11:55,451 INFO L268 CegarLoopResult]: For program point L7-1(line 7) no Hoare annotation was computed. [2020-07-01 13:11:55,451 INFO L264 CegarLoopResult]: At program point L9-3(lines 8 11) the Hoare annotation is: (and (= 1 (select |#valid| ULTIMATE.start_main_~j~0.base)) (= 1 (select |#valid| ULTIMATE.start_main_~i~0.base)) (= 4 (select |#length| ULTIMATE.start_main_~i~0.base)) (= 0 ULTIMATE.start_main_~i~0.offset) (= 0 ULTIMATE.start_main_~n~0.offset) (= 4 (select |#length| ULTIMATE.start_main_~n~0.base)) (= (select |#length| ULTIMATE.start_main_~j~0.base) 4) (= 0 ULTIMATE.start_main_~j~0.offset) (= 1 (select |#valid| ULTIMATE.start_main_~n~0.base))) [2020-07-01 13:11:55,452 INFO L268 CegarLoopResult]: For program point L9-4(lines 9 11) no Hoare annotation was computed. [2020-07-01 13:11:55,452 INFO L264 CegarLoopResult]: At program point L7-4(lines 7 13) the Hoare annotation is: (and (= 1 (select |#valid| ULTIMATE.start_main_~j~0.base)) (= 1 (select |#valid| ULTIMATE.start_main_~i~0.base)) (= 4 (select |#length| ULTIMATE.start_main_~i~0.base)) (= 0 ULTIMATE.start_main_~i~0.offset) (= 0 ULTIMATE.start_main_~n~0.offset) (= 4 (select |#length| ULTIMATE.start_main_~n~0.base)) (= (select |#length| ULTIMATE.start_main_~j~0.base) 4) (= 0 ULTIMATE.start_main_~j~0.offset) (= 1 (select |#valid| ULTIMATE.start_main_~n~0.base))) [2020-07-01 13:11:55,452 INFO L268 CegarLoopResult]: For program point L-1(line -1) no Hoare annotation was computed. [2020-07-01 13:11:55,452 INFO L268 CegarLoopResult]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2020-07-01 13:11:55,452 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr17REQUIRES_VIOLATION(line 12) no Hoare annotation was computed. [2020-07-01 13:11:55,452 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr14REQUIRES_VIOLATION(line 12) no Hoare annotation was computed. [2020-07-01 13:11:55,453 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr13REQUIRES_VIOLATION(line 10) no Hoare annotation was computed. [2020-07-01 13:11:55,453 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr16REQUIRES_VIOLATION(line 12) no Hoare annotation was computed. [2020-07-01 13:11:55,453 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr15REQUIRES_VIOLATION(line 12) no Hoare annotation was computed. [2020-07-01 13:11:55,453 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr10REQUIRES_VIOLATION(line 10) no Hoare annotation was computed. [2020-07-01 13:11:55,453 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr9REQUIRES_VIOLATION(line 9) no Hoare annotation was computed. [2020-07-01 13:11:55,453 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr12REQUIRES_VIOLATION(line 10) no Hoare annotation was computed. [2020-07-01 13:11:55,453 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr11REQUIRES_VIOLATION(line 10) no Hoare annotation was computed. [2020-07-01 13:11:55,453 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr6REQUIRES_VIOLATION(line 9) no Hoare annotation was computed. [2020-07-01 13:11:55,454 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr5REQUIRES_VIOLATION(line 8) no Hoare annotation was computed. [2020-07-01 13:11:55,454 INFO L268 CegarLoopResult]: For program point L12(line 12) no Hoare annotation was computed. [2020-07-01 13:11:55,454 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr8REQUIRES_VIOLATION(line 9) no Hoare annotation was computed. [2020-07-01 13:11:55,454 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr7REQUIRES_VIOLATION(line 9) no Hoare annotation was computed. [2020-07-01 13:11:55,454 INFO L268 CegarLoopResult]: For program point L10(line 10) no Hoare annotation was computed. [2020-07-01 13:11:55,454 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr2REQUIRES_VIOLATION(line 7) no Hoare annotation was computed. [2020-07-01 13:11:55,454 INFO L268 CegarLoopResult]: For program point L10-1(line 10) no Hoare annotation was computed. [2020-07-01 13:11:55,454 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr1REQUIRES_VIOLATION(line 7) no Hoare annotation was computed. [2020-07-01 13:11:55,454 INFO L268 CegarLoopResult]: For program point L8(line 8) no Hoare annotation was computed. [2020-07-01 13:11:55,455 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr4REQUIRES_VIOLATION(line 8) no Hoare annotation was computed. [2020-07-01 13:11:55,455 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr3REQUIRES_VIOLATION(line 7) no Hoare annotation was computed. [2020-07-01 13:11:55,455 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr0REQUIRES_VIOLATION(line 7) no Hoare annotation was computed. [2020-07-01 13:11:55,458 INFO L308 ceAbstractionStarter]: Did not count any witness invariants because Icfg is not BoogieIcfg [2020-07-01 13:11:55,468 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 13:11:55,469 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 13:11:55,469 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 13:11:55,476 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 13:11:55,476 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 13:11:55,477 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 13:11:55,478 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 13:11:55,479 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 13:11:55,479 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 13:11:55,480 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 13:11:55,481 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 13:11:55,481 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 13:11:55,483 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 01.07 01:11:55 BasicIcfg [2020-07-01 13:11:55,483 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-07-01 13:11:55,484 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2020-07-01 13:11:55,484 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2020-07-01 13:11:55,487 INFO L275 PluginConnector]: BuchiAutomizer initialized [2020-07-01 13:11:55,488 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-07-01 13:11:55,488 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 01.07 01:11:53" (1/5) ... [2020-07-01 13:11:55,489 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@216056bd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 01.07 01:11:55, skipping insertion in model container [2020-07-01 13:11:55,489 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-07-01 13:11:55,489 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.07 01:11:53" (2/5) ... [2020-07-01 13:11:55,489 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@216056bd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 01.07 01:11:55, skipping insertion in model container [2020-07-01 13:11:55,489 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-07-01 13:11:55,490 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.07 01:11:53" (3/5) ... [2020-07-01 13:11:55,490 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@216056bd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 01.07 01:11:55, skipping insertion in model container [2020-07-01 13:11:55,490 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-07-01 13:11:55,490 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 01.07 01:11:54" (4/5) ... [2020-07-01 13:11:55,491 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@216056bd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 01.07 01:11:55, skipping insertion in model container [2020-07-01 13:11:55,491 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-07-01 13:11:55,491 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 01.07 01:11:55" (5/5) ... [2020-07-01 13:11:55,492 INFO L371 chiAutomizerObserver]: Analyzing ICFG theBenchmark.c_BEv2 [2020-07-01 13:11:55,519 INFO L356 BuchiCegarLoop]: Interprodecural is true [2020-07-01 13:11:55,519 INFO L357 BuchiCegarLoop]: Hoare is true [2020-07-01 13:11:55,519 INFO L358 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2020-07-01 13:11:55,519 INFO L359 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2020-07-01 13:11:55,520 INFO L360 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-07-01 13:11:55,520 INFO L361 BuchiCegarLoop]: Difference is false [2020-07-01 13:11:55,520 INFO L362 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-07-01 13:11:55,520 INFO L365 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2020-07-01 13:11:55,524 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 30 states. [2020-07-01 13:11:55,530 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 10 [2020-07-01 13:11:55,530 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-01 13:11:55,530 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-01 13:11:55,534 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2020-07-01 13:11:55,534 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1] [2020-07-01 13:11:55,535 INFO L424 BuchiCegarLoop]: ======== Iteration 1============ [2020-07-01 13:11:55,535 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 30 states. [2020-07-01 13:11:55,537 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 10 [2020-07-01 13:11:55,537 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-01 13:11:55,537 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-01 13:11:55,537 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2020-07-01 13:11:55,537 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1] [2020-07-01 13:11:55,543 INFO L794 eck$LassoCheckResult]: Stem: 31#ULTIMATE.startENTRYtrue [99] ULTIMATE.startENTRY-->L-1: Formula: (and (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= |v_#valid_1| (store |v_#valid_2| 0 0)) (= |v_#NULL.offset_1| 0)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_2|} OutVars{#NULL.offset=|v_#NULL.offset_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #NULL.base=|v_#NULL.base_1|, #valid=|v_#valid_1|} AuxVars[] AssignedVars[#valid, #NULL.offset, #NULL.base] 13#L-1true [127] L-1-->L7-4: Formula: (let ((.cse1 (store |v_#valid_6| |v_ULTIMATE.start_main_#t~malloc0.base_1| 1))) (let ((.cse0 (store .cse1 |v_ULTIMATE.start_main_#t~malloc1.base_1| 1))) (and (< |v_#StackHeapBarrier_2| |v_ULTIMATE.start_main_#t~malloc2.base_1|) (= v_ULTIMATE.start_main_~j~0.base_1 |v_ULTIMATE.start_main_#t~malloc1.base_1|) (= 0 (select .cse0 |v_ULTIMATE.start_main_#t~malloc2.base_1|)) (= (store .cse0 |v_ULTIMATE.start_main_#t~malloc2.base_1| 1) |v_#valid_3|) (> 0 |v_ULTIMATE.start_main_#t~malloc1.base_1|) (= 0 |v_ULTIMATE.start_main_#t~malloc2.offset_1|) (< 0 |v_ULTIMATE.start_main_#t~malloc0.base_1|) (< 0 |v_ULTIMATE.start_main_#t~malloc2.base_1|) (= 0 |v_ULTIMATE.start_main_#t~malloc0.offset_1|) (= v_ULTIMATE.start_main_~i~0.base_1 |v_ULTIMATE.start_main_#t~malloc0.base_1|) (= v_ULTIMATE.start_main_~i~0.offset_1 |v_ULTIMATE.start_main_#t~malloc0.offset_1|) (= v_ULTIMATE.start_main_~n~0.offset_1 |v_ULTIMATE.start_main_#t~malloc2.offset_1|) (= v_ULTIMATE.start_main_~n~0.base_1 |v_ULTIMATE.start_main_#t~malloc2.base_1|) (= 0 |v_ULTIMATE.start_main_#t~malloc1.offset_1|) (< |v_#StackHeapBarrier_2| |v_ULTIMATE.start_main_#t~malloc1.base_1|) (< |v_#StackHeapBarrier_2| |v_ULTIMATE.start_main_#t~malloc0.base_1|) (= 0 (select |v_#valid_6| |v_ULTIMATE.start_main_#t~malloc0.base_1|)) (= v_ULTIMATE.start_main_~j~0.offset_1 |v_ULTIMATE.start_main_#t~malloc1.offset_1|) (= 0 (select .cse1 |v_ULTIMATE.start_main_#t~malloc1.base_1|)) (= |v_#length_1| (store (store (store |v_#length_4| |v_ULTIMATE.start_main_#t~malloc0.base_1| 4) |v_ULTIMATE.start_main_#t~malloc1.base_1| 4) |v_ULTIMATE.start_main_#t~malloc2.base_1| 4))))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_2|, #length=|v_#length_4|, #valid=|v_#valid_6|} OutVars{ULTIMATE.start_main_~i~0.offset=v_ULTIMATE.start_main_~i~0.offset_1, ULTIMATE.start_main_#t~malloc1.offset=|v_ULTIMATE.start_main_#t~malloc1.offset_1|, ULTIMATE.start_main_~i~0.base=v_ULTIMATE.start_main_~i~0.base_1, ULTIMATE.start_main_#t~malloc0.offset=|v_ULTIMATE.start_main_#t~malloc0.offset_1|, ULTIMATE.start_main_~n~0.offset=v_ULTIMATE.start_main_~n~0.offset_1, ULTIMATE.start_main_#t~malloc0.base=|v_ULTIMATE.start_main_#t~malloc0.base_1|, ULTIMATE.start_main_#t~malloc1.base=|v_ULTIMATE.start_main_#t~malloc1.base_1|, ULTIMATE.start_main_~j~0.offset=v_ULTIMATE.start_main_~j~0.offset_1, #StackHeapBarrier=|v_#StackHeapBarrier_2|, ULTIMATE.start_main_#t~mem8=|v_ULTIMATE.start_main_#t~mem8_1|, ULTIMATE.start_main_#t~mem7=|v_ULTIMATE.start_main_#t~mem7_1|, ULTIMATE.start_main_#t~malloc2.base=|v_ULTIMATE.start_main_#t~malloc2.base_1|, ULTIMATE.start_main_#t~malloc2.offset=|v_ULTIMATE.start_main_#t~malloc2.offset_1|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_1|, #valid=|v_#valid_3|, ULTIMATE.start_main_~j~0.base=v_ULTIMATE.start_main_~j~0.base_1, #length=|v_#length_1|, ULTIMATE.start_main_#t~mem6=|v_ULTIMATE.start_main_#t~mem6_1|, ULTIMATE.start_main_#t~mem5=|v_ULTIMATE.start_main_#t~mem5_1|, ULTIMATE.start_main_#t~mem4=|v_ULTIMATE.start_main_#t~mem4_1|, ULTIMATE.start_main_~n~0.base=v_ULTIMATE.start_main_~n~0.base_1, ULTIMATE.start_main_#t~mem3=|v_ULTIMATE.start_main_#t~mem3_1|} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0.offset, ULTIMATE.start_main_#t~malloc1.offset, ULTIMATE.start_main_~i~0.base, ULTIMATE.start_main_#t~malloc0.offset, ULTIMATE.start_main_~n~0.offset, ULTIMATE.start_main_#t~malloc0.base, ULTIMATE.start_main_#t~malloc1.base, ULTIMATE.start_main_~j~0.offset, ULTIMATE.start_main_#t~mem8, ULTIMATE.start_main_#t~mem7, ULTIMATE.start_main_#t~malloc2.base, ULTIMATE.start_main_#t~malloc2.offset, ULTIMATE.start_main_#res, #valid, ULTIMATE.start_main_~j~0.base, #length, ULTIMATE.start_main_#t~mem6, ULTIMATE.start_main_#t~mem5, ULTIMATE.start_main_#t~mem4, ULTIMATE.start_main_~n~0.base, ULTIMATE.start_main_#t~mem3] 20#L7-4true [2020-07-01 13:11:55,544 INFO L796 eck$LassoCheckResult]: Loop: 20#L7-4true [87] L7-4-->L7-1: Formula: (and (<= 0 v_ULTIMATE.start_main_~i~0.offset_4) (= |v_ULTIMATE.start_main_#t~mem3_2| (select (select |v_#memory_int_1| v_ULTIMATE.start_main_~i~0.base_4) v_ULTIMATE.start_main_~i~0.offset_4)) (<= (+ v_ULTIMATE.start_main_~i~0.offset_4 4) (select |v_#length_5| v_ULTIMATE.start_main_~i~0.base_4)) (= 1 (select |v_#valid_7| v_ULTIMATE.start_main_~i~0.base_4))) InVars {ULTIMATE.start_main_~i~0.offset=v_ULTIMATE.start_main_~i~0.offset_4, #memory_int=|v_#memory_int_1|, ULTIMATE.start_main_~i~0.base=v_ULTIMATE.start_main_~i~0.base_4, #length=|v_#length_5|, #valid=|v_#valid_7|} OutVars{ULTIMATE.start_main_~i~0.offset=v_ULTIMATE.start_main_~i~0.offset_4, ULTIMATE.start_main_~i~0.base=v_ULTIMATE.start_main_~i~0.base_4, #valid=|v_#valid_7|, #memory_int=|v_#memory_int_1|, #length=|v_#length_5|, ULTIMATE.start_main_#t~mem3=|v_ULTIMATE.start_main_#t~mem3_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem3] 5#L7-1true [170] L7-1-->L8: Formula: (and (< |v_ULTIMATE.start_main_#t~mem3_14| (select (select |v_#memory_int_17| v_ULTIMATE.start_main_~n~0.base_7) v_ULTIMATE.start_main_~n~0.offset_6)) (<= 0 v_ULTIMATE.start_main_~n~0.offset_6) (<= (+ v_ULTIMATE.start_main_~n~0.offset_6 4) (select |v_#length_25| v_ULTIMATE.start_main_~n~0.base_7)) (= 1 (select |v_#valid_37| v_ULTIMATE.start_main_~n~0.base_7))) InVars {#valid=|v_#valid_37|, #memory_int=|v_#memory_int_17|, #length=|v_#length_25|, ULTIMATE.start_main_~n~0.offset=v_ULTIMATE.start_main_~n~0.offset_6, ULTIMATE.start_main_#t~mem3=|v_ULTIMATE.start_main_#t~mem3_14|, ULTIMATE.start_main_~n~0.base=v_ULTIMATE.start_main_~n~0.base_7} OutVars{#valid=|v_#valid_37|, #memory_int=|v_#memory_int_17|, #length=|v_#length_25|, ULTIMATE.start_main_~n~0.offset=v_ULTIMATE.start_main_~n~0.offset_6, ULTIMATE.start_main_#t~mem4=|v_ULTIMATE.start_main_#t~mem4_13|, ULTIMATE.start_main_#t~mem3=|v_ULTIMATE.start_main_#t~mem3_13|, ULTIMATE.start_main_~n~0.base=v_ULTIMATE.start_main_~n~0.base_7} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem4, ULTIMATE.start_main_#t~mem3] 26#L8true [92] L8-->L9-3: Formula: (and (= |v_#memory_int_3| (store |v_#memory_int_4| v_ULTIMATE.start_main_~j~0.base_4 (store (select |v_#memory_int_4| v_ULTIMATE.start_main_~j~0.base_4) v_ULTIMATE.start_main_~j~0.offset_4 0))) (<= (+ v_ULTIMATE.start_main_~j~0.offset_4 4) (select |v_#length_9| v_ULTIMATE.start_main_~j~0.base_4)) (<= 0 v_ULTIMATE.start_main_~j~0.offset_4) (= 1 (select |v_#valid_11| v_ULTIMATE.start_main_~j~0.base_4))) InVars {#memory_int=|v_#memory_int_4|, ULTIMATE.start_main_~j~0.base=v_ULTIMATE.start_main_~j~0.base_4, ULTIMATE.start_main_~j~0.offset=v_ULTIMATE.start_main_~j~0.offset_4, #length=|v_#length_9|, #valid=|v_#valid_11|} OutVars{#memory_int=|v_#memory_int_3|, ULTIMATE.start_main_~j~0.base=v_ULTIMATE.start_main_~j~0.base_4, ULTIMATE.start_main_~j~0.offset=v_ULTIMATE.start_main_~j~0.offset_4, #length=|v_#length_9|, #valid=|v_#valid_11|} AuxVars[] AssignedVars[#memory_int] 7#L9-3true [69] L9-3-->L9: Formula: (and (<= 0 v_ULTIMATE.start_main_~j~0.offset_6) (<= (+ v_ULTIMATE.start_main_~j~0.offset_6 4) (select |v_#length_11| v_ULTIMATE.start_main_~j~0.base_7)) (= 1 (select |v_#valid_13| v_ULTIMATE.start_main_~j~0.base_7)) (= |v_ULTIMATE.start_main_#t~mem5_2| (select (select |v_#memory_int_5| v_ULTIMATE.start_main_~j~0.base_7) v_ULTIMATE.start_main_~j~0.offset_6))) InVars {#memory_int=|v_#memory_int_5|, ULTIMATE.start_main_~j~0.base=v_ULTIMATE.start_main_~j~0.base_7, ULTIMATE.start_main_~j~0.offset=v_ULTIMATE.start_main_~j~0.offset_6, #length=|v_#length_11|, #valid=|v_#valid_13|} OutVars{ULTIMATE.start_main_~j~0.offset=v_ULTIMATE.start_main_~j~0.offset_6, #valid=|v_#valid_13|, #memory_int=|v_#memory_int_5|, ULTIMATE.start_main_~j~0.base=v_ULTIMATE.start_main_~j~0.base_7, #length=|v_#length_11|, ULTIMATE.start_main_#t~mem5=|v_ULTIMATE.start_main_#t~mem5_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem5] 11#L9true [74] L9-->L9-1: Formula: (and (= |v_ULTIMATE.start_main_#t~mem6_2| (select (select |v_#memory_int_6| v_ULTIMATE.start_main_~i~0.base_7) v_ULTIMATE.start_main_~i~0.offset_6)) (<= (+ v_ULTIMATE.start_main_~i~0.offset_6 4) (select |v_#length_13| v_ULTIMATE.start_main_~i~0.base_7)) (= 1 (select |v_#valid_15| v_ULTIMATE.start_main_~i~0.base_7)) (<= 0 v_ULTIMATE.start_main_~i~0.offset_6)) InVars {ULTIMATE.start_main_~i~0.offset=v_ULTIMATE.start_main_~i~0.offset_6, #memory_int=|v_#memory_int_6|, ULTIMATE.start_main_~i~0.base=v_ULTIMATE.start_main_~i~0.base_7, #length=|v_#length_13|, #valid=|v_#valid_15|} OutVars{ULTIMATE.start_main_~i~0.offset=v_ULTIMATE.start_main_~i~0.offset_6, ULTIMATE.start_main_~i~0.base=v_ULTIMATE.start_main_~i~0.base_7, #valid=|v_#valid_15|, #memory_int=|v_#memory_int_6|, #length=|v_#length_13|, ULTIMATE.start_main_#t~mem6=|v_ULTIMATE.start_main_#t~mem6_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem6] 9#L9-1true [116] L9-1-->L9-4: Formula: (> |v_ULTIMATE.start_main_#t~mem5_4| |v_ULTIMATE.start_main_#t~mem6_4|) InVars {ULTIMATE.start_main_#t~mem6=|v_ULTIMATE.start_main_#t~mem6_4|, ULTIMATE.start_main_#t~mem5=|v_ULTIMATE.start_main_#t~mem5_4|} OutVars{ULTIMATE.start_main_#t~mem6=|v_ULTIMATE.start_main_#t~mem6_3|, ULTIMATE.start_main_#t~mem5=|v_ULTIMATE.start_main_#t~mem5_3|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem6, ULTIMATE.start_main_#t~mem5] 4#L9-4true [62] L9-4-->L12: Formula: (and (= |v_ULTIMATE.start_main_#t~mem8_2| (select (select |v_#memory_int_10| v_ULTIMATE.start_main_~i~0.base_10) v_ULTIMATE.start_main_~i~0.offset_8)) (= 1 (select |v_#valid_21| v_ULTIMATE.start_main_~i~0.base_10)) (<= (+ v_ULTIMATE.start_main_~i~0.offset_8 4) (select |v_#length_19| v_ULTIMATE.start_main_~i~0.base_10)) (<= 0 v_ULTIMATE.start_main_~i~0.offset_8)) InVars {ULTIMATE.start_main_~i~0.offset=v_ULTIMATE.start_main_~i~0.offset_8, #memory_int=|v_#memory_int_10|, ULTIMATE.start_main_~i~0.base=v_ULTIMATE.start_main_~i~0.base_10, #length=|v_#length_19|, #valid=|v_#valid_21|} OutVars{ULTIMATE.start_main_~i~0.offset=v_ULTIMATE.start_main_~i~0.offset_8, ULTIMATE.start_main_#t~mem8=|v_ULTIMATE.start_main_#t~mem8_2|, ULTIMATE.start_main_~i~0.base=v_ULTIMATE.start_main_~i~0.base_10, #valid=|v_#valid_21|, #memory_int=|v_#memory_int_10|, #length=|v_#length_19|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem8] 18#L12true [169] L12-->L7-4: Formula: (and (= 1 (select |v_#valid_36| v_ULTIMATE.start_main_~i~0.base_16)) (= (store |v_#memory_int_16| v_ULTIMATE.start_main_~i~0.base_16 (store (select |v_#memory_int_16| v_ULTIMATE.start_main_~i~0.base_16) v_ULTIMATE.start_main_~i~0.offset_12 (+ |v_ULTIMATE.start_main_#t~mem8_6| 1))) |v_#memory_int_15|) (<= 0 v_ULTIMATE.start_main_~i~0.offset_12) (<= (+ v_ULTIMATE.start_main_~i~0.offset_12 4) (select |v_#length_24| v_ULTIMATE.start_main_~i~0.base_16))) InVars {ULTIMATE.start_main_~i~0.offset=v_ULTIMATE.start_main_~i~0.offset_12, ULTIMATE.start_main_#t~mem8=|v_ULTIMATE.start_main_#t~mem8_6|, ULTIMATE.start_main_~i~0.base=v_ULTIMATE.start_main_~i~0.base_16, #valid=|v_#valid_36|, #memory_int=|v_#memory_int_16|, #length=|v_#length_24|} OutVars{ULTIMATE.start_main_~i~0.offset=v_ULTIMATE.start_main_~i~0.offset_12, ULTIMATE.start_main_#t~mem8=|v_ULTIMATE.start_main_#t~mem8_5|, ULTIMATE.start_main_~i~0.base=v_ULTIMATE.start_main_~i~0.base_16, #valid=|v_#valid_36|, #memory_int=|v_#memory_int_15|, #length=|v_#length_24|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem8, #memory_int] 20#L7-4true [2020-07-01 13:11:55,545 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 13:11:55,545 INFO L82 PathProgramCache]: Analyzing trace with hash 4157, now seen corresponding path program 1 times [2020-07-01 13:11:55,545 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 13:11:55,545 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1085938166] [2020-07-01 13:11:55,545 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 13:11:55,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 13:11:55,562 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-01 13:11:55,562 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1085938166] [2020-07-01 13:11:55,562 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-01 13:11:55,562 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2020-07-01 13:11:55,563 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [646472119] [2020-07-01 13:11:55,563 INFO L799 eck$LassoCheckResult]: stem already infeasible [2020-07-01 13:11:55,564 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 13:11:55,564 INFO L82 PathProgramCache]: Analyzing trace with hash -1550084622, now seen corresponding path program 1 times [2020-07-01 13:11:55,564 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 13:11:55,564 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [878836568] [2020-07-01 13:11:55,564 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 13:11:55,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-01 13:11:55,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-01 13:11:55,609 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-01 13:11:55,736 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-01 13:11:55,736 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-01 13:11:55,737 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-01 13:11:55,737 INFO L87 Difference]: Start difference. First operand 30 states. Second operand 3 states. [2020-07-01 13:11:55,813 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-01 13:11:55,813 INFO L93 Difference]: Finished difference Result 30 states and 49 transitions. [2020-07-01 13:11:55,813 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-01 13:11:55,816 FATAL L? ?]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer has thrown an exception: java.lang.AssertionError: unknown kind of automaton at de.uni_freiburg.informatik.ultimate.automata.AutomatonDefinitionPrinter.printAutomaton(AutomatonDefinitionPrinter.java:349) at de.uni_freiburg.informatik.ultimate.automata.AutomatonDefinitionPrinter.toString(AutomatonDefinitionPrinter.java:186) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.TermcompProofBenchmark.reportFiniteModule(TermcompProofBenchmark.java:61) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiCegarLoop.refineFinite(BuchiCegarLoop.java:978) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiCegarLoop.iterate(BuchiCegarLoop.java:532) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver.doTerminationAnalysis(BuchiAutomizerObserver.java:141) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver.finish(BuchiAutomizerObserver.java:380) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:317) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:55) [2020-07-01 13:11:55,820 INFO L168 Benchmark]: Toolchain (without parser) took 2536.43 ms. Allocated memory was 649.6 MB in the beginning and 688.9 MB in the end (delta: 39.3 MB). Free memory was 561.3 MB in the beginning and 433.0 MB in the end (delta: 128.3 MB). Peak memory consumption was 167.6 MB. Max. memory is 50.3 GB. [2020-07-01 13:11:55,821 INFO L168 Benchmark]: CDTParser took 0.18 ms. Allocated memory is still 649.6 MB. Free memory is still 583.2 MB. There was no memory consumed. Max. memory is 50.3 GB. [2020-07-01 13:11:55,822 INFO L168 Benchmark]: CACSL2BoogieTranslator took 296.49 ms. Allocated memory was 649.6 MB in the beginning and 688.9 MB in the end (delta: 39.3 MB). Free memory was 561.3 MB in the beginning and 651.5 MB in the end (delta: -90.2 MB). Peak memory consumption was 28.1 MB. Max. memory is 50.3 GB. [2020-07-01 13:11:55,822 INFO L168 Benchmark]: Boogie Procedure Inliner took 39.52 ms. Allocated memory is still 688.9 MB. Free memory was 651.5 MB in the beginning and 649.2 MB in the end (delta: 2.3 MB). Peak memory consumption was 2.3 MB. Max. memory is 50.3 GB. [2020-07-01 13:11:55,823 INFO L168 Benchmark]: Boogie Preprocessor took 24.38 ms. Allocated memory is still 688.9 MB. Free memory was 649.2 MB in the beginning and 648.1 MB in the end (delta: 1.1 MB). Peak memory consumption was 1.1 MB. Max. memory is 50.3 GB. [2020-07-01 13:11:55,823 INFO L168 Benchmark]: RCFGBuilder took 341.25 ms. Allocated memory is still 688.9 MB. Free memory was 648.1 MB in the beginning and 624.9 MB in the end (delta: 23.2 MB). Peak memory consumption was 23.2 MB. Max. memory is 50.3 GB. [2020-07-01 13:11:55,824 INFO L168 Benchmark]: BlockEncodingV2 took 130.81 ms. Allocated memory is still 688.9 MB. Free memory was 623.8 MB in the beginning and 614.1 MB in the end (delta: 9.7 MB). Peak memory consumption was 9.7 MB. Max. memory is 50.3 GB. [2020-07-01 13:11:55,824 INFO L168 Benchmark]: TraceAbstraction took 1363.46 ms. Allocated memory is still 688.9 MB. Free memory was 614.1 MB in the beginning and 471.6 MB in the end (delta: 142.5 MB). Peak memory consumption was 142.5 MB. Max. memory is 50.3 GB. [2020-07-01 13:11:55,825 INFO L168 Benchmark]: BuchiAutomizer took 334.29 ms. Allocated memory is still 688.9 MB. Free memory was 470.5 MB in the beginning and 433.0 MB in the end (delta: 37.5 MB). Peak memory consumption was 37.5 MB. Max. memory is 50.3 GB. [2020-07-01 13:11:55,829 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.plugins.blockencoding: - StatisticsResult: Initial Icfg 37 locations, 40 edges - StatisticsResult: Encoded RCFG 30 locations, 56 edges * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.18 ms. Allocated memory is still 649.6 MB. Free memory is still 583.2 MB. There was no memory consumed. Max. memory is 50.3 GB. * CACSL2BoogieTranslator took 296.49 ms. Allocated memory was 649.6 MB in the beginning and 688.9 MB in the end (delta: 39.3 MB). Free memory was 561.3 MB in the beginning and 651.5 MB in the end (delta: -90.2 MB). Peak memory consumption was 28.1 MB. Max. memory is 50.3 GB. * Boogie Procedure Inliner took 39.52 ms. Allocated memory is still 688.9 MB. Free memory was 651.5 MB in the beginning and 649.2 MB in the end (delta: 2.3 MB). Peak memory consumption was 2.3 MB. Max. memory is 50.3 GB. * Boogie Preprocessor took 24.38 ms. Allocated memory is still 688.9 MB. Free memory was 649.2 MB in the beginning and 648.1 MB in the end (delta: 1.1 MB). Peak memory consumption was 1.1 MB. Max. memory is 50.3 GB. * RCFGBuilder took 341.25 ms. Allocated memory is still 688.9 MB. Free memory was 648.1 MB in the beginning and 624.9 MB in the end (delta: 23.2 MB). Peak memory consumption was 23.2 MB. Max. memory is 50.3 GB. * BlockEncodingV2 took 130.81 ms. Allocated memory is still 688.9 MB. Free memory was 623.8 MB in the beginning and 614.1 MB in the end (delta: 9.7 MB). Peak memory consumption was 9.7 MB. Max. memory is 50.3 GB. * TraceAbstraction took 1363.46 ms. Allocated memory is still 688.9 MB. Free memory was 614.1 MB in the beginning and 471.6 MB in the end (delta: 142.5 MB). Peak memory consumption was 142.5 MB. Max. memory is 50.3 GB. * BuchiAutomizer took 334.29 ms. Allocated memory is still 688.9 MB. Free memory was 470.5 MB in the beginning and 433.0 MB in the end (delta: 37.5 MB). Peak memory consumption was 37.5 MB. Max. memory is 50.3 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 10]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 7]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 10]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 7]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 10]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 12]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 8]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 12]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 7]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 10]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 7]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 9]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 12]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 9]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 12]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 8]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 9]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 9]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - AllSpecificationsHoldResult: All specifications hold 18 specifications checked. All of them hold - InvariantResult [Line: 8]: Loop Invariant [2020-07-01 13:11:55,839 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 13:11:55,839 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 13:11:55,839 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 13:11:55,840 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 13:11:55,840 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 13:11:55,840 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length Derived loop invariant: (((((((1 == \valid[j] && 1 == \valid[i]) && 4 == unknown-#length-unknown[i]) && 0 == i) && 0 == n) && 4 == unknown-#length-unknown[n]) && unknown-#length-unknown[j] == 4) && 0 == j) && 1 == \valid[n] - InvariantResult [Line: 7]: Loop Invariant [2020-07-01 13:11:55,841 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 13:11:55,841 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 13:11:55,842 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 13:11:55,842 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 13:11:55,843 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 13:11:55,843 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length Derived loop invariant: (((((((1 == \valid[j] && 1 == \valid[i]) && 4 == unknown-#length-unknown[i]) && 0 == i) && 0 == n) && 4 == unknown-#length-unknown[n]) && unknown-#length-unknown[j] == 4) && 0 == j) && 1 == \valid[n] - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 30 locations, 18 error locations. Started 1 CEGAR loops. VerificationResult: SAFE, OverallTime: 1.1s, OverallIterations: 7, TraceHistogramMax: 1, AutomataDifference: 0.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 19 SDtfs, 163 SDslu, 4 SDs, 0 SdLazy, 218 SolverSat, 78 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.4s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 14 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=30occurred in iteration=0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 7 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 2 LocationsWithAnnotation, 2 PreInvPairs, 2 NumberOfFragments, 80 HoareAnnotationTreeSize, 2 FomulaSimplifications, 0 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 2 FomulaSimplificationsInter, 0 FormulaSimplificationTreeSizeReductionInter, 0.0s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.2s InterpolantComputationTime, 29 NumberOfCodeBlocks, 29 NumberOfCodeBlocksAsserted, 7 NumberOfCheckSat, 22 ConstructedInterpolants, 0 QuantifiedInterpolants, 338 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 7 InterpolantComputations, 7 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer: - ExceptionOrErrorResult: AssertionError: unknown kind of automaton de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer: AssertionError: unknown kind of automaton: de.uni_freiburg.informatik.ultimate.automata.AutomatonDefinitionPrinter.printAutomaton(AutomatonDefinitionPrinter.java:349) RESULT: Ultimate could not prove your program: Toolchain returned no result. !SESSION 2020-07-01 13:11:50.012 ----------------------------------------------- eclipse.buildId=unknown java.version=1.8.0_242 java.vendor=Oracle Corporation BootLoader constants: OS=linux, ARCH=x86_64, WS=gtk, NL=en_US Framework arguments: -tc ./../AutomizerAndBuchiAutomizerCInlineWithBlockEncoding.xml -s ./../termcomp2017.epf -i /export/starexec/sandbox2/benchmark/theBenchmark.c Command-line arguments: -os linux -ws gtk -arch x86_64 -consoleLog -data @user.home/.ultimate -tc ./../AutomizerAndBuchiAutomizerCInlineWithBlockEncoding.xml -s ./../termcomp2017.epf -data /export/starexec/sandbox2/tmp/BenchExec_run_LYV_BQ/tmp -i /export/starexec/sandbox2/benchmark/theBenchmark.c !ENTRY org.eclipse.core.resources 2 10035 2020-07-01 13:11:56.069 !MESSAGE The workspace will exit with unsaved changes in this session. Received shutdown request... Ultimate: GTK+ Version Check