YES Ultimate: Cannot open display: This is Ultimate 0.1.24-8dc7c08-m [2020-06-22 10:21:23,488 INFO L170 SettingsManager]: Resetting all preferences to default values... [2020-06-22 10:21:23,490 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2020-06-22 10:21:23,502 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-06-22 10:21:23,502 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-06-22 10:21:23,503 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-06-22 10:21:23,504 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-06-22 10:21:23,505 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2020-06-22 10:21:23,507 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-06-22 10:21:23,508 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-06-22 10:21:23,508 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-06-22 10:21:23,509 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-06-22 10:21:23,510 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-06-22 10:21:23,510 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-06-22 10:21:23,511 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-06-22 10:21:23,512 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-06-22 10:21:23,513 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-06-22 10:21:23,515 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-06-22 10:21:23,517 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2020-06-22 10:21:23,519 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-06-22 10:21:23,520 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-06-22 10:21:23,522 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-06-22 10:21:23,524 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-06-22 10:21:23,524 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-06-22 10:21:23,524 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-06-22 10:21:23,525 INFO L174 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-06-22 10:21:23,526 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-06-22 10:21:23,526 INFO L177 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-06-22 10:21:23,527 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-06-22 10:21:23,527 INFO L174 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-06-22 10:21:23,528 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-06-22 10:21:23,529 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2020-06-22 10:21:23,529 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-06-22 10:21:23,530 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2020-06-22 10:21:23,530 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-06-22 10:21:23,530 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-06-22 10:21:23,531 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2020-06-22 10:21:23,531 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2020-06-22 10:21:23,532 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2020-06-22 10:21:23,532 INFO L98 SettingsManager]: Beginning loading settings from /export/starexec/sandbox/solver/bin/./../termcomp2017.epf [2020-06-22 10:21:23,547 INFO L110 SettingsManager]: Loading preferences was successful [2020-06-22 10:21:23,547 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2020-06-22 10:21:23,548 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-06-22 10:21:23,548 INFO L133 SettingsManager]: * Rewrite not-equals=true [2020-06-22 10:21:23,549 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2020-06-22 10:21:23,549 INFO L133 SettingsManager]: * Minimize states using LBE with the strategy=SINGLE [2020-06-22 10:21:23,549 INFO L133 SettingsManager]: * Use SBE=true [2020-06-22 10:21:23,549 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2020-06-22 10:21:23,549 INFO L133 SettingsManager]: * Use old map elimination=false [2020-06-22 10:21:23,550 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2020-06-22 10:21:23,550 INFO L133 SettingsManager]: * Buchi interpolant automaton construction strategy=DANDELION [2020-06-22 10:21:23,550 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2020-06-22 10:21:23,550 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2020-06-22 10:21:23,550 INFO L133 SettingsManager]: * Construct termination proof for TermComp=true [2020-06-22 10:21:23,550 INFO L133 SettingsManager]: * Command for external solver (GNTA synthesis)=z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 [2020-06-22 10:21:23,551 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-06-22 10:21:23,551 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2020-06-22 10:21:23,551 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2020-06-22 10:21:23,551 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2020-06-22 10:21:23,551 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2020-06-22 10:21:23,551 INFO L133 SettingsManager]: * How to treat unsigned ints differently from normal ones=IGNORE [2020-06-22 10:21:23,552 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-06-22 10:21:23,552 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-06-22 10:21:23,552 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2020-06-22 10:21:23,552 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:5000 [2020-06-22 10:21:23,552 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-06-22 10:21:23,553 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-06-22 10:21:23,553 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2020-06-22 10:21:23,553 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-06-22 10:21:23,579 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2020-06-22 10:21:23,592 INFO L259 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-06-22 10:21:23,596 INFO L215 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-06-22 10:21:23,597 INFO L271 PluginConnector]: Initializing CDTParser... [2020-06-22 10:21:23,597 INFO L276 PluginConnector]: CDTParser initialized [2020-06-22 10:21:23,598 INFO L430 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /export/starexec/sandbox/benchmark/theBenchmark.c [2020-06-22 10:21:23,661 INFO L221 CDTParser]: Created temporary CDT project at /export/starexec/sandbox/tmp/1f3b48948fa841759f876dab418f9383/FLAG042f0ef8e [2020-06-22 10:21:23,997 INFO L307 CDTParser]: Found 1 translation units. [2020-06-22 10:21:23,998 INFO L161 CDTParser]: Scanning /export/starexec/sandbox/benchmark/theBenchmark.c [2020-06-22 10:21:23,998 WARN L117 ultiparseSymbolTable]: System include stdlib.h could not be resolved by CDT -- only built-in system includes are available. [2020-06-22 10:21:24,004 INFO L355 CDTParser]: About to delete temporary CDT project at /export/starexec/sandbox/tmp/1f3b48948fa841759f876dab418f9383/FLAG042f0ef8e [2020-06-22 10:21:24,400 INFO L363 CDTParser]: Successfully deleted /export/starexec/sandbox/tmp/1f3b48948fa841759f876dab418f9383 [2020-06-22 10:21:24,411 INFO L297 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-06-22 10:21:24,413 INFO L131 ToolchainWalker]: Walking toolchain with 7 elements. [2020-06-22 10:21:24,414 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-06-22 10:21:24,414 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-06-22 10:21:24,417 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2020-06-22 10:21:24,418 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.06 10:21:24" (1/1) ... [2020-06-22 10:21:24,421 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@212c62ba and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 10:21:24, skipping insertion in model container [2020-06-22 10:21:24,421 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.06 10:21:24" (1/1) ... [2020-06-22 10:21:24,429 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-06-22 10:21:24,446 INFO L176 MainTranslator]: Built tables and reachable declarations [2020-06-22 10:21:24,608 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-06-22 10:21:24,685 INFO L191 MainTranslator]: Completed pre-run [2020-06-22 10:21:24,703 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-06-22 10:21:24,719 INFO L195 MainTranslator]: Completed translation [2020-06-22 10:21:24,720 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 10:21:24 WrapperNode [2020-06-22 10:21:24,720 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-06-22 10:21:24,721 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-06-22 10:21:24,721 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-06-22 10:21:24,721 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2020-06-22 10:21:24,731 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 10:21:24" (1/1) ... [2020-06-22 10:21:24,741 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 10:21:24" (1/1) ... [2020-06-22 10:21:24,763 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-06-22 10:21:24,764 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-06-22 10:21:24,764 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-06-22 10:21:24,764 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2020-06-22 10:21:24,774 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 10:21:24" (1/1) ... [2020-06-22 10:21:24,774 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 10:21:24" (1/1) ... [2020-06-22 10:21:24,776 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 10:21:24" (1/1) ... [2020-06-22 10:21:24,776 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 10:21:24" (1/1) ... [2020-06-22 10:21:24,780 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 10:21:24" (1/1) ... [2020-06-22 10:21:24,785 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 10:21:24" (1/1) ... [2020-06-22 10:21:24,786 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 10:21:24" (1/1) ... [2020-06-22 10:21:24,788 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-06-22 10:21:24,788 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-06-22 10:21:24,788 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-06-22 10:21:24,789 INFO L276 PluginConnector]: RCFGBuilder initialized [2020-06-22 10:21:24,790 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 10:21:24" (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-06-22 10:21:24,876 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-06-22 10:21:24,877 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-06-22 10:21:24,877 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-06-22 10:21:24,877 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2020-06-22 10:21:24,877 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-06-22 10:21:24,877 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-06-22 10:21:25,122 INFO L281 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-06-22 10:21:25,122 INFO L286 CfgBuilder]: Removed 7 assue(true) statements. [2020-06-22 10:21:25,123 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.06 10:21:25 BoogieIcfgContainer [2020-06-22 10:21:25,124 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-06-22 10:21:25,124 INFO L113 PluginConnector]: ------------------------BlockEncodingV2---------------------------- [2020-06-22 10:21:25,124 INFO L271 PluginConnector]: Initializing BlockEncodingV2... [2020-06-22 10:21:25,126 INFO L276 PluginConnector]: BlockEncodingV2 initialized [2020-06-22 10:21:25,127 INFO L185 PluginConnector]: Executing the observer BlockEncodingObserver from plugin BlockEncodingV2 for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.06 10:21:25" (1/1) ... [2020-06-22 10:21:25,143 INFO L313 BlockEncoder]: Initial Icfg 35 locations, 36 edges [2020-06-22 10:21:25,145 INFO L258 BlockEncoder]: Using Remove infeasible edges [2020-06-22 10:21:25,145 INFO L263 BlockEncoder]: Using Maximize final states [2020-06-22 10:21:25,146 INFO L270 BlockEncoder]: Using Minimize states even if more edges are added than removed.=false [2020-06-22 10:21:25,146 INFO L276 BlockEncoder]: Using Minimize states using LBE with the strategy=SINGLE [2020-06-22 10:21:25,148 INFO L296 BlockEncoder]: Using Remove sink states [2020-06-22 10:21:25,149 INFO L171 BlockEncoder]: Using Apply optimizations until nothing changes=true [2020-06-22 10:21:25,149 INFO L179 BlockEncoder]: Using Rewrite not-equals [2020-06-22 10:21:25,172 INFO L185 BlockEncoder]: Using Use SBE [2020-06-22 10:21:25,206 INFO L200 BlockEncoder]: SBE split 18 edges [2020-06-22 10:21:25,211 INFO L70 emoveInfeasibleEdges]: Removed 1 edges and 0 locations because of local infeasibility [2020-06-22 10:21:25,213 INFO L71 MaximizeFinalStates]: 0 new accepting states [2020-06-22 10:21:25,263 INFO L100 BaseMinimizeStates]: Removed 12 edges and 6 locations by large block encoding [2020-06-22 10:21:25,266 INFO L70 RemoveSinkStates]: Removed 1 edges and 1 locations by removing sink states [2020-06-22 10:21:25,267 INFO L70 emoveInfeasibleEdges]: Removed 0 edges and 0 locations because of local infeasibility [2020-06-22 10:21:25,268 INFO L71 MaximizeFinalStates]: 0 new accepting states [2020-06-22 10:21:25,268 INFO L100 BaseMinimizeStates]: Removed 0 edges and 0 locations by large block encoding [2020-06-22 10:21:25,269 INFO L70 RemoveSinkStates]: Removed 0 edges and 0 locations by removing sink states [2020-06-22 10:21:25,269 INFO L313 BlockEncoder]: Encoded RCFG 28 locations, 50 edges [2020-06-22 10:21:25,270 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 22.06 10:21:25 BasicIcfg [2020-06-22 10:21:25,270 INFO L132 PluginConnector]: ------------------------ END BlockEncodingV2---------------------------- [2020-06-22 10:21:25,271 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-06-22 10:21:25,271 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-06-22 10:21:25,274 INFO L276 PluginConnector]: TraceAbstraction initialized [2020-06-22 10:21:25,274 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 22.06 10:21:24" (1/4) ... [2020-06-22 10:21:25,275 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7f5fba98 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.06 10:21:25, skipping insertion in model container [2020-06-22 10:21:25,275 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 10:21:24" (2/4) ... [2020-06-22 10:21:25,276 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7f5fba98 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.06 10:21:25, skipping insertion in model container [2020-06-22 10:21:25,276 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.06 10:21:25" (3/4) ... [2020-06-22 10:21:25,276 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7f5fba98 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 22.06 10:21:25, skipping insertion in model container [2020-06-22 10:21:25,276 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 22.06 10:21:25" (4/4) ... [2020-06-22 10:21:25,278 INFO L112 eAbstractionObserver]: Analyzing ICFG theBenchmark.c_BEv2 [2020-06-22 10:21:25,288 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:ForwardPredicates Determinization: PREDICATE_ABSTRACTION [2020-06-22 10:21:25,296 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 16 error locations. [2020-06-22 10:21:25,313 INFO L257 AbstractCegarLoop]: Starting to check reachability of 16 error locations. [2020-06-22 10:21:25,342 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2020-06-22 10:21:25,342 INFO L382 AbstractCegarLoop]: Interprodecural is true [2020-06-22 10:21:25,343 INFO L383 AbstractCegarLoop]: Hoare is true [2020-06-22 10:21:25,343 INFO L384 AbstractCegarLoop]: Compute interpolants for ForwardPredicates [2020-06-22 10:21:25,343 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-06-22 10:21:25,343 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-06-22 10:21:25,343 INFO L387 AbstractCegarLoop]: Difference is false [2020-06-22 10:21:25,343 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-06-22 10:21:25,343 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-06-22 10:21:25,359 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states. [2020-06-22 10:21:25,364 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2020-06-22 10:21:25,365 INFO L394 BasicCegarLoop]: Found error trace [2020-06-22 10:21:25,365 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1] [2020-06-22 10:21:25,366 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION]=== [2020-06-22 10:21:25,371 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 10:21:25,371 INFO L82 PathProgramCache]: Analyzing trace with hash 103244, now seen corresponding path program 1 times [2020-06-22 10:21:25,373 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 10:21:25,374 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 10:21:25,425 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 10:21:25,426 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 10:21:25,426 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 10:21:25,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 10:21:25,552 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-06-22 10:21:25,555 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-06-22 10:21:25,555 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-06-22 10:21:25,559 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-06-22 10:21:25,572 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-06-22 10:21:25,573 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-06-22 10:21:25,576 INFO L87 Difference]: Start difference. First operand 28 states. Second operand 3 states. [2020-06-22 10:21:25,700 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-06-22 10:21:25,700 INFO L93 Difference]: Finished difference Result 45 states and 85 transitions. [2020-06-22 10:21:25,701 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-06-22 10:21:25,702 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2020-06-22 10:21:25,702 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-06-22 10:21:25,715 INFO L225 Difference]: With dead ends: 45 [2020-06-22 10:21:25,715 INFO L226 Difference]: Without dead ends: 24 [2020-06-22 10:21:25,719 INFO L631 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-06-22 10:21:25,737 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2020-06-22 10:21:25,752 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 24. [2020-06-22 10:21:25,754 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2020-06-22 10:21:25,755 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 41 transitions. [2020-06-22 10:21:25,756 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 41 transitions. Word has length 3 [2020-06-22 10:21:25,757 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-06-22 10:21:25,757 INFO L480 AbstractCegarLoop]: Abstraction has 24 states and 41 transitions. [2020-06-22 10:21:25,758 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-06-22 10:21:25,758 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 41 transitions. [2020-06-22 10:21:25,758 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2020-06-22 10:21:25,758 INFO L394 BasicCegarLoop]: Found error trace [2020-06-22 10:21:25,758 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1] [2020-06-22 10:21:25,759 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION]=== [2020-06-22 10:21:25,759 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 10:21:25,759 INFO L82 PathProgramCache]: Analyzing trace with hash 103246, now seen corresponding path program 1 times [2020-06-22 10:21:25,759 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 10:21:25,759 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 10:21:25,761 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 10:21:25,761 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 10:21:25,761 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 10:21:25,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 10:21:25,782 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-06-22 10:21:25,782 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-06-22 10:21:25,782 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-06-22 10:21:25,784 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-06-22 10:21:25,784 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-06-22 10:21:25,785 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-06-22 10:21:25,785 INFO L87 Difference]: Start difference. First operand 24 states and 41 transitions. Second operand 3 states. [2020-06-22 10:21:25,845 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-06-22 10:21:25,845 INFO L93 Difference]: Finished difference Result 28 states and 41 transitions. [2020-06-22 10:21:25,845 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-06-22 10:21:25,846 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2020-06-22 10:21:25,846 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-06-22 10:21:25,846 INFO L225 Difference]: With dead ends: 28 [2020-06-22 10:21:25,847 INFO L226 Difference]: Without dead ends: 24 [2020-06-22 10:21:25,848 INFO L631 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-06-22 10:21:25,848 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2020-06-22 10:21:25,851 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 24. [2020-06-22 10:21:25,851 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2020-06-22 10:21:25,852 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 37 transitions. [2020-06-22 10:21:25,852 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 37 transitions. Word has length 3 [2020-06-22 10:21:25,852 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-06-22 10:21:25,852 INFO L480 AbstractCegarLoop]: Abstraction has 24 states and 37 transitions. [2020-06-22 10:21:25,852 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-06-22 10:21:25,853 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 37 transitions. [2020-06-22 10:21:25,853 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2020-06-22 10:21:25,853 INFO L394 BasicCegarLoop]: Found error trace [2020-06-22 10:21:25,853 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1] [2020-06-22 10:21:25,853 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION]=== [2020-06-22 10:21:25,854 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 10:21:25,854 INFO L82 PathProgramCache]: Analyzing trace with hash 103247, now seen corresponding path program 1 times [2020-06-22 10:21:25,854 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 10:21:25,854 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 10:21:25,855 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 10:21:25,855 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 10:21:25,855 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 10:21:25,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 10:21:25,888 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-06-22 10:21:25,888 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-06-22 10:21:25,888 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-06-22 10:21:25,889 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-06-22 10:21:25,889 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-06-22 10:21:25,889 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-06-22 10:21:25,889 INFO L87 Difference]: Start difference. First operand 24 states and 37 transitions. Second operand 3 states. [2020-06-22 10:21:25,957 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-06-22 10:21:25,958 INFO L93 Difference]: Finished difference Result 24 states and 37 transitions. [2020-06-22 10:21:25,958 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-06-22 10:21:25,958 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2020-06-22 10:21:25,959 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-06-22 10:21:25,959 INFO L225 Difference]: With dead ends: 24 [2020-06-22 10:21:25,959 INFO L226 Difference]: Without dead ends: 20 [2020-06-22 10:21:25,960 INFO L631 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-06-22 10:21:25,960 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2020-06-22 10:21:25,963 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 20. [2020-06-22 10:21:25,963 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2020-06-22 10:21:25,963 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 33 transitions. [2020-06-22 10:21:25,964 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 33 transitions. Word has length 3 [2020-06-22 10:21:25,964 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-06-22 10:21:25,964 INFO L480 AbstractCegarLoop]: Abstraction has 20 states and 33 transitions. [2020-06-22 10:21:25,964 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-06-22 10:21:25,964 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 33 transitions. [2020-06-22 10:21:25,965 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2020-06-22 10:21:25,965 INFO L394 BasicCegarLoop]: Found error trace [2020-06-22 10:21:25,965 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2020-06-22 10:21:25,965 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION]=== [2020-06-22 10:21:25,965 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 10:21:25,965 INFO L82 PathProgramCache]: Analyzing trace with hash 3199033, now seen corresponding path program 1 times [2020-06-22 10:21:25,966 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 10:21:25,966 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 10:21:25,967 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 10:21:25,967 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 10:21:25,967 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 10:21:25,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 10:21:25,993 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-06-22 10:21:25,993 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-06-22 10:21:25,994 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-06-22 10:21:25,994 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-06-22 10:21:25,994 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-06-22 10:21:25,995 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-06-22 10:21:25,995 INFO L87 Difference]: Start difference. First operand 20 states and 33 transitions. Second operand 3 states. [2020-06-22 10:21:26,063 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-06-22 10:21:26,063 INFO L93 Difference]: Finished difference Result 20 states and 33 transitions. [2020-06-22 10:21:26,064 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-06-22 10:21:26,064 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 4 [2020-06-22 10:21:26,064 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-06-22 10:21:26,065 INFO L225 Difference]: With dead ends: 20 [2020-06-22 10:21:26,065 INFO L226 Difference]: Without dead ends: 16 [2020-06-22 10:21:26,065 INFO L631 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-06-22 10:21:26,066 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states. [2020-06-22 10:21:26,067 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 16. [2020-06-22 10:21:26,068 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2020-06-22 10:21:26,068 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 25 transitions. [2020-06-22 10:21:26,068 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 25 transitions. Word has length 4 [2020-06-22 10:21:26,068 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-06-22 10:21:26,069 INFO L480 AbstractCegarLoop]: Abstraction has 16 states and 25 transitions. [2020-06-22 10:21:26,069 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-06-22 10:21:26,069 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 25 transitions. [2020-06-22 10:21:26,069 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2020-06-22 10:21:26,070 INFO L394 BasicCegarLoop]: Found error trace [2020-06-22 10:21:26,070 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2020-06-22 10:21:26,070 INFO L423 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION]=== [2020-06-22 10:21:26,070 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 10:21:26,070 INFO L82 PathProgramCache]: Analyzing trace with hash 3199034, now seen corresponding path program 1 times [2020-06-22 10:21:26,071 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 10:21:26,071 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 10:21:26,072 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 10:21:26,072 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 10:21:26,072 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 10:21:26,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 10:21:26,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-06-22 10:21:26,097 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-06-22 10:21:26,098 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-06-22 10:21:26,098 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-06-22 10:21:26,098 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-06-22 10:21:26,098 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-06-22 10:21:26,099 INFO L87 Difference]: Start difference. First operand 16 states and 25 transitions. Second operand 3 states. [2020-06-22 10:21:26,128 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-06-22 10:21:26,129 INFO L93 Difference]: Finished difference Result 20 states and 25 transitions. [2020-06-22 10:21:26,129 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-06-22 10:21:26,129 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 4 [2020-06-22 10:21:26,129 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-06-22 10:21:26,130 INFO L225 Difference]: With dead ends: 20 [2020-06-22 10:21:26,130 INFO L226 Difference]: Without dead ends: 16 [2020-06-22 10:21:26,130 INFO L631 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-06-22 10:21:26,131 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states. [2020-06-22 10:21:26,132 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 16. [2020-06-22 10:21:26,133 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2020-06-22 10:21:26,133 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 21 transitions. [2020-06-22 10:21:26,133 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 21 transitions. Word has length 4 [2020-06-22 10:21:26,133 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-06-22 10:21:26,134 INFO L480 AbstractCegarLoop]: Abstraction has 16 states and 21 transitions. [2020-06-22 10:21:26,134 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-06-22 10:21:26,134 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 21 transitions. [2020-06-22 10:21:26,134 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2020-06-22 10:21:26,134 INFO L394 BasicCegarLoop]: Found error trace [2020-06-22 10:21:26,134 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2020-06-22 10:21:26,135 INFO L423 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION]=== [2020-06-22 10:21:26,135 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 10:21:26,135 INFO L82 PathProgramCache]: Analyzing trace with hash 3199035, now seen corresponding path program 1 times [2020-06-22 10:21:26,135 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 10:21:26,135 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 10:21:26,136 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 10:21:26,136 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 10:21:26,136 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 10:21:26,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 10:21:26,163 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-06-22 10:21:26,163 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-06-22 10:21:26,164 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-06-22 10:21:26,164 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-06-22 10:21:26,164 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-06-22 10:21:26,164 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-06-22 10:21:26,165 INFO L87 Difference]: Start difference. First operand 16 states and 21 transitions. Second operand 3 states. [2020-06-22 10:21:26,199 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-06-22 10:21:26,199 INFO L93 Difference]: Finished difference Result 16 states and 21 transitions. [2020-06-22 10:21:26,200 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-06-22 10:21:26,200 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 4 [2020-06-22 10:21:26,200 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-06-22 10:21:26,200 INFO L225 Difference]: With dead ends: 16 [2020-06-22 10:21:26,200 INFO L226 Difference]: Without dead ends: 0 [2020-06-22 10:21:26,201 INFO L631 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-06-22 10:21:26,201 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2020-06-22 10:21:26,201 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2020-06-22 10:21:26,201 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2020-06-22 10:21:26,202 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2020-06-22 10:21:26,202 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 4 [2020-06-22 10:21:26,202 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-06-22 10:21:26,202 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-06-22 10:21:26,202 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-06-22 10:21:26,202 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-06-22 10:21:26,202 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-06-22 10:21:26,207 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2020-06-22 10:21:26,230 INFO L448 ceAbstractionStarter]: For program point L13(line 13) no Hoare annotation was computed. [2020-06-22 10:21:26,230 INFO L448 ceAbstractionStarter]: For program point L11(lines 11 14) no Hoare annotation was computed. [2020-06-22 10:21:26,230 INFO L448 ceAbstractionStarter]: For program point L13-2(line 13) no Hoare annotation was computed. [2020-06-22 10:21:26,231 INFO L448 ceAbstractionStarter]: For program point L9(line 9) no Hoare annotation was computed. [2020-06-22 10:21:26,231 INFO L444 ceAbstractionStarter]: At program point L11-2(lines 10 14) the Hoare annotation is: (and (= 0 ULTIMATE.start_mlog_~x_ref~0.offset) (= (select |#length| ULTIMATE.start_mlog_~res~0.base) 4) (= 0 ULTIMATE.start_mlog_~res~0.offset) (= 1 (select |#valid| ULTIMATE.start_mlog_~x_ref~0.base)) (= 4 (select |#length| ULTIMATE.start_mlog_~x_ref~0.base)) (= (select |#valid| ULTIMATE.start_mlog_~res~0.base) 1)) [2020-06-22 10:21:26,231 INFO L448 ceAbstractionStarter]: For program point L9-1(line 9) no Hoare annotation was computed. [2020-06-22 10:21:26,231 INFO L448 ceAbstractionStarter]: For program point L11-3(lines 11 14) no Hoare annotation was computed. [2020-06-22 10:21:26,231 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr9REQUIRES_VIOLATION(line 12) no Hoare annotation was computed. [2020-06-22 10:21:26,232 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr8REQUIRES_VIOLATION(line 12) no Hoare annotation was computed. [2020-06-22 10:21:26,232 INFO L448 ceAbstractionStarter]: For program point L-1(line -1) no Hoare annotation was computed. [2020-06-22 10:21:26,232 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr7REQUIRES_VIOLATION(line 12) no Hoare annotation was computed. [2020-06-22 10:21:26,232 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr6REQUIRES_VIOLATION(line 12) no Hoare annotation was computed. [2020-06-22 10:21:26,232 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2020-06-22 10:21:26,232 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr5REQUIRES_VIOLATION(line 11) no Hoare annotation was computed. [2020-06-22 10:21:26,232 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr4REQUIRES_VIOLATION(line 11) no Hoare annotation was computed. [2020-06-22 10:21:26,232 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr3REQUIRES_VIOLATION(line 10) no Hoare annotation was computed. [2020-06-22 10:21:26,233 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr2REQUIRES_VIOLATION(line 10) no Hoare annotation was computed. [2020-06-22 10:21:26,233 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr15REQUIRES_VIOLATION(line 15) no Hoare annotation was computed. [2020-06-22 10:21:26,233 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr14REQUIRES_VIOLATION(line 15) no Hoare annotation was computed. [2020-06-22 10:21:26,233 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr13REQUIRES_VIOLATION(line 13) no Hoare annotation was computed. [2020-06-22 10:21:26,233 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr12REQUIRES_VIOLATION(line 13) no Hoare annotation was computed. [2020-06-22 10:21:26,233 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr11REQUIRES_VIOLATION(line 13) no Hoare annotation was computed. [2020-06-22 10:21:26,233 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr10REQUIRES_VIOLATION(line 13) no Hoare annotation was computed. [2020-06-22 10:21:26,233 INFO L448 ceAbstractionStarter]: For program point L12(line 12) no Hoare annotation was computed. [2020-06-22 10:21:26,233 INFO L448 ceAbstractionStarter]: For program point L12-1(line 12) no Hoare annotation was computed. [2020-06-22 10:21:26,234 INFO L448 ceAbstractionStarter]: For program point L12-2(line 12) no Hoare annotation was computed. [2020-06-22 10:21:26,234 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr1REQUIRES_VIOLATION(line 9) no Hoare annotation was computed. [2020-06-22 10:21:26,234 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr0REQUIRES_VIOLATION(line 9) no Hoare annotation was computed. [2020-06-22 10:21:26,234 INFO L305 ceAbstractionStarter]: Did not count any witness invariants because Icfg is not BoogieIcfg [2020-06-22 10:21:26,243 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 10:21:26,244 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 10:21:26,249 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 10:21:26,250 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 10:21:26,252 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 22.06 10:21:26 BasicIcfg [2020-06-22 10:21:26,252 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-06-22 10:21:26,253 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2020-06-22 10:21:26,253 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2020-06-22 10:21:26,257 INFO L276 PluginConnector]: BuchiAutomizer initialized [2020-06-22 10:21:26,257 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-06-22 10:21:26,258 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 22.06 10:21:24" (1/5) ... [2020-06-22 10:21:26,258 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@318d4613 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 22.06 10:21:26, skipping insertion in model container [2020-06-22 10:21:26,258 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-06-22 10:21:26,258 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 10:21:24" (2/5) ... [2020-06-22 10:21:26,259 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@318d4613 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 22.06 10:21:26, skipping insertion in model container [2020-06-22 10:21:26,259 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-06-22 10:21:26,259 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.06 10:21:25" (3/5) ... [2020-06-22 10:21:26,259 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@318d4613 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 22.06 10:21:26, skipping insertion in model container [2020-06-22 10:21:26,259 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-06-22 10:21:26,260 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 22.06 10:21:25" (4/5) ... [2020-06-22 10:21:26,260 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@318d4613 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 22.06 10:21:26, skipping insertion in model container [2020-06-22 10:21:26,260 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-06-22 10:21:26,260 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 22.06 10:21:26" (5/5) ... [2020-06-22 10:21:26,262 INFO L375 chiAutomizerObserver]: Analyzing ICFG theBenchmark.c_BEv2 [2020-06-22 10:21:26,283 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2020-06-22 10:21:26,283 INFO L374 BuchiCegarLoop]: Interprodecural is true [2020-06-22 10:21:26,283 INFO L375 BuchiCegarLoop]: Hoare is true [2020-06-22 10:21:26,283 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2020-06-22 10:21:26,283 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2020-06-22 10:21:26,283 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-06-22 10:21:26,284 INFO L379 BuchiCegarLoop]: Difference is false [2020-06-22 10:21:26,284 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-06-22 10:21:26,284 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2020-06-22 10:21:26,287 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 28 states. [2020-06-22 10:21:26,293 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2020-06-22 10:21:26,293 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-06-22 10:21:26,294 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-06-22 10:21:26,298 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2020-06-22 10:21:26,298 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1] [2020-06-22 10:21:26,298 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2020-06-22 10:21:26,299 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 28 states. [2020-06-22 10:21:26,301 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2020-06-22 10:21:26,301 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-06-22 10:21:26,301 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-06-22 10:21:26,301 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2020-06-22 10:21:26,301 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1] [2020-06-22 10:21:26,307 INFO L794 eck$LassoCheckResult]: Stem: 24#ULTIMATE.startENTRYtrue [73] ULTIMATE.startENTRY-->L-1: Formula: (and (= |v_#NULL.offset_1| 0) (= |v_#NULL.base_1| 0) (= |v_#valid_1| (store |v_#valid_2| 0 0))) InVars {#valid=|v_#valid_2|} OutVars{#NULL.offset=|v_#NULL.offset_1|, #NULL.base=|v_#NULL.base_1|, #valid=|v_#valid_1|} AuxVars[] AssignedVars[#valid, #NULL.offset, #NULL.base] 12#L-1true [106] L-1-->L9: Formula: (let ((.cse0 (store |v_#valid_5| |v_ULTIMATE.start_mlog_#t~malloc0.base_1| 1))) (and (= 0 |v_ULTIMATE.start_mlog_#t~malloc0.offset_1|) (> 0 |v_ULTIMATE.start_mlog_#t~malloc0.base_1|) (= (store (store |v_#length_3| |v_ULTIMATE.start_mlog_#t~malloc0.base_1| 4) |v_ULTIMATE.start_mlog_#t~malloc1.base_1| 4) |v_#length_1|) (< |v_ULTIMATE.start_mlog_#t~malloc1.base_1| |v_#StackHeapBarrier_1|) (= |v_ULTIMATE.start_mlog_#in~x_1| |v_ULTIMATE.start_main_#t~nondet7_1|) (= v_ULTIMATE.start_mlog_~x_1 |v_ULTIMATE.start_mlog_#in~x_1|) (= 0 |v_ULTIMATE.start_mlog_#t~malloc1.offset_1|) (= v_ULTIMATE.start_mlog_~res~0.offset_1 |v_ULTIMATE.start_mlog_#t~malloc1.offset_1|) (= v_ULTIMATE.start_mlog_~res~0.base_1 |v_ULTIMATE.start_mlog_#t~malloc1.base_1|) (= |v_#valid_3| (store .cse0 |v_ULTIMATE.start_mlog_#t~malloc1.base_1| 1)) (= (select .cse0 |v_ULTIMATE.start_mlog_#t~malloc1.base_1|) 0) (< |v_ULTIMATE.start_mlog_#t~malloc0.base_1| |v_#StackHeapBarrier_1|) (= v_ULTIMATE.start_mlog_~x_ref~0.base_1 |v_ULTIMATE.start_mlog_#t~malloc0.base_1|) (> 0 |v_ULTIMATE.start_mlog_#t~malloc1.base_1|) (= v_ULTIMATE.start_mlog_~x_ref~0.offset_1 |v_ULTIMATE.start_mlog_#t~malloc0.offset_1|) (= 0 (select |v_#valid_5| |v_ULTIMATE.start_mlog_#t~malloc0.base_1|)))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_3|, #valid=|v_#valid_5|} OutVars{ULTIMATE.start_mlog_~x_ref~0.offset=v_ULTIMATE.start_mlog_~x_ref~0.offset_1, ULTIMATE.start_mlog_~res~0.offset=v_ULTIMATE.start_mlog_~res~0.offset_1, ULTIMATE.start_mlog_#t~mem6=|v_ULTIMATE.start_mlog_#t~mem6_1|, ULTIMATE.start_mlog_#t~mem2=|v_ULTIMATE.start_mlog_#t~mem2_1|, ULTIMATE.start_mlog_~res~0.base=v_ULTIMATE.start_mlog_~res~0.base_1, ULTIMATE.start_mlog_#t~mem4=|v_ULTIMATE.start_mlog_#t~mem4_1|, ULTIMATE.start_mlog_#t~mem3=|v_ULTIMATE.start_mlog_#t~mem3_1|, ULTIMATE.start_mlog_#t~malloc1.offset=|v_ULTIMATE.start_mlog_#t~malloc1.offset_1|, ULTIMATE.start_mlog_#res=|v_ULTIMATE.start_mlog_#res_1|, ULTIMATE.start_main_#t~nondet7=|v_ULTIMATE.start_main_#t~nondet7_1|, ULTIMATE.start_mlog_#t~post5=|v_ULTIMATE.start_mlog_#t~post5_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, ULTIMATE.start_mlog_#in~x=|v_ULTIMATE.start_mlog_#in~x_1|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_1|, ULTIMATE.start_mlog_#t~malloc0.offset=|v_ULTIMATE.start_mlog_#t~malloc0.offset_1|, #valid=|v_#valid_3|, ULTIMATE.start_mlog_#t~malloc1.base=|v_ULTIMATE.start_mlog_#t~malloc1.base_1|, ULTIMATE.start_mlog_#t~malloc0.base=|v_ULTIMATE.start_mlog_#t~malloc0.base_1|, ULTIMATE.start_mlog_~x_ref~0.base=v_ULTIMATE.start_mlog_~x_ref~0.base_1, #length=|v_#length_1|, ULTIMATE.start_main_#t~ret8=|v_ULTIMATE.start_main_#t~ret8_1|, ULTIMATE.start_mlog_~x=v_ULTIMATE.start_mlog_~x_1} AuxVars[] AssignedVars[ULTIMATE.start_mlog_~x_ref~0.offset, ULTIMATE.start_mlog_~res~0.offset, ULTIMATE.start_mlog_#t~mem6, ULTIMATE.start_mlog_#t~mem2, ULTIMATE.start_mlog_~res~0.base, ULTIMATE.start_mlog_#t~mem4, ULTIMATE.start_mlog_#t~mem3, ULTIMATE.start_mlog_#t~malloc1.offset, ULTIMATE.start_mlog_#res, ULTIMATE.start_main_#t~nondet7, ULTIMATE.start_mlog_#t~post5, ULTIMATE.start_mlog_#in~x, ULTIMATE.start_main_#res, ULTIMATE.start_mlog_#t~malloc0.offset, #valid, ULTIMATE.start_mlog_#t~malloc1.base, ULTIMATE.start_mlog_#t~malloc0.base, ULTIMATE.start_mlog_~x_ref~0.base, #length, ULTIMATE.start_main_#t~ret8, ULTIMATE.start_mlog_~x] 9#L9true [54] L9-->L9-1: Formula: (and (<= (+ v_ULTIMATE.start_mlog_~x_ref~0.offset_3 4) (select |v_#length_4| v_ULTIMATE.start_mlog_~x_ref~0.base_3)) (= |v_#memory_int_1| (store |v_#memory_int_2| v_ULTIMATE.start_mlog_~x_ref~0.base_3 (store (select |v_#memory_int_2| v_ULTIMATE.start_mlog_~x_ref~0.base_3) v_ULTIMATE.start_mlog_~x_ref~0.offset_3 v_ULTIMATE.start_mlog_~x_3))) (= 1 (select |v_#valid_6| v_ULTIMATE.start_mlog_~x_ref~0.base_3)) (<= 0 v_ULTIMATE.start_mlog_~x_ref~0.offset_3)) InVars {ULTIMATE.start_mlog_~x_ref~0.offset=v_ULTIMATE.start_mlog_~x_ref~0.offset_3, #valid=|v_#valid_6|, #memory_int=|v_#memory_int_2|, ULTIMATE.start_mlog_~x_ref~0.base=v_ULTIMATE.start_mlog_~x_ref~0.base_3, #length=|v_#length_4|, ULTIMATE.start_mlog_~x=v_ULTIMATE.start_mlog_~x_3} OutVars{ULTIMATE.start_mlog_~x_ref~0.offset=v_ULTIMATE.start_mlog_~x_ref~0.offset_3, #valid=|v_#valid_6|, #memory_int=|v_#memory_int_1|, ULTIMATE.start_mlog_~x_ref~0.base=v_ULTIMATE.start_mlog_~x_ref~0.base_3, #length=|v_#length_4|, ULTIMATE.start_mlog_~x=v_ULTIMATE.start_mlog_~x_3} AuxVars[] AssignedVars[#memory_int] 6#L9-1true [48] L9-1-->L11-2: Formula: (and (<= (+ v_ULTIMATE.start_mlog_~res~0.offset_3 4) (select |v_#length_6| v_ULTIMATE.start_mlog_~res~0.base_3)) (= |v_#memory_int_3| (store |v_#memory_int_4| v_ULTIMATE.start_mlog_~res~0.base_3 (store (select |v_#memory_int_4| v_ULTIMATE.start_mlog_~res~0.base_3) v_ULTIMATE.start_mlog_~res~0.offset_3 0))) (= 1 (select |v_#valid_8| v_ULTIMATE.start_mlog_~res~0.base_3)) (<= 0 v_ULTIMATE.start_mlog_~res~0.offset_3)) InVars {ULTIMATE.start_mlog_~res~0.offset=v_ULTIMATE.start_mlog_~res~0.offset_3, #memory_int=|v_#memory_int_4|, #length=|v_#length_6|, ULTIMATE.start_mlog_~res~0.base=v_ULTIMATE.start_mlog_~res~0.base_3, #valid=|v_#valid_8|} OutVars{ULTIMATE.start_mlog_~res~0.offset=v_ULTIMATE.start_mlog_~res~0.offset_3, #memory_int=|v_#memory_int_3|, #length=|v_#length_6|, ULTIMATE.start_mlog_~res~0.base=v_ULTIMATE.start_mlog_~res~0.base_3, #valid=|v_#valid_8|} AuxVars[] AssignedVars[#memory_int] 10#L11-2true [2020-06-22 10:21:26,308 INFO L796 eck$LassoCheckResult]: Loop: 10#L11-2true [58] L11-2-->L11: Formula: (and (<= (+ v_ULTIMATE.start_mlog_~x_ref~0.offset_5 4) (select |v_#length_8| v_ULTIMATE.start_mlog_~x_ref~0.base_6)) (<= 0 v_ULTIMATE.start_mlog_~x_ref~0.offset_5) (= |v_ULTIMATE.start_mlog_#t~mem2_2| (select (select |v_#memory_int_5| v_ULTIMATE.start_mlog_~x_ref~0.base_6) v_ULTIMATE.start_mlog_~x_ref~0.offset_5)) (= 1 (select |v_#valid_10| v_ULTIMATE.start_mlog_~x_ref~0.base_6))) InVars {ULTIMATE.start_mlog_~x_ref~0.offset=v_ULTIMATE.start_mlog_~x_ref~0.offset_5, #memory_int=|v_#memory_int_5|, ULTIMATE.start_mlog_~x_ref~0.base=v_ULTIMATE.start_mlog_~x_ref~0.base_6, #length=|v_#length_8|, #valid=|v_#valid_10|} OutVars{ULTIMATE.start_mlog_~x_ref~0.offset=v_ULTIMATE.start_mlog_~x_ref~0.offset_5, ULTIMATE.start_mlog_#t~mem2=|v_ULTIMATE.start_mlog_#t~mem2_2|, #valid=|v_#valid_10|, #memory_int=|v_#memory_int_5|, ULTIMATE.start_mlog_~x_ref~0.base=v_ULTIMATE.start_mlog_~x_ref~0.base_6, #length=|v_#length_8|} AuxVars[] AssignedVars[ULTIMATE.start_mlog_#t~mem2] 25#L11true [75] L11-->L12: Formula: (< 1 |v_ULTIMATE.start_mlog_#t~mem2_6|) InVars {ULTIMATE.start_mlog_#t~mem2=|v_ULTIMATE.start_mlog_#t~mem2_6|} OutVars{ULTIMATE.start_mlog_#t~mem2=|v_ULTIMATE.start_mlog_#t~mem2_5|} AuxVars[] AssignedVars[ULTIMATE.start_mlog_#t~mem2] 17#L12true [66] L12-->L12-1: Formula: (and (<= (+ v_ULTIMATE.start_mlog_~x_ref~0.offset_7 4) (select |v_#length_10| v_ULTIMATE.start_mlog_~x_ref~0.base_9)) (<= 0 v_ULTIMATE.start_mlog_~x_ref~0.offset_7) (= (select (select |v_#memory_int_6| v_ULTIMATE.start_mlog_~x_ref~0.base_9) v_ULTIMATE.start_mlog_~x_ref~0.offset_7) |v_ULTIMATE.start_mlog_#t~mem3_2|) (= 1 (select |v_#valid_12| v_ULTIMATE.start_mlog_~x_ref~0.base_9))) InVars {ULTIMATE.start_mlog_~x_ref~0.offset=v_ULTIMATE.start_mlog_~x_ref~0.offset_7, #memory_int=|v_#memory_int_6|, ULTIMATE.start_mlog_~x_ref~0.base=v_ULTIMATE.start_mlog_~x_ref~0.base_9, #length=|v_#length_10|, #valid=|v_#valid_12|} OutVars{ULTIMATE.start_mlog_~x_ref~0.offset=v_ULTIMATE.start_mlog_~x_ref~0.offset_7, ULTIMATE.start_mlog_#t~mem3=|v_ULTIMATE.start_mlog_#t~mem3_2|, #valid=|v_#valid_12|, #memory_int=|v_#memory_int_6|, ULTIMATE.start_mlog_~x_ref~0.base=v_ULTIMATE.start_mlog_~x_ref~0.base_9, #length=|v_#length_10|} AuxVars[] AssignedVars[ULTIMATE.start_mlog_#t~mem3] 15#L12-1true [128] L12-1-->L12-2: Formula: (and (= (store |v_#memory_int_8| v_ULTIMATE.start_mlog_~x_ref~0.base_12 (store (select |v_#memory_int_8| v_ULTIMATE.start_mlog_~x_ref~0.base_12) v_ULTIMATE.start_mlog_~x_ref~0.offset_9 (+ (div |v_ULTIMATE.start_mlog_#t~mem3_3| 2) 1))) |v_#memory_int_7|) (<= (+ v_ULTIMATE.start_mlog_~x_ref~0.offset_9 4) (select |v_#length_12| v_ULTIMATE.start_mlog_~x_ref~0.base_12)) (< |v_ULTIMATE.start_mlog_#t~mem3_3| 0) (< 0 (mod |v_ULTIMATE.start_mlog_#t~mem3_3| 2)) (<= 0 v_ULTIMATE.start_mlog_~x_ref~0.offset_9) (= 1 (select |v_#valid_14| v_ULTIMATE.start_mlog_~x_ref~0.base_12))) InVars {ULTIMATE.start_mlog_~x_ref~0.offset=v_ULTIMATE.start_mlog_~x_ref~0.offset_9, #valid=|v_#valid_14|, ULTIMATE.start_mlog_#t~mem3=|v_ULTIMATE.start_mlog_#t~mem3_3|, #memory_int=|v_#memory_int_8|, #length=|v_#length_12|, ULTIMATE.start_mlog_~x_ref~0.base=v_ULTIMATE.start_mlog_~x_ref~0.base_12} OutVars{ULTIMATE.start_mlog_~x_ref~0.offset=v_ULTIMATE.start_mlog_~x_ref~0.offset_9, #valid=|v_#valid_14|, ULTIMATE.start_mlog_#t~mem3=|v_ULTIMATE.start_mlog_#t~mem3_3|, #memory_int=|v_#memory_int_7|, #length=|v_#length_12|, ULTIMATE.start_mlog_~x_ref~0.base=v_ULTIMATE.start_mlog_~x_ref~0.base_12} AuxVars[] AssignedVars[#memory_int] 14#L12-2true [62] L12-2-->L13: Formula: true InVars {} OutVars{ULTIMATE.start_mlog_#t~mem3=|v_ULTIMATE.start_mlog_#t~mem3_4|} AuxVars[] AssignedVars[ULTIMATE.start_mlog_#t~mem3] 28#L13true [146] L13-->L13-2: Formula: (and (<= 0 v_ULTIMATE.start_mlog_~res~0.offset_14) (= (select (select |v_#memory_int_16| v_ULTIMATE.start_mlog_~res~0.base_18) v_ULTIMATE.start_mlog_~res~0.offset_14) |v_ULTIMATE.start_mlog_#t~mem4_5|) (= |v_ULTIMATE.start_mlog_#t~post5_5| |v_ULTIMATE.start_mlog_#t~mem4_5|) (= (select |v_#valid_31| v_ULTIMATE.start_mlog_~res~0.base_18) 1) (<= (+ v_ULTIMATE.start_mlog_~res~0.offset_14 4) (select |v_#length_23| v_ULTIMATE.start_mlog_~res~0.base_18))) InVars {ULTIMATE.start_mlog_~res~0.offset=v_ULTIMATE.start_mlog_~res~0.offset_14, ULTIMATE.start_mlog_~res~0.base=v_ULTIMATE.start_mlog_~res~0.base_18, #valid=|v_#valid_31|, #memory_int=|v_#memory_int_16|, #length=|v_#length_23|} OutVars{ULTIMATE.start_mlog_~res~0.offset=v_ULTIMATE.start_mlog_~res~0.offset_14, ULTIMATE.start_mlog_~res~0.base=v_ULTIMATE.start_mlog_~res~0.base_18, ULTIMATE.start_mlog_#t~mem4=|v_ULTIMATE.start_mlog_#t~mem4_5|, #valid=|v_#valid_31|, #memory_int=|v_#memory_int_16|, #length=|v_#length_23|, ULTIMATE.start_mlog_#t~post5=|v_ULTIMATE.start_mlog_#t~post5_5|} AuxVars[] AssignedVars[ULTIMATE.start_mlog_#t~mem4, ULTIMATE.start_mlog_#t~post5] 26#L13-2true [148] L13-2-->L11-2: Formula: (and (= (select |v_#valid_34| v_ULTIMATE.start_mlog_~res~0.base_20) 1) (<= 0 v_ULTIMATE.start_mlog_~res~0.offset_16) (<= (+ v_ULTIMATE.start_mlog_~res~0.offset_16 4) (select |v_#length_25| v_ULTIMATE.start_mlog_~res~0.base_20)) (= (store |v_#memory_int_19| v_ULTIMATE.start_mlog_~res~0.base_20 (store (select |v_#memory_int_19| v_ULTIMATE.start_mlog_~res~0.base_20) v_ULTIMATE.start_mlog_~res~0.offset_16 (+ |v_ULTIMATE.start_mlog_#t~post5_7| 1))) |v_#memory_int_18|)) InVars {ULTIMATE.start_mlog_~res~0.offset=v_ULTIMATE.start_mlog_~res~0.offset_16, ULTIMATE.start_mlog_~res~0.base=v_ULTIMATE.start_mlog_~res~0.base_20, #valid=|v_#valid_34|, #memory_int=|v_#memory_int_19|, #length=|v_#length_25|, ULTIMATE.start_mlog_#t~post5=|v_ULTIMATE.start_mlog_#t~post5_7|} OutVars{ULTIMATE.start_mlog_~res~0.offset=v_ULTIMATE.start_mlog_~res~0.offset_16, ULTIMATE.start_mlog_~res~0.base=v_ULTIMATE.start_mlog_~res~0.base_20, ULTIMATE.start_mlog_#t~mem4=|v_ULTIMATE.start_mlog_#t~mem4_6|, #valid=|v_#valid_34|, #memory_int=|v_#memory_int_18|, #length=|v_#length_25|, ULTIMATE.start_mlog_#t~post5=|v_ULTIMATE.start_mlog_#t~post5_6|} AuxVars[] AssignedVars[ULTIMATE.start_mlog_#t~mem4, #memory_int, ULTIMATE.start_mlog_#t~post5] 10#L11-2true [2020-06-22 10:21:26,309 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 10:21:26,309 INFO L82 PathProgramCache]: Analyzing trace with hash 3201852, now seen corresponding path program 1 times [2020-06-22 10:21:26,309 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 10:21:26,309 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 10:21:26,310 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 10:21:26,310 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 10:21:26,310 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 10:21:26,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 10:21:26,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 10:21:26,353 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 10:21:26,354 INFO L82 PathProgramCache]: Analyzing trace with hash -404534800, now seen corresponding path program 1 times [2020-06-22 10:21:26,354 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 10:21:26,354 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 10:21:26,355 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 10:21:26,356 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 10:21:26,356 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 10:21:26,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 10:21:26,400 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-06-22 10:21:26,400 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-06-22 10:21:26,400 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-06-22 10:21:26,401 INFO L811 eck$LassoCheckResult]: loop already infeasible [2020-06-22 10:21:26,402 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-06-22 10:21:26,403 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-06-22 10:21:26,403 INFO L87 Difference]: Start difference. First operand 28 states. Second operand 5 states. [2020-06-22 10:21:26,593 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-06-22 10:21:26,593 INFO L93 Difference]: Finished difference Result 28 states and 48 transitions. [2020-06-22 10:21:26,593 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-06-22 10:21:26,596 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 28 states and 48 transitions. [2020-06-22 10:21:26,598 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2020-06-22 10:21:26,598 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 28 states to 11 states and 15 transitions. [2020-06-22 10:21:26,599 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 11 [2020-06-22 10:21:26,600 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 11 [2020-06-22 10:21:26,600 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11 states and 15 transitions. [2020-06-22 10:21:26,601 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-06-22 10:21:26,601 INFO L706 BuchiCegarLoop]: Abstraction has 11 states and 15 transitions. [2020-06-22 10:21:26,602 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11 states and 15 transitions. [2020-06-22 10:21:26,603 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11 to 11. [2020-06-22 10:21:26,603 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2020-06-22 10:21:26,603 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 15 transitions. [2020-06-22 10:21:26,603 INFO L729 BuchiCegarLoop]: Abstraction has 11 states and 15 transitions. [2020-06-22 10:21:26,603 INFO L609 BuchiCegarLoop]: Abstraction has 11 states and 15 transitions. [2020-06-22 10:21:26,604 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2020-06-22 10:21:26,604 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 11 states and 15 transitions. [2020-06-22 10:21:26,604 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2020-06-22 10:21:26,604 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-06-22 10:21:26,604 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-06-22 10:21:26,605 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2020-06-22 10:21:26,605 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1] [2020-06-22 10:21:26,606 INFO L794 eck$LassoCheckResult]: Stem: 73#ULTIMATE.startENTRY [73] ULTIMATE.startENTRY-->L-1: Formula: (and (= |v_#NULL.offset_1| 0) (= |v_#NULL.base_1| 0) (= |v_#valid_1| (store |v_#valid_2| 0 0))) InVars {#valid=|v_#valid_2|} OutVars{#NULL.offset=|v_#NULL.offset_1|, #NULL.base=|v_#NULL.base_1|, #valid=|v_#valid_1|} AuxVars[] AssignedVars[#valid, #NULL.offset, #NULL.base] 69#L-1 [106] L-1-->L9: Formula: (let ((.cse0 (store |v_#valid_5| |v_ULTIMATE.start_mlog_#t~malloc0.base_1| 1))) (and (= 0 |v_ULTIMATE.start_mlog_#t~malloc0.offset_1|) (> 0 |v_ULTIMATE.start_mlog_#t~malloc0.base_1|) (= (store (store |v_#length_3| |v_ULTIMATE.start_mlog_#t~malloc0.base_1| 4) |v_ULTIMATE.start_mlog_#t~malloc1.base_1| 4) |v_#length_1|) (< |v_ULTIMATE.start_mlog_#t~malloc1.base_1| |v_#StackHeapBarrier_1|) (= |v_ULTIMATE.start_mlog_#in~x_1| |v_ULTIMATE.start_main_#t~nondet7_1|) (= v_ULTIMATE.start_mlog_~x_1 |v_ULTIMATE.start_mlog_#in~x_1|) (= 0 |v_ULTIMATE.start_mlog_#t~malloc1.offset_1|) (= v_ULTIMATE.start_mlog_~res~0.offset_1 |v_ULTIMATE.start_mlog_#t~malloc1.offset_1|) (= v_ULTIMATE.start_mlog_~res~0.base_1 |v_ULTIMATE.start_mlog_#t~malloc1.base_1|) (= |v_#valid_3| (store .cse0 |v_ULTIMATE.start_mlog_#t~malloc1.base_1| 1)) (= (select .cse0 |v_ULTIMATE.start_mlog_#t~malloc1.base_1|) 0) (< |v_ULTIMATE.start_mlog_#t~malloc0.base_1| |v_#StackHeapBarrier_1|) (= v_ULTIMATE.start_mlog_~x_ref~0.base_1 |v_ULTIMATE.start_mlog_#t~malloc0.base_1|) (> 0 |v_ULTIMATE.start_mlog_#t~malloc1.base_1|) (= v_ULTIMATE.start_mlog_~x_ref~0.offset_1 |v_ULTIMATE.start_mlog_#t~malloc0.offset_1|) (= 0 (select |v_#valid_5| |v_ULTIMATE.start_mlog_#t~malloc0.base_1|)))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_3|, #valid=|v_#valid_5|} OutVars{ULTIMATE.start_mlog_~x_ref~0.offset=v_ULTIMATE.start_mlog_~x_ref~0.offset_1, ULTIMATE.start_mlog_~res~0.offset=v_ULTIMATE.start_mlog_~res~0.offset_1, ULTIMATE.start_mlog_#t~mem6=|v_ULTIMATE.start_mlog_#t~mem6_1|, ULTIMATE.start_mlog_#t~mem2=|v_ULTIMATE.start_mlog_#t~mem2_1|, ULTIMATE.start_mlog_~res~0.base=v_ULTIMATE.start_mlog_~res~0.base_1, ULTIMATE.start_mlog_#t~mem4=|v_ULTIMATE.start_mlog_#t~mem4_1|, ULTIMATE.start_mlog_#t~mem3=|v_ULTIMATE.start_mlog_#t~mem3_1|, ULTIMATE.start_mlog_#t~malloc1.offset=|v_ULTIMATE.start_mlog_#t~malloc1.offset_1|, ULTIMATE.start_mlog_#res=|v_ULTIMATE.start_mlog_#res_1|, ULTIMATE.start_main_#t~nondet7=|v_ULTIMATE.start_main_#t~nondet7_1|, ULTIMATE.start_mlog_#t~post5=|v_ULTIMATE.start_mlog_#t~post5_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, ULTIMATE.start_mlog_#in~x=|v_ULTIMATE.start_mlog_#in~x_1|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_1|, ULTIMATE.start_mlog_#t~malloc0.offset=|v_ULTIMATE.start_mlog_#t~malloc0.offset_1|, #valid=|v_#valid_3|, ULTIMATE.start_mlog_#t~malloc1.base=|v_ULTIMATE.start_mlog_#t~malloc1.base_1|, ULTIMATE.start_mlog_#t~malloc0.base=|v_ULTIMATE.start_mlog_#t~malloc0.base_1|, ULTIMATE.start_mlog_~x_ref~0.base=v_ULTIMATE.start_mlog_~x_ref~0.base_1, #length=|v_#length_1|, ULTIMATE.start_main_#t~ret8=|v_ULTIMATE.start_main_#t~ret8_1|, ULTIMATE.start_mlog_~x=v_ULTIMATE.start_mlog_~x_1} AuxVars[] AssignedVars[ULTIMATE.start_mlog_~x_ref~0.offset, ULTIMATE.start_mlog_~res~0.offset, ULTIMATE.start_mlog_#t~mem6, ULTIMATE.start_mlog_#t~mem2, ULTIMATE.start_mlog_~res~0.base, ULTIMATE.start_mlog_#t~mem4, ULTIMATE.start_mlog_#t~mem3, ULTIMATE.start_mlog_#t~malloc1.offset, ULTIMATE.start_mlog_#res, ULTIMATE.start_main_#t~nondet7, ULTIMATE.start_mlog_#t~post5, ULTIMATE.start_mlog_#in~x, ULTIMATE.start_main_#res, ULTIMATE.start_mlog_#t~malloc0.offset, #valid, ULTIMATE.start_mlog_#t~malloc1.base, ULTIMATE.start_mlog_#t~malloc0.base, ULTIMATE.start_mlog_~x_ref~0.base, #length, ULTIMATE.start_main_#t~ret8, ULTIMATE.start_mlog_~x] 70#L9 [54] L9-->L9-1: Formula: (and (<= (+ v_ULTIMATE.start_mlog_~x_ref~0.offset_3 4) (select |v_#length_4| v_ULTIMATE.start_mlog_~x_ref~0.base_3)) (= |v_#memory_int_1| (store |v_#memory_int_2| v_ULTIMATE.start_mlog_~x_ref~0.base_3 (store (select |v_#memory_int_2| v_ULTIMATE.start_mlog_~x_ref~0.base_3) v_ULTIMATE.start_mlog_~x_ref~0.offset_3 v_ULTIMATE.start_mlog_~x_3))) (= 1 (select |v_#valid_6| v_ULTIMATE.start_mlog_~x_ref~0.base_3)) (<= 0 v_ULTIMATE.start_mlog_~x_ref~0.offset_3)) InVars {ULTIMATE.start_mlog_~x_ref~0.offset=v_ULTIMATE.start_mlog_~x_ref~0.offset_3, #valid=|v_#valid_6|, #memory_int=|v_#memory_int_2|, ULTIMATE.start_mlog_~x_ref~0.base=v_ULTIMATE.start_mlog_~x_ref~0.base_3, #length=|v_#length_4|, ULTIMATE.start_mlog_~x=v_ULTIMATE.start_mlog_~x_3} OutVars{ULTIMATE.start_mlog_~x_ref~0.offset=v_ULTIMATE.start_mlog_~x_ref~0.offset_3, #valid=|v_#valid_6|, #memory_int=|v_#memory_int_1|, ULTIMATE.start_mlog_~x_ref~0.base=v_ULTIMATE.start_mlog_~x_ref~0.base_3, #length=|v_#length_4|, ULTIMATE.start_mlog_~x=v_ULTIMATE.start_mlog_~x_3} AuxVars[] AssignedVars[#memory_int] 79#L9-1 [48] L9-1-->L11-2: Formula: (and (<= (+ v_ULTIMATE.start_mlog_~res~0.offset_3 4) (select |v_#length_6| v_ULTIMATE.start_mlog_~res~0.base_3)) (= |v_#memory_int_3| (store |v_#memory_int_4| v_ULTIMATE.start_mlog_~res~0.base_3 (store (select |v_#memory_int_4| v_ULTIMATE.start_mlog_~res~0.base_3) v_ULTIMATE.start_mlog_~res~0.offset_3 0))) (= 1 (select |v_#valid_8| v_ULTIMATE.start_mlog_~res~0.base_3)) (<= 0 v_ULTIMATE.start_mlog_~res~0.offset_3)) InVars {ULTIMATE.start_mlog_~res~0.offset=v_ULTIMATE.start_mlog_~res~0.offset_3, #memory_int=|v_#memory_int_4|, #length=|v_#length_6|, ULTIMATE.start_mlog_~res~0.base=v_ULTIMATE.start_mlog_~res~0.base_3, #valid=|v_#valid_8|} OutVars{ULTIMATE.start_mlog_~res~0.offset=v_ULTIMATE.start_mlog_~res~0.offset_3, #memory_int=|v_#memory_int_3|, #length=|v_#length_6|, ULTIMATE.start_mlog_~res~0.base=v_ULTIMATE.start_mlog_~res~0.base_3, #valid=|v_#valid_8|} AuxVars[] AssignedVars[#memory_int] 75#L11-2 [2020-06-22 10:21:26,607 INFO L796 eck$LassoCheckResult]: Loop: 75#L11-2 [58] L11-2-->L11: Formula: (and (<= (+ v_ULTIMATE.start_mlog_~x_ref~0.offset_5 4) (select |v_#length_8| v_ULTIMATE.start_mlog_~x_ref~0.base_6)) (<= 0 v_ULTIMATE.start_mlog_~x_ref~0.offset_5) (= |v_ULTIMATE.start_mlog_#t~mem2_2| (select (select |v_#memory_int_5| v_ULTIMATE.start_mlog_~x_ref~0.base_6) v_ULTIMATE.start_mlog_~x_ref~0.offset_5)) (= 1 (select |v_#valid_10| v_ULTIMATE.start_mlog_~x_ref~0.base_6))) InVars {ULTIMATE.start_mlog_~x_ref~0.offset=v_ULTIMATE.start_mlog_~x_ref~0.offset_5, #memory_int=|v_#memory_int_5|, ULTIMATE.start_mlog_~x_ref~0.base=v_ULTIMATE.start_mlog_~x_ref~0.base_6, #length=|v_#length_8|, #valid=|v_#valid_10|} OutVars{ULTIMATE.start_mlog_~x_ref~0.offset=v_ULTIMATE.start_mlog_~x_ref~0.offset_5, ULTIMATE.start_mlog_#t~mem2=|v_ULTIMATE.start_mlog_#t~mem2_2|, #valid=|v_#valid_10|, #memory_int=|v_#memory_int_5|, ULTIMATE.start_mlog_~x_ref~0.base=v_ULTIMATE.start_mlog_~x_ref~0.base_6, #length=|v_#length_8|} AuxVars[] AssignedVars[ULTIMATE.start_mlog_#t~mem2] 76#L11 [75] L11-->L12: Formula: (< 1 |v_ULTIMATE.start_mlog_#t~mem2_6|) InVars {ULTIMATE.start_mlog_#t~mem2=|v_ULTIMATE.start_mlog_#t~mem2_6|} OutVars{ULTIMATE.start_mlog_#t~mem2=|v_ULTIMATE.start_mlog_#t~mem2_5|} AuxVars[] AssignedVars[ULTIMATE.start_mlog_#t~mem2] 77#L12 [66] L12-->L12-1: Formula: (and (<= (+ v_ULTIMATE.start_mlog_~x_ref~0.offset_7 4) (select |v_#length_10| v_ULTIMATE.start_mlog_~x_ref~0.base_9)) (<= 0 v_ULTIMATE.start_mlog_~x_ref~0.offset_7) (= (select (select |v_#memory_int_6| v_ULTIMATE.start_mlog_~x_ref~0.base_9) v_ULTIMATE.start_mlog_~x_ref~0.offset_7) |v_ULTIMATE.start_mlog_#t~mem3_2|) (= 1 (select |v_#valid_12| v_ULTIMATE.start_mlog_~x_ref~0.base_9))) InVars {ULTIMATE.start_mlog_~x_ref~0.offset=v_ULTIMATE.start_mlog_~x_ref~0.offset_7, #memory_int=|v_#memory_int_6|, ULTIMATE.start_mlog_~x_ref~0.base=v_ULTIMATE.start_mlog_~x_ref~0.base_9, #length=|v_#length_10|, #valid=|v_#valid_12|} OutVars{ULTIMATE.start_mlog_~x_ref~0.offset=v_ULTIMATE.start_mlog_~x_ref~0.offset_7, ULTIMATE.start_mlog_#t~mem3=|v_ULTIMATE.start_mlog_#t~mem3_2|, #valid=|v_#valid_12|, #memory_int=|v_#memory_int_6|, ULTIMATE.start_mlog_~x_ref~0.base=v_ULTIMATE.start_mlog_~x_ref~0.base_9, #length=|v_#length_10|} AuxVars[] AssignedVars[ULTIMATE.start_mlog_#t~mem3] 78#L12-1 [129] L12-1-->L12-2: Formula: (and (= |v_#memory_int_7| (store |v_#memory_int_8| v_ULTIMATE.start_mlog_~x_ref~0.base_12 (store (select |v_#memory_int_8| v_ULTIMATE.start_mlog_~x_ref~0.base_12) v_ULTIMATE.start_mlog_~x_ref~0.offset_9 (div |v_ULTIMATE.start_mlog_#t~mem3_3| 2)))) (<= (+ v_ULTIMATE.start_mlog_~x_ref~0.offset_9 4) (select |v_#length_12| v_ULTIMATE.start_mlog_~x_ref~0.base_12)) (= 0 (mod |v_ULTIMATE.start_mlog_#t~mem3_3| 2)) (<= 0 v_ULTIMATE.start_mlog_~x_ref~0.offset_9) (= 1 (select |v_#valid_14| v_ULTIMATE.start_mlog_~x_ref~0.base_12))) InVars {ULTIMATE.start_mlog_~x_ref~0.offset=v_ULTIMATE.start_mlog_~x_ref~0.offset_9, #valid=|v_#valid_14|, ULTIMATE.start_mlog_#t~mem3=|v_ULTIMATE.start_mlog_#t~mem3_3|, #memory_int=|v_#memory_int_8|, #length=|v_#length_12|, ULTIMATE.start_mlog_~x_ref~0.base=v_ULTIMATE.start_mlog_~x_ref~0.base_12} OutVars{ULTIMATE.start_mlog_~x_ref~0.offset=v_ULTIMATE.start_mlog_~x_ref~0.offset_9, #valid=|v_#valid_14|, ULTIMATE.start_mlog_#t~mem3=|v_ULTIMATE.start_mlog_#t~mem3_3|, #memory_int=|v_#memory_int_7|, #length=|v_#length_12|, ULTIMATE.start_mlog_~x_ref~0.base=v_ULTIMATE.start_mlog_~x_ref~0.base_12} AuxVars[] AssignedVars[#memory_int] 71#L12-2 [62] L12-2-->L13: Formula: true InVars {} OutVars{ULTIMATE.start_mlog_#t~mem3=|v_ULTIMATE.start_mlog_#t~mem3_4|} AuxVars[] AssignedVars[ULTIMATE.start_mlog_#t~mem3] 72#L13 [146] L13-->L13-2: Formula: (and (<= 0 v_ULTIMATE.start_mlog_~res~0.offset_14) (= (select (select |v_#memory_int_16| v_ULTIMATE.start_mlog_~res~0.base_18) v_ULTIMATE.start_mlog_~res~0.offset_14) |v_ULTIMATE.start_mlog_#t~mem4_5|) (= |v_ULTIMATE.start_mlog_#t~post5_5| |v_ULTIMATE.start_mlog_#t~mem4_5|) (= (select |v_#valid_31| v_ULTIMATE.start_mlog_~res~0.base_18) 1) (<= (+ v_ULTIMATE.start_mlog_~res~0.offset_14 4) (select |v_#length_23| v_ULTIMATE.start_mlog_~res~0.base_18))) InVars {ULTIMATE.start_mlog_~res~0.offset=v_ULTIMATE.start_mlog_~res~0.offset_14, ULTIMATE.start_mlog_~res~0.base=v_ULTIMATE.start_mlog_~res~0.base_18, #valid=|v_#valid_31|, #memory_int=|v_#memory_int_16|, #length=|v_#length_23|} OutVars{ULTIMATE.start_mlog_~res~0.offset=v_ULTIMATE.start_mlog_~res~0.offset_14, ULTIMATE.start_mlog_~res~0.base=v_ULTIMATE.start_mlog_~res~0.base_18, ULTIMATE.start_mlog_#t~mem4=|v_ULTIMATE.start_mlog_#t~mem4_5|, #valid=|v_#valid_31|, #memory_int=|v_#memory_int_16|, #length=|v_#length_23|, ULTIMATE.start_mlog_#t~post5=|v_ULTIMATE.start_mlog_#t~post5_5|} AuxVars[] AssignedVars[ULTIMATE.start_mlog_#t~mem4, ULTIMATE.start_mlog_#t~post5] 74#L13-2 [148] L13-2-->L11-2: Formula: (and (= (select |v_#valid_34| v_ULTIMATE.start_mlog_~res~0.base_20) 1) (<= 0 v_ULTIMATE.start_mlog_~res~0.offset_16) (<= (+ v_ULTIMATE.start_mlog_~res~0.offset_16 4) (select |v_#length_25| v_ULTIMATE.start_mlog_~res~0.base_20)) (= (store |v_#memory_int_19| v_ULTIMATE.start_mlog_~res~0.base_20 (store (select |v_#memory_int_19| v_ULTIMATE.start_mlog_~res~0.base_20) v_ULTIMATE.start_mlog_~res~0.offset_16 (+ |v_ULTIMATE.start_mlog_#t~post5_7| 1))) |v_#memory_int_18|)) InVars {ULTIMATE.start_mlog_~res~0.offset=v_ULTIMATE.start_mlog_~res~0.offset_16, ULTIMATE.start_mlog_~res~0.base=v_ULTIMATE.start_mlog_~res~0.base_20, #valid=|v_#valid_34|, #memory_int=|v_#memory_int_19|, #length=|v_#length_25|, ULTIMATE.start_mlog_#t~post5=|v_ULTIMATE.start_mlog_#t~post5_7|} OutVars{ULTIMATE.start_mlog_~res~0.offset=v_ULTIMATE.start_mlog_~res~0.offset_16, ULTIMATE.start_mlog_~res~0.base=v_ULTIMATE.start_mlog_~res~0.base_20, ULTIMATE.start_mlog_#t~mem4=|v_ULTIMATE.start_mlog_#t~mem4_6|, #valid=|v_#valid_34|, #memory_int=|v_#memory_int_18|, #length=|v_#length_25|, ULTIMATE.start_mlog_#t~post5=|v_ULTIMATE.start_mlog_#t~post5_6|} AuxVars[] AssignedVars[ULTIMATE.start_mlog_#t~mem4, #memory_int, ULTIMATE.start_mlog_#t~post5] 75#L11-2 [2020-06-22 10:21:26,607 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 10:21:26,607 INFO L82 PathProgramCache]: Analyzing trace with hash 3201852, now seen corresponding path program 2 times [2020-06-22 10:21:26,607 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 10:21:26,607 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 10:21:26,608 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 10:21:26,608 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 10:21:26,608 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 10:21:26,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 10:21:26,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 10:21:26,628 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 10:21:26,628 INFO L82 PathProgramCache]: Analyzing trace with hash -404505009, now seen corresponding path program 1 times [2020-06-22 10:21:26,628 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 10:21:26,628 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 10:21:26,629 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 10:21:26,629 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2020-06-22 10:21:26,629 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 10:21:26,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 10:21:26,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 10:21:26,647 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 10:21:26,647 INFO L82 PathProgramCache]: Analyzing trace with hash -470033740, now seen corresponding path program 1 times [2020-06-22 10:21:26,647 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 10:21:26,647 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 10:21:26,648 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 10:21:26,648 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 10:21:26,649 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 10:21:26,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 10:21:26,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 10:21:26,947 WARN L188 SmtUtils]: Spent 185.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 63 [2020-06-22 10:21:27,042 INFO L216 LassoAnalysis]: Preferences: [2020-06-22 10:21:27,043 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2020-06-22 10:21:27,043 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-06-22 10:21:27,044 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2020-06-22 10:21:27,044 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2020-06-22 10:21:27,044 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-06-22 10:21:27,044 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2020-06-22 10:21:27,044 INFO L130 ssoRankerPreferences]: Path of dumped script: [2020-06-22 10:21:27,044 INFO L131 ssoRankerPreferences]: Filename of dumped script: theBenchmark.c_BEv2_Iteration2_Lasso [2020-06-22 10:21:27,045 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2020-06-22 10:21:27,045 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2020-06-22 10:21:27,065 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 10:21:27,072 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 10:21:27,077 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 10:21:27,269 WARN L188 SmtUtils]: Spent 137.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 52 [2020-06-22 10:21:27,346 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 10:21:27,348 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 10:21:27,350 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 10:21:27,351 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 10:21:27,354 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 10:21:27,355 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 10:21:27,357 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 10:21:27,359 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 10:21:27,660 INFO L300 LassoAnalysis]: Preprocessing complete. [2020-06-22 10:21:27,665 INFO L497 LassoAnalysis]: Using template 'affine'. [2020-06-22 10:21:27,668 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 10:21:27,669 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 10:21:27,670 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 10:21:27,670 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 10:21:27,670 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 10:21:27,670 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 10:21:27,673 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 10:21:27,673 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 10:21:27,675 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 10:21:27,675 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 10:21:27,676 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 10:21:27,676 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 10:21:27,676 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 10:21:27,676 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 10:21:27,677 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 10:21:27,677 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 10:21:27,677 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 10:21:27,678 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 10:21:27,678 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 10:21:27,679 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 10:21:27,679 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 10:21:27,679 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 10:21:27,679 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 10:21:27,683 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-06-22 10:21:27,684 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-06-22 10:21:27,702 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 10:21:27,702 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 10:21:27,703 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 10:21:27,703 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 10:21:27,703 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 10:21:27,703 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 10:21:27,709 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-06-22 10:21:27,709 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-06-22 10:21:27,738 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 10:21:27,739 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 10:21:27,739 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 10:21:27,740 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 10:21:27,740 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 10:21:27,740 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 10:21:27,743 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-06-22 10:21:27,744 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-06-22 10:21:27,766 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2020-06-22 10:21:27,786 INFO L443 ModelExtractionUtils]: Simplification made 5 calls to the SMT solver. [2020-06-22 10:21:27,786 INFO L444 ModelExtractionUtils]: 10 out of 16 variables were initially zero. Simplification set additionally 4 variables to zero. [2020-06-22 10:21:27,789 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2020-06-22 10:21:27,790 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2020-06-22 10:21:27,791 INFO L518 LassoAnalysis]: Proved termination. [2020-06-22 10:21:27,791 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select (select #memory_int ULTIMATE.start_mlog_~x_ref~0.base) ULTIMATE.start_mlog_~x_ref~0.offset)_1) = 1*v_rep(select (select #memory_int ULTIMATE.start_mlog_~x_ref~0.base) ULTIMATE.start_mlog_~x_ref~0.offset)_1 Supporting invariants [] [2020-06-22 10:21:27,823 INFO L297 tatePredicateManager]: 9 out of 11 supporting invariants were superfluous and have been removed [2020-06-22 10:21:27,830 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-06-22 10:21:27,858 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 10:21:27,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 10:21:27,878 INFO L256 TraceCheckSpWp]: Trace formula consists of 43 conjuncts, 8 conjunts are in the unsatisfiable core [2020-06-22 10:21:27,879 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 10:21:27,927 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2020-06-22 10:21:27,927 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-06-22 10:21:27,933 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-06-22 10:21:27,934 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2020-06-22 10:21:27,934 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:13, output treesize:9 [2020-06-22 10:21:27,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 10:21:27,947 INFO L256 TraceCheckSpWp]: Trace formula consists of 39 conjuncts, 10 conjunts are in the unsatisfiable core [2020-06-22 10:21:27,948 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 10:21:28,022 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 19 [2020-06-22 10:21:28,023 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-06-22 10:21:28,034 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-06-22 10:21:28,035 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-06-22 10:21:28,035 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:42, output treesize:23 [2020-06-22 10:21:30,389 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-06-22 10:21:34,128 WARN L860 $PredicateComparison]: unable to prove that (exists ((|ULTIMATE.start_mlog_#t~mem3| Int)) (and (= (div |ULTIMATE.start_mlog_#t~mem3| 2) (select (select |c_#memory_int| c_ULTIMATE.start_mlog_~x_ref~0.base) c_ULTIMATE.start_mlog_~x_ref~0.offset)) (<= |ULTIMATE.start_mlog_#t~mem3| c_oldRank0))) is different from true [2020-06-22 10:21:34,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 10:21:34,147 INFO L137 LoopCannibalizer]: termination argument not suffcient for all loop shiftings [2020-06-22 10:21:34,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 10:21:34,156 INFO L256 TraceCheckSpWp]: Trace formula consists of 39 conjuncts, 10 conjunts are in the unsatisfiable core [2020-06-22 10:21:34,157 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 10:21:34,173 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2020-06-22 10:21:34,173 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-06-22 10:21:34,183 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-06-22 10:21:34,183 INFO L427 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-06-22 10:21:34,184 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:28, output treesize:15 [2020-06-22 10:21:34,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 10:21:34,201 INFO L256 TraceCheckSpWp]: Trace formula consists of 39 conjuncts, 10 conjunts are in the unsatisfiable core [2020-06-22 10:21:34,202 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 10:21:34,210 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2020-06-22 10:21:34,210 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-06-22 10:21:34,222 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-06-22 10:21:34,222 INFO L427 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-06-22 10:21:34,223 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:28, output treesize:15 [2020-06-22 10:21:34,241 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 19 [2020-06-22 10:21:34,242 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-06-22 10:21:34,256 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-06-22 10:21:34,257 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-06-22 10:21:34,257 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:42, output treesize:23 [2020-06-22 10:21:34,260 INFO L98 LoopCannibalizer]: 8 predicates before loop cannibalization 8 predicates after loop cannibalization [2020-06-22 10:21:34,264 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.3 stem predicates 8 loop predicates [2020-06-22 10:21:34,265 INFO L69 BuchiDifferenceNCSB]: Start buchiDifferenceNCSB. First operand 11 states and 15 transitions. cyclomatic complexity: 5 Second operand 7 states. [2020-06-22 10:21:34,411 INFO L73 BuchiDifferenceNCSB]: Finished buchiDifferenceNCSB. First operand 11 states and 15 transitions. cyclomatic complexity: 5. Second operand 7 states. Result 19 states and 24 transitions. Complement of second has 11 states. [2020-06-22 10:21:34,411 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 7 states 2 stem states 4 non-accepting loop states 1 accepting loop states [2020-06-22 10:21:34,412 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2020-06-22 10:21:34,412 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 25 transitions. [2020-06-22 10:21:34,413 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 25 transitions. Stem has 4 letters. Loop has 7 letters. [2020-06-22 10:21:34,414 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-06-22 10:21:34,414 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 25 transitions. Stem has 11 letters. Loop has 7 letters. [2020-06-22 10:21:34,415 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-06-22 10:21:34,415 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 25 transitions. Stem has 4 letters. Loop has 14 letters. [2020-06-22 10:21:34,416 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-06-22 10:21:34,422 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 19 states and 24 transitions. [2020-06-22 10:21:34,423 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2020-06-22 10:21:34,423 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 19 states to 0 states and 0 transitions. [2020-06-22 10:21:34,424 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2020-06-22 10:21:34,424 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2020-06-22 10:21:34,424 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2020-06-22 10:21:34,424 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-06-22 10:21:34,424 INFO L706 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-06-22 10:21:34,424 INFO L729 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-06-22 10:21:34,424 INFO L609 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-06-22 10:21:34,424 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ [2020-06-22 10:21:34,424 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2020-06-22 10:21:34,425 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2020-06-22 10:21:34,425 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2020-06-22 10:21:34,431 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 22.06 10:21:34 BasicIcfg [2020-06-22 10:21:34,431 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2020-06-22 10:21:34,431 INFO L168 Benchmark]: Toolchain (without parser) took 10019.74 ms. Allocated memory was 649.6 MB in the beginning and 761.8 MB in the end (delta: 112.2 MB). Free memory was 559.8 MB in the beginning and 503.3 MB in the end (delta: 56.5 MB). Peak memory consumption was 168.7 MB. Max. memory is 50.3 GB. [2020-06-22 10:21:34,432 INFO L168 Benchmark]: CDTParser took 0.18 ms. Allocated memory is still 649.6 MB. Free memory is still 580.3 MB. There was no memory consumed. Max. memory is 50.3 GB. [2020-06-22 10:21:34,433 INFO L168 Benchmark]: CACSL2BoogieTranslator took 307.11 ms. Allocated memory was 649.6 MB in the beginning and 705.2 MB in the end (delta: 55.6 MB). Free memory was 559.8 MB in the beginning and 669.3 MB in the end (delta: -109.5 MB). Peak memory consumption was 29.2 MB. Max. memory is 50.3 GB. [2020-06-22 10:21:34,433 INFO L168 Benchmark]: Boogie Procedure Inliner took 42.64 ms. Allocated memory is still 705.2 MB. Free memory was 669.3 MB in the beginning and 667.1 MB in the end (delta: 2.2 MB). Peak memory consumption was 2.2 MB. Max. memory is 50.3 GB. [2020-06-22 10:21:34,434 INFO L168 Benchmark]: Boogie Preprocessor took 23.84 ms. Allocated memory is still 705.2 MB. Free memory was 667.1 MB in the beginning and 666.0 MB in the end (delta: 1.1 MB). Peak memory consumption was 1.1 MB. Max. memory is 50.3 GB. [2020-06-22 10:21:34,434 INFO L168 Benchmark]: RCFGBuilder took 335.43 ms. Allocated memory is still 705.2 MB. Free memory was 665.0 MB in the beginning and 643.6 MB in the end (delta: 21.4 MB). Peak memory consumption was 21.4 MB. Max. memory is 50.3 GB. [2020-06-22 10:21:34,435 INFO L168 Benchmark]: BlockEncodingV2 took 145.94 ms. Allocated memory is still 705.2 MB. Free memory was 643.6 MB in the beginning and 633.8 MB in the end (delta: 9.7 MB). Peak memory consumption was 9.7 MB. Max. memory is 50.3 GB. [2020-06-22 10:21:34,435 INFO L168 Benchmark]: TraceAbstraction took 981.65 ms. Allocated memory is still 705.2 MB. Free memory was 633.8 MB in the beginning and 534.6 MB in the end (delta: 99.2 MB). Peak memory consumption was 99.2 MB. Max. memory is 50.3 GB. [2020-06-22 10:21:34,436 INFO L168 Benchmark]: BuchiAutomizer took 8177.82 ms. Allocated memory was 705.2 MB in the beginning and 761.8 MB in the end (delta: 56.6 MB). Free memory was 534.6 MB in the beginning and 503.3 MB in the end (delta: 31.3 MB). Peak memory consumption was 87.9 MB. Max. memory is 50.3 GB. [2020-06-22 10:21:34,440 INFO L337 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.plugins.blockencoding: - StatisticsResult: Initial Icfg 35 locations, 36 edges - StatisticsResult: Encoded RCFG 28 locations, 50 edges * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.18 ms. Allocated memory is still 649.6 MB. Free memory is still 580.3 MB. There was no memory consumed. Max. memory is 50.3 GB. * CACSL2BoogieTranslator took 307.11 ms. Allocated memory was 649.6 MB in the beginning and 705.2 MB in the end (delta: 55.6 MB). Free memory was 559.8 MB in the beginning and 669.3 MB in the end (delta: -109.5 MB). Peak memory consumption was 29.2 MB. Max. memory is 50.3 GB. * Boogie Procedure Inliner took 42.64 ms. Allocated memory is still 705.2 MB. Free memory was 669.3 MB in the beginning and 667.1 MB in the end (delta: 2.2 MB). Peak memory consumption was 2.2 MB. Max. memory is 50.3 GB. * Boogie Preprocessor took 23.84 ms. Allocated memory is still 705.2 MB. Free memory was 667.1 MB in the beginning and 666.0 MB in the end (delta: 1.1 MB). Peak memory consumption was 1.1 MB. Max. memory is 50.3 GB. * RCFGBuilder took 335.43 ms. Allocated memory is still 705.2 MB. Free memory was 665.0 MB in the beginning and 643.6 MB in the end (delta: 21.4 MB). Peak memory consumption was 21.4 MB. Max. memory is 50.3 GB. * BlockEncodingV2 took 145.94 ms. Allocated memory is still 705.2 MB. Free memory was 643.6 MB in the beginning and 633.8 MB in the end (delta: 9.7 MB). Peak memory consumption was 9.7 MB. Max. memory is 50.3 GB. * TraceAbstraction took 981.65 ms. Allocated memory is still 705.2 MB. Free memory was 633.8 MB in the beginning and 534.6 MB in the end (delta: 99.2 MB). Peak memory consumption was 99.2 MB. Max. memory is 50.3 GB. * BuchiAutomizer took 8177.82 ms. Allocated memory was 705.2 MB in the beginning and 761.8 MB in the end (delta: 56.6 MB). Free memory was 534.6 MB in the beginning and 503.3 MB in the end (delta: 31.3 MB). Peak memory consumption was 87.9 MB. Max. memory is 50.3 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - 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: 15]: 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: 12]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 12]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 9]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 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: 9]: 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: 11]: 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: 15]: 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: 10]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - AllSpecificationsHoldResult: All specifications hold 16 specifications checked. All of them hold - InvariantResult [Line: 10]: Loop Invariant [2020-06-22 10:21:34,449 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 10:21:34,449 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 10:21:34,450 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 10:21:34,450 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length Derived loop invariant: ((((0 == x_ref && unknown-#length-unknown[res] == 4) && 0 == res) && 1 == \valid[x_ref]) && 4 == unknown-#length-unknown[x_ref]) && \valid[res] == 1 - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 28 locations, 16 error locations. SAFE Result, 0.9s OverallTime, 6 OverallIterations, 1 TraceHistogramMax, 0.4s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 24 SDtfs, 141 SDslu, 4 SDs, 0 SdLazy, 152 SolverSat, 45 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.2s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 12 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=28occurred in iteration=0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 6 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 1 LocationsWithAnnotation, 1 PreInvPairs, 2 NumberOfFragments, 27 HoareAnnotationTreeSize, 1 FomulaSimplifications, 0 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 1 FomulaSimplificationsInter, 0 FormulaSimplificationTreeSizeReductionInter, 0.0s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.1s InterpolantComputationTime, 21 NumberOfCodeBlocks, 21 NumberOfCodeBlocksAsserted, 6 NumberOfCheckSat, 15 ConstructedInterpolants, 0 QuantifiedInterpolants, 151 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 6 InterpolantComputations, 6 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available - StatisticsResult: Constructed decomposition of program Your program was decomposed into 2 terminating modules (1 trivial, 0 deterministic, 1 nondeterministic). One nondeterministic module has affine ranking function unknown-#memory_int-unknown[x_ref][x_ref] and consists of 7 locations. 1 modules have a trivial ranking function, the largest among these consists of 5 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 8.1s and 3 iterations. TraceHistogramMax:1. Analysis of lassos took 1.3s. Construction of modules took 0.1s. Büchi inclusion checks took 6.6s. Highest rank in rank-based complementation 3. Minimization of det autom 2. Minimization of nondet autom 0. Automata minimization 0.0s AutomataMinimizationTime, 1 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 11 states and ocurred in iteration 1. Nontrivial modules had stage [1, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 11 SDtfs, 62 SDslu, 72 SDs, 0 SdLazy, 205 SolverSat, 27 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.1s Time LassoAnalysisResults: nont0 unkn0 SFLI1 SFLT0 conc0 concLT0 SILN0 SILU0 SILI0 SILT0 lasso1 LassoPreprocessingBenchmarks: Lassos: inital223 mio100 ax100 hnf100 lsp97 ukn61 mio100 lsp39 div186 bol100 ite100 ukn100 eq136 hnf61 smp92 dnf100 smp100 tf100 neg100 sie100 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 23ms VariablesStem: 5 VariablesLoop: 4 DisjunctsStem: 1 DisjunctsLoop: 1 SupportingInvariants: 2 MotzkinApplications: 6 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 0 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 0 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.0s - TerminationAnalysisResult: Termination proven Buchi Automizer proved that your program is terminating RESULT: Ultimate proved your program to be correct! !SESSION 2020-06-22 10:21:21.175 ----------------------------------------------- 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 -i /export/starexec/sandbox/benchmark/theBenchmark.c !ENTRY org.eclipse.core.resources 2 10035 2020-06-22 10:21:34.677 !MESSAGE The workspace will exit with unsaved changes in this session. Received shutdown request... Ultimate: GTK+ Version Check