YES Ultimate: Cannot open display: This is Ultimate 0.1.24-8dc7c08-m [2020-06-22 10:42:23,616 INFO L170 SettingsManager]: Resetting all preferences to default values... [2020-06-22 10:42:23,618 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2020-06-22 10:42:23,629 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-06-22 10:42:23,630 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-06-22 10:42:23,630 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-06-22 10:42:23,632 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-06-22 10:42:23,633 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2020-06-22 10:42:23,635 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-06-22 10:42:23,635 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-06-22 10:42:23,636 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-06-22 10:42:23,636 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-06-22 10:42:23,637 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-06-22 10:42:23,638 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-06-22 10:42:23,639 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-06-22 10:42:23,640 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-06-22 10:42:23,641 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-06-22 10:42:23,642 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-06-22 10:42:23,644 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2020-06-22 10:42:23,645 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-06-22 10:42:23,646 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-06-22 10:42:23,647 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-06-22 10:42:23,649 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-06-22 10:42:23,650 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-06-22 10:42:23,650 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-06-22 10:42:23,651 INFO L174 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-06-22 10:42:23,651 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-06-22 10:42:23,652 INFO L177 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-06-22 10:42:23,652 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-06-22 10:42:23,653 INFO L174 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-06-22 10:42:23,653 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-06-22 10:42:23,654 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2020-06-22 10:42:23,655 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-06-22 10:42:23,655 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2020-06-22 10:42:23,656 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-06-22 10:42:23,656 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-06-22 10:42:23,656 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2020-06-22 10:42:23,657 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2020-06-22 10:42:23,658 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2020-06-22 10:42:23,658 INFO L98 SettingsManager]: Beginning loading settings from /export/starexec/sandbox/solver/bin/./../termcomp2017.epf [2020-06-22 10:42:23,672 INFO L110 SettingsManager]: Loading preferences was successful [2020-06-22 10:42:23,673 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2020-06-22 10:42:23,674 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-06-22 10:42:23,674 INFO L133 SettingsManager]: * Rewrite not-equals=true [2020-06-22 10:42:23,674 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2020-06-22 10:42:23,674 INFO L133 SettingsManager]: * Minimize states using LBE with the strategy=SINGLE [2020-06-22 10:42:23,674 INFO L133 SettingsManager]: * Use SBE=true [2020-06-22 10:42:23,674 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2020-06-22 10:42:23,675 INFO L133 SettingsManager]: * Use old map elimination=false [2020-06-22 10:42:23,675 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2020-06-22 10:42:23,675 INFO L133 SettingsManager]: * Buchi interpolant automaton construction strategy=DANDELION [2020-06-22 10:42:23,675 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2020-06-22 10:42:23,675 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2020-06-22 10:42:23,676 INFO L133 SettingsManager]: * Construct termination proof for TermComp=true [2020-06-22 10:42:23,676 INFO L133 SettingsManager]: * Command for external solver (GNTA synthesis)=z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 [2020-06-22 10:42:23,676 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-06-22 10:42:23,676 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2020-06-22 10:42:23,676 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2020-06-22 10:42:23,676 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2020-06-22 10:42:23,677 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2020-06-22 10:42:23,677 INFO L133 SettingsManager]: * How to treat unsigned ints differently from normal ones=IGNORE [2020-06-22 10:42:23,677 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-06-22 10:42:23,677 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-06-22 10:42:23,677 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2020-06-22 10:42:23,677 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:5000 [2020-06-22 10:42:23,678 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-06-22 10:42:23,678 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-06-22 10:42:23,678 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2020-06-22 10:42:23,678 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-06-22 10:42:23,703 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2020-06-22 10:42:23,717 INFO L259 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-06-22 10:42:23,720 INFO L215 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-06-22 10:42:23,722 INFO L271 PluginConnector]: Initializing CDTParser... [2020-06-22 10:42:23,722 INFO L276 PluginConnector]: CDTParser initialized [2020-06-22 10:42:23,723 INFO L430 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /export/starexec/sandbox/benchmark/theBenchmark.c [2020-06-22 10:42:23,785 INFO L221 CDTParser]: Created temporary CDT project at /export/starexec/sandbox/tmp/136aaf3c10854f7c8e53fec2000e8b3a/FLAG7c035081c [2020-06-22 10:42:24,121 INFO L307 CDTParser]: Found 1 translation units. [2020-06-22 10:42:24,122 INFO L161 CDTParser]: Scanning /export/starexec/sandbox/benchmark/theBenchmark.c [2020-06-22 10:42:24,122 WARN L117 ultiparseSymbolTable]: System include stdlib.h could not be resolved by CDT -- only built-in system includes are available. [2020-06-22 10:42:24,129 INFO L355 CDTParser]: About to delete temporary CDT project at /export/starexec/sandbox/tmp/136aaf3c10854f7c8e53fec2000e8b3a/FLAG7c035081c [2020-06-22 10:42:24,518 INFO L363 CDTParser]: Successfully deleted /export/starexec/sandbox/tmp/136aaf3c10854f7c8e53fec2000e8b3a [2020-06-22 10:42:24,532 INFO L297 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-06-22 10:42:24,534 INFO L131 ToolchainWalker]: Walking toolchain with 7 elements. [2020-06-22 10:42:24,535 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-06-22 10:42:24,535 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-06-22 10:42:24,539 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2020-06-22 10:42:24,540 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.06 10:42:24" (1/1) ... [2020-06-22 10:42:24,543 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@218da0ab and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 10:42:24, skipping insertion in model container [2020-06-22 10:42:24,543 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.06 10:42:24" (1/1) ... [2020-06-22 10:42:24,551 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-06-22 10:42:24,569 INFO L176 MainTranslator]: Built tables and reachable declarations [2020-06-22 10:42:24,792 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-06-22 10:42:24,806 INFO L191 MainTranslator]: Completed pre-run [2020-06-22 10:42:24,825 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-06-22 10:42:24,841 INFO L195 MainTranslator]: Completed translation [2020-06-22 10:42:24,841 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 10:42:24 WrapperNode [2020-06-22 10:42:24,842 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-06-22 10:42:24,842 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-06-22 10:42:24,843 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-06-22 10:42:24,843 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2020-06-22 10:42:24,852 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:42:24" (1/1) ... [2020-06-22 10:42:24,860 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:42:24" (1/1) ... [2020-06-22 10:42:24,881 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-06-22 10:42:24,882 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-06-22 10:42:24,882 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-06-22 10:42:24,882 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2020-06-22 10:42:24,891 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 10:42:24" (1/1) ... [2020-06-22 10:42:24,892 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 10:42:24" (1/1) ... [2020-06-22 10:42:24,893 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 10:42:24" (1/1) ... [2020-06-22 10:42:24,893 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 10:42:24" (1/1) ... [2020-06-22 10:42:24,898 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 10:42:24" (1/1) ... [2020-06-22 10:42:24,903 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 10:42:24" (1/1) ... [2020-06-22 10:42:24,904 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 10:42:24" (1/1) ... [2020-06-22 10:42:24,906 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-06-22 10:42:24,906 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-06-22 10:42:24,906 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-06-22 10:42:24,907 INFO L276 PluginConnector]: RCFGBuilder initialized [2020-06-22 10:42:24,907 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 10:42: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:42:24,973 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-06-22 10:42:24,974 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-06-22 10:42:24,974 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-06-22 10:42:24,974 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2020-06-22 10:42:24,974 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-06-22 10:42:24,974 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-06-22 10:42:25,206 INFO L281 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-06-22 10:42:25,207 INFO L286 CfgBuilder]: Removed 8 assue(true) statements. [2020-06-22 10:42:25,208 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.06 10:42:25 BoogieIcfgContainer [2020-06-22 10:42:25,208 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-06-22 10:42:25,209 INFO L113 PluginConnector]: ------------------------BlockEncodingV2---------------------------- [2020-06-22 10:42:25,209 INFO L271 PluginConnector]: Initializing BlockEncodingV2... [2020-06-22 10:42:25,211 INFO L276 PluginConnector]: BlockEncodingV2 initialized [2020-06-22 10:42:25,211 INFO L185 PluginConnector]: Executing the observer BlockEncodingObserver from plugin BlockEncodingV2 for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.06 10:42:25" (1/1) ... [2020-06-22 10:42:25,228 INFO L313 BlockEncoder]: Initial Icfg 23 locations, 27 edges [2020-06-22 10:42:25,230 INFO L258 BlockEncoder]: Using Remove infeasible edges [2020-06-22 10:42:25,231 INFO L263 BlockEncoder]: Using Maximize final states [2020-06-22 10:42:25,231 INFO L270 BlockEncoder]: Using Minimize states even if more edges are added than removed.=false [2020-06-22 10:42:25,232 INFO L276 BlockEncoder]: Using Minimize states using LBE with the strategy=SINGLE [2020-06-22 10:42:25,233 INFO L296 BlockEncoder]: Using Remove sink states [2020-06-22 10:42:25,234 INFO L171 BlockEncoder]: Using Apply optimizations until nothing changes=true [2020-06-22 10:42:25,234 INFO L179 BlockEncoder]: Using Rewrite not-equals [2020-06-22 10:42:25,258 INFO L185 BlockEncoder]: Using Use SBE [2020-06-22 10:42:25,280 INFO L200 BlockEncoder]: SBE split 7 edges [2020-06-22 10:42:25,284 INFO L70 emoveInfeasibleEdges]: Removed 2 edges and 0 locations because of local infeasibility [2020-06-22 10:42:25,286 INFO L71 MaximizeFinalStates]: 0 new accepting states [2020-06-22 10:42:25,323 INFO L100 BaseMinimizeStates]: Removed 16 edges and 8 locations by large block encoding [2020-06-22 10:42:25,326 INFO L70 RemoveSinkStates]: Removed 1 edges and 1 locations by removing sink states [2020-06-22 10:42:25,327 INFO L70 emoveInfeasibleEdges]: Removed 0 edges and 0 locations because of local infeasibility [2020-06-22 10:42:25,327 INFO L71 MaximizeFinalStates]: 0 new accepting states [2020-06-22 10:42:25,328 INFO L100 BaseMinimizeStates]: Removed 0 edges and 0 locations by large block encoding [2020-06-22 10:42:25,328 INFO L70 RemoveSinkStates]: Removed 0 edges and 0 locations by removing sink states [2020-06-22 10:42:25,328 INFO L313 BlockEncoder]: Encoded RCFG 14 locations, 23 edges [2020-06-22 10:42:25,329 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 22.06 10:42:25 BasicIcfg [2020-06-22 10:42:25,329 INFO L132 PluginConnector]: ------------------------ END BlockEncodingV2---------------------------- [2020-06-22 10:42:25,330 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-06-22 10:42:25,330 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-06-22 10:42:25,334 INFO L276 PluginConnector]: TraceAbstraction initialized [2020-06-22 10:42:25,334 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 22.06 10:42:24" (1/4) ... [2020-06-22 10:42:25,335 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7eaf0624 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.06 10:42:25, skipping insertion in model container [2020-06-22 10:42:25,335 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 10:42:24" (2/4) ... [2020-06-22 10:42:25,336 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7eaf0624 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.06 10:42:25, skipping insertion in model container [2020-06-22 10:42:25,336 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.06 10:42:25" (3/4) ... [2020-06-22 10:42:25,336 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7eaf0624 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 22.06 10:42:25, skipping insertion in model container [2020-06-22 10:42:25,336 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 22.06 10:42:25" (4/4) ... [2020-06-22 10:42:25,338 INFO L112 eAbstractionObserver]: Analyzing ICFG theBenchmark.c_BEv2 [2020-06-22 10:42:25,348 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:ForwardPredicates Determinization: PREDICATE_ABSTRACTION [2020-06-22 10:42:25,358 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 6 error locations. [2020-06-22 10:42:25,375 INFO L257 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2020-06-22 10:42:25,404 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2020-06-22 10:42:25,405 INFO L382 AbstractCegarLoop]: Interprodecural is true [2020-06-22 10:42:25,405 INFO L383 AbstractCegarLoop]: Hoare is true [2020-06-22 10:42:25,405 INFO L384 AbstractCegarLoop]: Compute interpolants for ForwardPredicates [2020-06-22 10:42:25,405 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-06-22 10:42:25,406 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-06-22 10:42:25,406 INFO L387 AbstractCegarLoop]: Difference is false [2020-06-22 10:42:25,406 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-06-22 10:42:25,406 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-06-22 10:42:25,421 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states. [2020-06-22 10:42:25,427 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2020-06-22 10:42:25,427 INFO L394 BasicCegarLoop]: Found error trace [2020-06-22 10:42:25,428 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2020-06-22 10:42:25,428 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION]=== [2020-06-22 10:42:25,433 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 10:42:25,433 INFO L82 PathProgramCache]: Analyzing trace with hash 124970235, now seen corresponding path program 1 times [2020-06-22 10:42:25,435 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 10:42:25,436 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 10:42:25,488 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 10:42:25,488 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 10:42:25,488 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 10:42:25,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 10:42:25,596 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:42:25,599 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-06-22 10:42:25,599 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-06-22 10:42:25,603 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-06-22 10:42:25,617 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-06-22 10:42:25,617 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-06-22 10:42:25,620 INFO L87 Difference]: Start difference. First operand 14 states. Second operand 3 states. [2020-06-22 10:42:25,686 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-06-22 10:42:25,687 INFO L93 Difference]: Finished difference Result 14 states and 23 transitions. [2020-06-22 10:42:25,687 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-06-22 10:42:25,689 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 5 [2020-06-22 10:42:25,689 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-06-22 10:42:25,700 INFO L225 Difference]: With dead ends: 14 [2020-06-22 10:42:25,700 INFO L226 Difference]: Without dead ends: 11 [2020-06-22 10:42:25,704 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:42:25,722 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11 states. [2020-06-22 10:42:25,735 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11 to 11. [2020-06-22 10:42:25,737 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2020-06-22 10:42:25,737 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 17 transitions. [2020-06-22 10:42:25,739 INFO L78 Accepts]: Start accepts. Automaton has 11 states and 17 transitions. Word has length 5 [2020-06-22 10:42:25,739 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-06-22 10:42:25,739 INFO L480 AbstractCegarLoop]: Abstraction has 11 states and 17 transitions. [2020-06-22 10:42:25,739 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-06-22 10:42:25,740 INFO L276 IsEmpty]: Start isEmpty. Operand 11 states and 17 transitions. [2020-06-22 10:42:25,740 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2020-06-22 10:42:25,740 INFO L394 BasicCegarLoop]: Found error trace [2020-06-22 10:42:25,740 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2020-06-22 10:42:25,740 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION]=== [2020-06-22 10:42:25,741 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 10:42:25,741 INFO L82 PathProgramCache]: Analyzing trace with hash 124970237, now seen corresponding path program 1 times [2020-06-22 10:42:25,741 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 10:42:25,741 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 10:42:25,742 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 10:42:25,742 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 10:42:25,743 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 10:42:25,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 10:42:25,794 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:42:25,795 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-06-22 10:42:25,795 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-06-22 10:42:25,796 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-06-22 10:42:25,797 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-06-22 10:42:25,797 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-06-22 10:42:25,797 INFO L87 Difference]: Start difference. First operand 11 states and 17 transitions. Second operand 4 states. [2020-06-22 10:42:25,854 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-06-22 10:42:25,854 INFO L93 Difference]: Finished difference Result 14 states and 17 transitions. [2020-06-22 10:42:25,855 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-06-22 10:42:25,855 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 5 [2020-06-22 10:42:25,855 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-06-22 10:42:25,856 INFO L225 Difference]: With dead ends: 14 [2020-06-22 10:42:25,856 INFO L226 Difference]: Without dead ends: 11 [2020-06-22 10:42:25,857 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-06-22 10:42:25,857 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11 states. [2020-06-22 10:42:25,859 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11 to 11. [2020-06-22 10:42:25,859 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2020-06-22 10:42:25,860 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 14 transitions. [2020-06-22 10:42:25,860 INFO L78 Accepts]: Start accepts. Automaton has 11 states and 14 transitions. Word has length 5 [2020-06-22 10:42:25,860 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-06-22 10:42:25,861 INFO L480 AbstractCegarLoop]: Abstraction has 11 states and 14 transitions. [2020-06-22 10:42:25,861 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-06-22 10:42:25,861 INFO L276 IsEmpty]: Start isEmpty. Operand 11 states and 14 transitions. [2020-06-22 10:42:25,861 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2020-06-22 10:42:25,861 INFO L394 BasicCegarLoop]: Found error trace [2020-06-22 10:42:25,861 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2020-06-22 10:42:25,862 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION]=== [2020-06-22 10:42:25,862 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 10:42:25,862 INFO L82 PathProgramCache]: Analyzing trace with hash 124970238, now seen corresponding path program 1 times [2020-06-22 10:42:25,862 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 10:42:25,862 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 10:42:25,863 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 10:42:25,863 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 10:42:25,863 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 10:42:25,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 10:42:25,901 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:42:25,901 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-06-22 10:42:25,901 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-06-22 10:42:25,901 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-06-22 10:42:25,902 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-06-22 10:42:25,902 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-06-22 10:42:25,902 INFO L87 Difference]: Start difference. First operand 11 states and 14 transitions. Second operand 3 states. [2020-06-22 10:42:25,940 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-06-22 10:42:25,941 INFO L93 Difference]: Finished difference Result 19 states and 23 transitions. [2020-06-22 10:42:25,941 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-06-22 10:42:25,941 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 5 [2020-06-22 10:42:25,942 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-06-22 10:42:25,942 INFO L225 Difference]: With dead ends: 19 [2020-06-22 10:42:25,942 INFO L226 Difference]: Without dead ends: 16 [2020-06-22 10:42:25,943 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:42:25,943 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states. [2020-06-22 10:42:25,946 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 16. [2020-06-22 10:42:25,947 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2020-06-22 10:42:25,947 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 20 transitions. [2020-06-22 10:42:25,948 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 20 transitions. Word has length 5 [2020-06-22 10:42:25,948 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-06-22 10:42:25,948 INFO L480 AbstractCegarLoop]: Abstraction has 16 states and 20 transitions. [2020-06-22 10:42:25,948 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-06-22 10:42:25,948 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 20 transitions. [2020-06-22 10:42:25,948 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2020-06-22 10:42:25,949 INFO L394 BasicCegarLoop]: Found error trace [2020-06-22 10:42:25,949 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1] [2020-06-22 10:42:25,949 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION]=== [2020-06-22 10:42:25,949 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 10:42:25,949 INFO L82 PathProgramCache]: Analyzing trace with hash -749255147, now seen corresponding path program 1 times [2020-06-22 10:42:25,949 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 10:42:25,950 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 10:42:25,951 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 10:42:25,951 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 10:42:25,951 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 10:42:25,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 10:42:25,986 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-06-22 10:42:25,986 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-06-22 10:42:25,986 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-06-22 10:42:25,986 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-06-22 10:42:25,987 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-06-22 10:42:25,987 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2020-06-22 10:42:25,987 INFO L87 Difference]: Start difference. First operand 16 states and 20 transitions. Second operand 4 states. [2020-06-22 10:42:26,034 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-06-22 10:42:26,034 INFO L93 Difference]: Finished difference Result 16 states and 20 transitions. [2020-06-22 10:42:26,035 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-06-22 10:42:26,035 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 8 [2020-06-22 10:42:26,035 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-06-22 10:42:26,035 INFO L225 Difference]: With dead ends: 16 [2020-06-22 10:42:26,035 INFO L226 Difference]: Without dead ends: 0 [2020-06-22 10:42:26,036 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2020-06-22 10:42:26,036 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2020-06-22 10:42:26,036 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2020-06-22 10:42:26,036 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2020-06-22 10:42:26,037 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2020-06-22 10:42:26,037 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 8 [2020-06-22 10:42:26,037 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-06-22 10:42:26,037 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-06-22 10:42:26,037 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-06-22 10:42:26,037 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-06-22 10:42:26,037 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-06-22 10:42:26,042 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2020-06-22 10:42:26,204 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr0REQUIRES_VIOLATION(line 10) no Hoare annotation was computed. [2020-06-22 10:42:26,204 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2020-06-22 10:42:26,204 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr5REQUIRES_VIOLATION(line 11) no Hoare annotation was computed. [2020-06-22 10:42:26,204 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr1REQUIRES_VIOLATION(line 10) no Hoare annotation was computed. [2020-06-22 10:42:26,204 INFO L448 ceAbstractionStarter]: For program point L20(lines 20 22) no Hoare annotation was computed. [2020-06-22 10:42:26,205 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr2REQUIRES_VIOLATION(line 11) no Hoare annotation was computed. [2020-06-22 10:42:26,205 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr3REQUIRES_VIOLATION(line 11) no Hoare annotation was computed. [2020-06-22 10:42:26,205 INFO L448 ceAbstractionStarter]: For program point L20-2(lines 20 22) no Hoare annotation was computed. [2020-06-22 10:42:26,205 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr4REQUIRES_VIOLATION(line 11) no Hoare annotation was computed. [2020-06-22 10:42:26,205 INFO L448 ceAbstractionStarter]: For program point L11(line 11) no Hoare annotation was computed. [2020-06-22 10:42:26,205 INFO L448 ceAbstractionStarter]: For program point L10-1(lines 10 13) no Hoare annotation was computed. [2020-06-22 10:42:26,205 INFO L448 ceAbstractionStarter]: For program point L11-2(line 11) no Hoare annotation was computed. [2020-06-22 10:42:26,206 INFO L444 ceAbstractionStarter]: At program point L10-3(lines 10 13) the Hoare annotation is: (let ((.cse0 (select |#length| ULTIMATE.start_test_fun_~a.base)) (.cse1 (* 4 ULTIMATE.start_test_fun_~i~0))) (and (<= (* 4 ULTIMATE.start_test_fun_~N) .cse0) (= 0 ULTIMATE.start_test_fun_~a.offset) (<= (+ .cse1 4) .cse0) (<= 0 (+ .cse1 ULTIMATE.start_test_fun_~a.offset)) (= 1 (select |#valid| ULTIMATE.start_test_fun_~a.base)))) [2020-06-22 10:42:26,206 INFO L444 ceAbstractionStarter]: At program point L9-3(lines 9 14) the Hoare annotation is: (and (<= (* 4 ULTIMATE.start_test_fun_~N) (select |#length| ULTIMATE.start_test_fun_~a.base)) (= 0 ULTIMATE.start_test_fun_~a.offset) (<= 0 (+ (* 4 ULTIMATE.start_test_fun_~i~0) ULTIMATE.start_test_fun_~a.offset)) (= 1 (select |#valid| ULTIMATE.start_test_fun_~a.base))) [2020-06-22 10:42:26,207 INFO L305 ceAbstractionStarter]: Did not count any witness invariants because Icfg is not BoogieIcfg [2020-06-22 10:42:26,215 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 10:42:26,222 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 10:42:26,223 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 10:42:26,223 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 10:42:26,224 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 10:42:26,224 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 10:42:26,226 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 22.06 10:42:26 BasicIcfg [2020-06-22 10:42:26,227 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-06-22 10:42:26,228 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2020-06-22 10:42:26,228 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2020-06-22 10:42:26,231 INFO L276 PluginConnector]: BuchiAutomizer initialized [2020-06-22 10:42:26,232 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-06-22 10:42:26,232 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 22.06 10:42:24" (1/5) ... [2020-06-22 10:42:26,233 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@1ceab1e8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 22.06 10:42:26, skipping insertion in model container [2020-06-22 10:42:26,233 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-06-22 10:42:26,233 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 10:42:24" (2/5) ... [2020-06-22 10:42:26,234 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@1ceab1e8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 22.06 10:42:26, skipping insertion in model container [2020-06-22 10:42:26,234 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-06-22 10:42:26,234 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.06 10:42:25" (3/5) ... [2020-06-22 10:42:26,234 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@1ceab1e8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 22.06 10:42:26, skipping insertion in model container [2020-06-22 10:42:26,234 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-06-22 10:42:26,234 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 22.06 10:42:25" (4/5) ... [2020-06-22 10:42:26,235 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@1ceab1e8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 22.06 10:42:26, skipping insertion in model container [2020-06-22 10:42:26,235 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-06-22 10:42:26,235 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 22.06 10:42:26" (5/5) ... [2020-06-22 10:42:26,237 INFO L375 chiAutomizerObserver]: Analyzing ICFG theBenchmark.c_BEv2 [2020-06-22 10:42:26,257 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2020-06-22 10:42:26,257 INFO L374 BuchiCegarLoop]: Interprodecural is true [2020-06-22 10:42:26,257 INFO L375 BuchiCegarLoop]: Hoare is true [2020-06-22 10:42:26,258 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2020-06-22 10:42:26,258 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2020-06-22 10:42:26,258 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-06-22 10:42:26,258 INFO L379 BuchiCegarLoop]: Difference is false [2020-06-22 10:42:26,258 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-06-22 10:42:26,258 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2020-06-22 10:42:26,261 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 14 states. [2020-06-22 10:42:26,266 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2020-06-22 10:42:26,266 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-06-22 10:42:26,266 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-06-22 10:42:26,270 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1] [2020-06-22 10:42:26,271 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2020-06-22 10:42:26,271 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2020-06-22 10:42:26,271 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 14 states. [2020-06-22 10:42:26,272 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2020-06-22 10:42:26,272 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-06-22 10:42:26,272 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-06-22 10:42:26,273 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1] [2020-06-22 10:42:26,273 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2020-06-22 10:42:26,278 INFO L794 eck$LassoCheckResult]: Stem: 15#ULTIMATE.startENTRYtrue [102] ULTIMATE.startENTRY-->L20: Formula: (and (= |v_#valid_13| (store |v_#valid_14| 0 0)) (= |v_#NULL.offset_2| 0) (= 0 |v_#NULL.base_2|)) InVars {#valid=|v_#valid_14|} OutVars{ULTIMATE.start_main_#t~malloc6.base=|v_ULTIMATE.start_main_#t~malloc6.base_5|, ULTIMATE.start_main_#t~nondet5=|v_ULTIMATE.start_main_#t~nondet5_6|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_3|, ULTIMATE.start_main_~array_size~0=v_ULTIMATE.start_main_~array_size~0_8, ULTIMATE.start_main_#t~malloc6.offset=|v_ULTIMATE.start_main_#t~malloc6.offset_5|, ULTIMATE.start_main_~numbers~0.base=v_ULTIMATE.start_main_~numbers~0.base_3, #valid=|v_#valid_13|, ULTIMATE.start_main_~numbers~0.offset=v_ULTIMATE.start_main_~numbers~0.offset_3, #NULL.offset=|v_#NULL.offset_2|, ULTIMATE.start_main_#t~ret7=|v_ULTIMATE.start_main_#t~ret7_4|, #NULL.base=|v_#NULL.base_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~malloc6.base, ULTIMATE.start_main_#t~nondet5, ULTIMATE.start_main_#res, ULTIMATE.start_main_~array_size~0, ULTIMATE.start_main_#t~malloc6.offset, ULTIMATE.start_main_~numbers~0.base, #valid, ULTIMATE.start_main_~numbers~0.offset, #NULL.offset, ULTIMATE.start_main_#t~ret7, #NULL.base] 13#L20true [78] L20-->L20-2: Formula: (>= v_ULTIMATE.start_main_~array_size~0_6 1) InVars {ULTIMATE.start_main_~array_size~0=v_ULTIMATE.start_main_~array_size~0_6} OutVars{ULTIMATE.start_main_~array_size~0=v_ULTIMATE.start_main_~array_size~0_6} AuxVars[] AssignedVars[] 8#L20-2true [89] L20-2-->L9-3: Formula: (and (< |v_ULTIMATE.start_main_#t~malloc6.base_2| |v_#StackHeapBarrier_1|) (> 0 |v_ULTIMATE.start_main_#t~malloc6.base_2|) (= |v_ULTIMATE.start_test_fun_#in~a.base_1| v_ULTIMATE.start_main_~numbers~0.base_2) (= 0 (select |v_#valid_4| |v_ULTIMATE.start_main_#t~malloc6.base_2|)) (= v_ULTIMATE.start_main_~numbers~0.offset_2 |v_ULTIMATE.start_main_#t~malloc6.offset_2|) (= v_ULTIMATE.start_test_fun_~i~0_1 0) (= v_ULTIMATE.start_main_~numbers~0.base_2 |v_ULTIMATE.start_main_#t~malloc6.base_2|) (= v_ULTIMATE.start_test_fun_~a.offset_1 |v_ULTIMATE.start_test_fun_#in~a.offset_1|) (= |v_ULTIMATE.start_test_fun_#in~N_1| v_ULTIMATE.start_main_~array_size~0_7) (= (store |v_#length_2| |v_ULTIMATE.start_main_#t~malloc6.base_2| (* 4 v_ULTIMATE.start_main_~array_size~0_7)) |v_#length_1|) (= (store |v_#valid_4| |v_ULTIMATE.start_main_#t~malloc6.base_2| 1) |v_#valid_3|) (= v_ULTIMATE.start_test_fun_~res~0_1 0) (= v_ULTIMATE.start_test_fun_~a.base_1 |v_ULTIMATE.start_test_fun_#in~a.base_1|) (= |v_ULTIMATE.start_test_fun_#in~a.offset_1| v_ULTIMATE.start_main_~numbers~0.offset_2) (= v_ULTIMATE.start_test_fun_~N_1 |v_ULTIMATE.start_test_fun_#in~N_1|) (= 0 |v_ULTIMATE.start_main_#t~malloc6.offset_2|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_2|, #valid=|v_#valid_4|, ULTIMATE.start_main_~array_size~0=v_ULTIMATE.start_main_~array_size~0_7} OutVars{ULTIMATE.start_test_fun_#in~a.base=|v_ULTIMATE.start_test_fun_#in~a.base_1|, ULTIMATE.start_main_#t~malloc6.base=|v_ULTIMATE.start_main_#t~malloc6.base_2|, ULTIMATE.start_test_fun_~res~0=v_ULTIMATE.start_test_fun_~res~0_1, ULTIMATE.start_test_fun_#t~post0=|v_ULTIMATE.start_test_fun_#t~post0_1|, ULTIMATE.start_test_fun_~a.offset=v_ULTIMATE.start_test_fun_~a.offset_1, ULTIMATE.start_test_fun_#in~N=|v_ULTIMATE.start_test_fun_#in~N_1|, ULTIMATE.start_test_fun_~a.base=v_ULTIMATE.start_test_fun_~a.base_1, #StackHeapBarrier=|v_#StackHeapBarrier_1|, ULTIMATE.start_test_fun_#t~mem2=|v_ULTIMATE.start_test_fun_#t~mem2_1|, ULTIMATE.start_test_fun_#in~a.offset=|v_ULTIMATE.start_test_fun_#in~a.offset_1|, ULTIMATE.start_test_fun_#t~post3=|v_ULTIMATE.start_test_fun_#t~post3_1|, ULTIMATE.start_test_fun_#t~mem1=|v_ULTIMATE.start_test_fun_#t~mem1_1|, ULTIMATE.start_test_fun_#t~post4=|v_ULTIMATE.start_test_fun_#t~post4_1|, #valid=|v_#valid_3|, ULTIMATE.start_main_#t~malloc6.offset=|v_ULTIMATE.start_main_#t~malloc6.offset_2|, ULTIMATE.start_main_~numbers~0.base=v_ULTIMATE.start_main_~numbers~0.base_2, ULTIMATE.start_main_~array_size~0=v_ULTIMATE.start_main_~array_size~0_7, ULTIMATE.start_test_fun_#res=|v_ULTIMATE.start_test_fun_#res_1|, ULTIMATE.start_main_~numbers~0.offset=v_ULTIMATE.start_main_~numbers~0.offset_2, #length=|v_#length_1|, ULTIMATE.start_test_fun_~N=v_ULTIMATE.start_test_fun_~N_1, ULTIMATE.start_test_fun_~i~0=v_ULTIMATE.start_test_fun_~i~0_1} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_#in~a.base, ULTIMATE.start_main_#t~malloc6.base, ULTIMATE.start_test_fun_~res~0, ULTIMATE.start_test_fun_#t~post0, ULTIMATE.start_test_fun_~a.offset, ULTIMATE.start_test_fun_#in~N, ULTIMATE.start_test_fun_~a.base, ULTIMATE.start_test_fun_#t~mem2, ULTIMATE.start_test_fun_#in~a.offset, ULTIMATE.start_test_fun_#t~post3, ULTIMATE.start_test_fun_#t~mem1, ULTIMATE.start_test_fun_#t~post4, #valid, ULTIMATE.start_main_#t~malloc6.offset, ULTIMATE.start_main_~numbers~0.base, ULTIMATE.start_test_fun_#res, ULTIMATE.start_main_~numbers~0.offset, #length, ULTIMATE.start_test_fun_~N, ULTIMATE.start_test_fun_~i~0] 4#L9-3true [2020-06-22 10:42:26,278 INFO L796 eck$LassoCheckResult]: Loop: 4#L9-3true [55] L9-3-->L10-3: Formula: (< v_ULTIMATE.start_test_fun_~i~0_5 v_ULTIMATE.start_test_fun_~N_4) InVars {ULTIMATE.start_test_fun_~N=v_ULTIMATE.start_test_fun_~N_4, ULTIMATE.start_test_fun_~i~0=v_ULTIMATE.start_test_fun_~i~0_5} OutVars{ULTIMATE.start_test_fun_~N=v_ULTIMATE.start_test_fun_~N_4, ULTIMATE.start_test_fun_~i~0=v_ULTIMATE.start_test_fun_~i~0_5} AuxVars[] AssignedVars[] 6#L10-3true [57] L10-3-->L10-1: Formula: (let ((.cse1 (* 4 v_ULTIMATE.start_test_fun_~i~0_6))) (let ((.cse0 (+ v_ULTIMATE.start_test_fun_~a.offset_3 .cse1))) (and (= |v_ULTIMATE.start_test_fun_#t~mem1_2| (select (select |v_#memory_int_1| v_ULTIMATE.start_test_fun_~a.base_3) .cse0)) (<= 0 .cse0) (= 1 (select |v_#valid_5| v_ULTIMATE.start_test_fun_~a.base_3)) (<= (+ v_ULTIMATE.start_test_fun_~a.offset_3 .cse1 4) (select |v_#length_3| v_ULTIMATE.start_test_fun_~a.base_3))))) InVars {ULTIMATE.start_test_fun_~a.offset=v_ULTIMATE.start_test_fun_~a.offset_3, ULTIMATE.start_test_fun_~a.base=v_ULTIMATE.start_test_fun_~a.base_3, #valid=|v_#valid_5|, #memory_int=|v_#memory_int_1|, #length=|v_#length_3|, ULTIMATE.start_test_fun_~i~0=v_ULTIMATE.start_test_fun_~i~0_6} OutVars{ULTIMATE.start_test_fun_~a.offset=v_ULTIMATE.start_test_fun_~a.offset_3, ULTIMATE.start_test_fun_~a.base=v_ULTIMATE.start_test_fun_~a.base_3, ULTIMATE.start_test_fun_#t~mem1=|v_ULTIMATE.start_test_fun_#t~mem1_2|, #valid=|v_#valid_5|, #memory_int=|v_#memory_int_1|, #length=|v_#length_3|, ULTIMATE.start_test_fun_~i~0=v_ULTIMATE.start_test_fun_~i~0_6} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_#t~mem1] 11#L10-1true [105] L10-1-->L9-3: Formula: (and (= v_ULTIMATE.start_test_fun_~i~0_16 (+ v_ULTIMATE.start_test_fun_~i~0_17 1)) (<= |v_ULTIMATE.start_test_fun_#t~mem1_8| 0)) InVars {ULTIMATE.start_test_fun_#t~mem1=|v_ULTIMATE.start_test_fun_#t~mem1_8|, ULTIMATE.start_test_fun_~i~0=v_ULTIMATE.start_test_fun_~i~0_17} OutVars{ULTIMATE.start_test_fun_#t~mem1=|v_ULTIMATE.start_test_fun_#t~mem1_7|, ULTIMATE.start_test_fun_#t~post0=|v_ULTIMATE.start_test_fun_#t~post0_4|, ULTIMATE.start_test_fun_~i~0=v_ULTIMATE.start_test_fun_~i~0_16} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_#t~mem1, ULTIMATE.start_test_fun_#t~post0, ULTIMATE.start_test_fun_~i~0] 4#L9-3true [2020-06-22 10:42:26,279 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 10:42:26,279 INFO L82 PathProgramCache]: Analyzing trace with hash 130320, now seen corresponding path program 1 times [2020-06-22 10:42:26,279 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 10:42:26,279 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 10:42:26,280 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 10:42:26,280 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 10:42:26,281 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 10:42:26,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 10:42:26,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 10:42:26,314 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 10:42:26,314 INFO L82 PathProgramCache]: Analyzing trace with hash 84518, now seen corresponding path program 1 times [2020-06-22 10:42:26,314 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 10:42:26,314 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 10:42:26,315 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 10:42:26,315 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 10:42:26,315 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 10:42:26,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 10:42:26,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 10:42:26,326 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 10:42:26,327 INFO L82 PathProgramCache]: Analyzing trace with hash -412549449, now seen corresponding path program 1 times [2020-06-22 10:42:26,327 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 10:42:26,327 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 10:42:26,328 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 10:42:26,328 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 10:42:26,328 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 10:42:26,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 10:42:26,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 10:42:26,535 INFO L216 LassoAnalysis]: Preferences: [2020-06-22 10:42:26,537 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2020-06-22 10:42:26,537 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-06-22 10:42:26,537 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2020-06-22 10:42:26,537 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2020-06-22 10:42:26,537 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-06-22 10:42:26,537 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2020-06-22 10:42:26,537 INFO L130 ssoRankerPreferences]: Path of dumped script: [2020-06-22 10:42:26,538 INFO L131 ssoRankerPreferences]: Filename of dumped script: theBenchmark.c_BEv2_Iteration1_Lasso [2020-06-22 10:42:26,538 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2020-06-22 10:42:26,538 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2020-06-22 10:42:26,560 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:42:26,693 WARN L188 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 44 DAG size of output: 41 [2020-06-22 10:42:26,729 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:42:26,734 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:42:26,736 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:42:26,740 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:42:26,744 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:42:26,747 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:42:26,753 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:42:26,761 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:42:26,763 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:42:26,765 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:42:26,767 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:42:26,769 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:42:27,021 INFO L300 LassoAnalysis]: Preprocessing complete. [2020-06-22 10:42:27,027 INFO L497 LassoAnalysis]: Using template 'affine'. [2020-06-22 10:42:27,029 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:42:27,031 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 10:42:27,031 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 10:42:27,031 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 10:42:27,031 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 10:42:27,037 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-06-22 10:42:27,037 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-06-22 10:42:27,051 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 10:42:27,051 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:42:27,052 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 10:42:27,052 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 10:42:27,053 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 10:42:27,053 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 10:42:27,059 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-06-22 10:42:27,059 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-06-22 10:42:27,110 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2020-06-22 10:42:27,143 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2020-06-22 10:42:27,143 INFO L444 ModelExtractionUtils]: 29 out of 34 variables were initially zero. Simplification set additionally 2 variables to zero. [2020-06-22 10:42:27,145 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2020-06-22 10:42:27,147 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2020-06-22 10:42:27,148 INFO L518 LassoAnalysis]: Proved termination. [2020-06-22 10:42:27,148 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_test_fun_~N, ULTIMATE.start_test_fun_~i~0) = 1*ULTIMATE.start_test_fun_~N - 1*ULTIMATE.start_test_fun_~i~0 Supporting invariants [] [2020-06-22 10:42:27,161 INFO L297 tatePredicateManager]: 3 out of 3 supporting invariants were superfluous and have been removed [2020-06-22 10:42:27,185 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 10:42:27,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 10:42:27,201 INFO L256 TraceCheckSpWp]: Trace formula consists of 36 conjuncts, 2 conjunts are in the unsatisfiable core [2020-06-22 10:42:27,203 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 10:42:27,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 10:42:27,220 INFO L256 TraceCheckSpWp]: Trace formula consists of 12 conjuncts, 4 conjunts are in the unsatisfiable core [2020-06-22 10:42:27,221 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 10:42:27,235 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:42:27,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 10:42:27,261 INFO L256 TraceCheckSpWp]: Trace formula consists of 12 conjuncts, 4 conjunts are in the unsatisfiable core [2020-06-22 10:42:27,261 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 10:42:27,288 INFO L98 LoopCannibalizer]: 2 predicates before loop cannibalization 3 predicates after loop cannibalization [2020-06-22 10:42:27,291 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.1 stem predicates 3 loop predicates [2020-06-22 10:42:27,292 INFO L69 BuchiDifferenceNCSB]: Start buchiDifferenceNCSB. First operand 14 states. Second operand 3 states. [2020-06-22 10:42:27,373 INFO L73 BuchiDifferenceNCSB]: Finished buchiDifferenceNCSB. First operand 14 states.. Second operand 3 states. Result 37 states and 65 transitions. Complement of second has 4 states. [2020-06-22 10:42:27,374 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2020-06-22 10:42:27,374 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-06-22 10:42:27,375 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 42 transitions. [2020-06-22 10:42:27,376 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 42 transitions. Stem has 3 letters. Loop has 3 letters. [2020-06-22 10:42:27,378 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-06-22 10:42:27,378 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 42 transitions. Stem has 6 letters. Loop has 3 letters. [2020-06-22 10:42:27,378 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-06-22 10:42:27,378 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 42 transitions. Stem has 3 letters. Loop has 6 letters. [2020-06-22 10:42:27,379 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-06-22 10:42:27,385 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 37 states and 65 transitions. [2020-06-22 10:42:27,388 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 9 [2020-06-22 10:42:27,389 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 37 states to 19 states and 25 transitions. [2020-06-22 10:42:27,391 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 13 [2020-06-22 10:42:27,391 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 14 [2020-06-22 10:42:27,391 INFO L73 IsDeterministic]: Start isDeterministic. Operand 19 states and 25 transitions. [2020-06-22 10:42:27,392 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-06-22 10:42:27,392 INFO L706 BuchiCegarLoop]: Abstraction has 19 states and 25 transitions. [2020-06-22 10:42:27,393 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states and 25 transitions. [2020-06-22 10:42:27,394 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 18. [2020-06-22 10:42:27,394 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2020-06-22 10:42:27,395 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 24 transitions. [2020-06-22 10:42:27,395 INFO L729 BuchiCegarLoop]: Abstraction has 18 states and 24 transitions. [2020-06-22 10:42:27,395 INFO L609 BuchiCegarLoop]: Abstraction has 18 states and 24 transitions. [2020-06-22 10:42:27,395 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2020-06-22 10:42:27,395 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 18 states and 24 transitions. [2020-06-22 10:42:27,396 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 9 [2020-06-22 10:42:27,396 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-06-22 10:42:27,396 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-06-22 10:42:27,397 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1] [2020-06-22 10:42:27,397 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2020-06-22 10:42:27,397 INFO L794 eck$LassoCheckResult]: Stem: 113#ULTIMATE.startENTRY [102] ULTIMATE.startENTRY-->L20: Formula: (and (= |v_#valid_13| (store |v_#valid_14| 0 0)) (= |v_#NULL.offset_2| 0) (= 0 |v_#NULL.base_2|)) InVars {#valid=|v_#valid_14|} OutVars{ULTIMATE.start_main_#t~malloc6.base=|v_ULTIMATE.start_main_#t~malloc6.base_5|, ULTIMATE.start_main_#t~nondet5=|v_ULTIMATE.start_main_#t~nondet5_6|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_3|, ULTIMATE.start_main_~array_size~0=v_ULTIMATE.start_main_~array_size~0_8, ULTIMATE.start_main_#t~malloc6.offset=|v_ULTIMATE.start_main_#t~malloc6.offset_5|, ULTIMATE.start_main_~numbers~0.base=v_ULTIMATE.start_main_~numbers~0.base_3, #valid=|v_#valid_13|, ULTIMATE.start_main_~numbers~0.offset=v_ULTIMATE.start_main_~numbers~0.offset_3, #NULL.offset=|v_#NULL.offset_2|, ULTIMATE.start_main_#t~ret7=|v_ULTIMATE.start_main_#t~ret7_4|, #NULL.base=|v_#NULL.base_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~malloc6.base, ULTIMATE.start_main_#t~nondet5, ULTIMATE.start_main_#res, ULTIMATE.start_main_~array_size~0, ULTIMATE.start_main_#t~malloc6.offset, ULTIMATE.start_main_~numbers~0.base, #valid, ULTIMATE.start_main_~numbers~0.offset, #NULL.offset, ULTIMATE.start_main_#t~ret7, #NULL.base] 114#L20 [78] L20-->L20-2: Formula: (>= v_ULTIMATE.start_main_~array_size~0_6 1) InVars {ULTIMATE.start_main_~array_size~0=v_ULTIMATE.start_main_~array_size~0_6} OutVars{ULTIMATE.start_main_~array_size~0=v_ULTIMATE.start_main_~array_size~0_6} AuxVars[] AssignedVars[] 126#L20-2 [88] L20-2-->L9-3: Formula: (and (< |v_ULTIMATE.start_main_#t~malloc6.base_2| |v_#StackHeapBarrier_1|) (= |v_ULTIMATE.start_test_fun_#in~a.base_1| v_ULTIMATE.start_main_~numbers~0.base_2) (= 0 (select |v_#valid_4| |v_ULTIMATE.start_main_#t~malloc6.base_2|)) (= v_ULTIMATE.start_main_~numbers~0.offset_2 |v_ULTIMATE.start_main_#t~malloc6.offset_2|) (= v_ULTIMATE.start_test_fun_~i~0_1 0) (= v_ULTIMATE.start_main_~numbers~0.base_2 |v_ULTIMATE.start_main_#t~malloc6.base_2|) (= v_ULTIMATE.start_test_fun_~a.offset_1 |v_ULTIMATE.start_test_fun_#in~a.offset_1|) (< 0 |v_ULTIMATE.start_main_#t~malloc6.base_2|) (= |v_ULTIMATE.start_test_fun_#in~N_1| v_ULTIMATE.start_main_~array_size~0_7) (= (store |v_#length_2| |v_ULTIMATE.start_main_#t~malloc6.base_2| (* 4 v_ULTIMATE.start_main_~array_size~0_7)) |v_#length_1|) (= (store |v_#valid_4| |v_ULTIMATE.start_main_#t~malloc6.base_2| 1) |v_#valid_3|) (= v_ULTIMATE.start_test_fun_~res~0_1 0) (= v_ULTIMATE.start_test_fun_~a.base_1 |v_ULTIMATE.start_test_fun_#in~a.base_1|) (= |v_ULTIMATE.start_test_fun_#in~a.offset_1| v_ULTIMATE.start_main_~numbers~0.offset_2) (= v_ULTIMATE.start_test_fun_~N_1 |v_ULTIMATE.start_test_fun_#in~N_1|) (= 0 |v_ULTIMATE.start_main_#t~malloc6.offset_2|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_2|, #valid=|v_#valid_4|, ULTIMATE.start_main_~array_size~0=v_ULTIMATE.start_main_~array_size~0_7} OutVars{ULTIMATE.start_test_fun_#in~a.base=|v_ULTIMATE.start_test_fun_#in~a.base_1|, ULTIMATE.start_main_#t~malloc6.base=|v_ULTIMATE.start_main_#t~malloc6.base_2|, ULTIMATE.start_test_fun_~res~0=v_ULTIMATE.start_test_fun_~res~0_1, ULTIMATE.start_test_fun_#t~post0=|v_ULTIMATE.start_test_fun_#t~post0_1|, ULTIMATE.start_test_fun_~a.offset=v_ULTIMATE.start_test_fun_~a.offset_1, ULTIMATE.start_test_fun_#in~N=|v_ULTIMATE.start_test_fun_#in~N_1|, ULTIMATE.start_test_fun_~a.base=v_ULTIMATE.start_test_fun_~a.base_1, #StackHeapBarrier=|v_#StackHeapBarrier_1|, ULTIMATE.start_test_fun_#t~mem2=|v_ULTIMATE.start_test_fun_#t~mem2_1|, ULTIMATE.start_test_fun_#in~a.offset=|v_ULTIMATE.start_test_fun_#in~a.offset_1|, ULTIMATE.start_test_fun_#t~post3=|v_ULTIMATE.start_test_fun_#t~post3_1|, ULTIMATE.start_test_fun_#t~mem1=|v_ULTIMATE.start_test_fun_#t~mem1_1|, ULTIMATE.start_test_fun_#t~post4=|v_ULTIMATE.start_test_fun_#t~post4_1|, #valid=|v_#valid_3|, ULTIMATE.start_main_#t~malloc6.offset=|v_ULTIMATE.start_main_#t~malloc6.offset_2|, ULTIMATE.start_main_~numbers~0.base=v_ULTIMATE.start_main_~numbers~0.base_2, ULTIMATE.start_main_~array_size~0=v_ULTIMATE.start_main_~array_size~0_7, ULTIMATE.start_test_fun_#res=|v_ULTIMATE.start_test_fun_#res_1|, ULTIMATE.start_main_~numbers~0.offset=v_ULTIMATE.start_main_~numbers~0.offset_2, #length=|v_#length_1|, ULTIMATE.start_test_fun_~N=v_ULTIMATE.start_test_fun_~N_1, ULTIMATE.start_test_fun_~i~0=v_ULTIMATE.start_test_fun_~i~0_1} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_#in~a.base, ULTIMATE.start_main_#t~malloc6.base, ULTIMATE.start_test_fun_~res~0, ULTIMATE.start_test_fun_#t~post0, ULTIMATE.start_test_fun_~a.offset, ULTIMATE.start_test_fun_#in~N, ULTIMATE.start_test_fun_~a.base, ULTIMATE.start_test_fun_#t~mem2, ULTIMATE.start_test_fun_#in~a.offset, ULTIMATE.start_test_fun_#t~post3, ULTIMATE.start_test_fun_#t~mem1, ULTIMATE.start_test_fun_#t~post4, #valid, ULTIMATE.start_main_#t~malloc6.offset, ULTIMATE.start_main_~numbers~0.base, ULTIMATE.start_test_fun_#res, ULTIMATE.start_main_~numbers~0.offset, #length, ULTIMATE.start_test_fun_~N, ULTIMATE.start_test_fun_~i~0] 119#L9-3 [2020-06-22 10:42:27,398 INFO L796 eck$LassoCheckResult]: Loop: 119#L9-3 [55] L9-3-->L10-3: Formula: (< v_ULTIMATE.start_test_fun_~i~0_5 v_ULTIMATE.start_test_fun_~N_4) InVars {ULTIMATE.start_test_fun_~N=v_ULTIMATE.start_test_fun_~N_4, ULTIMATE.start_test_fun_~i~0=v_ULTIMATE.start_test_fun_~i~0_5} OutVars{ULTIMATE.start_test_fun_~N=v_ULTIMATE.start_test_fun_~N_4, ULTIMATE.start_test_fun_~i~0=v_ULTIMATE.start_test_fun_~i~0_5} AuxVars[] AssignedVars[] 120#L10-3 [57] L10-3-->L10-1: Formula: (let ((.cse1 (* 4 v_ULTIMATE.start_test_fun_~i~0_6))) (let ((.cse0 (+ v_ULTIMATE.start_test_fun_~a.offset_3 .cse1))) (and (= |v_ULTIMATE.start_test_fun_#t~mem1_2| (select (select |v_#memory_int_1| v_ULTIMATE.start_test_fun_~a.base_3) .cse0)) (<= 0 .cse0) (= 1 (select |v_#valid_5| v_ULTIMATE.start_test_fun_~a.base_3)) (<= (+ v_ULTIMATE.start_test_fun_~a.offset_3 .cse1 4) (select |v_#length_3| v_ULTIMATE.start_test_fun_~a.base_3))))) InVars {ULTIMATE.start_test_fun_~a.offset=v_ULTIMATE.start_test_fun_~a.offset_3, ULTIMATE.start_test_fun_~a.base=v_ULTIMATE.start_test_fun_~a.base_3, #valid=|v_#valid_5|, #memory_int=|v_#memory_int_1|, #length=|v_#length_3|, ULTIMATE.start_test_fun_~i~0=v_ULTIMATE.start_test_fun_~i~0_6} OutVars{ULTIMATE.start_test_fun_~a.offset=v_ULTIMATE.start_test_fun_~a.offset_3, ULTIMATE.start_test_fun_~a.base=v_ULTIMATE.start_test_fun_~a.base_3, ULTIMATE.start_test_fun_#t~mem1=|v_ULTIMATE.start_test_fun_#t~mem1_2|, #valid=|v_#valid_5|, #memory_int=|v_#memory_int_1|, #length=|v_#length_3|, ULTIMATE.start_test_fun_~i~0=v_ULTIMATE.start_test_fun_~i~0_6} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_#t~mem1] 124#L10-1 [105] L10-1-->L9-3: Formula: (and (= v_ULTIMATE.start_test_fun_~i~0_16 (+ v_ULTIMATE.start_test_fun_~i~0_17 1)) (<= |v_ULTIMATE.start_test_fun_#t~mem1_8| 0)) InVars {ULTIMATE.start_test_fun_#t~mem1=|v_ULTIMATE.start_test_fun_#t~mem1_8|, ULTIMATE.start_test_fun_~i~0=v_ULTIMATE.start_test_fun_~i~0_17} OutVars{ULTIMATE.start_test_fun_#t~mem1=|v_ULTIMATE.start_test_fun_#t~mem1_7|, ULTIMATE.start_test_fun_#t~post0=|v_ULTIMATE.start_test_fun_#t~post0_4|, ULTIMATE.start_test_fun_~i~0=v_ULTIMATE.start_test_fun_~i~0_16} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_#t~mem1, ULTIMATE.start_test_fun_#t~post0, ULTIMATE.start_test_fun_~i~0] 119#L9-3 [2020-06-22 10:42:27,398 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 10:42:27,398 INFO L82 PathProgramCache]: Analyzing trace with hash 130319, now seen corresponding path program 1 times [2020-06-22 10:42:27,398 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 10:42:27,398 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 10:42:27,399 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 10:42:27,399 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 10:42:27,400 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 10:42:27,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 10:42:27,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 10:42:27,412 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 10:42:27,412 INFO L82 PathProgramCache]: Analyzing trace with hash 84518, now seen corresponding path program 2 times [2020-06-22 10:42:27,412 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 10:42:27,412 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 10:42:27,413 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 10:42:27,413 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 10:42:27,413 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 10:42:27,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 10:42:27,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 10:42:27,420 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 10:42:27,420 INFO L82 PathProgramCache]: Analyzing trace with hash -412579240, now seen corresponding path program 1 times [2020-06-22 10:42:27,420 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 10:42:27,420 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 10:42:27,421 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 10:42:27,421 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2020-06-22 10:42:27,421 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 10:42:27,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 10:42:27,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 10:42:27,579 INFO L216 LassoAnalysis]: Preferences: [2020-06-22 10:42:27,580 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2020-06-22 10:42:27,580 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-06-22 10:42:27,580 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2020-06-22 10:42:27,580 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2020-06-22 10:42:27,580 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-06-22 10:42:27,580 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2020-06-22 10:42:27,580 INFO L130 ssoRankerPreferences]: Path of dumped script: [2020-06-22 10:42:27,581 INFO L131 ssoRankerPreferences]: Filename of dumped script: theBenchmark.c_BEv2_Iteration2_Lasso [2020-06-22 10:42:27,581 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2020-06-22 10:42:27,581 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2020-06-22 10:42:27,584 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:42:27,586 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:42:27,588 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:42:27,589 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:42:27,592 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:42:27,594 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:42:27,596 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:42:27,597 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:42:27,695 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:42:27,697 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:42:27,698 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:42:27,700 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:42:27,702 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:42:27,903 INFO L300 LassoAnalysis]: Preprocessing complete. [2020-06-22 10:42:27,903 INFO L497 LassoAnalysis]: Using template 'affine'. [2020-06-22 10:42:27,904 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:42:27,904 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 10:42:27,904 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 10:42:27,905 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 10:42:27,905 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 10:42:27,905 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 10:42:27,906 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 10:42:27,906 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 10:42:27,907 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 10:42:27,907 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:42:27,907 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 10:42:27,908 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 10:42:27,908 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 10:42:27,908 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 10:42:27,908 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 10:42:27,908 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 10:42:27,908 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 10:42:27,909 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 10:42:27,909 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:42:27,910 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 10:42:27,910 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 10:42:27,910 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 10:42:27,910 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 10:42:27,910 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 10:42:27,911 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 10:42:27,911 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 10:42:27,912 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 10:42:27,912 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:42:27,912 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 10:42:27,912 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 10:42:27,913 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 10:42:27,913 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 10:42:27,914 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-06-22 10:42:27,914 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-06-22 10:42:27,916 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 10:42:27,916 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:42:27,917 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 10:42:27,917 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 10:42:27,917 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 10:42:27,917 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 10:42:27,918 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-06-22 10:42:27,918 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-06-22 10:42:27,920 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 10:42:27,921 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:42:27,921 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 10:42:27,921 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 10:42:27,921 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 10:42:27,921 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 10:42:27,921 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 10:42:27,922 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 10:42:27,922 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 10:42:27,922 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 10:42:27,923 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:42:27,923 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 10:42:27,923 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 10:42:27,923 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 10:42:27,924 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 10:42:27,924 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 10:42:27,924 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 10:42:27,924 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 10:42:27,925 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 10:42:27,925 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:42:27,925 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 10:42:27,926 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 10:42:27,926 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 10:42:27,926 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 10:42:27,927 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-06-22 10:42:27,927 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-06-22 10:42:27,935 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 10:42:27,935 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:42:27,936 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 10:42:27,936 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 10:42:27,936 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 10:42:27,936 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 10:42:27,938 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-06-22 10:42:27,938 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-06-22 10:42:27,946 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 10:42:27,946 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:42:27,947 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 10:42:27,947 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 10:42:27,947 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 10:42:27,947 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 10:42:27,948 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 10:42:27,948 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 10:42:27,948 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 10:42:27,949 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 10:42:27,949 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:42:27,950 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 10:42:27,950 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 10:42:27,950 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 10:42:27,950 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 10:42:27,951 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-06-22 10:42:27,951 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-06-22 10:42:27,953 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 10:42:27,954 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:42:27,954 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 10:42:27,954 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 10:42:27,954 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 10:42:27,954 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 10:42:27,957 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-06-22 10:42:27,958 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-06-22 10:42:27,984 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2020-06-22 10:42:28,015 INFO L443 ModelExtractionUtils]: Simplification made 6 calls to the SMT solver. [2020-06-22 10:42:28,015 INFO L444 ModelExtractionUtils]: 28 out of 34 variables were initially zero. Simplification set additionally 2 variables to zero. [2020-06-22 10:42:28,016 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2020-06-22 10:42:28,017 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2020-06-22 10:42:28,017 INFO L518 LassoAnalysis]: Proved termination. [2020-06-22 10:42:28,018 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_test_fun_~a.offset, v_rep(select #length ULTIMATE.start_test_fun_~a.base)_2, ULTIMATE.start_test_fun_~i~0) = -1*ULTIMATE.start_test_fun_~a.offset + 1*v_rep(select #length ULTIMATE.start_test_fun_~a.base)_2 - 4*ULTIMATE.start_test_fun_~i~0 Supporting invariants [] [2020-06-22 10:42:28,025 INFO L297 tatePredicateManager]: 3 out of 3 supporting invariants were superfluous and have been removed [2020-06-22 10:42:28,027 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 10:42:28,043 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 10:42:28,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 10:42:28,055 INFO L256 TraceCheckSpWp]: Trace formula consists of 36 conjuncts, 2 conjunts are in the unsatisfiable core [2020-06-22 10:42:28,055 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 10:42:28,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 10:42:28,064 INFO L256 TraceCheckSpWp]: Trace formula consists of 12 conjuncts, 4 conjunts are in the unsatisfiable core [2020-06-22 10:42:28,065 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 10:42:28,085 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:42:28,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 10:42:28,118 INFO L256 TraceCheckSpWp]: Trace formula consists of 12 conjuncts, 4 conjunts are in the unsatisfiable core [2020-06-22 10:42:28,118 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 10:42:28,158 INFO L98 LoopCannibalizer]: 2 predicates before loop cannibalization 3 predicates after loop cannibalization [2020-06-22 10:42:28,159 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.1 stem predicates 3 loop predicates [2020-06-22 10:42:28,159 INFO L69 BuchiDifferenceNCSB]: Start buchiDifferenceNCSB. First operand 18 states and 24 transitions. cyclomatic complexity: 9 Second operand 4 states. [2020-06-22 10:42:28,209 INFO L73 BuchiDifferenceNCSB]: Finished buchiDifferenceNCSB. First operand 18 states and 24 transitions. cyclomatic complexity: 9. Second operand 4 states. Result 25 states and 33 transitions. Complement of second has 6 states. [2020-06-22 10:42:28,210 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2020-06-22 10:42:28,211 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2020-06-22 10:42:28,211 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 19 transitions. [2020-06-22 10:42:28,211 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 19 transitions. Stem has 3 letters. Loop has 3 letters. [2020-06-22 10:42:28,211 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-06-22 10:42:28,212 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 19 transitions. Stem has 6 letters. Loop has 3 letters. [2020-06-22 10:42:28,212 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-06-22 10:42:28,212 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 19 transitions. Stem has 3 letters. Loop has 6 letters. [2020-06-22 10:42:28,212 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-06-22 10:42:28,215 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 25 states and 33 transitions. [2020-06-22 10:42:28,216 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 8 [2020-06-22 10:42:28,217 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 25 states to 25 states and 33 transitions. [2020-06-22 10:42:28,217 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 13 [2020-06-22 10:42:28,217 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 14 [2020-06-22 10:42:28,217 INFO L73 IsDeterministic]: Start isDeterministic. Operand 25 states and 33 transitions. [2020-06-22 10:42:28,217 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-06-22 10:42:28,217 INFO L706 BuchiCegarLoop]: Abstraction has 25 states and 33 transitions. [2020-06-22 10:42:28,217 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states and 33 transitions. [2020-06-22 10:42:28,218 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 13. [2020-06-22 10:42:28,219 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2020-06-22 10:42:28,219 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 18 transitions. [2020-06-22 10:42:28,219 INFO L729 BuchiCegarLoop]: Abstraction has 13 states and 18 transitions. [2020-06-22 10:42:28,219 INFO L609 BuchiCegarLoop]: Abstraction has 13 states and 18 transitions. [2020-06-22 10:42:28,219 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ [2020-06-22 10:42:28,219 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 13 states and 18 transitions. [2020-06-22 10:42:28,220 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2020-06-22 10:42:28,220 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-06-22 10:42:28,220 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-06-22 10:42:28,221 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2020-06-22 10:42:28,221 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2020-06-22 10:42:28,221 INFO L794 eck$LassoCheckResult]: Stem: 217#ULTIMATE.startENTRY [102] ULTIMATE.startENTRY-->L20: Formula: (and (= |v_#valid_13| (store |v_#valid_14| 0 0)) (= |v_#NULL.offset_2| 0) (= 0 |v_#NULL.base_2|)) InVars {#valid=|v_#valid_14|} OutVars{ULTIMATE.start_main_#t~malloc6.base=|v_ULTIMATE.start_main_#t~malloc6.base_5|, ULTIMATE.start_main_#t~nondet5=|v_ULTIMATE.start_main_#t~nondet5_6|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_3|, ULTIMATE.start_main_~array_size~0=v_ULTIMATE.start_main_~array_size~0_8, ULTIMATE.start_main_#t~malloc6.offset=|v_ULTIMATE.start_main_#t~malloc6.offset_5|, ULTIMATE.start_main_~numbers~0.base=v_ULTIMATE.start_main_~numbers~0.base_3, #valid=|v_#valid_13|, ULTIMATE.start_main_~numbers~0.offset=v_ULTIMATE.start_main_~numbers~0.offset_3, #NULL.offset=|v_#NULL.offset_2|, ULTIMATE.start_main_#t~ret7=|v_ULTIMATE.start_main_#t~ret7_4|, #NULL.base=|v_#NULL.base_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~malloc6.base, ULTIMATE.start_main_#t~nondet5, ULTIMATE.start_main_#res, ULTIMATE.start_main_~array_size~0, ULTIMATE.start_main_#t~malloc6.offset, ULTIMATE.start_main_~numbers~0.base, #valid, ULTIMATE.start_main_~numbers~0.offset, #NULL.offset, ULTIMATE.start_main_#t~ret7, #NULL.base] 218#L20 [78] L20-->L20-2: Formula: (>= v_ULTIMATE.start_main_~array_size~0_6 1) InVars {ULTIMATE.start_main_~array_size~0=v_ULTIMATE.start_main_~array_size~0_6} OutVars{ULTIMATE.start_main_~array_size~0=v_ULTIMATE.start_main_~array_size~0_6} AuxVars[] AssignedVars[] 229#L20-2 [89] L20-2-->L9-3: Formula: (and (< |v_ULTIMATE.start_main_#t~malloc6.base_2| |v_#StackHeapBarrier_1|) (> 0 |v_ULTIMATE.start_main_#t~malloc6.base_2|) (= |v_ULTIMATE.start_test_fun_#in~a.base_1| v_ULTIMATE.start_main_~numbers~0.base_2) (= 0 (select |v_#valid_4| |v_ULTIMATE.start_main_#t~malloc6.base_2|)) (= v_ULTIMATE.start_main_~numbers~0.offset_2 |v_ULTIMATE.start_main_#t~malloc6.offset_2|) (= v_ULTIMATE.start_test_fun_~i~0_1 0) (= v_ULTIMATE.start_main_~numbers~0.base_2 |v_ULTIMATE.start_main_#t~malloc6.base_2|) (= v_ULTIMATE.start_test_fun_~a.offset_1 |v_ULTIMATE.start_test_fun_#in~a.offset_1|) (= |v_ULTIMATE.start_test_fun_#in~N_1| v_ULTIMATE.start_main_~array_size~0_7) (= (store |v_#length_2| |v_ULTIMATE.start_main_#t~malloc6.base_2| (* 4 v_ULTIMATE.start_main_~array_size~0_7)) |v_#length_1|) (= (store |v_#valid_4| |v_ULTIMATE.start_main_#t~malloc6.base_2| 1) |v_#valid_3|) (= v_ULTIMATE.start_test_fun_~res~0_1 0) (= v_ULTIMATE.start_test_fun_~a.base_1 |v_ULTIMATE.start_test_fun_#in~a.base_1|) (= |v_ULTIMATE.start_test_fun_#in~a.offset_1| v_ULTIMATE.start_main_~numbers~0.offset_2) (= v_ULTIMATE.start_test_fun_~N_1 |v_ULTIMATE.start_test_fun_#in~N_1|) (= 0 |v_ULTIMATE.start_main_#t~malloc6.offset_2|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_2|, #valid=|v_#valid_4|, ULTIMATE.start_main_~array_size~0=v_ULTIMATE.start_main_~array_size~0_7} OutVars{ULTIMATE.start_test_fun_#in~a.base=|v_ULTIMATE.start_test_fun_#in~a.base_1|, ULTIMATE.start_main_#t~malloc6.base=|v_ULTIMATE.start_main_#t~malloc6.base_2|, ULTIMATE.start_test_fun_~res~0=v_ULTIMATE.start_test_fun_~res~0_1, ULTIMATE.start_test_fun_#t~post0=|v_ULTIMATE.start_test_fun_#t~post0_1|, ULTIMATE.start_test_fun_~a.offset=v_ULTIMATE.start_test_fun_~a.offset_1, ULTIMATE.start_test_fun_#in~N=|v_ULTIMATE.start_test_fun_#in~N_1|, ULTIMATE.start_test_fun_~a.base=v_ULTIMATE.start_test_fun_~a.base_1, #StackHeapBarrier=|v_#StackHeapBarrier_1|, ULTIMATE.start_test_fun_#t~mem2=|v_ULTIMATE.start_test_fun_#t~mem2_1|, ULTIMATE.start_test_fun_#in~a.offset=|v_ULTIMATE.start_test_fun_#in~a.offset_1|, ULTIMATE.start_test_fun_#t~post3=|v_ULTIMATE.start_test_fun_#t~post3_1|, ULTIMATE.start_test_fun_#t~mem1=|v_ULTIMATE.start_test_fun_#t~mem1_1|, ULTIMATE.start_test_fun_#t~post4=|v_ULTIMATE.start_test_fun_#t~post4_1|, #valid=|v_#valid_3|, ULTIMATE.start_main_#t~malloc6.offset=|v_ULTIMATE.start_main_#t~malloc6.offset_2|, ULTIMATE.start_main_~numbers~0.base=v_ULTIMATE.start_main_~numbers~0.base_2, ULTIMATE.start_main_~array_size~0=v_ULTIMATE.start_main_~array_size~0_7, ULTIMATE.start_test_fun_#res=|v_ULTIMATE.start_test_fun_#res_1|, ULTIMATE.start_main_~numbers~0.offset=v_ULTIMATE.start_main_~numbers~0.offset_2, #length=|v_#length_1|, ULTIMATE.start_test_fun_~N=v_ULTIMATE.start_test_fun_~N_1, ULTIMATE.start_test_fun_~i~0=v_ULTIMATE.start_test_fun_~i~0_1} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_#in~a.base, ULTIMATE.start_main_#t~malloc6.base, ULTIMATE.start_test_fun_~res~0, ULTIMATE.start_test_fun_#t~post0, ULTIMATE.start_test_fun_~a.offset, ULTIMATE.start_test_fun_#in~N, ULTIMATE.start_test_fun_~a.base, ULTIMATE.start_test_fun_#t~mem2, ULTIMATE.start_test_fun_#in~a.offset, ULTIMATE.start_test_fun_#t~post3, ULTIMATE.start_test_fun_#t~mem1, ULTIMATE.start_test_fun_#t~post4, #valid, ULTIMATE.start_main_#t~malloc6.offset, ULTIMATE.start_main_~numbers~0.base, ULTIMATE.start_test_fun_#res, ULTIMATE.start_main_~numbers~0.offset, #length, ULTIMATE.start_test_fun_~N, ULTIMATE.start_test_fun_~i~0] 223#L9-3 [55] L9-3-->L10-3: Formula: (< v_ULTIMATE.start_test_fun_~i~0_5 v_ULTIMATE.start_test_fun_~N_4) InVars {ULTIMATE.start_test_fun_~N=v_ULTIMATE.start_test_fun_~N_4, ULTIMATE.start_test_fun_~i~0=v_ULTIMATE.start_test_fun_~i~0_5} OutVars{ULTIMATE.start_test_fun_~N=v_ULTIMATE.start_test_fun_~N_4, ULTIMATE.start_test_fun_~i~0=v_ULTIMATE.start_test_fun_~i~0_5} AuxVars[] AssignedVars[] 225#L10-3 [2020-06-22 10:42:28,222 INFO L796 eck$LassoCheckResult]: Loop: 225#L10-3 [57] L10-3-->L10-1: Formula: (let ((.cse1 (* 4 v_ULTIMATE.start_test_fun_~i~0_6))) (let ((.cse0 (+ v_ULTIMATE.start_test_fun_~a.offset_3 .cse1))) (and (= |v_ULTIMATE.start_test_fun_#t~mem1_2| (select (select |v_#memory_int_1| v_ULTIMATE.start_test_fun_~a.base_3) .cse0)) (<= 0 .cse0) (= 1 (select |v_#valid_5| v_ULTIMATE.start_test_fun_~a.base_3)) (<= (+ v_ULTIMATE.start_test_fun_~a.offset_3 .cse1 4) (select |v_#length_3| v_ULTIMATE.start_test_fun_~a.base_3))))) InVars {ULTIMATE.start_test_fun_~a.offset=v_ULTIMATE.start_test_fun_~a.offset_3, ULTIMATE.start_test_fun_~a.base=v_ULTIMATE.start_test_fun_~a.base_3, #valid=|v_#valid_5|, #memory_int=|v_#memory_int_1|, #length=|v_#length_3|, ULTIMATE.start_test_fun_~i~0=v_ULTIMATE.start_test_fun_~i~0_6} OutVars{ULTIMATE.start_test_fun_~a.offset=v_ULTIMATE.start_test_fun_~a.offset_3, ULTIMATE.start_test_fun_~a.base=v_ULTIMATE.start_test_fun_~a.base_3, ULTIMATE.start_test_fun_#t~mem1=|v_ULTIMATE.start_test_fun_#t~mem1_2|, #valid=|v_#valid_5|, #memory_int=|v_#memory_int_1|, #length=|v_#length_3|, ULTIMATE.start_test_fun_~i~0=v_ULTIMATE.start_test_fun_~i~0_6} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_#t~mem1] 227#L10-1 [65] L10-1-->L11: Formula: (< 0 |v_ULTIMATE.start_test_fun_#t~mem1_6|) InVars {ULTIMATE.start_test_fun_#t~mem1=|v_ULTIMATE.start_test_fun_#t~mem1_6|} OutVars{ULTIMATE.start_test_fun_#t~mem1=|v_ULTIMATE.start_test_fun_#t~mem1_5|} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_#t~mem1] 219#L11 [107] L11-->L11-2: Formula: (let ((.cse1 (* 4 v_ULTIMATE.start_test_fun_~i~0_19))) (let ((.cse0 (+ .cse1 v_ULTIMATE.start_test_fun_~a.offset_9))) (and (= |v_ULTIMATE.start_test_fun_#t~mem2_5| (select (select |v_#memory_int_5| v_ULTIMATE.start_test_fun_~a.base_12) .cse0)) (= 1 (select |v_#valid_19| v_ULTIMATE.start_test_fun_~a.base_12)) (<= 0 .cse0) (= |v_ULTIMATE.start_test_fun_#t~post3_5| |v_ULTIMATE.start_test_fun_#t~mem2_5|) (<= (+ .cse1 v_ULTIMATE.start_test_fun_~a.offset_9 4) (select |v_#length_9| v_ULTIMATE.start_test_fun_~a.base_12))))) InVars {ULTIMATE.start_test_fun_~a.offset=v_ULTIMATE.start_test_fun_~a.offset_9, ULTIMATE.start_test_fun_~a.base=v_ULTIMATE.start_test_fun_~a.base_12, #valid=|v_#valid_19|, #memory_int=|v_#memory_int_5|, #length=|v_#length_9|, ULTIMATE.start_test_fun_~i~0=v_ULTIMATE.start_test_fun_~i~0_19} OutVars{ULTIMATE.start_test_fun_~a.offset=v_ULTIMATE.start_test_fun_~a.offset_9, ULTIMATE.start_test_fun_~a.base=v_ULTIMATE.start_test_fun_~a.base_12, ULTIMATE.start_test_fun_#t~mem2=|v_ULTIMATE.start_test_fun_#t~mem2_5|, ULTIMATE.start_test_fun_#t~post3=|v_ULTIMATE.start_test_fun_#t~post3_5|, #valid=|v_#valid_19|, #memory_int=|v_#memory_int_5|, #length=|v_#length_9|, ULTIMATE.start_test_fun_~i~0=v_ULTIMATE.start_test_fun_~i~0_19} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_#t~mem2, ULTIMATE.start_test_fun_#t~post3] 220#L11-2 [109] L11-2-->L10-3: Formula: (let ((.cse0 (* 4 v_ULTIMATE.start_test_fun_~i~0_21))) (let ((.cse1 (+ v_ULTIMATE.start_test_fun_~a.offset_10 .cse0))) (and (= 1 (select |v_#valid_22| v_ULTIMATE.start_test_fun_~a.base_13)) (= v_ULTIMATE.start_test_fun_~res~0_10 (+ v_ULTIMATE.start_test_fun_~res~0_11 1)) (<= (+ v_ULTIMATE.start_test_fun_~a.offset_10 .cse0 4) (select |v_#length_10| v_ULTIMATE.start_test_fun_~a.base_13)) (= |v_#memory_int_6| (store |v_#memory_int_7| v_ULTIMATE.start_test_fun_~a.base_13 (store (select |v_#memory_int_7| v_ULTIMATE.start_test_fun_~a.base_13) .cse1 (+ |v_ULTIMATE.start_test_fun_#t~post3_7| (- 1))))) (<= 0 .cse1)))) InVars {ULTIMATE.start_test_fun_~a.offset=v_ULTIMATE.start_test_fun_~a.offset_10, ULTIMATE.start_test_fun_~a.base=v_ULTIMATE.start_test_fun_~a.base_13, ULTIMATE.start_test_fun_#t~post3=|v_ULTIMATE.start_test_fun_#t~post3_7|, ULTIMATE.start_test_fun_~res~0=v_ULTIMATE.start_test_fun_~res~0_11, #valid=|v_#valid_22|, #memory_int=|v_#memory_int_7|, #length=|v_#length_10|, ULTIMATE.start_test_fun_~i~0=v_ULTIMATE.start_test_fun_~i~0_21} OutVars{ULTIMATE.start_test_fun_~a.offset=v_ULTIMATE.start_test_fun_~a.offset_10, ULTIMATE.start_test_fun_~a.base=v_ULTIMATE.start_test_fun_~a.base_13, ULTIMATE.start_test_fun_#t~mem2=|v_ULTIMATE.start_test_fun_#t~mem2_6|, ULTIMATE.start_test_fun_#t~post3=|v_ULTIMATE.start_test_fun_#t~post3_6|, ULTIMATE.start_test_fun_#t~post4=|v_ULTIMATE.start_test_fun_#t~post4_4|, ULTIMATE.start_test_fun_~res~0=v_ULTIMATE.start_test_fun_~res~0_10, #valid=|v_#valid_22|, #memory_int=|v_#memory_int_6|, #length=|v_#length_10|, ULTIMATE.start_test_fun_~i~0=v_ULTIMATE.start_test_fun_~i~0_21} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_#t~mem2, ULTIMATE.start_test_fun_#t~post3, ULTIMATE.start_test_fun_#t~post4, ULTIMATE.start_test_fun_~res~0, #memory_int] 225#L10-3 [2020-06-22 10:42:28,222 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 10:42:28,222 INFO L82 PathProgramCache]: Analyzing trace with hash 4039975, now seen corresponding path program 1 times [2020-06-22 10:42:28,222 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 10:42:28,222 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 10:42:28,223 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 10:42:28,223 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 10:42:28,223 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 10:42:28,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 10:42:28,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 10:42:28,234 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 10:42:28,234 INFO L82 PathProgramCache]: Analyzing trace with hash 2687499, now seen corresponding path program 1 times [2020-06-22 10:42:28,234 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 10:42:28,234 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 10:42:28,235 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 10:42:28,235 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 10:42:28,235 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 10:42:28,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 10:42:28,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 10:42:28,244 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 10:42:28,244 INFO L82 PathProgramCache]: Analyzing trace with hash -1323064271, now seen corresponding path program 1 times [2020-06-22 10:42:28,244 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 10:42:28,244 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 10:42:28,245 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 10:42:28,245 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 10:42:28,245 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 10:42:28,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 10:42:28,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 10:42:28,447 WARN L188 SmtUtils]: Spent 140.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 50 [2020-06-22 10:42:28,505 INFO L216 LassoAnalysis]: Preferences: [2020-06-22 10:42:28,505 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2020-06-22 10:42:28,506 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-06-22 10:42:28,506 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2020-06-22 10:42:28,506 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2020-06-22 10:42:28,506 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-06-22 10:42:28,506 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2020-06-22 10:42:28,506 INFO L130 ssoRankerPreferences]: Path of dumped script: [2020-06-22 10:42:28,506 INFO L131 ssoRankerPreferences]: Filename of dumped script: theBenchmark.c_BEv2_Iteration3_Lasso [2020-06-22 10:42:28,506 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2020-06-22 10:42:28,506 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2020-06-22 10:42:28,509 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:42:28,516 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:42:28,519 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:42:28,522 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:42:28,524 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:42:28,641 WARN L188 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 44 DAG size of output: 41 [2020-06-22 10:42:28,663 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:42:28,665 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:42:28,668 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:42:28,671 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:42:28,673 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:42:28,675 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:42:28,679 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:42:28,682 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:42:28,972 INFO L300 LassoAnalysis]: Preprocessing complete. [2020-06-22 10:42:28,972 INFO L497 LassoAnalysis]: Using template 'affine'. [2020-06-22 10:42:28,973 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:42:28,973 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 10:42:28,973 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 10:42:28,973 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 10:42:28,974 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 10:42:28,975 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-06-22 10:42:28,975 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-06-22 10:42:28,980 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 10:42:28,981 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:42:28,981 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 10:42:28,982 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 10:42:28,982 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 10:42:28,982 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 10:42:28,983 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-06-22 10:42:28,983 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-06-22 10:42:28,984 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 10:42:28,985 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:42:28,985 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 10:42:28,985 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 10:42:28,985 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 10:42:28,986 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 10:42:28,986 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 10:42:28,986 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 10:42:28,986 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 10:42:28,987 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 10:42:28,987 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:42:28,987 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 10:42:28,987 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 10:42:28,988 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 10:42:28,988 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 10:42:28,988 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 10:42:28,988 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 10:42:28,988 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 10:42:28,989 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 10:42:28,989 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:42:28,990 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 10:42:28,990 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 10:42:28,990 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 10:42:28,990 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 10:42:28,990 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 10:42:28,990 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 10:42:28,991 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 10:42:28,992 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2020-06-22 10:42:28,993 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2020-06-22 10:42:28,993 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 1 variables to zero. [2020-06-22 10:42:28,994 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2020-06-22 10:42:28,994 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2020-06-22 10:42:28,994 INFO L518 LassoAnalysis]: Proved termination. [2020-06-22 10:42:28,994 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select (select #memory_int ULTIMATE.start_test_fun_~a.base) (+ ULTIMATE.start_test_fun_~a.offset (* 4 ULTIMATE.start_test_fun_~i~0)))_3) = 1*v_rep(select (select #memory_int ULTIMATE.start_test_fun_~a.base) (+ ULTIMATE.start_test_fun_~a.offset (* 4 ULTIMATE.start_test_fun_~i~0)))_3 Supporting invariants [] [2020-06-22 10:42:29,001 INFO L297 tatePredicateManager]: 3 out of 3 supporting invariants were superfluous and have been removed [2020-06-22 10:42:29,002 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-06-22 10:42:29,016 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 10:42:29,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 10:42:29,029 INFO L256 TraceCheckSpWp]: Trace formula consists of 37 conjuncts, 2 conjunts are in the unsatisfiable core [2020-06-22 10:42:29,030 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 10:42:29,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 10:42:29,039 INFO L256 TraceCheckSpWp]: Trace formula consists of 24 conjuncts, 7 conjunts are in the unsatisfiable core [2020-06-22 10:42:29,039 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 10:42:29,086 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:42:29,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 10:42:29,140 INFO L137 LoopCannibalizer]: termination argument not suffcient for all loop shiftings [2020-06-22 10:42:29,141 INFO L98 LoopCannibalizer]: 4 predicates before loop cannibalization 4 predicates after loop cannibalization [2020-06-22 10:42:29,141 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.1 stem predicates 4 loop predicates [2020-06-22 10:42:29,141 INFO L69 BuchiDifferenceNCSB]: Start buchiDifferenceNCSB. First operand 13 states and 18 transitions. cyclomatic complexity: 7 Second operand 5 states. [2020-06-22 10:42:29,184 INFO L73 BuchiDifferenceNCSB]: Finished buchiDifferenceNCSB. First operand 13 states and 18 transitions. cyclomatic complexity: 7. Second operand 5 states. Result 20 states and 26 transitions. Complement of second has 8 states. [2020-06-22 10:42:29,185 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 1 stem states 3 non-accepting loop states 1 accepting loop states [2020-06-22 10:42:29,185 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-06-22 10:42:29,185 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 16 transitions. [2020-06-22 10:42:29,186 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 16 transitions. Stem has 4 letters. Loop has 4 letters. [2020-06-22 10:42:29,186 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-06-22 10:42:29,186 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 16 transitions. Stem has 8 letters. Loop has 4 letters. [2020-06-22 10:42:29,186 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-06-22 10:42:29,186 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 16 transitions. Stem has 4 letters. Loop has 8 letters. [2020-06-22 10:42:29,187 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-06-22 10:42:29,189 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 20 states and 26 transitions. [2020-06-22 10:42:29,190 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2020-06-22 10:42:29,190 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 20 states to 0 states and 0 transitions. [2020-06-22 10:42:29,190 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2020-06-22 10:42:29,190 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2020-06-22 10:42:29,191 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2020-06-22 10:42:29,191 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-06-22 10:42:29,191 INFO L706 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-06-22 10:42:29,191 INFO L729 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-06-22 10:42:29,191 INFO L609 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-06-22 10:42:29,191 INFO L442 BuchiCegarLoop]: ======== Iteration 4============ [2020-06-22 10:42:29,191 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2020-06-22 10:42:29,191 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2020-06-22 10:42:29,191 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2020-06-22 10:42:29,198 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 22.06 10:42:29 BasicIcfg [2020-06-22 10:42:29,198 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2020-06-22 10:42:29,199 INFO L168 Benchmark]: Toolchain (without parser) took 4665.78 ms. Allocated memory was 514.9 MB in the beginning and 642.8 MB in the end (delta: 127.9 MB). Free memory was 436.2 MB in the beginning and 475.7 MB in the end (delta: -39.5 MB). Peak memory consumption was 88.5 MB. Max. memory is 50.3 GB. [2020-06-22 10:42:29,200 INFO L168 Benchmark]: CDTParser took 0.16 ms. Allocated memory is still 514.9 MB. Free memory is still 457.0 MB. There was no memory consumed. Max. memory is 50.3 GB. [2020-06-22 10:42:29,200 INFO L168 Benchmark]: CACSL2BoogieTranslator took 307.11 ms. Allocated memory was 514.9 MB in the beginning and 568.3 MB in the end (delta: 53.5 MB). Free memory was 435.7 MB in the beginning and 537.5 MB in the end (delta: -101.8 MB). Peak memory consumption was 28.4 MB. Max. memory is 50.3 GB. [2020-06-22 10:42:29,201 INFO L168 Benchmark]: Boogie Procedure Inliner took 39.09 ms. Allocated memory is still 568.3 MB. Free memory was 537.5 MB in the beginning and 536.0 MB in the end (delta: 1.5 MB). Peak memory consumption was 1.5 MB. Max. memory is 50.3 GB. [2020-06-22 10:42:29,201 INFO L168 Benchmark]: Boogie Preprocessor took 24.13 ms. Allocated memory is still 568.3 MB. Free memory was 536.0 MB in the beginning and 534.4 MB in the end (delta: 1.5 MB). Peak memory consumption was 1.5 MB. Max. memory is 50.3 GB. [2020-06-22 10:42:29,202 INFO L168 Benchmark]: RCFGBuilder took 301.90 ms. Allocated memory is still 568.3 MB. Free memory was 534.4 MB in the beginning and 517.6 MB in the end (delta: 16.8 MB). Peak memory consumption was 16.8 MB. Max. memory is 50.3 GB. [2020-06-22 10:42:29,203 INFO L168 Benchmark]: BlockEncodingV2 took 120.99 ms. Allocated memory is still 568.3 MB. Free memory was 517.6 MB in the beginning and 510.0 MB in the end (delta: 7.6 MB). Peak memory consumption was 7.6 MB. Max. memory is 50.3 GB. [2020-06-22 10:42:29,203 INFO L168 Benchmark]: TraceAbstraction took 896.41 ms. Allocated memory is still 568.3 MB. Free memory was 509.2 MB in the beginning and 430.8 MB in the end (delta: 78.4 MB). Peak memory consumption was 78.4 MB. Max. memory is 50.3 GB. [2020-06-22 10:42:29,204 INFO L168 Benchmark]: BuchiAutomizer took 2970.72 ms. Allocated memory was 568.3 MB in the beginning and 642.8 MB in the end (delta: 74.4 MB). Free memory was 430.8 MB in the beginning and 475.7 MB in the end (delta: -44.9 MB). Peak memory consumption was 29.6 MB. Max. memory is 50.3 GB. [2020-06-22 10:42:29,208 INFO L337 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.plugins.blockencoding: - StatisticsResult: Initial Icfg 23 locations, 27 edges - StatisticsResult: Encoded RCFG 14 locations, 23 edges * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.16 ms. Allocated memory is still 514.9 MB. Free memory is still 457.0 MB. There was no memory consumed. Max. memory is 50.3 GB. * CACSL2BoogieTranslator took 307.11 ms. Allocated memory was 514.9 MB in the beginning and 568.3 MB in the end (delta: 53.5 MB). Free memory was 435.7 MB in the beginning and 537.5 MB in the end (delta: -101.8 MB). Peak memory consumption was 28.4 MB. Max. memory is 50.3 GB. * Boogie Procedure Inliner took 39.09 ms. Allocated memory is still 568.3 MB. Free memory was 537.5 MB in the beginning and 536.0 MB in the end (delta: 1.5 MB). Peak memory consumption was 1.5 MB. Max. memory is 50.3 GB. * Boogie Preprocessor took 24.13 ms. Allocated memory is still 568.3 MB. Free memory was 536.0 MB in the beginning and 534.4 MB in the end (delta: 1.5 MB). Peak memory consumption was 1.5 MB. Max. memory is 50.3 GB. * RCFGBuilder took 301.90 ms. Allocated memory is still 568.3 MB. Free memory was 534.4 MB in the beginning and 517.6 MB in the end (delta: 16.8 MB). Peak memory consumption was 16.8 MB. Max. memory is 50.3 GB. * BlockEncodingV2 took 120.99 ms. Allocated memory is still 568.3 MB. Free memory was 517.6 MB in the beginning and 510.0 MB in the end (delta: 7.6 MB). Peak memory consumption was 7.6 MB. Max. memory is 50.3 GB. * TraceAbstraction took 896.41 ms. Allocated memory is still 568.3 MB. Free memory was 509.2 MB in the beginning and 430.8 MB in the end (delta: 78.4 MB). Peak memory consumption was 78.4 MB. Max. memory is 50.3 GB. * BuchiAutomizer took 2970.72 ms. Allocated memory was 568.3 MB in the beginning and 642.8 MB in the end (delta: 74.4 MB). Free memory was 430.8 MB in the beginning and 475.7 MB in the end (delta: -44.9 MB). Peak memory consumption was 29.6 MB. Max. memory is 50.3 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - 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: 11]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 11]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 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 - AllSpecificationsHoldResult: All specifications hold 6 specifications checked. All of them hold - InvariantResult [Line: 9]: Loop Invariant [2020-06-22 10:42:29,215 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 10:42:29,216 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length Derived loop invariant: ((4 * N <= unknown-#length-unknown[a] && 0 == a) && 0 <= 4 * i + a) && 1 == \valid[a] - InvariantResult [Line: 10]: Loop Invariant [2020-06-22 10:42:29,217 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 10:42:29,217 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 10:42:29,218 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 10:42:29,218 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length Derived loop invariant: (((4 * N <= unknown-#length-unknown[a] && 0 == a) && 4 * i + 4 <= unknown-#length-unknown[a]) && 0 <= 4 * i + a) && 1 == \valid[a] - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 14 locations, 6 error locations. SAFE Result, 0.8s OverallTime, 4 OverallIterations, 2 TraceHistogramMax, 0.2s AutomataDifference, 0.0s DeadEndRemovalTime, 0.1s HoareAnnotationTime, HoareTripleCheckerStatistics: 15 SDtfs, 38 SDslu, 16 SDs, 0 SdLazy, 70 SolverSat, 18 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.1s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 11 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=16occurred in iteration=3, 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, 4 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 2 LocationsWithAnnotation, 2 PreInvPairs, 4 NumberOfFragments, 55 HoareAnnotationTreeSize, 2 FomulaSimplifications, 0 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 2 FomulaSimplificationsInter, 63 FormulaSimplificationTreeSizeReductionInter, 0.1s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.1s InterpolantComputationTime, 23 NumberOfCodeBlocks, 23 NumberOfCodeBlocksAsserted, 4 NumberOfCheckSat, 19 ConstructedInterpolants, 0 QuantifiedInterpolants, 391 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 4 InterpolantComputations, 4 PerfectInterpolantSequences, 2/2 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available - StatisticsResult: Constructed decomposition of program Your program was decomposed into 3 terminating modules (0 trivial, 0 deterministic, 3 nondeterministic). One nondeterministic module has affine ranking function N + -1 * i and consists of 3 locations. One nondeterministic module has affine ranking function -1 * a + unknown-#length-unknown[a] + -4 * i and consists of 4 locations. One nondeterministic module has affine ranking function unknown-#memory_int-unknown[a][a + 4 * i] and consists of 5 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 2.9s and 4 iterations. TraceHistogramMax:1. Analysis of lassos took 2.2s. Construction of modules took 0.1s. Büchi inclusion checks took 0.4s. Highest rank in rank-based complementation 3. Minimization of det autom 1. Minimization of nondet autom 2. Automata minimization 0.0s AutomataMinimizationTime, 2 MinimizatonAttempts, 13 StatesRemovedByMinimization, 2 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 18 states and ocurred in iteration 1. Nontrivial modules had stage [3, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 26 SDtfs, 89 SDslu, 16 SDs, 0 SdLazy, 115 SolverSat, 9 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.1s Time LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT0 conc0 concLT0 SILN0 SILU0 SILI0 SILT0 lasso3 LassoPreprocessingBenchmarks: Lassos: inital123 mio100 ax100 hnf100 lsp91 ukn84 mio100 lsp60 div100 bol100 ite100 ukn100 eq180 hnf89 smp100 dnf100 smp100 tf100 neg100 sie101 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 22ms VariablesStem: 2 VariablesLoop: 2 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:42:21.334 ----------------------------------------------- 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:42:29.445 !MESSAGE The workspace will exit with unsaved changes in this session. Received shutdown request... Ultimate: GTK+ Version Check