/export/starexec/sandbox/solver/bin/starexec_run_default /export/starexec/sandbox/benchmark/theBenchmark.c /export/starexec/sandbox/output/output_files -------------------------------------------------------------------------------- Ultimate: Cannot open display: This is Ultimate 0.1.25-34f2e62 [2020-07-01 12:51:37,270 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-07-01 12:51:37,272 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-07-01 12:51:37,283 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-07-01 12:51:37,284 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-07-01 12:51:37,285 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-07-01 12:51:37,286 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-07-01 12:51:37,287 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-07-01 12:51:37,289 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-07-01 12:51:37,290 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-07-01 12:51:37,291 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-07-01 12:51:37,292 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-07-01 12:51:37,292 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-07-01 12:51:37,293 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-07-01 12:51:37,294 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-07-01 12:51:37,295 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-07-01 12:51:37,295 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-07-01 12:51:37,296 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-07-01 12:51:37,298 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-07-01 12:51:37,300 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-07-01 12:51:37,301 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-07-01 12:51:37,302 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-07-01 12:51:37,303 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-07-01 12:51:37,304 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-07-01 12:51:37,306 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-07-01 12:51:37,306 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-07-01 12:51:37,306 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-07-01 12:51:37,307 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-07-01 12:51:37,308 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-07-01 12:51:37,309 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-07-01 12:51:37,309 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-07-01 12:51:37,309 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-07-01 12:51:37,310 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-07-01 12:51:37,311 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-07-01 12:51:37,312 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-07-01 12:51:37,312 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-07-01 12:51:37,312 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-07-01 12:51:37,313 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-07-01 12:51:37,313 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-07-01 12:51:37,314 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-07-01 12:51:37,314 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-07-01 12:51:37,315 INFO L101 SettingsManager]: Beginning loading settings from /export/starexec/sandbox/solver/bin/./../termcomp2017.epf [2020-07-01 12:51:37,329 INFO L113 SettingsManager]: Loading preferences was successful [2020-07-01 12:51:37,329 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-07-01 12:51:37,330 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-07-01 12:51:37,331 INFO L138 SettingsManager]: * Rewrite not-equals=true [2020-07-01 12:51:37,331 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-07-01 12:51:37,331 INFO L138 SettingsManager]: * Minimize states using LBE with the strategy=SINGLE [2020-07-01 12:51:37,331 INFO L138 SettingsManager]: * Use SBE=true [2020-07-01 12:51:37,331 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2020-07-01 12:51:37,332 INFO L138 SettingsManager]: * Use old map elimination=false [2020-07-01 12:51:37,332 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2020-07-01 12:51:37,332 INFO L138 SettingsManager]: * Buchi interpolant automaton construction strategy=DANDELION [2020-07-01 12:51:37,332 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2020-07-01 12:51:37,332 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2020-07-01 12:51:37,332 INFO L138 SettingsManager]: * Construct termination proof for TermComp=true [2020-07-01 12:51:37,333 INFO L138 SettingsManager]: * Command for external solver (GNTA synthesis)=z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 [2020-07-01 12:51:37,333 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-07-01 12:51:37,333 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2020-07-01 12:51:37,333 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-07-01 12:51:37,333 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-07-01 12:51:37,334 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2020-07-01 12:51:37,334 INFO L138 SettingsManager]: * How to treat unsigned ints differently from normal ones=IGNORE [2020-07-01 12:51:37,334 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-07-01 12:51:37,334 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-07-01 12:51:37,334 INFO L138 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2020-07-01 12:51:37,334 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:5000 [2020-07-01 12:51:37,335 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-07-01 12:51:37,335 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-07-01 12:51:37,335 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-07-01 12:51:37,335 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-07-01 12:51:37,499 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2020-07-01 12:51:37,514 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-07-01 12:51:37,517 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-07-01 12:51:37,518 INFO L271 PluginConnector]: Initializing CDTParser... [2020-07-01 12:51:37,519 INFO L275 PluginConnector]: CDTParser initialized [2020-07-01 12:51:37,520 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /export/starexec/sandbox/benchmark/theBenchmark.c [2020-07-01 12:51:37,581 INFO L220 CDTParser]: Created temporary CDT project at /export/starexec/sandbox/tmp/BenchExec_run_4xuw8K/tmp/e0adc8da56e04a22a79f27517aba196e/FLAG4b17c288e [2020-07-01 12:51:37,910 INFO L306 CDTParser]: Found 1 translation units. [2020-07-01 12:51:37,911 INFO L160 CDTParser]: Scanning /export/starexec/sandbox/benchmark/theBenchmark.c [2020-07-01 12:51:37,911 WARN L117 ultiparseSymbolTable]: System include stdlib.h could not be resolved by CDT -- only built-in system includes are available. [2020-07-01 12:51:37,918 INFO L349 CDTParser]: About to delete temporary CDT project at /export/starexec/sandbox/tmp/BenchExec_run_4xuw8K/tmp/e0adc8da56e04a22a79f27517aba196e/FLAG4b17c288e [2020-07-01 12:51:38,313 INFO L357 CDTParser]: Successfully deleted /export/starexec/sandbox/tmp/BenchExec_run_4xuw8K/tmp/e0adc8da56e04a22a79f27517aba196e [2020-07-01 12:51:38,324 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-07-01 12:51:38,326 INFO L131 ToolchainWalker]: Walking toolchain with 7 elements. [2020-07-01 12:51:38,327 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-07-01 12:51:38,327 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-07-01 12:51:38,331 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-07-01 12:51:38,332 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 01.07 12:51:38" (1/1) ... [2020-07-01 12:51:38,335 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2db9975e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.07 12:51:38, skipping insertion in model container [2020-07-01 12:51:38,335 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 01.07 12:51:38" (1/1) ... [2020-07-01 12:51:38,344 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-07-01 12:51:38,361 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-07-01 12:51:38,595 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-01 12:51:38,607 INFO L203 MainTranslator]: Completed pre-run [2020-07-01 12:51:38,624 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-01 12:51:38,640 INFO L208 MainTranslator]: Completed translation [2020-07-01 12:51:38,640 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.07 12:51:38 WrapperNode [2020-07-01 12:51:38,640 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-07-01 12:51:38,641 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-07-01 12:51:38,641 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-07-01 12:51:38,641 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-07-01 12:51:38,651 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.07 12:51:38" (1/1) ... [2020-07-01 12:51:38,660 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.07 12:51:38" (1/1) ... [2020-07-01 12:51:38,682 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-07-01 12:51:38,683 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-07-01 12:51:38,683 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-07-01 12:51:38,683 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-07-01 12:51:38,692 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.07 12:51:38" (1/1) ... [2020-07-01 12:51:38,693 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.07 12:51:38" (1/1) ... [2020-07-01 12:51:38,694 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.07 12:51:38" (1/1) ... [2020-07-01 12:51:38,695 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.07 12:51:38" (1/1) ... [2020-07-01 12:51:38,699 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.07 12:51:38" (1/1) ... [2020-07-01 12:51:38,704 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.07 12:51:38" (1/1) ... [2020-07-01 12:51:38,705 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.07 12:51:38" (1/1) ... [2020-07-01 12:51:38,707 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-07-01 12:51:38,708 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-07-01 12:51:38,708 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-07-01 12:51:38,708 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-07-01 12:51:38,709 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.07 12:51:38" (1/1) ... No working directory specified, using /export/starexec/sandbox/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 12:51:38,782 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-07-01 12:51:38,783 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-07-01 12:51:38,783 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-07-01 12:51:38,783 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2020-07-01 12:51:38,783 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-07-01 12:51:38,783 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-07-01 12:51:39,082 INFO L290 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-07-01 12:51:39,082 INFO L295 CfgBuilder]: Removed 7 assume(true) statements. [2020-07-01 12:51:39,086 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.07 12:51:39 BoogieIcfgContainer [2020-07-01 12:51:39,087 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-07-01 12:51:39,087 INFO L113 PluginConnector]: ------------------------BlockEncodingV2---------------------------- [2020-07-01 12:51:39,087 INFO L271 PluginConnector]: Initializing BlockEncodingV2... [2020-07-01 12:51:39,089 INFO L275 PluginConnector]: BlockEncodingV2 initialized [2020-07-01 12:51:39,090 INFO L185 PluginConnector]: Executing the observer BlockEncodingObserver from plugin BlockEncodingV2 for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.07 12:51:39" (1/1) ... [2020-07-01 12:51:39,106 INFO L313 BlockEncoder]: Initial Icfg 54 locations, 56 edges [2020-07-01 12:51:39,108 INFO L258 BlockEncoder]: Using Remove infeasible edges [2020-07-01 12:51:39,109 INFO L263 BlockEncoder]: Using Maximize final states [2020-07-01 12:51:39,109 INFO L270 BlockEncoder]: Using Minimize states even if more edges are added than removed.=false [2020-07-01 12:51:39,109 INFO L276 BlockEncoder]: Using Minimize states using LBE with the strategy=SINGLE [2020-07-01 12:51:39,111 INFO L296 BlockEncoder]: Using Remove sink states [2020-07-01 12:51:39,115 INFO L171 BlockEncoder]: Using Apply optimizations until nothing changes=true [2020-07-01 12:51:39,115 INFO L179 BlockEncoder]: Using Rewrite not-equals [2020-07-01 12:51:39,141 INFO L185 BlockEncoder]: Using Use SBE [2020-07-01 12:51:39,179 INFO L200 BlockEncoder]: SBE split 30 edges [2020-07-01 12:51:39,184 INFO L70 emoveInfeasibleEdges]: Removed 1 edges and 0 locations because of local infeasibility [2020-07-01 12:51:39,186 INFO L71 MaximizeFinalStates]: 0 new accepting states [2020-07-01 12:51:39,215 INFO L100 BaseMinimizeStates]: Removed 14 edges and 7 locations by large block encoding [2020-07-01 12:51:39,218 INFO L70 RemoveSinkStates]: Removed 1 edges and 1 locations by removing sink states [2020-07-01 12:51:39,219 INFO L70 emoveInfeasibleEdges]: Removed 0 edges and 0 locations because of local infeasibility [2020-07-01 12:51:39,220 INFO L71 MaximizeFinalStates]: 0 new accepting states [2020-07-01 12:51:39,220 INFO L100 BaseMinimizeStates]: Removed 0 edges and 0 locations by large block encoding [2020-07-01 12:51:39,221 INFO L70 RemoveSinkStates]: Removed 0 edges and 0 locations by removing sink states [2020-07-01 12:51:39,221 INFO L313 BlockEncoder]: Encoded RCFG 46 locations, 83 edges [2020-07-01 12:51:39,222 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 01.07 12:51:39 BasicIcfg [2020-07-01 12:51:39,222 INFO L132 PluginConnector]: ------------------------ END BlockEncodingV2---------------------------- [2020-07-01 12:51:39,223 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-07-01 12:51:39,223 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-07-01 12:51:39,227 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-07-01 12:51:39,227 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 01.07 12:51:38" (1/4) ... [2020-07-01 12:51:39,228 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@65c83a0b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 01.07 12:51:39, skipping insertion in model container [2020-07-01 12:51:39,228 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.07 12:51:38" (2/4) ... [2020-07-01 12:51:39,229 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@65c83a0b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 01.07 12:51:39, skipping insertion in model container [2020-07-01 12:51:39,229 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.07 12:51:39" (3/4) ... [2020-07-01 12:51:39,229 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@65c83a0b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 01.07 12:51:39, skipping insertion in model container [2020-07-01 12:51:39,229 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 01.07 12:51:39" (4/4) ... [2020-07-01 12:51:39,231 INFO L109 eAbstractionObserver]: Analyzing ICFG theBenchmark.c_BEv2 [2020-07-01 12:51:39,242 INFO L157 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:ForwardPredicates Determinization: PREDICATE_ABSTRACTION [2020-07-01 12:51:39,249 INFO L169 ceAbstractionStarter]: Appying trace abstraction to program that has 28 error locations. [2020-07-01 12:51:39,263 INFO L251 AbstractCegarLoop]: Starting to check reachability of 28 error locations. [2020-07-01 12:51:39,287 INFO L375 AbstractCegarLoop]: Interprodecural is true [2020-07-01 12:51:39,287 INFO L376 AbstractCegarLoop]: Hoare is true [2020-07-01 12:51:39,287 INFO L377 AbstractCegarLoop]: Compute interpolants for ForwardPredicates [2020-07-01 12:51:39,287 INFO L378 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-07-01 12:51:39,288 INFO L379 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-07-01 12:51:39,288 INFO L380 AbstractCegarLoop]: Difference is false [2020-07-01 12:51:39,288 INFO L381 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-07-01 12:51:39,288 INFO L385 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-07-01 12:51:39,304 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states. [2020-07-01 12:51:39,310 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2020-07-01 12:51:39,310 INFO L414 BasicCegarLoop]: Found error trace [2020-07-01 12:51:39,311 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1] [2020-07-01 12:51:39,311 INFO L427 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION]=== [2020-07-01 12:51:39,317 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 12:51:39,317 INFO L82 PathProgramCache]: Analyzing trace with hash 128135, now seen corresponding path program 1 times [2020-07-01 12:51:39,327 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 12:51:39,327 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2041844065] [2020-07-01 12:51:39,328 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 12:51:39,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 12:51:39,484 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 12:51:39,485 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2041844065] [2020-07-01 12:51:39,486 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-01 12:51:39,486 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-07-01 12:51:39,487 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [493139523] [2020-07-01 12:51:39,492 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-01 12:51:39,493 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-01 12:51:39,507 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-01 12:51:39,508 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-01 12:51:39,510 INFO L87 Difference]: Start difference. First operand 46 states. Second operand 3 states. [2020-07-01 12:51:39,671 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-01 12:51:39,671 INFO L93 Difference]: Finished difference Result 90 states and 157 transitions. [2020-07-01 12:51:39,671 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-01 12:51:39,673 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2020-07-01 12:51:39,673 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-01 12:51:39,685 INFO L225 Difference]: With dead ends: 90 [2020-07-01 12:51:39,685 INFO L226 Difference]: Without dead ends: 46 [2020-07-01 12:51:39,689 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 12:51:39,707 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2020-07-01 12:51:39,725 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 46. [2020-07-01 12:51:39,727 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2020-07-01 12:51:39,728 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 76 transitions. [2020-07-01 12:51:39,730 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 76 transitions. Word has length 3 [2020-07-01 12:51:39,730 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-01 12:51:39,730 INFO L479 AbstractCegarLoop]: Abstraction has 46 states and 76 transitions. [2020-07-01 12:51:39,730 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-01 12:51:39,730 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 76 transitions. [2020-07-01 12:51:39,731 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2020-07-01 12:51:39,731 INFO L414 BasicCegarLoop]: Found error trace [2020-07-01 12:51:39,731 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1] [2020-07-01 12:51:39,733 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-07-01 12:51:39,733 INFO L427 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION]=== [2020-07-01 12:51:39,733 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 12:51:39,733 INFO L82 PathProgramCache]: Analyzing trace with hash 128166, now seen corresponding path program 1 times [2020-07-01 12:51:39,734 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 12:51:39,734 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1681155639] [2020-07-01 12:51:39,734 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 12:51:39,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 12:51:39,791 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 12:51:39,792 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1681155639] [2020-07-01 12:51:39,792 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-01 12:51:39,792 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-07-01 12:51:39,792 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [286800206] [2020-07-01 12:51:39,794 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-01 12:51:39,795 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-01 12:51:39,795 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-01 12:51:39,795 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-01 12:51:39,795 INFO L87 Difference]: Start difference. First operand 46 states and 76 transitions. Second operand 3 states. [2020-07-01 12:51:39,920 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-01 12:51:39,920 INFO L93 Difference]: Finished difference Result 46 states and 76 transitions. [2020-07-01 12:51:39,921 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-01 12:51:39,921 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2020-07-01 12:51:39,921 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-01 12:51:39,922 INFO L225 Difference]: With dead ends: 46 [2020-07-01 12:51:39,922 INFO L226 Difference]: Without dead ends: 41 [2020-07-01 12:51:39,923 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 12:51:39,924 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2020-07-01 12:51:39,927 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 41. [2020-07-01 12:51:39,928 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2020-07-01 12:51:39,929 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 66 transitions. [2020-07-01 12:51:39,929 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 66 transitions. Word has length 3 [2020-07-01 12:51:39,929 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-01 12:51:39,929 INFO L479 AbstractCegarLoop]: Abstraction has 41 states and 66 transitions. [2020-07-01 12:51:39,929 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-01 12:51:39,929 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 66 transitions. [2020-07-01 12:51:39,930 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2020-07-01 12:51:39,930 INFO L414 BasicCegarLoop]: Found error trace [2020-07-01 12:51:39,930 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1] [2020-07-01 12:51:39,930 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-07-01 12:51:39,930 INFO L427 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION]=== [2020-07-01 12:51:39,931 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 12:51:39,931 INFO L82 PathProgramCache]: Analyzing trace with hash 128168, now seen corresponding path program 1 times [2020-07-01 12:51:39,931 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 12:51:39,931 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1135701127] [2020-07-01 12:51:39,932 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 12:51:39,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 12:51:39,959 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 12:51:39,959 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1135701127] [2020-07-01 12:51:39,960 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-01 12:51:39,960 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-07-01 12:51:39,960 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1444623714] [2020-07-01 12:51:39,960 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-01 12:51:39,961 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-01 12:51:39,961 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-01 12:51:39,961 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-01 12:51:39,961 INFO L87 Difference]: Start difference. First operand 41 states and 66 transitions. Second operand 3 states. [2020-07-01 12:51:40,044 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-01 12:51:40,044 INFO L93 Difference]: Finished difference Result 46 states and 66 transitions. [2020-07-01 12:51:40,045 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-01 12:51:40,045 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2020-07-01 12:51:40,045 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-01 12:51:40,046 INFO L225 Difference]: With dead ends: 46 [2020-07-01 12:51:40,046 INFO L226 Difference]: Without dead ends: 41 [2020-07-01 12:51:40,046 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 12:51:40,047 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2020-07-01 12:51:40,050 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 41. [2020-07-01 12:51:40,050 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2020-07-01 12:51:40,051 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 61 transitions. [2020-07-01 12:51:40,051 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 61 transitions. Word has length 3 [2020-07-01 12:51:40,051 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-01 12:51:40,052 INFO L479 AbstractCegarLoop]: Abstraction has 41 states and 61 transitions. [2020-07-01 12:51:40,052 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-01 12:51:40,052 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 61 transitions. [2020-07-01 12:51:40,052 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2020-07-01 12:51:40,052 INFO L414 BasicCegarLoop]: Found error trace [2020-07-01 12:51:40,052 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1] [2020-07-01 12:51:40,053 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-07-01 12:51:40,053 INFO L427 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION]=== [2020-07-01 12:51:40,053 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 12:51:40,053 INFO L82 PathProgramCache]: Analyzing trace with hash 128169, now seen corresponding path program 1 times [2020-07-01 12:51:40,053 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 12:51:40,054 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1308883274] [2020-07-01 12:51:40,054 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 12:51:40,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 12:51:40,097 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 12:51:40,097 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1308883274] [2020-07-01 12:51:40,097 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-01 12:51:40,097 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-07-01 12:51:40,098 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [50822180] [2020-07-01 12:51:40,098 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-01 12:51:40,098 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-01 12:51:40,099 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-01 12:51:40,099 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-01 12:51:40,099 INFO L87 Difference]: Start difference. First operand 41 states and 61 transitions. Second operand 3 states. [2020-07-01 12:51:40,219 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-01 12:51:40,220 INFO L93 Difference]: Finished difference Result 41 states and 61 transitions. [2020-07-01 12:51:40,220 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-01 12:51:40,220 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2020-07-01 12:51:40,221 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-01 12:51:40,221 INFO L225 Difference]: With dead ends: 41 [2020-07-01 12:51:40,221 INFO L226 Difference]: Without dead ends: 36 [2020-07-01 12:51:40,222 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 12:51:40,222 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2020-07-01 12:51:40,225 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 36. [2020-07-01 12:51:40,225 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2020-07-01 12:51:40,226 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 56 transitions. [2020-07-01 12:51:40,226 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 56 transitions. Word has length 3 [2020-07-01 12:51:40,226 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-01 12:51:40,227 INFO L479 AbstractCegarLoop]: Abstraction has 36 states and 56 transitions. [2020-07-01 12:51:40,227 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-01 12:51:40,227 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 56 transitions. [2020-07-01 12:51:40,227 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2020-07-01 12:51:40,227 INFO L414 BasicCegarLoop]: Found error trace [2020-07-01 12:51:40,227 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2020-07-01 12:51:40,228 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-07-01 12:51:40,228 INFO L427 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION]=== [2020-07-01 12:51:40,228 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 12:51:40,228 INFO L82 PathProgramCache]: Analyzing trace with hash 3970403, now seen corresponding path program 1 times [2020-07-01 12:51:40,228 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 12:51:40,229 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1538378173] [2020-07-01 12:51:40,229 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 12:51:40,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 12:51:40,261 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 12:51:40,262 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1538378173] [2020-07-01 12:51:40,262 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-01 12:51:40,262 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-07-01 12:51:40,262 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1875712033] [2020-07-01 12:51:40,263 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-01 12:51:40,263 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-01 12:51:40,263 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-01 12:51:40,263 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-01 12:51:40,264 INFO L87 Difference]: Start difference. First operand 36 states and 56 transitions. Second operand 3 states. [2020-07-01 12:51:40,347 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-01 12:51:40,347 INFO L93 Difference]: Finished difference Result 36 states and 56 transitions. [2020-07-01 12:51:40,348 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-01 12:51:40,348 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 4 [2020-07-01 12:51:40,348 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-01 12:51:40,349 INFO L225 Difference]: With dead ends: 36 [2020-07-01 12:51:40,349 INFO L226 Difference]: Without dead ends: 31 [2020-07-01 12:51:40,349 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 12:51:40,349 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2020-07-01 12:51:40,352 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 31. [2020-07-01 12:51:40,352 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2020-07-01 12:51:40,353 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 46 transitions. [2020-07-01 12:51:40,353 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 46 transitions. Word has length 4 [2020-07-01 12:51:40,353 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-01 12:51:40,353 INFO L479 AbstractCegarLoop]: Abstraction has 31 states and 46 transitions. [2020-07-01 12:51:40,353 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-01 12:51:40,354 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 46 transitions. [2020-07-01 12:51:40,354 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2020-07-01 12:51:40,354 INFO L414 BasicCegarLoop]: Found error trace [2020-07-01 12:51:40,354 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2020-07-01 12:51:40,354 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-07-01 12:51:40,355 INFO L427 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION]=== [2020-07-01 12:51:40,355 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 12:51:40,355 INFO L82 PathProgramCache]: Analyzing trace with hash 3970405, now seen corresponding path program 1 times [2020-07-01 12:51:40,355 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 12:51:40,355 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [938321497] [2020-07-01 12:51:40,356 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 12:51:40,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 12:51:40,404 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 12:51:40,404 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [938321497] [2020-07-01 12:51:40,405 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-01 12:51:40,405 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-07-01 12:51:40,405 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [456681764] [2020-07-01 12:51:40,406 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-01 12:51:40,406 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-01 12:51:40,406 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-01 12:51:40,406 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-01 12:51:40,407 INFO L87 Difference]: Start difference. First operand 31 states and 46 transitions. Second operand 3 states. [2020-07-01 12:51:40,470 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-01 12:51:40,471 INFO L93 Difference]: Finished difference Result 31 states and 46 transitions. [2020-07-01 12:51:40,471 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-01 12:51:40,471 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 4 [2020-07-01 12:51:40,471 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-01 12:51:40,472 INFO L225 Difference]: With dead ends: 31 [2020-07-01 12:51:40,472 INFO L226 Difference]: Without dead ends: 26 [2020-07-01 12:51:40,472 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 12:51:40,473 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2020-07-01 12:51:40,475 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 26. [2020-07-01 12:51:40,475 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2020-07-01 12:51:40,476 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 36 transitions. [2020-07-01 12:51:40,476 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 36 transitions. Word has length 4 [2020-07-01 12:51:40,476 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-01 12:51:40,476 INFO L479 AbstractCegarLoop]: Abstraction has 26 states and 36 transitions. [2020-07-01 12:51:40,476 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-01 12:51:40,476 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 36 transitions. [2020-07-01 12:51:40,477 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2020-07-01 12:51:40,477 INFO L414 BasicCegarLoop]: Found error trace [2020-07-01 12:51:40,477 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2020-07-01 12:51:40,477 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-07-01 12:51:40,477 INFO L427 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION]=== [2020-07-01 12:51:40,477 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 12:51:40,478 INFO L82 PathProgramCache]: Analyzing trace with hash 123080933, now seen corresponding path program 1 times [2020-07-01 12:51:40,478 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 12:51:40,478 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1956587671] [2020-07-01 12:51:40,478 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 12:51:40,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 12:51:40,506 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 12:51:40,506 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1956587671] [2020-07-01 12:51:40,506 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-01 12:51:40,507 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-07-01 12:51:40,507 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1795317691] [2020-07-01 12:51:40,507 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-01 12:51:40,507 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-01 12:51:40,508 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-01 12:51:40,508 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-01 12:51:40,508 INFO L87 Difference]: Start difference. First operand 26 states and 36 transitions. Second operand 3 states. [2020-07-01 12:51:40,557 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-01 12:51:40,557 INFO L93 Difference]: Finished difference Result 26 states and 36 transitions. [2020-07-01 12:51:40,557 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-01 12:51:40,558 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 5 [2020-07-01 12:51:40,558 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-01 12:51:40,558 INFO L225 Difference]: With dead ends: 26 [2020-07-01 12:51:40,558 INFO L226 Difference]: Without dead ends: 22 [2020-07-01 12:51:40,559 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 12:51:40,559 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2020-07-01 12:51:40,561 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 22. [2020-07-01 12:51:40,561 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2020-07-01 12:51:40,561 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 28 transitions. [2020-07-01 12:51:40,562 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 28 transitions. Word has length 5 [2020-07-01 12:51:40,562 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-01 12:51:40,562 INFO L479 AbstractCegarLoop]: Abstraction has 22 states and 28 transitions. [2020-07-01 12:51:40,562 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-01 12:51:40,562 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 28 transitions. [2020-07-01 12:51:40,562 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2020-07-01 12:51:40,563 INFO L414 BasicCegarLoop]: Found error trace [2020-07-01 12:51:40,563 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2020-07-01 12:51:40,563 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2020-07-01 12:51:40,563 INFO L427 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION]=== [2020-07-01 12:51:40,563 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 12:51:40,563 INFO L82 PathProgramCache]: Analyzing trace with hash 123080934, now seen corresponding path program 1 times [2020-07-01 12:51:40,564 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 12:51:40,564 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1806201573] [2020-07-01 12:51:40,564 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 12:51:40,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 12:51:40,595 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 12:51:40,596 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1806201573] [2020-07-01 12:51:40,596 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-01 12:51:40,596 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-07-01 12:51:40,597 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1061632795] [2020-07-01 12:51:40,597 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-01 12:51:40,597 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-01 12:51:40,597 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-01 12:51:40,597 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-01 12:51:40,598 INFO L87 Difference]: Start difference. First operand 22 states and 28 transitions. Second operand 3 states. [2020-07-01 12:51:40,634 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-01 12:51:40,635 INFO L93 Difference]: Finished difference Result 22 states and 28 transitions. [2020-07-01 12:51:40,635 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-01 12:51:40,635 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 5 [2020-07-01 12:51:40,635 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-01 12:51:40,636 INFO L225 Difference]: With dead ends: 22 [2020-07-01 12:51:40,636 INFO L226 Difference]: Without dead ends: 0 [2020-07-01 12:51:40,636 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 12:51:40,636 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2020-07-01 12:51:40,636 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2020-07-01 12:51:40,637 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2020-07-01 12:51:40,637 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2020-07-01 12:51:40,637 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 5 [2020-07-01 12:51:40,637 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-01 12:51:40,637 INFO L479 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-07-01 12:51:40,637 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-01 12:51:40,637 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-07-01 12:51:40,638 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-01 12:51:40,638 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2020-07-01 12:51:40,640 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2020-07-01 12:51:40,675 INFO L268 CegarLoopResult]: For program point L19(line 19) no Hoare annotation was computed. [2020-07-01 12:51:40,676 INFO L268 CegarLoopResult]: For program point L15(line 15) no Hoare annotation was computed. [2020-07-01 12:51:40,676 INFO L268 CegarLoopResult]: For program point L15-1(line 15) no Hoare annotation was computed. [2020-07-01 12:51:40,676 INFO L268 CegarLoopResult]: For program point L11(line 11) no Hoare annotation was computed. [2020-07-01 12:51:40,676 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr25REQUIRES_VIOLATION(line 19) no Hoare annotation was computed. [2020-07-01 12:51:40,676 INFO L268 CegarLoopResult]: For program point L-1(line -1) no Hoare annotation was computed. [2020-07-01 12:51:40,676 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr27REQUIRES_VIOLATION(line 21) no Hoare annotation was computed. [2020-07-01 12:51:40,676 INFO L268 CegarLoopResult]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2020-07-01 12:51:40,676 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr21REQUIRES_VIOLATION(line 17) no Hoare annotation was computed. [2020-07-01 12:51:40,677 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr23REQUIRES_VIOLATION(line 19) no Hoare annotation was computed. [2020-07-01 12:51:40,677 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr17REQUIRES_VIOLATION(line 15) no Hoare annotation was computed. [2020-07-01 12:51:40,677 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr19REQUIRES_VIOLATION(line 17) no Hoare annotation was computed. [2020-07-01 12:51:40,677 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr13REQUIRES_VIOLATION(line 14) no Hoare annotation was computed. [2020-07-01 12:51:40,677 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr15REQUIRES_VIOLATION(line 15) no Hoare annotation was computed. [2020-07-01 12:51:40,677 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr9REQUIRES_VIOLATION(line 13) no Hoare annotation was computed. [2020-07-01 12:51:40,677 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr11REQUIRES_VIOLATION(line 14) no Hoare annotation was computed. [2020-07-01 12:51:40,677 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr5REQUIRES_VIOLATION(line 12) no Hoare annotation was computed. [2020-07-01 12:51:40,678 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr7REQUIRES_VIOLATION(line 13) no Hoare annotation was computed. [2020-07-01 12:51:40,678 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr1REQUIRES_VIOLATION(line 10) no Hoare annotation was computed. [2020-07-01 12:51:40,678 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr3REQUIRES_VIOLATION(line 11) no Hoare annotation was computed. [2020-07-01 12:51:40,678 INFO L268 CegarLoopResult]: For program point L17(line 17) no Hoare annotation was computed. [2020-07-01 12:51:40,678 INFO L268 CegarLoopResult]: For program point L17-1(line 17) no Hoare annotation was computed. [2020-07-01 12:51:40,678 INFO L268 CegarLoopResult]: For program point L13(line 13) no Hoare annotation was computed. [2020-07-01 12:51:40,678 INFO L268 CegarLoopResult]: For program point L13-1(lines 13 20) no Hoare annotation was computed. [2020-07-01 12:51:40,679 INFO L264 CegarLoopResult]: At program point L13-3(lines 12 20) the Hoare annotation is: (and (= 1 (select |#valid| ULTIMATE.start_test_fun_~c~0.base)) (= 4 (select |#length| ULTIMATE.start_test_fun_~c~0.base)) (= 1 (select |#valid| ULTIMATE.start_test_fun_~x_ref~0.base)) (= ULTIMATE.start_test_fun_~y_ref~0.offset 0) (= 4 (select |#length| ULTIMATE.start_test_fun_~x_ref~0.base)) (= 0 ULTIMATE.start_test_fun_~c~0.offset) (<= 1 |#StackHeapBarrier|) (= (select |#length| ULTIMATE.start_test_fun_~y_ref~0.base) 4) (= 1 (select |#valid| ULTIMATE.start_test_fun_~y_ref~0.base)) (= 0 ULTIMATE.start_test_fun_~x_ref~0.offset)) [2020-07-01 12:51:40,679 INFO L268 CegarLoopResult]: For program point L13-4(lines 13 20) no Hoare annotation was computed. [2020-07-01 12:51:40,679 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr26REQUIRES_VIOLATION(line 21) no Hoare annotation was computed. [2020-07-01 12:51:40,679 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr22REQUIRES_VIOLATION(line 19) no Hoare annotation was computed. [2020-07-01 12:51:40,679 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr24REQUIRES_VIOLATION(line 19) no Hoare annotation was computed. [2020-07-01 12:51:40,680 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr18REQUIRES_VIOLATION(line 17) no Hoare annotation was computed. [2020-07-01 12:51:40,680 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr20REQUIRES_VIOLATION(line 17) no Hoare annotation was computed. [2020-07-01 12:51:40,680 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr14REQUIRES_VIOLATION(line 15) no Hoare annotation was computed. [2020-07-01 12:51:40,680 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr16REQUIRES_VIOLATION(line 15) no Hoare annotation was computed. [2020-07-01 12:51:40,680 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr10REQUIRES_VIOLATION(line 14) no Hoare annotation was computed. [2020-07-01 12:51:40,680 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr12REQUIRES_VIOLATION(line 14) no Hoare annotation was computed. [2020-07-01 12:51:40,680 INFO L268 CegarLoopResult]: For program point L14(line 14) no Hoare annotation was computed. [2020-07-01 12:51:40,680 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr6REQUIRES_VIOLATION(line 13) no Hoare annotation was computed. [2020-07-01 12:51:40,680 INFO L268 CegarLoopResult]: For program point L14-1(line 14) no Hoare annotation was computed. [2020-07-01 12:51:40,681 INFO L268 CegarLoopResult]: For program point L14-2(lines 14 18) no Hoare annotation was computed. [2020-07-01 12:51:40,681 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr8REQUIRES_VIOLATION(line 13) no Hoare annotation was computed. [2020-07-01 12:51:40,681 INFO L268 CegarLoopResult]: For program point L10(line 10) no Hoare annotation was computed. [2020-07-01 12:51:40,681 INFO L268 CegarLoopResult]: For program point L14-4(lines 14 18) no Hoare annotation was computed. [2020-07-01 12:51:40,681 INFO L268 CegarLoopResult]: For program point L10-1(line 10) no Hoare annotation was computed. [2020-07-01 12:51:40,681 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr2REQUIRES_VIOLATION(line 11) no Hoare annotation was computed. [2020-07-01 12:51:40,681 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr4REQUIRES_VIOLATION(line 12) no Hoare annotation was computed. [2020-07-01 12:51:40,681 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr0REQUIRES_VIOLATION(line 10) no Hoare annotation was computed. [2020-07-01 12:51:40,684 INFO L308 ceAbstractionStarter]: Did not count any witness invariants because Icfg is not BoogieIcfg [2020-07-01 12:51:40,693 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:51:40,695 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:51:40,695 WARN L1295 BoogieBacktranslator]: unknown boogie variable #StackHeapBarrier [2020-07-01 12:51:40,695 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:51:40,701 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:51:40,701 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:51:40,701 WARN L1295 BoogieBacktranslator]: unknown boogie variable #StackHeapBarrier [2020-07-01 12:51:40,702 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:51:40,704 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 01.07 12:51:40 BasicIcfg [2020-07-01 12:51:40,704 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-07-01 12:51:40,705 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2020-07-01 12:51:40,705 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2020-07-01 12:51:40,708 INFO L275 PluginConnector]: BuchiAutomizer initialized [2020-07-01 12:51:40,709 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-07-01 12:51:40,709 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 01.07 12:51:38" (1/5) ... [2020-07-01 12:51:40,709 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@30c19013 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 01.07 12:51:40, skipping insertion in model container [2020-07-01 12:51:40,710 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-07-01 12:51:40,710 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.07 12:51:38" (2/5) ... [2020-07-01 12:51:40,710 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@30c19013 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 01.07 12:51:40, skipping insertion in model container [2020-07-01 12:51:40,710 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-07-01 12:51:40,710 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.07 12:51:39" (3/5) ... [2020-07-01 12:51:40,711 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@30c19013 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 01.07 12:51:40, skipping insertion in model container [2020-07-01 12:51:40,711 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-07-01 12:51:40,711 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 01.07 12:51:39" (4/5) ... [2020-07-01 12:51:40,711 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@30c19013 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 01.07 12:51:40, skipping insertion in model container [2020-07-01 12:51:40,711 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-07-01 12:51:40,711 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 01.07 12:51:40" (5/5) ... [2020-07-01 12:51:40,713 INFO L371 chiAutomizerObserver]: Analyzing ICFG theBenchmark.c_BEv2 [2020-07-01 12:51:40,733 INFO L356 BuchiCegarLoop]: Interprodecural is true [2020-07-01 12:51:40,733 INFO L357 BuchiCegarLoop]: Hoare is true [2020-07-01 12:51:40,734 INFO L358 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2020-07-01 12:51:40,734 INFO L359 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2020-07-01 12:51:40,734 INFO L360 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-07-01 12:51:40,734 INFO L361 BuchiCegarLoop]: Difference is false [2020-07-01 12:51:40,734 INFO L362 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-07-01 12:51:40,734 INFO L365 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2020-07-01 12:51:40,738 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 46 states. [2020-07-01 12:51:40,744 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 12 [2020-07-01 12:51:40,744 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-01 12:51:40,744 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-01 12:51:40,750 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2020-07-01 12:51:40,750 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-01 12:51:40,750 INFO L424 BuchiCegarLoop]: ======== Iteration 1============ [2020-07-01 12:51:40,750 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 46 states. [2020-07-01 12:51:40,752 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 12 [2020-07-01 12:51:40,752 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-01 12:51:40,753 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-01 12:51:40,753 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2020-07-01 12:51:40,753 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-01 12:51:40,759 INFO L794 eck$LassoCheckResult]: Stem: 40#ULTIMATE.startENTRYtrue [97] 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] 14#L-1true [159] L-1-->L10: Formula: (let ((.cse1 (store |v_#valid_6| |v_ULTIMATE.start_test_fun_#t~malloc0.base_1| 1))) (let ((.cse0 (store .cse1 |v_ULTIMATE.start_test_fun_#t~malloc1.base_1| 1))) (and (< |v_#StackHeapBarrier_2| |v_ULTIMATE.start_test_fun_#t~malloc2.base_1|) (= 0 |v_ULTIMATE.start_test_fun_#t~malloc1.offset_1|) (= |v_ULTIMATE.start_test_fun_#in~y_1| |v_ULTIMATE.start_main_#t~nondet12_1|) (= 0 |v_ULTIMATE.start_test_fun_#t~malloc0.offset_1|) (= |v_#length_1| (store (store (store |v_#length_4| |v_ULTIMATE.start_test_fun_#t~malloc0.base_1| 4) |v_ULTIMATE.start_test_fun_#t~malloc1.base_1| 4) |v_ULTIMATE.start_test_fun_#t~malloc2.base_1| 4)) (= (store .cse0 |v_ULTIMATE.start_test_fun_#t~malloc2.base_1| 1) |v_#valid_3|) (= v_ULTIMATE.start_test_fun_~y_ref~0.offset_1 |v_ULTIMATE.start_test_fun_#t~malloc1.offset_1|) (= v_ULTIMATE.start_test_fun_~c~0.base_1 |v_ULTIMATE.start_test_fun_#t~malloc2.base_1|) (= v_ULTIMATE.start_test_fun_~x_ref~0.offset_1 |v_ULTIMATE.start_test_fun_#t~malloc0.offset_1|) (= v_ULTIMATE.start_test_fun_~y_ref~0.base_1 |v_ULTIMATE.start_test_fun_#t~malloc1.base_1|) (< 0 |v_ULTIMATE.start_test_fun_#t~malloc1.base_1|) (= v_ULTIMATE.start_test_fun_~x_1 |v_ULTIMATE.start_test_fun_#in~x_1|) (= 0 (select .cse0 |v_ULTIMATE.start_test_fun_#t~malloc2.base_1|)) (< |v_ULTIMATE.start_test_fun_#t~malloc0.base_1| 0) (< 0 |v_ULTIMATE.start_test_fun_#t~malloc2.base_1|) (= |v_ULTIMATE.start_test_fun_#in~x_1| |v_ULTIMATE.start_main_#t~nondet11_1|) (< |v_#StackHeapBarrier_2| |v_ULTIMATE.start_test_fun_#t~malloc1.base_1|) (= 0 |v_ULTIMATE.start_test_fun_#t~malloc2.offset_1|) (= 0 (select |v_#valid_6| |v_ULTIMATE.start_test_fun_#t~malloc0.base_1|)) (= v_ULTIMATE.start_test_fun_~x_ref~0.base_1 |v_ULTIMATE.start_test_fun_#t~malloc0.base_1|) (= v_ULTIMATE.start_test_fun_~c~0.offset_1 |v_ULTIMATE.start_test_fun_#t~malloc2.offset_1|) (< |v_#StackHeapBarrier_2| |v_ULTIMATE.start_test_fun_#t~malloc0.base_1|) (= 0 (select .cse1 |v_ULTIMATE.start_test_fun_#t~malloc1.base_1|)) (= v_ULTIMATE.start_test_fun_~y_1 |v_ULTIMATE.start_test_fun_#in~y_1|)))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_2|, #length=|v_#length_4|, #valid=|v_#valid_6|} OutVars{ULTIMATE.start_test_fun_~y=v_ULTIMATE.start_test_fun_~y_1, ULTIMATE.start_test_fun_~x=v_ULTIMATE.start_test_fun_~x_1, ULTIMATE.start_test_fun_#t~mem10=|v_ULTIMATE.start_test_fun_#t~mem10_1|, ULTIMATE.start_main_#t~nondet11=|v_ULTIMATE.start_main_#t~nondet11_1|, ULTIMATE.start_main_#t~nondet12=|v_ULTIMATE.start_main_#t~nondet12_1|, ULTIMATE.start_test_fun_~x_ref~0.offset=v_ULTIMATE.start_test_fun_~x_ref~0.offset_1, ULTIMATE.start_test_fun_#t~malloc1.offset=|v_ULTIMATE.start_test_fun_#t~malloc1.offset_1|, ULTIMATE.start_test_fun_#t~mem8=|v_ULTIMATE.start_test_fun_#t~mem8_1|, ULTIMATE.start_test_fun_#t~mem9=|v_ULTIMATE.start_test_fun_#t~mem9_1|, ULTIMATE.start_test_fun_#t~mem6=|v_ULTIMATE.start_test_fun_#t~mem6_1|, ULTIMATE.start_test_fun_#t~mem7=|v_ULTIMATE.start_test_fun_#t~mem7_1|, ULTIMATE.start_test_fun_#t~mem4=|v_ULTIMATE.start_test_fun_#t~mem4_1|, ULTIMATE.start_test_fun_#t~mem5=|v_ULTIMATE.start_test_fun_#t~mem5_1|, ULTIMATE.start_test_fun_#t~mem3=|v_ULTIMATE.start_test_fun_#t~mem3_1|, ULTIMATE.start_test_fun_#res=|v_ULTIMATE.start_test_fun_#res_1|, #length=|v_#length_1|, ULTIMATE.start_test_fun_~y_ref~0.base=v_ULTIMATE.start_test_fun_~y_ref~0.base_1, ULTIMATE.start_test_fun_~x_ref~0.base=v_ULTIMATE.start_test_fun_~x_ref~0.base_1, ULTIMATE.start_test_fun_~c~0.offset=v_ULTIMATE.start_test_fun_~c~0.offset_1, ULTIMATE.start_test_fun_#t~malloc0.offset=|v_ULTIMATE.start_test_fun_#t~malloc0.offset_1|, ULTIMATE.start_test_fun_#in~y=|v_ULTIMATE.start_test_fun_#in~y_1|, ULTIMATE.start_test_fun_#in~x=|v_ULTIMATE.start_test_fun_#in~x_1|, ULTIMATE.start_test_fun_#t~malloc1.base=|v_ULTIMATE.start_test_fun_#t~malloc1.base_1|, #StackHeapBarrier=|v_#StackHeapBarrier_2|, ULTIMATE.start_test_fun_#t~malloc2.base=|v_ULTIMATE.start_test_fun_#t~malloc2.base_1|, ULTIMATE.start_test_fun_#t~malloc2.offset=|v_ULTIMATE.start_test_fun_#t~malloc2.offset_1|, ULTIMATE.start_test_fun_#t~malloc0.base=|v_ULTIMATE.start_test_fun_#t~malloc0.base_1|, ULTIMATE.start_main_#t~ret13=|v_ULTIMATE.start_main_#t~ret13_1|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_1|, #valid=|v_#valid_3|, ULTIMATE.start_test_fun_~y_ref~0.offset=v_ULTIMATE.start_test_fun_~y_ref~0.offset_1, ULTIMATE.start_test_fun_~c~0.base=v_ULTIMATE.start_test_fun_~c~0.base_1} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_~y, ULTIMATE.start_test_fun_~x, ULTIMATE.start_test_fun_#t~mem10, ULTIMATE.start_main_#t~nondet11, ULTIMATE.start_main_#t~nondet12, ULTIMATE.start_test_fun_~x_ref~0.offset, ULTIMATE.start_test_fun_#t~malloc1.offset, ULTIMATE.start_test_fun_#t~mem8, ULTIMATE.start_test_fun_#t~mem9, ULTIMATE.start_test_fun_#t~mem6, ULTIMATE.start_test_fun_#t~mem7, ULTIMATE.start_test_fun_#t~mem4, ULTIMATE.start_test_fun_#t~mem5, ULTIMATE.start_test_fun_#t~mem3, ULTIMATE.start_test_fun_#res, #length, ULTIMATE.start_test_fun_~y_ref~0.base, ULTIMATE.start_test_fun_~x_ref~0.base, ULTIMATE.start_test_fun_~c~0.offset, ULTIMATE.start_test_fun_#t~malloc0.offset, ULTIMATE.start_test_fun_#in~y, ULTIMATE.start_test_fun_#in~x, ULTIMATE.start_test_fun_#t~malloc1.base, ULTIMATE.start_test_fun_#t~malloc2.base, ULTIMATE.start_test_fun_#t~malloc2.offset, ULTIMATE.start_test_fun_#t~malloc0.base, ULTIMATE.start_main_#t~ret13, ULTIMATE.start_main_#res, #valid, ULTIMATE.start_test_fun_~y_ref~0.offset, ULTIMATE.start_test_fun_~c~0.base] 16#L10true [73] L10-->L10-1: Formula: (and (= 1 (select |v_#valid_7| v_ULTIMATE.start_test_fun_~x_ref~0.base_3)) (<= 0 v_ULTIMATE.start_test_fun_~x_ref~0.offset_3) (<= (+ v_ULTIMATE.start_test_fun_~x_ref~0.offset_3 4) (select |v_#length_5| v_ULTIMATE.start_test_fun_~x_ref~0.base_3)) (= (store |v_#memory_int_2| v_ULTIMATE.start_test_fun_~x_ref~0.base_3 (store (select |v_#memory_int_2| v_ULTIMATE.start_test_fun_~x_ref~0.base_3) v_ULTIMATE.start_test_fun_~x_ref~0.offset_3 v_ULTIMATE.start_test_fun_~x_3)) |v_#memory_int_1|)) InVars {ULTIMATE.start_test_fun_~x=v_ULTIMATE.start_test_fun_~x_3, #valid=|v_#valid_7|, #memory_int=|v_#memory_int_2|, ULTIMATE.start_test_fun_~x_ref~0.offset=v_ULTIMATE.start_test_fun_~x_ref~0.offset_3, #length=|v_#length_5|, ULTIMATE.start_test_fun_~x_ref~0.base=v_ULTIMATE.start_test_fun_~x_ref~0.base_3} OutVars{ULTIMATE.start_test_fun_~x=v_ULTIMATE.start_test_fun_~x_3, #valid=|v_#valid_7|, #memory_int=|v_#memory_int_1|, ULTIMATE.start_test_fun_~x_ref~0.offset=v_ULTIMATE.start_test_fun_~x_ref~0.offset_3, #length=|v_#length_5|, ULTIMATE.start_test_fun_~x_ref~0.base=v_ULTIMATE.start_test_fun_~x_ref~0.base_3} AuxVars[] AssignedVars[#memory_int] 36#L10-1true [115] L10-1-->L11: Formula: (and (= |v_#memory_int_3| (store |v_#memory_int_4| v_ULTIMATE.start_test_fun_~y_ref~0.base_3 (store (select |v_#memory_int_4| v_ULTIMATE.start_test_fun_~y_ref~0.base_3) v_ULTIMATE.start_test_fun_~y_ref~0.offset_3 v_ULTIMATE.start_test_fun_~y_3))) (<= 0 v_ULTIMATE.start_test_fun_~y_ref~0.offset_3) (= 1 (select |v_#valid_9| v_ULTIMATE.start_test_fun_~y_ref~0.base_3)) (<= (+ v_ULTIMATE.start_test_fun_~y_ref~0.offset_3 4) (select |v_#length_7| v_ULTIMATE.start_test_fun_~y_ref~0.base_3))) InVars {ULTIMATE.start_test_fun_~y=v_ULTIMATE.start_test_fun_~y_3, #valid=|v_#valid_9|, #memory_int=|v_#memory_int_4|, #length=|v_#length_7|, ULTIMATE.start_test_fun_~y_ref~0.base=v_ULTIMATE.start_test_fun_~y_ref~0.base_3, ULTIMATE.start_test_fun_~y_ref~0.offset=v_ULTIMATE.start_test_fun_~y_ref~0.offset_3} OutVars{ULTIMATE.start_test_fun_~y=v_ULTIMATE.start_test_fun_~y_3, #valid=|v_#valid_9|, #memory_int=|v_#memory_int_3|, #length=|v_#length_7|, ULTIMATE.start_test_fun_~y_ref~0.base=v_ULTIMATE.start_test_fun_~y_ref~0.base_3, ULTIMATE.start_test_fun_~y_ref~0.offset=v_ULTIMATE.start_test_fun_~y_ref~0.offset_3} AuxVars[] AssignedVars[#memory_int] 41#L11true [98] L11-->L13-3: Formula: (and (<= 0 v_ULTIMATE.start_test_fun_~c~0.offset_3) (<= (+ v_ULTIMATE.start_test_fun_~c~0.offset_3 4) (select |v_#length_9| v_ULTIMATE.start_test_fun_~c~0.base_3)) (= 1 (select |v_#valid_11| v_ULTIMATE.start_test_fun_~c~0.base_3)) (= (store |v_#memory_int_6| v_ULTIMATE.start_test_fun_~c~0.base_3 (store (select |v_#memory_int_6| v_ULTIMATE.start_test_fun_~c~0.base_3) v_ULTIMATE.start_test_fun_~c~0.offset_3 0)) |v_#memory_int_5|)) InVars {#memory_int=|v_#memory_int_6|, #length=|v_#length_9|, ULTIMATE.start_test_fun_~c~0.offset=v_ULTIMATE.start_test_fun_~c~0.offset_3, ULTIMATE.start_test_fun_~c~0.base=v_ULTIMATE.start_test_fun_~c~0.base_3, #valid=|v_#valid_11|} OutVars{#memory_int=|v_#memory_int_5|, #length=|v_#length_9|, ULTIMATE.start_test_fun_~c~0.offset=v_ULTIMATE.start_test_fun_~c~0.offset_3, ULTIMATE.start_test_fun_~c~0.base=v_ULTIMATE.start_test_fun_~c~0.base_3, #valid=|v_#valid_11|} AuxVars[] AssignedVars[#memory_int] 38#L13-3true [2020-07-01 12:51:40,760 INFO L796 eck$LassoCheckResult]: Loop: 38#L13-3true [120] L13-3-->L13: Formula: (and (= 1 (select |v_#valid_13| v_ULTIMATE.start_test_fun_~x_ref~0.base_6)) (<= 0 v_ULTIMATE.start_test_fun_~x_ref~0.offset_5) (= |v_ULTIMATE.start_test_fun_#t~mem3_2| (select (select |v_#memory_int_7| v_ULTIMATE.start_test_fun_~x_ref~0.base_6) v_ULTIMATE.start_test_fun_~x_ref~0.offset_5)) (<= (+ v_ULTIMATE.start_test_fun_~x_ref~0.offset_5 4) (select |v_#length_11| v_ULTIMATE.start_test_fun_~x_ref~0.base_6))) InVars {#memory_int=|v_#memory_int_7|, ULTIMATE.start_test_fun_~x_ref~0.offset=v_ULTIMATE.start_test_fun_~x_ref~0.offset_5, #length=|v_#length_11|, ULTIMATE.start_test_fun_~x_ref~0.base=v_ULTIMATE.start_test_fun_~x_ref~0.base_6, #valid=|v_#valid_13|} OutVars{ULTIMATE.start_test_fun_#t~mem3=|v_ULTIMATE.start_test_fun_#t~mem3_2|, #valid=|v_#valid_13|, #memory_int=|v_#memory_int_7|, ULTIMATE.start_test_fun_~x_ref~0.offset=v_ULTIMATE.start_test_fun_~x_ref~0.offset_5, #length=|v_#length_11|, ULTIMATE.start_test_fun_~x_ref~0.base=v_ULTIMATE.start_test_fun_~x_ref~0.base_6} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_#t~mem3] 45#L13true [125] L13-->L13-1: Formula: (and (= 1 (select |v_#valid_15| v_ULTIMATE.start_test_fun_~y_ref~0.base_6)) (= (select (select |v_#memory_int_8| v_ULTIMATE.start_test_fun_~y_ref~0.base_6) v_ULTIMATE.start_test_fun_~y_ref~0.offset_5) |v_ULTIMATE.start_test_fun_#t~mem4_2|) (<= 0 v_ULTIMATE.start_test_fun_~y_ref~0.offset_5) (<= (+ v_ULTIMATE.start_test_fun_~y_ref~0.offset_5 4) (select |v_#length_13| v_ULTIMATE.start_test_fun_~y_ref~0.base_6))) InVars {#memory_int=|v_#memory_int_8|, #length=|v_#length_13|, ULTIMATE.start_test_fun_~y_ref~0.base=v_ULTIMATE.start_test_fun_~y_ref~0.base_6, ULTIMATE.start_test_fun_~y_ref~0.offset=v_ULTIMATE.start_test_fun_~y_ref~0.offset_5, #valid=|v_#valid_15|} OutVars{ULTIMATE.start_test_fun_#t~mem4=|v_ULTIMATE.start_test_fun_#t~mem4_2|, #valid=|v_#valid_15|, #memory_int=|v_#memory_int_8|, #length=|v_#length_13|, ULTIMATE.start_test_fun_~y_ref~0.base=v_ULTIMATE.start_test_fun_~y_ref~0.base_6, ULTIMATE.start_test_fun_~y_ref~0.offset=v_ULTIMATE.start_test_fun_~y_ref~0.offset_5} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_#t~mem4] 43#L13-1true [192] L13-1-->L14: Formula: (> |v_ULTIMATE.start_test_fun_#t~mem4_6| |v_ULTIMATE.start_test_fun_#t~mem3_6|) InVars {ULTIMATE.start_test_fun_#t~mem4=|v_ULTIMATE.start_test_fun_#t~mem4_6|, ULTIMATE.start_test_fun_#t~mem3=|v_ULTIMATE.start_test_fun_#t~mem3_6|} OutVars{ULTIMATE.start_test_fun_#t~mem4=|v_ULTIMATE.start_test_fun_#t~mem4_5|, ULTIMATE.start_test_fun_#t~mem3=|v_ULTIMATE.start_test_fun_#t~mem3_5|} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_#t~mem4, ULTIMATE.start_test_fun_#t~mem3] 26#L14true [86] L14-->L14-1: Formula: (and (<= 0 v_ULTIMATE.start_test_fun_~x_ref~0.offset_7) (= |v_ULTIMATE.start_test_fun_#t~mem5_2| (select (select |v_#memory_int_9| v_ULTIMATE.start_test_fun_~x_ref~0.base_9) v_ULTIMATE.start_test_fun_~x_ref~0.offset_7)) (<= (+ v_ULTIMATE.start_test_fun_~x_ref~0.offset_7 4) (select |v_#length_15| v_ULTIMATE.start_test_fun_~x_ref~0.base_9)) (= 1 (select |v_#valid_17| v_ULTIMATE.start_test_fun_~x_ref~0.base_9))) InVars {#memory_int=|v_#memory_int_9|, ULTIMATE.start_test_fun_~x_ref~0.offset=v_ULTIMATE.start_test_fun_~x_ref~0.offset_7, #length=|v_#length_15|, ULTIMATE.start_test_fun_~x_ref~0.base=v_ULTIMATE.start_test_fun_~x_ref~0.base_9, #valid=|v_#valid_17|} OutVars{ULTIMATE.start_test_fun_#t~mem5=|v_ULTIMATE.start_test_fun_#t~mem5_2|, #valid=|v_#valid_17|, #memory_int=|v_#memory_int_9|, ULTIMATE.start_test_fun_~x_ref~0.offset=v_ULTIMATE.start_test_fun_~x_ref~0.offset_7, #length=|v_#length_15|, ULTIMATE.start_test_fun_~x_ref~0.base=v_ULTIMATE.start_test_fun_~x_ref~0.base_9} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_#t~mem5] 23#L14-1true [82] L14-1-->L14-2: Formula: (and (= |v_ULTIMATE.start_test_fun_#t~mem6_2| (select (select |v_#memory_int_10| v_ULTIMATE.start_test_fun_~y_ref~0.base_9) v_ULTIMATE.start_test_fun_~y_ref~0.offset_7)) (<= 0 v_ULTIMATE.start_test_fun_~y_ref~0.offset_7) (<= (+ v_ULTIMATE.start_test_fun_~y_ref~0.offset_7 4) (select |v_#length_17| v_ULTIMATE.start_test_fun_~y_ref~0.base_9)) (= 1 (select |v_#valid_19| v_ULTIMATE.start_test_fun_~y_ref~0.base_9))) InVars {#memory_int=|v_#memory_int_10|, #length=|v_#length_17|, ULTIMATE.start_test_fun_~y_ref~0.base=v_ULTIMATE.start_test_fun_~y_ref~0.base_9, ULTIMATE.start_test_fun_~y_ref~0.offset=v_ULTIMATE.start_test_fun_~y_ref~0.offset_7, #valid=|v_#valid_19|} OutVars{#valid=|v_#valid_19|, #memory_int=|v_#memory_int_10|, #length=|v_#length_17|, ULTIMATE.start_test_fun_~y_ref~0.base=v_ULTIMATE.start_test_fun_~y_ref~0.base_9, ULTIMATE.start_test_fun_#t~mem6=|v_ULTIMATE.start_test_fun_#t~mem6_2|, ULTIMATE.start_test_fun_~y_ref~0.offset=v_ULTIMATE.start_test_fun_~y_ref~0.offset_7} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_#t~mem6] 20#L14-2true [80] L14-2-->L15: Formula: (< |v_ULTIMATE.start_test_fun_#t~mem6_4| |v_ULTIMATE.start_test_fun_#t~mem5_4|) InVars {ULTIMATE.start_test_fun_#t~mem5=|v_ULTIMATE.start_test_fun_#t~mem5_4|, ULTIMATE.start_test_fun_#t~mem6=|v_ULTIMATE.start_test_fun_#t~mem6_4|} OutVars{ULTIMATE.start_test_fun_#t~mem5=|v_ULTIMATE.start_test_fun_#t~mem5_3|, ULTIMATE.start_test_fun_#t~mem6=|v_ULTIMATE.start_test_fun_#t~mem6_3|} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_#t~mem5, ULTIMATE.start_test_fun_#t~mem6] 27#L15true [90] L15-->L15-1: Formula: (and (= 1 (select |v_#valid_21| v_ULTIMATE.start_test_fun_~y_ref~0.base_12)) (= |v_ULTIMATE.start_test_fun_#t~mem7_2| (select (select |v_#memory_int_11| v_ULTIMATE.start_test_fun_~y_ref~0.base_12) v_ULTIMATE.start_test_fun_~y_ref~0.offset_9)) (<= (+ v_ULTIMATE.start_test_fun_~y_ref~0.offset_9 4) (select |v_#length_19| v_ULTIMATE.start_test_fun_~y_ref~0.base_12)) (<= 0 v_ULTIMATE.start_test_fun_~y_ref~0.offset_9)) InVars {#memory_int=|v_#memory_int_11|, #length=|v_#length_19|, ULTIMATE.start_test_fun_~y_ref~0.base=v_ULTIMATE.start_test_fun_~y_ref~0.base_12, ULTIMATE.start_test_fun_~y_ref~0.offset=v_ULTIMATE.start_test_fun_~y_ref~0.offset_9, #valid=|v_#valid_21|} OutVars{#valid=|v_#valid_21|, #memory_int=|v_#memory_int_11|, #length=|v_#length_19|, ULTIMATE.start_test_fun_~y_ref~0.base=v_ULTIMATE.start_test_fun_~y_ref~0.base_12, ULTIMATE.start_test_fun_~y_ref~0.offset=v_ULTIMATE.start_test_fun_~y_ref~0.offset_9, ULTIMATE.start_test_fun_#t~mem7=|v_ULTIMATE.start_test_fun_#t~mem7_2|} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_#t~mem7] 47#L15-1true [229] L15-1-->L14-4: Formula: (and (<= (+ v_ULTIMATE.start_test_fun_~y_ref~0.offset_13 4) (select |v_#length_37| v_ULTIMATE.start_test_fun_~y_ref~0.base_18)) (= 1 (select |v_#valid_47| v_ULTIMATE.start_test_fun_~y_ref~0.base_18)) (<= 0 v_ULTIMATE.start_test_fun_~y_ref~0.offset_13) (= (store |v_#memory_int_26| v_ULTIMATE.start_test_fun_~y_ref~0.base_18 (store (select |v_#memory_int_26| v_ULTIMATE.start_test_fun_~y_ref~0.base_18) v_ULTIMATE.start_test_fun_~y_ref~0.offset_13 (+ |v_ULTIMATE.start_test_fun_#t~mem7_6| 1))) |v_#memory_int_25|)) InVars {#valid=|v_#valid_47|, #memory_int=|v_#memory_int_26|, #length=|v_#length_37|, ULTIMATE.start_test_fun_~y_ref~0.base=v_ULTIMATE.start_test_fun_~y_ref~0.base_18, ULTIMATE.start_test_fun_~y_ref~0.offset=v_ULTIMATE.start_test_fun_~y_ref~0.offset_13, ULTIMATE.start_test_fun_#t~mem7=|v_ULTIMATE.start_test_fun_#t~mem7_6|} OutVars{#valid=|v_#valid_47|, #memory_int=|v_#memory_int_25|, #length=|v_#length_37|, ULTIMATE.start_test_fun_~y_ref~0.base=v_ULTIMATE.start_test_fun_~y_ref~0.base_18, ULTIMATE.start_test_fun_~y_ref~0.offset=v_ULTIMATE.start_test_fun_~y_ref~0.offset_13, ULTIMATE.start_test_fun_#t~mem7=|v_ULTIMATE.start_test_fun_#t~mem7_5|} AuxVars[] AssignedVars[#memory_int, ULTIMATE.start_test_fun_#t~mem7] 17#L14-4true [76] L14-4-->L19: Formula: (and (= 1 (select |v_#valid_29| v_ULTIMATE.start_test_fun_~c~0.base_6)) (= |v_ULTIMATE.start_test_fun_#t~mem9_2| (select (select |v_#memory_int_17| v_ULTIMATE.start_test_fun_~c~0.base_6) v_ULTIMATE.start_test_fun_~c~0.offset_5)) (<= (+ v_ULTIMATE.start_test_fun_~c~0.offset_5 4) (select |v_#length_27| v_ULTIMATE.start_test_fun_~c~0.base_6)) (<= 0 v_ULTIMATE.start_test_fun_~c~0.offset_5)) InVars {#memory_int=|v_#memory_int_17|, #length=|v_#length_27|, ULTIMATE.start_test_fun_~c~0.offset=v_ULTIMATE.start_test_fun_~c~0.offset_5, ULTIMATE.start_test_fun_~c~0.base=v_ULTIMATE.start_test_fun_~c~0.base_6, #valid=|v_#valid_29|} OutVars{ULTIMATE.start_test_fun_~c~0.offset=v_ULTIMATE.start_test_fun_~c~0.offset_5, #valid=|v_#valid_29|, #memory_int=|v_#memory_int_17|, #length=|v_#length_27|, ULTIMATE.start_test_fun_#t~mem9=|v_ULTIMATE.start_test_fun_#t~mem9_2|, ULTIMATE.start_test_fun_~c~0.base=v_ULTIMATE.start_test_fun_~c~0.base_6} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_#t~mem9] 35#L19true [231] L19-->L13-3: Formula: (and (= (store |v_#memory_int_30| v_ULTIMATE.start_test_fun_~c~0.base_19 (store (select |v_#memory_int_30| v_ULTIMATE.start_test_fun_~c~0.base_19) v_ULTIMATE.start_test_fun_~c~0.offset_15 (+ |v_ULTIMATE.start_test_fun_#t~mem9_6| 1))) |v_#memory_int_29|) (<= (+ v_ULTIMATE.start_test_fun_~c~0.offset_15 4) (select |v_#length_39| v_ULTIMATE.start_test_fun_~c~0.base_19)) (<= 0 v_ULTIMATE.start_test_fun_~c~0.offset_15) (= (select |v_#valid_49| v_ULTIMATE.start_test_fun_~c~0.base_19) 1)) InVars {ULTIMATE.start_test_fun_~c~0.offset=v_ULTIMATE.start_test_fun_~c~0.offset_15, #valid=|v_#valid_49|, #memory_int=|v_#memory_int_30|, #length=|v_#length_39|, ULTIMATE.start_test_fun_#t~mem9=|v_ULTIMATE.start_test_fun_#t~mem9_6|, ULTIMATE.start_test_fun_~c~0.base=v_ULTIMATE.start_test_fun_~c~0.base_19} OutVars{ULTIMATE.start_test_fun_~c~0.offset=v_ULTIMATE.start_test_fun_~c~0.offset_15, #valid=|v_#valid_49|, #memory_int=|v_#memory_int_29|, #length=|v_#length_39|, ULTIMATE.start_test_fun_#t~mem9=|v_ULTIMATE.start_test_fun_#t~mem9_5|, ULTIMATE.start_test_fun_~c~0.base=v_ULTIMATE.start_test_fun_~c~0.base_19} AuxVars[] AssignedVars[#memory_int, ULTIMATE.start_test_fun_#t~mem9] 38#L13-3true [2020-07-01 12:51:40,761 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 12:51:40,761 INFO L82 PathProgramCache]: Analyzing trace with hash 123021273, now seen corresponding path program 1 times [2020-07-01 12:51:40,761 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 12:51:40,761 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [166564530] [2020-07-01 12:51:40,762 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 12:51:40,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 12:51:40,781 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 12:51:40,781 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [166564530] [2020-07-01 12:51:40,782 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-01 12:51:40,782 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-07-01 12:51:40,782 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [144249249] [2020-07-01 12:51:40,783 INFO L799 eck$LassoCheckResult]: stem already infeasible [2020-07-01 12:51:40,783 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 12:51:40,783 INFO L82 PathProgramCache]: Analyzing trace with hash -1149860288, now seen corresponding path program 1 times [2020-07-01 12:51:40,783 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 12:51:40,784 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [623925352] [2020-07-01 12:51:40,784 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 12:51:40,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 12:51:40,842 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 12:51:40,843 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [623925352] [2020-07-01 12:51:40,843 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-01 12:51:40,843 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-07-01 12:51:40,843 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1196357185] [2020-07-01 12:51:40,844 INFO L811 eck$LassoCheckResult]: loop already infeasible [2020-07-01 12:51:40,845 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-01 12:51:40,845 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-01 12:51:40,845 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-01 12:51:40,846 INFO L87 Difference]: Start difference. First operand 46 states. Second operand 3 states. [2020-07-01 12:51:40,931 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-01 12:51:40,931 INFO L93 Difference]: Finished difference Result 46 states and 76 transitions. [2020-07-01 12:51:40,932 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-01 12:51:40,934 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 12:51:40,938 INFO L168 Benchmark]: Toolchain (without parser) took 2611.82 ms. Allocated memory was 514.9 MB in the beginning and 584.6 MB in the end (delta: 69.7 MB). Free memory was 438.4 MB in the beginning and 430.6 MB in the end (delta: 7.9 MB). Peak memory consumption was 77.6 MB. Max. memory is 50.3 GB. [2020-07-01 12:51:40,939 INFO L168 Benchmark]: CDTParser took 0.17 ms. Allocated memory is still 514.9 MB. Free memory is still 458.4 MB. There was no memory consumed. Max. memory is 50.3 GB. [2020-07-01 12:51:40,940 INFO L168 Benchmark]: CACSL2BoogieTranslator took 313.49 ms. Allocated memory was 514.9 MB in the beginning and 558.9 MB in the end (delta: 44.0 MB). Free memory was 438.4 MB in the beginning and 525.1 MB in the end (delta: -86.7 MB). Peak memory consumption was 27.8 MB. Max. memory is 50.3 GB. [2020-07-01 12:51:40,940 INFO L168 Benchmark]: Boogie Procedure Inliner took 41.22 ms. Allocated memory is still 558.9 MB. Free memory was 525.1 MB in the beginning and 523.1 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 50.3 GB. [2020-07-01 12:51:40,941 INFO L168 Benchmark]: Boogie Preprocessor took 24.91 ms. Allocated memory is still 558.9 MB. Free memory was 523.1 MB in the beginning and 521.7 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 50.3 GB. [2020-07-01 12:51:40,941 INFO L168 Benchmark]: RCFGBuilder took 379.01 ms. Allocated memory is still 558.9 MB. Free memory was 521.7 MB in the beginning and 496.8 MB in the end (delta: 25.0 MB). Peak memory consumption was 25.0 MB. Max. memory is 50.3 GB. [2020-07-01 12:51:40,942 INFO L168 Benchmark]: BlockEncodingV2 took 134.91 ms. Allocated memory is still 558.9 MB. Free memory was 496.8 MB in the beginning and 484.6 MB in the end (delta: 12.1 MB). Peak memory consumption was 12.1 MB. Max. memory is 50.3 GB. [2020-07-01 12:51:40,942 INFO L168 Benchmark]: TraceAbstraction took 1481.00 ms. Allocated memory was 558.9 MB in the beginning and 584.6 MB in the end (delta: 25.7 MB). Free memory was 483.9 MB in the beginning and 462.9 MB in the end (delta: 21.0 MB). Peak memory consumption was 46.7 MB. Max. memory is 50.3 GB. [2020-07-01 12:51:40,943 INFO L168 Benchmark]: BuchiAutomizer took 231.26 ms. Allocated memory is still 584.6 MB. Free memory was 462.9 MB in the beginning and 430.6 MB in the end (delta: 32.4 MB). Peak memory consumption was 32.4 MB. Max. memory is 50.3 GB. [2020-07-01 12:51:40,946 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.plugins.blockencoding: - StatisticsResult: Initial Icfg 54 locations, 56 edges - StatisticsResult: Encoded RCFG 46 locations, 83 edges * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.17 ms. Allocated memory is still 514.9 MB. Free memory is still 458.4 MB. There was no memory consumed. Max. memory is 50.3 GB. * CACSL2BoogieTranslator took 313.49 ms. Allocated memory was 514.9 MB in the beginning and 558.9 MB in the end (delta: 44.0 MB). Free memory was 438.4 MB in the beginning and 525.1 MB in the end (delta: -86.7 MB). Peak memory consumption was 27.8 MB. Max. memory is 50.3 GB. * Boogie Procedure Inliner took 41.22 ms. Allocated memory is still 558.9 MB. Free memory was 525.1 MB in the beginning and 523.1 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 50.3 GB. * Boogie Preprocessor took 24.91 ms. Allocated memory is still 558.9 MB. Free memory was 523.1 MB in the beginning and 521.7 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 50.3 GB. * RCFGBuilder took 379.01 ms. Allocated memory is still 558.9 MB. Free memory was 521.7 MB in the beginning and 496.8 MB in the end (delta: 25.0 MB). Peak memory consumption was 25.0 MB. Max. memory is 50.3 GB. * BlockEncodingV2 took 134.91 ms. Allocated memory is still 558.9 MB. Free memory was 496.8 MB in the beginning and 484.6 MB in the end (delta: 12.1 MB). Peak memory consumption was 12.1 MB. Max. memory is 50.3 GB. * TraceAbstraction took 1481.00 ms. Allocated memory was 558.9 MB in the beginning and 584.6 MB in the end (delta: 25.7 MB). Free memory was 483.9 MB in the beginning and 462.9 MB in the end (delta: 21.0 MB). Peak memory consumption was 46.7 MB. Max. memory is 50.3 GB. * BuchiAutomizer took 231.26 ms. Allocated memory is still 584.6 MB. Free memory was 462.9 MB in the beginning and 430.6 MB in the end (delta: 32.4 MB). Peak memory consumption was 32.4 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 #StackHeapBarrier - 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 #StackHeapBarrier - 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: 19]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 19]: 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: 19]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 17]: 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: 11]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 11]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 19]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 13]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 13]: 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: 21]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 13]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 21]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 13]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 14]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 14]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 14]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 15]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 15]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 14]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 15]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 15]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 17]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 17]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 17]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - AllSpecificationsHoldResult: All specifications hold 28 specifications checked. All of them hold - InvariantResult [Line: 12]: Loop Invariant [2020-07-01 12:51:40,956 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:51:40,957 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:51:40,957 WARN L1295 BoogieBacktranslator]: unknown boogie variable #StackHeapBarrier [2020-07-01 12:51:40,957 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:51:40,958 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:51:40,958 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:51:40,958 WARN L1295 BoogieBacktranslator]: unknown boogie variable #StackHeapBarrier [2020-07-01 12:51:40,958 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length Derived loop invariant: ((((((((1 == \valid[c] && 4 == unknown-#length-unknown[c]) && 1 == \valid[x_ref]) && y_ref == 0) && 4 == unknown-#length-unknown[x_ref]) && 0 == c) && 1 <= unknown-#StackHeapBarrier-unknown) && unknown-#length-unknown[y_ref] == 4) && 1 == \valid[y_ref]) && 0 == x_ref - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 46 locations, 28 error locations. Started 1 CEGAR loops. VerificationResult: SAFE, OverallTime: 1.3s, OverallIterations: 8, TraceHistogramMax: 1, AutomataDifference: 0.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 45 SDtfs, 368 SDslu, 4 SDs, 0 SdLazy, 347 SolverSat, 55 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.5s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 16 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=46occurred 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, 8 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 1 LocationsWithAnnotation, 1 PreInvPairs, 2 NumberOfFragments, 43 HoareAnnotationTreeSize, 1 FomulaSimplifications, 0 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 1 FomulaSimplificationsInter, 0 FormulaSimplificationTreeSizeReductionInter, 0.0s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.2s InterpolantComputationTime, 30 NumberOfCodeBlocks, 30 NumberOfCodeBlocksAsserted, 8 NumberOfCheckSat, 22 ConstructedInterpolants, 0 QuantifiedInterpolants, 314 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 8 InterpolantComputations, 8 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 12:51:35.113 ----------------------------------------------- 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/sandbox/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/sandbox/tmp/BenchExec_run_4xuw8K/tmp -i /export/starexec/sandbox/benchmark/theBenchmark.c !ENTRY org.eclipse.core.resources 2 10035 2020-07-01 12:51:41.182 !MESSAGE The workspace will exit with unsaved changes in this session. Received shutdown request... Ultimate: GTK+ Version Check