72.80/34.77 YES 72.80/34.77 72.80/34.77 Ultimate: Cannot open display: 72.80/34.77 This is Ultimate 0.1.24-8dc7c08-m 72.80/34.77 [2019-03-28 12:50:16,960 INFO L170 SettingsManager]: Resetting all preferences to default values... 72.80/34.77 [2019-03-28 12:50:16,962 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values 72.80/34.77 [2019-03-28 12:50:16,974 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... 72.80/34.77 [2019-03-28 12:50:16,974 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values 72.80/34.77 [2019-03-28 12:50:16,975 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values 72.80/34.77 [2019-03-28 12:50:16,976 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values 72.80/34.77 [2019-03-28 12:50:16,978 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values 72.80/34.77 [2019-03-28 12:50:16,979 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values 72.80/34.77 [2019-03-28 12:50:16,980 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values 72.80/34.77 [2019-03-28 12:50:16,981 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... 72.80/34.77 [2019-03-28 12:50:16,981 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values 72.80/34.77 [2019-03-28 12:50:16,982 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values 72.80/34.77 [2019-03-28 12:50:16,983 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values 72.80/34.77 [2019-03-28 12:50:16,984 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values 72.80/34.77 [2019-03-28 12:50:16,985 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values 72.80/34.77 [2019-03-28 12:50:16,985 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values 72.80/34.77 [2019-03-28 12:50:16,987 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values 72.80/34.77 [2019-03-28 12:50:16,989 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values 72.80/34.77 [2019-03-28 12:50:16,990 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values 72.80/34.77 [2019-03-28 12:50:16,992 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values 72.80/34.77 [2019-03-28 12:50:16,993 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values 72.80/34.77 [2019-03-28 12:50:16,995 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... 72.80/34.77 [2019-03-28 12:50:16,995 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... 72.80/34.77 [2019-03-28 12:50:16,995 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values 72.80/34.77 [2019-03-28 12:50:16,996 INFO L174 SettingsManager]: Resetting IcfgToChc preferences to default values 72.80/34.77 [2019-03-28 12:50:16,996 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values 72.80/34.77 [2019-03-28 12:50:16,997 INFO L177 SettingsManager]: ReqToTest provides no preferences, ignoring... 72.80/34.77 [2019-03-28 12:50:16,997 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values 72.80/34.77 [2019-03-28 12:50:16,998 INFO L174 SettingsManager]: Resetting ChcSmtPrinter preferences to default values 72.80/34.77 [2019-03-28 12:50:16,999 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values 72.80/34.77 [2019-03-28 12:50:17,000 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values 72.80/34.77 [2019-03-28 12:50:17,001 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... 72.80/34.77 [2019-03-28 12:50:17,001 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values 72.80/34.77 [2019-03-28 12:50:17,001 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... 72.80/34.77 [2019-03-28 12:50:17,002 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... 72.80/34.77 [2019-03-28 12:50:17,002 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values 72.80/34.77 [2019-03-28 12:50:17,003 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values 72.80/34.77 [2019-03-28 12:50:17,003 INFO L181 SettingsManager]: Finished resetting all preferences to default values... 72.80/34.77 [2019-03-28 12:50:17,004 INFO L98 SettingsManager]: Beginning loading settings from /export/starexec/sandbox/solver/bin/./../termcomp2017.epf 72.80/34.77 [2019-03-28 12:50:17,018 INFO L110 SettingsManager]: Loading preferences was successful 72.80/34.77 [2019-03-28 12:50:17,018 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: 72.80/34.77 [2019-03-28 12:50:17,020 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: 72.80/34.77 [2019-03-28 12:50:17,020 INFO L133 SettingsManager]: * Rewrite not-equals=true 72.80/34.77 [2019-03-28 12:50:17,020 INFO L133 SettingsManager]: * Create parallel compositions if possible=false 72.80/34.77 [2019-03-28 12:50:17,020 INFO L133 SettingsManager]: * Minimize states using LBE with the strategy=SINGLE 72.80/34.77 [2019-03-28 12:50:17,020 INFO L133 SettingsManager]: * Use SBE=true 72.80/34.77 [2019-03-28 12:50:17,021 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: 72.80/34.77 [2019-03-28 12:50:17,021 INFO L133 SettingsManager]: * Use old map elimination=false 72.80/34.77 [2019-03-28 12:50:17,021 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false 72.80/34.77 [2019-03-28 12:50:17,021 INFO L133 SettingsManager]: * Buchi interpolant automaton construction strategy=DANDELION 72.80/34.77 [2019-03-28 12:50:17,021 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true 72.80/34.77 [2019-03-28 12:50:17,021 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES 72.80/34.77 [2019-03-28 12:50:17,022 INFO L133 SettingsManager]: * Construct termination proof for TermComp=true 72.80/34.77 [2019-03-28 12:50:17,022 INFO L133 SettingsManager]: * Command for external solver (GNTA synthesis)=z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 72.80/34.77 [2019-03-28 12:50:17,022 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: 72.80/34.77 [2019-03-28 12:50:17,022 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false 72.80/34.77 [2019-03-28 12:50:17,022 INFO L133 SettingsManager]: * Check division by zero=IGNORE 72.80/34.77 [2019-03-28 12:50:17,022 INFO L133 SettingsManager]: * Check if freed pointer was valid=false 72.80/34.77 [2019-03-28 12:50:17,023 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false 72.80/34.77 [2019-03-28 12:50:17,023 INFO L133 SettingsManager]: * How to treat unsigned ints differently from normal ones=IGNORE 72.80/34.77 [2019-03-28 12:50:17,023 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: 72.80/34.77 [2019-03-28 12:50:17,023 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements 72.80/34.77 [2019-03-28 12:50:17,023 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump 72.80/34.77 [2019-03-28 12:50:17,023 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:5000 72.80/34.77 [2019-03-28 12:50:17,024 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: 72.80/34.77 [2019-03-28 12:50:17,024 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles 72.80/34.77 [2019-03-28 12:50:17,024 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL 72.80/34.77 [2019-03-28 12:50:17,024 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true 72.80/34.77 [2019-03-28 12:50:17,050 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp 72.80/34.77 [2019-03-28 12:50:17,063 INFO L259 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized 72.80/34.77 [2019-03-28 12:50:17,067 INFO L215 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. 72.80/34.77 [2019-03-28 12:50:17,068 INFO L271 PluginConnector]: Initializing CDTParser... 72.80/34.77 [2019-03-28 12:50:17,069 INFO L276 PluginConnector]: CDTParser initialized 72.80/34.77 [2019-03-28 12:50:17,069 INFO L430 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /export/starexec/sandbox/benchmark/theBenchmark.c 72.80/34.77 [2019-03-28 12:50:17,156 INFO L221 CDTParser]: Created temporary CDT project at /export/starexec/sandbox/tmp/ee15ddfe1d4d4dedba569123037bf65a/FLAG5ab365158 72.80/34.77 [2019-03-28 12:50:17,502 INFO L307 CDTParser]: Found 1 translation units. 72.80/34.77 [2019-03-28 12:50:17,502 INFO L161 CDTParser]: Scanning /export/starexec/sandbox/benchmark/theBenchmark.c 72.80/34.77 [2019-03-28 12:50:17,503 WARN L117 ultiparseSymbolTable]: System include stdlib.h could not be resolved by CDT -- only built-in system includes are available. 72.80/34.77 [2019-03-28 12:50:17,510 INFO L355 CDTParser]: About to delete temporary CDT project at /export/starexec/sandbox/tmp/ee15ddfe1d4d4dedba569123037bf65a/FLAG5ab365158 72.80/34.77 [2019-03-28 12:50:17,907 INFO L363 CDTParser]: Successfully deleted /export/starexec/sandbox/tmp/ee15ddfe1d4d4dedba569123037bf65a 72.80/34.77 [2019-03-28 12:50:17,919 INFO L297 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### 72.80/34.77 [2019-03-28 12:50:17,920 INFO L131 ToolchainWalker]: Walking toolchain with 7 elements. 72.80/34.77 [2019-03-28 12:50:17,921 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- 72.80/34.77 [2019-03-28 12:50:17,921 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... 72.80/34.77 [2019-03-28 12:50:17,925 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized 72.80/34.77 [2019-03-28 12:50:17,926 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.03 12:50:17" (1/1) ... 72.80/34.77 [2019-03-28 12:50:17,929 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6ee1fe88 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 12:50:17, skipping insertion in model container 72.80/34.77 [2019-03-28 12:50:17,929 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.03 12:50:17" (1/1) ... 72.80/34.77 [2019-03-28 12:50:17,938 INFO L145 MainTranslator]: Starting translation in SV-COMP mode 72.80/34.77 [2019-03-28 12:50:17,957 INFO L176 MainTranslator]: Built tables and reachable declarations 72.80/34.77 [2019-03-28 12:50:18,125 INFO L206 PostProcessor]: Analyzing one entry point: main 72.80/34.77 [2019-03-28 12:50:18,137 INFO L191 MainTranslator]: Completed pre-run 72.80/34.77 [2019-03-28 12:50:18,214 INFO L206 PostProcessor]: Analyzing one entry point: main 72.80/34.77 [2019-03-28 12:50:18,230 INFO L195 MainTranslator]: Completed translation 72.80/34.77 [2019-03-28 12:50:18,230 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 12:50:18 WrapperNode 72.80/34.77 [2019-03-28 12:50:18,230 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- 72.80/34.77 [2019-03-28 12:50:18,231 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- 72.80/34.77 [2019-03-28 12:50:18,231 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... 72.80/34.77 [2019-03-28 12:50:18,231 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized 72.80/34.77 [2019-03-28 12:50:18,240 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 12:50:18" (1/1) ... 72.80/34.77 [2019-03-28 12:50:18,250 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 12:50:18" (1/1) ... 72.80/34.77 [2019-03-28 12:50:18,273 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- 72.80/34.77 [2019-03-28 12:50:18,273 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- 72.80/34.77 [2019-03-28 12:50:18,273 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... 72.80/34.77 [2019-03-28 12:50:18,274 INFO L276 PluginConnector]: Boogie Preprocessor initialized 72.80/34.77 [2019-03-28 12:50:18,283 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 12:50:18" (1/1) ... 72.80/34.77 [2019-03-28 12:50:18,283 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 12:50:18" (1/1) ... 72.80/34.77 [2019-03-28 12:50:18,285 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 12:50:18" (1/1) ... 72.80/34.77 [2019-03-28 12:50:18,286 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 12:50:18" (1/1) ... 72.80/34.77 [2019-03-28 12:50:18,292 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 12:50:18" (1/1) ... 72.80/34.77 [2019-03-28 12:50:18,297 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 12:50:18" (1/1) ... 72.80/34.77 [2019-03-28 12:50:18,298 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 12:50:18" (1/1) ... 72.80/34.77 [2019-03-28 12:50:18,301 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- 72.80/34.77 [2019-03-28 12:50:18,301 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- 72.80/34.77 [2019-03-28 12:50:18,301 INFO L271 PluginConnector]: Initializing RCFGBuilder... 72.80/34.77 [2019-03-28 12:50:18,301 INFO L276 PluginConnector]: RCFGBuilder initialized 72.80/34.77 [2019-03-28 12:50:18,302 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 12:50:18" (1/1) ... 72.80/34.77 No working directory specified, using /export/starexec/sandbox/solver/bin/z3 72.80/34.77 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:5000 (exit command is (exit), workingDir is null) 72.80/34.77 Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:5000 72.80/34.77 [2019-03-28 12:50:18,367 INFO L130 BoogieDeclarations]: Found specification of procedure write~int 72.80/34.77 [2019-03-28 12:50:18,367 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start 72.80/34.77 [2019-03-28 12:50:18,367 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start 72.80/34.77 [2019-03-28 12:50:18,367 INFO L130 BoogieDeclarations]: Found specification of procedure read~int 72.80/34.77 [2019-03-28 12:50:18,367 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack 72.80/34.77 [2019-03-28 12:50:18,368 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc 72.80/34.77 [2019-03-28 12:50:18,614 INFO L281 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) 72.80/34.77 [2019-03-28 12:50:18,614 INFO L286 CfgBuilder]: Removed 8 assue(true) statements. 72.80/34.77 [2019-03-28 12:50:18,615 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.03 12:50:18 BoogieIcfgContainer 72.80/34.77 [2019-03-28 12:50:18,616 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- 72.80/34.77 [2019-03-28 12:50:18,616 INFO L113 PluginConnector]: ------------------------BlockEncodingV2---------------------------- 72.80/34.77 [2019-03-28 12:50:18,616 INFO L271 PluginConnector]: Initializing BlockEncodingV2... 72.80/34.77 [2019-03-28 12:50:18,618 INFO L276 PluginConnector]: BlockEncodingV2 initialized 72.80/34.77 [2019-03-28 12:50:18,619 INFO L185 PluginConnector]: Executing the observer BlockEncodingObserver from plugin BlockEncodingV2 for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.03 12:50:18" (1/1) ... 72.80/34.77 [2019-03-28 12:50:18,636 INFO L313 BlockEncoder]: Initial Icfg 27 locations, 34 edges 72.80/34.77 [2019-03-28 12:50:18,638 INFO L258 BlockEncoder]: Using Remove infeasible edges 72.80/34.77 [2019-03-28 12:50:18,638 INFO L263 BlockEncoder]: Using Maximize final states 72.80/34.77 [2019-03-28 12:50:18,639 INFO L270 BlockEncoder]: Using Minimize states even if more edges are added than removed.=false 72.80/34.77 [2019-03-28 12:50:18,639 INFO L276 BlockEncoder]: Using Minimize states using LBE with the strategy=SINGLE 72.80/34.77 [2019-03-28 12:50:18,641 INFO L296 BlockEncoder]: Using Remove sink states 72.80/34.77 [2019-03-28 12:50:18,642 INFO L171 BlockEncoder]: Using Apply optimizations until nothing changes=true 72.80/34.77 [2019-03-28 12:50:18,642 INFO L179 BlockEncoder]: Using Rewrite not-equals 72.80/34.77 [2019-03-28 12:50:18,671 INFO L185 BlockEncoder]: Using Use SBE 72.80/34.77 [2019-03-28 12:50:18,706 INFO L200 BlockEncoder]: SBE split 12 edges 72.80/34.77 [2019-03-28 12:50:18,711 INFO L70 emoveInfeasibleEdges]: Removed 2 edges and 0 locations because of local infeasibility 72.80/34.77 [2019-03-28 12:50:18,713 INFO L71 MaximizeFinalStates]: 0 new accepting states 72.80/34.77 [2019-03-28 12:50:18,733 INFO L100 BaseMinimizeStates]: Removed 10 edges and 5 locations by large block encoding 72.80/34.77 [2019-03-28 12:50:18,735 INFO L70 RemoveSinkStates]: Removed 1 edges and 1 locations by removing sink states 72.80/34.77 [2019-03-28 12:50:18,753 INFO L70 emoveInfeasibleEdges]: Removed 0 edges and 0 locations because of local infeasibility 72.80/34.77 [2019-03-28 12:50:18,753 INFO L71 MaximizeFinalStates]: 0 new accepting states 72.80/34.77 [2019-03-28 12:50:18,753 INFO L100 BaseMinimizeStates]: Removed 0 edges and 0 locations by large block encoding 72.80/34.77 [2019-03-28 12:50:18,754 INFO L70 RemoveSinkStates]: Removed 0 edges and 0 locations by removing sink states 72.80/34.77 [2019-03-28 12:50:18,754 INFO L313 BlockEncoder]: Encoded RCFG 21 locations, 45 edges 72.80/34.77 [2019-03-28 12:50:18,755 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 28.03 12:50:18 BasicIcfg 72.80/34.77 [2019-03-28 12:50:18,755 INFO L132 PluginConnector]: ------------------------ END BlockEncodingV2---------------------------- 72.80/34.77 [2019-03-28 12:50:18,756 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- 72.80/34.77 [2019-03-28 12:50:18,756 INFO L271 PluginConnector]: Initializing TraceAbstraction... 72.80/34.77 [2019-03-28 12:50:18,759 INFO L276 PluginConnector]: TraceAbstraction initialized 72.80/34.77 [2019-03-28 12:50:18,760 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.03 12:50:17" (1/4) ... 72.80/34.77 [2019-03-28 12:50:18,760 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@60cd535a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.03 12:50:18, skipping insertion in model container 72.80/34.77 [2019-03-28 12:50:18,761 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 12:50:18" (2/4) ... 72.80/34.77 [2019-03-28 12:50:18,761 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@60cd535a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.03 12:50:18, skipping insertion in model container 72.80/34.77 [2019-03-28 12:50:18,761 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.03 12:50:18" (3/4) ... 72.80/34.77 [2019-03-28 12:50:18,762 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@60cd535a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.03 12:50:18, skipping insertion in model container 72.80/34.77 [2019-03-28 12:50:18,762 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 28.03 12:50:18" (4/4) ... 72.80/34.77 [2019-03-28 12:50:18,763 INFO L112 eAbstractionObserver]: Analyzing ICFG theBenchmark.c_BEv2 72.80/34.77 [2019-03-28 12:50:18,773 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:ForwardPredicates Determinization: PREDICATE_ABSTRACTION 72.80/34.77 [2019-03-28 12:50:18,782 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 8 error locations. 72.80/34.77 [2019-03-28 12:50:18,798 INFO L257 AbstractCegarLoop]: Starting to check reachability of 8 error locations. 72.80/34.77 [2019-03-28 12:50:18,827 INFO L133 ementStrategyFactory]: Using default assertion order modulation 72.80/34.77 [2019-03-28 12:50:18,828 INFO L382 AbstractCegarLoop]: Interprodecural is true 72.80/34.77 [2019-03-28 12:50:18,828 INFO L383 AbstractCegarLoop]: Hoare is true 72.80/34.77 [2019-03-28 12:50:18,828 INFO L384 AbstractCegarLoop]: Compute interpolants for ForwardPredicates 72.80/34.77 [2019-03-28 12:50:18,829 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE 72.80/34.77 [2019-03-28 12:50:18,829 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION 72.80/34.77 [2019-03-28 12:50:18,829 INFO L387 AbstractCegarLoop]: Difference is false 72.80/34.77 [2019-03-28 12:50:18,829 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA 72.80/34.77 [2019-03-28 12:50:18,829 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== 72.80/34.77 [2019-03-28 12:50:18,844 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states. 72.80/34.77 [2019-03-28 12:50:18,850 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 72.80/34.77 [2019-03-28 12:50:18,850 INFO L394 BasicCegarLoop]: Found error trace 72.80/34.77 [2019-03-28 12:50:18,851 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] 72.80/34.77 [2019-03-28 12:50:18,851 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION]=== 72.80/34.77 [2019-03-28 12:50:18,856 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 72.80/34.77 [2019-03-28 12:50:18,857 INFO L82 PathProgramCache]: Analyzing trace with hash 476970010, now seen corresponding path program 1 times 72.80/34.77 [2019-03-28 12:50:18,859 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 72.80/34.77 [2019-03-28 12:50:18,859 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 72.80/34.77 [2019-03-28 12:50:18,912 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 72.80/34.77 [2019-03-28 12:50:18,913 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 72.80/34.77 [2019-03-28 12:50:18,913 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 72.80/34.77 [2019-03-28 12:50:18,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 72.80/34.77 [2019-03-28 12:50:19,062 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 72.80/34.77 [2019-03-28 12:50:19,064 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. 72.80/34.77 [2019-03-28 12:50:19,065 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 72.80/34.77 [2019-03-28 12:50:19,068 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states 72.80/34.77 [2019-03-28 12:50:19,082 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. 72.80/34.77 [2019-03-28 12:50:19,083 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 72.80/34.77 [2019-03-28 12:50:19,085 INFO L87 Difference]: Start difference. First operand 21 states. Second operand 3 states. 72.80/34.77 [2019-03-28 12:50:19,218 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. 72.80/34.77 [2019-03-28 12:50:19,218 INFO L93 Difference]: Finished difference Result 21 states and 45 transitions. 72.80/34.77 [2019-03-28 12:50:19,219 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 72.80/34.77 [2019-03-28 12:50:19,221 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 7 72.80/34.77 [2019-03-28 12:50:19,221 INFO L84 Accepts]: Finished accepts. some prefix is accepted. 72.80/34.77 [2019-03-28 12:50:19,234 INFO L225 Difference]: With dead ends: 21 72.80/34.77 [2019-03-28 12:50:19,234 INFO L226 Difference]: Without dead ends: 19 72.80/34.77 [2019-03-28 12:50:19,237 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 72.80/34.77 [2019-03-28 12:50:19,256 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. 72.80/34.77 [2019-03-28 12:50:19,272 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 19. 72.80/34.77 [2019-03-28 12:50:19,274 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. 72.80/34.77 [2019-03-28 12:50:19,275 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 41 transitions. 72.80/34.77 [2019-03-28 12:50:19,276 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 41 transitions. Word has length 7 72.80/34.77 [2019-03-28 12:50:19,277 INFO L84 Accepts]: Finished accepts. word is rejected. 72.80/34.77 [2019-03-28 12:50:19,278 INFO L480 AbstractCegarLoop]: Abstraction has 19 states and 41 transitions. 72.80/34.77 [2019-03-28 12:50:19,278 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. 72.80/34.77 [2019-03-28 12:50:19,278 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 41 transitions. 72.80/34.77 [2019-03-28 12:50:19,278 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 72.80/34.77 [2019-03-28 12:50:19,279 INFO L394 BasicCegarLoop]: Found error trace 72.80/34.77 [2019-03-28 12:50:19,279 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] 72.80/34.77 [2019-03-28 12:50:19,279 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION]=== 72.80/34.77 [2019-03-28 12:50:19,279 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 72.80/34.77 [2019-03-28 12:50:19,280 INFO L82 PathProgramCache]: Analyzing trace with hash 476970012, now seen corresponding path program 1 times 72.80/34.77 [2019-03-28 12:50:19,280 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 72.80/34.77 [2019-03-28 12:50:19,280 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 72.80/34.77 [2019-03-28 12:50:19,281 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 72.80/34.77 [2019-03-28 12:50:19,281 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 72.80/34.77 [2019-03-28 12:50:19,281 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 72.80/34.77 [2019-03-28 12:50:19,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 72.80/34.77 [2019-03-28 12:50:19,328 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 72.80/34.77 [2019-03-28 12:50:19,329 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. 72.80/34.77 [2019-03-28 12:50:19,329 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 72.80/34.77 [2019-03-28 12:50:19,331 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states 72.80/34.77 [2019-03-28 12:50:19,331 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. 72.80/34.77 [2019-03-28 12:50:19,331 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 72.80/34.77 [2019-03-28 12:50:19,332 INFO L87 Difference]: Start difference. First operand 19 states and 41 transitions. Second operand 3 states. 72.80/34.77 [2019-03-28 12:50:19,452 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. 72.80/34.77 [2019-03-28 12:50:19,453 INFO L93 Difference]: Finished difference Result 36 states and 69 transitions. 72.80/34.77 [2019-03-28 12:50:19,453 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 72.80/34.77 [2019-03-28 12:50:19,453 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 7 72.80/34.77 [2019-03-28 12:50:19,454 INFO L84 Accepts]: Finished accepts. some prefix is accepted. 72.80/34.77 [2019-03-28 12:50:19,455 INFO L225 Difference]: With dead ends: 36 72.80/34.77 [2019-03-28 12:50:19,455 INFO L226 Difference]: Without dead ends: 34 72.80/34.77 [2019-03-28 12:50:19,456 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 72.80/34.77 [2019-03-28 12:50:19,456 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. 72.80/34.77 [2019-03-28 12:50:19,461 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 26. 72.80/34.77 [2019-03-28 12:50:19,461 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. 72.80/34.77 [2019-03-28 12:50:19,462 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 61 transitions. 72.80/34.77 [2019-03-28 12:50:19,462 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 61 transitions. Word has length 7 72.80/34.77 [2019-03-28 12:50:19,463 INFO L84 Accepts]: Finished accepts. word is rejected. 72.80/34.77 [2019-03-28 12:50:19,463 INFO L480 AbstractCegarLoop]: Abstraction has 26 states and 61 transitions. 72.80/34.77 [2019-03-28 12:50:19,463 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. 72.80/34.77 [2019-03-28 12:50:19,463 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 61 transitions. 72.80/34.77 [2019-03-28 12:50:19,464 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 72.80/34.77 [2019-03-28 12:50:19,464 INFO L394 BasicCegarLoop]: Found error trace 72.80/34.77 [2019-03-28 12:50:19,464 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] 72.80/34.77 [2019-03-28 12:50:19,464 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION]=== 72.80/34.77 [2019-03-28 12:50:19,464 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 72.80/34.77 [2019-03-28 12:50:19,464 INFO L82 PathProgramCache]: Analyzing trace with hash 476970013, now seen corresponding path program 1 times 72.80/34.77 [2019-03-28 12:50:19,465 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 72.80/34.77 [2019-03-28 12:50:19,465 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 72.80/34.77 [2019-03-28 12:50:19,466 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 72.80/34.77 [2019-03-28 12:50:19,466 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 72.80/34.77 [2019-03-28 12:50:19,466 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 72.80/34.77 [2019-03-28 12:50:19,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 72.80/34.77 [2019-03-28 12:50:19,528 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 72.80/34.77 [2019-03-28 12:50:19,528 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. 72.80/34.77 [2019-03-28 12:50:19,528 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 72.80/34.77 [2019-03-28 12:50:19,529 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states 72.80/34.77 [2019-03-28 12:50:19,529 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. 72.80/34.77 [2019-03-28 12:50:19,529 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 72.80/34.77 [2019-03-28 12:50:19,529 INFO L87 Difference]: Start difference. First operand 26 states and 61 transitions. Second operand 4 states. 72.80/34.77 [2019-03-28 12:50:19,660 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. 72.80/34.77 [2019-03-28 12:50:19,660 INFO L93 Difference]: Finished difference Result 28 states and 61 transitions. 72.80/34.77 [2019-03-28 12:50:19,661 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 72.80/34.77 [2019-03-28 12:50:19,661 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 7 72.80/34.77 [2019-03-28 12:50:19,661 INFO L84 Accepts]: Finished accepts. some prefix is accepted. 72.80/34.77 [2019-03-28 12:50:19,662 INFO L225 Difference]: With dead ends: 28 72.80/34.77 [2019-03-28 12:50:19,662 INFO L226 Difference]: Without dead ends: 26 72.80/34.77 [2019-03-28 12:50:19,662 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 72.80/34.77 [2019-03-28 12:50:19,663 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. 72.80/34.77 [2019-03-28 12:50:19,667 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 26. 72.80/34.77 [2019-03-28 12:50:19,667 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. 72.80/34.77 [2019-03-28 12:50:19,668 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 57 transitions. 72.80/34.77 [2019-03-28 12:50:19,668 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 57 transitions. Word has length 7 72.80/34.77 [2019-03-28 12:50:19,668 INFO L84 Accepts]: Finished accepts. word is rejected. 72.80/34.77 [2019-03-28 12:50:19,668 INFO L480 AbstractCegarLoop]: Abstraction has 26 states and 57 transitions. 72.80/34.77 [2019-03-28 12:50:19,668 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. 72.80/34.77 [2019-03-28 12:50:19,669 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 57 transitions. 72.80/34.77 [2019-03-28 12:50:19,669 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 72.80/34.77 [2019-03-28 12:50:19,669 INFO L394 BasicCegarLoop]: Found error trace 72.80/34.77 [2019-03-28 12:50:19,669 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] 72.80/34.77 [2019-03-28 12:50:19,669 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION]=== 72.80/34.77 [2019-03-28 12:50:19,670 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 72.80/34.77 [2019-03-28 12:50:19,670 INFO L82 PathProgramCache]: Analyzing trace with hash 1901167105, now seen corresponding path program 1 times 72.80/34.77 [2019-03-28 12:50:19,670 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 72.80/34.77 [2019-03-28 12:50:19,670 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 72.80/34.77 [2019-03-28 12:50:19,671 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 72.80/34.77 [2019-03-28 12:50:19,671 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 72.80/34.77 [2019-03-28 12:50:19,671 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 72.80/34.77 [2019-03-28 12:50:19,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 72.80/34.77 [2019-03-28 12:50:19,717 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 72.80/34.77 [2019-03-28 12:50:19,717 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. 72.80/34.77 [2019-03-28 12:50:19,718 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 72.80/34.77 [2019-03-28 12:50:19,718 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states 72.80/34.77 [2019-03-28 12:50:19,718 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. 72.80/34.77 [2019-03-28 12:50:19,718 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 72.80/34.77 [2019-03-28 12:50:19,719 INFO L87 Difference]: Start difference. First operand 26 states and 57 transitions. Second operand 3 states. 72.80/34.77 [2019-03-28 12:50:19,784 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. 72.80/34.77 [2019-03-28 12:50:19,784 INFO L93 Difference]: Finished difference Result 26 states and 57 transitions. 72.80/34.77 [2019-03-28 12:50:19,784 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 72.80/34.77 [2019-03-28 12:50:19,784 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 8 72.80/34.77 [2019-03-28 12:50:19,785 INFO L84 Accepts]: Finished accepts. some prefix is accepted. 72.80/34.77 [2019-03-28 12:50:19,785 INFO L225 Difference]: With dead ends: 26 72.80/34.77 [2019-03-28 12:50:19,785 INFO L226 Difference]: Without dead ends: 25 72.80/34.77 [2019-03-28 12:50:19,786 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 72.80/34.77 [2019-03-28 12:50:19,786 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. 72.80/34.77 [2019-03-28 12:50:19,790 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 25. 72.80/34.77 [2019-03-28 12:50:19,790 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. 72.80/34.77 [2019-03-28 12:50:19,791 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 53 transitions. 72.80/34.77 [2019-03-28 12:50:19,791 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 53 transitions. Word has length 8 72.80/34.77 [2019-03-28 12:50:19,791 INFO L84 Accepts]: Finished accepts. word is rejected. 72.80/34.77 [2019-03-28 12:50:19,792 INFO L480 AbstractCegarLoop]: Abstraction has 25 states and 53 transitions. 72.80/34.77 [2019-03-28 12:50:19,792 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. 72.80/34.77 [2019-03-28 12:50:19,792 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 53 transitions. 72.80/34.78 [2019-03-28 12:50:19,792 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 72.80/34.78 [2019-03-28 12:50:19,792 INFO L394 BasicCegarLoop]: Found error trace 72.80/34.78 [2019-03-28 12:50:19,792 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] 72.80/34.78 [2019-03-28 12:50:19,793 INFO L423 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION]=== 72.80/34.78 [2019-03-28 12:50:19,793 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 72.80/34.78 [2019-03-28 12:50:19,793 INFO L82 PathProgramCache]: Analyzing trace with hash 1901167107, now seen corresponding path program 1 times 72.80/34.78 [2019-03-28 12:50:19,793 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 72.80/34.78 [2019-03-28 12:50:19,793 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 72.80/34.78 [2019-03-28 12:50:19,794 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 72.80/34.78 [2019-03-28 12:50:19,795 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 72.80/34.78 [2019-03-28 12:50:19,795 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 72.80/34.78 [2019-03-28 12:50:19,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 72.80/34.78 [2019-03-28 12:50:19,857 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 72.80/34.78 [2019-03-28 12:50:19,857 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. 72.80/34.78 [2019-03-28 12:50:19,857 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 72.80/34.78 [2019-03-28 12:50:19,858 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states 72.80/34.78 [2019-03-28 12:50:19,858 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. 72.80/34.78 [2019-03-28 12:50:19,858 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 72.80/34.78 [2019-03-28 12:50:19,858 INFO L87 Difference]: Start difference. First operand 25 states and 53 transitions. Second operand 5 states. 72.80/34.78 [2019-03-28 12:50:19,999 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. 72.80/34.78 [2019-03-28 12:50:20,000 INFO L93 Difference]: Finished difference Result 45 states and 92 transitions. 72.80/34.78 [2019-03-28 12:50:20,000 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. 72.80/34.78 [2019-03-28 12:50:20,000 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 8 72.80/34.78 [2019-03-28 12:50:20,001 INFO L84 Accepts]: Finished accepts. some prefix is accepted. 72.80/34.78 [2019-03-28 12:50:20,001 INFO L225 Difference]: With dead ends: 45 72.80/34.78 [2019-03-28 12:50:20,002 INFO L226 Difference]: Without dead ends: 44 72.80/34.78 [2019-03-28 12:50:20,002 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 72.80/34.78 [2019-03-28 12:50:20,002 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. 72.80/34.78 [2019-03-28 12:50:20,008 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 33. 72.80/34.78 [2019-03-28 12:50:20,009 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. 72.80/34.78 [2019-03-28 12:50:20,010 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 72 transitions. 72.80/34.78 [2019-03-28 12:50:20,010 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 72 transitions. Word has length 8 72.80/34.78 [2019-03-28 12:50:20,010 INFO L84 Accepts]: Finished accepts. word is rejected. 72.80/34.78 [2019-03-28 12:50:20,011 INFO L480 AbstractCegarLoop]: Abstraction has 33 states and 72 transitions. 72.80/34.78 [2019-03-28 12:50:20,011 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. 72.80/34.78 [2019-03-28 12:50:20,011 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 72 transitions. 72.80/34.78 [2019-03-28 12:50:20,011 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 72.80/34.78 [2019-03-28 12:50:20,011 INFO L394 BasicCegarLoop]: Found error trace 72.80/34.78 [2019-03-28 12:50:20,011 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] 72.80/34.78 [2019-03-28 12:50:20,012 INFO L423 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION]=== 72.80/34.78 [2019-03-28 12:50:20,012 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 72.80/34.78 [2019-03-28 12:50:20,012 INFO L82 PathProgramCache]: Analyzing trace with hash -1192505773, now seen corresponding path program 1 times 72.80/34.78 [2019-03-28 12:50:20,012 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 72.80/34.78 [2019-03-28 12:50:20,012 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 72.80/34.78 [2019-03-28 12:50:20,013 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 72.80/34.78 [2019-03-28 12:50:20,014 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 72.80/34.78 [2019-03-28 12:50:20,014 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 72.80/34.78 [2019-03-28 12:50:20,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 72.80/34.78 [2019-03-28 12:50:20,052 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 72.80/34.78 [2019-03-28 12:50:20,052 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. 72.80/34.78 [2019-03-28 12:50:20,053 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 72.80/34.78 [2019-03-28 12:50:20,053 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states 72.80/34.78 [2019-03-28 12:50:20,053 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. 72.80/34.78 [2019-03-28 12:50:20,053 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 72.80/34.78 [2019-03-28 12:50:20,054 INFO L87 Difference]: Start difference. First operand 33 states and 72 transitions. Second operand 3 states. 72.80/34.78 [2019-03-28 12:50:20,122 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. 72.80/34.78 [2019-03-28 12:50:20,123 INFO L93 Difference]: Finished difference Result 33 states and 72 transitions. 72.80/34.78 [2019-03-28 12:50:20,123 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 72.80/34.78 [2019-03-28 12:50:20,123 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 9 72.80/34.78 [2019-03-28 12:50:20,124 INFO L84 Accepts]: Finished accepts. some prefix is accepted. 72.80/34.78 [2019-03-28 12:50:20,125 INFO L225 Difference]: With dead ends: 33 72.80/34.78 [2019-03-28 12:50:20,125 INFO L226 Difference]: Without dead ends: 32 72.80/34.78 [2019-03-28 12:50:20,125 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 72.80/34.78 [2019-03-28 12:50:20,126 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. 72.80/34.78 [2019-03-28 12:50:20,131 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 32. 72.80/34.78 [2019-03-28 12:50:20,131 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. 72.80/34.78 [2019-03-28 12:50:20,132 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 70 transitions. 72.80/34.78 [2019-03-28 12:50:20,132 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 70 transitions. Word has length 9 72.80/34.78 [2019-03-28 12:50:20,132 INFO L84 Accepts]: Finished accepts. word is rejected. 72.80/34.78 [2019-03-28 12:50:20,132 INFO L480 AbstractCegarLoop]: Abstraction has 32 states and 70 transitions. 72.80/34.78 [2019-03-28 12:50:20,133 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. 72.80/34.78 [2019-03-28 12:50:20,133 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 70 transitions. 72.80/34.78 [2019-03-28 12:50:20,133 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 72.80/34.78 [2019-03-28 12:50:20,133 INFO L394 BasicCegarLoop]: Found error trace 72.80/34.78 [2019-03-28 12:50:20,133 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] 72.80/34.78 [2019-03-28 12:50:20,134 INFO L423 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION]=== 72.80/34.78 [2019-03-28 12:50:20,134 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 72.80/34.78 [2019-03-28 12:50:20,135 INFO L82 PathProgramCache]: Analyzing trace with hash -1192505771, now seen corresponding path program 1 times 72.80/34.78 [2019-03-28 12:50:20,135 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 72.80/34.78 [2019-03-28 12:50:20,135 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 72.80/34.78 [2019-03-28 12:50:20,136 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 72.80/34.78 [2019-03-28 12:50:20,136 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 72.80/34.78 [2019-03-28 12:50:20,136 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 72.80/34.78 [2019-03-28 12:50:20,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 72.80/34.78 [2019-03-28 12:50:20,181 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 72.80/34.78 [2019-03-28 12:50:20,182 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. 72.80/34.78 [2019-03-28 12:50:20,182 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 72.80/34.78 [2019-03-28 12:50:20,182 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states 72.80/34.78 [2019-03-28 12:50:20,183 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. 72.80/34.78 [2019-03-28 12:50:20,183 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 72.80/34.78 [2019-03-28 12:50:20,183 INFO L87 Difference]: Start difference. First operand 32 states and 70 transitions. Second operand 5 states. 72.80/34.78 [2019-03-28 12:50:20,317 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. 72.80/34.78 [2019-03-28 12:50:20,318 INFO L93 Difference]: Finished difference Result 61 states and 120 transitions. 72.80/34.78 [2019-03-28 12:50:20,318 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. 72.80/34.78 [2019-03-28 12:50:20,318 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 9 72.80/34.78 [2019-03-28 12:50:20,319 INFO L84 Accepts]: Finished accepts. some prefix is accepted. 72.80/34.78 [2019-03-28 12:50:20,319 INFO L225 Difference]: With dead ends: 61 72.80/34.78 [2019-03-28 12:50:20,320 INFO L226 Difference]: Without dead ends: 42 72.80/34.78 [2019-03-28 12:50:20,320 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 72.80/34.78 [2019-03-28 12:50:20,320 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. 72.80/34.78 [2019-03-28 12:50:20,326 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 32. 72.80/34.78 [2019-03-28 12:50:20,326 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. 72.80/34.78 [2019-03-28 12:50:20,326 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 68 transitions. 72.80/34.78 [2019-03-28 12:50:20,327 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 68 transitions. Word has length 9 72.80/34.78 [2019-03-28 12:50:20,327 INFO L84 Accepts]: Finished accepts. word is rejected. 72.80/34.78 [2019-03-28 12:50:20,327 INFO L480 AbstractCegarLoop]: Abstraction has 32 states and 68 transitions. 72.80/34.78 [2019-03-28 12:50:20,327 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. 72.80/34.78 [2019-03-28 12:50:20,327 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 68 transitions. 72.80/34.78 [2019-03-28 12:50:20,328 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 72.80/34.78 [2019-03-28 12:50:20,328 INFO L394 BasicCegarLoop]: Found error trace 72.80/34.78 [2019-03-28 12:50:20,328 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] 72.80/34.78 [2019-03-28 12:50:20,329 INFO L423 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION]=== 72.80/34.78 [2019-03-28 12:50:20,329 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 72.80/34.78 [2019-03-28 12:50:20,329 INFO L82 PathProgramCache]: Analyzing trace with hash -1192475980, now seen corresponding path program 1 times 72.80/34.78 [2019-03-28 12:50:20,329 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 72.80/34.78 [2019-03-28 12:50:20,329 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 72.80/34.78 [2019-03-28 12:50:20,330 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 72.80/34.78 [2019-03-28 12:50:20,330 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 72.80/34.78 [2019-03-28 12:50:20,330 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 72.80/34.78 [2019-03-28 12:50:20,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 72.80/34.78 [2019-03-28 12:50:20,353 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 72.80/34.78 [2019-03-28 12:50:20,353 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. 72.80/34.78 [2019-03-28 12:50:20,353 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 72.80/34.78 [2019-03-28 12:50:20,354 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states 72.80/34.78 [2019-03-28 12:50:20,354 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. 72.80/34.78 [2019-03-28 12:50:20,354 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 72.80/34.78 [2019-03-28 12:50:20,354 INFO L87 Difference]: Start difference. First operand 32 states and 68 transitions. Second operand 3 states. 72.80/34.78 [2019-03-28 12:50:20,427 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. 72.80/34.78 [2019-03-28 12:50:20,427 INFO L93 Difference]: Finished difference Result 59 states and 125 transitions. 72.80/34.78 [2019-03-28 12:50:20,428 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 72.80/34.78 [2019-03-28 12:50:20,428 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 9 72.80/34.78 [2019-03-28 12:50:20,428 INFO L84 Accepts]: Finished accepts. some prefix is accepted. 72.80/34.78 [2019-03-28 12:50:20,429 INFO L225 Difference]: With dead ends: 59 72.80/34.78 [2019-03-28 12:50:20,429 INFO L226 Difference]: Without dead ends: 40 72.80/34.78 [2019-03-28 12:50:20,429 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 72.80/34.78 [2019-03-28 12:50:20,430 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. 72.80/34.78 [2019-03-28 12:50:20,436 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 38. 72.80/34.78 [2019-03-28 12:50:20,436 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. 72.80/34.78 [2019-03-28 12:50:20,436 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 76 transitions. 72.80/34.78 [2019-03-28 12:50:20,437 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 76 transitions. Word has length 9 72.80/34.78 [2019-03-28 12:50:20,437 INFO L84 Accepts]: Finished accepts. word is rejected. 72.80/34.78 [2019-03-28 12:50:20,437 INFO L480 AbstractCegarLoop]: Abstraction has 38 states and 76 transitions. 72.80/34.78 [2019-03-28 12:50:20,437 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. 72.80/34.78 [2019-03-28 12:50:20,437 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 76 transitions. 72.80/34.78 [2019-03-28 12:50:20,438 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 72.80/34.78 [2019-03-28 12:50:20,438 INFO L394 BasicCegarLoop]: Found error trace 72.80/34.78 [2019-03-28 12:50:20,438 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1] 72.80/34.78 [2019-03-28 12:50:20,438 INFO L423 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION]=== 72.80/34.78 [2019-03-28 12:50:20,438 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 72.80/34.78 [2019-03-28 12:50:20,438 INFO L82 PathProgramCache]: Analyzing trace with hash -2048783441, now seen corresponding path program 1 times 72.80/34.78 [2019-03-28 12:50:20,439 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 72.80/34.78 [2019-03-28 12:50:20,439 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 72.80/34.78 [2019-03-28 12:50:20,440 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 72.80/34.78 [2019-03-28 12:50:20,440 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 72.80/34.78 [2019-03-28 12:50:20,440 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 72.80/34.78 [2019-03-28 12:50:20,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 72.80/34.78 [2019-03-28 12:50:20,497 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 72.80/34.78 [2019-03-28 12:50:20,497 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. 72.80/34.78 [2019-03-28 12:50:20,497 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP 72.80/34.78 No working directory specified, using /export/starexec/sandbox/solver/bin/z3 72.80/34.78 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) 72.80/34.78 Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 72.80/34.78 [2019-03-28 12:50:20,509 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 72.80/34.78 [2019-03-28 12:50:20,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 72.80/34.78 [2019-03-28 12:50:20,539 INFO L256 TraceCheckSpWp]: Trace formula consists of 116 conjuncts, 7 conjunts are in the unsatisfiable core 72.80/34.78 [2019-03-28 12:50:20,545 INFO L279 TraceCheckSpWp]: Computing forward predicates... 72.80/34.78 [2019-03-28 12:50:20,591 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 72.80/34.78 [2019-03-28 12:50:20,618 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. 72.80/34.78 [2019-03-28 12:50:20,618 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [6] total 9 72.80/34.78 [2019-03-28 12:50:20,619 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states 72.80/34.78 [2019-03-28 12:50:20,619 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. 72.80/34.78 [2019-03-28 12:50:20,619 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 72.80/34.78 [2019-03-28 12:50:20,620 INFO L87 Difference]: Start difference. First operand 38 states and 76 transitions. Second operand 9 states. 72.80/34.78 [2019-03-28 12:50:20,892 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. 72.80/34.78 [2019-03-28 12:50:20,892 INFO L93 Difference]: Finished difference Result 99 states and 185 transitions. 72.80/34.78 [2019-03-28 12:50:20,893 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 72.80/34.78 [2019-03-28 12:50:20,893 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 12 72.80/34.78 [2019-03-28 12:50:20,893 INFO L84 Accepts]: Finished accepts. some prefix is accepted. 72.80/34.78 [2019-03-28 12:50:20,894 INFO L225 Difference]: With dead ends: 99 72.80/34.78 [2019-03-28 12:50:20,894 INFO L226 Difference]: Without dead ends: 71 72.80/34.78 [2019-03-28 12:50:20,895 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 9 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=44, Invalid=88, Unknown=0, NotChecked=0, Total=132 72.80/34.78 [2019-03-28 12:50:20,895 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. 72.80/34.78 [2019-03-28 12:50:20,904 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 61. 72.80/34.78 [2019-03-28 12:50:20,905 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61 states. 72.80/34.78 [2019-03-28 12:50:20,905 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 122 transitions. 72.80/34.78 [2019-03-28 12:50:20,906 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 122 transitions. Word has length 12 72.80/34.78 [2019-03-28 12:50:20,906 INFO L84 Accepts]: Finished accepts. word is rejected. 72.80/34.78 [2019-03-28 12:50:20,906 INFO L480 AbstractCegarLoop]: Abstraction has 61 states and 122 transitions. 72.80/34.78 [2019-03-28 12:50:20,906 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. 72.80/34.78 [2019-03-28 12:50:20,906 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 122 transitions. 72.80/34.78 [2019-03-28 12:50:20,907 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 72.80/34.78 [2019-03-28 12:50:20,907 INFO L394 BasicCegarLoop]: Found error trace 72.80/34.78 [2019-03-28 12:50:20,907 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1] 72.80/34.78 [2019-03-28 12:50:20,907 INFO L423 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION]=== 72.80/34.78 [2019-03-28 12:50:20,908 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 72.80/34.78 [2019-03-28 12:50:20,908 INFO L82 PathProgramCache]: Analyzing trace with hash 56205486, now seen corresponding path program 1 times 72.80/34.78 [2019-03-28 12:50:20,908 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 72.80/34.78 [2019-03-28 12:50:20,909 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 72.80/34.78 [2019-03-28 12:50:20,909 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 72.80/34.78 [2019-03-28 12:50:20,910 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 72.80/34.78 [2019-03-28 12:50:20,910 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 72.80/34.78 [2019-03-28 12:50:20,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 72.80/34.78 [2019-03-28 12:50:20,958 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. 72.80/34.78 [2019-03-28 12:50:20,958 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. 72.80/34.78 [2019-03-28 12:50:20,958 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP 72.80/34.78 No working directory specified, using /export/starexec/sandbox/solver/bin/z3 72.80/34.78 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) 72.80/34.78 Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 72.80/34.78 [2019-03-28 12:50:20,969 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 72.80/34.78 [2019-03-28 12:50:20,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 72.80/34.78 [2019-03-28 12:50:20,995 INFO L256 TraceCheckSpWp]: Trace formula consists of 114 conjuncts, 18 conjunts are in the unsatisfiable core 72.80/34.78 [2019-03-28 12:50:20,997 INFO L279 TraceCheckSpWp]: Computing forward predicates... 72.80/34.78 [2019-03-28 12:50:21,033 INFO L189 IndexEqualityManager]: detected not equals via solver 72.80/34.78 [2019-03-28 12:50:21,083 INFO L340 Elim1Store]: treesize reduction 3, result has 92.9 percent of original size 72.80/34.78 [2019-03-28 12:50:21,084 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 18 treesize of output 53 72.80/34.78 [2019-03-28 12:50:21,085 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 72.80/34.78 [2019-03-28 12:50:21,122 INFO L497 ElimStorePlain]: treesize reduction 27, result has 58.5 percent of original size 72.80/34.78 [2019-03-28 12:50:21,127 INFO L427 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. 72.80/34.78 [2019-03-28 12:50:21,128 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:31, output treesize:38 72.80/34.78 [2019-03-28 12:50:21,327 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. 72.80/34.78 [2019-03-28 12:50:21,354 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. 72.80/34.78 [2019-03-28 12:50:21,354 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3] total 5 72.80/34.78 [2019-03-28 12:50:21,355 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states 72.80/34.78 [2019-03-28 12:50:21,355 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. 72.80/34.78 [2019-03-28 12:50:21,355 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 72.80/34.78 [2019-03-28 12:50:21,356 INFO L87 Difference]: Start difference. First operand 61 states and 122 transitions. Second operand 6 states. 72.80/34.78 [2019-03-28 12:50:21,736 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. 72.80/34.78 [2019-03-28 12:50:21,736 INFO L93 Difference]: Finished difference Result 142 states and 255 transitions. 72.80/34.78 [2019-03-28 12:50:21,737 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 72.80/34.78 [2019-03-28 12:50:21,737 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 12 72.80/34.78 [2019-03-28 12:50:21,737 INFO L84 Accepts]: Finished accepts. some prefix is accepted. 72.80/34.78 [2019-03-28 12:50:21,738 INFO L225 Difference]: With dead ends: 142 72.80/34.78 [2019-03-28 12:50:21,739 INFO L226 Difference]: Without dead ends: 141 72.80/34.78 [2019-03-28 12:50:21,739 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 5 SyntacticMatches, 5 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 72.80/34.78 [2019-03-28 12:50:21,739 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 141 states. 72.80/34.78 [2019-03-28 12:50:21,753 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 141 to 61. 72.80/34.78 [2019-03-28 12:50:21,753 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61 states. 72.80/34.78 [2019-03-28 12:50:21,754 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 120 transitions. 72.80/34.78 [2019-03-28 12:50:21,754 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 120 transitions. Word has length 12 72.80/34.78 [2019-03-28 12:50:21,755 INFO L84 Accepts]: Finished accepts. word is rejected. 72.80/34.78 [2019-03-28 12:50:21,755 INFO L480 AbstractCegarLoop]: Abstraction has 61 states and 120 transitions. 72.80/34.78 [2019-03-28 12:50:21,755 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. 72.80/34.78 [2019-03-28 12:50:21,755 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 120 transitions. 72.80/34.78 [2019-03-28 12:50:21,755 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 72.80/34.78 [2019-03-28 12:50:21,756 INFO L394 BasicCegarLoop]: Found error trace 72.80/34.78 [2019-03-28 12:50:21,756 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1] 72.80/34.78 [2019-03-28 12:50:21,756 INFO L423 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION]=== 72.80/34.78 [2019-03-28 12:50:21,756 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 72.80/34.78 [2019-03-28 12:50:21,756 INFO L82 PathProgramCache]: Analyzing trace with hash 56205487, now seen corresponding path program 1 times 72.80/34.78 [2019-03-28 12:50:21,757 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 72.80/34.78 [2019-03-28 12:50:21,757 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 72.80/34.78 [2019-03-28 12:50:21,758 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 72.80/34.78 [2019-03-28 12:50:21,758 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 72.80/34.78 [2019-03-28 12:50:21,758 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 72.80/34.78 [2019-03-28 12:50:21,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 72.80/34.78 [2019-03-28 12:50:21,790 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 72.80/34.78 [2019-03-28 12:50:21,791 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. 72.80/34.78 [2019-03-28 12:50:21,791 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 72.80/34.78 [2019-03-28 12:50:21,791 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states 72.80/34.78 [2019-03-28 12:50:21,791 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. 72.80/34.78 [2019-03-28 12:50:21,792 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 72.80/34.78 [2019-03-28 12:50:21,792 INFO L87 Difference]: Start difference. First operand 61 states and 120 transitions. Second operand 4 states. 72.80/34.78 [2019-03-28 12:50:21,893 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. 72.80/34.78 [2019-03-28 12:50:21,893 INFO L93 Difference]: Finished difference Result 85 states and 152 transitions. 72.80/34.78 [2019-03-28 12:50:21,894 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 72.80/34.78 [2019-03-28 12:50:21,894 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 12 72.80/34.78 [2019-03-28 12:50:21,894 INFO L84 Accepts]: Finished accepts. some prefix is accepted. 72.80/34.78 [2019-03-28 12:50:21,895 INFO L225 Difference]: With dead ends: 85 72.80/34.78 [2019-03-28 12:50:21,895 INFO L226 Difference]: Without dead ends: 84 72.80/34.78 [2019-03-28 12:50:21,895 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 72.80/34.78 [2019-03-28 12:50:21,896 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. 72.80/34.78 [2019-03-28 12:50:21,907 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 60. 72.80/34.78 [2019-03-28 12:50:21,907 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60 states. 72.80/34.78 [2019-03-28 12:50:21,908 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 118 transitions. 72.80/34.78 [2019-03-28 12:50:21,908 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 118 transitions. Word has length 12 72.80/34.78 [2019-03-28 12:50:21,908 INFO L84 Accepts]: Finished accepts. word is rejected. 72.80/34.78 [2019-03-28 12:50:21,908 INFO L480 AbstractCegarLoop]: Abstraction has 60 states and 118 transitions. 72.80/34.78 [2019-03-28 12:50:21,908 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. 72.80/34.78 [2019-03-28 12:50:21,909 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 118 transitions. 72.80/34.78 [2019-03-28 12:50:21,909 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 72.80/34.78 [2019-03-28 12:50:21,909 INFO L394 BasicCegarLoop]: Found error trace 72.80/34.78 [2019-03-28 12:50:21,909 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] 72.80/34.78 [2019-03-28 12:50:21,910 INFO L423 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION]=== 72.80/34.78 [2019-03-28 12:50:21,910 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 72.80/34.78 [2019-03-28 12:50:21,910 INFO L82 PathProgramCache]: Analyzing trace with hash 850309188, now seen corresponding path program 1 times 72.80/34.78 [2019-03-28 12:50:21,910 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 72.80/34.78 [2019-03-28 12:50:21,910 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 72.80/34.78 [2019-03-28 12:50:21,911 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 72.80/34.78 [2019-03-28 12:50:21,911 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 72.80/34.78 [2019-03-28 12:50:21,911 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 72.80/34.78 [2019-03-28 12:50:21,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 72.80/34.78 [2019-03-28 12:50:21,932 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 72.80/34.78 [2019-03-28 12:50:21,932 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. 72.80/34.78 [2019-03-28 12:50:21,933 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 72.80/34.78 [2019-03-28 12:50:21,933 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states 72.80/34.78 [2019-03-28 12:50:21,933 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. 72.80/34.78 [2019-03-28 12:50:21,933 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 72.80/34.78 [2019-03-28 12:50:21,934 INFO L87 Difference]: Start difference. First operand 60 states and 118 transitions. Second operand 3 states. 72.80/34.78 [2019-03-28 12:50:22,004 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. 72.80/34.78 [2019-03-28 12:50:22,005 INFO L93 Difference]: Finished difference Result 115 states and 215 transitions. 72.80/34.78 [2019-03-28 12:50:22,005 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 72.80/34.78 [2019-03-28 12:50:22,005 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 13 72.80/34.78 [2019-03-28 12:50:22,005 INFO L84 Accepts]: Finished accepts. some prefix is accepted. 72.80/34.78 [2019-03-28 12:50:22,006 INFO L225 Difference]: With dead ends: 115 72.80/34.78 [2019-03-28 12:50:22,006 INFO L226 Difference]: Without dead ends: 64 72.80/34.78 [2019-03-28 12:50:22,007 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 72.80/34.78 [2019-03-28 12:50:22,007 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. 72.80/34.78 [2019-03-28 12:50:22,017 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 55. 72.80/34.78 [2019-03-28 12:50:22,017 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55 states. 72.80/34.78 [2019-03-28 12:50:22,017 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 92 transitions. 72.80/34.78 [2019-03-28 12:50:22,018 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 92 transitions. Word has length 13 72.80/34.78 [2019-03-28 12:50:22,018 INFO L84 Accepts]: Finished accepts. word is rejected. 72.80/34.78 [2019-03-28 12:50:22,018 INFO L480 AbstractCegarLoop]: Abstraction has 55 states and 92 transitions. 72.80/34.78 [2019-03-28 12:50:22,018 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. 72.80/34.78 [2019-03-28 12:50:22,018 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 92 transitions. 72.80/34.78 [2019-03-28 12:50:22,019 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 72.80/34.78 [2019-03-28 12:50:22,019 INFO L394 BasicCegarLoop]: Found error trace 72.80/34.78 [2019-03-28 12:50:22,019 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] 72.80/34.78 [2019-03-28 12:50:22,019 INFO L423 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION]=== 72.80/34.78 [2019-03-28 12:50:22,020 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 72.80/34.78 [2019-03-28 12:50:22,020 INFO L82 PathProgramCache]: Analyzing trace with hash 913078825, now seen corresponding path program 1 times 72.80/34.78 [2019-03-28 12:50:22,020 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 72.80/34.78 [2019-03-28 12:50:22,020 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 72.80/34.78 [2019-03-28 12:50:22,021 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 72.80/34.78 [2019-03-28 12:50:22,021 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 72.80/34.78 [2019-03-28 12:50:22,021 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 72.80/34.78 [2019-03-28 12:50:22,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 72.80/34.78 [2019-03-28 12:50:22,072 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. 72.80/34.78 [2019-03-28 12:50:22,072 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. 72.80/34.78 [2019-03-28 12:50:22,073 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 72.80/34.78 [2019-03-28 12:50:22,073 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states 72.80/34.78 [2019-03-28 12:50:22,073 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. 72.80/34.78 [2019-03-28 12:50:22,073 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 72.80/34.78 [2019-03-28 12:50:22,074 INFO L87 Difference]: Start difference. First operand 55 states and 92 transitions. Second operand 4 states. 72.80/34.78 [2019-03-28 12:50:22,170 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. 72.80/34.78 [2019-03-28 12:50:22,170 INFO L93 Difference]: Finished difference Result 86 states and 137 transitions. 72.80/34.78 [2019-03-28 12:50:22,170 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 72.80/34.78 [2019-03-28 12:50:22,171 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 13 72.80/34.78 [2019-03-28 12:50:22,171 INFO L84 Accepts]: Finished accepts. some prefix is accepted. 72.80/34.78 [2019-03-28 12:50:22,172 INFO L225 Difference]: With dead ends: 86 72.80/34.78 [2019-03-28 12:50:22,172 INFO L226 Difference]: Without dead ends: 85 72.80/34.78 [2019-03-28 12:50:22,172 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 72.80/34.78 [2019-03-28 12:50:22,172 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. 72.80/34.78 [2019-03-28 12:50:22,186 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 83. 72.80/34.78 [2019-03-28 12:50:22,186 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 83 states. 72.80/34.78 [2019-03-28 12:50:22,187 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 133 transitions. 72.80/34.78 [2019-03-28 12:50:22,187 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 133 transitions. Word has length 13 72.80/34.78 [2019-03-28 12:50:22,187 INFO L84 Accepts]: Finished accepts. word is rejected. 72.80/34.78 [2019-03-28 12:50:22,188 INFO L480 AbstractCegarLoop]: Abstraction has 83 states and 133 transitions. 72.80/34.78 [2019-03-28 12:50:22,188 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. 72.80/34.78 [2019-03-28 12:50:22,188 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 133 transitions. 72.80/34.78 [2019-03-28 12:50:22,188 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 72.80/34.78 [2019-03-28 12:50:22,188 INFO L394 BasicCegarLoop]: Found error trace 72.80/34.78 [2019-03-28 12:50:22,189 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] 72.80/34.78 [2019-03-28 12:50:22,189 INFO L423 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION]=== 72.80/34.78 [2019-03-28 12:50:22,189 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 72.80/34.78 [2019-03-28 12:50:22,189 INFO L82 PathProgramCache]: Analyzing trace with hash 1093284000, now seen corresponding path program 1 times 72.80/34.78 [2019-03-28 12:50:22,189 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 72.80/34.78 [2019-03-28 12:50:22,189 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 72.80/34.78 [2019-03-28 12:50:22,190 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 72.80/34.78 [2019-03-28 12:50:22,191 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 72.80/34.78 [2019-03-28 12:50:22,191 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 72.80/34.78 [2019-03-28 12:50:22,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 72.80/34.78 [2019-03-28 12:50:22,220 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 72.80/34.78 [2019-03-28 12:50:22,221 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. 72.80/34.78 [2019-03-28 12:50:22,221 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 72.80/34.78 [2019-03-28 12:50:22,221 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states 72.80/34.78 [2019-03-28 12:50:22,221 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. 72.80/34.78 [2019-03-28 12:50:22,221 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 72.80/34.78 [2019-03-28 12:50:22,222 INFO L87 Difference]: Start difference. First operand 83 states and 133 transitions. Second operand 4 states. 72.80/34.78 [2019-03-28 12:50:22,323 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. 72.80/34.78 [2019-03-28 12:50:22,324 INFO L93 Difference]: Finished difference Result 94 states and 145 transitions. 72.80/34.78 [2019-03-28 12:50:22,324 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 72.80/34.78 [2019-03-28 12:50:22,324 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 15 72.80/34.78 [2019-03-28 12:50:22,325 INFO L84 Accepts]: Finished accepts. some prefix is accepted. 72.80/34.78 [2019-03-28 12:50:22,325 INFO L225 Difference]: With dead ends: 94 72.80/34.78 [2019-03-28 12:50:22,325 INFO L226 Difference]: Without dead ends: 92 72.80/34.78 [2019-03-28 12:50:22,326 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 72.80/34.78 [2019-03-28 12:50:22,326 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. 72.80/34.78 [2019-03-28 12:50:22,337 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 62. 72.80/34.78 [2019-03-28 12:50:22,338 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 62 states. 72.80/34.78 [2019-03-28 12:50:22,338 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 97 transitions. 72.80/34.78 [2019-03-28 12:50:22,338 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 97 transitions. Word has length 15 72.80/34.78 [2019-03-28 12:50:22,339 INFO L84 Accepts]: Finished accepts. word is rejected. 72.80/34.78 [2019-03-28 12:50:22,339 INFO L480 AbstractCegarLoop]: Abstraction has 62 states and 97 transitions. 72.80/34.78 [2019-03-28 12:50:22,339 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. 72.80/34.78 [2019-03-28 12:50:22,339 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 97 transitions. 72.80/34.78 [2019-03-28 12:50:22,340 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 72.80/34.78 [2019-03-28 12:50:22,340 INFO L394 BasicCegarLoop]: Found error trace 72.80/34.78 [2019-03-28 12:50:22,340 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] 72.80/34.78 [2019-03-28 12:50:22,340 INFO L423 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION]=== 72.80/34.78 [2019-03-28 12:50:22,341 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 72.80/34.78 [2019-03-28 12:50:22,341 INFO L82 PathProgramCache]: Analyzing trace with hash 1053080210, now seen corresponding path program 1 times 72.80/34.78 [2019-03-28 12:50:22,341 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 72.80/34.78 [2019-03-28 12:50:22,341 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 72.80/34.78 [2019-03-28 12:50:22,342 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 72.80/34.78 [2019-03-28 12:50:22,342 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 72.80/34.78 [2019-03-28 12:50:22,342 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 72.80/34.78 [2019-03-28 12:50:22,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 72.80/34.78 [2019-03-28 12:50:22,470 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. 72.80/34.78 [2019-03-28 12:50:22,470 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. 72.80/34.78 [2019-03-28 12:50:22,470 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP 72.80/34.78 No working directory specified, using /export/starexec/sandbox/solver/bin/z3 72.80/34.78 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) 72.80/34.78 Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 72.80/34.78 [2019-03-28 12:50:22,486 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 72.80/34.78 [2019-03-28 12:50:22,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 72.80/34.78 [2019-03-28 12:50:22,520 INFO L256 TraceCheckSpWp]: Trace formula consists of 157 conjuncts, 20 conjunts are in the unsatisfiable core 72.80/34.78 [2019-03-28 12:50:22,522 INFO L279 TraceCheckSpWp]: Computing forward predicates... 72.80/34.78 [2019-03-28 12:50:22,575 INFO L340 Elim1Store]: treesize reduction 30, result has 53.8 percent of original size 72.80/34.78 [2019-03-28 12:50:22,575 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 18 treesize of output 42 72.80/34.78 [2019-03-28 12:50:22,576 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 72.80/34.78 [2019-03-28 12:50:22,613 INFO L497 ElimStorePlain]: treesize reduction 12, result has 77.8 percent of original size 72.80/34.78 [2019-03-28 12:50:22,617 INFO L427 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. 72.80/34.78 [2019-03-28 12:50:22,617 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:31, output treesize:40 72.80/34.78 [2019-03-28 12:50:22,755 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. 72.80/34.78 [2019-03-28 12:50:22,783 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. 72.80/34.78 [2019-03-28 12:50:22,783 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 5] total 11 72.80/34.78 [2019-03-28 12:50:22,784 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states 72.80/34.78 [2019-03-28 12:50:22,784 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. 72.80/34.78 [2019-03-28 12:50:22,784 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 72.80/34.78 [2019-03-28 12:50:22,785 INFO L87 Difference]: Start difference. First operand 62 states and 97 transitions. Second operand 12 states. 72.80/34.78 [2019-03-28 12:50:23,485 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. 72.80/34.78 [2019-03-28 12:50:23,486 INFO L93 Difference]: Finished difference Result 130 states and 183 transitions. 72.80/34.78 [2019-03-28 12:50:23,486 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. 72.80/34.78 [2019-03-28 12:50:23,486 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 23 72.80/34.78 [2019-03-28 12:50:23,487 INFO L84 Accepts]: Finished accepts. some prefix is accepted. 72.80/34.78 [2019-03-28 12:50:23,488 INFO L225 Difference]: With dead ends: 130 72.80/34.78 [2019-03-28 12:50:23,488 INFO L226 Difference]: Without dead ends: 129 72.80/34.78 [2019-03-28 12:50:23,488 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 57 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=128, Invalid=292, Unknown=0, NotChecked=0, Total=420 72.80/34.78 [2019-03-28 12:50:23,489 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 129 states. 72.80/34.78 [2019-03-28 12:50:23,502 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 129 to 62. 72.80/34.78 [2019-03-28 12:50:23,502 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 62 states. 72.80/34.78 [2019-03-28 12:50:23,502 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 95 transitions. 72.80/34.78 [2019-03-28 12:50:23,503 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 95 transitions. Word has length 23 72.80/34.78 [2019-03-28 12:50:23,503 INFO L84 Accepts]: Finished accepts. word is rejected. 72.80/34.78 [2019-03-28 12:50:23,503 INFO L480 AbstractCegarLoop]: Abstraction has 62 states and 95 transitions. 72.80/34.78 [2019-03-28 12:50:23,503 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. 72.80/34.78 [2019-03-28 12:50:23,503 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 95 transitions. 72.80/34.78 [2019-03-28 12:50:23,504 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 72.80/34.78 [2019-03-28 12:50:23,504 INFO L394 BasicCegarLoop]: Found error trace 72.80/34.78 [2019-03-28 12:50:23,504 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] 72.80/34.78 [2019-03-28 12:50:23,504 INFO L423 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION]=== 72.80/34.78 [2019-03-28 12:50:23,505 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 72.80/34.78 [2019-03-28 12:50:23,505 INFO L82 PathProgramCache]: Analyzing trace with hash 1053080211, now seen corresponding path program 1 times 72.80/34.78 [2019-03-28 12:50:23,505 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 72.80/34.78 [2019-03-28 12:50:23,505 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 72.80/34.78 [2019-03-28 12:50:23,506 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 72.80/34.78 [2019-03-28 12:50:23,506 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 72.80/34.78 [2019-03-28 12:50:23,506 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 72.80/34.78 [2019-03-28 12:50:23,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 72.80/34.78 [2019-03-28 12:50:23,534 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. 72.80/34.78 [2019-03-28 12:50:23,534 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. 72.80/34.78 [2019-03-28 12:50:23,535 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 72.80/34.78 [2019-03-28 12:50:23,535 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states 72.80/34.78 [2019-03-28 12:50:23,535 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. 72.80/34.78 [2019-03-28 12:50:23,535 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 72.80/34.78 [2019-03-28 12:50:23,536 INFO L87 Difference]: Start difference. First operand 62 states and 95 transitions. Second operand 3 states. 72.80/34.78 [2019-03-28 12:50:23,603 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. 72.80/34.78 [2019-03-28 12:50:23,603 INFO L93 Difference]: Finished difference Result 62 states and 95 transitions. 72.80/34.78 [2019-03-28 12:50:23,604 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 72.80/34.78 [2019-03-28 12:50:23,604 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 23 72.80/34.78 [2019-03-28 12:50:23,604 INFO L84 Accepts]: Finished accepts. some prefix is accepted. 72.80/34.78 [2019-03-28 12:50:23,604 INFO L225 Difference]: With dead ends: 62 72.80/34.78 [2019-03-28 12:50:23,604 INFO L226 Difference]: Without dead ends: 0 72.80/34.78 [2019-03-28 12:50:23,605 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 72.80/34.78 [2019-03-28 12:50:23,605 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. 72.80/34.78 [2019-03-28 12:50:23,605 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. 72.80/34.78 [2019-03-28 12:50:23,606 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. 72.80/34.78 [2019-03-28 12:50:23,606 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. 72.80/34.78 [2019-03-28 12:50:23,606 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 23 72.80/34.78 [2019-03-28 12:50:23,606 INFO L84 Accepts]: Finished accepts. word is rejected. 72.80/34.78 [2019-03-28 12:50:23,606 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. 72.80/34.78 [2019-03-28 12:50:23,606 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. 72.80/34.78 [2019-03-28 12:50:23,606 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. 72.80/34.78 [2019-03-28 12:50:23,607 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. 72.80/34.78 [2019-03-28 12:50:23,611 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. 72.80/34.78 [2019-03-28 12:50:23,773 WARN L188 SmtUtils]: Spent 157.00 ms on a formula simplification. DAG size of input: 168 DAG size of output: 162 72.80/34.78 [2019-03-28 12:50:23,798 WARN L250 erpolLogProxyWrapper]: Already inconsistent. 72.80/34.78 [2019-03-28 12:50:23,820 WARN L250 erpolLogProxyWrapper]: Already inconsistent. 72.80/34.78 [2019-03-28 12:50:23,837 WARN L250 erpolLogProxyWrapper]: Already inconsistent. 72.80/34.78 [2019-03-28 12:50:24,041 WARN L188 SmtUtils]: Spent 265.00 ms on a formula simplification. DAG size of input: 223 DAG size of output: 208 72.80/34.78 [2019-03-28 12:50:24,787 WARN L188 SmtUtils]: Spent 744.00 ms on a formula simplification. DAG size of input: 161 DAG size of output: 72 72.80/34.78 [2019-03-28 12:50:28,309 WARN L188 SmtUtils]: Spent 3.52 s on a formula simplification. DAG size of input: 205 DAG size of output: 94 72.80/34.78 [2019-03-28 12:50:28,312 INFO L448 ceAbstractionStarter]: For program point L23-1(lines 23 26) no Hoare annotation was computed. 72.80/34.78 [2019-03-28 12:50:28,312 INFO L448 ceAbstractionStarter]: For program point L17(line 17) no Hoare annotation was computed. 72.80/34.78 [2019-03-28 12:50:28,312 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr7REQUIRES_VIOLATION(line 24) no Hoare annotation was computed. 72.80/34.78 [2019-03-28 12:50:28,312 INFO L448 ceAbstractionStarter]: For program point L17-1(line 17) no Hoare annotation was computed. 72.80/34.78 [2019-03-28 12:50:28,313 INFO L448 ceAbstractionStarter]: For program point L17-2(lines 17 21) no Hoare annotation was computed. 72.80/34.78 [2019-03-28 12:50:28,313 INFO L444 ceAbstractionStarter]: At program point L17-4(lines 16 22) the Hoare annotation is: (let ((.cse34 (select |#length| ULTIMATE.start_diff_~B.base)) (.cse30 (* 4 ULTIMATE.start_diff_~l1~0)) (.cse35 (select |#length| ULTIMATE.start_diff_~A.base)) (.cse31 (* 4 ULTIMATE.start_diff_~i~0))) (let ((.cse27 (* 4 ULTIMATE.start_diff_~k~0)) (.cse21 (= 0 ULTIMATE.start_diff_~j~0)) (.cse7 (= 0 ULTIMATE.start_diff_~A.offset)) (.cse29 (+ .cse31 ULTIMATE.start_diff_~A.offset)) (.cse28 (select |#length| ULTIMATE.start_diff_~D.base)) (.cse17 (= 0 ULTIMATE.start_diff_~found~0)) (.cse16 (<= .cse30 .cse35)) (.cse19 (<= (+ .cse31 4) .cse35)) (.cse20 (= (select |#valid| ULTIMATE.start_diff_~A.base) 1)) (.cse22 (<= (* 4 ULTIMATE.start_diff_~l2~0) .cse34)) (.cse18 (<= 1 ULTIMATE.start_main_~Blen~0)) (.cse23 (= 1 (select |#valid| ULTIMATE.start_diff_~D.base))) (.cse24 (= 0 ULTIMATE.start_diff_~B.offset)) (.cse33 (* 4 ULTIMATE.start_diff_~j~0)) (.cse25 (= 1 (select |#valid| ULTIMATE.start_diff_~B.base))) (.cse26 (<= 1 ULTIMATE.start_diff_~l2~0))) (let ((.cse2 (and .cse16 .cse19 .cse20 .cse22 .cse18 .cse23 .cse24 (<= (+ .cse33 4) .cse34) .cse25 .cse26)) (.cse14 (and .cse16 .cse19 .cse20 .cse17 .cse22 .cse18 .cse23 .cse24 .cse25 .cse26)) (.cse5 (<= 4 (+ .cse33 ULTIMATE.start_diff_~B.offset))) (.cse0 (<= 4 .cse28)) (.cse4 (<= 0 .cse29)) (.cse8 (= 0 ULTIMATE.start_diff_~k~0)) (.cse9 (exists ((v_prenex_1 Int) (|ULTIMATE.start_main_#t~malloc8.base| Int)) (let ((.cse32 (* 4 v_prenex_1))) (and (<= ULTIMATE.start_diff_~l1~0 v_prenex_1) (= .cse32 (select |#length| |ULTIMATE.start_main_#t~malloc8.base|)) (= .cse32 (select |#length| ULTIMATE.start_diff_~D.base)))))) (.cse15 (and .cse16 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23 .cse24 .cse25 .cse7 .cse26)) (.cse1 (= 1 ULTIMATE.start_diff_~found~0)) (.cse10 (<= (+ .cse27 .cse30) (+ .cse31 ULTIMATE.start_diff_~A.offset .cse28))) (.cse11 (<= 4 .cse29)) (.cse3 (<= 1 ULTIMATE.start_main_~Alen~0)) (.cse6 (= 0 ULTIMATE.start_diff_~D.offset)) (.cse12 (<= (+ .cse27 4) (+ ULTIMATE.start_diff_~A.offset .cse28))) (.cse13 (<= 4 (+ .cse27 ULTIMATE.start_diff_~D.offset)))) (or (and (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5) .cse6 .cse7 .cse8 .cse9) (and (and .cse1 .cse10 .cse2 .cse11 .cse3 .cse6 .cse12 .cse7 .cse5) .cse13) (and (and .cse10 .cse11 .cse14 .cse3 .cse6 .cse12 .cse7 .cse5) .cse13) (and .cse6 .cse7 (and .cse0 .cse14 .cse3 .cse4 .cse5) .cse8 .cse9) (and (and .cse15 .cse0 .cse1 .cse3 .cse4 .cse6 .cse8) .cse9) (and .cse6 .cse7 (and .cse0 (and .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23 .cse24 .cse25 .cse26) .cse3 .cse4) .cse8 .cse9) (and (and .cse15 .cse1 .cse10 .cse11 .cse3 .cse6 .cse12) .cse13) (and (and .cse10 .cse11 .cse3 .cse6 (and .cse16 .cse19 .cse20 .cse21 .cse17 .cse22 .cse18 .cse23 .cse24 .cse25 .cse26) .cse12 .cse7) .cse13))))) 72.80/34.78 [2019-03-28 12:50:28,313 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr3REQUIRES_VIOLATION(line 17) no Hoare annotation was computed. 72.80/34.78 [2019-03-28 12:50:28,314 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr4REQUIRES_VIOLATION(line 24) no Hoare annotation was computed. 72.80/34.78 [2019-03-28 12:50:28,314 INFO L444 ceAbstractionStarter]: At program point L13-2(lines 13 28) the Hoare annotation is: (let ((.cse1 (* 4 ULTIMATE.start_diff_~l1~0))) (let ((.cse11 (<= (* 4 ULTIMATE.start_diff_~l2~0) (select |#length| ULTIMATE.start_diff_~B.base))) (.cse9 (<= .cse1 (select |#length| ULTIMATE.start_diff_~A.base))) (.cse10 (= (select |#valid| ULTIMATE.start_diff_~A.base) 1)) (.cse12 (<= 1 ULTIMATE.start_main_~Blen~0)) (.cse13 (= 1 (select |#valid| ULTIMATE.start_diff_~D.base))) (.cse14 (= 0 ULTIMATE.start_diff_~B.offset)) (.cse15 (= 1 (select |#valid| ULTIMATE.start_diff_~B.base))) (.cse16 (<= 1 ULTIMATE.start_diff_~l2~0)) (.cse2 (* 4 ULTIMATE.start_diff_~i~0))) (let ((.cse7 (= 0 ULTIMATE.start_diff_~D.offset)) (.cse8 (= 0 ULTIMATE.start_diff_~A.offset)) (.cse4 (<= 4 (+ .cse2 ULTIMATE.start_diff_~A.offset))) (.cse5 (<= 1 ULTIMATE.start_main_~Alen~0)) (.cse6 (and (and .cse11 (and .cse9 .cse10 .cse12 .cse13 .cse14 .cse15 .cse16)) (<= 0 (+ (* 4 ULTIMATE.start_diff_~j~0) ULTIMATE.start_diff_~B.offset)))) (.cse3 (select |#length| ULTIMATE.start_diff_~D.base))) (or (let ((.cse0 (* 4 ULTIMATE.start_diff_~k~0))) (and (and (<= (+ .cse0 .cse1) (+ .cse2 ULTIMATE.start_diff_~A.offset .cse3)) .cse4 .cse5 .cse6 .cse7 .cse8) (<= 4 (+ .cse0 ULTIMATE.start_diff_~D.offset)))) (and .cse7 .cse8 (let ((.cse17 (<= 4 .cse3))) (or (and (and .cse9 .cse10 .cse11 .cse12 .cse13 (= 0 ULTIMATE.start_diff_~i~0) .cse14 .cse15 .cse16) .cse17 .cse5) (and .cse17 .cse4 .cse5 .cse6))) (= 0 ULTIMATE.start_diff_~k~0) (exists ((v_prenex_1 Int) (|ULTIMATE.start_main_#t~malloc8.base| Int)) (let ((.cse18 (* 4 v_prenex_1))) (and (<= ULTIMATE.start_diff_~l1~0 v_prenex_1) (= .cse18 (select |#length| |ULTIMATE.start_main_#t~malloc8.base|)) (= .cse18 (select |#length| ULTIMATE.start_diff_~D.base)))))))))) 72.80/34.78 [2019-03-28 12:50:28,314 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr5REQUIRES_VIOLATION(line 24) no Hoare annotation was computed. 72.80/34.78 [2019-03-28 12:50:28,314 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr6REQUIRES_VIOLATION(line 24) no Hoare annotation was computed. 72.80/34.78 [2019-03-28 12:50:28,314 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr0REQUIRES_VIOLATION(line 17) no Hoare annotation was computed. 72.80/34.78 [2019-03-28 12:50:28,314 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr1REQUIRES_VIOLATION(line 17) no Hoare annotation was computed. 72.80/34.78 [2019-03-28 12:50:28,314 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr2REQUIRES_VIOLATION(line 17) no Hoare annotation was computed. 72.80/34.78 [2019-03-28 12:50:28,315 INFO L448 ceAbstractionStarter]: For program point L34(lines 34 36) no Hoare annotation was computed. 72.80/34.78 [2019-03-28 12:50:28,315 INFO L448 ceAbstractionStarter]: For program point L34-2(lines 31 45) no Hoare annotation was computed. 72.80/34.78 [2019-03-28 12:50:28,315 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. 72.80/34.78 [2019-03-28 12:50:28,315 INFO L448 ceAbstractionStarter]: For program point L24(line 24) no Hoare annotation was computed. 72.80/34.78 [2019-03-28 12:50:28,315 INFO L448 ceAbstractionStarter]: For program point L24-1(line 24) no Hoare annotation was computed. 72.80/34.78 [2019-03-28 12:50:28,315 INFO L448 ceAbstractionStarter]: For program point L16-2(lines 13 28) no Hoare annotation was computed. 72.80/34.78 [2019-03-28 12:50:28,315 INFO L448 ceAbstractionStarter]: For program point L37-1(lines 37 39) no Hoare annotation was computed. 72.80/34.78 [2019-03-28 12:50:28,316 INFO L305 ceAbstractionStarter]: Did not count any witness invariants because Icfg is not BoogieIcfg 72.80/34.78 [2019-03-28 12:50:28,325 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] 72.80/34.78 [2019-03-28 12:50:28,326 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] 72.80/34.78 [2019-03-28 12:50:28,326 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_#t~malloc8.base,QUANTIFIED] 72.80/34.78 [2019-03-28 12:50:28,327 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] 72.80/34.78 [2019-03-28 12:50:28,330 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 72.80/34.78 [2019-03-28 12:50:28,330 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 72.80/34.78 [2019-03-28 12:50:28,331 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 72.80/34.78 [2019-03-28 12:50:28,331 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 72.80/34.78 [2019-03-28 12:50:28,331 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 72.80/34.78 [2019-03-28 12:50:28,332 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 72.80/34.78 [2019-03-28 12:50:28,332 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 72.80/34.78 [2019-03-28 12:50:28,332 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 72.80/34.78 [2019-03-28 12:50:28,333 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 72.80/34.78 [2019-03-28 12:50:28,333 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 72.80/34.78 [2019-03-28 12:50:28,333 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 72.80/34.78 [2019-03-28 12:50:28,341 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] 72.80/34.78 [2019-03-28 12:50:28,341 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] 72.80/34.78 [2019-03-28 12:50:28,341 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_#t~malloc8.base,QUANTIFIED] 72.80/34.78 [2019-03-28 12:50:28,342 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] 72.80/34.78 [2019-03-28 12:50:28,343 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 72.80/34.78 [2019-03-28 12:50:28,343 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 72.80/34.78 [2019-03-28 12:50:28,343 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 72.80/34.78 [2019-03-28 12:50:28,344 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 72.80/34.78 [2019-03-28 12:50:28,344 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 72.80/34.78 [2019-03-28 12:50:28,344 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 72.80/34.78 [2019-03-28 12:50:28,345 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 72.80/34.78 [2019-03-28 12:50:28,345 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 72.80/34.78 [2019-03-28 12:50:28,345 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 72.80/34.78 [2019-03-28 12:50:28,345 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 72.80/34.78 [2019-03-28 12:50:28,346 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 72.80/34.78 [2019-03-28 12:50:28,349 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] 72.80/34.78 [2019-03-28 12:50:28,350 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] 72.80/34.78 [2019-03-28 12:50:28,350 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_#t~malloc8.base,QUANTIFIED] 72.80/34.78 [2019-03-28 12:50:28,350 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] 72.80/34.78 [2019-03-28 12:50:28,351 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] 72.80/34.78 [2019-03-28 12:50:28,352 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] 72.80/34.78 [2019-03-28 12:50:28,352 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_#t~malloc8.base,QUANTIFIED] 72.80/34.78 [2019-03-28 12:50:28,352 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] 72.80/34.78 [2019-03-28 12:50:28,353 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] 72.80/34.78 [2019-03-28 12:50:28,353 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] 72.80/34.78 [2019-03-28 12:50:28,353 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_#t~malloc8.base,QUANTIFIED] 72.80/34.78 [2019-03-28 12:50:28,353 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] 72.80/34.78 [2019-03-28 12:50:28,354 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] 72.80/34.78 [2019-03-28 12:50:28,354 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] 72.80/34.78 [2019-03-28 12:50:28,354 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_#t~malloc8.base,QUANTIFIED] 72.80/34.78 [2019-03-28 12:50:28,355 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] 72.80/34.78 [2019-03-28 12:50:28,359 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 72.80/34.78 [2019-03-28 12:50:28,359 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 72.80/34.78 [2019-03-28 12:50:28,360 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 72.80/34.78 [2019-03-28 12:50:28,360 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 72.80/34.78 [2019-03-28 12:50:28,360 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 72.80/34.78 [2019-03-28 12:50:28,361 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 72.80/34.78 [2019-03-28 12:50:28,361 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 72.80/34.78 [2019-03-28 12:50:28,361 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 72.80/34.78 [2019-03-28 12:50:28,361 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 72.80/34.78 [2019-03-28 12:50:28,362 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 72.80/34.78 [2019-03-28 12:50:28,362 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 72.80/34.78 [2019-03-28 12:50:28,363 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 72.80/34.78 [2019-03-28 12:50:28,363 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 72.80/34.78 [2019-03-28 12:50:28,364 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 72.80/34.78 [2019-03-28 12:50:28,364 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 72.80/34.78 [2019-03-28 12:50:28,364 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 72.80/34.78 [2019-03-28 12:50:28,364 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 72.80/34.78 [2019-03-28 12:50:28,365 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 72.80/34.78 [2019-03-28 12:50:28,365 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 72.80/34.78 [2019-03-28 12:50:28,365 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 72.80/34.78 [2019-03-28 12:50:28,366 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 72.80/34.78 [2019-03-28 12:50:28,366 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 72.80/34.78 [2019-03-28 12:50:28,366 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 72.80/34.78 [2019-03-28 12:50:28,367 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 72.80/34.78 [2019-03-28 12:50:28,367 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 72.80/34.78 [2019-03-28 12:50:28,368 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 72.80/34.78 [2019-03-28 12:50:28,368 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 72.80/34.78 [2019-03-28 12:50:28,368 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 72.80/34.78 [2019-03-28 12:50:28,369 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 72.80/34.78 [2019-03-28 12:50:28,369 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 72.80/34.78 [2019-03-28 12:50:28,369 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 72.80/34.78 [2019-03-28 12:50:28,369 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 72.80/34.78 [2019-03-28 12:50:28,370 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 72.80/34.78 [2019-03-28 12:50:28,370 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 72.80/34.78 [2019-03-28 12:50:28,370 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 72.80/34.78 [2019-03-28 12:50:28,370 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 72.80/34.78 [2019-03-28 12:50:28,371 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 72.80/34.78 [2019-03-28 12:50:28,371 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 72.80/34.78 [2019-03-28 12:50:28,372 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 72.80/34.78 [2019-03-28 12:50:28,372 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 72.80/34.78 [2019-03-28 12:50:28,372 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 72.80/34.78 [2019-03-28 12:50:28,372 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 72.80/34.78 [2019-03-28 12:50:28,373 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 72.80/34.78 [2019-03-28 12:50:28,373 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 72.80/34.78 [2019-03-28 12:50:28,373 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 72.80/34.78 [2019-03-28 12:50:28,374 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 72.80/34.78 [2019-03-28 12:50:28,375 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] 72.80/34.78 [2019-03-28 12:50:28,375 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] 72.80/34.78 [2019-03-28 12:50:28,376 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_#t~malloc8.base,QUANTIFIED] 72.80/34.78 [2019-03-28 12:50:28,376 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] 72.80/34.78 [2019-03-28 12:50:28,377 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] 72.80/34.78 [2019-03-28 12:50:28,378 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] 72.80/34.78 [2019-03-28 12:50:28,378 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_#t~malloc8.base,QUANTIFIED] 72.80/34.78 [2019-03-28 12:50:28,378 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] 72.80/34.78 [2019-03-28 12:50:28,378 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] 72.80/34.78 [2019-03-28 12:50:28,379 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] 72.80/34.78 [2019-03-28 12:50:28,379 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_#t~malloc8.base,QUANTIFIED] 72.80/34.78 [2019-03-28 12:50:28,379 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] 72.80/34.78 [2019-03-28 12:50:28,380 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] 72.80/34.78 [2019-03-28 12:50:28,380 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] 72.80/34.78 [2019-03-28 12:50:28,380 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_#t~malloc8.base,QUANTIFIED] 72.80/34.78 [2019-03-28 12:50:28,380 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] 72.80/34.78 [2019-03-28 12:50:28,384 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 72.80/34.78 [2019-03-28 12:50:28,384 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 72.80/34.78 [2019-03-28 12:50:28,384 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 72.80/34.78 [2019-03-28 12:50:28,385 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 72.80/34.78 [2019-03-28 12:50:28,385 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 72.80/34.78 [2019-03-28 12:50:28,385 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 72.80/34.78 [2019-03-28 12:50:28,386 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 72.80/34.78 [2019-03-28 12:50:28,386 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 72.80/34.78 [2019-03-28 12:50:28,386 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 72.80/34.78 [2019-03-28 12:50:28,386 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 72.80/34.78 [2019-03-28 12:50:28,387 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 72.80/34.78 [2019-03-28 12:50:28,387 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 72.80/34.78 [2019-03-28 12:50:28,388 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 72.80/34.78 [2019-03-28 12:50:28,388 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 72.80/34.78 [2019-03-28 12:50:28,388 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 72.80/34.78 [2019-03-28 12:50:28,389 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 72.80/34.78 [2019-03-28 12:50:28,389 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 72.80/34.78 [2019-03-28 12:50:28,389 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 72.80/34.78 [2019-03-28 12:50:28,390 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 72.80/34.78 [2019-03-28 12:50:28,390 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 72.80/34.78 [2019-03-28 12:50:28,390 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 72.80/34.78 [2019-03-28 12:50:28,390 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 72.80/34.78 [2019-03-28 12:50:28,391 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 72.80/34.78 [2019-03-28 12:50:28,391 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 72.80/34.78 [2019-03-28 12:50:28,392 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 72.80/34.78 [2019-03-28 12:50:28,392 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 72.80/34.78 [2019-03-28 12:50:28,392 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 72.80/34.78 [2019-03-28 12:50:28,393 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 72.80/34.78 [2019-03-28 12:50:28,393 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 72.80/34.78 [2019-03-28 12:50:28,393 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 72.80/34.78 [2019-03-28 12:50:28,393 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 72.80/34.78 [2019-03-28 12:50:28,393 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 72.80/34.78 [2019-03-28 12:50:28,394 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 72.80/34.78 [2019-03-28 12:50:28,394 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 72.80/34.78 [2019-03-28 12:50:28,394 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 72.80/34.78 [2019-03-28 12:50:28,394 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 72.80/34.78 [2019-03-28 12:50:28,395 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 72.80/34.78 [2019-03-28 12:50:28,395 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 72.80/34.78 [2019-03-28 12:50:28,396 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 72.80/34.78 [2019-03-28 12:50:28,396 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 72.80/34.78 [2019-03-28 12:50:28,396 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 72.80/34.78 [2019-03-28 12:50:28,396 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 72.80/34.78 [2019-03-28 12:50:28,397 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 72.80/34.78 [2019-03-28 12:50:28,397 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 72.80/34.78 [2019-03-28 12:50:28,397 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 72.80/34.78 [2019-03-28 12:50:28,397 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 72.80/34.78 [2019-03-28 12:50:28,400 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.03 12:50:28 BasicIcfg 72.80/34.78 [2019-03-28 12:50:28,400 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- 72.80/34.78 [2019-03-28 12:50:28,401 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- 72.80/34.78 [2019-03-28 12:50:28,401 INFO L271 PluginConnector]: Initializing BuchiAutomizer... 72.80/34.78 [2019-03-28 12:50:28,405 INFO L276 PluginConnector]: BuchiAutomizer initialized 72.80/34.78 [2019-03-28 12:50:28,406 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis 72.80/34.78 [2019-03-28 12:50:28,406 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 28.03 12:50:17" (1/5) ... 72.80/34.78 [2019-03-28 12:50:28,406 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@30c8e14a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 28.03 12:50:28, skipping insertion in model container 72.80/34.78 [2019-03-28 12:50:28,407 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis 72.80/34.78 [2019-03-28 12:50:28,407 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 12:50:18" (2/5) ... 72.80/34.78 [2019-03-28 12:50:28,407 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@30c8e14a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 28.03 12:50:28, skipping insertion in model container 72.80/34.78 [2019-03-28 12:50:28,407 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis 72.80/34.78 [2019-03-28 12:50:28,407 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.03 12:50:18" (3/5) ... 72.80/34.78 [2019-03-28 12:50:28,408 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@30c8e14a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 28.03 12:50:28, skipping insertion in model container 72.80/34.78 [2019-03-28 12:50:28,408 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis 72.80/34.78 [2019-03-28 12:50:28,408 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 28.03 12:50:18" (4/5) ... 72.80/34.78 [2019-03-28 12:50:28,408 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@30c8e14a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 28.03 12:50:28, skipping insertion in model container 72.80/34.78 [2019-03-28 12:50:28,408 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis 72.80/34.78 [2019-03-28 12:50:28,408 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.03 12:50:28" (5/5) ... 72.80/34.78 [2019-03-28 12:50:28,410 INFO L375 chiAutomizerObserver]: Analyzing ICFG theBenchmark.c_BEv2 72.80/34.78 [2019-03-28 12:50:28,431 INFO L133 ementStrategyFactory]: Using default assertion order modulation 72.80/34.78 [2019-03-28 12:50:28,432 INFO L374 BuchiCegarLoop]: Interprodecural is true 72.80/34.78 [2019-03-28 12:50:28,432 INFO L375 BuchiCegarLoop]: Hoare is true 72.80/34.78 [2019-03-28 12:50:28,432 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates 72.80/34.78 [2019-03-28 12:50:28,432 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE 72.80/34.78 [2019-03-28 12:50:28,432 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION 72.80/34.78 [2019-03-28 12:50:28,432 INFO L379 BuchiCegarLoop]: Difference is false 72.80/34.78 [2019-03-28 12:50:28,432 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA 72.80/34.78 [2019-03-28 12:50:28,432 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== 72.80/34.78 [2019-03-28 12:50:28,436 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 21 states. 72.80/34.78 [2019-03-28 12:50:28,440 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 9 72.80/34.78 [2019-03-28 12:50:28,440 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false 72.80/34.78 [2019-03-28 12:50:28,440 INFO L119 BuchiIsEmpty]: Starting construction of run 72.80/34.78 [2019-03-28 12:50:28,445 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] 72.80/34.78 [2019-03-28 12:50:28,445 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] 72.80/34.78 [2019-03-28 12:50:28,445 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ 72.80/34.78 [2019-03-28 12:50:28,445 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 21 states. 72.80/34.78 [2019-03-28 12:50:28,446 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 9 72.80/34.78 [2019-03-28 12:50:28,447 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false 72.80/34.78 [2019-03-28 12:50:28,447 INFO L119 BuchiIsEmpty]: Starting construction of run 72.80/34.78 [2019-03-28 12:50:28,447 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] 72.80/34.78 [2019-03-28 12:50:28,447 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] 72.80/34.78 [2019-03-28 12:50:28,453 INFO L794 eck$LassoCheckResult]: Stem: 10#ULTIMATE.startENTRYtrue [150] ULTIMATE.startENTRY-->L34: Formula: (and (= |v_#NULL.offset_2| 0) (= (store |v_#valid_20| 0 0) |v_#valid_19|) (= 0 |v_#NULL.base_2|)) InVars {#valid=|v_#valid_20|} OutVars{ULTIMATE.start_main_#t~malloc8.base=|v_ULTIMATE.start_main_#t~malloc8.base_5|, ULTIMATE.start_main_#t~malloc9.base=|v_ULTIMATE.start_main_#t~malloc9.base_5|, ULTIMATE.start_main_~A~0.base=v_ULTIMATE.start_main_~A~0.base_3, ULTIMATE.start_main_~B~0.offset=v_ULTIMATE.start_main_~B~0.offset_3, #NULL.offset=|v_#NULL.offset_2|, ULTIMATE.start_main_#t~nondet6=|v_ULTIMATE.start_main_#t~nondet6_6|, ULTIMATE.start_main_#t~nondet7=|v_ULTIMATE.start_main_#t~nondet7_6|, ULTIMATE.start_main_~B~0.base=v_ULTIMATE.start_main_~B~0.base_3, #NULL.base=|v_#NULL.base_2|, ULTIMATE.start_main_~D~0.offset=v_ULTIMATE.start_main_~D~0.offset_3, ULTIMATE.start_main_#t~malloc10.base=|v_ULTIMATE.start_main_#t~malloc10.base_5|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_4|, ULTIMATE.start_main_#t~malloc8.offset=|v_ULTIMATE.start_main_#t~malloc8.offset_5|, #valid=|v_#valid_19|, ULTIMATE.start_main_#t~malloc9.offset=|v_ULTIMATE.start_main_#t~malloc9.offset_5|, ULTIMATE.start_main_~D~0.base=v_ULTIMATE.start_main_~D~0.base_3, ULTIMATE.start_main_~A~0.offset=v_ULTIMATE.start_main_~A~0.offset_3, ULTIMATE.start_main_~Blen~0=v_ULTIMATE.start_main_~Blen~0_8, ULTIMATE.start_main_~Alen~0=v_ULTIMATE.start_main_~Alen~0_8, ULTIMATE.start_main_#t~malloc10.offset=|v_ULTIMATE.start_main_#t~malloc10.offset_5|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~malloc8.base, ULTIMATE.start_main_#t~malloc9.base, ULTIMATE.start_main_~A~0.base, ULTIMATE.start_main_~B~0.offset, #NULL.offset, ULTIMATE.start_main_#t~nondet6, ULTIMATE.start_main_#t~nondet7, ULTIMATE.start_main_~B~0.base, #NULL.base, ULTIMATE.start_main_~D~0.offset, ULTIMATE.start_main_#t~malloc10.base, ULTIMATE.start_main_#res, ULTIMATE.start_main_#t~malloc8.offset, #valid, ULTIMATE.start_main_#t~malloc9.offset, ULTIMATE.start_main_~D~0.base, ULTIMATE.start_main_~A~0.offset, ULTIMATE.start_main_~Blen~0, ULTIMATE.start_main_~Alen~0, ULTIMATE.start_main_#t~malloc10.offset] 18#L34true [75] L34-->L34-2: Formula: (and (< v_ULTIMATE.start_main_~Alen~0_5 1) (= v_ULTIMATE.start_main_~Alen~0_4 1)) InVars {ULTIMATE.start_main_~Alen~0=v_ULTIMATE.start_main_~Alen~0_5} OutVars{ULTIMATE.start_main_~Alen~0=v_ULTIMATE.start_main_~Alen~0_4} AuxVars[] AssignedVars[ULTIMATE.start_main_~Alen~0] 11#L34-2true [105] L34-2-->L37-1: Formula: (>= v_ULTIMATE.start_main_~Blen~0_6 1) InVars {ULTIMATE.start_main_~Blen~0=v_ULTIMATE.start_main_~Blen~0_6} OutVars{ULTIMATE.start_main_~Blen~0=v_ULTIMATE.start_main_~Blen~0_6} AuxVars[] AssignedVars[] 22#L37-1true [126] L37-1-->L13-2: Formula: (let ((.cse2 (store |v_#valid_10| |v_ULTIMATE.start_main_#t~malloc8.base_4| 1))) (let ((.cse0 (store .cse2 |v_ULTIMATE.start_main_#t~malloc9.base_4| 1))) (and (= v_ULTIMATE.start_diff_~k~0_1 0) (= v_ULTIMATE.start_diff_~l2~0_1 v_ULTIMATE.start_diff_~Blen_1) (= v_ULTIMATE.start_diff_~A.base_1 |v_ULTIMATE.start_diff_#in~A.base_1|) (= |v_#valid_7| (store .cse0 |v_ULTIMATE.start_main_#t~malloc10.base_4| 1)) (< |v_ULTIMATE.start_main_#t~malloc10.base_4| |v_#StackHeapBarrier_1|) (= v_ULTIMATE.start_diff_~Blen_1 |v_ULTIMATE.start_diff_#in~Blen_1|) (= v_ULTIMATE.start_diff_~B.base_1 |v_ULTIMATE.start_diff_#in~B.base_1|) (= v_ULTIMATE.start_diff_~Alen_1 |v_ULTIMATE.start_diff_#in~Alen_1|) (= v_ULTIMATE.start_main_~B~0.offset_2 |v_ULTIMATE.start_main_#t~malloc9.offset_4|) (= v_ULTIMATE.start_main_~B~0.base_2 |v_ULTIMATE.start_main_#t~malloc9.base_4|) (= |v_ULTIMATE.start_diff_#in~A.base_1| v_ULTIMATE.start_main_~A~0.base_2) (= |v_ULTIMATE.start_main_#t~malloc8.offset_4| 0) (> |v_ULTIMATE.start_main_#t~malloc10.base_4| 0) (= |v_#length_1| (let ((.cse1 (* 4 v_ULTIMATE.start_main_~Alen~0_7))) (store (store (store |v_#length_4| |v_ULTIMATE.start_main_#t~malloc8.base_4| .cse1) |v_ULTIMATE.start_main_#t~malloc9.base_4| (* 4 v_ULTIMATE.start_main_~Blen~0_7)) |v_ULTIMATE.start_main_#t~malloc10.base_4| .cse1))) (= v_ULTIMATE.start_diff_~D.base_1 |v_ULTIMATE.start_diff_#in~D.base_1|) (= |v_ULTIMATE.start_main_#t~malloc9.offset_4| 0) (= |v_ULTIMATE.start_diff_#in~B.offset_1| v_ULTIMATE.start_main_~B~0.offset_2) (= |v_ULTIMATE.start_diff_#in~A.offset_1| v_ULTIMATE.start_main_~A~0.offset_2) (= v_ULTIMATE.start_diff_~B.offset_1 |v_ULTIMATE.start_diff_#in~B.offset_1|) (= v_ULTIMATE.start_main_~A~0.base_2 |v_ULTIMATE.start_main_#t~malloc8.base_4|) (< |v_ULTIMATE.start_main_#t~malloc8.base_4| |v_#StackHeapBarrier_1|) (= |v_ULTIMATE.start_diff_#in~B.base_1| v_ULTIMATE.start_main_~B~0.base_2) (< 0 |v_ULTIMATE.start_main_#t~malloc9.base_4|) (< |v_ULTIMATE.start_main_#t~malloc9.base_4| |v_#StackHeapBarrier_1|) (= |v_ULTIMATE.start_diff_#in~D.offset_1| v_ULTIMATE.start_main_~D~0.offset_2) (= v_ULTIMATE.start_main_~D~0.offset_2 |v_ULTIMATE.start_main_#t~malloc10.offset_4|) (= v_ULTIMATE.start_diff_~i~0_1 0) (= 0 (select .cse2 |v_ULTIMATE.start_main_#t~malloc9.base_4|)) (= v_ULTIMATE.start_main_~D~0.base_2 |v_ULTIMATE.start_main_#t~malloc10.base_4|) (= |v_ULTIMATE.start_diff_#in~Blen_1| v_ULTIMATE.start_main_~Blen~0_7) (= v_ULTIMATE.start_diff_~l1~0_1 v_ULTIMATE.start_diff_~Alen_1) (= 0 (select .cse0 |v_ULTIMATE.start_main_#t~malloc10.base_4|)) (= (select |v_#valid_10| |v_ULTIMATE.start_main_#t~malloc8.base_4|) 0) (= v_ULTIMATE.start_diff_~A.offset_1 |v_ULTIMATE.start_diff_#in~A.offset_1|) (< |v_ULTIMATE.start_main_#t~malloc8.base_4| 0) (= |v_ULTIMATE.start_diff_#in~Alen_1| v_ULTIMATE.start_main_~Alen~0_7) (= v_ULTIMATE.start_main_~A~0.offset_2 |v_ULTIMATE.start_main_#t~malloc8.offset_4|) (= |v_ULTIMATE.start_main_#t~malloc10.offset_4| 0) (= |v_ULTIMATE.start_diff_#in~D.base_1| v_ULTIMATE.start_main_~D~0.base_2) (= v_ULTIMATE.start_diff_~D.offset_1 |v_ULTIMATE.start_diff_#in~D.offset_1|)))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_4|, #valid=|v_#valid_10|, ULTIMATE.start_main_~Blen~0=v_ULTIMATE.start_main_~Blen~0_7, ULTIMATE.start_main_~Alen~0=v_ULTIMATE.start_main_~Alen~0_7} OutVars{ULTIMATE.start_diff_#in~A.base=|v_ULTIMATE.start_diff_#in~A.base_1|, ULTIMATE.start_diff_#in~B.base=|v_ULTIMATE.start_diff_#in~B.base_1|, ULTIMATE.start_diff_~B.offset=v_ULTIMATE.start_diff_~B.offset_1, ULTIMATE.start_diff_~Alen=v_ULTIMATE.start_diff_~Alen_1, ULTIMATE.start_diff_~D.base=v_ULTIMATE.start_diff_~D.base_1, ULTIMATE.start_diff_#in~Blen=|v_ULTIMATE.start_diff_#in~Blen_1|, ULTIMATE.start_main_~B~0.offset=v_ULTIMATE.start_main_~B~0.offset_2, ULTIMATE.start_main_~B~0.base=v_ULTIMATE.start_main_~B~0.base_2, ULTIMATE.start_diff_#in~A.offset=|v_ULTIMATE.start_diff_#in~A.offset_1|, ULTIMATE.start_main_~D~0.offset=v_ULTIMATE.start_main_~D~0.offset_2, ULTIMATE.start_diff_#in~D.offset=|v_ULTIMATE.start_diff_#in~D.offset_1|, ULTIMATE.start_diff_#in~Alen=|v_ULTIMATE.start_diff_#in~Alen_1|, ULTIMATE.start_diff_~A.base=v_ULTIMATE.start_diff_~A.base_1, ULTIMATE.start_diff_~B.base=v_ULTIMATE.start_diff_~B.base_1, #length=|v_#length_1|, ULTIMATE.start_main_#t~malloc9.offset=|v_ULTIMATE.start_main_#t~malloc9.offset_4|, ULTIMATE.start_diff_#t~mem3=|v_ULTIMATE.start_diff_#t~mem3_1|, ULTIMATE.start_main_~A~0.offset=v_ULTIMATE.start_main_~A~0.offset_2, ULTIMATE.start_main_#t~malloc10.offset=|v_ULTIMATE.start_main_#t~malloc10.offset_4|, ULTIMATE.start_main_~Blen~0=v_ULTIMATE.start_main_~Blen~0_7, ULTIMATE.start_main_~Alen~0=v_ULTIMATE.start_main_~Alen~0_7, ULTIMATE.start_diff_~Blen=v_ULTIMATE.start_diff_~Blen_1, ULTIMATE.start_main_#t~malloc8.base=|v_ULTIMATE.start_main_#t~malloc8.base_4|, ULTIMATE.start_diff_#t~mem0=|v_ULTIMATE.start_diff_#t~mem0_1|, ULTIMATE.start_main_#t~malloc9.base=|v_ULTIMATE.start_main_#t~malloc9.base_4|, ULTIMATE.start_diff_#t~mem1=|v_ULTIMATE.start_diff_#t~mem1_1|, ULTIMATE.start_main_~A~0.base=v_ULTIMATE.start_main_~A~0.base_2, ULTIMATE.start_diff_#t~post4=|v_ULTIMATE.start_diff_#t~post4_1|, ULTIMATE.start_diff_~found~0=v_ULTIMATE.start_diff_~found~0_1, ULTIMATE.start_diff_#in~B.offset=|v_ULTIMATE.start_diff_#in~B.offset_1|, ULTIMATE.start_diff_~i~0=v_ULTIMATE.start_diff_~i~0_1, ULTIMATE.start_diff_~l1~0=v_ULTIMATE.start_diff_~l1~0_1, ULTIMATE.start_diff_#t~post5=|v_ULTIMATE.start_diff_#t~post5_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, ULTIMATE.start_main_#t~malloc10.base=|v_ULTIMATE.start_main_#t~malloc10.base_4|, ULTIMATE.start_diff_~D.offset=v_ULTIMATE.start_diff_~D.offset_1, ULTIMATE.start_diff_~l2~0=v_ULTIMATE.start_diff_~l2~0_1, ULTIMATE.start_diff_~j~0=v_ULTIMATE.start_diff_~j~0_1, ULTIMATE.start_main_#t~malloc8.offset=|v_ULTIMATE.start_main_#t~malloc8.offset_4|, #valid=|v_#valid_7|, ULTIMATE.start_diff_~k~0=v_ULTIMATE.start_diff_~k~0_1, ULTIMATE.start_diff_#in~D.base=|v_ULTIMATE.start_diff_#in~D.base_1|, ULTIMATE.start_diff_#t~post2=|v_ULTIMATE.start_diff_#t~post2_1|, ULTIMATE.start_diff_~A.offset=v_ULTIMATE.start_diff_~A.offset_1, ULTIMATE.start_main_~D~0.base=v_ULTIMATE.start_main_~D~0.base_2} AuxVars[] AssignedVars[ULTIMATE.start_diff_#in~A.base, ULTIMATE.start_diff_#in~B.base, ULTIMATE.start_diff_~B.offset, ULTIMATE.start_diff_~Alen, ULTIMATE.start_diff_~D.base, ULTIMATE.start_diff_#in~Blen, ULTIMATE.start_main_~B~0.offset, ULTIMATE.start_main_~B~0.base, ULTIMATE.start_diff_#in~A.offset, ULTIMATE.start_main_~D~0.offset, ULTIMATE.start_diff_#in~D.offset, ULTIMATE.start_diff_#in~Alen, ULTIMATE.start_diff_~A.base, ULTIMATE.start_diff_~B.base, #length, ULTIMATE.start_main_#t~malloc9.offset, ULTIMATE.start_diff_#t~mem3, ULTIMATE.start_main_~A~0.offset, ULTIMATE.start_main_#t~malloc10.offset, ULTIMATE.start_diff_~Blen, ULTIMATE.start_main_#t~malloc8.base, ULTIMATE.start_diff_#t~mem0, ULTIMATE.start_main_#t~malloc9.base, ULTIMATE.start_diff_#t~mem1, ULTIMATE.start_main_~A~0.base, ULTIMATE.start_diff_#t~post4, ULTIMATE.start_diff_~found~0, ULTIMATE.start_diff_#in~B.offset, ULTIMATE.start_diff_~i~0, ULTIMATE.start_diff_~l1~0, ULTIMATE.start_diff_#t~post5, ULTIMATE.start_main_#t~malloc10.base, ULTIMATE.start_diff_~D.offset, ULTIMATE.start_diff_~l2~0, ULTIMATE.start_diff_~j~0, ULTIMATE.start_main_#t~malloc8.offset, #valid, ULTIMATE.start_diff_~k~0, ULTIMATE.start_diff_#in~D.base, ULTIMATE.start_diff_#t~post2, ULTIMATE.start_diff_~A.offset, ULTIMATE.start_main_~D~0.base] 13#L13-2true 72.80/34.78 [2019-03-28 12:50:28,453 INFO L796 eck$LassoCheckResult]: Loop: 13#L13-2true [91] L13-2-->L17-4: Formula: (and (< v_ULTIMATE.start_diff_~i~0_4 v_ULTIMATE.start_diff_~l1~0_4) (= v_ULTIMATE.start_diff_~j~0_2 0) (= v_ULTIMATE.start_diff_~found~0_3 0)) InVars {ULTIMATE.start_diff_~i~0=v_ULTIMATE.start_diff_~i~0_4, ULTIMATE.start_diff_~l1~0=v_ULTIMATE.start_diff_~l1~0_4} OutVars{ULTIMATE.start_diff_~found~0=v_ULTIMATE.start_diff_~found~0_3, ULTIMATE.start_diff_~i~0=v_ULTIMATE.start_diff_~i~0_4, ULTIMATE.start_diff_~l1~0=v_ULTIMATE.start_diff_~l1~0_4, ULTIMATE.start_diff_~j~0=v_ULTIMATE.start_diff_~j~0_2} AuxVars[] AssignedVars[ULTIMATE.start_diff_~found~0, ULTIMATE.start_diff_~j~0] 19#L17-4true [128] L17-4-->L16-2: Formula: (>= v_ULTIMATE.start_diff_~j~0_3 v_ULTIMATE.start_diff_~l2~0_3) InVars {ULTIMATE.start_diff_~l2~0=v_ULTIMATE.start_diff_~l2~0_3, ULTIMATE.start_diff_~j~0=v_ULTIMATE.start_diff_~j~0_3} OutVars{ULTIMATE.start_diff_~l2~0=v_ULTIMATE.start_diff_~l2~0_3, ULTIMATE.start_diff_~j~0=v_ULTIMATE.start_diff_~j~0_3} AuxVars[] AssignedVars[] 21#L16-2true [130] L16-2-->L23-1: Formula: (< 0 v_ULTIMATE.start_diff_~found~0_8) InVars {ULTIMATE.start_diff_~found~0=v_ULTIMATE.start_diff_~found~0_8} OutVars{ULTIMATE.start_diff_~found~0=v_ULTIMATE.start_diff_~found~0_8} AuxVars[] AssignedVars[] 14#L23-1true [74] L23-1-->L13-2: Formula: (= v_ULTIMATE.start_diff_~i~0_9 (+ v_ULTIMATE.start_diff_~i~0_10 1)) InVars {ULTIMATE.start_diff_~i~0=v_ULTIMATE.start_diff_~i~0_10} OutVars{ULTIMATE.start_diff_#t~post5=|v_ULTIMATE.start_diff_#t~post5_2|, ULTIMATE.start_diff_~i~0=v_ULTIMATE.start_diff_~i~0_9} AuxVars[] AssignedVars[ULTIMATE.start_diff_#t~post5, ULTIMATE.start_diff_~i~0] 13#L13-2true 72.80/34.78 [2019-03-28 12:50:28,454 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 72.80/34.78 [2019-03-28 12:50:28,454 INFO L82 PathProgramCache]: Analyzing trace with hash 5467627, now seen corresponding path program 1 times 72.80/34.78 [2019-03-28 12:50:28,454 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 72.80/34.78 [2019-03-28 12:50:28,455 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 72.80/34.78 [2019-03-28 12:50:28,456 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 72.80/34.78 [2019-03-28 12:50:28,456 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 72.80/34.78 [2019-03-28 12:50:28,456 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 72.80/34.78 [2019-03-28 12:50:28,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 72.80/34.78 [2019-03-28 12:50:28,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 72.80/34.78 [2019-03-28 12:50:28,488 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 72.80/34.78 [2019-03-28 12:50:28,489 INFO L82 PathProgramCache]: Analyzing trace with hash 3761614, now seen corresponding path program 1 times 72.80/34.78 [2019-03-28 12:50:28,489 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 72.80/34.78 [2019-03-28 12:50:28,489 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 72.80/34.78 [2019-03-28 12:50:28,490 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 72.80/34.78 [2019-03-28 12:50:28,490 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 72.80/34.78 [2019-03-28 12:50:28,490 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 72.80/34.78 [2019-03-28 12:50:28,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 72.80/34.78 [2019-03-28 12:50:28,497 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 72.80/34.78 [2019-03-28 12:50:28,498 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. 72.80/34.78 [2019-03-28 12:50:28,498 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 72.80/34.78 [2019-03-28 12:50:28,498 INFO L811 eck$LassoCheckResult]: loop already infeasible 72.80/34.78 [2019-03-28 12:50:28,499 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. 72.80/34.78 [2019-03-28 12:50:28,500 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 72.80/34.78 [2019-03-28 12:50:28,500 INFO L87 Difference]: Start difference. First operand 21 states. Second operand 3 states. 72.80/34.78 [2019-03-28 12:50:28,594 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. 72.80/34.78 [2019-03-28 12:50:28,595 INFO L93 Difference]: Finished difference Result 25 states and 52 transitions. 72.80/34.78 [2019-03-28 12:50:28,596 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 72.80/34.78 [2019-03-28 12:50:28,598 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 25 states and 52 transitions. 72.80/34.78 [2019-03-28 12:50:28,599 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 13 72.80/34.78 [2019-03-28 12:50:28,600 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 25 states to 17 states and 36 transitions. 72.80/34.78 [2019-03-28 12:50:28,601 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 17 72.80/34.78 [2019-03-28 12:50:28,601 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 17 72.80/34.78 [2019-03-28 12:50:28,602 INFO L73 IsDeterministic]: Start isDeterministic. Operand 17 states and 36 transitions. 72.80/34.78 [2019-03-28 12:50:28,602 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. 72.80/34.78 [2019-03-28 12:50:28,603 INFO L706 BuchiCegarLoop]: Abstraction has 17 states and 36 transitions. 72.80/34.78 [2019-03-28 12:50:28,603 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states and 36 transitions. 72.80/34.78 [2019-03-28 12:50:28,604 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 15. 72.80/34.78 [2019-03-28 12:50:28,605 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. 72.80/34.78 [2019-03-28 12:50:28,605 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 34 transitions. 72.80/34.78 [2019-03-28 12:50:28,605 INFO L729 BuchiCegarLoop]: Abstraction has 15 states and 34 transitions. 72.80/34.78 [2019-03-28 12:50:28,605 INFO L609 BuchiCegarLoop]: Abstraction has 15 states and 34 transitions. 72.80/34.78 [2019-03-28 12:50:28,605 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ 72.80/34.78 [2019-03-28 12:50:28,605 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 15 states and 34 transitions. 72.80/34.78 [2019-03-28 12:50:28,606 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 11 72.80/34.78 [2019-03-28 12:50:28,606 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false 72.80/34.78 [2019-03-28 12:50:28,606 INFO L119 BuchiIsEmpty]: Starting construction of run 72.80/34.78 [2019-03-28 12:50:28,607 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] 72.80/34.78 [2019-03-28 12:50:28,607 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] 72.80/34.78 [2019-03-28 12:50:28,607 INFO L794 eck$LassoCheckResult]: Stem: 62#ULTIMATE.startENTRY [150] ULTIMATE.startENTRY-->L34: Formula: (and (= |v_#NULL.offset_2| 0) (= (store |v_#valid_20| 0 0) |v_#valid_19|) (= 0 |v_#NULL.base_2|)) InVars {#valid=|v_#valid_20|} OutVars{ULTIMATE.start_main_#t~malloc8.base=|v_ULTIMATE.start_main_#t~malloc8.base_5|, ULTIMATE.start_main_#t~malloc9.base=|v_ULTIMATE.start_main_#t~malloc9.base_5|, ULTIMATE.start_main_~A~0.base=v_ULTIMATE.start_main_~A~0.base_3, ULTIMATE.start_main_~B~0.offset=v_ULTIMATE.start_main_~B~0.offset_3, #NULL.offset=|v_#NULL.offset_2|, ULTIMATE.start_main_#t~nondet6=|v_ULTIMATE.start_main_#t~nondet6_6|, ULTIMATE.start_main_#t~nondet7=|v_ULTIMATE.start_main_#t~nondet7_6|, ULTIMATE.start_main_~B~0.base=v_ULTIMATE.start_main_~B~0.base_3, #NULL.base=|v_#NULL.base_2|, ULTIMATE.start_main_~D~0.offset=v_ULTIMATE.start_main_~D~0.offset_3, ULTIMATE.start_main_#t~malloc10.base=|v_ULTIMATE.start_main_#t~malloc10.base_5|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_4|, ULTIMATE.start_main_#t~malloc8.offset=|v_ULTIMATE.start_main_#t~malloc8.offset_5|, #valid=|v_#valid_19|, ULTIMATE.start_main_#t~malloc9.offset=|v_ULTIMATE.start_main_#t~malloc9.offset_5|, ULTIMATE.start_main_~D~0.base=v_ULTIMATE.start_main_~D~0.base_3, ULTIMATE.start_main_~A~0.offset=v_ULTIMATE.start_main_~A~0.offset_3, ULTIMATE.start_main_~Blen~0=v_ULTIMATE.start_main_~Blen~0_8, ULTIMATE.start_main_~Alen~0=v_ULTIMATE.start_main_~Alen~0_8, ULTIMATE.start_main_#t~malloc10.offset=|v_ULTIMATE.start_main_#t~malloc10.offset_5|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~malloc8.base, ULTIMATE.start_main_#t~malloc9.base, ULTIMATE.start_main_~A~0.base, ULTIMATE.start_main_~B~0.offset, #NULL.offset, ULTIMATE.start_main_#t~nondet6, ULTIMATE.start_main_#t~nondet7, ULTIMATE.start_main_~B~0.base, #NULL.base, ULTIMATE.start_main_~D~0.offset, ULTIMATE.start_main_#t~malloc10.base, ULTIMATE.start_main_#res, ULTIMATE.start_main_#t~malloc8.offset, #valid, ULTIMATE.start_main_#t~malloc9.offset, ULTIMATE.start_main_~D~0.base, ULTIMATE.start_main_~A~0.offset, ULTIMATE.start_main_~Blen~0, ULTIMATE.start_main_~Alen~0, ULTIMATE.start_main_#t~malloc10.offset] 63#L34 [75] L34-->L34-2: Formula: (and (< v_ULTIMATE.start_main_~Alen~0_5 1) (= v_ULTIMATE.start_main_~Alen~0_4 1)) InVars {ULTIMATE.start_main_~Alen~0=v_ULTIMATE.start_main_~Alen~0_5} OutVars{ULTIMATE.start_main_~Alen~0=v_ULTIMATE.start_main_~Alen~0_4} AuxVars[] AssignedVars[ULTIMATE.start_main_~Alen~0] 60#L34-2 [105] L34-2-->L37-1: Formula: (>= v_ULTIMATE.start_main_~Blen~0_6 1) InVars {ULTIMATE.start_main_~Blen~0=v_ULTIMATE.start_main_~Blen~0_6} OutVars{ULTIMATE.start_main_~Blen~0=v_ULTIMATE.start_main_~Blen~0_6} AuxVars[] AssignedVars[] 61#L37-1 [126] L37-1-->L13-2: Formula: (let ((.cse2 (store |v_#valid_10| |v_ULTIMATE.start_main_#t~malloc8.base_4| 1))) (let ((.cse0 (store .cse2 |v_ULTIMATE.start_main_#t~malloc9.base_4| 1))) (and (= v_ULTIMATE.start_diff_~k~0_1 0) (= v_ULTIMATE.start_diff_~l2~0_1 v_ULTIMATE.start_diff_~Blen_1) (= v_ULTIMATE.start_diff_~A.base_1 |v_ULTIMATE.start_diff_#in~A.base_1|) (= |v_#valid_7| (store .cse0 |v_ULTIMATE.start_main_#t~malloc10.base_4| 1)) (< |v_ULTIMATE.start_main_#t~malloc10.base_4| |v_#StackHeapBarrier_1|) (= v_ULTIMATE.start_diff_~Blen_1 |v_ULTIMATE.start_diff_#in~Blen_1|) (= v_ULTIMATE.start_diff_~B.base_1 |v_ULTIMATE.start_diff_#in~B.base_1|) (= v_ULTIMATE.start_diff_~Alen_1 |v_ULTIMATE.start_diff_#in~Alen_1|) (= v_ULTIMATE.start_main_~B~0.offset_2 |v_ULTIMATE.start_main_#t~malloc9.offset_4|) (= v_ULTIMATE.start_main_~B~0.base_2 |v_ULTIMATE.start_main_#t~malloc9.base_4|) (= |v_ULTIMATE.start_diff_#in~A.base_1| v_ULTIMATE.start_main_~A~0.base_2) (= |v_ULTIMATE.start_main_#t~malloc8.offset_4| 0) (> |v_ULTIMATE.start_main_#t~malloc10.base_4| 0) (= |v_#length_1| (let ((.cse1 (* 4 v_ULTIMATE.start_main_~Alen~0_7))) (store (store (store |v_#length_4| |v_ULTIMATE.start_main_#t~malloc8.base_4| .cse1) |v_ULTIMATE.start_main_#t~malloc9.base_4| (* 4 v_ULTIMATE.start_main_~Blen~0_7)) |v_ULTIMATE.start_main_#t~malloc10.base_4| .cse1))) (= v_ULTIMATE.start_diff_~D.base_1 |v_ULTIMATE.start_diff_#in~D.base_1|) (= |v_ULTIMATE.start_main_#t~malloc9.offset_4| 0) (= |v_ULTIMATE.start_diff_#in~B.offset_1| v_ULTIMATE.start_main_~B~0.offset_2) (= |v_ULTIMATE.start_diff_#in~A.offset_1| v_ULTIMATE.start_main_~A~0.offset_2) (= v_ULTIMATE.start_diff_~B.offset_1 |v_ULTIMATE.start_diff_#in~B.offset_1|) (= v_ULTIMATE.start_main_~A~0.base_2 |v_ULTIMATE.start_main_#t~malloc8.base_4|) (< |v_ULTIMATE.start_main_#t~malloc8.base_4| |v_#StackHeapBarrier_1|) (= |v_ULTIMATE.start_diff_#in~B.base_1| v_ULTIMATE.start_main_~B~0.base_2) (< 0 |v_ULTIMATE.start_main_#t~malloc9.base_4|) (< |v_ULTIMATE.start_main_#t~malloc9.base_4| |v_#StackHeapBarrier_1|) (= |v_ULTIMATE.start_diff_#in~D.offset_1| v_ULTIMATE.start_main_~D~0.offset_2) (= v_ULTIMATE.start_main_~D~0.offset_2 |v_ULTIMATE.start_main_#t~malloc10.offset_4|) (= v_ULTIMATE.start_diff_~i~0_1 0) (= 0 (select .cse2 |v_ULTIMATE.start_main_#t~malloc9.base_4|)) (= v_ULTIMATE.start_main_~D~0.base_2 |v_ULTIMATE.start_main_#t~malloc10.base_4|) (= |v_ULTIMATE.start_diff_#in~Blen_1| v_ULTIMATE.start_main_~Blen~0_7) (= v_ULTIMATE.start_diff_~l1~0_1 v_ULTIMATE.start_diff_~Alen_1) (= 0 (select .cse0 |v_ULTIMATE.start_main_#t~malloc10.base_4|)) (= (select |v_#valid_10| |v_ULTIMATE.start_main_#t~malloc8.base_4|) 0) (= v_ULTIMATE.start_diff_~A.offset_1 |v_ULTIMATE.start_diff_#in~A.offset_1|) (< |v_ULTIMATE.start_main_#t~malloc8.base_4| 0) (= |v_ULTIMATE.start_diff_#in~Alen_1| v_ULTIMATE.start_main_~Alen~0_7) (= v_ULTIMATE.start_main_~A~0.offset_2 |v_ULTIMATE.start_main_#t~malloc8.offset_4|) (= |v_ULTIMATE.start_main_#t~malloc10.offset_4| 0) (= |v_ULTIMATE.start_diff_#in~D.base_1| v_ULTIMATE.start_main_~D~0.base_2) (= v_ULTIMATE.start_diff_~D.offset_1 |v_ULTIMATE.start_diff_#in~D.offset_1|)))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_4|, #valid=|v_#valid_10|, ULTIMATE.start_main_~Blen~0=v_ULTIMATE.start_main_~Blen~0_7, ULTIMATE.start_main_~Alen~0=v_ULTIMATE.start_main_~Alen~0_7} OutVars{ULTIMATE.start_diff_#in~A.base=|v_ULTIMATE.start_diff_#in~A.base_1|, ULTIMATE.start_diff_#in~B.base=|v_ULTIMATE.start_diff_#in~B.base_1|, ULTIMATE.start_diff_~B.offset=v_ULTIMATE.start_diff_~B.offset_1, ULTIMATE.start_diff_~Alen=v_ULTIMATE.start_diff_~Alen_1, ULTIMATE.start_diff_~D.base=v_ULTIMATE.start_diff_~D.base_1, ULTIMATE.start_diff_#in~Blen=|v_ULTIMATE.start_diff_#in~Blen_1|, ULTIMATE.start_main_~B~0.offset=v_ULTIMATE.start_main_~B~0.offset_2, ULTIMATE.start_main_~B~0.base=v_ULTIMATE.start_main_~B~0.base_2, ULTIMATE.start_diff_#in~A.offset=|v_ULTIMATE.start_diff_#in~A.offset_1|, ULTIMATE.start_main_~D~0.offset=v_ULTIMATE.start_main_~D~0.offset_2, ULTIMATE.start_diff_#in~D.offset=|v_ULTIMATE.start_diff_#in~D.offset_1|, ULTIMATE.start_diff_#in~Alen=|v_ULTIMATE.start_diff_#in~Alen_1|, ULTIMATE.start_diff_~A.base=v_ULTIMATE.start_diff_~A.base_1, ULTIMATE.start_diff_~B.base=v_ULTIMATE.start_diff_~B.base_1, #length=|v_#length_1|, ULTIMATE.start_main_#t~malloc9.offset=|v_ULTIMATE.start_main_#t~malloc9.offset_4|, ULTIMATE.start_diff_#t~mem3=|v_ULTIMATE.start_diff_#t~mem3_1|, ULTIMATE.start_main_~A~0.offset=v_ULTIMATE.start_main_~A~0.offset_2, ULTIMATE.start_main_#t~malloc10.offset=|v_ULTIMATE.start_main_#t~malloc10.offset_4|, ULTIMATE.start_main_~Blen~0=v_ULTIMATE.start_main_~Blen~0_7, ULTIMATE.start_main_~Alen~0=v_ULTIMATE.start_main_~Alen~0_7, ULTIMATE.start_diff_~Blen=v_ULTIMATE.start_diff_~Blen_1, ULTIMATE.start_main_#t~malloc8.base=|v_ULTIMATE.start_main_#t~malloc8.base_4|, ULTIMATE.start_diff_#t~mem0=|v_ULTIMATE.start_diff_#t~mem0_1|, ULTIMATE.start_main_#t~malloc9.base=|v_ULTIMATE.start_main_#t~malloc9.base_4|, ULTIMATE.start_diff_#t~mem1=|v_ULTIMATE.start_diff_#t~mem1_1|, ULTIMATE.start_main_~A~0.base=v_ULTIMATE.start_main_~A~0.base_2, ULTIMATE.start_diff_#t~post4=|v_ULTIMATE.start_diff_#t~post4_1|, ULTIMATE.start_diff_~found~0=v_ULTIMATE.start_diff_~found~0_1, ULTIMATE.start_diff_#in~B.offset=|v_ULTIMATE.start_diff_#in~B.offset_1|, ULTIMATE.start_diff_~i~0=v_ULTIMATE.start_diff_~i~0_1, ULTIMATE.start_diff_~l1~0=v_ULTIMATE.start_diff_~l1~0_1, ULTIMATE.start_diff_#t~post5=|v_ULTIMATE.start_diff_#t~post5_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, ULTIMATE.start_main_#t~malloc10.base=|v_ULTIMATE.start_main_#t~malloc10.base_4|, ULTIMATE.start_diff_~D.offset=v_ULTIMATE.start_diff_~D.offset_1, ULTIMATE.start_diff_~l2~0=v_ULTIMATE.start_diff_~l2~0_1, ULTIMATE.start_diff_~j~0=v_ULTIMATE.start_diff_~j~0_1, ULTIMATE.start_main_#t~malloc8.offset=|v_ULTIMATE.start_main_#t~malloc8.offset_4|, #valid=|v_#valid_7|, ULTIMATE.start_diff_~k~0=v_ULTIMATE.start_diff_~k~0_1, ULTIMATE.start_diff_#in~D.base=|v_ULTIMATE.start_diff_#in~D.base_1|, ULTIMATE.start_diff_#t~post2=|v_ULTIMATE.start_diff_#t~post2_1|, ULTIMATE.start_diff_~A.offset=v_ULTIMATE.start_diff_~A.offset_1, ULTIMATE.start_main_~D~0.base=v_ULTIMATE.start_main_~D~0.base_2} AuxVars[] AssignedVars[ULTIMATE.start_diff_#in~A.base, ULTIMATE.start_diff_#in~B.base, ULTIMATE.start_diff_~B.offset, ULTIMATE.start_diff_~Alen, ULTIMATE.start_diff_~D.base, ULTIMATE.start_diff_#in~Blen, ULTIMATE.start_main_~B~0.offset, ULTIMATE.start_main_~B~0.base, ULTIMATE.start_diff_#in~A.offset, ULTIMATE.start_main_~D~0.offset, ULTIMATE.start_diff_#in~D.offset, ULTIMATE.start_diff_#in~Alen, ULTIMATE.start_diff_~A.base, ULTIMATE.start_diff_~B.base, #length, ULTIMATE.start_main_#t~malloc9.offset, ULTIMATE.start_diff_#t~mem3, ULTIMATE.start_main_~A~0.offset, ULTIMATE.start_main_#t~malloc10.offset, ULTIMATE.start_diff_~Blen, ULTIMATE.start_main_#t~malloc8.base, ULTIMATE.start_diff_#t~mem0, ULTIMATE.start_main_#t~malloc9.base, ULTIMATE.start_diff_#t~mem1, ULTIMATE.start_main_~A~0.base, ULTIMATE.start_diff_#t~post4, ULTIMATE.start_diff_~found~0, ULTIMATE.start_diff_#in~B.offset, ULTIMATE.start_diff_~i~0, ULTIMATE.start_diff_~l1~0, ULTIMATE.start_diff_#t~post5, ULTIMATE.start_main_#t~malloc10.base, ULTIMATE.start_diff_~D.offset, ULTIMATE.start_diff_~l2~0, ULTIMATE.start_diff_~j~0, ULTIMATE.start_main_#t~malloc8.offset, #valid, ULTIMATE.start_diff_~k~0, ULTIMATE.start_diff_#in~D.base, ULTIMATE.start_diff_#t~post2, ULTIMATE.start_diff_~A.offset, ULTIMATE.start_main_~D~0.base] 64#L13-2 72.80/34.78 [2019-03-28 12:50:28,608 INFO L796 eck$LassoCheckResult]: Loop: 64#L13-2 [91] L13-2-->L17-4: Formula: (and (< v_ULTIMATE.start_diff_~i~0_4 v_ULTIMATE.start_diff_~l1~0_4) (= v_ULTIMATE.start_diff_~j~0_2 0) (= v_ULTIMATE.start_diff_~found~0_3 0)) InVars {ULTIMATE.start_diff_~i~0=v_ULTIMATE.start_diff_~i~0_4, ULTIMATE.start_diff_~l1~0=v_ULTIMATE.start_diff_~l1~0_4} OutVars{ULTIMATE.start_diff_~found~0=v_ULTIMATE.start_diff_~found~0_3, ULTIMATE.start_diff_~i~0=v_ULTIMATE.start_diff_~i~0_4, ULTIMATE.start_diff_~l1~0=v_ULTIMATE.start_diff_~l1~0_4, ULTIMATE.start_diff_~j~0=v_ULTIMATE.start_diff_~j~0_2} AuxVars[] AssignedVars[ULTIMATE.start_diff_~found~0, ULTIMATE.start_diff_~j~0] 57#L17-4 [128] L17-4-->L16-2: Formula: (>= v_ULTIMATE.start_diff_~j~0_3 v_ULTIMATE.start_diff_~l2~0_3) InVars {ULTIMATE.start_diff_~l2~0=v_ULTIMATE.start_diff_~l2~0_3, ULTIMATE.start_diff_~j~0=v_ULTIMATE.start_diff_~j~0_3} OutVars{ULTIMATE.start_diff_~l2~0=v_ULTIMATE.start_diff_~l2~0_3, ULTIMATE.start_diff_~j~0=v_ULTIMATE.start_diff_~j~0_3} AuxVars[] AssignedVars[] 67#L16-2 [131] L16-2-->L23-1: Formula: (> 0 v_ULTIMATE.start_diff_~found~0_8) InVars {ULTIMATE.start_diff_~found~0=v_ULTIMATE.start_diff_~found~0_8} OutVars{ULTIMATE.start_diff_~found~0=v_ULTIMATE.start_diff_~found~0_8} AuxVars[] AssignedVars[] 65#L23-1 [74] L23-1-->L13-2: Formula: (= v_ULTIMATE.start_diff_~i~0_9 (+ v_ULTIMATE.start_diff_~i~0_10 1)) InVars {ULTIMATE.start_diff_~i~0=v_ULTIMATE.start_diff_~i~0_10} OutVars{ULTIMATE.start_diff_#t~post5=|v_ULTIMATE.start_diff_#t~post5_2|, ULTIMATE.start_diff_~i~0=v_ULTIMATE.start_diff_~i~0_9} AuxVars[] AssignedVars[ULTIMATE.start_diff_#t~post5, ULTIMATE.start_diff_~i~0] 64#L13-2 72.80/34.78 [2019-03-28 12:50:28,608 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 72.80/34.78 [2019-03-28 12:50:28,608 INFO L82 PathProgramCache]: Analyzing trace with hash 5467627, now seen corresponding path program 2 times 72.80/34.78 [2019-03-28 12:50:28,608 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 72.80/34.78 [2019-03-28 12:50:28,608 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 72.80/34.78 [2019-03-28 12:50:28,609 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 72.80/34.78 [2019-03-28 12:50:28,609 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 72.80/34.78 [2019-03-28 12:50:28,609 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 72.80/34.78 [2019-03-28 12:50:28,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 72.80/34.78 [2019-03-28 12:50:28,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 72.80/34.78 [2019-03-28 12:50:28,622 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 72.80/34.78 [2019-03-28 12:50:28,623 INFO L82 PathProgramCache]: Analyzing trace with hash 3761645, now seen corresponding path program 1 times 72.80/34.78 [2019-03-28 12:50:28,623 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 72.80/34.78 [2019-03-28 12:50:28,623 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 72.80/34.78 [2019-03-28 12:50:28,624 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 72.80/34.78 [2019-03-28 12:50:28,624 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY 72.80/34.78 [2019-03-28 12:50:28,624 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 72.80/34.78 [2019-03-28 12:50:28,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 72.80/34.78 [2019-03-28 12:50:28,631 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 72.80/34.78 [2019-03-28 12:50:28,631 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. 72.80/34.78 [2019-03-28 12:50:28,631 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 72.80/34.78 [2019-03-28 12:50:28,632 INFO L811 eck$LassoCheckResult]: loop already infeasible 72.80/34.78 [2019-03-28 12:50:28,632 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. 72.80/34.78 [2019-03-28 12:50:28,632 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 72.80/34.78 [2019-03-28 12:50:28,632 INFO L87 Difference]: Start difference. First operand 15 states and 34 transitions. cyclomatic complexity: 20 Second operand 3 states. 72.80/34.78 [2019-03-28 12:50:28,677 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. 72.80/34.78 [2019-03-28 12:50:28,677 INFO L93 Difference]: Finished difference Result 16 states and 31 transitions. 72.80/34.78 [2019-03-28 12:50:28,677 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 72.80/34.78 [2019-03-28 12:50:28,678 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 16 states and 31 transitions. 72.80/34.78 [2019-03-28 12:50:28,679 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 11 72.80/34.78 [2019-03-28 12:50:28,679 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 16 states to 16 states and 31 transitions. 72.80/34.78 [2019-03-28 12:50:28,679 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 16 72.80/34.78 [2019-03-28 12:50:28,680 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 16 72.80/34.78 [2019-03-28 12:50:28,680 INFO L73 IsDeterministic]: Start isDeterministic. Operand 16 states and 31 transitions. 72.80/34.78 [2019-03-28 12:50:28,680 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. 72.80/34.78 [2019-03-28 12:50:28,680 INFO L706 BuchiCegarLoop]: Abstraction has 16 states and 31 transitions. 72.80/34.78 [2019-03-28 12:50:28,680 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states and 31 transitions. 72.80/34.78 [2019-03-28 12:50:28,681 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 15. 72.80/34.78 [2019-03-28 12:50:28,681 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. 72.80/34.78 [2019-03-28 12:50:28,681 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 30 transitions. 72.80/34.78 [2019-03-28 12:50:28,682 INFO L729 BuchiCegarLoop]: Abstraction has 15 states and 30 transitions. 72.80/34.78 [2019-03-28 12:50:28,682 INFO L609 BuchiCegarLoop]: Abstraction has 15 states and 30 transitions. 72.80/34.78 [2019-03-28 12:50:28,682 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ 72.80/34.78 [2019-03-28 12:50:28,682 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 15 states and 30 transitions. 72.80/34.78 [2019-03-28 12:50:28,682 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 11 72.80/34.78 [2019-03-28 12:50:28,682 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false 72.80/34.78 [2019-03-28 12:50:28,683 INFO L119 BuchiIsEmpty]: Starting construction of run 72.80/34.78 [2019-03-28 12:50:28,683 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] 72.80/34.78 [2019-03-28 12:50:28,683 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] 72.80/34.78 [2019-03-28 12:50:28,684 INFO L794 eck$LassoCheckResult]: Stem: 97#ULTIMATE.startENTRY [150] ULTIMATE.startENTRY-->L34: Formula: (and (= |v_#NULL.offset_2| 0) (= (store |v_#valid_20| 0 0) |v_#valid_19|) (= 0 |v_#NULL.base_2|)) InVars {#valid=|v_#valid_20|} OutVars{ULTIMATE.start_main_#t~malloc8.base=|v_ULTIMATE.start_main_#t~malloc8.base_5|, ULTIMATE.start_main_#t~malloc9.base=|v_ULTIMATE.start_main_#t~malloc9.base_5|, ULTIMATE.start_main_~A~0.base=v_ULTIMATE.start_main_~A~0.base_3, ULTIMATE.start_main_~B~0.offset=v_ULTIMATE.start_main_~B~0.offset_3, #NULL.offset=|v_#NULL.offset_2|, ULTIMATE.start_main_#t~nondet6=|v_ULTIMATE.start_main_#t~nondet6_6|, ULTIMATE.start_main_#t~nondet7=|v_ULTIMATE.start_main_#t~nondet7_6|, ULTIMATE.start_main_~B~0.base=v_ULTIMATE.start_main_~B~0.base_3, #NULL.base=|v_#NULL.base_2|, ULTIMATE.start_main_~D~0.offset=v_ULTIMATE.start_main_~D~0.offset_3, ULTIMATE.start_main_#t~malloc10.base=|v_ULTIMATE.start_main_#t~malloc10.base_5|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_4|, ULTIMATE.start_main_#t~malloc8.offset=|v_ULTIMATE.start_main_#t~malloc8.offset_5|, #valid=|v_#valid_19|, ULTIMATE.start_main_#t~malloc9.offset=|v_ULTIMATE.start_main_#t~malloc9.offset_5|, ULTIMATE.start_main_~D~0.base=v_ULTIMATE.start_main_~D~0.base_3, ULTIMATE.start_main_~A~0.offset=v_ULTIMATE.start_main_~A~0.offset_3, ULTIMATE.start_main_~Blen~0=v_ULTIMATE.start_main_~Blen~0_8, ULTIMATE.start_main_~Alen~0=v_ULTIMATE.start_main_~Alen~0_8, ULTIMATE.start_main_#t~malloc10.offset=|v_ULTIMATE.start_main_#t~malloc10.offset_5|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~malloc8.base, ULTIMATE.start_main_#t~malloc9.base, ULTIMATE.start_main_~A~0.base, ULTIMATE.start_main_~B~0.offset, #NULL.offset, ULTIMATE.start_main_#t~nondet6, ULTIMATE.start_main_#t~nondet7, ULTIMATE.start_main_~B~0.base, #NULL.base, ULTIMATE.start_main_~D~0.offset, ULTIMATE.start_main_#t~malloc10.base, ULTIMATE.start_main_#res, ULTIMATE.start_main_#t~malloc8.offset, #valid, ULTIMATE.start_main_#t~malloc9.offset, ULTIMATE.start_main_~D~0.base, ULTIMATE.start_main_~A~0.offset, ULTIMATE.start_main_~Blen~0, ULTIMATE.start_main_~Alen~0, ULTIMATE.start_main_#t~malloc10.offset] 98#L34 [75] L34-->L34-2: Formula: (and (< v_ULTIMATE.start_main_~Alen~0_5 1) (= v_ULTIMATE.start_main_~Alen~0_4 1)) InVars {ULTIMATE.start_main_~Alen~0=v_ULTIMATE.start_main_~Alen~0_5} OutVars{ULTIMATE.start_main_~Alen~0=v_ULTIMATE.start_main_~Alen~0_4} AuxVars[] AssignedVars[ULTIMATE.start_main_~Alen~0] 99#L34-2 [105] L34-2-->L37-1: Formula: (>= v_ULTIMATE.start_main_~Blen~0_6 1) InVars {ULTIMATE.start_main_~Blen~0=v_ULTIMATE.start_main_~Blen~0_6} OutVars{ULTIMATE.start_main_~Blen~0=v_ULTIMATE.start_main_~Blen~0_6} AuxVars[] AssignedVars[] 100#L37-1 [126] L37-1-->L13-2: Formula: (let ((.cse2 (store |v_#valid_10| |v_ULTIMATE.start_main_#t~malloc8.base_4| 1))) (let ((.cse0 (store .cse2 |v_ULTIMATE.start_main_#t~malloc9.base_4| 1))) (and (= v_ULTIMATE.start_diff_~k~0_1 0) (= v_ULTIMATE.start_diff_~l2~0_1 v_ULTIMATE.start_diff_~Blen_1) (= v_ULTIMATE.start_diff_~A.base_1 |v_ULTIMATE.start_diff_#in~A.base_1|) (= |v_#valid_7| (store .cse0 |v_ULTIMATE.start_main_#t~malloc10.base_4| 1)) (< |v_ULTIMATE.start_main_#t~malloc10.base_4| |v_#StackHeapBarrier_1|) (= v_ULTIMATE.start_diff_~Blen_1 |v_ULTIMATE.start_diff_#in~Blen_1|) (= v_ULTIMATE.start_diff_~B.base_1 |v_ULTIMATE.start_diff_#in~B.base_1|) (= v_ULTIMATE.start_diff_~Alen_1 |v_ULTIMATE.start_diff_#in~Alen_1|) (= v_ULTIMATE.start_main_~B~0.offset_2 |v_ULTIMATE.start_main_#t~malloc9.offset_4|) (= v_ULTIMATE.start_main_~B~0.base_2 |v_ULTIMATE.start_main_#t~malloc9.base_4|) (= |v_ULTIMATE.start_diff_#in~A.base_1| v_ULTIMATE.start_main_~A~0.base_2) (= |v_ULTIMATE.start_main_#t~malloc8.offset_4| 0) (> |v_ULTIMATE.start_main_#t~malloc10.base_4| 0) (= |v_#length_1| (let ((.cse1 (* 4 v_ULTIMATE.start_main_~Alen~0_7))) (store (store (store |v_#length_4| |v_ULTIMATE.start_main_#t~malloc8.base_4| .cse1) |v_ULTIMATE.start_main_#t~malloc9.base_4| (* 4 v_ULTIMATE.start_main_~Blen~0_7)) |v_ULTIMATE.start_main_#t~malloc10.base_4| .cse1))) (= v_ULTIMATE.start_diff_~D.base_1 |v_ULTIMATE.start_diff_#in~D.base_1|) (= |v_ULTIMATE.start_main_#t~malloc9.offset_4| 0) (= |v_ULTIMATE.start_diff_#in~B.offset_1| v_ULTIMATE.start_main_~B~0.offset_2) (= |v_ULTIMATE.start_diff_#in~A.offset_1| v_ULTIMATE.start_main_~A~0.offset_2) (= v_ULTIMATE.start_diff_~B.offset_1 |v_ULTIMATE.start_diff_#in~B.offset_1|) (= v_ULTIMATE.start_main_~A~0.base_2 |v_ULTIMATE.start_main_#t~malloc8.base_4|) (< |v_ULTIMATE.start_main_#t~malloc8.base_4| |v_#StackHeapBarrier_1|) (= |v_ULTIMATE.start_diff_#in~B.base_1| v_ULTIMATE.start_main_~B~0.base_2) (< 0 |v_ULTIMATE.start_main_#t~malloc9.base_4|) (< |v_ULTIMATE.start_main_#t~malloc9.base_4| |v_#StackHeapBarrier_1|) (= |v_ULTIMATE.start_diff_#in~D.offset_1| v_ULTIMATE.start_main_~D~0.offset_2) (= v_ULTIMATE.start_main_~D~0.offset_2 |v_ULTIMATE.start_main_#t~malloc10.offset_4|) (= v_ULTIMATE.start_diff_~i~0_1 0) (= 0 (select .cse2 |v_ULTIMATE.start_main_#t~malloc9.base_4|)) (= v_ULTIMATE.start_main_~D~0.base_2 |v_ULTIMATE.start_main_#t~malloc10.base_4|) (= |v_ULTIMATE.start_diff_#in~Blen_1| v_ULTIMATE.start_main_~Blen~0_7) (= v_ULTIMATE.start_diff_~l1~0_1 v_ULTIMATE.start_diff_~Alen_1) (= 0 (select .cse0 |v_ULTIMATE.start_main_#t~malloc10.base_4|)) (= (select |v_#valid_10| |v_ULTIMATE.start_main_#t~malloc8.base_4|) 0) (= v_ULTIMATE.start_diff_~A.offset_1 |v_ULTIMATE.start_diff_#in~A.offset_1|) (< |v_ULTIMATE.start_main_#t~malloc8.base_4| 0) (= |v_ULTIMATE.start_diff_#in~Alen_1| v_ULTIMATE.start_main_~Alen~0_7) (= v_ULTIMATE.start_main_~A~0.offset_2 |v_ULTIMATE.start_main_#t~malloc8.offset_4|) (= |v_ULTIMATE.start_main_#t~malloc10.offset_4| 0) (= |v_ULTIMATE.start_diff_#in~D.base_1| v_ULTIMATE.start_main_~D~0.base_2) (= v_ULTIMATE.start_diff_~D.offset_1 |v_ULTIMATE.start_diff_#in~D.offset_1|)))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_4|, #valid=|v_#valid_10|, ULTIMATE.start_main_~Blen~0=v_ULTIMATE.start_main_~Blen~0_7, ULTIMATE.start_main_~Alen~0=v_ULTIMATE.start_main_~Alen~0_7} OutVars{ULTIMATE.start_diff_#in~A.base=|v_ULTIMATE.start_diff_#in~A.base_1|, ULTIMATE.start_diff_#in~B.base=|v_ULTIMATE.start_diff_#in~B.base_1|, ULTIMATE.start_diff_~B.offset=v_ULTIMATE.start_diff_~B.offset_1, ULTIMATE.start_diff_~Alen=v_ULTIMATE.start_diff_~Alen_1, ULTIMATE.start_diff_~D.base=v_ULTIMATE.start_diff_~D.base_1, ULTIMATE.start_diff_#in~Blen=|v_ULTIMATE.start_diff_#in~Blen_1|, ULTIMATE.start_main_~B~0.offset=v_ULTIMATE.start_main_~B~0.offset_2, ULTIMATE.start_main_~B~0.base=v_ULTIMATE.start_main_~B~0.base_2, ULTIMATE.start_diff_#in~A.offset=|v_ULTIMATE.start_diff_#in~A.offset_1|, ULTIMATE.start_main_~D~0.offset=v_ULTIMATE.start_main_~D~0.offset_2, ULTIMATE.start_diff_#in~D.offset=|v_ULTIMATE.start_diff_#in~D.offset_1|, ULTIMATE.start_diff_#in~Alen=|v_ULTIMATE.start_diff_#in~Alen_1|, ULTIMATE.start_diff_~A.base=v_ULTIMATE.start_diff_~A.base_1, ULTIMATE.start_diff_~B.base=v_ULTIMATE.start_diff_~B.base_1, #length=|v_#length_1|, ULTIMATE.start_main_#t~malloc9.offset=|v_ULTIMATE.start_main_#t~malloc9.offset_4|, ULTIMATE.start_diff_#t~mem3=|v_ULTIMATE.start_diff_#t~mem3_1|, ULTIMATE.start_main_~A~0.offset=v_ULTIMATE.start_main_~A~0.offset_2, ULTIMATE.start_main_#t~malloc10.offset=|v_ULTIMATE.start_main_#t~malloc10.offset_4|, ULTIMATE.start_main_~Blen~0=v_ULTIMATE.start_main_~Blen~0_7, ULTIMATE.start_main_~Alen~0=v_ULTIMATE.start_main_~Alen~0_7, ULTIMATE.start_diff_~Blen=v_ULTIMATE.start_diff_~Blen_1, ULTIMATE.start_main_#t~malloc8.base=|v_ULTIMATE.start_main_#t~malloc8.base_4|, ULTIMATE.start_diff_#t~mem0=|v_ULTIMATE.start_diff_#t~mem0_1|, ULTIMATE.start_main_#t~malloc9.base=|v_ULTIMATE.start_main_#t~malloc9.base_4|, ULTIMATE.start_diff_#t~mem1=|v_ULTIMATE.start_diff_#t~mem1_1|, ULTIMATE.start_main_~A~0.base=v_ULTIMATE.start_main_~A~0.base_2, ULTIMATE.start_diff_#t~post4=|v_ULTIMATE.start_diff_#t~post4_1|, ULTIMATE.start_diff_~found~0=v_ULTIMATE.start_diff_~found~0_1, ULTIMATE.start_diff_#in~B.offset=|v_ULTIMATE.start_diff_#in~B.offset_1|, ULTIMATE.start_diff_~i~0=v_ULTIMATE.start_diff_~i~0_1, ULTIMATE.start_diff_~l1~0=v_ULTIMATE.start_diff_~l1~0_1, ULTIMATE.start_diff_#t~post5=|v_ULTIMATE.start_diff_#t~post5_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, ULTIMATE.start_main_#t~malloc10.base=|v_ULTIMATE.start_main_#t~malloc10.base_4|, ULTIMATE.start_diff_~D.offset=v_ULTIMATE.start_diff_~D.offset_1, ULTIMATE.start_diff_~l2~0=v_ULTIMATE.start_diff_~l2~0_1, ULTIMATE.start_diff_~j~0=v_ULTIMATE.start_diff_~j~0_1, ULTIMATE.start_main_#t~malloc8.offset=|v_ULTIMATE.start_main_#t~malloc8.offset_4|, #valid=|v_#valid_7|, ULTIMATE.start_diff_~k~0=v_ULTIMATE.start_diff_~k~0_1, ULTIMATE.start_diff_#in~D.base=|v_ULTIMATE.start_diff_#in~D.base_1|, ULTIMATE.start_diff_#t~post2=|v_ULTIMATE.start_diff_#t~post2_1|, ULTIMATE.start_diff_~A.offset=v_ULTIMATE.start_diff_~A.offset_1, ULTIMATE.start_main_~D~0.base=v_ULTIMATE.start_main_~D~0.base_2} AuxVars[] AssignedVars[ULTIMATE.start_diff_#in~A.base, ULTIMATE.start_diff_#in~B.base, ULTIMATE.start_diff_~B.offset, ULTIMATE.start_diff_~Alen, ULTIMATE.start_diff_~D.base, ULTIMATE.start_diff_#in~Blen, ULTIMATE.start_main_~B~0.offset, ULTIMATE.start_main_~B~0.base, ULTIMATE.start_diff_#in~A.offset, ULTIMATE.start_main_~D~0.offset, ULTIMATE.start_diff_#in~D.offset, ULTIMATE.start_diff_#in~Alen, ULTIMATE.start_diff_~A.base, ULTIMATE.start_diff_~B.base, #length, ULTIMATE.start_main_#t~malloc9.offset, ULTIMATE.start_diff_#t~mem3, ULTIMATE.start_main_~A~0.offset, ULTIMATE.start_main_#t~malloc10.offset, ULTIMATE.start_diff_~Blen, ULTIMATE.start_main_#t~malloc8.base, ULTIMATE.start_diff_#t~mem0, ULTIMATE.start_main_#t~malloc9.base, ULTIMATE.start_diff_#t~mem1, ULTIMATE.start_main_~A~0.base, ULTIMATE.start_diff_#t~post4, ULTIMATE.start_diff_~found~0, ULTIMATE.start_diff_#in~B.offset, ULTIMATE.start_diff_~i~0, ULTIMATE.start_diff_~l1~0, ULTIMATE.start_diff_#t~post5, ULTIMATE.start_main_#t~malloc10.base, ULTIMATE.start_diff_~D.offset, ULTIMATE.start_diff_~l2~0, ULTIMATE.start_diff_~j~0, ULTIMATE.start_main_#t~malloc8.offset, #valid, ULTIMATE.start_diff_~k~0, ULTIMATE.start_diff_#in~D.base, ULTIMATE.start_diff_#t~post2, ULTIMATE.start_diff_~A.offset, ULTIMATE.start_main_~D~0.base] 101#L13-2 72.80/34.78 [2019-03-28 12:50:28,684 INFO L796 eck$LassoCheckResult]: Loop: 101#L13-2 [91] L13-2-->L17-4: Formula: (and (< v_ULTIMATE.start_diff_~i~0_4 v_ULTIMATE.start_diff_~l1~0_4) (= v_ULTIMATE.start_diff_~j~0_2 0) (= v_ULTIMATE.start_diff_~found~0_3 0)) InVars {ULTIMATE.start_diff_~i~0=v_ULTIMATE.start_diff_~i~0_4, ULTIMATE.start_diff_~l1~0=v_ULTIMATE.start_diff_~l1~0_4} OutVars{ULTIMATE.start_diff_~found~0=v_ULTIMATE.start_diff_~found~0_3, ULTIMATE.start_diff_~i~0=v_ULTIMATE.start_diff_~i~0_4, ULTIMATE.start_diff_~l1~0=v_ULTIMATE.start_diff_~l1~0_4, ULTIMATE.start_diff_~j~0=v_ULTIMATE.start_diff_~j~0_2} AuxVars[] AssignedVars[ULTIMATE.start_diff_~found~0, ULTIMATE.start_diff_~j~0] 94#L17-4 [128] L17-4-->L16-2: Formula: (>= v_ULTIMATE.start_diff_~j~0_3 v_ULTIMATE.start_diff_~l2~0_3) InVars {ULTIMATE.start_diff_~l2~0=v_ULTIMATE.start_diff_~l2~0_3, ULTIMATE.start_diff_~j~0=v_ULTIMATE.start_diff_~j~0_3} OutVars{ULTIMATE.start_diff_~l2~0=v_ULTIMATE.start_diff_~l2~0_3, ULTIMATE.start_diff_~j~0=v_ULTIMATE.start_diff_~j~0_3} AuxVars[] AssignedVars[] 104#L16-2 [78] L16-2-->L24: Formula: (= 0 v_ULTIMATE.start_diff_~found~0_7) InVars {ULTIMATE.start_diff_~found~0=v_ULTIMATE.start_diff_~found~0_7} OutVars{ULTIMATE.start_diff_~found~0=v_ULTIMATE.start_diff_~found~0_7} AuxVars[] AssignedVars[] 105#L24 [100] L24-->L24-1: Formula: (let ((.cse0 (* 4 v_ULTIMATE.start_diff_~i~0_7))) (let ((.cse1 (+ .cse0 v_ULTIMATE.start_diff_~A.offset_5))) (and (<= (+ .cse0 v_ULTIMATE.start_diff_~A.offset_5 4) (select |v_#length_9| v_ULTIMATE.start_diff_~A.base_6)) (= (select |v_#valid_15| v_ULTIMATE.start_diff_~A.base_6) 1) (<= 0 .cse1) (= (select (select |v_#memory_int_3| v_ULTIMATE.start_diff_~A.base_6) .cse1) |v_ULTIMATE.start_diff_#t~mem3_2|)))) InVars {ULTIMATE.start_diff_~i~0=v_ULTIMATE.start_diff_~i~0_7, ULTIMATE.start_diff_~A.base=v_ULTIMATE.start_diff_~A.base_6, #valid=|v_#valid_15|, #memory_int=|v_#memory_int_3|, #length=|v_#length_9|, ULTIMATE.start_diff_~A.offset=v_ULTIMATE.start_diff_~A.offset_5} OutVars{ULTIMATE.start_diff_~i~0=v_ULTIMATE.start_diff_~i~0_7, ULTIMATE.start_diff_~A.base=v_ULTIMATE.start_diff_~A.base_6, #valid=|v_#valid_15|, #memory_int=|v_#memory_int_3|, #length=|v_#length_9|, ULTIMATE.start_diff_~A.offset=v_ULTIMATE.start_diff_~A.offset_5, ULTIMATE.start_diff_#t~mem3=|v_ULTIMATE.start_diff_#t~mem3_2|} AuxVars[] AssignedVars[ULTIMATE.start_diff_#t~mem3] 103#L24-1 [154] L24-1-->L23-1: Formula: (let ((.cse1 (* 4 v_ULTIMATE.start_diff_~k~0_8))) (let ((.cse0 (+ .cse1 v_ULTIMATE.start_diff_~D.offset_5))) (and (= (store |v_#memory_int_7| v_ULTIMATE.start_diff_~D.base_6 (store (select |v_#memory_int_7| v_ULTIMATE.start_diff_~D.base_6) .cse0 |v_ULTIMATE.start_diff_#t~mem3_6|)) |v_#memory_int_6|) (= (select |v_#valid_27| v_ULTIMATE.start_diff_~D.base_6) 1) (<= (+ .cse1 v_ULTIMATE.start_diff_~D.offset_5 4) (select |v_#length_13| v_ULTIMATE.start_diff_~D.base_6)) (<= 0 .cse0) (= v_ULTIMATE.start_diff_~k~0_7 (+ v_ULTIMATE.start_diff_~k~0_8 1))))) InVars {ULTIMATE.start_diff_~D.offset=v_ULTIMATE.start_diff_~D.offset_5, ULTIMATE.start_diff_~D.base=v_ULTIMATE.start_diff_~D.base_6, ULTIMATE.start_diff_~k~0=v_ULTIMATE.start_diff_~k~0_8, #valid=|v_#valid_27|, #memory_int=|v_#memory_int_7|, #length=|v_#length_13|, ULTIMATE.start_diff_#t~mem3=|v_ULTIMATE.start_diff_#t~mem3_6|} OutVars{ULTIMATE.start_diff_#t~post4=|v_ULTIMATE.start_diff_#t~post4_4|, ULTIMATE.start_diff_~D.offset=v_ULTIMATE.start_diff_~D.offset_5, ULTIMATE.start_diff_~D.base=v_ULTIMATE.start_diff_~D.base_6, ULTIMATE.start_diff_~k~0=v_ULTIMATE.start_diff_~k~0_7, #valid=|v_#valid_27|, #memory_int=|v_#memory_int_6|, #length=|v_#length_13|, ULTIMATE.start_diff_#t~mem3=|v_ULTIMATE.start_diff_#t~mem3_5|} AuxVars[] AssignedVars[ULTIMATE.start_diff_#t~post4, ULTIMATE.start_diff_~k~0, #memory_int, ULTIMATE.start_diff_#t~mem3] 102#L23-1 [74] L23-1-->L13-2: Formula: (= v_ULTIMATE.start_diff_~i~0_9 (+ v_ULTIMATE.start_diff_~i~0_10 1)) InVars {ULTIMATE.start_diff_~i~0=v_ULTIMATE.start_diff_~i~0_10} OutVars{ULTIMATE.start_diff_#t~post5=|v_ULTIMATE.start_diff_#t~post5_2|, ULTIMATE.start_diff_~i~0=v_ULTIMATE.start_diff_~i~0_9} AuxVars[] AssignedVars[ULTIMATE.start_diff_#t~post5, ULTIMATE.start_diff_~i~0] 101#L13-2 72.80/34.78 [2019-03-28 12:50:28,684 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 72.80/34.78 [2019-03-28 12:50:28,685 INFO L82 PathProgramCache]: Analyzing trace with hash 5467627, now seen corresponding path program 3 times 72.80/34.78 [2019-03-28 12:50:28,685 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 72.80/34.78 [2019-03-28 12:50:28,685 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 72.80/34.78 [2019-03-28 12:50:28,686 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 72.80/34.78 [2019-03-28 12:50:28,686 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 72.80/34.78 [2019-03-28 12:50:28,686 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 72.80/34.78 [2019-03-28 12:50:28,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 72.80/34.78 [2019-03-28 12:50:28,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 72.80/34.78 [2019-03-28 12:50:28,700 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 72.80/34.78 [2019-03-28 12:50:28,700 INFO L82 PathProgramCache]: Analyzing trace with hash -681575540, now seen corresponding path program 1 times 72.80/34.78 [2019-03-28 12:50:28,700 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 72.80/34.78 [2019-03-28 12:50:28,701 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 72.80/34.78 [2019-03-28 12:50:28,701 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 72.80/34.78 [2019-03-28 12:50:28,701 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY 72.80/34.78 [2019-03-28 12:50:28,701 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 72.80/34.78 [2019-03-28 12:50:28,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 72.80/34.78 [2019-03-28 12:50:28,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 72.80/34.78 [2019-03-28 12:50:28,709 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 72.80/34.78 [2019-03-28 12:50:28,709 INFO L82 PathProgramCache]: Analyzing trace with hash 1864356342, now seen corresponding path program 1 times 72.80/34.78 [2019-03-28 12:50:28,709 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 72.80/34.78 [2019-03-28 12:50:28,710 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 72.80/34.78 [2019-03-28 12:50:28,710 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 72.80/34.78 [2019-03-28 12:50:28,710 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 72.80/34.78 [2019-03-28 12:50:28,711 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 72.80/34.78 [2019-03-28 12:50:28,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 72.80/34.78 [2019-03-28 12:50:28,737 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 72.80/34.78 [2019-03-28 12:50:28,737 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. 72.80/34.78 [2019-03-28 12:50:28,737 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 72.80/34.78 [2019-03-28 12:50:28,815 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. 72.80/34.78 [2019-03-28 12:50:28,815 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 72.80/34.78 [2019-03-28 12:50:28,830 INFO L87 Difference]: Start difference. First operand 15 states and 30 transitions. cyclomatic complexity: 16 Second operand 5 states. 72.80/34.78 [2019-03-28 12:50:28,899 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. 72.80/34.78 [2019-03-28 12:50:28,899 INFO L93 Difference]: Finished difference Result 25 states and 44 transitions. 72.80/34.78 [2019-03-28 12:50:28,900 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. 72.80/34.78 [2019-03-28 12:50:28,900 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 25 states and 44 transitions. 72.80/34.78 [2019-03-28 12:50:28,901 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 21 72.80/34.78 [2019-03-28 12:50:28,901 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 25 states to 25 states and 44 transitions. 72.80/34.78 [2019-03-28 12:50:28,902 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 25 72.80/34.78 [2019-03-28 12:50:28,902 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 25 72.80/34.78 [2019-03-28 12:50:28,902 INFO L73 IsDeterministic]: Start isDeterministic. Operand 25 states and 44 transitions. 72.80/34.78 [2019-03-28 12:50:28,902 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. 72.80/34.78 [2019-03-28 12:50:28,902 INFO L706 BuchiCegarLoop]: Abstraction has 25 states and 44 transitions. 72.80/34.78 [2019-03-28 12:50:28,902 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states and 44 transitions. 72.80/34.78 [2019-03-28 12:50:28,903 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 20. 72.80/34.78 [2019-03-28 12:50:28,903 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. 72.80/34.78 [2019-03-28 12:50:28,904 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 38 transitions. 72.80/34.78 [2019-03-28 12:50:28,904 INFO L729 BuchiCegarLoop]: Abstraction has 20 states and 38 transitions. 72.80/34.78 [2019-03-28 12:50:28,904 INFO L609 BuchiCegarLoop]: Abstraction has 20 states and 38 transitions. 72.80/34.78 [2019-03-28 12:50:28,904 INFO L442 BuchiCegarLoop]: ======== Iteration 4============ 72.80/34.78 [2019-03-28 12:50:28,904 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 20 states and 38 transitions. 72.80/34.78 [2019-03-28 12:50:28,905 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 16 72.80/34.78 [2019-03-28 12:50:28,905 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false 72.80/34.78 [2019-03-28 12:50:28,905 INFO L119 BuchiIsEmpty]: Starting construction of run 72.80/34.78 [2019-03-28 12:50:28,905 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] 72.80/34.78 [2019-03-28 12:50:28,905 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1] 72.80/34.78 [2019-03-28 12:50:28,906 INFO L794 eck$LassoCheckResult]: Stem: 151#ULTIMATE.startENTRY [150] ULTIMATE.startENTRY-->L34: Formula: (and (= |v_#NULL.offset_2| 0) (= (store |v_#valid_20| 0 0) |v_#valid_19|) (= 0 |v_#NULL.base_2|)) InVars {#valid=|v_#valid_20|} OutVars{ULTIMATE.start_main_#t~malloc8.base=|v_ULTIMATE.start_main_#t~malloc8.base_5|, ULTIMATE.start_main_#t~malloc9.base=|v_ULTIMATE.start_main_#t~malloc9.base_5|, ULTIMATE.start_main_~A~0.base=v_ULTIMATE.start_main_~A~0.base_3, ULTIMATE.start_main_~B~0.offset=v_ULTIMATE.start_main_~B~0.offset_3, #NULL.offset=|v_#NULL.offset_2|, ULTIMATE.start_main_#t~nondet6=|v_ULTIMATE.start_main_#t~nondet6_6|, ULTIMATE.start_main_#t~nondet7=|v_ULTIMATE.start_main_#t~nondet7_6|, ULTIMATE.start_main_~B~0.base=v_ULTIMATE.start_main_~B~0.base_3, #NULL.base=|v_#NULL.base_2|, ULTIMATE.start_main_~D~0.offset=v_ULTIMATE.start_main_~D~0.offset_3, ULTIMATE.start_main_#t~malloc10.base=|v_ULTIMATE.start_main_#t~malloc10.base_5|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_4|, ULTIMATE.start_main_#t~malloc8.offset=|v_ULTIMATE.start_main_#t~malloc8.offset_5|, #valid=|v_#valid_19|, ULTIMATE.start_main_#t~malloc9.offset=|v_ULTIMATE.start_main_#t~malloc9.offset_5|, ULTIMATE.start_main_~D~0.base=v_ULTIMATE.start_main_~D~0.base_3, ULTIMATE.start_main_~A~0.offset=v_ULTIMATE.start_main_~A~0.offset_3, ULTIMATE.start_main_~Blen~0=v_ULTIMATE.start_main_~Blen~0_8, ULTIMATE.start_main_~Alen~0=v_ULTIMATE.start_main_~Alen~0_8, ULTIMATE.start_main_#t~malloc10.offset=|v_ULTIMATE.start_main_#t~malloc10.offset_5|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~malloc8.base, ULTIMATE.start_main_#t~malloc9.base, ULTIMATE.start_main_~A~0.base, ULTIMATE.start_main_~B~0.offset, #NULL.offset, ULTIMATE.start_main_#t~nondet6, ULTIMATE.start_main_#t~nondet7, ULTIMATE.start_main_~B~0.base, #NULL.base, ULTIMATE.start_main_~D~0.offset, ULTIMATE.start_main_#t~malloc10.base, ULTIMATE.start_main_#res, ULTIMATE.start_main_#t~malloc8.offset, #valid, ULTIMATE.start_main_#t~malloc9.offset, ULTIMATE.start_main_~D~0.base, ULTIMATE.start_main_~A~0.offset, ULTIMATE.start_main_~Blen~0, ULTIMATE.start_main_~Alen~0, ULTIMATE.start_main_#t~malloc10.offset] 152#L34 [75] L34-->L34-2: Formula: (and (< v_ULTIMATE.start_main_~Alen~0_5 1) (= v_ULTIMATE.start_main_~Alen~0_4 1)) InVars {ULTIMATE.start_main_~Alen~0=v_ULTIMATE.start_main_~Alen~0_5} OutVars{ULTIMATE.start_main_~Alen~0=v_ULTIMATE.start_main_~Alen~0_4} AuxVars[] AssignedVars[ULTIMATE.start_main_~Alen~0] 153#L34-2 [105] L34-2-->L37-1: Formula: (>= v_ULTIMATE.start_main_~Blen~0_6 1) InVars {ULTIMATE.start_main_~Blen~0=v_ULTIMATE.start_main_~Blen~0_6} OutVars{ULTIMATE.start_main_~Blen~0=v_ULTIMATE.start_main_~Blen~0_6} AuxVars[] AssignedVars[] 154#L37-1 [126] L37-1-->L13-2: Formula: (let ((.cse2 (store |v_#valid_10| |v_ULTIMATE.start_main_#t~malloc8.base_4| 1))) (let ((.cse0 (store .cse2 |v_ULTIMATE.start_main_#t~malloc9.base_4| 1))) (and (= v_ULTIMATE.start_diff_~k~0_1 0) (= v_ULTIMATE.start_diff_~l2~0_1 v_ULTIMATE.start_diff_~Blen_1) (= v_ULTIMATE.start_diff_~A.base_1 |v_ULTIMATE.start_diff_#in~A.base_1|) (= |v_#valid_7| (store .cse0 |v_ULTIMATE.start_main_#t~malloc10.base_4| 1)) (< |v_ULTIMATE.start_main_#t~malloc10.base_4| |v_#StackHeapBarrier_1|) (= v_ULTIMATE.start_diff_~Blen_1 |v_ULTIMATE.start_diff_#in~Blen_1|) (= v_ULTIMATE.start_diff_~B.base_1 |v_ULTIMATE.start_diff_#in~B.base_1|) (= v_ULTIMATE.start_diff_~Alen_1 |v_ULTIMATE.start_diff_#in~Alen_1|) (= v_ULTIMATE.start_main_~B~0.offset_2 |v_ULTIMATE.start_main_#t~malloc9.offset_4|) (= v_ULTIMATE.start_main_~B~0.base_2 |v_ULTIMATE.start_main_#t~malloc9.base_4|) (= |v_ULTIMATE.start_diff_#in~A.base_1| v_ULTIMATE.start_main_~A~0.base_2) (= |v_ULTIMATE.start_main_#t~malloc8.offset_4| 0) (> |v_ULTIMATE.start_main_#t~malloc10.base_4| 0) (= |v_#length_1| (let ((.cse1 (* 4 v_ULTIMATE.start_main_~Alen~0_7))) (store (store (store |v_#length_4| |v_ULTIMATE.start_main_#t~malloc8.base_4| .cse1) |v_ULTIMATE.start_main_#t~malloc9.base_4| (* 4 v_ULTIMATE.start_main_~Blen~0_7)) |v_ULTIMATE.start_main_#t~malloc10.base_4| .cse1))) (= v_ULTIMATE.start_diff_~D.base_1 |v_ULTIMATE.start_diff_#in~D.base_1|) (= |v_ULTIMATE.start_main_#t~malloc9.offset_4| 0) (= |v_ULTIMATE.start_diff_#in~B.offset_1| v_ULTIMATE.start_main_~B~0.offset_2) (= |v_ULTIMATE.start_diff_#in~A.offset_1| v_ULTIMATE.start_main_~A~0.offset_2) (= v_ULTIMATE.start_diff_~B.offset_1 |v_ULTIMATE.start_diff_#in~B.offset_1|) (= v_ULTIMATE.start_main_~A~0.base_2 |v_ULTIMATE.start_main_#t~malloc8.base_4|) (< |v_ULTIMATE.start_main_#t~malloc8.base_4| |v_#StackHeapBarrier_1|) (= |v_ULTIMATE.start_diff_#in~B.base_1| v_ULTIMATE.start_main_~B~0.base_2) (< 0 |v_ULTIMATE.start_main_#t~malloc9.base_4|) (< |v_ULTIMATE.start_main_#t~malloc9.base_4| |v_#StackHeapBarrier_1|) (= |v_ULTIMATE.start_diff_#in~D.offset_1| v_ULTIMATE.start_main_~D~0.offset_2) (= v_ULTIMATE.start_main_~D~0.offset_2 |v_ULTIMATE.start_main_#t~malloc10.offset_4|) (= v_ULTIMATE.start_diff_~i~0_1 0) (= 0 (select .cse2 |v_ULTIMATE.start_main_#t~malloc9.base_4|)) (= v_ULTIMATE.start_main_~D~0.base_2 |v_ULTIMATE.start_main_#t~malloc10.base_4|) (= |v_ULTIMATE.start_diff_#in~Blen_1| v_ULTIMATE.start_main_~Blen~0_7) (= v_ULTIMATE.start_diff_~l1~0_1 v_ULTIMATE.start_diff_~Alen_1) (= 0 (select .cse0 |v_ULTIMATE.start_main_#t~malloc10.base_4|)) (= (select |v_#valid_10| |v_ULTIMATE.start_main_#t~malloc8.base_4|) 0) (= v_ULTIMATE.start_diff_~A.offset_1 |v_ULTIMATE.start_diff_#in~A.offset_1|) (< |v_ULTIMATE.start_main_#t~malloc8.base_4| 0) (= |v_ULTIMATE.start_diff_#in~Alen_1| v_ULTIMATE.start_main_~Alen~0_7) (= v_ULTIMATE.start_main_~A~0.offset_2 |v_ULTIMATE.start_main_#t~malloc8.offset_4|) (= |v_ULTIMATE.start_main_#t~malloc10.offset_4| 0) (= |v_ULTIMATE.start_diff_#in~D.base_1| v_ULTIMATE.start_main_~D~0.base_2) (= v_ULTIMATE.start_diff_~D.offset_1 |v_ULTIMATE.start_diff_#in~D.offset_1|)))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_4|, #valid=|v_#valid_10|, ULTIMATE.start_main_~Blen~0=v_ULTIMATE.start_main_~Blen~0_7, ULTIMATE.start_main_~Alen~0=v_ULTIMATE.start_main_~Alen~0_7} OutVars{ULTIMATE.start_diff_#in~A.base=|v_ULTIMATE.start_diff_#in~A.base_1|, ULTIMATE.start_diff_#in~B.base=|v_ULTIMATE.start_diff_#in~B.base_1|, ULTIMATE.start_diff_~B.offset=v_ULTIMATE.start_diff_~B.offset_1, ULTIMATE.start_diff_~Alen=v_ULTIMATE.start_diff_~Alen_1, ULTIMATE.start_diff_~D.base=v_ULTIMATE.start_diff_~D.base_1, ULTIMATE.start_diff_#in~Blen=|v_ULTIMATE.start_diff_#in~Blen_1|, ULTIMATE.start_main_~B~0.offset=v_ULTIMATE.start_main_~B~0.offset_2, ULTIMATE.start_main_~B~0.base=v_ULTIMATE.start_main_~B~0.base_2, ULTIMATE.start_diff_#in~A.offset=|v_ULTIMATE.start_diff_#in~A.offset_1|, ULTIMATE.start_main_~D~0.offset=v_ULTIMATE.start_main_~D~0.offset_2, ULTIMATE.start_diff_#in~D.offset=|v_ULTIMATE.start_diff_#in~D.offset_1|, ULTIMATE.start_diff_#in~Alen=|v_ULTIMATE.start_diff_#in~Alen_1|, ULTIMATE.start_diff_~A.base=v_ULTIMATE.start_diff_~A.base_1, ULTIMATE.start_diff_~B.base=v_ULTIMATE.start_diff_~B.base_1, #length=|v_#length_1|, ULTIMATE.start_main_#t~malloc9.offset=|v_ULTIMATE.start_main_#t~malloc9.offset_4|, ULTIMATE.start_diff_#t~mem3=|v_ULTIMATE.start_diff_#t~mem3_1|, ULTIMATE.start_main_~A~0.offset=v_ULTIMATE.start_main_~A~0.offset_2, ULTIMATE.start_main_#t~malloc10.offset=|v_ULTIMATE.start_main_#t~malloc10.offset_4|, ULTIMATE.start_main_~Blen~0=v_ULTIMATE.start_main_~Blen~0_7, ULTIMATE.start_main_~Alen~0=v_ULTIMATE.start_main_~Alen~0_7, ULTIMATE.start_diff_~Blen=v_ULTIMATE.start_diff_~Blen_1, ULTIMATE.start_main_#t~malloc8.base=|v_ULTIMATE.start_main_#t~malloc8.base_4|, ULTIMATE.start_diff_#t~mem0=|v_ULTIMATE.start_diff_#t~mem0_1|, ULTIMATE.start_main_#t~malloc9.base=|v_ULTIMATE.start_main_#t~malloc9.base_4|, ULTIMATE.start_diff_#t~mem1=|v_ULTIMATE.start_diff_#t~mem1_1|, ULTIMATE.start_main_~A~0.base=v_ULTIMATE.start_main_~A~0.base_2, ULTIMATE.start_diff_#t~post4=|v_ULTIMATE.start_diff_#t~post4_1|, ULTIMATE.start_diff_~found~0=v_ULTIMATE.start_diff_~found~0_1, ULTIMATE.start_diff_#in~B.offset=|v_ULTIMATE.start_diff_#in~B.offset_1|, ULTIMATE.start_diff_~i~0=v_ULTIMATE.start_diff_~i~0_1, ULTIMATE.start_diff_~l1~0=v_ULTIMATE.start_diff_~l1~0_1, ULTIMATE.start_diff_#t~post5=|v_ULTIMATE.start_diff_#t~post5_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, ULTIMATE.start_main_#t~malloc10.base=|v_ULTIMATE.start_main_#t~malloc10.base_4|, ULTIMATE.start_diff_~D.offset=v_ULTIMATE.start_diff_~D.offset_1, ULTIMATE.start_diff_~l2~0=v_ULTIMATE.start_diff_~l2~0_1, ULTIMATE.start_diff_~j~0=v_ULTIMATE.start_diff_~j~0_1, ULTIMATE.start_main_#t~malloc8.offset=|v_ULTIMATE.start_main_#t~malloc8.offset_4|, #valid=|v_#valid_7|, ULTIMATE.start_diff_~k~0=v_ULTIMATE.start_diff_~k~0_1, ULTIMATE.start_diff_#in~D.base=|v_ULTIMATE.start_diff_#in~D.base_1|, ULTIMATE.start_diff_#t~post2=|v_ULTIMATE.start_diff_#t~post2_1|, ULTIMATE.start_diff_~A.offset=v_ULTIMATE.start_diff_~A.offset_1, ULTIMATE.start_main_~D~0.base=v_ULTIMATE.start_main_~D~0.base_2} AuxVars[] AssignedVars[ULTIMATE.start_diff_#in~A.base, ULTIMATE.start_diff_#in~B.base, ULTIMATE.start_diff_~B.offset, ULTIMATE.start_diff_~Alen, ULTIMATE.start_diff_~D.base, ULTIMATE.start_diff_#in~Blen, ULTIMATE.start_main_~B~0.offset, ULTIMATE.start_main_~B~0.base, ULTIMATE.start_diff_#in~A.offset, ULTIMATE.start_main_~D~0.offset, ULTIMATE.start_diff_#in~D.offset, ULTIMATE.start_diff_#in~Alen, ULTIMATE.start_diff_~A.base, ULTIMATE.start_diff_~B.base, #length, ULTIMATE.start_main_#t~malloc9.offset, ULTIMATE.start_diff_#t~mem3, ULTIMATE.start_main_~A~0.offset, ULTIMATE.start_main_#t~malloc10.offset, ULTIMATE.start_diff_~Blen, ULTIMATE.start_main_#t~malloc8.base, ULTIMATE.start_diff_#t~mem0, ULTIMATE.start_main_#t~malloc9.base, ULTIMATE.start_diff_#t~mem1, ULTIMATE.start_main_~A~0.base, ULTIMATE.start_diff_#t~post4, ULTIMATE.start_diff_~found~0, ULTIMATE.start_diff_#in~B.offset, ULTIMATE.start_diff_~i~0, ULTIMATE.start_diff_~l1~0, ULTIMATE.start_diff_#t~post5, ULTIMATE.start_main_#t~malloc10.base, ULTIMATE.start_diff_~D.offset, ULTIMATE.start_diff_~l2~0, ULTIMATE.start_diff_~j~0, ULTIMATE.start_main_#t~malloc8.offset, #valid, ULTIMATE.start_diff_~k~0, ULTIMATE.start_diff_#in~D.base, ULTIMATE.start_diff_#t~post2, ULTIMATE.start_diff_~A.offset, ULTIMATE.start_main_~D~0.base] 155#L13-2 72.80/34.78 [2019-03-28 12:50:28,906 INFO L796 eck$LassoCheckResult]: Loop: 155#L13-2 [91] L13-2-->L17-4: Formula: (and (< v_ULTIMATE.start_diff_~i~0_4 v_ULTIMATE.start_diff_~l1~0_4) (= v_ULTIMATE.start_diff_~j~0_2 0) (= v_ULTIMATE.start_diff_~found~0_3 0)) InVars {ULTIMATE.start_diff_~i~0=v_ULTIMATE.start_diff_~i~0_4, ULTIMATE.start_diff_~l1~0=v_ULTIMATE.start_diff_~l1~0_4} OutVars{ULTIMATE.start_diff_~found~0=v_ULTIMATE.start_diff_~found~0_3, ULTIMATE.start_diff_~i~0=v_ULTIMATE.start_diff_~i~0_4, ULTIMATE.start_diff_~l1~0=v_ULTIMATE.start_diff_~l1~0_4, ULTIMATE.start_diff_~j~0=v_ULTIMATE.start_diff_~j~0_2} AuxVars[] AssignedVars[ULTIMATE.start_diff_~found~0, ULTIMATE.start_diff_~j~0] 156#L17-4 [99] L17-4-->L17: Formula: (and (= 0 v_ULTIMATE.start_diff_~found~0_5) (< v_ULTIMATE.start_diff_~j~0_4 v_ULTIMATE.start_diff_~l2~0_4)) InVars {ULTIMATE.start_diff_~found~0=v_ULTIMATE.start_diff_~found~0_5, ULTIMATE.start_diff_~j~0=v_ULTIMATE.start_diff_~j~0_4, ULTIMATE.start_diff_~l2~0=v_ULTIMATE.start_diff_~l2~0_4} OutVars{ULTIMATE.start_diff_~found~0=v_ULTIMATE.start_diff_~found~0_5, ULTIMATE.start_diff_~j~0=v_ULTIMATE.start_diff_~j~0_4, ULTIMATE.start_diff_~l2~0=v_ULTIMATE.start_diff_~l2~0_4} AuxVars[] AssignedVars[] 159#L17 [85] L17-->L17-1: Formula: (let ((.cse0 (* 4 v_ULTIMATE.start_diff_~i~0_5))) (let ((.cse1 (+ .cse0 v_ULTIMATE.start_diff_~A.offset_3))) (and (<= (+ .cse0 v_ULTIMATE.start_diff_~A.offset_3 4) (select |v_#length_5| v_ULTIMATE.start_diff_~A.base_3)) (= 1 (select |v_#valid_11| v_ULTIMATE.start_diff_~A.base_3)) (= (select (select |v_#memory_int_1| v_ULTIMATE.start_diff_~A.base_3) .cse1) |v_ULTIMATE.start_diff_#t~mem0_2|) (<= 0 .cse1)))) InVars {ULTIMATE.start_diff_~i~0=v_ULTIMATE.start_diff_~i~0_5, ULTIMATE.start_diff_~A.base=v_ULTIMATE.start_diff_~A.base_3, #valid=|v_#valid_11|, #memory_int=|v_#memory_int_1|, #length=|v_#length_5|, ULTIMATE.start_diff_~A.offset=v_ULTIMATE.start_diff_~A.offset_3} OutVars{ULTIMATE.start_diff_#t~mem0=|v_ULTIMATE.start_diff_#t~mem0_2|, ULTIMATE.start_diff_~i~0=v_ULTIMATE.start_diff_~i~0_5, ULTIMATE.start_diff_~A.base=v_ULTIMATE.start_diff_~A.base_3, #valid=|v_#valid_11|, #memory_int=|v_#memory_int_1|, #length=|v_#length_5|, ULTIMATE.start_diff_~A.offset=v_ULTIMATE.start_diff_~A.offset_3} AuxVars[] AssignedVars[ULTIMATE.start_diff_#t~mem0] 165#L17-1 [82] L17-1-->L17-2: Formula: (let ((.cse1 (* 4 v_ULTIMATE.start_diff_~j~0_5))) (let ((.cse0 (+ v_ULTIMATE.start_diff_~B.offset_3 .cse1))) (and (<= 0 .cse0) (= 1 (select |v_#valid_13| v_ULTIMATE.start_diff_~B.base_3)) (= (select (select |v_#memory_int_2| v_ULTIMATE.start_diff_~B.base_3) .cse0) |v_ULTIMATE.start_diff_#t~mem1_2|) (<= (+ v_ULTIMATE.start_diff_~B.offset_3 .cse1 4) (select |v_#length_7| v_ULTIMATE.start_diff_~B.base_3))))) InVars {ULTIMATE.start_diff_~B.offset=v_ULTIMATE.start_diff_~B.offset_3, ULTIMATE.start_diff_~j~0=v_ULTIMATE.start_diff_~j~0_5, #valid=|v_#valid_13|, ULTIMATE.start_diff_~B.base=v_ULTIMATE.start_diff_~B.base_3, #memory_int=|v_#memory_int_2|, #length=|v_#length_7|} OutVars{ULTIMATE.start_diff_#t~mem1=|v_ULTIMATE.start_diff_#t~mem1_2|, ULTIMATE.start_diff_~B.offset=v_ULTIMATE.start_diff_~B.offset_3, ULTIMATE.start_diff_~j~0=v_ULTIMATE.start_diff_~j~0_5, #valid=|v_#valid_13|, ULTIMATE.start_diff_~B.base=v_ULTIMATE.start_diff_~B.base_3, #memory_int=|v_#memory_int_2|, #length=|v_#length_7|} AuxVars[] AssignedVars[ULTIMATE.start_diff_#t~mem1] 164#L17-2 [80] L17-2-->L17-4: Formula: (and (= |v_ULTIMATE.start_diff_#t~mem1_4| |v_ULTIMATE.start_diff_#t~mem0_4|) (= v_ULTIMATE.start_diff_~found~0_6 1)) InVars {ULTIMATE.start_diff_#t~mem0=|v_ULTIMATE.start_diff_#t~mem0_4|, ULTIMATE.start_diff_#t~mem1=|v_ULTIMATE.start_diff_#t~mem1_4|} OutVars{ULTIMATE.start_diff_#t~mem0=|v_ULTIMATE.start_diff_#t~mem0_3|, ULTIMATE.start_diff_#t~mem1=|v_ULTIMATE.start_diff_#t~mem1_3|, ULTIMATE.start_diff_~found~0=v_ULTIMATE.start_diff_~found~0_6} AuxVars[] AssignedVars[ULTIMATE.start_diff_#t~mem0, ULTIMATE.start_diff_#t~mem1, ULTIMATE.start_diff_~found~0] 163#L17-4 [127] L17-4-->L16-2: Formula: (< 0 v_ULTIMATE.start_diff_~found~0_4) InVars {ULTIMATE.start_diff_~found~0=v_ULTIMATE.start_diff_~found~0_4} OutVars{ULTIMATE.start_diff_~found~0=v_ULTIMATE.start_diff_~found~0_4} AuxVars[] AssignedVars[] 162#L16-2 [130] L16-2-->L23-1: Formula: (< 0 v_ULTIMATE.start_diff_~found~0_8) InVars {ULTIMATE.start_diff_~found~0=v_ULTIMATE.start_diff_~found~0_8} OutVars{ULTIMATE.start_diff_~found~0=v_ULTIMATE.start_diff_~found~0_8} AuxVars[] AssignedVars[] 157#L23-1 [74] L23-1-->L13-2: Formula: (= v_ULTIMATE.start_diff_~i~0_9 (+ v_ULTIMATE.start_diff_~i~0_10 1)) InVars {ULTIMATE.start_diff_~i~0=v_ULTIMATE.start_diff_~i~0_10} OutVars{ULTIMATE.start_diff_#t~post5=|v_ULTIMATE.start_diff_#t~post5_2|, ULTIMATE.start_diff_~i~0=v_ULTIMATE.start_diff_~i~0_9} AuxVars[] AssignedVars[ULTIMATE.start_diff_#t~post5, ULTIMATE.start_diff_~i~0] 155#L13-2 72.80/34.78 [2019-03-28 12:50:28,907 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 72.80/34.78 [2019-03-28 12:50:28,907 INFO L82 PathProgramCache]: Analyzing trace with hash 5467627, now seen corresponding path program 4 times 72.80/34.78 [2019-03-28 12:50:28,907 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 72.80/34.78 [2019-03-28 12:50:28,907 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 72.80/34.78 [2019-03-28 12:50:28,908 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 72.80/34.78 [2019-03-28 12:50:28,908 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 72.80/34.78 [2019-03-28 12:50:28,908 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 72.80/34.78 [2019-03-28 12:50:28,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 72.80/34.78 [2019-03-28 12:50:28,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 72.80/34.78 [2019-03-28 12:50:28,921 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 72.80/34.78 [2019-03-28 12:50:28,921 INFO L82 PathProgramCache]: Analyzing trace with hash -1945236739, now seen corresponding path program 1 times 72.80/34.78 [2019-03-28 12:50:28,921 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 72.80/34.78 [2019-03-28 12:50:28,921 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 72.80/34.78 [2019-03-28 12:50:28,922 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 72.80/34.78 [2019-03-28 12:50:28,922 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY 72.80/34.78 [2019-03-28 12:50:28,922 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 72.80/34.78 [2019-03-28 12:50:28,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 72.80/34.78 [2019-03-28 12:50:28,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 72.80/34.78 [2019-03-28 12:50:28,929 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 72.80/34.78 [2019-03-28 12:50:28,929 INFO L82 PathProgramCache]: Analyzing trace with hash 858910439, now seen corresponding path program 1 times 72.80/34.78 [2019-03-28 12:50:28,929 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 72.80/34.78 [2019-03-28 12:50:28,929 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 72.80/34.78 [2019-03-28 12:50:28,930 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 72.80/34.78 [2019-03-28 12:50:28,930 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 72.80/34.78 [2019-03-28 12:50:28,930 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 72.80/34.78 [2019-03-28 12:50:28,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 72.80/34.78 [2019-03-28 12:50:28,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 72.80/34.78 [2019-03-28 12:50:29,465 WARN L188 SmtUtils]: Spent 402.00 ms on a formula simplification. DAG size of input: 105 DAG size of output: 104 72.80/34.78 [2019-03-28 12:50:29,674 WARN L188 SmtUtils]: Spent 207.00 ms on a formula simplification that was a NOOP. DAG size: 100 72.80/34.78 [2019-03-28 12:50:29,687 INFO L216 LassoAnalysis]: Preferences: 72.80/34.78 [2019-03-28 12:50:29,688 INFO L124 ssoRankerPreferences]: Compute integeral hull: false 72.80/34.78 [2019-03-28 12:50:29,688 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true 72.80/34.78 [2019-03-28 12:50:29,689 INFO L126 ssoRankerPreferences]: Term annotations enabled: false 72.80/34.78 [2019-03-28 12:50:29,689 INFO L127 ssoRankerPreferences]: Use exernal solver: false 72.80/34.78 [2019-03-28 12:50:29,689 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 72.80/34.78 [2019-03-28 12:50:29,689 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false 72.80/34.78 [2019-03-28 12:50:29,689 INFO L130 ssoRankerPreferences]: Path of dumped script: 72.80/34.78 [2019-03-28 12:50:29,689 INFO L131 ssoRankerPreferences]: Filename of dumped script: theBenchmark.c_BEv2_Iteration4_Lasso 72.80/34.78 [2019-03-28 12:50:29,689 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank 72.80/34.78 [2019-03-28 12:50:29,690 INFO L282 LassoAnalysis]: Starting lasso preprocessing... 72.80/34.78 [2019-03-28 12:50:29,707 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 72.80/34.78 [2019-03-28 12:50:29,712 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 72.80/34.78 [2019-03-28 12:50:29,714 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 72.80/34.78 [2019-03-28 12:50:29,717 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 72.80/34.78 [2019-03-28 12:50:29,719 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 72.80/34.78 [2019-03-28 12:50:29,721 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 72.80/34.78 [2019-03-28 12:50:29,725 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 72.80/34.78 [2019-03-28 12:50:29,727 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 72.80/34.78 [2019-03-28 12:50:29,736 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 72.80/34.78 [2019-03-28 12:50:29,739 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 72.80/34.78 [2019-03-28 12:50:29,741 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 72.80/34.78 [2019-03-28 12:50:29,744 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 72.80/34.78 [2019-03-28 12:50:29,746 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 72.80/34.78 [2019-03-28 12:50:29,748 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 72.80/34.78 [2019-03-28 12:50:30,167 WARN L188 SmtUtils]: Spent 329.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 89 72.80/34.78 [2019-03-28 12:50:30,221 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 72.80/34.78 [2019-03-28 12:50:30,719 INFO L300 LassoAnalysis]: Preprocessing complete. 72.80/34.78 [2019-03-28 12:50:30,725 INFO L497 LassoAnalysis]: Using template 'affine'. 72.80/34.78 [2019-03-28 12:50:30,728 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 72.80/34.78 Termination analysis: LINEAR_WITH_GUESSES 72.80/34.78 Number of strict supporting invariants: 0 72.80/34.78 Number of non-strict supporting invariants: 1 72.80/34.78 Consider only non-deceasing supporting invariants: true 72.80/34.78 Simplify termination arguments: true 72.80/34.78 Simplify supporting invariants: trueOverapproximate stem: false 72.80/34.78 [2019-03-28 12:50:30,729 INFO L339 nArgumentSynthesizer]: Template has degree 0. 72.80/34.78 [2019-03-28 12:50:30,730 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 72.80/34.78 [2019-03-28 12:50:30,730 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 72.80/34.78 [2019-03-28 12:50:30,730 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 72.80/34.78 [2019-03-28 12:50:30,731 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 72.80/34.78 [2019-03-28 12:50:30,733 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 72.80/34.78 [2019-03-28 12:50:30,733 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 72.80/34.78 [2019-03-28 12:50:30,735 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 72.80/34.78 [2019-03-28 12:50:30,735 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 72.80/34.78 Termination analysis: LINEAR_WITH_GUESSES 72.80/34.78 Number of strict supporting invariants: 0 72.80/34.78 Number of non-strict supporting invariants: 1 72.80/34.78 Consider only non-deceasing supporting invariants: true 72.80/34.78 Simplify termination arguments: true 72.80/34.78 Simplify supporting invariants: trueOverapproximate stem: false 72.80/34.78 [2019-03-28 12:50:30,735 INFO L339 nArgumentSynthesizer]: Template has degree 0. 72.80/34.78 [2019-03-28 12:50:30,736 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 72.80/34.78 [2019-03-28 12:50:30,736 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 72.80/34.78 [2019-03-28 12:50:30,736 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 72.80/34.78 [2019-03-28 12:50:30,736 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 72.80/34.78 [2019-03-28 12:50:30,737 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 72.80/34.78 [2019-03-28 12:50:30,737 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 72.80/34.78 [2019-03-28 12:50:30,738 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 72.80/34.78 [2019-03-28 12:50:30,738 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 72.80/34.78 Termination analysis: LINEAR_WITH_GUESSES 72.80/34.78 Number of strict supporting invariants: 0 72.80/34.78 Number of non-strict supporting invariants: 1 72.80/34.78 Consider only non-deceasing supporting invariants: true 72.80/34.78 Simplify termination arguments: true 72.80/34.78 Simplify supporting invariants: trueOverapproximate stem: false 72.80/34.78 [2019-03-28 12:50:30,738 INFO L339 nArgumentSynthesizer]: Template has degree 0. 72.80/34.78 [2019-03-28 12:50:30,738 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 72.80/34.78 [2019-03-28 12:50:30,739 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 72.80/34.78 [2019-03-28 12:50:30,739 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 72.80/34.78 [2019-03-28 12:50:30,741 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. 72.80/34.78 [2019-03-28 12:50:30,741 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. 72.80/34.78 [2019-03-28 12:50:30,744 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 72.80/34.78 [2019-03-28 12:50:30,744 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 72.80/34.78 Termination analysis: LINEAR_WITH_GUESSES 72.80/34.78 Number of strict supporting invariants: 0 72.80/34.78 Number of non-strict supporting invariants: 1 72.80/34.78 Consider only non-deceasing supporting invariants: true 72.80/34.78 Simplify termination arguments: true 72.80/34.78 Simplify supporting invariants: trueOverapproximate stem: false 72.80/34.78 [2019-03-28 12:50:30,745 INFO L339 nArgumentSynthesizer]: Template has degree 0. 72.80/34.78 [2019-03-28 12:50:30,745 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 72.80/34.78 [2019-03-28 12:50:30,745 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 72.80/34.78 [2019-03-28 12:50:30,745 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 72.80/34.78 [2019-03-28 12:50:30,745 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 72.80/34.78 [2019-03-28 12:50:30,746 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 72.80/34.78 [2019-03-28 12:50:30,746 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 72.80/34.78 [2019-03-28 12:50:30,747 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 72.80/34.78 [2019-03-28 12:50:30,747 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 72.80/34.78 Termination analysis: LINEAR_WITH_GUESSES 72.80/34.78 Number of strict supporting invariants: 0 72.80/34.78 Number of non-strict supporting invariants: 1 72.80/34.78 Consider only non-deceasing supporting invariants: true 72.80/34.78 Simplify termination arguments: true 72.80/34.78 Simplify supporting invariants: trueOverapproximate stem: false 72.80/34.78 [2019-03-28 12:50:30,747 INFO L339 nArgumentSynthesizer]: Template has degree 0. 72.80/34.78 [2019-03-28 12:50:30,747 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 72.80/34.78 [2019-03-28 12:50:30,748 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 72.80/34.78 [2019-03-28 12:50:30,748 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 72.80/34.78 [2019-03-28 12:50:30,748 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 72.80/34.78 [2019-03-28 12:50:30,748 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 72.80/34.78 [2019-03-28 12:50:30,748 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 72.80/34.78 [2019-03-28 12:50:30,749 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 72.80/34.78 [2019-03-28 12:50:30,749 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 72.80/34.78 Termination analysis: LINEAR_WITH_GUESSES 72.80/34.78 Number of strict supporting invariants: 0 72.80/34.78 Number of non-strict supporting invariants: 1 72.80/34.78 Consider only non-deceasing supporting invariants: true 72.80/34.78 Simplify termination arguments: true 72.80/34.78 Simplify supporting invariants: trueOverapproximate stem: false 72.80/34.78 [2019-03-28 12:50:30,750 INFO L339 nArgumentSynthesizer]: Template has degree 0. 72.80/34.78 [2019-03-28 12:50:30,750 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 72.80/34.78 [2019-03-28 12:50:30,750 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 72.80/34.78 [2019-03-28 12:50:30,750 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 72.80/34.78 [2019-03-28 12:50:30,750 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 72.80/34.78 [2019-03-28 12:50:30,751 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 72.80/34.78 [2019-03-28 12:50:30,751 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 72.80/34.78 [2019-03-28 12:50:30,752 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 72.80/34.78 [2019-03-28 12:50:30,753 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 72.80/34.78 Termination analysis: LINEAR_WITH_GUESSES 72.80/34.78 Number of strict supporting invariants: 0 72.80/34.78 Number of non-strict supporting invariants: 1 72.80/34.78 Consider only non-deceasing supporting invariants: true 72.80/34.78 Simplify termination arguments: true 72.80/34.78 Simplify supporting invariants: trueOverapproximate stem: false 72.80/34.78 [2019-03-28 12:50:30,753 INFO L339 nArgumentSynthesizer]: Template has degree 0. 72.80/34.78 [2019-03-28 12:50:30,753 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 72.80/34.78 [2019-03-28 12:50:30,753 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 72.80/34.78 [2019-03-28 12:50:30,754 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 72.80/34.78 [2019-03-28 12:50:30,754 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 72.80/34.78 [2019-03-28 12:50:30,754 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 72.80/34.78 [2019-03-28 12:50:30,754 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 72.80/34.78 [2019-03-28 12:50:30,755 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 72.80/34.78 [2019-03-28 12:50:30,755 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 72.80/34.78 Termination analysis: LINEAR_WITH_GUESSES 72.80/34.78 Number of strict supporting invariants: 0 72.80/34.78 Number of non-strict supporting invariants: 1 72.80/34.78 Consider only non-deceasing supporting invariants: true 72.80/34.78 Simplify termination arguments: true 72.80/34.78 Simplify supporting invariants: trueOverapproximate stem: false 72.80/34.78 [2019-03-28 12:50:30,756 INFO L339 nArgumentSynthesizer]: Template has degree 0. 72.80/34.78 [2019-03-28 12:50:30,756 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 72.80/34.78 [2019-03-28 12:50:30,756 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 72.80/34.78 [2019-03-28 12:50:30,756 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 72.80/34.78 [2019-03-28 12:50:30,759 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. 72.80/34.78 [2019-03-28 12:50:30,759 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. 72.80/34.78 [2019-03-28 12:50:30,762 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 72.80/34.78 [2019-03-28 12:50:30,762 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 72.80/34.78 Termination analysis: LINEAR_WITH_GUESSES 72.80/34.78 Number of strict supporting invariants: 0 72.80/34.78 Number of non-strict supporting invariants: 1 72.80/34.78 Consider only non-deceasing supporting invariants: true 72.80/34.78 Simplify termination arguments: true 72.80/34.78 Simplify supporting invariants: trueOverapproximate stem: false 72.80/34.78 [2019-03-28 12:50:30,763 INFO L339 nArgumentSynthesizer]: Template has degree 0. 72.80/34.78 [2019-03-28 12:50:30,763 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 72.80/34.78 [2019-03-28 12:50:30,763 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 72.80/34.78 [2019-03-28 12:50:30,763 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 72.80/34.78 [2019-03-28 12:50:30,765 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. 72.80/34.78 [2019-03-28 12:50:30,765 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. 72.80/34.78 [2019-03-28 12:50:30,767 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 72.80/34.78 [2019-03-28 12:50:30,767 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 72.80/34.78 Termination analysis: LINEAR_WITH_GUESSES 72.80/34.78 Number of strict supporting invariants: 0 72.80/34.78 Number of non-strict supporting invariants: 1 72.80/34.78 Consider only non-deceasing supporting invariants: true 72.80/34.78 Simplify termination arguments: true 72.80/34.78 Simplify supporting invariants: trueOverapproximate stem: false 72.80/34.78 [2019-03-28 12:50:30,767 INFO L339 nArgumentSynthesizer]: Template has degree 0. 72.80/34.78 [2019-03-28 12:50:30,768 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 72.80/34.78 [2019-03-28 12:50:30,768 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 72.80/34.78 [2019-03-28 12:50:30,768 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 72.80/34.78 [2019-03-28 12:50:30,768 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 72.80/34.78 [2019-03-28 12:50:30,768 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 72.80/34.78 [2019-03-28 12:50:30,769 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 72.80/34.78 [2019-03-28 12:50:30,769 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 72.80/34.78 [2019-03-28 12:50:30,769 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 72.80/34.78 Termination analysis: LINEAR_WITH_GUESSES 72.80/34.78 Number of strict supporting invariants: 0 72.80/34.78 Number of non-strict supporting invariants: 1 72.80/34.78 Consider only non-deceasing supporting invariants: true 72.80/34.78 Simplify termination arguments: true 72.80/34.78 Simplify supporting invariants: trueOverapproximate stem: false 72.80/34.78 [2019-03-28 12:50:30,770 INFO L339 nArgumentSynthesizer]: Template has degree 0. 72.80/34.78 [2019-03-28 12:50:30,770 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 72.80/34.78 [2019-03-28 12:50:30,770 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 72.80/34.78 [2019-03-28 12:50:30,770 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 72.80/34.78 [2019-03-28 12:50:30,771 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. 72.80/34.78 [2019-03-28 12:50:30,772 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. 72.80/34.78 [2019-03-28 12:50:30,773 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 72.80/34.78 [2019-03-28 12:50:30,774 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 72.80/34.78 Termination analysis: LINEAR_WITH_GUESSES 72.80/34.78 Number of strict supporting invariants: 0 72.80/34.78 Number of non-strict supporting invariants: 1 72.80/34.78 Consider only non-deceasing supporting invariants: true 72.80/34.78 Simplify termination arguments: true 72.80/34.78 Simplify supporting invariants: trueOverapproximate stem: false 72.80/34.78 [2019-03-28 12:50:30,774 INFO L339 nArgumentSynthesizer]: Template has degree 0. 72.80/34.78 [2019-03-28 12:50:30,774 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 72.80/34.78 [2019-03-28 12:50:30,774 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 72.80/34.78 [2019-03-28 12:50:30,774 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 72.80/34.78 [2019-03-28 12:50:30,774 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 72.80/34.78 [2019-03-28 12:50:30,775 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 72.80/34.78 [2019-03-28 12:50:30,775 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 72.80/34.78 [2019-03-28 12:50:30,775 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 72.80/34.78 [2019-03-28 12:50:30,776 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 72.80/34.78 Termination analysis: LINEAR_WITH_GUESSES 72.80/34.78 Number of strict supporting invariants: 0 72.80/34.78 Number of non-strict supporting invariants: 1 72.80/34.78 Consider only non-deceasing supporting invariants: true 72.80/34.78 Simplify termination arguments: true 72.80/34.78 Simplify supporting invariants: trueOverapproximate stem: false 72.80/34.78 [2019-03-28 12:50:30,776 INFO L339 nArgumentSynthesizer]: Template has degree 0. 72.80/34.78 [2019-03-28 12:50:30,776 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 72.80/34.78 [2019-03-28 12:50:30,776 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 72.80/34.78 [2019-03-28 12:50:30,776 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 72.80/34.78 [2019-03-28 12:50:30,777 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 72.80/34.78 [2019-03-28 12:50:30,777 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 72.80/34.78 [2019-03-28 12:50:30,777 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 72.80/34.78 [2019-03-28 12:50:30,778 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 72.80/34.78 [2019-03-28 12:50:30,778 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 72.80/34.78 Termination analysis: LINEAR_WITH_GUESSES 72.80/34.78 Number of strict supporting invariants: 0 72.80/34.78 Number of non-strict supporting invariants: 1 72.80/34.78 Consider only non-deceasing supporting invariants: true 72.80/34.78 Simplify termination arguments: true 72.80/34.78 Simplify supporting invariants: trueOverapproximate stem: false 72.80/34.78 [2019-03-28 12:50:30,779 INFO L339 nArgumentSynthesizer]: Template has degree 0. 72.80/34.78 [2019-03-28 12:50:30,779 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 72.80/34.78 [2019-03-28 12:50:30,779 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 72.80/34.78 [2019-03-28 12:50:30,779 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 72.80/34.78 [2019-03-28 12:50:30,779 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 72.80/34.78 [2019-03-28 12:50:30,780 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 72.80/34.78 [2019-03-28 12:50:30,780 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 72.80/34.78 [2019-03-28 12:50:30,781 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 72.80/34.78 [2019-03-28 12:50:30,781 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 72.80/34.78 Termination analysis: LINEAR_WITH_GUESSES 72.80/34.78 Number of strict supporting invariants: 0 72.80/34.78 Number of non-strict supporting invariants: 1 72.80/34.78 Consider only non-deceasing supporting invariants: true 72.80/34.78 Simplify termination arguments: true 72.80/34.78 Simplify supporting invariants: trueOverapproximate stem: false 72.80/34.78 [2019-03-28 12:50:30,781 INFO L339 nArgumentSynthesizer]: Template has degree 0. 72.80/34.78 [2019-03-28 12:50:30,782 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 72.80/34.78 [2019-03-28 12:50:30,782 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 72.80/34.78 [2019-03-28 12:50:30,782 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 72.80/34.78 [2019-03-28 12:50:30,784 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. 72.80/34.78 [2019-03-28 12:50:30,784 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. 72.80/34.78 [2019-03-28 12:50:30,793 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 72.80/34.78 [2019-03-28 12:50:30,793 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 72.80/34.78 Termination analysis: LINEAR_WITH_GUESSES 72.80/34.78 Number of strict supporting invariants: 0 72.80/34.78 Number of non-strict supporting invariants: 1 72.80/34.78 Consider only non-deceasing supporting invariants: true 72.80/34.78 Simplify termination arguments: true 72.80/34.78 Simplify supporting invariants: trueOverapproximate stem: false 72.80/34.78 [2019-03-28 12:50:30,794 INFO L339 nArgumentSynthesizer]: Template has degree 0. 72.80/34.78 [2019-03-28 12:50:30,794 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 72.80/34.78 [2019-03-28 12:50:30,794 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 72.80/34.78 [2019-03-28 12:50:30,794 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 72.80/34.78 [2019-03-28 12:50:30,798 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. 72.80/34.78 [2019-03-28 12:50:30,798 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. 72.80/34.78 [2019-03-28 12:50:30,810 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 72.80/34.78 [2019-03-28 12:50:30,811 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 72.80/34.78 Termination analysis: LINEAR_WITH_GUESSES 72.80/34.78 Number of strict supporting invariants: 0 72.80/34.78 Number of non-strict supporting invariants: 1 72.80/34.78 Consider only non-deceasing supporting invariants: true 72.80/34.78 Simplify termination arguments: true 72.80/34.78 Simplify supporting invariants: trueOverapproximate stem: false 72.80/34.78 [2019-03-28 12:50:30,811 INFO L339 nArgumentSynthesizer]: Template has degree 0. 72.80/34.78 [2019-03-28 12:50:30,812 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 72.80/34.78 [2019-03-28 12:50:30,812 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 72.80/34.78 [2019-03-28 12:50:30,812 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 72.80/34.78 [2019-03-28 12:50:30,813 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. 72.80/34.78 [2019-03-28 12:50:30,813 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. 72.80/34.78 [2019-03-28 12:50:30,815 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 72.80/34.78 [2019-03-28 12:50:30,815 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 72.80/34.78 Termination analysis: LINEAR_WITH_GUESSES 72.80/34.78 Number of strict supporting invariants: 0 72.80/34.78 Number of non-strict supporting invariants: 1 72.80/34.78 Consider only non-deceasing supporting invariants: true 72.80/34.78 Simplify termination arguments: true 72.80/34.78 Simplify supporting invariants: trueOverapproximate stem: false 72.80/34.78 [2019-03-28 12:50:30,815 INFO L339 nArgumentSynthesizer]: Template has degree 0. 72.80/34.78 [2019-03-28 12:50:30,816 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 72.80/34.78 [2019-03-28 12:50:30,816 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 72.80/34.78 [2019-03-28 12:50:30,816 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 72.80/34.78 [2019-03-28 12:50:30,817 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. 72.80/34.78 [2019-03-28 12:50:30,817 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. 72.80/34.78 [2019-03-28 12:50:30,819 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 72.80/34.78 [2019-03-28 12:50:30,820 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 72.80/34.78 Termination analysis: LINEAR_WITH_GUESSES 72.80/34.78 Number of strict supporting invariants: 0 72.80/34.78 Number of non-strict supporting invariants: 1 72.80/34.78 Consider only non-deceasing supporting invariants: true 72.80/34.78 Simplify termination arguments: true 72.80/34.78 Simplify supporting invariants: trueOverapproximate stem: false 72.80/34.78 [2019-03-28 12:50:30,820 INFO L339 nArgumentSynthesizer]: Template has degree 0. 72.80/34.78 [2019-03-28 12:50:30,820 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 72.80/34.78 [2019-03-28 12:50:30,820 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 72.80/34.78 [2019-03-28 12:50:30,821 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 72.80/34.78 [2019-03-28 12:50:30,822 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. 72.80/34.78 [2019-03-28 12:50:30,822 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. 72.80/34.78 [2019-03-28 12:50:30,827 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 72.80/34.78 [2019-03-28 12:50:30,827 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 72.80/34.78 Termination analysis: LINEAR_WITH_GUESSES 72.80/34.78 Number of strict supporting invariants: 0 72.80/34.78 Number of non-strict supporting invariants: 1 72.80/34.78 Consider only non-deceasing supporting invariants: true 72.80/34.78 Simplify termination arguments: true 72.80/34.78 Simplify supporting invariants: trueOverapproximate stem: false 72.80/34.78 [2019-03-28 12:50:30,828 INFO L339 nArgumentSynthesizer]: Template has degree 0. 72.80/34.78 [2019-03-28 12:50:30,828 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 72.80/34.78 [2019-03-28 12:50:30,828 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 72.80/34.78 [2019-03-28 12:50:30,828 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 72.80/34.78 [2019-03-28 12:50:30,830 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. 72.80/34.78 [2019-03-28 12:50:30,830 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. 72.80/34.78 [2019-03-28 12:50:30,835 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 72.80/34.78 [2019-03-28 12:50:30,835 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 72.80/34.78 Termination analysis: LINEAR_WITH_GUESSES 72.80/34.78 Number of strict supporting invariants: 0 72.80/34.78 Number of non-strict supporting invariants: 1 72.80/34.78 Consider only non-deceasing supporting invariants: true 72.80/34.78 Simplify termination arguments: true 72.80/34.78 Simplify supporting invariants: trueOverapproximate stem: false 72.80/34.78 [2019-03-28 12:50:30,836 INFO L339 nArgumentSynthesizer]: Template has degree 0. 72.80/34.78 [2019-03-28 12:50:30,836 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 72.80/34.78 [2019-03-28 12:50:30,836 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 72.80/34.78 [2019-03-28 12:50:30,836 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 72.80/34.78 [2019-03-28 12:50:30,837 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. 72.80/34.78 [2019-03-28 12:50:30,838 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. 72.80/34.78 [2019-03-28 12:50:30,842 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 72.80/34.78 [2019-03-28 12:50:30,843 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 72.80/34.78 Termination analysis: LINEAR_WITH_GUESSES 72.80/34.78 Number of strict supporting invariants: 0 72.80/34.78 Number of non-strict supporting invariants: 1 72.80/34.78 Consider only non-deceasing supporting invariants: true 72.80/34.78 Simplify termination arguments: true 72.80/34.78 Simplify supporting invariants: trueOverapproximate stem: false 72.80/34.78 [2019-03-28 12:50:30,843 INFO L339 nArgumentSynthesizer]: Template has degree 0. 72.80/34.78 [2019-03-28 12:50:30,844 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 72.80/34.78 [2019-03-28 12:50:30,844 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 72.80/34.78 [2019-03-28 12:50:30,844 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 72.80/34.78 [2019-03-28 12:50:30,847 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. 72.80/34.78 [2019-03-28 12:50:30,847 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. 72.80/34.78 [2019-03-28 12:50:30,868 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. 72.80/34.78 [2019-03-28 12:50:30,881 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. 72.80/34.78 [2019-03-28 12:50:30,881 INFO L444 ModelExtractionUtils]: 36 out of 40 variables were initially zero. Simplification set additionally 1 variables to zero. 72.80/34.78 [2019-03-28 12:50:30,884 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... 72.80/34.78 [2019-03-28 12:50:30,885 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. 72.80/34.78 [2019-03-28 12:50:30,885 INFO L518 LassoAnalysis]: Proved termination. 72.80/34.78 [2019-03-28 12:50:30,886 INFO L520 LassoAnalysis]: Termination argument consisting of: 72.80/34.78 Ranking function f(ULTIMATE.start_diff_~i~0, ULTIMATE.start_diff_~l1~0) = -1*ULTIMATE.start_diff_~i~0 + 1*ULTIMATE.start_diff_~l1~0 72.80/34.78 Supporting invariants [] 72.80/34.78 [2019-03-28 12:50:30,958 INFO L297 tatePredicateManager]: 15 out of 15 supporting invariants were superfluous and have been removed 72.80/34.78 [2019-03-28 12:50:30,974 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 72.80/34.78 [2019-03-28 12:50:30,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 72.80/34.78 [2019-03-28 12:50:30,997 INFO L256 TraceCheckSpWp]: Trace formula consists of 83 conjuncts, 2 conjunts are in the unsatisfiable core 72.80/34.78 [2019-03-28 12:50:30,998 INFO L279 TraceCheckSpWp]: Computing forward predicates... 72.80/34.78 [2019-03-28 12:50:31,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 72.80/34.78 [2019-03-28 12:50:31,012 INFO L256 TraceCheckSpWp]: Trace formula consists of 30 conjuncts, 4 conjunts are in the unsatisfiable core 72.80/34.78 [2019-03-28 12:50:31,012 INFO L279 TraceCheckSpWp]: Computing forward predicates... 72.80/34.78 [2019-03-28 12:50:31,026 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. 72.80/34.78 [2019-03-28 12:50:31,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 72.80/34.78 [2019-03-28 12:50:31,076 INFO L256 TraceCheckSpWp]: Trace formula consists of 30 conjuncts, 4 conjunts are in the unsatisfiable core 72.80/34.78 [2019-03-28 12:50:31,076 INFO L279 TraceCheckSpWp]: Computing forward predicates... 72.80/34.78 [2019-03-28 12:50:31,104 INFO L98 LoopCannibalizer]: 2 predicates before loop cannibalization 3 predicates after loop cannibalization 72.80/34.78 [2019-03-28 12:50:31,110 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 72.80/34.78 [2019-03-28 12:50:31,111 INFO L69 BuchiDifferenceNCSB]: Start buchiDifferenceNCSB. First operand 20 states and 38 transitions. cyclomatic complexity: 19 Second operand 3 states. 72.80/34.78 [2019-03-28 12:50:31,199 INFO L73 BuchiDifferenceNCSB]: Finished buchiDifferenceNCSB. First operand 20 states and 38 transitions. cyclomatic complexity: 19. Second operand 3 states. Result 52 states and 89 transitions. Complement of second has 4 states. 72.80/34.78 [2019-03-28 12:50:31,199 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 72.80/34.78 [2019-03-28 12:50:31,200 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. 72.80/34.78 [2019-03-28 12:50:31,200 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 42 transitions. 72.80/34.78 [2019-03-28 12:50:31,202 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 42 transitions. Stem has 4 letters. Loop has 8 letters. 72.80/34.78 [2019-03-28 12:50:31,202 INFO L116 BuchiAccepts]: Finished buchiAccepts. 72.80/34.78 [2019-03-28 12:50:31,202 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 42 transitions. Stem has 12 letters. Loop has 8 letters. 72.80/34.78 [2019-03-28 12:50:31,203 INFO L116 BuchiAccepts]: Finished buchiAccepts. 72.80/34.78 [2019-03-28 12:50:31,203 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 42 transitions. Stem has 4 letters. Loop has 16 letters. 72.80/34.78 [2019-03-28 12:50:31,203 INFO L116 BuchiAccepts]: Finished buchiAccepts. 72.80/34.78 [2019-03-28 12:50:31,211 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 52 states and 89 transitions. 72.80/34.78 [2019-03-28 12:50:31,212 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 25 72.80/34.78 [2019-03-28 12:50:31,213 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 52 states to 47 states and 80 transitions. 72.80/34.78 [2019-03-28 12:50:31,213 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 30 72.80/34.78 [2019-03-28 12:50:31,213 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 31 72.80/34.78 [2019-03-28 12:50:31,214 INFO L73 IsDeterministic]: Start isDeterministic. Operand 47 states and 80 transitions. 72.80/34.78 [2019-03-28 12:50:31,214 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. 72.80/34.78 [2019-03-28 12:50:31,214 INFO L706 BuchiCegarLoop]: Abstraction has 47 states and 80 transitions. 72.80/34.78 [2019-03-28 12:50:31,214 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states and 80 transitions. 72.80/34.78 [2019-03-28 12:50:31,215 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 41. 72.80/34.78 [2019-03-28 12:50:31,216 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. 72.80/34.78 [2019-03-28 12:50:31,216 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 72 transitions. 72.80/34.78 [2019-03-28 12:50:31,216 INFO L729 BuchiCegarLoop]: Abstraction has 41 states and 72 transitions. 72.80/34.78 [2019-03-28 12:50:31,216 INFO L609 BuchiCegarLoop]: Abstraction has 41 states and 72 transitions. 72.80/34.78 [2019-03-28 12:50:31,216 INFO L442 BuchiCegarLoop]: ======== Iteration 5============ 72.80/34.78 [2019-03-28 12:50:31,216 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 41 states and 72 transitions. 72.80/34.78 [2019-03-28 12:50:31,217 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 20 72.80/34.78 [2019-03-28 12:50:31,217 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false 72.80/34.78 [2019-03-28 12:50:31,218 INFO L119 BuchiIsEmpty]: Starting construction of run 72.80/34.78 [2019-03-28 12:50:31,218 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] 72.80/34.78 [2019-03-28 12:50:31,218 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1] 72.80/34.78 [2019-03-28 12:50:31,219 INFO L794 eck$LassoCheckResult]: Stem: 367#ULTIMATE.startENTRY [150] ULTIMATE.startENTRY-->L34: Formula: (and (= |v_#NULL.offset_2| 0) (= (store |v_#valid_20| 0 0) |v_#valid_19|) (= 0 |v_#NULL.base_2|)) InVars {#valid=|v_#valid_20|} OutVars{ULTIMATE.start_main_#t~malloc8.base=|v_ULTIMATE.start_main_#t~malloc8.base_5|, ULTIMATE.start_main_#t~malloc9.base=|v_ULTIMATE.start_main_#t~malloc9.base_5|, ULTIMATE.start_main_~A~0.base=v_ULTIMATE.start_main_~A~0.base_3, ULTIMATE.start_main_~B~0.offset=v_ULTIMATE.start_main_~B~0.offset_3, #NULL.offset=|v_#NULL.offset_2|, ULTIMATE.start_main_#t~nondet6=|v_ULTIMATE.start_main_#t~nondet6_6|, ULTIMATE.start_main_#t~nondet7=|v_ULTIMATE.start_main_#t~nondet7_6|, ULTIMATE.start_main_~B~0.base=v_ULTIMATE.start_main_~B~0.base_3, #NULL.base=|v_#NULL.base_2|, ULTIMATE.start_main_~D~0.offset=v_ULTIMATE.start_main_~D~0.offset_3, ULTIMATE.start_main_#t~malloc10.base=|v_ULTIMATE.start_main_#t~malloc10.base_5|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_4|, ULTIMATE.start_main_#t~malloc8.offset=|v_ULTIMATE.start_main_#t~malloc8.offset_5|, #valid=|v_#valid_19|, ULTIMATE.start_main_#t~malloc9.offset=|v_ULTIMATE.start_main_#t~malloc9.offset_5|, ULTIMATE.start_main_~D~0.base=v_ULTIMATE.start_main_~D~0.base_3, ULTIMATE.start_main_~A~0.offset=v_ULTIMATE.start_main_~A~0.offset_3, ULTIMATE.start_main_~Blen~0=v_ULTIMATE.start_main_~Blen~0_8, ULTIMATE.start_main_~Alen~0=v_ULTIMATE.start_main_~Alen~0_8, ULTIMATE.start_main_#t~malloc10.offset=|v_ULTIMATE.start_main_#t~malloc10.offset_5|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~malloc8.base, ULTIMATE.start_main_#t~malloc9.base, ULTIMATE.start_main_~A~0.base, ULTIMATE.start_main_~B~0.offset, #NULL.offset, ULTIMATE.start_main_#t~nondet6, ULTIMATE.start_main_#t~nondet7, ULTIMATE.start_main_~B~0.base, #NULL.base, ULTIMATE.start_main_~D~0.offset, ULTIMATE.start_main_#t~malloc10.base, ULTIMATE.start_main_#res, ULTIMATE.start_main_#t~malloc8.offset, #valid, ULTIMATE.start_main_#t~malloc9.offset, ULTIMATE.start_main_~D~0.base, ULTIMATE.start_main_~A~0.offset, ULTIMATE.start_main_~Blen~0, ULTIMATE.start_main_~Alen~0, ULTIMATE.start_main_#t~malloc10.offset] 368#L34 [75] L34-->L34-2: Formula: (and (< v_ULTIMATE.start_main_~Alen~0_5 1) (= v_ULTIMATE.start_main_~Alen~0_4 1)) InVars {ULTIMATE.start_main_~Alen~0=v_ULTIMATE.start_main_~Alen~0_5} OutVars{ULTIMATE.start_main_~Alen~0=v_ULTIMATE.start_main_~Alen~0_4} AuxVars[] AssignedVars[ULTIMATE.start_main_~Alen~0] 369#L34-2 [105] L34-2-->L37-1: Formula: (>= v_ULTIMATE.start_main_~Blen~0_6 1) InVars {ULTIMATE.start_main_~Blen~0=v_ULTIMATE.start_main_~Blen~0_6} OutVars{ULTIMATE.start_main_~Blen~0=v_ULTIMATE.start_main_~Blen~0_6} AuxVars[] AssignedVars[] 370#L37-1 [125] L37-1-->L13-2: Formula: (let ((.cse2 (store |v_#valid_10| |v_ULTIMATE.start_main_#t~malloc8.base_4| 1))) (let ((.cse0 (store .cse2 |v_ULTIMATE.start_main_#t~malloc9.base_4| 1))) (and (= v_ULTIMATE.start_diff_~k~0_1 0) (= v_ULTIMATE.start_diff_~l2~0_1 v_ULTIMATE.start_diff_~Blen_1) (= v_ULTIMATE.start_diff_~A.base_1 |v_ULTIMATE.start_diff_#in~A.base_1|) (= |v_#valid_7| (store .cse0 |v_ULTIMATE.start_main_#t~malloc10.base_4| 1)) (< |v_ULTIMATE.start_main_#t~malloc10.base_4| |v_#StackHeapBarrier_1|) (= v_ULTIMATE.start_diff_~Blen_1 |v_ULTIMATE.start_diff_#in~Blen_1|) (= v_ULTIMATE.start_diff_~B.base_1 |v_ULTIMATE.start_diff_#in~B.base_1|) (> |v_ULTIMATE.start_main_#t~malloc8.base_4| 0) (= v_ULTIMATE.start_diff_~Alen_1 |v_ULTIMATE.start_diff_#in~Alen_1|) (= v_ULTIMATE.start_main_~B~0.offset_2 |v_ULTIMATE.start_main_#t~malloc9.offset_4|) (= v_ULTIMATE.start_main_~B~0.base_2 |v_ULTIMATE.start_main_#t~malloc9.base_4|) (= |v_ULTIMATE.start_diff_#in~A.base_1| v_ULTIMATE.start_main_~A~0.base_2) (= |v_ULTIMATE.start_main_#t~malloc8.offset_4| 0) (> |v_ULTIMATE.start_main_#t~malloc10.base_4| 0) (= |v_#length_1| (let ((.cse1 (* 4 v_ULTIMATE.start_main_~Alen~0_7))) (store (store (store |v_#length_4| |v_ULTIMATE.start_main_#t~malloc8.base_4| .cse1) |v_ULTIMATE.start_main_#t~malloc9.base_4| (* 4 v_ULTIMATE.start_main_~Blen~0_7)) |v_ULTIMATE.start_main_#t~malloc10.base_4| .cse1))) (= v_ULTIMATE.start_diff_~D.base_1 |v_ULTIMATE.start_diff_#in~D.base_1|) (= |v_ULTIMATE.start_main_#t~malloc9.offset_4| 0) (= |v_ULTIMATE.start_diff_#in~B.offset_1| v_ULTIMATE.start_main_~B~0.offset_2) (= |v_ULTIMATE.start_diff_#in~A.offset_1| v_ULTIMATE.start_main_~A~0.offset_2) (= v_ULTIMATE.start_diff_~B.offset_1 |v_ULTIMATE.start_diff_#in~B.offset_1|) (= v_ULTIMATE.start_main_~A~0.base_2 |v_ULTIMATE.start_main_#t~malloc8.base_4|) (< |v_ULTIMATE.start_main_#t~malloc8.base_4| |v_#StackHeapBarrier_1|) (= |v_ULTIMATE.start_diff_#in~B.base_1| v_ULTIMATE.start_main_~B~0.base_2) (< |v_ULTIMATE.start_main_#t~malloc9.base_4| |v_#StackHeapBarrier_1|) (= |v_ULTIMATE.start_diff_#in~D.offset_1| v_ULTIMATE.start_main_~D~0.offset_2) (= v_ULTIMATE.start_main_~D~0.offset_2 |v_ULTIMATE.start_main_#t~malloc10.offset_4|) (= v_ULTIMATE.start_diff_~i~0_1 0) (= 0 (select .cse2 |v_ULTIMATE.start_main_#t~malloc9.base_4|)) (= v_ULTIMATE.start_main_~D~0.base_2 |v_ULTIMATE.start_main_#t~malloc10.base_4|) (= |v_ULTIMATE.start_diff_#in~Blen_1| v_ULTIMATE.start_main_~Blen~0_7) (= v_ULTIMATE.start_diff_~l1~0_1 v_ULTIMATE.start_diff_~Alen_1) (= 0 (select .cse0 |v_ULTIMATE.start_main_#t~malloc10.base_4|)) (= (select |v_#valid_10| |v_ULTIMATE.start_main_#t~malloc8.base_4|) 0) (= v_ULTIMATE.start_diff_~A.offset_1 |v_ULTIMATE.start_diff_#in~A.offset_1|) (= |v_ULTIMATE.start_diff_#in~Alen_1| v_ULTIMATE.start_main_~Alen~0_7) (> 0 |v_ULTIMATE.start_main_#t~malloc9.base_4|) (= v_ULTIMATE.start_main_~A~0.offset_2 |v_ULTIMATE.start_main_#t~malloc8.offset_4|) (= |v_ULTIMATE.start_main_#t~malloc10.offset_4| 0) (= |v_ULTIMATE.start_diff_#in~D.base_1| v_ULTIMATE.start_main_~D~0.base_2) (= v_ULTIMATE.start_diff_~D.offset_1 |v_ULTIMATE.start_diff_#in~D.offset_1|)))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_4|, #valid=|v_#valid_10|, ULTIMATE.start_main_~Blen~0=v_ULTIMATE.start_main_~Blen~0_7, ULTIMATE.start_main_~Alen~0=v_ULTIMATE.start_main_~Alen~0_7} OutVars{ULTIMATE.start_diff_#in~A.base=|v_ULTIMATE.start_diff_#in~A.base_1|, ULTIMATE.start_diff_#in~B.base=|v_ULTIMATE.start_diff_#in~B.base_1|, ULTIMATE.start_diff_~B.offset=v_ULTIMATE.start_diff_~B.offset_1, ULTIMATE.start_diff_~Alen=v_ULTIMATE.start_diff_~Alen_1, ULTIMATE.start_diff_~D.base=v_ULTIMATE.start_diff_~D.base_1, ULTIMATE.start_diff_#in~Blen=|v_ULTIMATE.start_diff_#in~Blen_1|, ULTIMATE.start_main_~B~0.offset=v_ULTIMATE.start_main_~B~0.offset_2, ULTIMATE.start_main_~B~0.base=v_ULTIMATE.start_main_~B~0.base_2, ULTIMATE.start_diff_#in~A.offset=|v_ULTIMATE.start_diff_#in~A.offset_1|, ULTIMATE.start_main_~D~0.offset=v_ULTIMATE.start_main_~D~0.offset_2, ULTIMATE.start_diff_#in~D.offset=|v_ULTIMATE.start_diff_#in~D.offset_1|, ULTIMATE.start_diff_#in~Alen=|v_ULTIMATE.start_diff_#in~Alen_1|, ULTIMATE.start_diff_~A.base=v_ULTIMATE.start_diff_~A.base_1, ULTIMATE.start_diff_~B.base=v_ULTIMATE.start_diff_~B.base_1, #length=|v_#length_1|, ULTIMATE.start_main_#t~malloc9.offset=|v_ULTIMATE.start_main_#t~malloc9.offset_4|, ULTIMATE.start_diff_#t~mem3=|v_ULTIMATE.start_diff_#t~mem3_1|, ULTIMATE.start_main_~A~0.offset=v_ULTIMATE.start_main_~A~0.offset_2, ULTIMATE.start_main_#t~malloc10.offset=|v_ULTIMATE.start_main_#t~malloc10.offset_4|, ULTIMATE.start_main_~Blen~0=v_ULTIMATE.start_main_~Blen~0_7, ULTIMATE.start_main_~Alen~0=v_ULTIMATE.start_main_~Alen~0_7, ULTIMATE.start_diff_~Blen=v_ULTIMATE.start_diff_~Blen_1, ULTIMATE.start_main_#t~malloc8.base=|v_ULTIMATE.start_main_#t~malloc8.base_4|, ULTIMATE.start_diff_#t~mem0=|v_ULTIMATE.start_diff_#t~mem0_1|, ULTIMATE.start_main_#t~malloc9.base=|v_ULTIMATE.start_main_#t~malloc9.base_4|, ULTIMATE.start_diff_#t~mem1=|v_ULTIMATE.start_diff_#t~mem1_1|, ULTIMATE.start_main_~A~0.base=v_ULTIMATE.start_main_~A~0.base_2, ULTIMATE.start_diff_#t~post4=|v_ULTIMATE.start_diff_#t~post4_1|, ULTIMATE.start_diff_~found~0=v_ULTIMATE.start_diff_~found~0_1, ULTIMATE.start_diff_#in~B.offset=|v_ULTIMATE.start_diff_#in~B.offset_1|, ULTIMATE.start_diff_~i~0=v_ULTIMATE.start_diff_~i~0_1, ULTIMATE.start_diff_~l1~0=v_ULTIMATE.start_diff_~l1~0_1, ULTIMATE.start_diff_#t~post5=|v_ULTIMATE.start_diff_#t~post5_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, ULTIMATE.start_main_#t~malloc10.base=|v_ULTIMATE.start_main_#t~malloc10.base_4|, ULTIMATE.start_diff_~D.offset=v_ULTIMATE.start_diff_~D.offset_1, ULTIMATE.start_diff_~l2~0=v_ULTIMATE.start_diff_~l2~0_1, ULTIMATE.start_diff_~j~0=v_ULTIMATE.start_diff_~j~0_1, ULTIMATE.start_main_#t~malloc8.offset=|v_ULTIMATE.start_main_#t~malloc8.offset_4|, #valid=|v_#valid_7|, ULTIMATE.start_diff_~k~0=v_ULTIMATE.start_diff_~k~0_1, ULTIMATE.start_diff_#in~D.base=|v_ULTIMATE.start_diff_#in~D.base_1|, ULTIMATE.start_diff_#t~post2=|v_ULTIMATE.start_diff_#t~post2_1|, ULTIMATE.start_diff_~A.offset=v_ULTIMATE.start_diff_~A.offset_1, ULTIMATE.start_main_~D~0.base=v_ULTIMATE.start_main_~D~0.base_2} AuxVars[] AssignedVars[ULTIMATE.start_diff_#in~A.base, ULTIMATE.start_diff_#in~B.base, ULTIMATE.start_diff_~B.offset, ULTIMATE.start_diff_~Alen, ULTIMATE.start_diff_~D.base, ULTIMATE.start_diff_#in~Blen, ULTIMATE.start_main_~B~0.offset, ULTIMATE.start_main_~B~0.base, ULTIMATE.start_diff_#in~A.offset, ULTIMATE.start_main_~D~0.offset, ULTIMATE.start_diff_#in~D.offset, ULTIMATE.start_diff_#in~Alen, ULTIMATE.start_diff_~A.base, ULTIMATE.start_diff_~B.base, #length, ULTIMATE.start_main_#t~malloc9.offset, ULTIMATE.start_diff_#t~mem3, ULTIMATE.start_main_~A~0.offset, ULTIMATE.start_main_#t~malloc10.offset, ULTIMATE.start_diff_~Blen, ULTIMATE.start_main_#t~malloc8.base, ULTIMATE.start_diff_#t~mem0, ULTIMATE.start_main_#t~malloc9.base, ULTIMATE.start_diff_#t~mem1, ULTIMATE.start_main_~A~0.base, ULTIMATE.start_diff_#t~post4, ULTIMATE.start_diff_~found~0, ULTIMATE.start_diff_#in~B.offset, ULTIMATE.start_diff_~i~0, ULTIMATE.start_diff_~l1~0, ULTIMATE.start_diff_#t~post5, ULTIMATE.start_main_#t~malloc10.base, ULTIMATE.start_diff_~D.offset, ULTIMATE.start_diff_~l2~0, ULTIMATE.start_diff_~j~0, ULTIMATE.start_main_#t~malloc8.offset, #valid, ULTIMATE.start_diff_~k~0, ULTIMATE.start_diff_#in~D.base, ULTIMATE.start_diff_#t~post2, ULTIMATE.start_diff_~A.offset, ULTIMATE.start_main_~D~0.base] 375#L13-2 72.80/34.78 [2019-03-28 12:50:31,219 INFO L796 eck$LassoCheckResult]: Loop: 375#L13-2 [91] L13-2-->L17-4: Formula: (and (< v_ULTIMATE.start_diff_~i~0_4 v_ULTIMATE.start_diff_~l1~0_4) (= v_ULTIMATE.start_diff_~j~0_2 0) (= v_ULTIMATE.start_diff_~found~0_3 0)) InVars {ULTIMATE.start_diff_~i~0=v_ULTIMATE.start_diff_~i~0_4, ULTIMATE.start_diff_~l1~0=v_ULTIMATE.start_diff_~l1~0_4} OutVars{ULTIMATE.start_diff_~found~0=v_ULTIMATE.start_diff_~found~0_3, ULTIMATE.start_diff_~i~0=v_ULTIMATE.start_diff_~i~0_4, ULTIMATE.start_diff_~l1~0=v_ULTIMATE.start_diff_~l1~0_4, ULTIMATE.start_diff_~j~0=v_ULTIMATE.start_diff_~j~0_2} AuxVars[] AssignedVars[ULTIMATE.start_diff_~found~0, ULTIMATE.start_diff_~j~0] 395#L17-4 [99] L17-4-->L17: Formula: (and (= 0 v_ULTIMATE.start_diff_~found~0_5) (< v_ULTIMATE.start_diff_~j~0_4 v_ULTIMATE.start_diff_~l2~0_4)) InVars {ULTIMATE.start_diff_~found~0=v_ULTIMATE.start_diff_~found~0_5, ULTIMATE.start_diff_~j~0=v_ULTIMATE.start_diff_~j~0_4, ULTIMATE.start_diff_~l2~0=v_ULTIMATE.start_diff_~l2~0_4} OutVars{ULTIMATE.start_diff_~found~0=v_ULTIMATE.start_diff_~found~0_5, ULTIMATE.start_diff_~j~0=v_ULTIMATE.start_diff_~j~0_4, ULTIMATE.start_diff_~l2~0=v_ULTIMATE.start_diff_~l2~0_4} AuxVars[] AssignedVars[] 389#L17 [85] L17-->L17-1: Formula: (let ((.cse0 (* 4 v_ULTIMATE.start_diff_~i~0_5))) (let ((.cse1 (+ .cse0 v_ULTIMATE.start_diff_~A.offset_3))) (and (<= (+ .cse0 v_ULTIMATE.start_diff_~A.offset_3 4) (select |v_#length_5| v_ULTIMATE.start_diff_~A.base_3)) (= 1 (select |v_#valid_11| v_ULTIMATE.start_diff_~A.base_3)) (= (select (select |v_#memory_int_1| v_ULTIMATE.start_diff_~A.base_3) .cse1) |v_ULTIMATE.start_diff_#t~mem0_2|) (<= 0 .cse1)))) InVars {ULTIMATE.start_diff_~i~0=v_ULTIMATE.start_diff_~i~0_5, ULTIMATE.start_diff_~A.base=v_ULTIMATE.start_diff_~A.base_3, #valid=|v_#valid_11|, #memory_int=|v_#memory_int_1|, #length=|v_#length_5|, ULTIMATE.start_diff_~A.offset=v_ULTIMATE.start_diff_~A.offset_3} OutVars{ULTIMATE.start_diff_#t~mem0=|v_ULTIMATE.start_diff_#t~mem0_2|, ULTIMATE.start_diff_~i~0=v_ULTIMATE.start_diff_~i~0_5, ULTIMATE.start_diff_~A.base=v_ULTIMATE.start_diff_~A.base_3, #valid=|v_#valid_11|, #memory_int=|v_#memory_int_1|, #length=|v_#length_5|, ULTIMATE.start_diff_~A.offset=v_ULTIMATE.start_diff_~A.offset_3} AuxVars[] AssignedVars[ULTIMATE.start_diff_#t~mem0] 393#L17-1 [82] L17-1-->L17-2: Formula: (let ((.cse1 (* 4 v_ULTIMATE.start_diff_~j~0_5))) (let ((.cse0 (+ v_ULTIMATE.start_diff_~B.offset_3 .cse1))) (and (<= 0 .cse0) (= 1 (select |v_#valid_13| v_ULTIMATE.start_diff_~B.base_3)) (= (select (select |v_#memory_int_2| v_ULTIMATE.start_diff_~B.base_3) .cse0) |v_ULTIMATE.start_diff_#t~mem1_2|) (<= (+ v_ULTIMATE.start_diff_~B.offset_3 .cse1 4) (select |v_#length_7| v_ULTIMATE.start_diff_~B.base_3))))) InVars {ULTIMATE.start_diff_~B.offset=v_ULTIMATE.start_diff_~B.offset_3, ULTIMATE.start_diff_~j~0=v_ULTIMATE.start_diff_~j~0_5, #valid=|v_#valid_13|, ULTIMATE.start_diff_~B.base=v_ULTIMATE.start_diff_~B.base_3, #memory_int=|v_#memory_int_2|, #length=|v_#length_7|} OutVars{ULTIMATE.start_diff_#t~mem1=|v_ULTIMATE.start_diff_#t~mem1_2|, ULTIMATE.start_diff_~B.offset=v_ULTIMATE.start_diff_~B.offset_3, ULTIMATE.start_diff_~j~0=v_ULTIMATE.start_diff_~j~0_5, #valid=|v_#valid_13|, ULTIMATE.start_diff_~B.base=v_ULTIMATE.start_diff_~B.base_3, #memory_int=|v_#memory_int_2|, #length=|v_#length_7|} AuxVars[] AssignedVars[ULTIMATE.start_diff_#t~mem1] 391#L17-2 [80] L17-2-->L17-4: Formula: (and (= |v_ULTIMATE.start_diff_#t~mem1_4| |v_ULTIMATE.start_diff_#t~mem0_4|) (= v_ULTIMATE.start_diff_~found~0_6 1)) InVars {ULTIMATE.start_diff_#t~mem0=|v_ULTIMATE.start_diff_#t~mem0_4|, ULTIMATE.start_diff_#t~mem1=|v_ULTIMATE.start_diff_#t~mem1_4|} OutVars{ULTIMATE.start_diff_#t~mem0=|v_ULTIMATE.start_diff_#t~mem0_3|, ULTIMATE.start_diff_#t~mem1=|v_ULTIMATE.start_diff_#t~mem1_3|, ULTIMATE.start_diff_~found~0=v_ULTIMATE.start_diff_~found~0_6} AuxVars[] AssignedVars[ULTIMATE.start_diff_#t~mem0, ULTIMATE.start_diff_#t~mem1, ULTIMATE.start_diff_~found~0] 388#L17-4 [127] L17-4-->L16-2: Formula: (< 0 v_ULTIMATE.start_diff_~found~0_4) InVars {ULTIMATE.start_diff_~found~0=v_ULTIMATE.start_diff_~found~0_4} OutVars{ULTIMATE.start_diff_~found~0=v_ULTIMATE.start_diff_~found~0_4} AuxVars[] AssignedVars[] 384#L16-2 [130] L16-2-->L23-1: Formula: (< 0 v_ULTIMATE.start_diff_~found~0_8) InVars {ULTIMATE.start_diff_~found~0=v_ULTIMATE.start_diff_~found~0_8} OutVars{ULTIMATE.start_diff_~found~0=v_ULTIMATE.start_diff_~found~0_8} AuxVars[] AssignedVars[] 374#L23-1 [74] L23-1-->L13-2: Formula: (= v_ULTIMATE.start_diff_~i~0_9 (+ v_ULTIMATE.start_diff_~i~0_10 1)) InVars {ULTIMATE.start_diff_~i~0=v_ULTIMATE.start_diff_~i~0_10} OutVars{ULTIMATE.start_diff_#t~post5=|v_ULTIMATE.start_diff_#t~post5_2|, ULTIMATE.start_diff_~i~0=v_ULTIMATE.start_diff_~i~0_9} AuxVars[] AssignedVars[ULTIMATE.start_diff_#t~post5, ULTIMATE.start_diff_~i~0] 375#L13-2 72.80/34.78 [2019-03-28 12:50:31,219 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 72.80/34.78 [2019-03-28 12:50:31,220 INFO L82 PathProgramCache]: Analyzing trace with hash 5467626, now seen corresponding path program 1 times 72.80/34.78 [2019-03-28 12:50:31,220 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 72.80/34.78 [2019-03-28 12:50:31,220 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 72.80/34.78 [2019-03-28 12:50:31,221 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 72.80/34.78 [2019-03-28 12:50:31,221 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 72.80/34.78 [2019-03-28 12:50:31,221 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 72.80/34.78 [2019-03-28 12:50:31,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 72.80/34.78 [2019-03-28 12:50:31,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 72.80/34.78 [2019-03-28 12:50:31,234 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 72.80/34.78 [2019-03-28 12:50:31,234 INFO L82 PathProgramCache]: Analyzing trace with hash -1945236739, now seen corresponding path program 2 times 72.80/34.78 [2019-03-28 12:50:31,234 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 72.80/34.78 [2019-03-28 12:50:31,234 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 72.80/34.78 [2019-03-28 12:50:31,235 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 72.80/34.78 [2019-03-28 12:50:31,235 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 72.80/34.78 [2019-03-28 12:50:31,235 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 72.80/34.78 [2019-03-28 12:50:31,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 72.80/34.78 [2019-03-28 12:50:31,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 72.80/34.78 [2019-03-28 12:50:31,242 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 72.80/34.78 [2019-03-28 12:50:31,242 INFO L82 PathProgramCache]: Analyzing trace with hash -1628602394, now seen corresponding path program 1 times 72.80/34.78 [2019-03-28 12:50:31,242 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 72.80/34.78 [2019-03-28 12:50:31,242 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 72.80/34.78 [2019-03-28 12:50:31,243 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 72.80/34.78 [2019-03-28 12:50:31,243 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY 72.80/34.78 [2019-03-28 12:50:31,243 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 72.80/34.78 [2019-03-28 12:50:31,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 72.80/34.78 [2019-03-28 12:50:31,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 72.80/34.78 [2019-03-28 12:50:31,869 WARN L188 SmtUtils]: Spent 477.00 ms on a formula simplification. DAG size of input: 105 DAG size of output: 104 72.80/34.78 [2019-03-28 12:50:32,091 WARN L188 SmtUtils]: Spent 220.00 ms on a formula simplification that was a NOOP. DAG size: 100 72.80/34.78 [2019-03-28 12:50:32,094 INFO L216 LassoAnalysis]: Preferences: 72.80/34.78 [2019-03-28 12:50:32,094 INFO L124 ssoRankerPreferences]: Compute integeral hull: false 72.80/34.78 [2019-03-28 12:50:32,094 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true 72.80/34.78 [2019-03-28 12:50:32,094 INFO L126 ssoRankerPreferences]: Term annotations enabled: false 72.80/34.78 [2019-03-28 12:50:32,094 INFO L127 ssoRankerPreferences]: Use exernal solver: false 72.80/34.78 [2019-03-28 12:50:32,094 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 72.80/34.78 [2019-03-28 12:50:32,094 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false 72.80/34.78 [2019-03-28 12:50:32,094 INFO L130 ssoRankerPreferences]: Path of dumped script: 72.80/34.78 [2019-03-28 12:50:32,095 INFO L131 ssoRankerPreferences]: Filename of dumped script: theBenchmark.c_BEv2_Iteration5_Lasso 72.80/34.78 [2019-03-28 12:50:32,095 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank 72.80/34.78 [2019-03-28 12:50:32,095 INFO L282 LassoAnalysis]: Starting lasso preprocessing... 72.80/34.78 [2019-03-28 12:50:32,098 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 72.80/34.78 [2019-03-28 12:50:32,102 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 72.80/34.78 [2019-03-28 12:50:32,104 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 72.80/34.78 [2019-03-28 12:50:32,106 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 72.80/34.78 [2019-03-28 12:50:32,448 WARN L188 SmtUtils]: Spent 258.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 89 72.80/34.78 [2019-03-28 12:50:32,491 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 72.80/34.78 [2019-03-28 12:50:32,494 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 72.80/34.78 [2019-03-28 12:50:32,497 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 72.80/34.78 [2019-03-28 12:50:32,499 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 72.80/34.78 [2019-03-28 12:50:32,500 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 72.80/34.78 [2019-03-28 12:50:32,501 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 72.80/34.78 [2019-03-28 12:50:32,503 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 72.80/34.78 [2019-03-28 12:50:32,505 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 72.80/34.78 [2019-03-28 12:50:32,512 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 72.80/34.78 [2019-03-28 12:50:32,514 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 72.80/34.78 [2019-03-28 12:50:32,515 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 72.80/34.78 [2019-03-28 12:50:32,942 INFO L300 LassoAnalysis]: Preprocessing complete. 72.80/34.78 [2019-03-28 12:50:32,942 INFO L497 LassoAnalysis]: Using template 'affine'. 72.80/34.78 [2019-03-28 12:50:32,942 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 72.80/34.78 Termination analysis: LINEAR_WITH_GUESSES 72.80/34.78 Number of strict supporting invariants: 0 72.80/34.78 Number of non-strict supporting invariants: 1 72.80/34.78 Consider only non-deceasing supporting invariants: true 72.80/34.78 Simplify termination arguments: true 72.80/34.78 Simplify supporting invariants: trueOverapproximate stem: false 72.80/34.78 [2019-03-28 12:50:32,943 INFO L339 nArgumentSynthesizer]: Template has degree 0. 72.80/34.78 [2019-03-28 12:50:32,943 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 72.80/34.78 [2019-03-28 12:50:32,944 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 72.80/34.78 [2019-03-28 12:50:32,944 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 72.80/34.78 [2019-03-28 12:50:32,945 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. 72.80/34.78 [2019-03-28 12:50:32,945 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. 72.80/34.78 [2019-03-28 12:50:32,947 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 72.80/34.78 [2019-03-28 12:50:32,947 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 72.80/34.78 Termination analysis: LINEAR_WITH_GUESSES 72.80/34.78 Number of strict supporting invariants: 0 72.80/34.78 Number of non-strict supporting invariants: 1 72.80/34.78 Consider only non-deceasing supporting invariants: true 72.80/34.78 Simplify termination arguments: true 72.80/34.78 Simplify supporting invariants: trueOverapproximate stem: false 72.80/34.78 [2019-03-28 12:50:32,948 INFO L339 nArgumentSynthesizer]: Template has degree 0. 72.80/34.78 [2019-03-28 12:50:32,948 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 72.80/34.78 [2019-03-28 12:50:32,948 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 72.80/34.78 [2019-03-28 12:50:32,948 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 72.80/34.78 [2019-03-28 12:50:32,948 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 72.80/34.78 [2019-03-28 12:50:32,948 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 72.80/34.78 [2019-03-28 12:50:32,949 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 72.80/34.78 [2019-03-28 12:50:32,949 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 72.80/34.78 [2019-03-28 12:50:32,949 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 72.80/34.78 Termination analysis: LINEAR_WITH_GUESSES 72.80/34.78 Number of strict supporting invariants: 0 72.80/34.78 Number of non-strict supporting invariants: 1 72.80/34.78 Consider only non-deceasing supporting invariants: true 72.80/34.78 Simplify termination arguments: true 72.80/34.78 Simplify supporting invariants: trueOverapproximate stem: false 72.80/34.78 [2019-03-28 12:50:32,950 INFO L339 nArgumentSynthesizer]: Template has degree 0. 72.80/34.78 [2019-03-28 12:50:32,950 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 72.80/34.78 [2019-03-28 12:50:32,950 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 72.80/34.78 [2019-03-28 12:50:32,950 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 72.80/34.78 [2019-03-28 12:50:32,950 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 72.80/34.78 [2019-03-28 12:50:32,950 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 72.80/34.78 [2019-03-28 12:50:32,950 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 72.80/34.78 [2019-03-28 12:50:32,951 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 72.80/34.78 [2019-03-28 12:50:32,951 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 72.80/34.78 Termination analysis: LINEAR_WITH_GUESSES 72.80/34.78 Number of strict supporting invariants: 0 72.80/34.78 Number of non-strict supporting invariants: 1 72.80/34.78 Consider only non-deceasing supporting invariants: true 72.80/34.78 Simplify termination arguments: true 72.80/34.78 Simplify supporting invariants: trueOverapproximate stem: false 72.80/34.78 [2019-03-28 12:50:32,951 INFO L339 nArgumentSynthesizer]: Template has degree 0. 72.80/34.78 [2019-03-28 12:50:32,952 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 72.80/34.78 [2019-03-28 12:50:32,952 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 72.80/34.78 [2019-03-28 12:50:32,952 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 72.80/34.78 [2019-03-28 12:50:32,953 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. 72.80/34.78 [2019-03-28 12:50:32,953 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. 72.80/34.78 [2019-03-28 12:50:32,957 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 72.80/34.78 [2019-03-28 12:50:32,957 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 72.80/34.78 Termination analysis: LINEAR_WITH_GUESSES 72.80/34.78 Number of strict supporting invariants: 0 72.80/34.78 Number of non-strict supporting invariants: 1 72.80/34.78 Consider only non-deceasing supporting invariants: true 72.80/34.78 Simplify termination arguments: true 72.80/34.78 Simplify supporting invariants: trueOverapproximate stem: false 72.80/34.78 [2019-03-28 12:50:32,958 INFO L339 nArgumentSynthesizer]: Template has degree 0. 72.80/34.78 [2019-03-28 12:50:32,958 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 72.80/34.78 [2019-03-28 12:50:32,958 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 72.80/34.78 [2019-03-28 12:50:32,958 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 72.80/34.78 [2019-03-28 12:50:32,958 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 72.80/34.78 [2019-03-28 12:50:32,959 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 72.80/34.78 [2019-03-28 12:50:32,959 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 72.80/34.78 [2019-03-28 12:50:32,960 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 72.80/34.78 [2019-03-28 12:50:32,960 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 72.80/34.78 Termination analysis: LINEAR_WITH_GUESSES 72.80/34.78 Number of strict supporting invariants: 0 72.80/34.78 Number of non-strict supporting invariants: 1 72.80/34.78 Consider only non-deceasing supporting invariants: true 72.80/34.78 Simplify termination arguments: true 72.80/34.78 Simplify supporting invariants: trueOverapproximate stem: false 72.80/34.78 [2019-03-28 12:50:32,960 INFO L339 nArgumentSynthesizer]: Template has degree 0. 72.80/34.78 [2019-03-28 12:50:32,960 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 72.80/34.78 [2019-03-28 12:50:32,961 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 72.80/34.78 [2019-03-28 12:50:32,961 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 72.80/34.78 [2019-03-28 12:50:32,962 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. 72.80/34.78 [2019-03-28 12:50:32,962 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. 72.80/34.78 [2019-03-28 12:50:32,969 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 72.80/34.78 [2019-03-28 12:50:32,969 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 72.80/34.78 Termination analysis: LINEAR_WITH_GUESSES 72.80/34.78 Number of strict supporting invariants: 0 72.80/34.78 Number of non-strict supporting invariants: 1 72.80/34.78 Consider only non-deceasing supporting invariants: true 72.80/34.78 Simplify termination arguments: true 72.80/34.78 Simplify supporting invariants: trueOverapproximate stem: false 72.80/34.78 [2019-03-28 12:50:32,970 INFO L339 nArgumentSynthesizer]: Template has degree 0. 72.80/34.78 [2019-03-28 12:50:32,970 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 72.80/34.78 [2019-03-28 12:50:32,970 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 72.80/34.78 [2019-03-28 12:50:32,970 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 72.80/34.78 [2019-03-28 12:50:32,971 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. 72.80/34.78 [2019-03-28 12:50:32,971 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. 72.80/34.78 [2019-03-28 12:50:32,973 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 72.80/34.78 [2019-03-28 12:50:32,973 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 72.80/34.78 Termination analysis: LINEAR_WITH_GUESSES 72.80/34.78 Number of strict supporting invariants: 0 72.80/34.78 Number of non-strict supporting invariants: 1 72.80/34.78 Consider only non-deceasing supporting invariants: true 72.80/34.78 Simplify termination arguments: true 72.80/34.78 Simplify supporting invariants: trueOverapproximate stem: false 72.80/34.78 [2019-03-28 12:50:32,973 INFO L339 nArgumentSynthesizer]: Template has degree 0. 72.80/34.78 [2019-03-28 12:50:32,973 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 72.80/34.78 [2019-03-28 12:50:32,974 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 72.80/34.78 [2019-03-28 12:50:32,974 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 72.80/34.78 [2019-03-28 12:50:32,974 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. 72.80/34.78 [2019-03-28 12:50:32,975 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. 72.80/34.78 [2019-03-28 12:50:32,976 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 72.80/34.78 [2019-03-28 12:50:32,977 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 72.80/34.78 Termination analysis: LINEAR_WITH_GUESSES 72.80/34.78 Number of strict supporting invariants: 0 72.80/34.78 Number of non-strict supporting invariants: 1 72.80/34.78 Consider only non-deceasing supporting invariants: true 72.80/34.78 Simplify termination arguments: true 72.80/34.78 Simplify supporting invariants: trueOverapproximate stem: false 72.80/34.78 [2019-03-28 12:50:32,977 INFO L339 nArgumentSynthesizer]: Template has degree 0. 72.80/34.78 [2019-03-28 12:50:32,977 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 72.80/34.78 [2019-03-28 12:50:32,977 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 72.80/34.78 [2019-03-28 12:50:32,978 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 72.80/34.78 [2019-03-28 12:50:32,979 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. 72.80/34.78 [2019-03-28 12:50:32,979 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. 72.80/34.78 [2019-03-28 12:50:32,983 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 72.80/34.78 [2019-03-28 12:50:32,983 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 72.80/34.78 Termination analysis: LINEAR_WITH_GUESSES 72.80/34.78 Number of strict supporting invariants: 0 72.80/34.78 Number of non-strict supporting invariants: 1 72.80/34.78 Consider only non-deceasing supporting invariants: true 72.80/34.78 Simplify termination arguments: true 72.80/34.78 Simplify supporting invariants: trueOverapproximate stem: false 72.80/34.78 [2019-03-28 12:50:32,984 INFO L339 nArgumentSynthesizer]: Template has degree 0. 72.80/34.78 [2019-03-28 12:50:32,984 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 72.80/34.78 [2019-03-28 12:50:32,984 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 72.80/34.78 [2019-03-28 12:50:32,984 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 72.80/34.78 [2019-03-28 12:50:32,987 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. 72.80/34.78 [2019-03-28 12:50:32,987 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. 72.80/34.78 [2019-03-28 12:50:33,012 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. 72.80/34.78 [2019-03-28 12:50:33,037 INFO L443 ModelExtractionUtils]: Simplification made 6 calls to the SMT solver. 72.80/34.78 [2019-03-28 12:50:33,037 INFO L444 ModelExtractionUtils]: 31 out of 40 variables were initially zero. Simplification set additionally 6 variables to zero. 72.80/34.78 [2019-03-28 12:50:33,038 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... 72.80/34.78 [2019-03-28 12:50:33,039 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. 72.80/34.78 [2019-03-28 12:50:33,039 INFO L518 LassoAnalysis]: Proved termination. 72.80/34.78 [2019-03-28 12:50:33,039 INFO L520 LassoAnalysis]: Termination argument consisting of: 72.80/34.78 Ranking function f(ULTIMATE.start_diff_~i~0, ULTIMATE.start_diff_~l1~0) = -1*ULTIMATE.start_diff_~i~0 + 1*ULTIMATE.start_diff_~l1~0 72.80/34.78 Supporting invariants [] 72.80/34.78 [2019-03-28 12:50:33,082 INFO L297 tatePredicateManager]: 15 out of 15 supporting invariants were superfluous and have been removed 72.80/34.78 [2019-03-28 12:50:33,096 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 72.80/34.78 [2019-03-28 12:50:33,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 72.80/34.78 [2019-03-28 12:50:33,115 INFO L256 TraceCheckSpWp]: Trace formula consists of 83 conjuncts, 2 conjunts are in the unsatisfiable core 72.80/34.78 [2019-03-28 12:50:33,115 INFO L279 TraceCheckSpWp]: Computing forward predicates... 72.80/34.78 [2019-03-28 12:50:33,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 72.80/34.78 [2019-03-28 12:50:33,125 INFO L256 TraceCheckSpWp]: Trace formula consists of 30 conjuncts, 4 conjunts are in the unsatisfiable core 72.80/34.78 [2019-03-28 12:50:33,125 INFO L279 TraceCheckSpWp]: Computing forward predicates... 72.80/34.78 [2019-03-28 12:50:33,136 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. 72.80/34.78 [2019-03-28 12:50:33,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 72.80/34.78 [2019-03-28 12:50:33,186 INFO L256 TraceCheckSpWp]: Trace formula consists of 30 conjuncts, 4 conjunts are in the unsatisfiable core 72.80/34.78 [2019-03-28 12:50:33,186 INFO L279 TraceCheckSpWp]: Computing forward predicates... 72.80/34.78 [2019-03-28 12:50:33,209 INFO L98 LoopCannibalizer]: 2 predicates before loop cannibalization 3 predicates after loop cannibalization 72.80/34.78 [2019-03-28 12:50:33,209 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 72.80/34.78 [2019-03-28 12:50:33,209 INFO L69 BuchiDifferenceNCSB]: Start buchiDifferenceNCSB. First operand 41 states and 72 transitions. cyclomatic complexity: 34 Second operand 3 states. 72.80/34.78 [2019-03-28 12:50:33,285 INFO L73 BuchiDifferenceNCSB]: Finished buchiDifferenceNCSB. First operand 41 states and 72 transitions. cyclomatic complexity: 34. Second operand 3 states. Result 73 states and 123 transitions. Complement of second has 4 states. 72.80/34.78 [2019-03-28 12:50:33,286 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 72.80/34.78 [2019-03-28 12:50:33,286 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. 72.80/34.78 [2019-03-28 12:50:33,286 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 42 transitions. 72.80/34.78 [2019-03-28 12:50:33,287 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 42 transitions. Stem has 4 letters. Loop has 8 letters. 72.80/34.78 [2019-03-28 12:50:33,287 INFO L116 BuchiAccepts]: Finished buchiAccepts. 72.80/34.78 [2019-03-28 12:50:33,287 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 42 transitions. Stem has 12 letters. Loop has 8 letters. 72.80/34.78 [2019-03-28 12:50:33,288 INFO L116 BuchiAccepts]: Finished buchiAccepts. 72.80/34.78 [2019-03-28 12:50:33,288 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 42 transitions. Stem has 4 letters. Loop has 16 letters. 72.80/34.78 [2019-03-28 12:50:33,288 INFO L116 BuchiAccepts]: Finished buchiAccepts. 72.80/34.78 [2019-03-28 12:50:33,294 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 73 states and 123 transitions. 72.80/34.78 [2019-03-28 12:50:33,295 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 29 72.80/34.78 [2019-03-28 12:50:33,297 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 73 states to 68 states and 114 transitions. 72.80/34.78 [2019-03-28 12:50:33,297 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 35 72.80/34.78 [2019-03-28 12:50:33,297 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 36 72.80/34.78 [2019-03-28 12:50:33,297 INFO L73 IsDeterministic]: Start isDeterministic. Operand 68 states and 114 transitions. 72.80/34.78 [2019-03-28 12:50:33,297 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. 72.80/34.78 [2019-03-28 12:50:33,297 INFO L706 BuchiCegarLoop]: Abstraction has 68 states and 114 transitions. 72.80/34.78 [2019-03-28 12:50:33,298 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states and 114 transitions. 72.80/34.78 [2019-03-28 12:50:33,299 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 41. 72.80/34.78 [2019-03-28 12:50:33,299 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. 72.80/34.78 [2019-03-28 12:50:33,299 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 72 transitions. 72.80/34.78 [2019-03-28 12:50:33,300 INFO L729 BuchiCegarLoop]: Abstraction has 41 states and 72 transitions. 72.80/34.78 [2019-03-28 12:50:33,300 INFO L609 BuchiCegarLoop]: Abstraction has 41 states and 72 transitions. 72.80/34.78 [2019-03-28 12:50:33,300 INFO L442 BuchiCegarLoop]: ======== Iteration 6============ 72.80/34.78 [2019-03-28 12:50:33,300 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 41 states and 72 transitions. 72.80/34.78 [2019-03-28 12:50:33,301 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 20 72.80/34.78 [2019-03-28 12:50:33,301 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false 72.80/34.78 [2019-03-28 12:50:33,301 INFO L119 BuchiIsEmpty]: Starting construction of run 72.80/34.78 [2019-03-28 12:50:33,301 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] 72.80/34.78 [2019-03-28 12:50:33,301 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1] 72.80/34.78 [2019-03-28 12:50:33,302 INFO L794 eck$LassoCheckResult]: Stem: 621#ULTIMATE.startENTRY [150] ULTIMATE.startENTRY-->L34: Formula: (and (= |v_#NULL.offset_2| 0) (= (store |v_#valid_20| 0 0) |v_#valid_19|) (= 0 |v_#NULL.base_2|)) InVars {#valid=|v_#valid_20|} OutVars{ULTIMATE.start_main_#t~malloc8.base=|v_ULTIMATE.start_main_#t~malloc8.base_5|, ULTIMATE.start_main_#t~malloc9.base=|v_ULTIMATE.start_main_#t~malloc9.base_5|, ULTIMATE.start_main_~A~0.base=v_ULTIMATE.start_main_~A~0.base_3, ULTIMATE.start_main_~B~0.offset=v_ULTIMATE.start_main_~B~0.offset_3, #NULL.offset=|v_#NULL.offset_2|, ULTIMATE.start_main_#t~nondet6=|v_ULTIMATE.start_main_#t~nondet6_6|, ULTIMATE.start_main_#t~nondet7=|v_ULTIMATE.start_main_#t~nondet7_6|, ULTIMATE.start_main_~B~0.base=v_ULTIMATE.start_main_~B~0.base_3, #NULL.base=|v_#NULL.base_2|, ULTIMATE.start_main_~D~0.offset=v_ULTIMATE.start_main_~D~0.offset_3, ULTIMATE.start_main_#t~malloc10.base=|v_ULTIMATE.start_main_#t~malloc10.base_5|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_4|, ULTIMATE.start_main_#t~malloc8.offset=|v_ULTIMATE.start_main_#t~malloc8.offset_5|, #valid=|v_#valid_19|, ULTIMATE.start_main_#t~malloc9.offset=|v_ULTIMATE.start_main_#t~malloc9.offset_5|, ULTIMATE.start_main_~D~0.base=v_ULTIMATE.start_main_~D~0.base_3, ULTIMATE.start_main_~A~0.offset=v_ULTIMATE.start_main_~A~0.offset_3, ULTIMATE.start_main_~Blen~0=v_ULTIMATE.start_main_~Blen~0_8, ULTIMATE.start_main_~Alen~0=v_ULTIMATE.start_main_~Alen~0_8, ULTIMATE.start_main_#t~malloc10.offset=|v_ULTIMATE.start_main_#t~malloc10.offset_5|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~malloc8.base, ULTIMATE.start_main_#t~malloc9.base, ULTIMATE.start_main_~A~0.base, ULTIMATE.start_main_~B~0.offset, #NULL.offset, ULTIMATE.start_main_#t~nondet6, ULTIMATE.start_main_#t~nondet7, ULTIMATE.start_main_~B~0.base, #NULL.base, ULTIMATE.start_main_~D~0.offset, ULTIMATE.start_main_#t~malloc10.base, ULTIMATE.start_main_#res, ULTIMATE.start_main_#t~malloc8.offset, #valid, ULTIMATE.start_main_#t~malloc9.offset, ULTIMATE.start_main_~D~0.base, ULTIMATE.start_main_~A~0.offset, ULTIMATE.start_main_~Blen~0, ULTIMATE.start_main_~Alen~0, ULTIMATE.start_main_#t~malloc10.offset] 622#L34 [75] L34-->L34-2: Formula: (and (< v_ULTIMATE.start_main_~Alen~0_5 1) (= v_ULTIMATE.start_main_~Alen~0_4 1)) InVars {ULTIMATE.start_main_~Alen~0=v_ULTIMATE.start_main_~Alen~0_5} OutVars{ULTIMATE.start_main_~Alen~0=v_ULTIMATE.start_main_~Alen~0_4} AuxVars[] AssignedVars[ULTIMATE.start_main_~Alen~0] 623#L34-2 [105] L34-2-->L37-1: Formula: (>= v_ULTIMATE.start_main_~Blen~0_6 1) InVars {ULTIMATE.start_main_~Blen~0=v_ULTIMATE.start_main_~Blen~0_6} OutVars{ULTIMATE.start_main_~Blen~0=v_ULTIMATE.start_main_~Blen~0_6} AuxVars[] AssignedVars[] 624#L37-1 [124] L37-1-->L13-2: Formula: (let ((.cse2 (store |v_#valid_10| |v_ULTIMATE.start_main_#t~malloc8.base_4| 1))) (let ((.cse0 (store .cse2 |v_ULTIMATE.start_main_#t~malloc9.base_4| 1))) (and (= v_ULTIMATE.start_diff_~k~0_1 0) (= v_ULTIMATE.start_diff_~l2~0_1 v_ULTIMATE.start_diff_~Blen_1) (< |v_ULTIMATE.start_main_#t~malloc10.base_4| 0) (= v_ULTIMATE.start_diff_~A.base_1 |v_ULTIMATE.start_diff_#in~A.base_1|) (= |v_#valid_7| (store .cse0 |v_ULTIMATE.start_main_#t~malloc10.base_4| 1)) (< |v_ULTIMATE.start_main_#t~malloc10.base_4| |v_#StackHeapBarrier_1|) (= v_ULTIMATE.start_diff_~Blen_1 |v_ULTIMATE.start_diff_#in~Blen_1|) (= v_ULTIMATE.start_diff_~B.base_1 |v_ULTIMATE.start_diff_#in~B.base_1|) (= v_ULTIMATE.start_diff_~Alen_1 |v_ULTIMATE.start_diff_#in~Alen_1|) (= v_ULTIMATE.start_main_~B~0.offset_2 |v_ULTIMATE.start_main_#t~malloc9.offset_4|) (= v_ULTIMATE.start_main_~B~0.base_2 |v_ULTIMATE.start_main_#t~malloc9.base_4|) (= |v_ULTIMATE.start_diff_#in~A.base_1| v_ULTIMATE.start_main_~A~0.base_2) (= |v_ULTIMATE.start_main_#t~malloc8.offset_4| 0) (= |v_#length_1| (let ((.cse1 (* 4 v_ULTIMATE.start_main_~Alen~0_7))) (store (store (store |v_#length_4| |v_ULTIMATE.start_main_#t~malloc8.base_4| .cse1) |v_ULTIMATE.start_main_#t~malloc9.base_4| (* 4 v_ULTIMATE.start_main_~Blen~0_7)) |v_ULTIMATE.start_main_#t~malloc10.base_4| .cse1))) (= v_ULTIMATE.start_diff_~D.base_1 |v_ULTIMATE.start_diff_#in~D.base_1|) (= |v_ULTIMATE.start_main_#t~malloc9.offset_4| 0) (= |v_ULTIMATE.start_diff_#in~B.offset_1| v_ULTIMATE.start_main_~B~0.offset_2) (= |v_ULTIMATE.start_diff_#in~A.offset_1| v_ULTIMATE.start_main_~A~0.offset_2) (= v_ULTIMATE.start_diff_~B.offset_1 |v_ULTIMATE.start_diff_#in~B.offset_1|) (= v_ULTIMATE.start_main_~A~0.base_2 |v_ULTIMATE.start_main_#t~malloc8.base_4|) (< |v_ULTIMATE.start_main_#t~malloc8.base_4| |v_#StackHeapBarrier_1|) (= |v_ULTIMATE.start_diff_#in~B.base_1| v_ULTIMATE.start_main_~B~0.base_2) (< |v_ULTIMATE.start_main_#t~malloc9.base_4| |v_#StackHeapBarrier_1|) (= |v_ULTIMATE.start_diff_#in~D.offset_1| v_ULTIMATE.start_main_~D~0.offset_2) (= v_ULTIMATE.start_main_~D~0.offset_2 |v_ULTIMATE.start_main_#t~malloc10.offset_4|) (= v_ULTIMATE.start_diff_~i~0_1 0) (= 0 (select .cse2 |v_ULTIMATE.start_main_#t~malloc9.base_4|)) (= v_ULTIMATE.start_main_~D~0.base_2 |v_ULTIMATE.start_main_#t~malloc10.base_4|) (= |v_ULTIMATE.start_diff_#in~Blen_1| v_ULTIMATE.start_main_~Blen~0_7) (= v_ULTIMATE.start_diff_~l1~0_1 v_ULTIMATE.start_diff_~Alen_1) (= 0 (select .cse0 |v_ULTIMATE.start_main_#t~malloc10.base_4|)) (= (select |v_#valid_10| |v_ULTIMATE.start_main_#t~malloc8.base_4|) 0) (= v_ULTIMATE.start_diff_~A.offset_1 |v_ULTIMATE.start_diff_#in~A.offset_1|) (< |v_ULTIMATE.start_main_#t~malloc8.base_4| 0) (= |v_ULTIMATE.start_diff_#in~Alen_1| v_ULTIMATE.start_main_~Alen~0_7) (> 0 |v_ULTIMATE.start_main_#t~malloc9.base_4|) (= v_ULTIMATE.start_main_~A~0.offset_2 |v_ULTIMATE.start_main_#t~malloc8.offset_4|) (= |v_ULTIMATE.start_main_#t~malloc10.offset_4| 0) (= |v_ULTIMATE.start_diff_#in~D.base_1| v_ULTIMATE.start_main_~D~0.base_2) (= v_ULTIMATE.start_diff_~D.offset_1 |v_ULTIMATE.start_diff_#in~D.offset_1|)))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_4|, #valid=|v_#valid_10|, ULTIMATE.start_main_~Blen~0=v_ULTIMATE.start_main_~Blen~0_7, ULTIMATE.start_main_~Alen~0=v_ULTIMATE.start_main_~Alen~0_7} OutVars{ULTIMATE.start_diff_#in~A.base=|v_ULTIMATE.start_diff_#in~A.base_1|, ULTIMATE.start_diff_#in~B.base=|v_ULTIMATE.start_diff_#in~B.base_1|, ULTIMATE.start_diff_~B.offset=v_ULTIMATE.start_diff_~B.offset_1, ULTIMATE.start_diff_~Alen=v_ULTIMATE.start_diff_~Alen_1, ULTIMATE.start_diff_~D.base=v_ULTIMATE.start_diff_~D.base_1, ULTIMATE.start_diff_#in~Blen=|v_ULTIMATE.start_diff_#in~Blen_1|, ULTIMATE.start_main_~B~0.offset=v_ULTIMATE.start_main_~B~0.offset_2, ULTIMATE.start_main_~B~0.base=v_ULTIMATE.start_main_~B~0.base_2, ULTIMATE.start_diff_#in~A.offset=|v_ULTIMATE.start_diff_#in~A.offset_1|, ULTIMATE.start_main_~D~0.offset=v_ULTIMATE.start_main_~D~0.offset_2, ULTIMATE.start_diff_#in~D.offset=|v_ULTIMATE.start_diff_#in~D.offset_1|, ULTIMATE.start_diff_#in~Alen=|v_ULTIMATE.start_diff_#in~Alen_1|, ULTIMATE.start_diff_~A.base=v_ULTIMATE.start_diff_~A.base_1, ULTIMATE.start_diff_~B.base=v_ULTIMATE.start_diff_~B.base_1, #length=|v_#length_1|, ULTIMATE.start_main_#t~malloc9.offset=|v_ULTIMATE.start_main_#t~malloc9.offset_4|, ULTIMATE.start_diff_#t~mem3=|v_ULTIMATE.start_diff_#t~mem3_1|, ULTIMATE.start_main_~A~0.offset=v_ULTIMATE.start_main_~A~0.offset_2, ULTIMATE.start_main_#t~malloc10.offset=|v_ULTIMATE.start_main_#t~malloc10.offset_4|, ULTIMATE.start_main_~Blen~0=v_ULTIMATE.start_main_~Blen~0_7, ULTIMATE.start_main_~Alen~0=v_ULTIMATE.start_main_~Alen~0_7, ULTIMATE.start_diff_~Blen=v_ULTIMATE.start_diff_~Blen_1, ULTIMATE.start_main_#t~malloc8.base=|v_ULTIMATE.start_main_#t~malloc8.base_4|, ULTIMATE.start_diff_#t~mem0=|v_ULTIMATE.start_diff_#t~mem0_1|, ULTIMATE.start_main_#t~malloc9.base=|v_ULTIMATE.start_main_#t~malloc9.base_4|, ULTIMATE.start_diff_#t~mem1=|v_ULTIMATE.start_diff_#t~mem1_1|, ULTIMATE.start_main_~A~0.base=v_ULTIMATE.start_main_~A~0.base_2, ULTIMATE.start_diff_#t~post4=|v_ULTIMATE.start_diff_#t~post4_1|, ULTIMATE.start_diff_~found~0=v_ULTIMATE.start_diff_~found~0_1, ULTIMATE.start_diff_#in~B.offset=|v_ULTIMATE.start_diff_#in~B.offset_1|, ULTIMATE.start_diff_~i~0=v_ULTIMATE.start_diff_~i~0_1, ULTIMATE.start_diff_~l1~0=v_ULTIMATE.start_diff_~l1~0_1, ULTIMATE.start_diff_#t~post5=|v_ULTIMATE.start_diff_#t~post5_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, ULTIMATE.start_main_#t~malloc10.base=|v_ULTIMATE.start_main_#t~malloc10.base_4|, ULTIMATE.start_diff_~D.offset=v_ULTIMATE.start_diff_~D.offset_1, ULTIMATE.start_diff_~l2~0=v_ULTIMATE.start_diff_~l2~0_1, ULTIMATE.start_diff_~j~0=v_ULTIMATE.start_diff_~j~0_1, ULTIMATE.start_main_#t~malloc8.offset=|v_ULTIMATE.start_main_#t~malloc8.offset_4|, #valid=|v_#valid_7|, ULTIMATE.start_diff_~k~0=v_ULTIMATE.start_diff_~k~0_1, ULTIMATE.start_diff_#in~D.base=|v_ULTIMATE.start_diff_#in~D.base_1|, ULTIMATE.start_diff_#t~post2=|v_ULTIMATE.start_diff_#t~post2_1|, ULTIMATE.start_diff_~A.offset=v_ULTIMATE.start_diff_~A.offset_1, ULTIMATE.start_main_~D~0.base=v_ULTIMATE.start_main_~D~0.base_2} AuxVars[] AssignedVars[ULTIMATE.start_diff_#in~A.base, ULTIMATE.start_diff_#in~B.base, ULTIMATE.start_diff_~B.offset, ULTIMATE.start_diff_~Alen, ULTIMATE.start_diff_~D.base, ULTIMATE.start_diff_#in~Blen, ULTIMATE.start_main_~B~0.offset, ULTIMATE.start_main_~B~0.base, ULTIMATE.start_diff_#in~A.offset, ULTIMATE.start_main_~D~0.offset, ULTIMATE.start_diff_#in~D.offset, ULTIMATE.start_diff_#in~Alen, ULTIMATE.start_diff_~A.base, ULTIMATE.start_diff_~B.base, #length, ULTIMATE.start_main_#t~malloc9.offset, ULTIMATE.start_diff_#t~mem3, ULTIMATE.start_main_~A~0.offset, ULTIMATE.start_main_#t~malloc10.offset, ULTIMATE.start_diff_~Blen, ULTIMATE.start_main_#t~malloc8.base, ULTIMATE.start_diff_#t~mem0, ULTIMATE.start_main_#t~malloc9.base, ULTIMATE.start_diff_#t~mem1, ULTIMATE.start_main_~A~0.base, ULTIMATE.start_diff_#t~post4, ULTIMATE.start_diff_~found~0, ULTIMATE.start_diff_#in~B.offset, ULTIMATE.start_diff_~i~0, ULTIMATE.start_diff_~l1~0, ULTIMATE.start_diff_#t~post5, ULTIMATE.start_main_#t~malloc10.base, ULTIMATE.start_diff_~D.offset, ULTIMATE.start_diff_~l2~0, ULTIMATE.start_diff_~j~0, ULTIMATE.start_main_#t~malloc8.offset, #valid, ULTIMATE.start_diff_~k~0, ULTIMATE.start_diff_#in~D.base, ULTIMATE.start_diff_#t~post2, ULTIMATE.start_diff_~A.offset, ULTIMATE.start_main_~D~0.base] 629#L13-2 72.80/34.78 [2019-03-28 12:50:33,303 INFO L796 eck$LassoCheckResult]: Loop: 629#L13-2 [91] L13-2-->L17-4: Formula: (and (< v_ULTIMATE.start_diff_~i~0_4 v_ULTIMATE.start_diff_~l1~0_4) (= v_ULTIMATE.start_diff_~j~0_2 0) (= v_ULTIMATE.start_diff_~found~0_3 0)) InVars {ULTIMATE.start_diff_~i~0=v_ULTIMATE.start_diff_~i~0_4, ULTIMATE.start_diff_~l1~0=v_ULTIMATE.start_diff_~l1~0_4} OutVars{ULTIMATE.start_diff_~found~0=v_ULTIMATE.start_diff_~found~0_3, ULTIMATE.start_diff_~i~0=v_ULTIMATE.start_diff_~i~0_4, ULTIMATE.start_diff_~l1~0=v_ULTIMATE.start_diff_~l1~0_4, ULTIMATE.start_diff_~j~0=v_ULTIMATE.start_diff_~j~0_2} AuxVars[] AssignedVars[ULTIMATE.start_diff_~found~0, ULTIMATE.start_diff_~j~0] 647#L17-4 [99] L17-4-->L17: Formula: (and (= 0 v_ULTIMATE.start_diff_~found~0_5) (< v_ULTIMATE.start_diff_~j~0_4 v_ULTIMATE.start_diff_~l2~0_4)) InVars {ULTIMATE.start_diff_~found~0=v_ULTIMATE.start_diff_~found~0_5, ULTIMATE.start_diff_~j~0=v_ULTIMATE.start_diff_~j~0_4, ULTIMATE.start_diff_~l2~0=v_ULTIMATE.start_diff_~l2~0_4} OutVars{ULTIMATE.start_diff_~found~0=v_ULTIMATE.start_diff_~found~0_5, ULTIMATE.start_diff_~j~0=v_ULTIMATE.start_diff_~j~0_4, ULTIMATE.start_diff_~l2~0=v_ULTIMATE.start_diff_~l2~0_4} AuxVars[] AssignedVars[] 641#L17 [85] L17-->L17-1: Formula: (let ((.cse0 (* 4 v_ULTIMATE.start_diff_~i~0_5))) (let ((.cse1 (+ .cse0 v_ULTIMATE.start_diff_~A.offset_3))) (and (<= (+ .cse0 v_ULTIMATE.start_diff_~A.offset_3 4) (select |v_#length_5| v_ULTIMATE.start_diff_~A.base_3)) (= 1 (select |v_#valid_11| v_ULTIMATE.start_diff_~A.base_3)) (= (select (select |v_#memory_int_1| v_ULTIMATE.start_diff_~A.base_3) .cse1) |v_ULTIMATE.start_diff_#t~mem0_2|) (<= 0 .cse1)))) InVars {ULTIMATE.start_diff_~i~0=v_ULTIMATE.start_diff_~i~0_5, ULTIMATE.start_diff_~A.base=v_ULTIMATE.start_diff_~A.base_3, #valid=|v_#valid_11|, #memory_int=|v_#memory_int_1|, #length=|v_#length_5|, ULTIMATE.start_diff_~A.offset=v_ULTIMATE.start_diff_~A.offset_3} OutVars{ULTIMATE.start_diff_#t~mem0=|v_ULTIMATE.start_diff_#t~mem0_2|, ULTIMATE.start_diff_~i~0=v_ULTIMATE.start_diff_~i~0_5, ULTIMATE.start_diff_~A.base=v_ULTIMATE.start_diff_~A.base_3, #valid=|v_#valid_11|, #memory_int=|v_#memory_int_1|, #length=|v_#length_5|, ULTIMATE.start_diff_~A.offset=v_ULTIMATE.start_diff_~A.offset_3} AuxVars[] AssignedVars[ULTIMATE.start_diff_#t~mem0] 646#L17-1 [82] L17-1-->L17-2: Formula: (let ((.cse1 (* 4 v_ULTIMATE.start_diff_~j~0_5))) (let ((.cse0 (+ v_ULTIMATE.start_diff_~B.offset_3 .cse1))) (and (<= 0 .cse0) (= 1 (select |v_#valid_13| v_ULTIMATE.start_diff_~B.base_3)) (= (select (select |v_#memory_int_2| v_ULTIMATE.start_diff_~B.base_3) .cse0) |v_ULTIMATE.start_diff_#t~mem1_2|) (<= (+ v_ULTIMATE.start_diff_~B.offset_3 .cse1 4) (select |v_#length_7| v_ULTIMATE.start_diff_~B.base_3))))) InVars {ULTIMATE.start_diff_~B.offset=v_ULTIMATE.start_diff_~B.offset_3, ULTIMATE.start_diff_~j~0=v_ULTIMATE.start_diff_~j~0_5, #valid=|v_#valid_13|, ULTIMATE.start_diff_~B.base=v_ULTIMATE.start_diff_~B.base_3, #memory_int=|v_#memory_int_2|, #length=|v_#length_7|} OutVars{ULTIMATE.start_diff_#t~mem1=|v_ULTIMATE.start_diff_#t~mem1_2|, ULTIMATE.start_diff_~B.offset=v_ULTIMATE.start_diff_~B.offset_3, ULTIMATE.start_diff_~j~0=v_ULTIMATE.start_diff_~j~0_5, #valid=|v_#valid_13|, ULTIMATE.start_diff_~B.base=v_ULTIMATE.start_diff_~B.base_3, #memory_int=|v_#memory_int_2|, #length=|v_#length_7|} AuxVars[] AssignedVars[ULTIMATE.start_diff_#t~mem1] 644#L17-2 [80] L17-2-->L17-4: Formula: (and (= |v_ULTIMATE.start_diff_#t~mem1_4| |v_ULTIMATE.start_diff_#t~mem0_4|) (= v_ULTIMATE.start_diff_~found~0_6 1)) InVars {ULTIMATE.start_diff_#t~mem0=|v_ULTIMATE.start_diff_#t~mem0_4|, ULTIMATE.start_diff_#t~mem1=|v_ULTIMATE.start_diff_#t~mem1_4|} OutVars{ULTIMATE.start_diff_#t~mem0=|v_ULTIMATE.start_diff_#t~mem0_3|, ULTIMATE.start_diff_#t~mem1=|v_ULTIMATE.start_diff_#t~mem1_3|, ULTIMATE.start_diff_~found~0=v_ULTIMATE.start_diff_~found~0_6} AuxVars[] AssignedVars[ULTIMATE.start_diff_#t~mem0, ULTIMATE.start_diff_#t~mem1, ULTIMATE.start_diff_~found~0] 640#L17-4 [127] L17-4-->L16-2: Formula: (< 0 v_ULTIMATE.start_diff_~found~0_4) InVars {ULTIMATE.start_diff_~found~0=v_ULTIMATE.start_diff_~found~0_4} OutVars{ULTIMATE.start_diff_~found~0=v_ULTIMATE.start_diff_~found~0_4} AuxVars[] AssignedVars[] 637#L16-2 [130] L16-2-->L23-1: Formula: (< 0 v_ULTIMATE.start_diff_~found~0_8) InVars {ULTIMATE.start_diff_~found~0=v_ULTIMATE.start_diff_~found~0_8} OutVars{ULTIMATE.start_diff_~found~0=v_ULTIMATE.start_diff_~found~0_8} AuxVars[] AssignedVars[] 628#L23-1 [74] L23-1-->L13-2: Formula: (= v_ULTIMATE.start_diff_~i~0_9 (+ v_ULTIMATE.start_diff_~i~0_10 1)) InVars {ULTIMATE.start_diff_~i~0=v_ULTIMATE.start_diff_~i~0_10} OutVars{ULTIMATE.start_diff_#t~post5=|v_ULTIMATE.start_diff_#t~post5_2|, ULTIMATE.start_diff_~i~0=v_ULTIMATE.start_diff_~i~0_9} AuxVars[] AssignedVars[ULTIMATE.start_diff_#t~post5, ULTIMATE.start_diff_~i~0] 629#L13-2 72.80/34.78 [2019-03-28 12:50:33,303 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 72.80/34.78 [2019-03-28 12:50:33,303 INFO L82 PathProgramCache]: Analyzing trace with hash 5467625, now seen corresponding path program 1 times 72.80/34.78 [2019-03-28 12:50:33,303 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 72.80/34.78 [2019-03-28 12:50:33,303 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 72.80/34.78 [2019-03-28 12:50:33,304 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 72.80/34.78 [2019-03-28 12:50:33,304 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 72.80/34.78 [2019-03-28 12:50:33,304 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 72.80/34.78 [2019-03-28 12:50:33,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 72.80/34.78 [2019-03-28 12:50:33,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 72.80/34.78 [2019-03-28 12:50:33,318 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 72.80/34.78 [2019-03-28 12:50:33,318 INFO L82 PathProgramCache]: Analyzing trace with hash -1945236739, now seen corresponding path program 3 times 72.80/34.78 [2019-03-28 12:50:33,318 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 72.80/34.78 [2019-03-28 12:50:33,318 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 72.80/34.78 [2019-03-28 12:50:33,319 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 72.80/34.78 [2019-03-28 12:50:33,319 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 72.80/34.78 [2019-03-28 12:50:33,319 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 72.80/34.78 [2019-03-28 12:50:33,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 72.80/34.78 [2019-03-28 12:50:33,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 72.80/34.78 [2019-03-28 12:50:33,325 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 72.80/34.78 [2019-03-28 12:50:33,325 INFO L82 PathProgramCache]: Analyzing trace with hash 178852069, now seen corresponding path program 1 times 72.80/34.78 [2019-03-28 12:50:33,326 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 72.80/34.78 [2019-03-28 12:50:33,326 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 72.80/34.78 [2019-03-28 12:50:33,326 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 72.80/34.78 [2019-03-28 12:50:33,327 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY 72.80/34.78 [2019-03-28 12:50:33,327 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 72.80/34.78 [2019-03-28 12:50:33,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 72.80/34.78 [2019-03-28 12:50:33,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 72.80/34.78 [2019-03-28 12:50:33,659 WARN L188 SmtUtils]: Spent 207.00 ms on a formula simplification that was a NOOP. DAG size: 105 72.80/34.78 [2019-03-28 12:50:33,880 WARN L188 SmtUtils]: Spent 219.00 ms on a formula simplification that was a NOOP. DAG size: 101 72.80/34.78 [2019-03-28 12:50:33,882 INFO L216 LassoAnalysis]: Preferences: 72.80/34.78 [2019-03-28 12:50:33,895 INFO L124 ssoRankerPreferences]: Compute integeral hull: false 72.80/34.78 [2019-03-28 12:50:33,895 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true 72.80/34.78 [2019-03-28 12:50:33,895 INFO L126 ssoRankerPreferences]: Term annotations enabled: false 72.80/34.78 [2019-03-28 12:50:33,895 INFO L127 ssoRankerPreferences]: Use exernal solver: false 72.80/34.78 [2019-03-28 12:50:33,895 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 72.80/34.78 [2019-03-28 12:50:33,895 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false 72.80/34.78 [2019-03-28 12:50:33,895 INFO L130 ssoRankerPreferences]: Path of dumped script: 72.80/34.78 [2019-03-28 12:50:33,896 INFO L131 ssoRankerPreferences]: Filename of dumped script: theBenchmark.c_BEv2_Iteration6_Lasso 72.80/34.78 [2019-03-28 12:50:33,896 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank 72.80/34.78 [2019-03-28 12:50:33,896 INFO L282 LassoAnalysis]: Starting lasso preprocessing... 72.80/34.78 [2019-03-28 12:50:33,899 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 72.80/34.78 [2019-03-28 12:50:33,903 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 72.80/34.78 [2019-03-28 12:50:33,905 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 72.80/34.78 [2019-03-28 12:50:33,907 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 72.80/34.78 [2019-03-28 12:50:33,910 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 72.80/34.78 [2019-03-28 12:50:33,912 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 72.80/34.78 [2019-03-28 12:50:33,915 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 72.80/34.78 [2019-03-28 12:50:33,917 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 72.80/34.78 [2019-03-28 12:50:34,263 WARN L188 SmtUtils]: Spent 264.00 ms on a formula simplification. DAG size of input: 96 DAG size of output: 90 72.80/34.78 [2019-03-28 12:50:34,304 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 72.80/34.78 [2019-03-28 12:50:34,306 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 72.80/34.78 [2019-03-28 12:50:34,308 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 72.80/34.78 [2019-03-28 12:50:34,310 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 72.80/34.78 [2019-03-28 12:50:34,312 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 72.80/34.78 [2019-03-28 12:50:34,319 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 72.80/34.78 [2019-03-28 12:50:34,320 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 72.80/34.78 [2019-03-28 12:50:34,782 INFO L300 LassoAnalysis]: Preprocessing complete. 72.80/34.78 [2019-03-28 12:50:34,783 INFO L497 LassoAnalysis]: Using template 'affine'. 72.80/34.78 [2019-03-28 12:50:34,783 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 72.80/34.78 Termination analysis: LINEAR_WITH_GUESSES 72.80/34.78 Number of strict supporting invariants: 0 72.80/34.78 Number of non-strict supporting invariants: 1 72.80/34.78 Consider only non-deceasing supporting invariants: true 72.80/34.78 Simplify termination arguments: true 72.80/34.78 Simplify supporting invariants: trueOverapproximate stem: false 72.80/34.78 [2019-03-28 12:50:34,784 INFO L339 nArgumentSynthesizer]: Template has degree 0. 72.80/34.78 [2019-03-28 12:50:34,784 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 72.80/34.78 [2019-03-28 12:50:34,784 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 72.80/34.78 [2019-03-28 12:50:34,784 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 72.80/34.78 [2019-03-28 12:50:34,785 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. 72.80/34.78 [2019-03-28 12:50:34,785 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. 72.80/34.78 [2019-03-28 12:50:34,787 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 72.80/34.78 [2019-03-28 12:50:34,787 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 72.80/34.78 Termination analysis: LINEAR_WITH_GUESSES 72.80/34.78 Number of strict supporting invariants: 0 72.80/34.78 Number of non-strict supporting invariants: 1 72.80/34.78 Consider only non-deceasing supporting invariants: true 72.80/34.78 Simplify termination arguments: true 72.80/34.78 Simplify supporting invariants: trueOverapproximate stem: false 72.80/34.78 [2019-03-28 12:50:34,787 INFO L339 nArgumentSynthesizer]: Template has degree 0. 72.80/34.78 [2019-03-28 12:50:34,788 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 72.80/34.78 [2019-03-28 12:50:34,788 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 72.80/34.78 [2019-03-28 12:50:34,788 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 72.80/34.78 [2019-03-28 12:50:34,788 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 72.80/34.78 [2019-03-28 12:50:34,788 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 72.80/34.78 [2019-03-28 12:50:34,788 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 72.80/34.78 [2019-03-28 12:50:34,789 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 72.80/34.78 [2019-03-28 12:50:34,789 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 72.80/34.78 Termination analysis: LINEAR_WITH_GUESSES 72.80/34.78 Number of strict supporting invariants: 0 72.80/34.78 Number of non-strict supporting invariants: 1 72.80/34.78 Consider only non-deceasing supporting invariants: true 72.80/34.78 Simplify termination arguments: true 72.80/34.78 Simplify supporting invariants: trueOverapproximate stem: false 72.80/34.78 [2019-03-28 12:50:34,789 INFO L339 nArgumentSynthesizer]: Template has degree 0. 72.80/34.78 [2019-03-28 12:50:34,790 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 72.80/34.78 [2019-03-28 12:50:34,790 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 72.80/34.78 [2019-03-28 12:50:34,790 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 72.80/34.78 [2019-03-28 12:50:34,790 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 72.80/34.78 [2019-03-28 12:50:34,790 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 72.80/34.78 [2019-03-28 12:50:34,790 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 72.80/34.78 [2019-03-28 12:50:34,791 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 72.80/34.78 [2019-03-28 12:50:34,791 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 72.80/34.78 Termination analysis: LINEAR_WITH_GUESSES 72.80/34.78 Number of strict supporting invariants: 0 72.80/34.78 Number of non-strict supporting invariants: 1 72.80/34.78 Consider only non-deceasing supporting invariants: true 72.80/34.78 Simplify termination arguments: true 72.80/34.78 Simplify supporting invariants: trueOverapproximate stem: false 72.80/34.78 [2019-03-28 12:50:34,791 INFO L339 nArgumentSynthesizer]: Template has degree 0. 72.80/34.78 [2019-03-28 12:50:34,791 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 72.80/34.78 [2019-03-28 12:50:34,792 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 72.80/34.78 [2019-03-28 12:50:34,792 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 72.80/34.78 [2019-03-28 12:50:34,792 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. 72.80/34.78 [2019-03-28 12:50:34,792 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. 72.80/34.78 [2019-03-28 12:50:34,793 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 72.80/34.78 [2019-03-28 12:50:34,794 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 72.80/34.78 Termination analysis: LINEAR_WITH_GUESSES 72.80/34.78 Number of strict supporting invariants: 0 72.80/34.78 Number of non-strict supporting invariants: 1 72.80/34.78 Consider only non-deceasing supporting invariants: true 72.80/34.78 Simplify termination arguments: true 72.80/34.78 Simplify supporting invariants: trueOverapproximate stem: false 72.80/34.78 [2019-03-28 12:50:34,794 INFO L339 nArgumentSynthesizer]: Template has degree 0. 72.80/34.78 [2019-03-28 12:50:34,794 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 72.80/34.78 [2019-03-28 12:50:34,794 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 72.80/34.78 [2019-03-28 12:50:34,795 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 72.80/34.78 [2019-03-28 12:50:34,795 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 72.80/34.78 [2019-03-28 12:50:34,795 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 72.80/34.78 [2019-03-28 12:50:34,795 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 72.80/34.78 [2019-03-28 12:50:34,795 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 72.80/34.78 [2019-03-28 12:50:34,796 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 72.80/34.78 Termination analysis: LINEAR_WITH_GUESSES 72.80/34.78 Number of strict supporting invariants: 0 72.80/34.78 Number of non-strict supporting invariants: 1 72.80/34.78 Consider only non-deceasing supporting invariants: true 72.80/34.78 Simplify termination arguments: true 72.80/34.78 Simplify supporting invariants: trueOverapproximate stem: false 72.80/34.78 [2019-03-28 12:50:34,796 INFO L339 nArgumentSynthesizer]: Template has degree 0. 72.80/34.78 [2019-03-28 12:50:34,796 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 72.80/34.78 [2019-03-28 12:50:34,796 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 72.80/34.78 [2019-03-28 12:50:34,797 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 72.80/34.78 [2019-03-28 12:50:34,797 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 72.80/34.78 [2019-03-28 12:50:34,797 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 72.80/34.78 [2019-03-28 12:50:34,797 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 72.80/34.78 [2019-03-28 12:50:34,798 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 72.80/34.78 [2019-03-28 12:50:34,798 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 72.80/34.78 Termination analysis: LINEAR_WITH_GUESSES 72.80/34.78 Number of strict supporting invariants: 0 72.80/34.78 Number of non-strict supporting invariants: 1 72.80/34.78 Consider only non-deceasing supporting invariants: true 72.80/34.78 Simplify termination arguments: true 72.80/34.78 Simplify supporting invariants: trueOverapproximate stem: false 72.80/34.78 [2019-03-28 12:50:34,799 INFO L339 nArgumentSynthesizer]: Template has degree 0. 72.80/34.78 [2019-03-28 12:50:34,799 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 72.80/34.78 [2019-03-28 12:50:34,799 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 72.80/34.78 [2019-03-28 12:50:34,799 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 72.80/34.78 [2019-03-28 12:50:34,799 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 72.80/34.78 [2019-03-28 12:50:34,799 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 72.80/34.78 [2019-03-28 12:50:34,799 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 72.80/34.78 [2019-03-28 12:50:34,800 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 72.80/34.78 [2019-03-28 12:50:34,800 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 72.80/34.78 Termination analysis: LINEAR_WITH_GUESSES 72.80/34.78 Number of strict supporting invariants: 0 72.80/34.78 Number of non-strict supporting invariants: 1 72.80/34.78 Consider only non-deceasing supporting invariants: true 72.80/34.78 Simplify termination arguments: true 72.80/34.78 Simplify supporting invariants: trueOverapproximate stem: false 72.80/34.78 [2019-03-28 12:50:34,800 INFO L339 nArgumentSynthesizer]: Template has degree 0. 72.80/34.78 [2019-03-28 12:50:34,801 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 72.80/34.78 [2019-03-28 12:50:34,801 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 72.80/34.78 [2019-03-28 12:50:34,801 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 72.80/34.78 [2019-03-28 12:50:34,803 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. 72.80/34.78 [2019-03-28 12:50:34,803 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. 72.80/34.78 [2019-03-28 12:50:34,811 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 72.80/34.78 [2019-03-28 12:50:34,812 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 72.80/34.78 Termination analysis: LINEAR_WITH_GUESSES 72.80/34.78 Number of strict supporting invariants: 0 72.80/34.78 Number of non-strict supporting invariants: 1 72.80/34.78 Consider only non-deceasing supporting invariants: true 72.80/34.79 Simplify termination arguments: true 72.80/34.79 Simplify supporting invariants: trueOverapproximate stem: false 72.80/34.79 [2019-03-28 12:50:34,812 INFO L339 nArgumentSynthesizer]: Template has degree 0. 72.80/34.79 [2019-03-28 12:50:34,812 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 72.80/34.79 [2019-03-28 12:50:34,812 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 72.80/34.79 [2019-03-28 12:50:34,813 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 72.80/34.79 [2019-03-28 12:50:34,814 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. 72.80/34.79 [2019-03-28 12:50:34,814 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. 72.80/34.79 [2019-03-28 12:50:34,815 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 72.80/34.79 [2019-03-28 12:50:34,816 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 72.80/34.79 Termination analysis: LINEAR_WITH_GUESSES 72.80/34.79 Number of strict supporting invariants: 0 72.80/34.79 Number of non-strict supporting invariants: 1 72.80/34.79 Consider only non-deceasing supporting invariants: true 72.80/34.79 Simplify termination arguments: true 72.80/34.79 Simplify supporting invariants: trueOverapproximate stem: false 72.80/34.79 [2019-03-28 12:50:34,816 INFO L339 nArgumentSynthesizer]: Template has degree 0. 72.80/34.79 [2019-03-28 12:50:34,816 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 72.80/34.79 [2019-03-28 12:50:34,816 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 72.80/34.79 [2019-03-28 12:50:34,817 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 72.80/34.79 [2019-03-28 12:50:34,819 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. 72.80/34.79 [2019-03-28 12:50:34,819 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. 72.80/34.79 [2019-03-28 12:50:34,827 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 72.80/34.79 [2019-03-28 12:50:34,827 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 72.80/34.79 Termination analysis: LINEAR_WITH_GUESSES 72.80/34.79 Number of strict supporting invariants: 0 72.80/34.79 Number of non-strict supporting invariants: 1 72.80/34.79 Consider only non-deceasing supporting invariants: true 72.80/34.79 Simplify termination arguments: true 72.80/34.79 Simplify supporting invariants: trueOverapproximate stem: false 72.80/34.79 [2019-03-28 12:50:34,828 INFO L339 nArgumentSynthesizer]: Template has degree 0. 72.80/34.79 [2019-03-28 12:50:34,828 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 72.80/34.79 [2019-03-28 12:50:34,828 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 72.80/34.79 [2019-03-28 12:50:34,828 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 72.80/34.79 [2019-03-28 12:50:34,829 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. 72.80/34.79 [2019-03-28 12:50:34,829 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. 72.80/34.79 [2019-03-28 12:50:34,830 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 72.80/34.79 [2019-03-28 12:50:34,830 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 72.80/34.79 Termination analysis: LINEAR_WITH_GUESSES 72.80/34.79 Number of strict supporting invariants: 0 72.80/34.79 Number of non-strict supporting invariants: 1 72.80/34.79 Consider only non-deceasing supporting invariants: true 72.80/34.79 Simplify termination arguments: true 72.80/34.79 Simplify supporting invariants: trueOverapproximate stem: false 72.80/34.79 [2019-03-28 12:50:34,831 INFO L339 nArgumentSynthesizer]: Template has degree 0. 72.80/34.79 [2019-03-28 12:50:34,831 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 72.80/34.79 [2019-03-28 12:50:34,831 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 72.80/34.79 [2019-03-28 12:50:34,831 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 72.80/34.79 [2019-03-28 12:50:34,831 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 72.80/34.79 [2019-03-28 12:50:34,831 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 72.80/34.79 [2019-03-28 12:50:34,832 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 72.80/34.79 [2019-03-28 12:50:34,832 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 72.80/34.79 [2019-03-28 12:50:34,832 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 72.80/34.79 Termination analysis: LINEAR_WITH_GUESSES 72.80/34.79 Number of strict supporting invariants: 0 72.80/34.79 Number of non-strict supporting invariants: 1 72.80/34.79 Consider only non-deceasing supporting invariants: true 72.80/34.79 Simplify termination arguments: true 72.80/34.79 Simplify supporting invariants: trueOverapproximate stem: false 72.80/34.79 [2019-03-28 12:50:34,833 INFO L339 nArgumentSynthesizer]: Template has degree 0. 72.80/34.79 [2019-03-28 12:50:34,833 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 72.80/34.79 [2019-03-28 12:50:34,833 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 72.80/34.79 [2019-03-28 12:50:34,833 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 72.80/34.79 [2019-03-28 12:50:34,834 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. 72.80/34.79 [2019-03-28 12:50:34,834 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. 72.80/34.79 [2019-03-28 12:50:34,837 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 72.80/34.79 [2019-03-28 12:50:34,838 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 72.80/34.79 Termination analysis: LINEAR_WITH_GUESSES 72.80/34.79 Number of strict supporting invariants: 0 72.80/34.79 Number of non-strict supporting invariants: 1 72.80/34.79 Consider only non-deceasing supporting invariants: true 72.80/34.79 Simplify termination arguments: true 72.80/34.79 Simplify supporting invariants: trueOverapproximate stem: false 72.80/34.79 [2019-03-28 12:50:34,838 INFO L339 nArgumentSynthesizer]: Template has degree 0. 72.80/34.79 [2019-03-28 12:50:34,838 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 72.80/34.79 [2019-03-28 12:50:34,838 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 72.80/34.79 [2019-03-28 12:50:34,838 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 72.80/34.79 [2019-03-28 12:50:34,840 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. 72.80/34.79 [2019-03-28 12:50:34,841 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. 72.80/34.79 [2019-03-28 12:50:34,857 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. 72.80/34.79 [2019-03-28 12:50:34,873 INFO L443 ModelExtractionUtils]: Simplification made 6 calls to the SMT solver. 72.80/34.79 [2019-03-28 12:50:34,874 INFO L444 ModelExtractionUtils]: 30 out of 40 variables were initially zero. Simplification set additionally 7 variables to zero. 72.80/34.79 [2019-03-28 12:50:34,874 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... 72.80/34.79 [2019-03-28 12:50:34,875 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. 72.80/34.79 [2019-03-28 12:50:34,875 INFO L518 LassoAnalysis]: Proved termination. 72.80/34.79 [2019-03-28 12:50:34,875 INFO L520 LassoAnalysis]: Termination argument consisting of: 72.80/34.79 Ranking function f(ULTIMATE.start_diff_~l1~0, ULTIMATE.start_diff_~i~0) = 1*ULTIMATE.start_diff_~l1~0 - 1*ULTIMATE.start_diff_~i~0 72.80/34.79 Supporting invariants [] 72.80/34.79 [2019-03-28 12:50:34,917 INFO L297 tatePredicateManager]: 15 out of 15 supporting invariants were superfluous and have been removed 72.80/34.79 [2019-03-28 12:50:34,931 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 72.80/34.79 [2019-03-28 12:50:34,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 72.80/34.79 [2019-03-28 12:50:34,951 INFO L256 TraceCheckSpWp]: Trace formula consists of 83 conjuncts, 2 conjunts are in the unsatisfiable core 72.80/34.79 [2019-03-28 12:50:34,951 INFO L279 TraceCheckSpWp]: Computing forward predicates... 72.80/34.79 [2019-03-28 12:50:34,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 72.80/34.79 [2019-03-28 12:50:34,961 INFO L256 TraceCheckSpWp]: Trace formula consists of 30 conjuncts, 4 conjunts are in the unsatisfiable core 72.80/34.79 [2019-03-28 12:50:34,961 INFO L279 TraceCheckSpWp]: Computing forward predicates... 72.80/34.79 [2019-03-28 12:50:34,972 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. 72.80/34.79 [2019-03-28 12:50:35,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 72.80/34.79 [2019-03-28 12:50:35,017 INFO L256 TraceCheckSpWp]: Trace formula consists of 30 conjuncts, 4 conjunts are in the unsatisfiable core 72.80/34.79 [2019-03-28 12:50:35,018 INFO L279 TraceCheckSpWp]: Computing forward predicates... 72.80/34.79 [2019-03-28 12:50:35,049 INFO L98 LoopCannibalizer]: 2 predicates before loop cannibalization 3 predicates after loop cannibalization 72.80/34.79 [2019-03-28 12:50:35,050 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 72.80/34.79 [2019-03-28 12:50:35,050 INFO L69 BuchiDifferenceNCSB]: Start buchiDifferenceNCSB. First operand 41 states and 72 transitions. cyclomatic complexity: 34 Second operand 3 states. 72.80/34.79 [2019-03-28 12:50:35,130 INFO L73 BuchiDifferenceNCSB]: Finished buchiDifferenceNCSB. First operand 41 states and 72 transitions. cyclomatic complexity: 34. Second operand 3 states. Result 73 states and 123 transitions. Complement of second has 4 states. 72.80/34.79 [2019-03-28 12:50:35,133 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 72.80/34.79 [2019-03-28 12:50:35,133 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. 72.80/34.79 [2019-03-28 12:50:35,133 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 42 transitions. 72.80/34.79 [2019-03-28 12:50:35,133 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 42 transitions. Stem has 4 letters. Loop has 8 letters. 72.80/34.79 [2019-03-28 12:50:35,134 INFO L116 BuchiAccepts]: Finished buchiAccepts. 72.80/34.79 [2019-03-28 12:50:35,134 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 42 transitions. Stem has 12 letters. Loop has 8 letters. 72.80/34.79 [2019-03-28 12:50:35,134 INFO L116 BuchiAccepts]: Finished buchiAccepts. 72.80/34.79 [2019-03-28 12:50:35,134 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 42 transitions. Stem has 4 letters. Loop has 16 letters. 72.80/34.79 [2019-03-28 12:50:35,135 INFO L116 BuchiAccepts]: Finished buchiAccepts. 72.80/34.79 [2019-03-28 12:50:35,139 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 73 states and 123 transitions. 72.80/34.79 [2019-03-28 12:50:35,140 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 29 72.80/34.79 [2019-03-28 12:50:35,141 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 73 states to 68 states and 114 transitions. 72.80/34.79 [2019-03-28 12:50:35,141 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 35 72.80/34.79 [2019-03-28 12:50:35,141 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 36 72.80/34.79 [2019-03-28 12:50:35,141 INFO L73 IsDeterministic]: Start isDeterministic. Operand 68 states and 114 transitions. 72.80/34.79 [2019-03-28 12:50:35,141 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. 72.80/34.79 [2019-03-28 12:50:35,142 INFO L706 BuchiCegarLoop]: Abstraction has 68 states and 114 transitions. 72.80/34.79 [2019-03-28 12:50:35,142 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states and 114 transitions. 72.80/34.79 [2019-03-28 12:50:35,143 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 41. 72.80/34.79 [2019-03-28 12:50:35,143 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. 72.80/34.79 [2019-03-28 12:50:35,144 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 72 transitions. 72.80/34.79 [2019-03-28 12:50:35,144 INFO L729 BuchiCegarLoop]: Abstraction has 41 states and 72 transitions. 72.80/34.79 [2019-03-28 12:50:35,144 INFO L609 BuchiCegarLoop]: Abstraction has 41 states and 72 transitions. 72.80/34.79 [2019-03-28 12:50:35,144 INFO L442 BuchiCegarLoop]: ======== Iteration 7============ 72.80/34.79 [2019-03-28 12:50:35,144 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 41 states and 72 transitions. 72.80/34.79 [2019-03-28 12:50:35,145 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 20 72.80/34.79 [2019-03-28 12:50:35,145 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false 72.80/34.79 [2019-03-28 12:50:35,145 INFO L119 BuchiIsEmpty]: Starting construction of run 72.80/34.79 [2019-03-28 12:50:35,145 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] 72.80/34.79 [2019-03-28 12:50:35,146 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1] 72.80/34.79 [2019-03-28 12:50:35,146 INFO L794 eck$LassoCheckResult]: Stem: 875#ULTIMATE.startENTRY [150] ULTIMATE.startENTRY-->L34: Formula: (and (= |v_#NULL.offset_2| 0) (= (store |v_#valid_20| 0 0) |v_#valid_19|) (= 0 |v_#NULL.base_2|)) InVars {#valid=|v_#valid_20|} OutVars{ULTIMATE.start_main_#t~malloc8.base=|v_ULTIMATE.start_main_#t~malloc8.base_5|, ULTIMATE.start_main_#t~malloc9.base=|v_ULTIMATE.start_main_#t~malloc9.base_5|, ULTIMATE.start_main_~A~0.base=v_ULTIMATE.start_main_~A~0.base_3, ULTIMATE.start_main_~B~0.offset=v_ULTIMATE.start_main_~B~0.offset_3, #NULL.offset=|v_#NULL.offset_2|, ULTIMATE.start_main_#t~nondet6=|v_ULTIMATE.start_main_#t~nondet6_6|, ULTIMATE.start_main_#t~nondet7=|v_ULTIMATE.start_main_#t~nondet7_6|, ULTIMATE.start_main_~B~0.base=v_ULTIMATE.start_main_~B~0.base_3, #NULL.base=|v_#NULL.base_2|, ULTIMATE.start_main_~D~0.offset=v_ULTIMATE.start_main_~D~0.offset_3, ULTIMATE.start_main_#t~malloc10.base=|v_ULTIMATE.start_main_#t~malloc10.base_5|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_4|, ULTIMATE.start_main_#t~malloc8.offset=|v_ULTIMATE.start_main_#t~malloc8.offset_5|, #valid=|v_#valid_19|, ULTIMATE.start_main_#t~malloc9.offset=|v_ULTIMATE.start_main_#t~malloc9.offset_5|, ULTIMATE.start_main_~D~0.base=v_ULTIMATE.start_main_~D~0.base_3, ULTIMATE.start_main_~A~0.offset=v_ULTIMATE.start_main_~A~0.offset_3, ULTIMATE.start_main_~Blen~0=v_ULTIMATE.start_main_~Blen~0_8, ULTIMATE.start_main_~Alen~0=v_ULTIMATE.start_main_~Alen~0_8, ULTIMATE.start_main_#t~malloc10.offset=|v_ULTIMATE.start_main_#t~malloc10.offset_5|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~malloc8.base, ULTIMATE.start_main_#t~malloc9.base, ULTIMATE.start_main_~A~0.base, ULTIMATE.start_main_~B~0.offset, #NULL.offset, ULTIMATE.start_main_#t~nondet6, ULTIMATE.start_main_#t~nondet7, ULTIMATE.start_main_~B~0.base, #NULL.base, ULTIMATE.start_main_~D~0.offset, ULTIMATE.start_main_#t~malloc10.base, ULTIMATE.start_main_#res, ULTIMATE.start_main_#t~malloc8.offset, #valid, ULTIMATE.start_main_#t~malloc9.offset, ULTIMATE.start_main_~D~0.base, ULTIMATE.start_main_~A~0.offset, ULTIMATE.start_main_~Blen~0, ULTIMATE.start_main_~Alen~0, ULTIMATE.start_main_#t~malloc10.offset] 876#L34 [75] L34-->L34-2: Formula: (and (< v_ULTIMATE.start_main_~Alen~0_5 1) (= v_ULTIMATE.start_main_~Alen~0_4 1)) InVars {ULTIMATE.start_main_~Alen~0=v_ULTIMATE.start_main_~Alen~0_5} OutVars{ULTIMATE.start_main_~Alen~0=v_ULTIMATE.start_main_~Alen~0_4} AuxVars[] AssignedVars[ULTIMATE.start_main_~Alen~0] 877#L34-2 [105] L34-2-->L37-1: Formula: (>= v_ULTIMATE.start_main_~Blen~0_6 1) InVars {ULTIMATE.start_main_~Blen~0=v_ULTIMATE.start_main_~Blen~0_6} OutVars{ULTIMATE.start_main_~Blen~0=v_ULTIMATE.start_main_~Blen~0_6} AuxVars[] AssignedVars[] 878#L37-1 [123] L37-1-->L13-2: Formula: (let ((.cse2 (store |v_#valid_10| |v_ULTIMATE.start_main_#t~malloc8.base_4| 1))) (let ((.cse0 (store .cse2 |v_ULTIMATE.start_main_#t~malloc9.base_4| 1))) (and (= v_ULTIMATE.start_diff_~k~0_1 0) (= v_ULTIMATE.start_diff_~l2~0_1 v_ULTIMATE.start_diff_~Blen_1) (< |v_ULTIMATE.start_main_#t~malloc10.base_4| 0) (= v_ULTIMATE.start_diff_~A.base_1 |v_ULTIMATE.start_diff_#in~A.base_1|) (= |v_#valid_7| (store .cse0 |v_ULTIMATE.start_main_#t~malloc10.base_4| 1)) (< |v_ULTIMATE.start_main_#t~malloc10.base_4| |v_#StackHeapBarrier_1|) (= v_ULTIMATE.start_diff_~Blen_1 |v_ULTIMATE.start_diff_#in~Blen_1|) (= v_ULTIMATE.start_diff_~B.base_1 |v_ULTIMATE.start_diff_#in~B.base_1|) (> |v_ULTIMATE.start_main_#t~malloc8.base_4| 0) (= v_ULTIMATE.start_diff_~Alen_1 |v_ULTIMATE.start_diff_#in~Alen_1|) (= v_ULTIMATE.start_main_~B~0.offset_2 |v_ULTIMATE.start_main_#t~malloc9.offset_4|) (= v_ULTIMATE.start_main_~B~0.base_2 |v_ULTIMATE.start_main_#t~malloc9.base_4|) (= |v_ULTIMATE.start_diff_#in~A.base_1| v_ULTIMATE.start_main_~A~0.base_2) (= |v_ULTIMATE.start_main_#t~malloc8.offset_4| 0) (= |v_#length_1| (let ((.cse1 (* 4 v_ULTIMATE.start_main_~Alen~0_7))) (store (store (store |v_#length_4| |v_ULTIMATE.start_main_#t~malloc8.base_4| .cse1) |v_ULTIMATE.start_main_#t~malloc9.base_4| (* 4 v_ULTIMATE.start_main_~Blen~0_7)) |v_ULTIMATE.start_main_#t~malloc10.base_4| .cse1))) (= v_ULTIMATE.start_diff_~D.base_1 |v_ULTIMATE.start_diff_#in~D.base_1|) (= |v_ULTIMATE.start_main_#t~malloc9.offset_4| 0) (= |v_ULTIMATE.start_diff_#in~B.offset_1| v_ULTIMATE.start_main_~B~0.offset_2) (= |v_ULTIMATE.start_diff_#in~A.offset_1| v_ULTIMATE.start_main_~A~0.offset_2) (= v_ULTIMATE.start_diff_~B.offset_1 |v_ULTIMATE.start_diff_#in~B.offset_1|) (= v_ULTIMATE.start_main_~A~0.base_2 |v_ULTIMATE.start_main_#t~malloc8.base_4|) (< |v_ULTIMATE.start_main_#t~malloc8.base_4| |v_#StackHeapBarrier_1|) (= |v_ULTIMATE.start_diff_#in~B.base_1| v_ULTIMATE.start_main_~B~0.base_2) (< 0 |v_ULTIMATE.start_main_#t~malloc9.base_4|) (< |v_ULTIMATE.start_main_#t~malloc9.base_4| |v_#StackHeapBarrier_1|) (= |v_ULTIMATE.start_diff_#in~D.offset_1| v_ULTIMATE.start_main_~D~0.offset_2) (= v_ULTIMATE.start_main_~D~0.offset_2 |v_ULTIMATE.start_main_#t~malloc10.offset_4|) (= v_ULTIMATE.start_diff_~i~0_1 0) (= 0 (select .cse2 |v_ULTIMATE.start_main_#t~malloc9.base_4|)) (= v_ULTIMATE.start_main_~D~0.base_2 |v_ULTIMATE.start_main_#t~malloc10.base_4|) (= |v_ULTIMATE.start_diff_#in~Blen_1| v_ULTIMATE.start_main_~Blen~0_7) (= v_ULTIMATE.start_diff_~l1~0_1 v_ULTIMATE.start_diff_~Alen_1) (= 0 (select .cse0 |v_ULTIMATE.start_main_#t~malloc10.base_4|)) (= (select |v_#valid_10| |v_ULTIMATE.start_main_#t~malloc8.base_4|) 0) (= v_ULTIMATE.start_diff_~A.offset_1 |v_ULTIMATE.start_diff_#in~A.offset_1|) (= |v_ULTIMATE.start_diff_#in~Alen_1| v_ULTIMATE.start_main_~Alen~0_7) (= v_ULTIMATE.start_main_~A~0.offset_2 |v_ULTIMATE.start_main_#t~malloc8.offset_4|) (= |v_ULTIMATE.start_main_#t~malloc10.offset_4| 0) (= |v_ULTIMATE.start_diff_#in~D.base_1| v_ULTIMATE.start_main_~D~0.base_2) (= v_ULTIMATE.start_diff_~D.offset_1 |v_ULTIMATE.start_diff_#in~D.offset_1|)))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_4|, #valid=|v_#valid_10|, ULTIMATE.start_main_~Blen~0=v_ULTIMATE.start_main_~Blen~0_7, ULTIMATE.start_main_~Alen~0=v_ULTIMATE.start_main_~Alen~0_7} OutVars{ULTIMATE.start_diff_#in~A.base=|v_ULTIMATE.start_diff_#in~A.base_1|, ULTIMATE.start_diff_#in~B.base=|v_ULTIMATE.start_diff_#in~B.base_1|, ULTIMATE.start_diff_~B.offset=v_ULTIMATE.start_diff_~B.offset_1, ULTIMATE.start_diff_~Alen=v_ULTIMATE.start_diff_~Alen_1, ULTIMATE.start_diff_~D.base=v_ULTIMATE.start_diff_~D.base_1, ULTIMATE.start_diff_#in~Blen=|v_ULTIMATE.start_diff_#in~Blen_1|, ULTIMATE.start_main_~B~0.offset=v_ULTIMATE.start_main_~B~0.offset_2, ULTIMATE.start_main_~B~0.base=v_ULTIMATE.start_main_~B~0.base_2, ULTIMATE.start_diff_#in~A.offset=|v_ULTIMATE.start_diff_#in~A.offset_1|, ULTIMATE.start_main_~D~0.offset=v_ULTIMATE.start_main_~D~0.offset_2, ULTIMATE.start_diff_#in~D.offset=|v_ULTIMATE.start_diff_#in~D.offset_1|, ULTIMATE.start_diff_#in~Alen=|v_ULTIMATE.start_diff_#in~Alen_1|, ULTIMATE.start_diff_~A.base=v_ULTIMATE.start_diff_~A.base_1, ULTIMATE.start_diff_~B.base=v_ULTIMATE.start_diff_~B.base_1, #length=|v_#length_1|, ULTIMATE.start_main_#t~malloc9.offset=|v_ULTIMATE.start_main_#t~malloc9.offset_4|, ULTIMATE.start_diff_#t~mem3=|v_ULTIMATE.start_diff_#t~mem3_1|, ULTIMATE.start_main_~A~0.offset=v_ULTIMATE.start_main_~A~0.offset_2, ULTIMATE.start_main_#t~malloc10.offset=|v_ULTIMATE.start_main_#t~malloc10.offset_4|, ULTIMATE.start_main_~Blen~0=v_ULTIMATE.start_main_~Blen~0_7, ULTIMATE.start_main_~Alen~0=v_ULTIMATE.start_main_~Alen~0_7, ULTIMATE.start_diff_~Blen=v_ULTIMATE.start_diff_~Blen_1, ULTIMATE.start_main_#t~malloc8.base=|v_ULTIMATE.start_main_#t~malloc8.base_4|, ULTIMATE.start_diff_#t~mem0=|v_ULTIMATE.start_diff_#t~mem0_1|, ULTIMATE.start_main_#t~malloc9.base=|v_ULTIMATE.start_main_#t~malloc9.base_4|, ULTIMATE.start_diff_#t~mem1=|v_ULTIMATE.start_diff_#t~mem1_1|, ULTIMATE.start_main_~A~0.base=v_ULTIMATE.start_main_~A~0.base_2, ULTIMATE.start_diff_#t~post4=|v_ULTIMATE.start_diff_#t~post4_1|, ULTIMATE.start_diff_~found~0=v_ULTIMATE.start_diff_~found~0_1, ULTIMATE.start_diff_#in~B.offset=|v_ULTIMATE.start_diff_#in~B.offset_1|, ULTIMATE.start_diff_~i~0=v_ULTIMATE.start_diff_~i~0_1, ULTIMATE.start_diff_~l1~0=v_ULTIMATE.start_diff_~l1~0_1, ULTIMATE.start_diff_#t~post5=|v_ULTIMATE.start_diff_#t~post5_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, ULTIMATE.start_main_#t~malloc10.base=|v_ULTIMATE.start_main_#t~malloc10.base_4|, ULTIMATE.start_diff_~D.offset=v_ULTIMATE.start_diff_~D.offset_1, ULTIMATE.start_diff_~l2~0=v_ULTIMATE.start_diff_~l2~0_1, ULTIMATE.start_diff_~j~0=v_ULTIMATE.start_diff_~j~0_1, ULTIMATE.start_main_#t~malloc8.offset=|v_ULTIMATE.start_main_#t~malloc8.offset_4|, #valid=|v_#valid_7|, ULTIMATE.start_diff_~k~0=v_ULTIMATE.start_diff_~k~0_1, ULTIMATE.start_diff_#in~D.base=|v_ULTIMATE.start_diff_#in~D.base_1|, ULTIMATE.start_diff_#t~post2=|v_ULTIMATE.start_diff_#t~post2_1|, ULTIMATE.start_diff_~A.offset=v_ULTIMATE.start_diff_~A.offset_1, ULTIMATE.start_main_~D~0.base=v_ULTIMATE.start_main_~D~0.base_2} AuxVars[] AssignedVars[ULTIMATE.start_diff_#in~A.base, ULTIMATE.start_diff_#in~B.base, ULTIMATE.start_diff_~B.offset, ULTIMATE.start_diff_~Alen, ULTIMATE.start_diff_~D.base, ULTIMATE.start_diff_#in~Blen, ULTIMATE.start_main_~B~0.offset, ULTIMATE.start_main_~B~0.base, ULTIMATE.start_diff_#in~A.offset, ULTIMATE.start_main_~D~0.offset, ULTIMATE.start_diff_#in~D.offset, ULTIMATE.start_diff_#in~Alen, ULTIMATE.start_diff_~A.base, ULTIMATE.start_diff_~B.base, #length, ULTIMATE.start_main_#t~malloc9.offset, ULTIMATE.start_diff_#t~mem3, ULTIMATE.start_main_~A~0.offset, ULTIMATE.start_main_#t~malloc10.offset, ULTIMATE.start_diff_~Blen, ULTIMATE.start_main_#t~malloc8.base, ULTIMATE.start_diff_#t~mem0, ULTIMATE.start_main_#t~malloc9.base, ULTIMATE.start_diff_#t~mem1, ULTIMATE.start_main_~A~0.base, ULTIMATE.start_diff_#t~post4, ULTIMATE.start_diff_~found~0, ULTIMATE.start_diff_#in~B.offset, ULTIMATE.start_diff_~i~0, ULTIMATE.start_diff_~l1~0, ULTIMATE.start_diff_#t~post5, ULTIMATE.start_main_#t~malloc10.base, ULTIMATE.start_diff_~D.offset, ULTIMATE.start_diff_~l2~0, ULTIMATE.start_diff_~j~0, ULTIMATE.start_main_#t~malloc8.offset, #valid, ULTIMATE.start_diff_~k~0, ULTIMATE.start_diff_#in~D.base, ULTIMATE.start_diff_#t~post2, ULTIMATE.start_diff_~A.offset, ULTIMATE.start_main_~D~0.base] 883#L13-2 72.80/34.79 [2019-03-28 12:50:35,146 INFO L796 eck$LassoCheckResult]: Loop: 883#L13-2 [91] L13-2-->L17-4: Formula: (and (< v_ULTIMATE.start_diff_~i~0_4 v_ULTIMATE.start_diff_~l1~0_4) (= v_ULTIMATE.start_diff_~j~0_2 0) (= v_ULTIMATE.start_diff_~found~0_3 0)) InVars {ULTIMATE.start_diff_~i~0=v_ULTIMATE.start_diff_~i~0_4, ULTIMATE.start_diff_~l1~0=v_ULTIMATE.start_diff_~l1~0_4} OutVars{ULTIMATE.start_diff_~found~0=v_ULTIMATE.start_diff_~found~0_3, ULTIMATE.start_diff_~i~0=v_ULTIMATE.start_diff_~i~0_4, ULTIMATE.start_diff_~l1~0=v_ULTIMATE.start_diff_~l1~0_4, ULTIMATE.start_diff_~j~0=v_ULTIMATE.start_diff_~j~0_2} AuxVars[] AssignedVars[ULTIMATE.start_diff_~found~0, ULTIMATE.start_diff_~j~0] 901#L17-4 [99] L17-4-->L17: Formula: (and (= 0 v_ULTIMATE.start_diff_~found~0_5) (< v_ULTIMATE.start_diff_~j~0_4 v_ULTIMATE.start_diff_~l2~0_4)) InVars {ULTIMATE.start_diff_~found~0=v_ULTIMATE.start_diff_~found~0_5, ULTIMATE.start_diff_~j~0=v_ULTIMATE.start_diff_~j~0_4, ULTIMATE.start_diff_~l2~0=v_ULTIMATE.start_diff_~l2~0_4} OutVars{ULTIMATE.start_diff_~found~0=v_ULTIMATE.start_diff_~found~0_5, ULTIMATE.start_diff_~j~0=v_ULTIMATE.start_diff_~j~0_4, ULTIMATE.start_diff_~l2~0=v_ULTIMATE.start_diff_~l2~0_4} AuxVars[] AssignedVars[] 895#L17 [85] L17-->L17-1: Formula: (let ((.cse0 (* 4 v_ULTIMATE.start_diff_~i~0_5))) (let ((.cse1 (+ .cse0 v_ULTIMATE.start_diff_~A.offset_3))) (and (<= (+ .cse0 v_ULTIMATE.start_diff_~A.offset_3 4) (select |v_#length_5| v_ULTIMATE.start_diff_~A.base_3)) (= 1 (select |v_#valid_11| v_ULTIMATE.start_diff_~A.base_3)) (= (select (select |v_#memory_int_1| v_ULTIMATE.start_diff_~A.base_3) .cse1) |v_ULTIMATE.start_diff_#t~mem0_2|) (<= 0 .cse1)))) InVars {ULTIMATE.start_diff_~i~0=v_ULTIMATE.start_diff_~i~0_5, ULTIMATE.start_diff_~A.base=v_ULTIMATE.start_diff_~A.base_3, #valid=|v_#valid_11|, #memory_int=|v_#memory_int_1|, #length=|v_#length_5|, ULTIMATE.start_diff_~A.offset=v_ULTIMATE.start_diff_~A.offset_3} OutVars{ULTIMATE.start_diff_#t~mem0=|v_ULTIMATE.start_diff_#t~mem0_2|, ULTIMATE.start_diff_~i~0=v_ULTIMATE.start_diff_~i~0_5, ULTIMATE.start_diff_~A.base=v_ULTIMATE.start_diff_~A.base_3, #valid=|v_#valid_11|, #memory_int=|v_#memory_int_1|, #length=|v_#length_5|, ULTIMATE.start_diff_~A.offset=v_ULTIMATE.start_diff_~A.offset_3} AuxVars[] AssignedVars[ULTIMATE.start_diff_#t~mem0] 900#L17-1 [82] L17-1-->L17-2: Formula: (let ((.cse1 (* 4 v_ULTIMATE.start_diff_~j~0_5))) (let ((.cse0 (+ v_ULTIMATE.start_diff_~B.offset_3 .cse1))) (and (<= 0 .cse0) (= 1 (select |v_#valid_13| v_ULTIMATE.start_diff_~B.base_3)) (= (select (select |v_#memory_int_2| v_ULTIMATE.start_diff_~B.base_3) .cse0) |v_ULTIMATE.start_diff_#t~mem1_2|) (<= (+ v_ULTIMATE.start_diff_~B.offset_3 .cse1 4) (select |v_#length_7| v_ULTIMATE.start_diff_~B.base_3))))) InVars {ULTIMATE.start_diff_~B.offset=v_ULTIMATE.start_diff_~B.offset_3, ULTIMATE.start_diff_~j~0=v_ULTIMATE.start_diff_~j~0_5, #valid=|v_#valid_13|, ULTIMATE.start_diff_~B.base=v_ULTIMATE.start_diff_~B.base_3, #memory_int=|v_#memory_int_2|, #length=|v_#length_7|} OutVars{ULTIMATE.start_diff_#t~mem1=|v_ULTIMATE.start_diff_#t~mem1_2|, ULTIMATE.start_diff_~B.offset=v_ULTIMATE.start_diff_~B.offset_3, ULTIMATE.start_diff_~j~0=v_ULTIMATE.start_diff_~j~0_5, #valid=|v_#valid_13|, ULTIMATE.start_diff_~B.base=v_ULTIMATE.start_diff_~B.base_3, #memory_int=|v_#memory_int_2|, #length=|v_#length_7|} AuxVars[] AssignedVars[ULTIMATE.start_diff_#t~mem1] 898#L17-2 [80] L17-2-->L17-4: Formula: (and (= |v_ULTIMATE.start_diff_#t~mem1_4| |v_ULTIMATE.start_diff_#t~mem0_4|) (= v_ULTIMATE.start_diff_~found~0_6 1)) InVars {ULTIMATE.start_diff_#t~mem0=|v_ULTIMATE.start_diff_#t~mem0_4|, ULTIMATE.start_diff_#t~mem1=|v_ULTIMATE.start_diff_#t~mem1_4|} OutVars{ULTIMATE.start_diff_#t~mem0=|v_ULTIMATE.start_diff_#t~mem0_3|, ULTIMATE.start_diff_#t~mem1=|v_ULTIMATE.start_diff_#t~mem1_3|, ULTIMATE.start_diff_~found~0=v_ULTIMATE.start_diff_~found~0_6} AuxVars[] AssignedVars[ULTIMATE.start_diff_#t~mem0, ULTIMATE.start_diff_#t~mem1, ULTIMATE.start_diff_~found~0] 894#L17-4 [127] L17-4-->L16-2: Formula: (< 0 v_ULTIMATE.start_diff_~found~0_4) InVars {ULTIMATE.start_diff_~found~0=v_ULTIMATE.start_diff_~found~0_4} OutVars{ULTIMATE.start_diff_~found~0=v_ULTIMATE.start_diff_~found~0_4} AuxVars[] AssignedVars[] 891#L16-2 [130] L16-2-->L23-1: Formula: (< 0 v_ULTIMATE.start_diff_~found~0_8) InVars {ULTIMATE.start_diff_~found~0=v_ULTIMATE.start_diff_~found~0_8} OutVars{ULTIMATE.start_diff_~found~0=v_ULTIMATE.start_diff_~found~0_8} AuxVars[] AssignedVars[] 882#L23-1 [74] L23-1-->L13-2: Formula: (= v_ULTIMATE.start_diff_~i~0_9 (+ v_ULTIMATE.start_diff_~i~0_10 1)) InVars {ULTIMATE.start_diff_~i~0=v_ULTIMATE.start_diff_~i~0_10} OutVars{ULTIMATE.start_diff_#t~post5=|v_ULTIMATE.start_diff_#t~post5_2|, ULTIMATE.start_diff_~i~0=v_ULTIMATE.start_diff_~i~0_9} AuxVars[] AssignedVars[ULTIMATE.start_diff_#t~post5, ULTIMATE.start_diff_~i~0] 883#L13-2 72.80/34.79 [2019-03-28 12:50:35,147 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 72.80/34.79 [2019-03-28 12:50:35,147 INFO L82 PathProgramCache]: Analyzing trace with hash 5467624, now seen corresponding path program 1 times 72.80/34.79 [2019-03-28 12:50:35,147 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 72.80/34.79 [2019-03-28 12:50:35,147 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 72.80/34.79 [2019-03-28 12:50:35,148 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 72.80/34.79 [2019-03-28 12:50:35,148 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 72.80/34.79 [2019-03-28 12:50:35,148 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 72.80/34.79 [2019-03-28 12:50:35,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 72.80/34.79 [2019-03-28 12:50:35,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 72.80/34.79 [2019-03-28 12:50:35,158 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 72.80/34.79 [2019-03-28 12:50:35,159 INFO L82 PathProgramCache]: Analyzing trace with hash -1945236739, now seen corresponding path program 4 times 72.80/34.79 [2019-03-28 12:50:35,159 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 72.80/34.79 [2019-03-28 12:50:35,159 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 72.80/34.79 [2019-03-28 12:50:35,159 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 72.80/34.79 [2019-03-28 12:50:35,160 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 72.80/34.79 [2019-03-28 12:50:35,160 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 72.80/34.79 [2019-03-28 12:50:35,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 72.80/34.79 [2019-03-28 12:50:35,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 72.80/34.79 [2019-03-28 12:50:35,167 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 72.80/34.79 [2019-03-28 12:50:35,167 INFO L82 PathProgramCache]: Analyzing trace with hash 1986306532, now seen corresponding path program 1 times 72.80/34.79 [2019-03-28 12:50:35,167 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 72.80/34.79 [2019-03-28 12:50:35,167 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 72.80/34.79 [2019-03-28 12:50:35,168 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 72.80/34.79 [2019-03-28 12:50:35,168 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY 72.80/34.79 [2019-03-28 12:50:35,168 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 72.80/34.79 [2019-03-28 12:50:35,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 72.80/34.79 [2019-03-28 12:50:35,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 72.80/34.79 [2019-03-28 12:50:35,651 WARN L188 SmtUtils]: Spent 364.00 ms on a formula simplification. DAG size of input: 105 DAG size of output: 104 72.80/34.79 [2019-03-28 12:50:35,828 WARN L188 SmtUtils]: Spent 175.00 ms on a formula simplification that was a NOOP. DAG size: 100 72.80/34.79 [2019-03-28 12:50:35,830 INFO L216 LassoAnalysis]: Preferences: 72.80/34.79 [2019-03-28 12:50:35,831 INFO L124 ssoRankerPreferences]: Compute integeral hull: false 72.80/34.79 [2019-03-28 12:50:35,831 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true 72.80/34.79 [2019-03-28 12:50:35,831 INFO L126 ssoRankerPreferences]: Term annotations enabled: false 72.80/34.79 [2019-03-28 12:50:35,831 INFO L127 ssoRankerPreferences]: Use exernal solver: false 72.80/34.79 [2019-03-28 12:50:35,831 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 72.80/34.79 [2019-03-28 12:50:35,831 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false 72.80/34.79 [2019-03-28 12:50:35,831 INFO L130 ssoRankerPreferences]: Path of dumped script: 72.80/34.79 [2019-03-28 12:50:35,831 INFO L131 ssoRankerPreferences]: Filename of dumped script: theBenchmark.c_BEv2_Iteration7_Lasso 72.80/34.79 [2019-03-28 12:50:35,832 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank 72.80/34.79 [2019-03-28 12:50:35,832 INFO L282 LassoAnalysis]: Starting lasso preprocessing... 72.80/34.79 [2019-03-28 12:50:35,834 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 72.80/34.79 [2019-03-28 12:50:35,837 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 72.80/34.79 [2019-03-28 12:50:35,839 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 72.80/34.79 [2019-03-28 12:50:35,840 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 72.80/34.79 [2019-03-28 12:50:35,842 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 72.80/34.79 [2019-03-28 12:50:35,844 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 72.80/34.79 [2019-03-28 12:50:35,845 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 72.80/34.79 [2019-03-28 12:50:35,847 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 72.80/34.79 [2019-03-28 12:50:35,853 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 72.80/34.79 [2019-03-28 12:50:35,855 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 72.80/34.79 [2019-03-28 12:50:35,857 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 72.80/34.79 [2019-03-28 12:50:35,858 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 72.80/34.79 [2019-03-28 12:50:35,860 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 72.80/34.79 [2019-03-28 12:50:36,160 WARN L188 SmtUtils]: Spent 229.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 89 72.80/34.79 [2019-03-28 12:50:36,199 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 72.80/34.79 [2019-03-28 12:50:36,201 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 72.80/34.79 [2019-03-28 12:50:36,654 INFO L300 LassoAnalysis]: Preprocessing complete. 72.80/34.79 [2019-03-28 12:50:36,654 INFO L497 LassoAnalysis]: Using template 'affine'. 72.80/34.79 [2019-03-28 12:50:36,654 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 72.80/34.79 Termination analysis: LINEAR_WITH_GUESSES 72.80/34.79 Number of strict supporting invariants: 0 72.80/34.79 Number of non-strict supporting invariants: 1 72.80/34.79 Consider only non-deceasing supporting invariants: true 72.80/34.79 Simplify termination arguments: true 72.80/34.79 Simplify supporting invariants: trueOverapproximate stem: false 72.80/34.79 [2019-03-28 12:50:36,655 INFO L339 nArgumentSynthesizer]: Template has degree 0. 72.80/34.79 [2019-03-28 12:50:36,655 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 72.80/34.79 [2019-03-28 12:50:36,655 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 72.80/34.79 [2019-03-28 12:50:36,656 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 72.80/34.79 [2019-03-28 12:50:36,656 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 72.80/34.79 [2019-03-28 12:50:36,656 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 72.80/34.79 [2019-03-28 12:50:36,656 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 72.80/34.79 [2019-03-28 12:50:36,658 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 72.80/34.79 [2019-03-28 12:50:36,658 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 72.80/34.79 Termination analysis: LINEAR_WITH_GUESSES 72.80/34.79 Number of strict supporting invariants: 0 72.80/34.79 Number of non-strict supporting invariants: 1 72.80/34.79 Consider only non-deceasing supporting invariants: true 72.80/34.79 Simplify termination arguments: true 72.80/34.79 Simplify supporting invariants: trueOverapproximate stem: false 72.80/34.79 [2019-03-28 12:50:36,659 INFO L339 nArgumentSynthesizer]: Template has degree 0. 72.80/34.79 [2019-03-28 12:50:36,659 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 72.80/34.79 [2019-03-28 12:50:36,659 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 72.80/34.79 [2019-03-28 12:50:36,659 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 72.80/34.79 [2019-03-28 12:50:36,659 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 72.80/34.79 [2019-03-28 12:50:36,659 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 72.80/34.79 [2019-03-28 12:50:36,660 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 72.80/34.79 [2019-03-28 12:50:36,660 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 72.80/34.79 [2019-03-28 12:50:36,660 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 72.80/34.79 Termination analysis: LINEAR_WITH_GUESSES 72.80/34.79 Number of strict supporting invariants: 0 72.80/34.79 Number of non-strict supporting invariants: 1 72.80/34.79 Consider only non-deceasing supporting invariants: true 72.80/34.79 Simplify termination arguments: true 72.80/34.79 Simplify supporting invariants: trueOverapproximate stem: false 72.80/34.79 [2019-03-28 12:50:36,660 INFO L339 nArgumentSynthesizer]: Template has degree 0. 72.80/34.79 [2019-03-28 12:50:36,661 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 72.80/34.79 [2019-03-28 12:50:36,661 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 72.80/34.79 [2019-03-28 12:50:36,661 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 72.80/34.79 [2019-03-28 12:50:36,661 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 72.80/34.79 [2019-03-28 12:50:36,661 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 72.80/34.79 [2019-03-28 12:50:36,661 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 72.80/34.79 [2019-03-28 12:50:36,662 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 72.80/34.79 [2019-03-28 12:50:36,662 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 72.80/34.79 Termination analysis: LINEAR_WITH_GUESSES 72.80/34.79 Number of strict supporting invariants: 0 72.80/34.79 Number of non-strict supporting invariants: 1 72.80/34.79 Consider only non-deceasing supporting invariants: true 72.80/34.79 Simplify termination arguments: true 72.80/34.79 Simplify supporting invariants: trueOverapproximate stem: false 72.80/34.79 [2019-03-28 12:50:36,662 INFO L339 nArgumentSynthesizer]: Template has degree 0. 72.80/34.79 [2019-03-28 12:50:36,662 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 72.80/34.79 [2019-03-28 12:50:36,662 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 72.80/34.79 [2019-03-28 12:50:36,663 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 72.80/34.79 [2019-03-28 12:50:36,663 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. 72.80/34.79 [2019-03-28 12:50:36,663 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. 72.80/34.79 [2019-03-28 12:50:36,664 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 72.80/34.79 [2019-03-28 12:50:36,664 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 72.80/34.79 Termination analysis: LINEAR_WITH_GUESSES 72.80/34.79 Number of strict supporting invariants: 0 72.80/34.79 Number of non-strict supporting invariants: 1 72.80/34.79 Consider only non-deceasing supporting invariants: true 72.80/34.79 Simplify termination arguments: true 72.80/34.79 Simplify supporting invariants: trueOverapproximate stem: false 72.80/34.79 [2019-03-28 12:50:36,665 INFO L339 nArgumentSynthesizer]: Template has degree 0. 72.80/34.79 [2019-03-28 12:50:36,665 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 72.80/34.79 [2019-03-28 12:50:36,665 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 72.80/34.79 [2019-03-28 12:50:36,665 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 72.80/34.79 [2019-03-28 12:50:36,665 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 72.80/34.79 [2019-03-28 12:50:36,666 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 72.80/34.79 [2019-03-28 12:50:36,666 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 72.80/34.79 [2019-03-28 12:50:36,666 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 72.80/34.79 [2019-03-28 12:50:36,666 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 72.80/34.79 Termination analysis: LINEAR_WITH_GUESSES 72.80/34.79 Number of strict supporting invariants: 0 72.80/34.79 Number of non-strict supporting invariants: 1 72.80/34.79 Consider only non-deceasing supporting invariants: true 72.80/34.79 Simplify termination arguments: true 72.80/34.79 Simplify supporting invariants: trueOverapproximate stem: false 72.80/34.79 [2019-03-28 12:50:36,667 INFO L339 nArgumentSynthesizer]: Template has degree 0. 72.80/34.79 [2019-03-28 12:50:36,667 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 72.80/34.79 [2019-03-28 12:50:36,667 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 72.80/34.79 [2019-03-28 12:50:36,667 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 72.80/34.79 [2019-03-28 12:50:36,667 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 72.80/34.79 [2019-03-28 12:50:36,667 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 72.80/34.79 [2019-03-28 12:50:36,668 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 72.80/34.79 [2019-03-28 12:50:36,668 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 72.80/34.79 [2019-03-28 12:50:36,668 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 72.80/34.79 Termination analysis: LINEAR_WITH_GUESSES 72.80/34.79 Number of strict supporting invariants: 0 72.80/34.79 Number of non-strict supporting invariants: 1 72.80/34.79 Consider only non-deceasing supporting invariants: true 72.80/34.79 Simplify termination arguments: true 72.80/34.79 Simplify supporting invariants: trueOverapproximate stem: false 72.80/34.79 [2019-03-28 12:50:36,668 INFO L339 nArgumentSynthesizer]: Template has degree 0. 72.80/34.79 [2019-03-28 12:50:36,669 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 72.80/34.79 [2019-03-28 12:50:36,669 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 72.80/34.79 [2019-03-28 12:50:36,669 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 72.80/34.79 [2019-03-28 12:50:36,669 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 72.80/34.79 [2019-03-28 12:50:36,669 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 72.80/34.79 [2019-03-28 12:50:36,669 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 72.80/34.79 [2019-03-28 12:50:36,670 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 72.80/34.79 [2019-03-28 12:50:36,670 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 72.80/34.79 Termination analysis: LINEAR_WITH_GUESSES 72.80/34.79 Number of strict supporting invariants: 0 72.80/34.79 Number of non-strict supporting invariants: 1 72.80/34.79 Consider only non-deceasing supporting invariants: true 72.80/34.79 Simplify termination arguments: true 72.80/34.79 Simplify supporting invariants: trueOverapproximate stem: false 72.80/34.79 [2019-03-28 12:50:36,670 INFO L339 nArgumentSynthesizer]: Template has degree 0. 72.80/34.79 [2019-03-28 12:50:36,670 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 72.80/34.79 [2019-03-28 12:50:36,671 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 72.80/34.79 [2019-03-28 12:50:36,671 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 72.80/34.79 [2019-03-28 12:50:36,672 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. 72.80/34.79 [2019-03-28 12:50:36,672 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. 72.80/34.79 [2019-03-28 12:50:36,673 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 72.80/34.79 [2019-03-28 12:50:36,674 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 72.80/34.79 Termination analysis: LINEAR_WITH_GUESSES 72.80/34.79 Number of strict supporting invariants: 0 72.80/34.79 Number of non-strict supporting invariants: 1 72.80/34.79 Consider only non-deceasing supporting invariants: true 72.80/34.79 Simplify termination arguments: true 72.80/34.79 Simplify supporting invariants: trueOverapproximate stem: false 72.80/34.79 [2019-03-28 12:50:36,674 INFO L339 nArgumentSynthesizer]: Template has degree 0. 72.80/34.79 [2019-03-28 12:50:36,674 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 72.80/34.79 [2019-03-28 12:50:36,674 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 72.80/34.79 [2019-03-28 12:50:36,674 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 72.80/34.79 [2019-03-28 12:50:36,675 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. 72.80/34.79 [2019-03-28 12:50:36,675 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. 72.80/34.79 [2019-03-28 12:50:36,676 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 72.80/34.79 [2019-03-28 12:50:36,676 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 72.80/34.79 Termination analysis: LINEAR_WITH_GUESSES 72.80/34.79 Number of strict supporting invariants: 0 72.80/34.79 Number of non-strict supporting invariants: 1 72.80/34.79 Consider only non-deceasing supporting invariants: true 72.80/34.79 Simplify termination arguments: true 72.80/34.79 Simplify supporting invariants: trueOverapproximate stem: false 72.80/34.79 [2019-03-28 12:50:36,677 INFO L339 nArgumentSynthesizer]: Template has degree 0. 72.80/34.79 [2019-03-28 12:50:36,677 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 72.80/34.79 [2019-03-28 12:50:36,677 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 72.80/34.79 [2019-03-28 12:50:36,677 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 72.80/34.79 [2019-03-28 12:50:36,677 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 72.80/34.79 [2019-03-28 12:50:36,677 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 72.80/34.79 [2019-03-28 12:50:36,677 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 72.80/34.79 [2019-03-28 12:50:36,678 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 72.80/34.79 [2019-03-28 12:50:36,678 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 72.80/34.79 Termination analysis: LINEAR_WITH_GUESSES 72.80/34.79 Number of strict supporting invariants: 0 72.80/34.79 Number of non-strict supporting invariants: 1 72.80/34.79 Consider only non-deceasing supporting invariants: true 72.80/34.79 Simplify termination arguments: true 72.80/34.79 Simplify supporting invariants: trueOverapproximate stem: false 72.80/34.79 [2019-03-28 12:50:36,678 INFO L339 nArgumentSynthesizer]: Template has degree 0. 72.80/34.79 [2019-03-28 12:50:36,679 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 72.80/34.79 [2019-03-28 12:50:36,679 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 72.80/34.79 [2019-03-28 12:50:36,679 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 72.80/34.79 [2019-03-28 12:50:36,679 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. 72.80/34.79 [2019-03-28 12:50:36,679 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. 72.80/34.79 [2019-03-28 12:50:36,680 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 72.80/34.79 [2019-03-28 12:50:36,681 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 72.80/34.79 Termination analysis: LINEAR_WITH_GUESSES 72.80/34.79 Number of strict supporting invariants: 0 72.80/34.79 Number of non-strict supporting invariants: 1 72.80/34.79 Consider only non-deceasing supporting invariants: true 72.80/34.79 Simplify termination arguments: true 72.80/34.79 Simplify supporting invariants: trueOverapproximate stem: false 72.80/34.79 [2019-03-28 12:50:36,681 INFO L339 nArgumentSynthesizer]: Template has degree 0. 72.80/34.79 [2019-03-28 12:50:36,681 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 72.80/34.79 [2019-03-28 12:50:36,681 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 72.80/34.79 [2019-03-28 12:50:36,681 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 72.80/34.79 [2019-03-28 12:50:36,682 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 72.80/34.79 [2019-03-28 12:50:36,682 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 72.80/34.79 [2019-03-28 12:50:36,682 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 72.80/34.79 [2019-03-28 12:50:36,682 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 72.80/34.79 [2019-03-28 12:50:36,682 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 72.80/34.79 Termination analysis: LINEAR_WITH_GUESSES 72.80/34.79 Number of strict supporting invariants: 0 72.80/34.79 Number of non-strict supporting invariants: 1 72.80/34.79 Consider only non-deceasing supporting invariants: true 72.80/34.79 Simplify termination arguments: true 72.80/34.79 Simplify supporting invariants: trueOverapproximate stem: false 72.80/34.79 [2019-03-28 12:50:36,683 INFO L339 nArgumentSynthesizer]: Template has degree 0. 72.80/34.79 [2019-03-28 12:50:36,683 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 72.80/34.79 [2019-03-28 12:50:36,683 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 72.80/34.79 [2019-03-28 12:50:36,683 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 72.80/34.79 [2019-03-28 12:50:36,684 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. 72.80/34.79 [2019-03-28 12:50:36,684 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. 72.80/34.79 [2019-03-28 12:50:36,686 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 72.80/34.79 [2019-03-28 12:50:36,687 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 72.80/34.79 Termination analysis: LINEAR_WITH_GUESSES 72.80/34.79 Number of strict supporting invariants: 0 72.80/34.79 Number of non-strict supporting invariants: 1 72.80/34.79 Consider only non-deceasing supporting invariants: true 72.80/34.79 Simplify termination arguments: true 72.80/34.79 Simplify supporting invariants: trueOverapproximate stem: false 72.80/34.79 [2019-03-28 12:50:36,687 INFO L339 nArgumentSynthesizer]: Template has degree 0. 72.80/34.79 [2019-03-28 12:50:36,687 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 72.80/34.79 [2019-03-28 12:50:36,687 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 72.80/34.79 [2019-03-28 12:50:36,687 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 72.80/34.79 [2019-03-28 12:50:36,688 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. 72.80/34.79 [2019-03-28 12:50:36,688 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. 72.80/34.79 [2019-03-28 12:50:36,691 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 72.80/34.79 [2019-03-28 12:50:36,692 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 72.80/34.79 Termination analysis: LINEAR_WITH_GUESSES 72.80/34.79 Number of strict supporting invariants: 0 72.80/34.79 Number of non-strict supporting invariants: 1 72.80/34.79 Consider only non-deceasing supporting invariants: true 72.80/34.79 Simplify termination arguments: true 72.80/34.79 Simplify supporting invariants: trueOverapproximate stem: false 72.80/34.79 [2019-03-28 12:50:36,692 INFO L339 nArgumentSynthesizer]: Template has degree 0. 72.80/34.79 [2019-03-28 12:50:36,692 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 72.80/34.79 [2019-03-28 12:50:36,692 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 72.80/34.79 [2019-03-28 12:50:36,692 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 72.80/34.79 [2019-03-28 12:50:36,694 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. 72.80/34.79 [2019-03-28 12:50:36,694 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. 72.80/34.79 [2019-03-28 12:50:36,706 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. 72.80/34.79 [2019-03-28 12:50:36,716 INFO L443 ModelExtractionUtils]: Simplification made 6 calls to the SMT solver. 72.80/34.79 [2019-03-28 12:50:36,717 INFO L444 ModelExtractionUtils]: 31 out of 40 variables were initially zero. Simplification set additionally 6 variables to zero. 72.80/34.79 [2019-03-28 12:50:36,717 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... 72.80/34.79 [2019-03-28 12:50:36,718 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. 72.80/34.79 [2019-03-28 12:50:36,718 INFO L518 LassoAnalysis]: Proved termination. 72.80/34.79 [2019-03-28 12:50:36,718 INFO L520 LassoAnalysis]: Termination argument consisting of: 72.80/34.79 Ranking function f(ULTIMATE.start_diff_~l1~0, ULTIMATE.start_diff_~i~0) = 1*ULTIMATE.start_diff_~l1~0 - 1*ULTIMATE.start_diff_~i~0 72.80/34.79 Supporting invariants [] 72.80/34.79 [2019-03-28 12:50:36,760 INFO L297 tatePredicateManager]: 15 out of 15 supporting invariants were superfluous and have been removed 72.80/34.79 [2019-03-28 12:50:36,774 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 72.80/34.79 [2019-03-28 12:50:36,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 72.80/34.79 [2019-03-28 12:50:36,793 INFO L256 TraceCheckSpWp]: Trace formula consists of 83 conjuncts, 2 conjunts are in the unsatisfiable core 72.80/34.79 [2019-03-28 12:50:36,794 INFO L279 TraceCheckSpWp]: Computing forward predicates... 72.80/34.79 [2019-03-28 12:50:36,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 72.80/34.79 [2019-03-28 12:50:36,803 INFO L256 TraceCheckSpWp]: Trace formula consists of 30 conjuncts, 4 conjunts are in the unsatisfiable core 72.80/34.79 [2019-03-28 12:50:36,804 INFO L279 TraceCheckSpWp]: Computing forward predicates... 72.80/34.79 [2019-03-28 12:50:36,815 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. 72.80/34.79 [2019-03-28 12:50:36,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 72.80/34.79 [2019-03-28 12:50:36,859 INFO L256 TraceCheckSpWp]: Trace formula consists of 30 conjuncts, 4 conjunts are in the unsatisfiable core 72.80/34.79 [2019-03-28 12:50:36,860 INFO L279 TraceCheckSpWp]: Computing forward predicates... 72.80/34.79 [2019-03-28 12:50:36,881 INFO L98 LoopCannibalizer]: 2 predicates before loop cannibalization 3 predicates after loop cannibalization 72.80/34.79 [2019-03-28 12:50:36,882 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 72.80/34.79 [2019-03-28 12:50:36,882 INFO L69 BuchiDifferenceNCSB]: Start buchiDifferenceNCSB. First operand 41 states and 72 transitions. cyclomatic complexity: 34 Second operand 3 states. 72.80/34.79 [2019-03-28 12:50:36,941 INFO L73 BuchiDifferenceNCSB]: Finished buchiDifferenceNCSB. First operand 41 states and 72 transitions. cyclomatic complexity: 34. Second operand 3 states. Result 73 states and 123 transitions. Complement of second has 4 states. 72.80/34.79 [2019-03-28 12:50:36,941 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 72.80/34.79 [2019-03-28 12:50:36,942 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. 72.80/34.79 [2019-03-28 12:50:36,942 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 42 transitions. 72.80/34.79 [2019-03-28 12:50:36,942 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 42 transitions. Stem has 4 letters. Loop has 8 letters. 72.80/34.79 [2019-03-28 12:50:36,942 INFO L116 BuchiAccepts]: Finished buchiAccepts. 72.80/34.79 [2019-03-28 12:50:36,943 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 42 transitions. Stem has 12 letters. Loop has 8 letters. 72.80/34.79 [2019-03-28 12:50:36,943 INFO L116 BuchiAccepts]: Finished buchiAccepts. 72.80/34.79 [2019-03-28 12:50:36,943 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 42 transitions. Stem has 4 letters. Loop has 16 letters. 72.80/34.79 [2019-03-28 12:50:36,943 INFO L116 BuchiAccepts]: Finished buchiAccepts. 72.80/34.79 [2019-03-28 12:50:36,947 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 73 states and 123 transitions. 72.80/34.79 [2019-03-28 12:50:36,948 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 29 72.80/34.79 [2019-03-28 12:50:36,949 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 73 states to 68 states and 114 transitions. 72.80/34.79 [2019-03-28 12:50:36,949 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 35 72.80/34.79 [2019-03-28 12:50:36,949 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 36 72.80/34.79 [2019-03-28 12:50:36,950 INFO L73 IsDeterministic]: Start isDeterministic. Operand 68 states and 114 transitions. 72.80/34.79 [2019-03-28 12:50:36,950 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. 72.80/34.79 [2019-03-28 12:50:36,950 INFO L706 BuchiCegarLoop]: Abstraction has 68 states and 114 transitions. 72.80/34.79 [2019-03-28 12:50:36,950 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states and 114 transitions. 72.80/34.79 [2019-03-28 12:50:36,951 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 41. 72.80/34.79 [2019-03-28 12:50:36,951 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. 72.80/34.79 [2019-03-28 12:50:36,952 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 72 transitions. 72.80/34.79 [2019-03-28 12:50:36,952 INFO L729 BuchiCegarLoop]: Abstraction has 41 states and 72 transitions. 72.80/34.79 [2019-03-28 12:50:36,952 INFO L609 BuchiCegarLoop]: Abstraction has 41 states and 72 transitions. 72.80/34.79 [2019-03-28 12:50:36,952 INFO L442 BuchiCegarLoop]: ======== Iteration 8============ 72.80/34.79 [2019-03-28 12:50:36,952 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 41 states and 72 transitions. 72.80/34.79 [2019-03-28 12:50:36,953 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 20 72.80/34.79 [2019-03-28 12:50:36,953 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false 72.80/34.79 [2019-03-28 12:50:36,953 INFO L119 BuchiIsEmpty]: Starting construction of run 72.80/34.79 [2019-03-28 12:50:36,953 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] 72.80/34.79 [2019-03-28 12:50:36,953 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1] 72.80/34.79 [2019-03-28 12:50:36,954 INFO L794 eck$LassoCheckResult]: Stem: 1129#ULTIMATE.startENTRY [150] ULTIMATE.startENTRY-->L34: Formula: (and (= |v_#NULL.offset_2| 0) (= (store |v_#valid_20| 0 0) |v_#valid_19|) (= 0 |v_#NULL.base_2|)) InVars {#valid=|v_#valid_20|} OutVars{ULTIMATE.start_main_#t~malloc8.base=|v_ULTIMATE.start_main_#t~malloc8.base_5|, ULTIMATE.start_main_#t~malloc9.base=|v_ULTIMATE.start_main_#t~malloc9.base_5|, ULTIMATE.start_main_~A~0.base=v_ULTIMATE.start_main_~A~0.base_3, ULTIMATE.start_main_~B~0.offset=v_ULTIMATE.start_main_~B~0.offset_3, #NULL.offset=|v_#NULL.offset_2|, ULTIMATE.start_main_#t~nondet6=|v_ULTIMATE.start_main_#t~nondet6_6|, ULTIMATE.start_main_#t~nondet7=|v_ULTIMATE.start_main_#t~nondet7_6|, ULTIMATE.start_main_~B~0.base=v_ULTIMATE.start_main_~B~0.base_3, #NULL.base=|v_#NULL.base_2|, ULTIMATE.start_main_~D~0.offset=v_ULTIMATE.start_main_~D~0.offset_3, ULTIMATE.start_main_#t~malloc10.base=|v_ULTIMATE.start_main_#t~malloc10.base_5|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_4|, ULTIMATE.start_main_#t~malloc8.offset=|v_ULTIMATE.start_main_#t~malloc8.offset_5|, #valid=|v_#valid_19|, ULTIMATE.start_main_#t~malloc9.offset=|v_ULTIMATE.start_main_#t~malloc9.offset_5|, ULTIMATE.start_main_~D~0.base=v_ULTIMATE.start_main_~D~0.base_3, ULTIMATE.start_main_~A~0.offset=v_ULTIMATE.start_main_~A~0.offset_3, ULTIMATE.start_main_~Blen~0=v_ULTIMATE.start_main_~Blen~0_8, ULTIMATE.start_main_~Alen~0=v_ULTIMATE.start_main_~Alen~0_8, ULTIMATE.start_main_#t~malloc10.offset=|v_ULTIMATE.start_main_#t~malloc10.offset_5|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~malloc8.base, ULTIMATE.start_main_#t~malloc9.base, ULTIMATE.start_main_~A~0.base, ULTIMATE.start_main_~B~0.offset, #NULL.offset, ULTIMATE.start_main_#t~nondet6, ULTIMATE.start_main_#t~nondet7, ULTIMATE.start_main_~B~0.base, #NULL.base, ULTIMATE.start_main_~D~0.offset, ULTIMATE.start_main_#t~malloc10.base, ULTIMATE.start_main_#res, ULTIMATE.start_main_#t~malloc8.offset, #valid, ULTIMATE.start_main_#t~malloc9.offset, ULTIMATE.start_main_~D~0.base, ULTIMATE.start_main_~A~0.offset, ULTIMATE.start_main_~Blen~0, ULTIMATE.start_main_~Alen~0, ULTIMATE.start_main_#t~malloc10.offset] 1130#L34 [75] L34-->L34-2: Formula: (and (< v_ULTIMATE.start_main_~Alen~0_5 1) (= v_ULTIMATE.start_main_~Alen~0_4 1)) InVars {ULTIMATE.start_main_~Alen~0=v_ULTIMATE.start_main_~Alen~0_5} OutVars{ULTIMATE.start_main_~Alen~0=v_ULTIMATE.start_main_~Alen~0_4} AuxVars[] AssignedVars[ULTIMATE.start_main_~Alen~0] 1131#L34-2 [105] L34-2-->L37-1: Formula: (>= v_ULTIMATE.start_main_~Blen~0_6 1) InVars {ULTIMATE.start_main_~Blen~0=v_ULTIMATE.start_main_~Blen~0_6} OutVars{ULTIMATE.start_main_~Blen~0=v_ULTIMATE.start_main_~Blen~0_6} AuxVars[] AssignedVars[] 1132#L37-1 [122] L37-1-->L13-2: Formula: (let ((.cse2 (store |v_#valid_10| |v_ULTIMATE.start_main_#t~malloc8.base_4| 1))) (let ((.cse0 (store .cse2 |v_ULTIMATE.start_main_#t~malloc9.base_4| 1))) (and (= v_ULTIMATE.start_diff_~k~0_1 0) (= v_ULTIMATE.start_diff_~l2~0_1 v_ULTIMATE.start_diff_~Blen_1) (< |v_ULTIMATE.start_main_#t~malloc10.base_4| 0) (= v_ULTIMATE.start_diff_~A.base_1 |v_ULTIMATE.start_diff_#in~A.base_1|) (= |v_#valid_7| (store .cse0 |v_ULTIMATE.start_main_#t~malloc10.base_4| 1)) (< |v_ULTIMATE.start_main_#t~malloc10.base_4| |v_#StackHeapBarrier_1|) (= v_ULTIMATE.start_diff_~Blen_1 |v_ULTIMATE.start_diff_#in~Blen_1|) (= v_ULTIMATE.start_diff_~B.base_1 |v_ULTIMATE.start_diff_#in~B.base_1|) (> |v_ULTIMATE.start_main_#t~malloc8.base_4| 0) (= v_ULTIMATE.start_diff_~Alen_1 |v_ULTIMATE.start_diff_#in~Alen_1|) (= v_ULTIMATE.start_main_~B~0.offset_2 |v_ULTIMATE.start_main_#t~malloc9.offset_4|) (= v_ULTIMATE.start_main_~B~0.base_2 |v_ULTIMATE.start_main_#t~malloc9.base_4|) (= |v_ULTIMATE.start_diff_#in~A.base_1| v_ULTIMATE.start_main_~A~0.base_2) (= |v_ULTIMATE.start_main_#t~malloc8.offset_4| 0) (= |v_#length_1| (let ((.cse1 (* 4 v_ULTIMATE.start_main_~Alen~0_7))) (store (store (store |v_#length_4| |v_ULTIMATE.start_main_#t~malloc8.base_4| .cse1) |v_ULTIMATE.start_main_#t~malloc9.base_4| (* 4 v_ULTIMATE.start_main_~Blen~0_7)) |v_ULTIMATE.start_main_#t~malloc10.base_4| .cse1))) (= v_ULTIMATE.start_diff_~D.base_1 |v_ULTIMATE.start_diff_#in~D.base_1|) (= |v_ULTIMATE.start_main_#t~malloc9.offset_4| 0) (= |v_ULTIMATE.start_diff_#in~B.offset_1| v_ULTIMATE.start_main_~B~0.offset_2) (= |v_ULTIMATE.start_diff_#in~A.offset_1| v_ULTIMATE.start_main_~A~0.offset_2) (= v_ULTIMATE.start_diff_~B.offset_1 |v_ULTIMATE.start_diff_#in~B.offset_1|) (= v_ULTIMATE.start_main_~A~0.base_2 |v_ULTIMATE.start_main_#t~malloc8.base_4|) (< |v_ULTIMATE.start_main_#t~malloc8.base_4| |v_#StackHeapBarrier_1|) (= |v_ULTIMATE.start_diff_#in~B.base_1| v_ULTIMATE.start_main_~B~0.base_2) (< |v_ULTIMATE.start_main_#t~malloc9.base_4| |v_#StackHeapBarrier_1|) (= |v_ULTIMATE.start_diff_#in~D.offset_1| v_ULTIMATE.start_main_~D~0.offset_2) (= v_ULTIMATE.start_main_~D~0.offset_2 |v_ULTIMATE.start_main_#t~malloc10.offset_4|) (= v_ULTIMATE.start_diff_~i~0_1 0) (= 0 (select .cse2 |v_ULTIMATE.start_main_#t~malloc9.base_4|)) (= v_ULTIMATE.start_main_~D~0.base_2 |v_ULTIMATE.start_main_#t~malloc10.base_4|) (= |v_ULTIMATE.start_diff_#in~Blen_1| v_ULTIMATE.start_main_~Blen~0_7) (= v_ULTIMATE.start_diff_~l1~0_1 v_ULTIMATE.start_diff_~Alen_1) (= 0 (select .cse0 |v_ULTIMATE.start_main_#t~malloc10.base_4|)) (= (select |v_#valid_10| |v_ULTIMATE.start_main_#t~malloc8.base_4|) 0) (= v_ULTIMATE.start_diff_~A.offset_1 |v_ULTIMATE.start_diff_#in~A.offset_1|) (= |v_ULTIMATE.start_diff_#in~Alen_1| v_ULTIMATE.start_main_~Alen~0_7) (> 0 |v_ULTIMATE.start_main_#t~malloc9.base_4|) (= v_ULTIMATE.start_main_~A~0.offset_2 |v_ULTIMATE.start_main_#t~malloc8.offset_4|) (= |v_ULTIMATE.start_main_#t~malloc10.offset_4| 0) (= |v_ULTIMATE.start_diff_#in~D.base_1| v_ULTIMATE.start_main_~D~0.base_2) (= v_ULTIMATE.start_diff_~D.offset_1 |v_ULTIMATE.start_diff_#in~D.offset_1|)))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_4|, #valid=|v_#valid_10|, ULTIMATE.start_main_~Blen~0=v_ULTIMATE.start_main_~Blen~0_7, ULTIMATE.start_main_~Alen~0=v_ULTIMATE.start_main_~Alen~0_7} OutVars{ULTIMATE.start_diff_#in~A.base=|v_ULTIMATE.start_diff_#in~A.base_1|, ULTIMATE.start_diff_#in~B.base=|v_ULTIMATE.start_diff_#in~B.base_1|, ULTIMATE.start_diff_~B.offset=v_ULTIMATE.start_diff_~B.offset_1, ULTIMATE.start_diff_~Alen=v_ULTIMATE.start_diff_~Alen_1, ULTIMATE.start_diff_~D.base=v_ULTIMATE.start_diff_~D.base_1, ULTIMATE.start_diff_#in~Blen=|v_ULTIMATE.start_diff_#in~Blen_1|, ULTIMATE.start_main_~B~0.offset=v_ULTIMATE.start_main_~B~0.offset_2, ULTIMATE.start_main_~B~0.base=v_ULTIMATE.start_main_~B~0.base_2, ULTIMATE.start_diff_#in~A.offset=|v_ULTIMATE.start_diff_#in~A.offset_1|, ULTIMATE.start_main_~D~0.offset=v_ULTIMATE.start_main_~D~0.offset_2, ULTIMATE.start_diff_#in~D.offset=|v_ULTIMATE.start_diff_#in~D.offset_1|, ULTIMATE.start_diff_#in~Alen=|v_ULTIMATE.start_diff_#in~Alen_1|, ULTIMATE.start_diff_~A.base=v_ULTIMATE.start_diff_~A.base_1, ULTIMATE.start_diff_~B.base=v_ULTIMATE.start_diff_~B.base_1, #length=|v_#length_1|, ULTIMATE.start_main_#t~malloc9.offset=|v_ULTIMATE.start_main_#t~malloc9.offset_4|, ULTIMATE.start_diff_#t~mem3=|v_ULTIMATE.start_diff_#t~mem3_1|, ULTIMATE.start_main_~A~0.offset=v_ULTIMATE.start_main_~A~0.offset_2, ULTIMATE.start_main_#t~malloc10.offset=|v_ULTIMATE.start_main_#t~malloc10.offset_4|, ULTIMATE.start_main_~Blen~0=v_ULTIMATE.start_main_~Blen~0_7, ULTIMATE.start_main_~Alen~0=v_ULTIMATE.start_main_~Alen~0_7, ULTIMATE.start_diff_~Blen=v_ULTIMATE.start_diff_~Blen_1, ULTIMATE.start_main_#t~malloc8.base=|v_ULTIMATE.start_main_#t~malloc8.base_4|, ULTIMATE.start_diff_#t~mem0=|v_ULTIMATE.start_diff_#t~mem0_1|, ULTIMATE.start_main_#t~malloc9.base=|v_ULTIMATE.start_main_#t~malloc9.base_4|, ULTIMATE.start_diff_#t~mem1=|v_ULTIMATE.start_diff_#t~mem1_1|, ULTIMATE.start_main_~A~0.base=v_ULTIMATE.start_main_~A~0.base_2, ULTIMATE.start_diff_#t~post4=|v_ULTIMATE.start_diff_#t~post4_1|, ULTIMATE.start_diff_~found~0=v_ULTIMATE.start_diff_~found~0_1, ULTIMATE.start_diff_#in~B.offset=|v_ULTIMATE.start_diff_#in~B.offset_1|, ULTIMATE.start_diff_~i~0=v_ULTIMATE.start_diff_~i~0_1, ULTIMATE.start_diff_~l1~0=v_ULTIMATE.start_diff_~l1~0_1, ULTIMATE.start_diff_#t~post5=|v_ULTIMATE.start_diff_#t~post5_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, ULTIMATE.start_main_#t~malloc10.base=|v_ULTIMATE.start_main_#t~malloc10.base_4|, ULTIMATE.start_diff_~D.offset=v_ULTIMATE.start_diff_~D.offset_1, ULTIMATE.start_diff_~l2~0=v_ULTIMATE.start_diff_~l2~0_1, ULTIMATE.start_diff_~j~0=v_ULTIMATE.start_diff_~j~0_1, ULTIMATE.start_main_#t~malloc8.offset=|v_ULTIMATE.start_main_#t~malloc8.offset_4|, #valid=|v_#valid_7|, ULTIMATE.start_diff_~k~0=v_ULTIMATE.start_diff_~k~0_1, ULTIMATE.start_diff_#in~D.base=|v_ULTIMATE.start_diff_#in~D.base_1|, ULTIMATE.start_diff_#t~post2=|v_ULTIMATE.start_diff_#t~post2_1|, ULTIMATE.start_diff_~A.offset=v_ULTIMATE.start_diff_~A.offset_1, ULTIMATE.start_main_~D~0.base=v_ULTIMATE.start_main_~D~0.base_2} AuxVars[] AssignedVars[ULTIMATE.start_diff_#in~A.base, ULTIMATE.start_diff_#in~B.base, ULTIMATE.start_diff_~B.offset, ULTIMATE.start_diff_~Alen, ULTIMATE.start_diff_~D.base, ULTIMATE.start_diff_#in~Blen, ULTIMATE.start_main_~B~0.offset, ULTIMATE.start_main_~B~0.base, ULTIMATE.start_diff_#in~A.offset, ULTIMATE.start_main_~D~0.offset, ULTIMATE.start_diff_#in~D.offset, ULTIMATE.start_diff_#in~Alen, ULTIMATE.start_diff_~A.base, ULTIMATE.start_diff_~B.base, #length, ULTIMATE.start_main_#t~malloc9.offset, ULTIMATE.start_diff_#t~mem3, ULTIMATE.start_main_~A~0.offset, ULTIMATE.start_main_#t~malloc10.offset, ULTIMATE.start_diff_~Blen, ULTIMATE.start_main_#t~malloc8.base, ULTIMATE.start_diff_#t~mem0, ULTIMATE.start_main_#t~malloc9.base, ULTIMATE.start_diff_#t~mem1, ULTIMATE.start_main_~A~0.base, ULTIMATE.start_diff_#t~post4, ULTIMATE.start_diff_~found~0, ULTIMATE.start_diff_#in~B.offset, ULTIMATE.start_diff_~i~0, ULTIMATE.start_diff_~l1~0, ULTIMATE.start_diff_#t~post5, ULTIMATE.start_main_#t~malloc10.base, ULTIMATE.start_diff_~D.offset, ULTIMATE.start_diff_~l2~0, ULTIMATE.start_diff_~j~0, ULTIMATE.start_main_#t~malloc8.offset, #valid, ULTIMATE.start_diff_~k~0, ULTIMATE.start_diff_#in~D.base, ULTIMATE.start_diff_#t~post2, ULTIMATE.start_diff_~A.offset, ULTIMATE.start_main_~D~0.base] 1137#L13-2 72.80/34.79 [2019-03-28 12:50:36,954 INFO L796 eck$LassoCheckResult]: Loop: 1137#L13-2 [91] L13-2-->L17-4: Formula: (and (< v_ULTIMATE.start_diff_~i~0_4 v_ULTIMATE.start_diff_~l1~0_4) (= v_ULTIMATE.start_diff_~j~0_2 0) (= v_ULTIMATE.start_diff_~found~0_3 0)) InVars {ULTIMATE.start_diff_~i~0=v_ULTIMATE.start_diff_~i~0_4, ULTIMATE.start_diff_~l1~0=v_ULTIMATE.start_diff_~l1~0_4} OutVars{ULTIMATE.start_diff_~found~0=v_ULTIMATE.start_diff_~found~0_3, ULTIMATE.start_diff_~i~0=v_ULTIMATE.start_diff_~i~0_4, ULTIMATE.start_diff_~l1~0=v_ULTIMATE.start_diff_~l1~0_4, ULTIMATE.start_diff_~j~0=v_ULTIMATE.start_diff_~j~0_2} AuxVars[] AssignedVars[ULTIMATE.start_diff_~found~0, ULTIMATE.start_diff_~j~0] 1155#L17-4 [99] L17-4-->L17: Formula: (and (= 0 v_ULTIMATE.start_diff_~found~0_5) (< v_ULTIMATE.start_diff_~j~0_4 v_ULTIMATE.start_diff_~l2~0_4)) InVars {ULTIMATE.start_diff_~found~0=v_ULTIMATE.start_diff_~found~0_5, ULTIMATE.start_diff_~j~0=v_ULTIMATE.start_diff_~j~0_4, ULTIMATE.start_diff_~l2~0=v_ULTIMATE.start_diff_~l2~0_4} OutVars{ULTIMATE.start_diff_~found~0=v_ULTIMATE.start_diff_~found~0_5, ULTIMATE.start_diff_~j~0=v_ULTIMATE.start_diff_~j~0_4, ULTIMATE.start_diff_~l2~0=v_ULTIMATE.start_diff_~l2~0_4} AuxVars[] AssignedVars[] 1149#L17 [85] L17-->L17-1: Formula: (let ((.cse0 (* 4 v_ULTIMATE.start_diff_~i~0_5))) (let ((.cse1 (+ .cse0 v_ULTIMATE.start_diff_~A.offset_3))) (and (<= (+ .cse0 v_ULTIMATE.start_diff_~A.offset_3 4) (select |v_#length_5| v_ULTIMATE.start_diff_~A.base_3)) (= 1 (select |v_#valid_11| v_ULTIMATE.start_diff_~A.base_3)) (= (select (select |v_#memory_int_1| v_ULTIMATE.start_diff_~A.base_3) .cse1) |v_ULTIMATE.start_diff_#t~mem0_2|) (<= 0 .cse1)))) InVars {ULTIMATE.start_diff_~i~0=v_ULTIMATE.start_diff_~i~0_5, ULTIMATE.start_diff_~A.base=v_ULTIMATE.start_diff_~A.base_3, #valid=|v_#valid_11|, #memory_int=|v_#memory_int_1|, #length=|v_#length_5|, ULTIMATE.start_diff_~A.offset=v_ULTIMATE.start_diff_~A.offset_3} OutVars{ULTIMATE.start_diff_#t~mem0=|v_ULTIMATE.start_diff_#t~mem0_2|, ULTIMATE.start_diff_~i~0=v_ULTIMATE.start_diff_~i~0_5, ULTIMATE.start_diff_~A.base=v_ULTIMATE.start_diff_~A.base_3, #valid=|v_#valid_11|, #memory_int=|v_#memory_int_1|, #length=|v_#length_5|, ULTIMATE.start_diff_~A.offset=v_ULTIMATE.start_diff_~A.offset_3} AuxVars[] AssignedVars[ULTIMATE.start_diff_#t~mem0] 1154#L17-1 [82] L17-1-->L17-2: Formula: (let ((.cse1 (* 4 v_ULTIMATE.start_diff_~j~0_5))) (let ((.cse0 (+ v_ULTIMATE.start_diff_~B.offset_3 .cse1))) (and (<= 0 .cse0) (= 1 (select |v_#valid_13| v_ULTIMATE.start_diff_~B.base_3)) (= (select (select |v_#memory_int_2| v_ULTIMATE.start_diff_~B.base_3) .cse0) |v_ULTIMATE.start_diff_#t~mem1_2|) (<= (+ v_ULTIMATE.start_diff_~B.offset_3 .cse1 4) (select |v_#length_7| v_ULTIMATE.start_diff_~B.base_3))))) InVars {ULTIMATE.start_diff_~B.offset=v_ULTIMATE.start_diff_~B.offset_3, ULTIMATE.start_diff_~j~0=v_ULTIMATE.start_diff_~j~0_5, #valid=|v_#valid_13|, ULTIMATE.start_diff_~B.base=v_ULTIMATE.start_diff_~B.base_3, #memory_int=|v_#memory_int_2|, #length=|v_#length_7|} OutVars{ULTIMATE.start_diff_#t~mem1=|v_ULTIMATE.start_diff_#t~mem1_2|, ULTIMATE.start_diff_~B.offset=v_ULTIMATE.start_diff_~B.offset_3, ULTIMATE.start_diff_~j~0=v_ULTIMATE.start_diff_~j~0_5, #valid=|v_#valid_13|, ULTIMATE.start_diff_~B.base=v_ULTIMATE.start_diff_~B.base_3, #memory_int=|v_#memory_int_2|, #length=|v_#length_7|} AuxVars[] AssignedVars[ULTIMATE.start_diff_#t~mem1] 1152#L17-2 [80] L17-2-->L17-4: Formula: (and (= |v_ULTIMATE.start_diff_#t~mem1_4| |v_ULTIMATE.start_diff_#t~mem0_4|) (= v_ULTIMATE.start_diff_~found~0_6 1)) InVars {ULTIMATE.start_diff_#t~mem0=|v_ULTIMATE.start_diff_#t~mem0_4|, ULTIMATE.start_diff_#t~mem1=|v_ULTIMATE.start_diff_#t~mem1_4|} OutVars{ULTIMATE.start_diff_#t~mem0=|v_ULTIMATE.start_diff_#t~mem0_3|, ULTIMATE.start_diff_#t~mem1=|v_ULTIMATE.start_diff_#t~mem1_3|, ULTIMATE.start_diff_~found~0=v_ULTIMATE.start_diff_~found~0_6} AuxVars[] AssignedVars[ULTIMATE.start_diff_#t~mem0, ULTIMATE.start_diff_#t~mem1, ULTIMATE.start_diff_~found~0] 1148#L17-4 [127] L17-4-->L16-2: Formula: (< 0 v_ULTIMATE.start_diff_~found~0_4) InVars {ULTIMATE.start_diff_~found~0=v_ULTIMATE.start_diff_~found~0_4} OutVars{ULTIMATE.start_diff_~found~0=v_ULTIMATE.start_diff_~found~0_4} AuxVars[] AssignedVars[] 1145#L16-2 [130] L16-2-->L23-1: Formula: (< 0 v_ULTIMATE.start_diff_~found~0_8) InVars {ULTIMATE.start_diff_~found~0=v_ULTIMATE.start_diff_~found~0_8} OutVars{ULTIMATE.start_diff_~found~0=v_ULTIMATE.start_diff_~found~0_8} AuxVars[] AssignedVars[] 1136#L23-1 [74] L23-1-->L13-2: Formula: (= v_ULTIMATE.start_diff_~i~0_9 (+ v_ULTIMATE.start_diff_~i~0_10 1)) InVars {ULTIMATE.start_diff_~i~0=v_ULTIMATE.start_diff_~i~0_10} OutVars{ULTIMATE.start_diff_#t~post5=|v_ULTIMATE.start_diff_#t~post5_2|, ULTIMATE.start_diff_~i~0=v_ULTIMATE.start_diff_~i~0_9} AuxVars[] AssignedVars[ULTIMATE.start_diff_#t~post5, ULTIMATE.start_diff_~i~0] 1137#L13-2 72.80/34.79 [2019-03-28 12:50:36,955 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 72.80/34.79 [2019-03-28 12:50:36,955 INFO L82 PathProgramCache]: Analyzing trace with hash 5467623, now seen corresponding path program 1 times 72.80/34.79 [2019-03-28 12:50:36,955 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 72.80/34.79 [2019-03-28 12:50:36,955 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 72.80/34.79 [2019-03-28 12:50:36,956 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 72.80/34.79 [2019-03-28 12:50:36,956 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 72.80/34.79 [2019-03-28 12:50:36,956 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 72.80/34.79 [2019-03-28 12:50:36,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 72.80/34.79 [2019-03-28 12:50:36,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 72.80/34.79 [2019-03-28 12:50:36,967 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 72.80/34.79 [2019-03-28 12:50:36,967 INFO L82 PathProgramCache]: Analyzing trace with hash -1945236739, now seen corresponding path program 5 times 72.80/34.79 [2019-03-28 12:50:36,967 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 72.80/34.79 [2019-03-28 12:50:36,967 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 72.80/34.79 [2019-03-28 12:50:36,968 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 72.80/34.79 [2019-03-28 12:50:36,968 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 72.80/34.79 [2019-03-28 12:50:36,968 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 72.80/34.79 [2019-03-28 12:50:36,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 72.80/34.79 [2019-03-28 12:50:36,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 72.80/34.79 [2019-03-28 12:50:36,973 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 72.80/34.79 [2019-03-28 12:50:36,974 INFO L82 PathProgramCache]: Analyzing trace with hash -501206301, now seen corresponding path program 1 times 72.80/34.79 [2019-03-28 12:50:36,974 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 72.80/34.79 [2019-03-28 12:50:36,974 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 72.80/34.79 [2019-03-28 12:50:36,974 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 72.80/34.79 [2019-03-28 12:50:36,975 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY 72.80/34.79 [2019-03-28 12:50:36,975 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 72.80/34.79 [2019-03-28 12:50:36,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 72.80/34.79 [2019-03-28 12:50:36,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 72.80/34.79 [2019-03-28 12:50:37,514 WARN L188 SmtUtils]: Spent 401.00 ms on a formula simplification. DAG size of input: 105 DAG size of output: 103 72.80/34.79 [2019-03-28 12:50:37,681 WARN L188 SmtUtils]: Spent 165.00 ms on a formula simplification that was a NOOP. DAG size: 99 72.80/34.79 [2019-03-28 12:50:37,684 INFO L216 LassoAnalysis]: Preferences: 72.80/34.79 [2019-03-28 12:50:37,684 INFO L124 ssoRankerPreferences]: Compute integeral hull: false 72.80/34.79 [2019-03-28 12:50:37,684 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true 72.80/34.79 [2019-03-28 12:50:37,684 INFO L126 ssoRankerPreferences]: Term annotations enabled: false 72.80/34.79 [2019-03-28 12:50:37,684 INFO L127 ssoRankerPreferences]: Use exernal solver: false 72.80/34.79 [2019-03-28 12:50:37,685 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 72.80/34.79 [2019-03-28 12:50:37,685 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false 72.80/34.79 [2019-03-28 12:50:37,685 INFO L130 ssoRankerPreferences]: Path of dumped script: 72.80/34.79 [2019-03-28 12:50:37,685 INFO L131 ssoRankerPreferences]: Filename of dumped script: theBenchmark.c_BEv2_Iteration8_Lasso 72.80/34.79 [2019-03-28 12:50:37,685 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank 72.80/34.79 [2019-03-28 12:50:37,685 INFO L282 LassoAnalysis]: Starting lasso preprocessing... 72.80/34.79 [2019-03-28 12:50:37,688 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 72.80/34.79 [2019-03-28 12:50:37,692 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 72.80/34.79 [2019-03-28 12:50:37,699 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 72.80/34.79 [2019-03-28 12:50:37,701 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 72.80/34.79 [2019-03-28 12:50:37,703 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 72.80/34.79 [2019-03-28 12:50:37,705 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 72.80/34.79 [2019-03-28 12:50:37,707 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 72.80/34.79 [2019-03-28 12:50:37,710 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 72.80/34.79 [2019-03-28 12:50:37,711 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 72.80/34.79 [2019-03-28 12:50:37,714 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 72.80/34.79 [2019-03-28 12:50:37,715 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 72.80/34.79 [2019-03-28 12:50:38,025 WARN L188 SmtUtils]: Spent 236.00 ms on a formula simplification. DAG size of input: 94 DAG size of output: 88 72.80/34.79 [2019-03-28 12:50:38,064 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 72.80/34.79 [2019-03-28 12:50:38,065 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 72.80/34.79 [2019-03-28 12:50:38,067 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 72.80/34.79 [2019-03-28 12:50:38,068 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 72.80/34.79 [2019-03-28 12:50:38,476 INFO L300 LassoAnalysis]: Preprocessing complete. 72.80/34.79 [2019-03-28 12:50:38,476 INFO L497 LassoAnalysis]: Using template 'affine'. 72.80/34.79 [2019-03-28 12:50:38,477 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 72.80/34.79 Termination analysis: LINEAR_WITH_GUESSES 72.80/34.79 Number of strict supporting invariants: 0 72.80/34.79 Number of non-strict supporting invariants: 1 72.80/34.79 Consider only non-deceasing supporting invariants: true 72.80/34.79 Simplify termination arguments: true 72.80/34.79 Simplify supporting invariants: trueOverapproximate stem: false 72.80/34.79 [2019-03-28 12:50:38,478 INFO L339 nArgumentSynthesizer]: Template has degree 0. 72.80/34.79 [2019-03-28 12:50:38,478 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 72.80/34.79 [2019-03-28 12:50:38,478 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 72.80/34.79 [2019-03-28 12:50:38,478 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 72.80/34.79 [2019-03-28 12:50:38,479 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. 72.80/34.79 [2019-03-28 12:50:38,479 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. 72.80/34.79 [2019-03-28 12:50:38,480 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 72.80/34.79 [2019-03-28 12:50:38,480 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 72.80/34.79 Termination analysis: LINEAR_WITH_GUESSES 72.80/34.79 Number of strict supporting invariants: 0 72.80/34.79 Number of non-strict supporting invariants: 1 72.80/34.79 Consider only non-deceasing supporting invariants: true 72.80/34.79 Simplify termination arguments: true 72.80/34.79 Simplify supporting invariants: trueOverapproximate stem: false 72.80/34.79 [2019-03-28 12:50:38,481 INFO L339 nArgumentSynthesizer]: Template has degree 0. 72.80/34.79 [2019-03-28 12:50:38,481 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 72.80/34.79 [2019-03-28 12:50:38,481 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 72.80/34.79 [2019-03-28 12:50:38,481 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 72.80/34.79 [2019-03-28 12:50:38,482 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. 72.80/34.79 [2019-03-28 12:50:38,482 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. 72.80/34.79 [2019-03-28 12:50:38,483 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 72.80/34.79 [2019-03-28 12:50:38,484 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 72.80/34.79 Termination analysis: LINEAR_WITH_GUESSES 72.80/34.79 Number of strict supporting invariants: 0 72.80/34.79 Number of non-strict supporting invariants: 1 72.80/34.79 Consider only non-deceasing supporting invariants: true 72.80/34.79 Simplify termination arguments: true 72.80/34.79 Simplify supporting invariants: trueOverapproximate stem: false 72.80/34.79 [2019-03-28 12:50:38,484 INFO L339 nArgumentSynthesizer]: Template has degree 0. 72.80/34.79 [2019-03-28 12:50:38,484 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 72.80/34.79 [2019-03-28 12:50:38,484 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 72.80/34.79 [2019-03-28 12:50:38,484 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 72.80/34.79 [2019-03-28 12:50:38,485 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. 72.80/34.79 [2019-03-28 12:50:38,485 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. 72.80/34.79 [2019-03-28 12:50:38,486 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 72.80/34.79 [2019-03-28 12:50:38,486 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 72.80/34.79 Termination analysis: LINEAR_WITH_GUESSES 72.80/34.79 Number of strict supporting invariants: 0 72.80/34.79 Number of non-strict supporting invariants: 1 72.80/34.79 Consider only non-deceasing supporting invariants: true 72.80/34.79 Simplify termination arguments: true 72.80/34.79 Simplify supporting invariants: trueOverapproximate stem: false 72.80/34.79 [2019-03-28 12:50:38,486 INFO L339 nArgumentSynthesizer]: Template has degree 0. 72.80/34.79 [2019-03-28 12:50:38,487 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 72.80/34.79 [2019-03-28 12:50:38,487 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 72.80/34.79 [2019-03-28 12:50:38,487 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 72.80/34.79 [2019-03-28 12:50:38,487 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 72.80/34.79 [2019-03-28 12:50:38,487 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 72.80/34.79 [2019-03-28 12:50:38,487 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 72.80/34.79 [2019-03-28 12:50:38,488 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 72.80/34.79 [2019-03-28 12:50:38,488 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 72.80/34.79 Termination analysis: LINEAR_WITH_GUESSES 72.80/34.79 Number of strict supporting invariants: 0 72.80/34.79 Number of non-strict supporting invariants: 1 72.80/34.79 Consider only non-deceasing supporting invariants: true 72.80/34.79 Simplify termination arguments: true 72.80/34.79 Simplify supporting invariants: trueOverapproximate stem: false 72.80/34.79 [2019-03-28 12:50:38,488 INFO L339 nArgumentSynthesizer]: Template has degree 0. 72.80/34.79 [2019-03-28 12:50:38,488 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 72.80/34.79 [2019-03-28 12:50:38,489 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 72.80/34.79 [2019-03-28 12:50:38,489 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 72.80/34.79 [2019-03-28 12:50:38,489 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 72.80/34.79 [2019-03-28 12:50:38,489 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 72.80/34.79 [2019-03-28 12:50:38,489 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 72.80/34.79 [2019-03-28 12:50:38,490 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 72.80/34.79 [2019-03-28 12:50:38,490 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 72.80/34.79 Termination analysis: LINEAR_WITH_GUESSES 72.80/34.79 Number of strict supporting invariants: 0 72.80/34.79 Number of non-strict supporting invariants: 1 72.80/34.79 Consider only non-deceasing supporting invariants: true 72.80/34.79 Simplify termination arguments: true 72.80/34.79 Simplify supporting invariants: trueOverapproximate stem: false 72.80/34.79 [2019-03-28 12:50:38,490 INFO L339 nArgumentSynthesizer]: Template has degree 0. 72.80/34.79 [2019-03-28 12:50:38,490 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 72.80/34.79 [2019-03-28 12:50:38,490 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 72.80/34.79 [2019-03-28 12:50:38,491 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 72.80/34.79 [2019-03-28 12:50:38,491 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 72.80/34.79 [2019-03-28 12:50:38,491 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 72.80/34.79 [2019-03-28 12:50:38,491 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 72.80/34.79 [2019-03-28 12:50:38,491 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 72.80/34.79 [2019-03-28 12:50:38,492 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 72.80/34.79 Termination analysis: LINEAR_WITH_GUESSES 72.80/34.79 Number of strict supporting invariants: 0 72.80/34.79 Number of non-strict supporting invariants: 1 72.80/34.79 Consider only non-deceasing supporting invariants: true 72.80/34.79 Simplify termination arguments: true 72.80/34.79 Simplify supporting invariants: trueOverapproximate stem: false 72.80/34.79 [2019-03-28 12:50:38,492 INFO L339 nArgumentSynthesizer]: Template has degree 0. 72.80/34.79 [2019-03-28 12:50:38,492 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 72.80/34.79 [2019-03-28 12:50:38,492 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 72.80/34.79 [2019-03-28 12:50:38,492 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 72.80/34.79 [2019-03-28 12:50:38,493 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. 72.80/34.79 [2019-03-28 12:50:38,493 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. 72.80/34.79 [2019-03-28 12:50:38,494 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 72.80/34.79 [2019-03-28 12:50:38,494 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 72.80/34.79 Termination analysis: LINEAR_WITH_GUESSES 72.80/34.79 Number of strict supporting invariants: 0 72.80/34.79 Number of non-strict supporting invariants: 1 72.80/34.79 Consider only non-deceasing supporting invariants: true 72.80/34.79 Simplify termination arguments: true 72.80/34.79 Simplify supporting invariants: trueOverapproximate stem: false 72.80/34.79 [2019-03-28 12:50:38,494 INFO L339 nArgumentSynthesizer]: Template has degree 0. 72.80/34.79 [2019-03-28 12:50:38,495 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 72.80/34.79 [2019-03-28 12:50:38,495 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 72.80/34.79 [2019-03-28 12:50:38,495 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 72.80/34.79 [2019-03-28 12:50:38,495 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 72.80/34.79 [2019-03-28 12:50:38,495 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 72.80/34.79 [2019-03-28 12:50:38,495 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 72.80/34.79 [2019-03-28 12:50:38,496 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 72.80/34.79 [2019-03-28 12:50:38,496 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 72.80/34.79 Termination analysis: LINEAR_WITH_GUESSES 72.80/34.79 Number of strict supporting invariants: 0 72.80/34.79 Number of non-strict supporting invariants: 1 72.80/34.79 Consider only non-deceasing supporting invariants: true 72.80/34.79 Simplify termination arguments: true 72.80/34.79 Simplify supporting invariants: trueOverapproximate stem: false 72.80/34.79 [2019-03-28 12:50:38,496 INFO L339 nArgumentSynthesizer]: Template has degree 0. 72.80/34.79 [2019-03-28 12:50:38,496 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 72.80/34.79 [2019-03-28 12:50:38,496 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 72.80/34.79 [2019-03-28 12:50:38,497 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 72.80/34.79 [2019-03-28 12:50:38,497 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 72.80/34.79 [2019-03-28 12:50:38,497 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 72.80/34.79 [2019-03-28 12:50:38,497 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 72.80/34.79 [2019-03-28 12:50:38,498 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 72.80/34.79 [2019-03-28 12:50:38,498 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 72.80/34.79 Termination analysis: LINEAR_WITH_GUESSES 72.80/34.79 Number of strict supporting invariants: 0 72.80/34.79 Number of non-strict supporting invariants: 1 72.80/34.79 Consider only non-deceasing supporting invariants: true 72.80/34.79 Simplify termination arguments: true 72.80/34.79 Simplify supporting invariants: trueOverapproximate stem: false 72.80/34.79 [2019-03-28 12:50:38,498 INFO L339 nArgumentSynthesizer]: Template has degree 0. 72.80/34.79 [2019-03-28 12:50:38,498 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 72.80/34.79 [2019-03-28 12:50:38,498 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 72.80/34.79 [2019-03-28 12:50:38,499 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 72.80/34.79 [2019-03-28 12:50:38,499 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 72.80/34.79 [2019-03-28 12:50:38,499 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 72.80/34.79 [2019-03-28 12:50:38,499 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 72.80/34.79 [2019-03-28 12:50:38,499 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 72.80/34.79 [2019-03-28 12:50:38,500 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 72.80/34.79 Termination analysis: LINEAR_WITH_GUESSES 72.80/34.79 Number of strict supporting invariants: 0 72.80/34.79 Number of non-strict supporting invariants: 1 72.80/34.79 Consider only non-deceasing supporting invariants: true 72.80/34.79 Simplify termination arguments: true 72.80/34.79 Simplify supporting invariants: trueOverapproximate stem: false 72.80/34.79 [2019-03-28 12:50:38,500 INFO L339 nArgumentSynthesizer]: Template has degree 0. 72.80/34.79 [2019-03-28 12:50:38,500 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 72.80/34.79 [2019-03-28 12:50:38,500 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 72.80/34.79 [2019-03-28 12:50:38,500 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 72.80/34.79 [2019-03-28 12:50:38,502 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. 72.80/34.79 [2019-03-28 12:50:38,502 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. 72.80/34.79 [2019-03-28 12:50:38,508 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 72.80/34.79 [2019-03-28 12:50:38,509 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 72.80/34.79 Termination analysis: LINEAR_WITH_GUESSES 72.80/34.79 Number of strict supporting invariants: 0 72.80/34.79 Number of non-strict supporting invariants: 1 72.80/34.79 Consider only non-deceasing supporting invariants: true 72.80/34.79 Simplify termination arguments: true 72.80/34.79 Simplify supporting invariants: trueOverapproximate stem: false 72.80/34.79 [2019-03-28 12:50:38,509 INFO L339 nArgumentSynthesizer]: Template has degree 0. 72.80/34.79 [2019-03-28 12:50:38,509 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 72.80/34.79 [2019-03-28 12:50:38,509 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 72.80/34.79 [2019-03-28 12:50:38,510 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 72.80/34.79 [2019-03-28 12:50:38,511 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. 72.80/34.79 [2019-03-28 12:50:38,511 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. 72.80/34.79 [2019-03-28 12:50:38,523 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. 72.80/34.79 [2019-03-28 12:50:38,533 INFO L443 ModelExtractionUtils]: Simplification made 5 calls to the SMT solver. 72.80/34.79 [2019-03-28 12:50:38,533 INFO L444 ModelExtractionUtils]: 35 out of 40 variables were initially zero. Simplification set additionally 2 variables to zero. 72.80/34.79 [2019-03-28 12:50:38,534 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... 72.80/34.79 [2019-03-28 12:50:38,534 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. 72.80/34.79 [2019-03-28 12:50:38,535 INFO L518 LassoAnalysis]: Proved termination. 72.80/34.79 [2019-03-28 12:50:38,535 INFO L520 LassoAnalysis]: Termination argument consisting of: 72.80/34.79 Ranking function f(ULTIMATE.start_diff_~i~0, ULTIMATE.start_diff_~l1~0) = -1*ULTIMATE.start_diff_~i~0 + 1*ULTIMATE.start_diff_~l1~0 72.80/34.79 Supporting invariants [] 72.80/34.79 [2019-03-28 12:50:38,578 INFO L297 tatePredicateManager]: 15 out of 15 supporting invariants were superfluous and have been removed 72.80/34.79 [2019-03-28 12:50:38,593 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 72.80/34.79 [2019-03-28 12:50:38,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 72.80/34.79 [2019-03-28 12:50:38,610 INFO L256 TraceCheckSpWp]: Trace formula consists of 83 conjuncts, 2 conjunts are in the unsatisfiable core 72.80/34.79 [2019-03-28 12:50:38,611 INFO L279 TraceCheckSpWp]: Computing forward predicates... 72.80/34.79 [2019-03-28 12:50:38,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 72.80/34.79 [2019-03-28 12:50:38,620 INFO L256 TraceCheckSpWp]: Trace formula consists of 30 conjuncts, 4 conjunts are in the unsatisfiable core 72.80/34.79 [2019-03-28 12:50:38,621 INFO L279 TraceCheckSpWp]: Computing forward predicates... 72.80/34.79 [2019-03-28 12:50:38,630 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. 72.80/34.79 [2019-03-28 12:50:38,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 72.80/34.79 [2019-03-28 12:50:38,667 INFO L256 TraceCheckSpWp]: Trace formula consists of 30 conjuncts, 4 conjunts are in the unsatisfiable core 72.80/34.79 [2019-03-28 12:50:38,667 INFO L279 TraceCheckSpWp]: Computing forward predicates... 72.80/34.79 [2019-03-28 12:50:38,686 INFO L98 LoopCannibalizer]: 2 predicates before loop cannibalization 3 predicates after loop cannibalization 72.80/34.79 [2019-03-28 12:50:38,687 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 72.80/34.79 [2019-03-28 12:50:38,687 INFO L69 BuchiDifferenceNCSB]: Start buchiDifferenceNCSB. First operand 41 states and 72 transitions. cyclomatic complexity: 34 Second operand 3 states. 72.80/34.79 [2019-03-28 12:50:38,740 INFO L73 BuchiDifferenceNCSB]: Finished buchiDifferenceNCSB. First operand 41 states and 72 transitions. cyclomatic complexity: 34. Second operand 3 states. Result 73 states and 123 transitions. Complement of second has 4 states. 72.80/34.79 [2019-03-28 12:50:38,741 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 72.80/34.79 [2019-03-28 12:50:38,741 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. 72.80/34.79 [2019-03-28 12:50:38,742 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 42 transitions. 72.80/34.79 [2019-03-28 12:50:38,742 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 42 transitions. Stem has 4 letters. Loop has 8 letters. 72.80/34.79 [2019-03-28 12:50:38,742 INFO L116 BuchiAccepts]: Finished buchiAccepts. 72.80/34.79 [2019-03-28 12:50:38,742 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 42 transitions. Stem has 12 letters. Loop has 8 letters. 72.80/34.79 [2019-03-28 12:50:38,742 INFO L116 BuchiAccepts]: Finished buchiAccepts. 72.80/34.79 [2019-03-28 12:50:38,742 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 42 transitions. Stem has 4 letters. Loop has 16 letters. 72.80/34.79 [2019-03-28 12:50:38,743 INFO L116 BuchiAccepts]: Finished buchiAccepts. 72.80/34.79 [2019-03-28 12:50:38,747 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 73 states and 123 transitions. 72.80/34.79 [2019-03-28 12:50:38,749 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 29 72.80/34.79 [2019-03-28 12:50:38,750 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 73 states to 68 states and 114 transitions. 72.80/34.79 [2019-03-28 12:50:38,750 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 35 72.80/34.79 [2019-03-28 12:50:38,750 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 36 72.80/34.79 [2019-03-28 12:50:38,750 INFO L73 IsDeterministic]: Start isDeterministic. Operand 68 states and 114 transitions. 72.80/34.79 [2019-03-28 12:50:38,751 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. 72.80/34.79 [2019-03-28 12:50:38,751 INFO L706 BuchiCegarLoop]: Abstraction has 68 states and 114 transitions. 72.80/34.79 [2019-03-28 12:50:38,751 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states and 114 transitions. 72.80/34.79 [2019-03-28 12:50:38,752 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 41. 72.80/34.79 [2019-03-28 12:50:38,752 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. 72.80/34.79 [2019-03-28 12:50:38,753 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 72 transitions. 72.80/34.79 [2019-03-28 12:50:38,753 INFO L729 BuchiCegarLoop]: Abstraction has 41 states and 72 transitions. 72.80/34.79 [2019-03-28 12:50:38,753 INFO L609 BuchiCegarLoop]: Abstraction has 41 states and 72 transitions. 72.80/34.79 [2019-03-28 12:50:38,753 INFO L442 BuchiCegarLoop]: ======== Iteration 9============ 72.80/34.79 [2019-03-28 12:50:38,753 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 41 states and 72 transitions. 72.80/34.79 [2019-03-28 12:50:38,753 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 20 72.80/34.79 [2019-03-28 12:50:38,754 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false 72.80/34.79 [2019-03-28 12:50:38,754 INFO L119 BuchiIsEmpty]: Starting construction of run 72.80/34.79 [2019-03-28 12:50:38,754 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] 72.80/34.79 [2019-03-28 12:50:38,754 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1] 72.80/34.79 [2019-03-28 12:50:38,755 INFO L794 eck$LassoCheckResult]: Stem: 1383#ULTIMATE.startENTRY [150] ULTIMATE.startENTRY-->L34: Formula: (and (= |v_#NULL.offset_2| 0) (= (store |v_#valid_20| 0 0) |v_#valid_19|) (= 0 |v_#NULL.base_2|)) InVars {#valid=|v_#valid_20|} OutVars{ULTIMATE.start_main_#t~malloc8.base=|v_ULTIMATE.start_main_#t~malloc8.base_5|, ULTIMATE.start_main_#t~malloc9.base=|v_ULTIMATE.start_main_#t~malloc9.base_5|, ULTIMATE.start_main_~A~0.base=v_ULTIMATE.start_main_~A~0.base_3, ULTIMATE.start_main_~B~0.offset=v_ULTIMATE.start_main_~B~0.offset_3, #NULL.offset=|v_#NULL.offset_2|, ULTIMATE.start_main_#t~nondet6=|v_ULTIMATE.start_main_#t~nondet6_6|, ULTIMATE.start_main_#t~nondet7=|v_ULTIMATE.start_main_#t~nondet7_6|, ULTIMATE.start_main_~B~0.base=v_ULTIMATE.start_main_~B~0.base_3, #NULL.base=|v_#NULL.base_2|, ULTIMATE.start_main_~D~0.offset=v_ULTIMATE.start_main_~D~0.offset_3, ULTIMATE.start_main_#t~malloc10.base=|v_ULTIMATE.start_main_#t~malloc10.base_5|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_4|, ULTIMATE.start_main_#t~malloc8.offset=|v_ULTIMATE.start_main_#t~malloc8.offset_5|, #valid=|v_#valid_19|, ULTIMATE.start_main_#t~malloc9.offset=|v_ULTIMATE.start_main_#t~malloc9.offset_5|, ULTIMATE.start_main_~D~0.base=v_ULTIMATE.start_main_~D~0.base_3, ULTIMATE.start_main_~A~0.offset=v_ULTIMATE.start_main_~A~0.offset_3, ULTIMATE.start_main_~Blen~0=v_ULTIMATE.start_main_~Blen~0_8, ULTIMATE.start_main_~Alen~0=v_ULTIMATE.start_main_~Alen~0_8, ULTIMATE.start_main_#t~malloc10.offset=|v_ULTIMATE.start_main_#t~malloc10.offset_5|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~malloc8.base, ULTIMATE.start_main_#t~malloc9.base, ULTIMATE.start_main_~A~0.base, ULTIMATE.start_main_~B~0.offset, #NULL.offset, ULTIMATE.start_main_#t~nondet6, ULTIMATE.start_main_#t~nondet7, ULTIMATE.start_main_~B~0.base, #NULL.base, ULTIMATE.start_main_~D~0.offset, ULTIMATE.start_main_#t~malloc10.base, ULTIMATE.start_main_#res, ULTIMATE.start_main_#t~malloc8.offset, #valid, ULTIMATE.start_main_#t~malloc9.offset, ULTIMATE.start_main_~D~0.base, ULTIMATE.start_main_~A~0.offset, ULTIMATE.start_main_~Blen~0, ULTIMATE.start_main_~Alen~0, ULTIMATE.start_main_#t~malloc10.offset] 1384#L34 [75] L34-->L34-2: Formula: (and (< v_ULTIMATE.start_main_~Alen~0_5 1) (= v_ULTIMATE.start_main_~Alen~0_4 1)) InVars {ULTIMATE.start_main_~Alen~0=v_ULTIMATE.start_main_~Alen~0_5} OutVars{ULTIMATE.start_main_~Alen~0=v_ULTIMATE.start_main_~Alen~0_4} AuxVars[] AssignedVars[ULTIMATE.start_main_~Alen~0] 1385#L34-2 [105] L34-2-->L37-1: Formula: (>= v_ULTIMATE.start_main_~Blen~0_6 1) InVars {ULTIMATE.start_main_~Blen~0=v_ULTIMATE.start_main_~Blen~0_6} OutVars{ULTIMATE.start_main_~Blen~0=v_ULTIMATE.start_main_~Blen~0_6} AuxVars[] AssignedVars[] 1386#L37-1 [121] L37-1-->L13-2: Formula: (let ((.cse2 (store |v_#valid_10| |v_ULTIMATE.start_main_#t~malloc8.base_4| 1))) (let ((.cse0 (store .cse2 |v_ULTIMATE.start_main_#t~malloc9.base_4| 1))) (and (= v_ULTIMATE.start_diff_~k~0_1 0) (= v_ULTIMATE.start_diff_~l2~0_1 v_ULTIMATE.start_diff_~Blen_1) (< |v_ULTIMATE.start_main_#t~malloc10.base_4| 0) (= v_ULTIMATE.start_diff_~A.base_1 |v_ULTIMATE.start_diff_#in~A.base_1|) (= |v_#valid_7| (store .cse0 |v_ULTIMATE.start_main_#t~malloc10.base_4| 1)) (< |v_ULTIMATE.start_main_#t~malloc10.base_4| |v_#StackHeapBarrier_1|) (= v_ULTIMATE.start_diff_~Blen_1 |v_ULTIMATE.start_diff_#in~Blen_1|) (= v_ULTIMATE.start_diff_~B.base_1 |v_ULTIMATE.start_diff_#in~B.base_1|) (= v_ULTIMATE.start_diff_~Alen_1 |v_ULTIMATE.start_diff_#in~Alen_1|) (= v_ULTIMATE.start_main_~B~0.offset_2 |v_ULTIMATE.start_main_#t~malloc9.offset_4|) (= v_ULTIMATE.start_main_~B~0.base_2 |v_ULTIMATE.start_main_#t~malloc9.base_4|) (= |v_ULTIMATE.start_diff_#in~A.base_1| v_ULTIMATE.start_main_~A~0.base_2) (= |v_ULTIMATE.start_main_#t~malloc8.offset_4| 0) (= |v_#length_1| (let ((.cse1 (* 4 v_ULTIMATE.start_main_~Alen~0_7))) (store (store (store |v_#length_4| |v_ULTIMATE.start_main_#t~malloc8.base_4| .cse1) |v_ULTIMATE.start_main_#t~malloc9.base_4| (* 4 v_ULTIMATE.start_main_~Blen~0_7)) |v_ULTIMATE.start_main_#t~malloc10.base_4| .cse1))) (= v_ULTIMATE.start_diff_~D.base_1 |v_ULTIMATE.start_diff_#in~D.base_1|) (= |v_ULTIMATE.start_main_#t~malloc9.offset_4| 0) (= |v_ULTIMATE.start_diff_#in~B.offset_1| v_ULTIMATE.start_main_~B~0.offset_2) (= |v_ULTIMATE.start_diff_#in~A.offset_1| v_ULTIMATE.start_main_~A~0.offset_2) (= v_ULTIMATE.start_diff_~B.offset_1 |v_ULTIMATE.start_diff_#in~B.offset_1|) (= v_ULTIMATE.start_main_~A~0.base_2 |v_ULTIMATE.start_main_#t~malloc8.base_4|) (< |v_ULTIMATE.start_main_#t~malloc8.base_4| |v_#StackHeapBarrier_1|) (= |v_ULTIMATE.start_diff_#in~B.base_1| v_ULTIMATE.start_main_~B~0.base_2) (< 0 |v_ULTIMATE.start_main_#t~malloc9.base_4|) (< |v_ULTIMATE.start_main_#t~malloc9.base_4| |v_#StackHeapBarrier_1|) (= |v_ULTIMATE.start_diff_#in~D.offset_1| v_ULTIMATE.start_main_~D~0.offset_2) (= v_ULTIMATE.start_main_~D~0.offset_2 |v_ULTIMATE.start_main_#t~malloc10.offset_4|) (= v_ULTIMATE.start_diff_~i~0_1 0) (= 0 (select .cse2 |v_ULTIMATE.start_main_#t~malloc9.base_4|)) (= v_ULTIMATE.start_main_~D~0.base_2 |v_ULTIMATE.start_main_#t~malloc10.base_4|) (= |v_ULTIMATE.start_diff_#in~Blen_1| v_ULTIMATE.start_main_~Blen~0_7) (= v_ULTIMATE.start_diff_~l1~0_1 v_ULTIMATE.start_diff_~Alen_1) (= 0 (select .cse0 |v_ULTIMATE.start_main_#t~malloc10.base_4|)) (= (select |v_#valid_10| |v_ULTIMATE.start_main_#t~malloc8.base_4|) 0) (= v_ULTIMATE.start_diff_~A.offset_1 |v_ULTIMATE.start_diff_#in~A.offset_1|) (< |v_ULTIMATE.start_main_#t~malloc8.base_4| 0) (= |v_ULTIMATE.start_diff_#in~Alen_1| v_ULTIMATE.start_main_~Alen~0_7) (= v_ULTIMATE.start_main_~A~0.offset_2 |v_ULTIMATE.start_main_#t~malloc8.offset_4|) (= |v_ULTIMATE.start_main_#t~malloc10.offset_4| 0) (= |v_ULTIMATE.start_diff_#in~D.base_1| v_ULTIMATE.start_main_~D~0.base_2) (= v_ULTIMATE.start_diff_~D.offset_1 |v_ULTIMATE.start_diff_#in~D.offset_1|)))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_4|, #valid=|v_#valid_10|, ULTIMATE.start_main_~Blen~0=v_ULTIMATE.start_main_~Blen~0_7, ULTIMATE.start_main_~Alen~0=v_ULTIMATE.start_main_~Alen~0_7} OutVars{ULTIMATE.start_diff_#in~A.base=|v_ULTIMATE.start_diff_#in~A.base_1|, ULTIMATE.start_diff_#in~B.base=|v_ULTIMATE.start_diff_#in~B.base_1|, ULTIMATE.start_diff_~B.offset=v_ULTIMATE.start_diff_~B.offset_1, ULTIMATE.start_diff_~Alen=v_ULTIMATE.start_diff_~Alen_1, ULTIMATE.start_diff_~D.base=v_ULTIMATE.start_diff_~D.base_1, ULTIMATE.start_diff_#in~Blen=|v_ULTIMATE.start_diff_#in~Blen_1|, ULTIMATE.start_main_~B~0.offset=v_ULTIMATE.start_main_~B~0.offset_2, ULTIMATE.start_main_~B~0.base=v_ULTIMATE.start_main_~B~0.base_2, ULTIMATE.start_diff_#in~A.offset=|v_ULTIMATE.start_diff_#in~A.offset_1|, ULTIMATE.start_main_~D~0.offset=v_ULTIMATE.start_main_~D~0.offset_2, ULTIMATE.start_diff_#in~D.offset=|v_ULTIMATE.start_diff_#in~D.offset_1|, ULTIMATE.start_diff_#in~Alen=|v_ULTIMATE.start_diff_#in~Alen_1|, ULTIMATE.start_diff_~A.base=v_ULTIMATE.start_diff_~A.base_1, ULTIMATE.start_diff_~B.base=v_ULTIMATE.start_diff_~B.base_1, #length=|v_#length_1|, ULTIMATE.start_main_#t~malloc9.offset=|v_ULTIMATE.start_main_#t~malloc9.offset_4|, ULTIMATE.start_diff_#t~mem3=|v_ULTIMATE.start_diff_#t~mem3_1|, ULTIMATE.start_main_~A~0.offset=v_ULTIMATE.start_main_~A~0.offset_2, ULTIMATE.start_main_#t~malloc10.offset=|v_ULTIMATE.start_main_#t~malloc10.offset_4|, ULTIMATE.start_main_~Blen~0=v_ULTIMATE.start_main_~Blen~0_7, ULTIMATE.start_main_~Alen~0=v_ULTIMATE.start_main_~Alen~0_7, ULTIMATE.start_diff_~Blen=v_ULTIMATE.start_diff_~Blen_1, ULTIMATE.start_main_#t~malloc8.base=|v_ULTIMATE.start_main_#t~malloc8.base_4|, ULTIMATE.start_diff_#t~mem0=|v_ULTIMATE.start_diff_#t~mem0_1|, ULTIMATE.start_main_#t~malloc9.base=|v_ULTIMATE.start_main_#t~malloc9.base_4|, ULTIMATE.start_diff_#t~mem1=|v_ULTIMATE.start_diff_#t~mem1_1|, ULTIMATE.start_main_~A~0.base=v_ULTIMATE.start_main_~A~0.base_2, ULTIMATE.start_diff_#t~post4=|v_ULTIMATE.start_diff_#t~post4_1|, ULTIMATE.start_diff_~found~0=v_ULTIMATE.start_diff_~found~0_1, ULTIMATE.start_diff_#in~B.offset=|v_ULTIMATE.start_diff_#in~B.offset_1|, ULTIMATE.start_diff_~i~0=v_ULTIMATE.start_diff_~i~0_1, ULTIMATE.start_diff_~l1~0=v_ULTIMATE.start_diff_~l1~0_1, ULTIMATE.start_diff_#t~post5=|v_ULTIMATE.start_diff_#t~post5_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, ULTIMATE.start_main_#t~malloc10.base=|v_ULTIMATE.start_main_#t~malloc10.base_4|, ULTIMATE.start_diff_~D.offset=v_ULTIMATE.start_diff_~D.offset_1, ULTIMATE.start_diff_~l2~0=v_ULTIMATE.start_diff_~l2~0_1, ULTIMATE.start_diff_~j~0=v_ULTIMATE.start_diff_~j~0_1, ULTIMATE.start_main_#t~malloc8.offset=|v_ULTIMATE.start_main_#t~malloc8.offset_4|, #valid=|v_#valid_7|, ULTIMATE.start_diff_~k~0=v_ULTIMATE.start_diff_~k~0_1, ULTIMATE.start_diff_#in~D.base=|v_ULTIMATE.start_diff_#in~D.base_1|, ULTIMATE.start_diff_#t~post2=|v_ULTIMATE.start_diff_#t~post2_1|, ULTIMATE.start_diff_~A.offset=v_ULTIMATE.start_diff_~A.offset_1, ULTIMATE.start_main_~D~0.base=v_ULTIMATE.start_main_~D~0.base_2} AuxVars[] AssignedVars[ULTIMATE.start_diff_#in~A.base, ULTIMATE.start_diff_#in~B.base, ULTIMATE.start_diff_~B.offset, ULTIMATE.start_diff_~Alen, ULTIMATE.start_diff_~D.base, ULTIMATE.start_diff_#in~Blen, ULTIMATE.start_main_~B~0.offset, ULTIMATE.start_main_~B~0.base, ULTIMATE.start_diff_#in~A.offset, ULTIMATE.start_main_~D~0.offset, ULTIMATE.start_diff_#in~D.offset, ULTIMATE.start_diff_#in~Alen, ULTIMATE.start_diff_~A.base, ULTIMATE.start_diff_~B.base, #length, ULTIMATE.start_main_#t~malloc9.offset, ULTIMATE.start_diff_#t~mem3, ULTIMATE.start_main_~A~0.offset, ULTIMATE.start_main_#t~malloc10.offset, ULTIMATE.start_diff_~Blen, ULTIMATE.start_main_#t~malloc8.base, ULTIMATE.start_diff_#t~mem0, ULTIMATE.start_main_#t~malloc9.base, ULTIMATE.start_diff_#t~mem1, ULTIMATE.start_main_~A~0.base, ULTIMATE.start_diff_#t~post4, ULTIMATE.start_diff_~found~0, ULTIMATE.start_diff_#in~B.offset, ULTIMATE.start_diff_~i~0, ULTIMATE.start_diff_~l1~0, ULTIMATE.start_diff_#t~post5, ULTIMATE.start_main_#t~malloc10.base, ULTIMATE.start_diff_~D.offset, ULTIMATE.start_diff_~l2~0, ULTIMATE.start_diff_~j~0, ULTIMATE.start_main_#t~malloc8.offset, #valid, ULTIMATE.start_diff_~k~0, ULTIMATE.start_diff_#in~D.base, ULTIMATE.start_diff_#t~post2, ULTIMATE.start_diff_~A.offset, ULTIMATE.start_main_~D~0.base] 1391#L13-2 72.80/34.79 [2019-03-28 12:50:38,755 INFO L796 eck$LassoCheckResult]: Loop: 1391#L13-2 [91] L13-2-->L17-4: Formula: (and (< v_ULTIMATE.start_diff_~i~0_4 v_ULTIMATE.start_diff_~l1~0_4) (= v_ULTIMATE.start_diff_~j~0_2 0) (= v_ULTIMATE.start_diff_~found~0_3 0)) InVars {ULTIMATE.start_diff_~i~0=v_ULTIMATE.start_diff_~i~0_4, ULTIMATE.start_diff_~l1~0=v_ULTIMATE.start_diff_~l1~0_4} OutVars{ULTIMATE.start_diff_~found~0=v_ULTIMATE.start_diff_~found~0_3, ULTIMATE.start_diff_~i~0=v_ULTIMATE.start_diff_~i~0_4, ULTIMATE.start_diff_~l1~0=v_ULTIMATE.start_diff_~l1~0_4, ULTIMATE.start_diff_~j~0=v_ULTIMATE.start_diff_~j~0_2} AuxVars[] AssignedVars[ULTIMATE.start_diff_~found~0, ULTIMATE.start_diff_~j~0] 1409#L17-4 [99] L17-4-->L17: Formula: (and (= 0 v_ULTIMATE.start_diff_~found~0_5) (< v_ULTIMATE.start_diff_~j~0_4 v_ULTIMATE.start_diff_~l2~0_4)) InVars {ULTIMATE.start_diff_~found~0=v_ULTIMATE.start_diff_~found~0_5, ULTIMATE.start_diff_~j~0=v_ULTIMATE.start_diff_~j~0_4, ULTIMATE.start_diff_~l2~0=v_ULTIMATE.start_diff_~l2~0_4} OutVars{ULTIMATE.start_diff_~found~0=v_ULTIMATE.start_diff_~found~0_5, ULTIMATE.start_diff_~j~0=v_ULTIMATE.start_diff_~j~0_4, ULTIMATE.start_diff_~l2~0=v_ULTIMATE.start_diff_~l2~0_4} AuxVars[] AssignedVars[] 1403#L17 [85] L17-->L17-1: Formula: (let ((.cse0 (* 4 v_ULTIMATE.start_diff_~i~0_5))) (let ((.cse1 (+ .cse0 v_ULTIMATE.start_diff_~A.offset_3))) (and (<= (+ .cse0 v_ULTIMATE.start_diff_~A.offset_3 4) (select |v_#length_5| v_ULTIMATE.start_diff_~A.base_3)) (= 1 (select |v_#valid_11| v_ULTIMATE.start_diff_~A.base_3)) (= (select (select |v_#memory_int_1| v_ULTIMATE.start_diff_~A.base_3) .cse1) |v_ULTIMATE.start_diff_#t~mem0_2|) (<= 0 .cse1)))) InVars {ULTIMATE.start_diff_~i~0=v_ULTIMATE.start_diff_~i~0_5, ULTIMATE.start_diff_~A.base=v_ULTIMATE.start_diff_~A.base_3, #valid=|v_#valid_11|, #memory_int=|v_#memory_int_1|, #length=|v_#length_5|, ULTIMATE.start_diff_~A.offset=v_ULTIMATE.start_diff_~A.offset_3} OutVars{ULTIMATE.start_diff_#t~mem0=|v_ULTIMATE.start_diff_#t~mem0_2|, ULTIMATE.start_diff_~i~0=v_ULTIMATE.start_diff_~i~0_5, ULTIMATE.start_diff_~A.base=v_ULTIMATE.start_diff_~A.base_3, #valid=|v_#valid_11|, #memory_int=|v_#memory_int_1|, #length=|v_#length_5|, ULTIMATE.start_diff_~A.offset=v_ULTIMATE.start_diff_~A.offset_3} AuxVars[] AssignedVars[ULTIMATE.start_diff_#t~mem0] 1408#L17-1 [82] L17-1-->L17-2: Formula: (let ((.cse1 (* 4 v_ULTIMATE.start_diff_~j~0_5))) (let ((.cse0 (+ v_ULTIMATE.start_diff_~B.offset_3 .cse1))) (and (<= 0 .cse0) (= 1 (select |v_#valid_13| v_ULTIMATE.start_diff_~B.base_3)) (= (select (select |v_#memory_int_2| v_ULTIMATE.start_diff_~B.base_3) .cse0) |v_ULTIMATE.start_diff_#t~mem1_2|) (<= (+ v_ULTIMATE.start_diff_~B.offset_3 .cse1 4) (select |v_#length_7| v_ULTIMATE.start_diff_~B.base_3))))) InVars {ULTIMATE.start_diff_~B.offset=v_ULTIMATE.start_diff_~B.offset_3, ULTIMATE.start_diff_~j~0=v_ULTIMATE.start_diff_~j~0_5, #valid=|v_#valid_13|, ULTIMATE.start_diff_~B.base=v_ULTIMATE.start_diff_~B.base_3, #memory_int=|v_#memory_int_2|, #length=|v_#length_7|} OutVars{ULTIMATE.start_diff_#t~mem1=|v_ULTIMATE.start_diff_#t~mem1_2|, ULTIMATE.start_diff_~B.offset=v_ULTIMATE.start_diff_~B.offset_3, ULTIMATE.start_diff_~j~0=v_ULTIMATE.start_diff_~j~0_5, #valid=|v_#valid_13|, ULTIMATE.start_diff_~B.base=v_ULTIMATE.start_diff_~B.base_3, #memory_int=|v_#memory_int_2|, #length=|v_#length_7|} AuxVars[] AssignedVars[ULTIMATE.start_diff_#t~mem1] 1406#L17-2 [80] L17-2-->L17-4: Formula: (and (= |v_ULTIMATE.start_diff_#t~mem1_4| |v_ULTIMATE.start_diff_#t~mem0_4|) (= v_ULTIMATE.start_diff_~found~0_6 1)) InVars {ULTIMATE.start_diff_#t~mem0=|v_ULTIMATE.start_diff_#t~mem0_4|, ULTIMATE.start_diff_#t~mem1=|v_ULTIMATE.start_diff_#t~mem1_4|} OutVars{ULTIMATE.start_diff_#t~mem0=|v_ULTIMATE.start_diff_#t~mem0_3|, ULTIMATE.start_diff_#t~mem1=|v_ULTIMATE.start_diff_#t~mem1_3|, ULTIMATE.start_diff_~found~0=v_ULTIMATE.start_diff_~found~0_6} AuxVars[] AssignedVars[ULTIMATE.start_diff_#t~mem0, ULTIMATE.start_diff_#t~mem1, ULTIMATE.start_diff_~found~0] 1402#L17-4 [127] L17-4-->L16-2: Formula: (< 0 v_ULTIMATE.start_diff_~found~0_4) InVars {ULTIMATE.start_diff_~found~0=v_ULTIMATE.start_diff_~found~0_4} OutVars{ULTIMATE.start_diff_~found~0=v_ULTIMATE.start_diff_~found~0_4} AuxVars[] AssignedVars[] 1399#L16-2 [130] L16-2-->L23-1: Formula: (< 0 v_ULTIMATE.start_diff_~found~0_8) InVars {ULTIMATE.start_diff_~found~0=v_ULTIMATE.start_diff_~found~0_8} OutVars{ULTIMATE.start_diff_~found~0=v_ULTIMATE.start_diff_~found~0_8} AuxVars[] AssignedVars[] 1390#L23-1 [74] L23-1-->L13-2: Formula: (= v_ULTIMATE.start_diff_~i~0_9 (+ v_ULTIMATE.start_diff_~i~0_10 1)) InVars {ULTIMATE.start_diff_~i~0=v_ULTIMATE.start_diff_~i~0_10} OutVars{ULTIMATE.start_diff_#t~post5=|v_ULTIMATE.start_diff_#t~post5_2|, ULTIMATE.start_diff_~i~0=v_ULTIMATE.start_diff_~i~0_9} AuxVars[] AssignedVars[ULTIMATE.start_diff_#t~post5, ULTIMATE.start_diff_~i~0] 1391#L13-2 72.80/34.79 [2019-03-28 12:50:38,756 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 72.80/34.79 [2019-03-28 12:50:38,756 INFO L82 PathProgramCache]: Analyzing trace with hash 5467622, now seen corresponding path program 1 times 72.80/34.79 [2019-03-28 12:50:38,756 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 72.80/34.79 [2019-03-28 12:50:38,756 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 72.80/34.79 [2019-03-28 12:50:38,757 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 72.80/34.79 [2019-03-28 12:50:38,757 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 72.80/34.79 [2019-03-28 12:50:38,757 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 72.80/34.79 [2019-03-28 12:50:38,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 72.80/34.79 [2019-03-28 12:50:38,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 72.80/34.79 [2019-03-28 12:50:38,767 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 72.80/34.79 [2019-03-28 12:50:38,768 INFO L82 PathProgramCache]: Analyzing trace with hash -1945236739, now seen corresponding path program 6 times 72.80/34.79 [2019-03-28 12:50:38,768 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 72.80/34.79 [2019-03-28 12:50:38,768 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 72.80/34.79 [2019-03-28 12:50:38,768 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 72.80/34.79 [2019-03-28 12:50:38,769 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 72.80/34.79 [2019-03-28 12:50:38,769 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 72.80/34.79 [2019-03-28 12:50:38,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 72.80/34.79 [2019-03-28 12:50:38,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 72.80/34.79 [2019-03-28 12:50:38,774 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 72.80/34.79 [2019-03-28 12:50:38,774 INFO L82 PathProgramCache]: Analyzing trace with hash 1306248162, now seen corresponding path program 1 times 72.80/34.79 [2019-03-28 12:50:38,774 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 72.80/34.79 [2019-03-28 12:50:38,775 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 72.80/34.79 [2019-03-28 12:50:38,775 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 72.80/34.79 [2019-03-28 12:50:38,775 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY 72.80/34.79 [2019-03-28 12:50:38,775 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 72.80/34.79 [2019-03-28 12:50:38,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 72.80/34.79 [2019-03-28 12:50:38,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 72.80/34.79 [2019-03-28 12:50:39,237 WARN L188 SmtUtils]: Spent 342.00 ms on a formula simplification. DAG size of input: 105 DAG size of output: 103 72.80/34.79 [2019-03-28 12:50:39,412 WARN L188 SmtUtils]: Spent 174.00 ms on a formula simplification that was a NOOP. DAG size: 99 72.80/34.79 [2019-03-28 12:50:39,414 INFO L216 LassoAnalysis]: Preferences: 72.80/34.79 [2019-03-28 12:50:39,415 INFO L124 ssoRankerPreferences]: Compute integeral hull: false 72.80/34.79 [2019-03-28 12:50:39,415 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true 72.80/34.79 [2019-03-28 12:50:39,415 INFO L126 ssoRankerPreferences]: Term annotations enabled: false 72.80/34.79 [2019-03-28 12:50:39,415 INFO L127 ssoRankerPreferences]: Use exernal solver: false 72.80/34.79 [2019-03-28 12:50:39,415 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 72.80/34.79 [2019-03-28 12:50:39,415 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false 72.80/34.79 [2019-03-28 12:50:39,415 INFO L130 ssoRankerPreferences]: Path of dumped script: 72.80/34.79 [2019-03-28 12:50:39,415 INFO L131 ssoRankerPreferences]: Filename of dumped script: theBenchmark.c_BEv2_Iteration9_Lasso 72.80/34.79 [2019-03-28 12:50:39,415 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank 72.80/34.79 [2019-03-28 12:50:39,416 INFO L282 LassoAnalysis]: Starting lasso preprocessing... 72.80/34.79 [2019-03-28 12:50:39,418 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 72.80/34.79 [2019-03-28 12:50:39,420 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 72.80/34.79 [2019-03-28 12:50:39,422 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 72.80/34.79 [2019-03-28 12:50:39,424 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 72.80/34.79 [2019-03-28 12:50:39,425 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 72.80/34.79 [2019-03-28 12:50:39,426 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 72.80/34.79 [2019-03-28 12:50:39,428 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 72.80/34.79 [2019-03-28 12:50:39,430 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 72.80/34.79 [2019-03-28 12:50:39,432 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 72.80/34.79 [2019-03-28 12:50:39,433 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 72.80/34.79 [2019-03-28 12:50:39,434 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 72.80/34.79 [2019-03-28 12:50:39,436 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 72.80/34.79 [2019-03-28 12:50:39,717 WARN L188 SmtUtils]: Spent 216.00 ms on a formula simplification. DAG size of input: 94 DAG size of output: 88 72.80/34.79 [2019-03-28 12:50:39,755 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 72.80/34.79 [2019-03-28 12:50:39,762 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 72.80/34.79 [2019-03-28 12:50:39,764 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 72.80/34.79 [2019-03-28 12:50:40,168 INFO L300 LassoAnalysis]: Preprocessing complete. 72.80/34.79 [2019-03-28 12:50:40,168 INFO L497 LassoAnalysis]: Using template 'affine'. 72.80/34.79 [2019-03-28 12:50:40,169 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 72.80/34.79 Termination analysis: LINEAR_WITH_GUESSES 72.80/34.79 Number of strict supporting invariants: 0 72.80/34.79 Number of non-strict supporting invariants: 1 72.80/34.79 Consider only non-deceasing supporting invariants: true 72.80/34.79 Simplify termination arguments: true 72.80/34.79 Simplify supporting invariants: trueOverapproximate stem: false 72.80/34.79 [2019-03-28 12:50:40,169 INFO L339 nArgumentSynthesizer]: Template has degree 0. 72.80/34.79 [2019-03-28 12:50:40,169 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 72.80/34.79 [2019-03-28 12:50:40,170 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 72.80/34.79 [2019-03-28 12:50:40,170 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 72.80/34.79 [2019-03-28 12:50:40,170 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. 72.80/34.79 [2019-03-28 12:50:40,170 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. 72.80/34.79 [2019-03-28 12:50:40,171 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 72.80/34.79 [2019-03-28 12:50:40,172 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 72.80/34.79 Termination analysis: LINEAR_WITH_GUESSES 72.80/34.79 Number of strict supporting invariants: 0 72.80/34.79 Number of non-strict supporting invariants: 1 72.80/34.79 Consider only non-deceasing supporting invariants: true 72.80/34.79 Simplify termination arguments: true 72.80/34.79 Simplify supporting invariants: trueOverapproximate stem: false 72.80/34.79 [2019-03-28 12:50:40,172 INFO L339 nArgumentSynthesizer]: Template has degree 0. 72.80/34.79 [2019-03-28 12:50:40,172 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 72.80/34.79 [2019-03-28 12:50:40,172 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 72.80/34.79 [2019-03-28 12:50:40,173 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 72.80/34.79 [2019-03-28 12:50:40,173 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 72.80/34.79 [2019-03-28 12:50:40,173 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 72.80/34.79 [2019-03-28 12:50:40,173 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 72.80/34.79 [2019-03-28 12:50:40,174 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 72.80/34.79 [2019-03-28 12:50:40,174 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 72.80/34.79 Termination analysis: LINEAR_WITH_GUESSES 72.80/34.79 Number of strict supporting invariants: 0 72.80/34.79 Number of non-strict supporting invariants: 1 72.80/34.79 Consider only non-deceasing supporting invariants: true 72.80/34.79 Simplify termination arguments: true 72.80/34.79 Simplify supporting invariants: trueOverapproximate stem: false 72.80/34.79 [2019-03-28 12:50:40,174 INFO L339 nArgumentSynthesizer]: Template has degree 0. 72.80/34.79 [2019-03-28 12:50:40,174 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 72.80/34.79 [2019-03-28 12:50:40,175 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 72.80/34.79 [2019-03-28 12:50:40,175 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 72.80/34.79 [2019-03-28 12:50:40,175 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 72.80/34.79 [2019-03-28 12:50:40,175 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 72.80/34.79 [2019-03-28 12:50:40,175 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 72.80/34.79 [2019-03-28 12:50:40,175 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 72.80/34.79 [2019-03-28 12:50:40,176 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 72.80/34.79 Termination analysis: LINEAR_WITH_GUESSES 72.80/34.79 Number of strict supporting invariants: 0 72.80/34.79 Number of non-strict supporting invariants: 1 72.80/34.79 Consider only non-deceasing supporting invariants: true 72.80/34.79 Simplify termination arguments: true 72.80/34.79 Simplify supporting invariants: trueOverapproximate stem: false 72.80/34.79 [2019-03-28 12:50:40,176 INFO L339 nArgumentSynthesizer]: Template has degree 0. 72.80/34.79 [2019-03-28 12:50:40,176 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 72.80/34.79 [2019-03-28 12:50:40,176 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 72.80/34.79 [2019-03-28 12:50:40,176 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 72.80/34.79 [2019-03-28 12:50:40,177 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 72.80/34.79 [2019-03-28 12:50:40,177 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 72.80/34.79 [2019-03-28 12:50:40,177 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 72.80/34.79 [2019-03-28 12:50:40,177 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 72.80/34.79 [2019-03-28 12:50:40,177 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 72.80/34.79 Termination analysis: LINEAR_WITH_GUESSES 72.80/34.79 Number of strict supporting invariants: 0 72.80/34.79 Number of non-strict supporting invariants: 1 72.80/34.79 Consider only non-deceasing supporting invariants: true 72.80/34.79 Simplify termination arguments: true 72.80/34.79 Simplify supporting invariants: trueOverapproximate stem: false 72.80/34.79 [2019-03-28 12:50:40,178 INFO L339 nArgumentSynthesizer]: Template has degree 0. 72.80/34.79 [2019-03-28 12:50:40,178 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 72.80/34.79 [2019-03-28 12:50:40,178 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 72.80/34.79 [2019-03-28 12:50:40,178 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 72.80/34.79 [2019-03-28 12:50:40,178 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 72.80/34.79 [2019-03-28 12:50:40,178 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 72.80/34.79 [2019-03-28 12:50:40,179 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 72.80/34.79 [2019-03-28 12:50:40,179 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 72.80/34.79 [2019-03-28 12:50:40,179 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 72.80/34.79 Termination analysis: LINEAR_WITH_GUESSES 72.80/34.79 Number of strict supporting invariants: 0 72.80/34.79 Number of non-strict supporting invariants: 1 72.80/34.79 Consider only non-deceasing supporting invariants: true 72.80/34.79 Simplify termination arguments: true 72.80/34.79 Simplify supporting invariants: trueOverapproximate stem: false 72.80/34.79 [2019-03-28 12:50:40,179 INFO L339 nArgumentSynthesizer]: Template has degree 0. 72.80/34.79 [2019-03-28 12:50:40,180 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 72.80/34.79 [2019-03-28 12:50:40,180 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 72.80/34.79 [2019-03-28 12:50:40,180 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 72.80/34.79 [2019-03-28 12:50:40,180 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. 72.80/34.79 [2019-03-28 12:50:40,180 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. 72.80/34.79 [2019-03-28 12:50:40,181 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 72.80/34.79 [2019-03-28 12:50:40,182 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 72.80/34.79 Termination analysis: LINEAR_WITH_GUESSES 72.80/34.79 Number of strict supporting invariants: 0 72.80/34.79 Number of non-strict supporting invariants: 1 72.80/34.79 Consider only non-deceasing supporting invariants: true 72.80/34.79 Simplify termination arguments: true 72.80/34.79 Simplify supporting invariants: trueOverapproximate stem: false 72.80/34.79 [2019-03-28 12:50:40,182 INFO L339 nArgumentSynthesizer]: Template has degree 0. 72.80/34.79 [2019-03-28 12:50:40,182 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 72.80/34.79 [2019-03-28 12:50:40,182 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 72.80/34.79 [2019-03-28 12:50:40,182 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 72.80/34.79 [2019-03-28 12:50:40,183 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. 72.80/34.79 [2019-03-28 12:50:40,183 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. 72.80/34.79 [2019-03-28 12:50:40,184 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 72.80/34.79 [2019-03-28 12:50:40,184 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 72.80/34.79 Termination analysis: LINEAR_WITH_GUESSES 72.80/34.79 Number of strict supporting invariants: 0 72.80/34.79 Number of non-strict supporting invariants: 1 72.80/34.79 Consider only non-deceasing supporting invariants: true 72.80/34.79 Simplify termination arguments: true 72.80/34.79 Simplify supporting invariants: trueOverapproximate stem: false 72.80/34.79 [2019-03-28 12:50:40,184 INFO L339 nArgumentSynthesizer]: Template has degree 0. 72.80/34.79 [2019-03-28 12:50:40,184 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 72.80/34.79 [2019-03-28 12:50:40,185 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 72.80/34.79 [2019-03-28 12:50:40,185 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 72.80/34.79 [2019-03-28 12:50:40,185 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 72.80/34.79 [2019-03-28 12:50:40,185 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 72.80/34.79 [2019-03-28 12:50:40,185 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 72.80/34.79 [2019-03-28 12:50:40,185 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 72.80/34.79 [2019-03-28 12:50:40,186 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 72.80/34.79 Termination analysis: LINEAR_WITH_GUESSES 72.80/34.79 Number of strict supporting invariants: 0 72.80/34.79 Number of non-strict supporting invariants: 1 72.80/34.79 Consider only non-deceasing supporting invariants: true 72.80/34.79 Simplify termination arguments: true 72.80/34.79 Simplify supporting invariants: trueOverapproximate stem: false 72.80/34.79 [2019-03-28 12:50:40,186 INFO L339 nArgumentSynthesizer]: Template has degree 0. 72.80/34.79 [2019-03-28 12:50:40,186 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 72.80/34.79 [2019-03-28 12:50:40,186 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 72.80/34.79 [2019-03-28 12:50:40,186 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 72.80/34.79 [2019-03-28 12:50:40,187 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 72.80/34.79 [2019-03-28 12:50:40,187 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 72.80/34.79 [2019-03-28 12:50:40,187 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 72.80/34.79 [2019-03-28 12:50:40,187 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 72.80/34.79 [2019-03-28 12:50:40,187 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 72.80/34.79 Termination analysis: LINEAR_WITH_GUESSES 72.80/34.79 Number of strict supporting invariants: 0 72.80/34.79 Number of non-strict supporting invariants: 1 72.80/34.79 Consider only non-deceasing supporting invariants: true 72.80/34.79 Simplify termination arguments: true 72.80/34.79 Simplify supporting invariants: trueOverapproximate stem: false 72.80/34.79 [2019-03-28 12:50:40,188 INFO L339 nArgumentSynthesizer]: Template has degree 0. 72.80/34.79 [2019-03-28 12:50:40,188 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 72.80/34.79 [2019-03-28 12:50:40,188 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 72.80/34.79 [2019-03-28 12:50:40,188 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 72.80/34.79 [2019-03-28 12:50:40,188 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 72.80/34.79 [2019-03-28 12:50:40,188 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 72.80/34.79 [2019-03-28 12:50:40,189 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 72.80/34.79 [2019-03-28 12:50:40,189 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 72.80/34.79 [2019-03-28 12:50:40,189 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 72.80/34.79 Termination analysis: LINEAR_WITH_GUESSES 72.80/34.79 Number of strict supporting invariants: 0 72.80/34.79 Number of non-strict supporting invariants: 1 72.80/34.79 Consider only non-deceasing supporting invariants: true 72.80/34.79 Simplify termination arguments: true 72.80/34.79 Simplify supporting invariants: trueOverapproximate stem: false 72.80/34.79 [2019-03-28 12:50:40,189 INFO L339 nArgumentSynthesizer]: Template has degree 0. 72.80/34.79 [2019-03-28 12:50:40,190 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 72.80/34.79 [2019-03-28 12:50:40,190 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 72.80/34.79 [2019-03-28 12:50:40,190 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 72.80/34.79 [2019-03-28 12:50:40,190 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 72.80/34.79 [2019-03-28 12:50:40,190 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 72.80/34.79 [2019-03-28 12:50:40,190 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 72.80/34.79 [2019-03-28 12:50:40,191 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 72.80/34.79 [2019-03-28 12:50:40,191 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 72.80/34.79 Termination analysis: LINEAR_WITH_GUESSES 72.80/34.79 Number of strict supporting invariants: 0 72.80/34.79 Number of non-strict supporting invariants: 1 72.80/34.79 Consider only non-deceasing supporting invariants: true 72.80/34.79 Simplify termination arguments: true 72.80/34.79 Simplify supporting invariants: trueOverapproximate stem: false 72.80/34.79 [2019-03-28 12:50:40,191 INFO L339 nArgumentSynthesizer]: Template has degree 0. 72.80/34.79 [2019-03-28 12:50:40,191 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 72.80/34.79 [2019-03-28 12:50:40,191 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 72.80/34.79 [2019-03-28 12:50:40,192 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 72.80/34.79 [2019-03-28 12:50:40,192 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. 72.80/34.79 [2019-03-28 12:50:40,192 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. 72.80/34.79 [2019-03-28 12:50:40,193 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 72.80/34.79 [2019-03-28 12:50:40,194 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 72.80/34.79 Termination analysis: LINEAR_WITH_GUESSES 72.80/34.79 Number of strict supporting invariants: 0 72.80/34.79 Number of non-strict supporting invariants: 1 72.80/34.79 Consider only non-deceasing supporting invariants: true 72.80/34.79 Simplify termination arguments: true 72.80/34.79 Simplify supporting invariants: trueOverapproximate stem: false 72.80/34.79 [2019-03-28 12:50:40,194 INFO L339 nArgumentSynthesizer]: Template has degree 0. 72.80/34.79 [2019-03-28 12:50:40,194 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 72.80/34.79 [2019-03-28 12:50:40,194 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 72.80/34.79 [2019-03-28 12:50:40,194 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 72.80/34.79 [2019-03-28 12:50:40,195 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. 72.80/34.79 [2019-03-28 12:50:40,195 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. 72.80/34.79 [2019-03-28 12:50:40,198 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 72.80/34.79 [2019-03-28 12:50:40,198 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 72.80/34.79 Termination analysis: LINEAR_WITH_GUESSES 72.80/34.79 Number of strict supporting invariants: 0 72.80/34.79 Number of non-strict supporting invariants: 1 72.80/34.79 Consider only non-deceasing supporting invariants: true 72.80/34.79 Simplify termination arguments: true 72.80/34.79 Simplify supporting invariants: trueOverapproximate stem: false 72.80/34.79 [2019-03-28 12:50:40,198 INFO L339 nArgumentSynthesizer]: Template has degree 0. 72.80/34.79 [2019-03-28 12:50:40,199 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 72.80/34.79 [2019-03-28 12:50:40,199 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 72.80/34.79 [2019-03-28 12:50:40,199 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 72.80/34.79 [2019-03-28 12:50:40,200 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. 72.80/34.79 [2019-03-28 12:50:40,200 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. 72.80/34.79 [2019-03-28 12:50:40,203 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 72.80/34.79 [2019-03-28 12:50:40,203 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 72.80/34.79 Termination analysis: LINEAR_WITH_GUESSES 72.80/34.79 Number of strict supporting invariants: 0 72.80/34.79 Number of non-strict supporting invariants: 1 72.80/34.79 Consider only non-deceasing supporting invariants: true 72.80/34.79 Simplify termination arguments: true 72.80/34.79 Simplify supporting invariants: trueOverapproximate stem: false 72.80/34.79 [2019-03-28 12:50:40,204 INFO L339 nArgumentSynthesizer]: Template has degree 0. 72.80/34.79 [2019-03-28 12:50:40,204 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 72.80/34.79 [2019-03-28 12:50:40,204 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 72.80/34.79 [2019-03-28 12:50:40,204 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 72.80/34.79 [2019-03-28 12:50:40,205 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. 72.80/34.79 [2019-03-28 12:50:40,205 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. 72.80/34.79 [2019-03-28 12:50:40,207 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 72.80/34.79 [2019-03-28 12:50:40,208 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 72.80/34.79 Termination analysis: LINEAR_WITH_GUESSES 72.80/34.79 Number of strict supporting invariants: 0 72.80/34.79 Number of non-strict supporting invariants: 1 72.80/34.79 Consider only non-deceasing supporting invariants: true 72.80/34.79 Simplify termination arguments: true 72.80/34.79 Simplify supporting invariants: trueOverapproximate stem: false 72.80/34.79 [2019-03-28 12:50:40,208 INFO L339 nArgumentSynthesizer]: Template has degree 0. 72.80/34.79 [2019-03-28 12:50:40,208 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 72.80/34.79 [2019-03-28 12:50:40,208 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 72.80/34.79 [2019-03-28 12:50:40,208 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 72.80/34.79 [2019-03-28 12:50:40,209 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. 72.80/34.79 [2019-03-28 12:50:40,209 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. 72.80/34.79 [2019-03-28 12:50:40,211 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 72.80/34.79 [2019-03-28 12:50:40,211 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 72.80/34.79 Termination analysis: LINEAR_WITH_GUESSES 72.80/34.79 Number of strict supporting invariants: 0 72.80/34.79 Number of non-strict supporting invariants: 1 72.80/34.79 Consider only non-deceasing supporting invariants: true 72.80/34.79 Simplify termination arguments: true 72.80/34.79 Simplify supporting invariants: trueOverapproximate stem: false 72.80/34.79 [2019-03-28 12:50:40,212 INFO L339 nArgumentSynthesizer]: Template has degree 0. 72.80/34.79 [2019-03-28 12:50:40,212 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 72.80/34.79 [2019-03-28 12:50:40,212 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 72.80/34.79 [2019-03-28 12:50:40,212 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 72.80/34.79 [2019-03-28 12:50:40,213 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. 72.80/34.79 [2019-03-28 12:50:40,214 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. 72.80/34.79 [2019-03-28 12:50:40,225 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. 72.80/34.79 [2019-03-28 12:50:40,236 INFO L443 ModelExtractionUtils]: Simplification made 7 calls to the SMT solver. 72.80/34.79 [2019-03-28 12:50:40,237 INFO L444 ModelExtractionUtils]: 28 out of 40 variables were initially zero. Simplification set additionally 9 variables to zero. 72.80/34.79 [2019-03-28 12:50:40,237 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... 72.80/34.79 [2019-03-28 12:50:40,238 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. 72.80/34.79 [2019-03-28 12:50:40,238 INFO L518 LassoAnalysis]: Proved termination. 72.80/34.79 [2019-03-28 12:50:40,238 INFO L520 LassoAnalysis]: Termination argument consisting of: 72.80/34.79 Ranking function f(ULTIMATE.start_diff_~i~0, ULTIMATE.start_diff_~l1~0) = -1*ULTIMATE.start_diff_~i~0 + 1*ULTIMATE.start_diff_~l1~0 72.80/34.79 Supporting invariants [] 72.80/34.79 [2019-03-28 12:50:40,280 INFO L297 tatePredicateManager]: 15 out of 15 supporting invariants were superfluous and have been removed 72.80/34.79 [2019-03-28 12:50:40,293 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 72.80/34.79 [2019-03-28 12:50:40,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 72.80/34.79 [2019-03-28 12:50:40,312 INFO L256 TraceCheckSpWp]: Trace formula consists of 83 conjuncts, 2 conjunts are in the unsatisfiable core 72.80/34.79 [2019-03-28 12:50:40,313 INFO L279 TraceCheckSpWp]: Computing forward predicates... 72.80/34.79 [2019-03-28 12:50:40,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 72.80/34.79 [2019-03-28 12:50:40,322 INFO L256 TraceCheckSpWp]: Trace formula consists of 30 conjuncts, 4 conjunts are in the unsatisfiable core 72.80/34.79 [2019-03-28 12:50:40,323 INFO L279 TraceCheckSpWp]: Computing forward predicates... 72.80/34.79 [2019-03-28 12:50:40,334 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. 72.80/34.79 [2019-03-28 12:50:40,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 72.80/34.79 [2019-03-28 12:50:40,379 INFO L256 TraceCheckSpWp]: Trace formula consists of 30 conjuncts, 4 conjunts are in the unsatisfiable core 72.80/34.79 [2019-03-28 12:50:40,380 INFO L279 TraceCheckSpWp]: Computing forward predicates... 72.80/34.79 [2019-03-28 12:50:40,402 INFO L98 LoopCannibalizer]: 2 predicates before loop cannibalization 3 predicates after loop cannibalization 72.80/34.79 [2019-03-28 12:50:40,402 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 72.80/34.79 [2019-03-28 12:50:40,402 INFO L69 BuchiDifferenceNCSB]: Start buchiDifferenceNCSB. First operand 41 states and 72 transitions. cyclomatic complexity: 34 Second operand 3 states. 72.80/34.79 [2019-03-28 12:50:40,462 INFO L73 BuchiDifferenceNCSB]: Finished buchiDifferenceNCSB. First operand 41 states and 72 transitions. cyclomatic complexity: 34. Second operand 3 states. Result 73 states and 123 transitions. Complement of second has 4 states. 72.80/34.79 [2019-03-28 12:50:40,463 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 72.80/34.79 [2019-03-28 12:50:40,464 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. 72.80/34.79 [2019-03-28 12:50:40,464 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 42 transitions. 72.80/34.79 [2019-03-28 12:50:40,464 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 42 transitions. Stem has 4 letters. Loop has 8 letters. 72.80/34.79 [2019-03-28 12:50:40,464 INFO L116 BuchiAccepts]: Finished buchiAccepts. 72.80/34.79 [2019-03-28 12:50:40,465 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 42 transitions. Stem has 12 letters. Loop has 8 letters. 72.80/34.79 [2019-03-28 12:50:40,465 INFO L116 BuchiAccepts]: Finished buchiAccepts. 72.80/34.79 [2019-03-28 12:50:40,465 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 42 transitions. Stem has 4 letters. Loop has 16 letters. 72.80/34.79 [2019-03-28 12:50:40,465 INFO L116 BuchiAccepts]: Finished buchiAccepts. 72.80/34.79 [2019-03-28 12:50:40,469 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 73 states and 123 transitions. 72.80/34.79 [2019-03-28 12:50:40,470 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 29 72.80/34.79 [2019-03-28 12:50:40,471 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 73 states to 68 states and 114 transitions. 72.80/34.79 [2019-03-28 12:50:40,471 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 35 72.80/34.79 [2019-03-28 12:50:40,471 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 36 72.80/34.79 [2019-03-28 12:50:40,471 INFO L73 IsDeterministic]: Start isDeterministic. Operand 68 states and 114 transitions. 72.80/34.79 [2019-03-28 12:50:40,471 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. 72.80/34.79 [2019-03-28 12:50:40,472 INFO L706 BuchiCegarLoop]: Abstraction has 68 states and 114 transitions. 72.80/34.79 [2019-03-28 12:50:40,472 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states and 114 transitions. 72.80/34.79 [2019-03-28 12:50:40,473 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 41. 72.80/34.79 [2019-03-28 12:50:40,473 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. 72.80/34.79 [2019-03-28 12:50:40,473 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 72 transitions. 72.80/34.79 [2019-03-28 12:50:40,474 INFO L729 BuchiCegarLoop]: Abstraction has 41 states and 72 transitions. 72.80/34.79 [2019-03-28 12:50:40,474 INFO L609 BuchiCegarLoop]: Abstraction has 41 states and 72 transitions. 72.80/34.79 [2019-03-28 12:50:40,474 INFO L442 BuchiCegarLoop]: ======== Iteration 10============ 72.80/34.79 [2019-03-28 12:50:40,474 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 41 states and 72 transitions. 72.80/34.79 [2019-03-28 12:50:40,474 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 20 72.80/34.79 [2019-03-28 12:50:40,474 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false 72.80/34.79 [2019-03-28 12:50:40,475 INFO L119 BuchiIsEmpty]: Starting construction of run 72.80/34.79 [2019-03-28 12:50:40,475 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] 72.80/34.79 [2019-03-28 12:50:40,475 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1] 72.80/34.79 [2019-03-28 12:50:40,475 INFO L794 eck$LassoCheckResult]: Stem: 1637#ULTIMATE.startENTRY [150] ULTIMATE.startENTRY-->L34: Formula: (and (= |v_#NULL.offset_2| 0) (= (store |v_#valid_20| 0 0) |v_#valid_19|) (= 0 |v_#NULL.base_2|)) InVars {#valid=|v_#valid_20|} OutVars{ULTIMATE.start_main_#t~malloc8.base=|v_ULTIMATE.start_main_#t~malloc8.base_5|, ULTIMATE.start_main_#t~malloc9.base=|v_ULTIMATE.start_main_#t~malloc9.base_5|, ULTIMATE.start_main_~A~0.base=v_ULTIMATE.start_main_~A~0.base_3, ULTIMATE.start_main_~B~0.offset=v_ULTIMATE.start_main_~B~0.offset_3, #NULL.offset=|v_#NULL.offset_2|, ULTIMATE.start_main_#t~nondet6=|v_ULTIMATE.start_main_#t~nondet6_6|, ULTIMATE.start_main_#t~nondet7=|v_ULTIMATE.start_main_#t~nondet7_6|, ULTIMATE.start_main_~B~0.base=v_ULTIMATE.start_main_~B~0.base_3, #NULL.base=|v_#NULL.base_2|, ULTIMATE.start_main_~D~0.offset=v_ULTIMATE.start_main_~D~0.offset_3, ULTIMATE.start_main_#t~malloc10.base=|v_ULTIMATE.start_main_#t~malloc10.base_5|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_4|, ULTIMATE.start_main_#t~malloc8.offset=|v_ULTIMATE.start_main_#t~malloc8.offset_5|, #valid=|v_#valid_19|, ULTIMATE.start_main_#t~malloc9.offset=|v_ULTIMATE.start_main_#t~malloc9.offset_5|, ULTIMATE.start_main_~D~0.base=v_ULTIMATE.start_main_~D~0.base_3, ULTIMATE.start_main_~A~0.offset=v_ULTIMATE.start_main_~A~0.offset_3, ULTIMATE.start_main_~Blen~0=v_ULTIMATE.start_main_~Blen~0_8, ULTIMATE.start_main_~Alen~0=v_ULTIMATE.start_main_~Alen~0_8, ULTIMATE.start_main_#t~malloc10.offset=|v_ULTIMATE.start_main_#t~malloc10.offset_5|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~malloc8.base, ULTIMATE.start_main_#t~malloc9.base, ULTIMATE.start_main_~A~0.base, ULTIMATE.start_main_~B~0.offset, #NULL.offset, ULTIMATE.start_main_#t~nondet6, ULTIMATE.start_main_#t~nondet7, ULTIMATE.start_main_~B~0.base, #NULL.base, ULTIMATE.start_main_~D~0.offset, ULTIMATE.start_main_#t~malloc10.base, ULTIMATE.start_main_#res, ULTIMATE.start_main_#t~malloc8.offset, #valid, ULTIMATE.start_main_#t~malloc9.offset, ULTIMATE.start_main_~D~0.base, ULTIMATE.start_main_~A~0.offset, ULTIMATE.start_main_~Blen~0, ULTIMATE.start_main_~Alen~0, ULTIMATE.start_main_#t~malloc10.offset] 1638#L34 [75] L34-->L34-2: Formula: (and (< v_ULTIMATE.start_main_~Alen~0_5 1) (= v_ULTIMATE.start_main_~Alen~0_4 1)) InVars {ULTIMATE.start_main_~Alen~0=v_ULTIMATE.start_main_~Alen~0_5} OutVars{ULTIMATE.start_main_~Alen~0=v_ULTIMATE.start_main_~Alen~0_4} AuxVars[] AssignedVars[ULTIMATE.start_main_~Alen~0] 1639#L34-2 [105] L34-2-->L37-1: Formula: (>= v_ULTIMATE.start_main_~Blen~0_6 1) InVars {ULTIMATE.start_main_~Blen~0=v_ULTIMATE.start_main_~Blen~0_6} OutVars{ULTIMATE.start_main_~Blen~0=v_ULTIMATE.start_main_~Blen~0_6} AuxVars[] AssignedVars[] 1640#L37-1 [120] L37-1-->L13-2: Formula: (let ((.cse2 (store |v_#valid_10| |v_ULTIMATE.start_main_#t~malloc8.base_4| 1))) (let ((.cse0 (store .cse2 |v_ULTIMATE.start_main_#t~malloc9.base_4| 1))) (and (= v_ULTIMATE.start_diff_~k~0_1 0) (= v_ULTIMATE.start_diff_~l2~0_1 v_ULTIMATE.start_diff_~Blen_1) (= v_ULTIMATE.start_diff_~A.base_1 |v_ULTIMATE.start_diff_#in~A.base_1|) (= |v_#valid_7| (store .cse0 |v_ULTIMATE.start_main_#t~malloc10.base_4| 1)) (< |v_ULTIMATE.start_main_#t~malloc10.base_4| |v_#StackHeapBarrier_1|) (= v_ULTIMATE.start_diff_~Blen_1 |v_ULTIMATE.start_diff_#in~Blen_1|) (= v_ULTIMATE.start_diff_~B.base_1 |v_ULTIMATE.start_diff_#in~B.base_1|) (> |v_ULTIMATE.start_main_#t~malloc8.base_4| 0) (= v_ULTIMATE.start_diff_~Alen_1 |v_ULTIMATE.start_diff_#in~Alen_1|) (= v_ULTIMATE.start_main_~B~0.offset_2 |v_ULTIMATE.start_main_#t~malloc9.offset_4|) (= v_ULTIMATE.start_main_~B~0.base_2 |v_ULTIMATE.start_main_#t~malloc9.base_4|) (= |v_ULTIMATE.start_diff_#in~A.base_1| v_ULTIMATE.start_main_~A~0.base_2) (= |v_ULTIMATE.start_main_#t~malloc8.offset_4| 0) (> |v_ULTIMATE.start_main_#t~malloc10.base_4| 0) (= |v_#length_1| (let ((.cse1 (* 4 v_ULTIMATE.start_main_~Alen~0_7))) (store (store (store |v_#length_4| |v_ULTIMATE.start_main_#t~malloc8.base_4| .cse1) |v_ULTIMATE.start_main_#t~malloc9.base_4| (* 4 v_ULTIMATE.start_main_~Blen~0_7)) |v_ULTIMATE.start_main_#t~malloc10.base_4| .cse1))) (= v_ULTIMATE.start_diff_~D.base_1 |v_ULTIMATE.start_diff_#in~D.base_1|) (= |v_ULTIMATE.start_main_#t~malloc9.offset_4| 0) (= |v_ULTIMATE.start_diff_#in~B.offset_1| v_ULTIMATE.start_main_~B~0.offset_2) (= |v_ULTIMATE.start_diff_#in~A.offset_1| v_ULTIMATE.start_main_~A~0.offset_2) (= v_ULTIMATE.start_diff_~B.offset_1 |v_ULTIMATE.start_diff_#in~B.offset_1|) (= v_ULTIMATE.start_main_~A~0.base_2 |v_ULTIMATE.start_main_#t~malloc8.base_4|) (< |v_ULTIMATE.start_main_#t~malloc8.base_4| |v_#StackHeapBarrier_1|) (= |v_ULTIMATE.start_diff_#in~B.base_1| v_ULTIMATE.start_main_~B~0.base_2) (< 0 |v_ULTIMATE.start_main_#t~malloc9.base_4|) (< |v_ULTIMATE.start_main_#t~malloc9.base_4| |v_#StackHeapBarrier_1|) (= |v_ULTIMATE.start_diff_#in~D.offset_1| v_ULTIMATE.start_main_~D~0.offset_2) (= v_ULTIMATE.start_main_~D~0.offset_2 |v_ULTIMATE.start_main_#t~malloc10.offset_4|) (= v_ULTIMATE.start_diff_~i~0_1 0) (= 0 (select .cse2 |v_ULTIMATE.start_main_#t~malloc9.base_4|)) (= v_ULTIMATE.start_main_~D~0.base_2 |v_ULTIMATE.start_main_#t~malloc10.base_4|) (= |v_ULTIMATE.start_diff_#in~Blen_1| v_ULTIMATE.start_main_~Blen~0_7) (= v_ULTIMATE.start_diff_~l1~0_1 v_ULTIMATE.start_diff_~Alen_1) (= 0 (select .cse0 |v_ULTIMATE.start_main_#t~malloc10.base_4|)) (= (select |v_#valid_10| |v_ULTIMATE.start_main_#t~malloc8.base_4|) 0) (= v_ULTIMATE.start_diff_~A.offset_1 |v_ULTIMATE.start_diff_#in~A.offset_1|) (= |v_ULTIMATE.start_diff_#in~Alen_1| v_ULTIMATE.start_main_~Alen~0_7) (= v_ULTIMATE.start_main_~A~0.offset_2 |v_ULTIMATE.start_main_#t~malloc8.offset_4|) (= |v_ULTIMATE.start_main_#t~malloc10.offset_4| 0) (= |v_ULTIMATE.start_diff_#in~D.base_1| v_ULTIMATE.start_main_~D~0.base_2) (= v_ULTIMATE.start_diff_~D.offset_1 |v_ULTIMATE.start_diff_#in~D.offset_1|)))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_4|, #valid=|v_#valid_10|, ULTIMATE.start_main_~Blen~0=v_ULTIMATE.start_main_~Blen~0_7, ULTIMATE.start_main_~Alen~0=v_ULTIMATE.start_main_~Alen~0_7} OutVars{ULTIMATE.start_diff_#in~A.base=|v_ULTIMATE.start_diff_#in~A.base_1|, ULTIMATE.start_diff_#in~B.base=|v_ULTIMATE.start_diff_#in~B.base_1|, ULTIMATE.start_diff_~B.offset=v_ULTIMATE.start_diff_~B.offset_1, ULTIMATE.start_diff_~Alen=v_ULTIMATE.start_diff_~Alen_1, ULTIMATE.start_diff_~D.base=v_ULTIMATE.start_diff_~D.base_1, ULTIMATE.start_diff_#in~Blen=|v_ULTIMATE.start_diff_#in~Blen_1|, ULTIMATE.start_main_~B~0.offset=v_ULTIMATE.start_main_~B~0.offset_2, ULTIMATE.start_main_~B~0.base=v_ULTIMATE.start_main_~B~0.base_2, ULTIMATE.start_diff_#in~A.offset=|v_ULTIMATE.start_diff_#in~A.offset_1|, ULTIMATE.start_main_~D~0.offset=v_ULTIMATE.start_main_~D~0.offset_2, ULTIMATE.start_diff_#in~D.offset=|v_ULTIMATE.start_diff_#in~D.offset_1|, ULTIMATE.start_diff_#in~Alen=|v_ULTIMATE.start_diff_#in~Alen_1|, ULTIMATE.start_diff_~A.base=v_ULTIMATE.start_diff_~A.base_1, ULTIMATE.start_diff_~B.base=v_ULTIMATE.start_diff_~B.base_1, #length=|v_#length_1|, ULTIMATE.start_main_#t~malloc9.offset=|v_ULTIMATE.start_main_#t~malloc9.offset_4|, ULTIMATE.start_diff_#t~mem3=|v_ULTIMATE.start_diff_#t~mem3_1|, ULTIMATE.start_main_~A~0.offset=v_ULTIMATE.start_main_~A~0.offset_2, ULTIMATE.start_main_#t~malloc10.offset=|v_ULTIMATE.start_main_#t~malloc10.offset_4|, ULTIMATE.start_main_~Blen~0=v_ULTIMATE.start_main_~Blen~0_7, ULTIMATE.start_main_~Alen~0=v_ULTIMATE.start_main_~Alen~0_7, ULTIMATE.start_diff_~Blen=v_ULTIMATE.start_diff_~Blen_1, ULTIMATE.start_main_#t~malloc8.base=|v_ULTIMATE.start_main_#t~malloc8.base_4|, ULTIMATE.start_diff_#t~mem0=|v_ULTIMATE.start_diff_#t~mem0_1|, ULTIMATE.start_main_#t~malloc9.base=|v_ULTIMATE.start_main_#t~malloc9.base_4|, ULTIMATE.start_diff_#t~mem1=|v_ULTIMATE.start_diff_#t~mem1_1|, ULTIMATE.start_main_~A~0.base=v_ULTIMATE.start_main_~A~0.base_2, ULTIMATE.start_diff_#t~post4=|v_ULTIMATE.start_diff_#t~post4_1|, ULTIMATE.start_diff_~found~0=v_ULTIMATE.start_diff_~found~0_1, ULTIMATE.start_diff_#in~B.offset=|v_ULTIMATE.start_diff_#in~B.offset_1|, ULTIMATE.start_diff_~i~0=v_ULTIMATE.start_diff_~i~0_1, ULTIMATE.start_diff_~l1~0=v_ULTIMATE.start_diff_~l1~0_1, ULTIMATE.start_diff_#t~post5=|v_ULTIMATE.start_diff_#t~post5_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, ULTIMATE.start_main_#t~malloc10.base=|v_ULTIMATE.start_main_#t~malloc10.base_4|, ULTIMATE.start_diff_~D.offset=v_ULTIMATE.start_diff_~D.offset_1, ULTIMATE.start_diff_~l2~0=v_ULTIMATE.start_diff_~l2~0_1, ULTIMATE.start_diff_~j~0=v_ULTIMATE.start_diff_~j~0_1, ULTIMATE.start_main_#t~malloc8.offset=|v_ULTIMATE.start_main_#t~malloc8.offset_4|, #valid=|v_#valid_7|, ULTIMATE.start_diff_~k~0=v_ULTIMATE.start_diff_~k~0_1, ULTIMATE.start_diff_#in~D.base=|v_ULTIMATE.start_diff_#in~D.base_1|, ULTIMATE.start_diff_#t~post2=|v_ULTIMATE.start_diff_#t~post2_1|, ULTIMATE.start_diff_~A.offset=v_ULTIMATE.start_diff_~A.offset_1, ULTIMATE.start_main_~D~0.base=v_ULTIMATE.start_main_~D~0.base_2} AuxVars[] AssignedVars[ULTIMATE.start_diff_#in~A.base, ULTIMATE.start_diff_#in~B.base, ULTIMATE.start_diff_~B.offset, ULTIMATE.start_diff_~Alen, ULTIMATE.start_diff_~D.base, ULTIMATE.start_diff_#in~Blen, ULTIMATE.start_main_~B~0.offset, ULTIMATE.start_main_~B~0.base, ULTIMATE.start_diff_#in~A.offset, ULTIMATE.start_main_~D~0.offset, ULTIMATE.start_diff_#in~D.offset, ULTIMATE.start_diff_#in~Alen, ULTIMATE.start_diff_~A.base, ULTIMATE.start_diff_~B.base, #length, ULTIMATE.start_main_#t~malloc9.offset, ULTIMATE.start_diff_#t~mem3, ULTIMATE.start_main_~A~0.offset, ULTIMATE.start_main_#t~malloc10.offset, ULTIMATE.start_diff_~Blen, ULTIMATE.start_main_#t~malloc8.base, ULTIMATE.start_diff_#t~mem0, ULTIMATE.start_main_#t~malloc9.base, ULTIMATE.start_diff_#t~mem1, ULTIMATE.start_main_~A~0.base, ULTIMATE.start_diff_#t~post4, ULTIMATE.start_diff_~found~0, ULTIMATE.start_diff_#in~B.offset, ULTIMATE.start_diff_~i~0, ULTIMATE.start_diff_~l1~0, ULTIMATE.start_diff_#t~post5, ULTIMATE.start_main_#t~malloc10.base, ULTIMATE.start_diff_~D.offset, ULTIMATE.start_diff_~l2~0, ULTIMATE.start_diff_~j~0, ULTIMATE.start_main_#t~malloc8.offset, #valid, ULTIMATE.start_diff_~k~0, ULTIMATE.start_diff_#in~D.base, ULTIMATE.start_diff_#t~post2, ULTIMATE.start_diff_~A.offset, ULTIMATE.start_main_~D~0.base] 1645#L13-2 72.80/34.79 [2019-03-28 12:50:40,476 INFO L796 eck$LassoCheckResult]: Loop: 1645#L13-2 [91] L13-2-->L17-4: Formula: (and (< v_ULTIMATE.start_diff_~i~0_4 v_ULTIMATE.start_diff_~l1~0_4) (= v_ULTIMATE.start_diff_~j~0_2 0) (= v_ULTIMATE.start_diff_~found~0_3 0)) InVars {ULTIMATE.start_diff_~i~0=v_ULTIMATE.start_diff_~i~0_4, ULTIMATE.start_diff_~l1~0=v_ULTIMATE.start_diff_~l1~0_4} OutVars{ULTIMATE.start_diff_~found~0=v_ULTIMATE.start_diff_~found~0_3, ULTIMATE.start_diff_~i~0=v_ULTIMATE.start_diff_~i~0_4, ULTIMATE.start_diff_~l1~0=v_ULTIMATE.start_diff_~l1~0_4, ULTIMATE.start_diff_~j~0=v_ULTIMATE.start_diff_~j~0_2} AuxVars[] AssignedVars[ULTIMATE.start_diff_~found~0, ULTIMATE.start_diff_~j~0] 1663#L17-4 [99] L17-4-->L17: Formula: (and (= 0 v_ULTIMATE.start_diff_~found~0_5) (< v_ULTIMATE.start_diff_~j~0_4 v_ULTIMATE.start_diff_~l2~0_4)) InVars {ULTIMATE.start_diff_~found~0=v_ULTIMATE.start_diff_~found~0_5, ULTIMATE.start_diff_~j~0=v_ULTIMATE.start_diff_~j~0_4, ULTIMATE.start_diff_~l2~0=v_ULTIMATE.start_diff_~l2~0_4} OutVars{ULTIMATE.start_diff_~found~0=v_ULTIMATE.start_diff_~found~0_5, ULTIMATE.start_diff_~j~0=v_ULTIMATE.start_diff_~j~0_4, ULTIMATE.start_diff_~l2~0=v_ULTIMATE.start_diff_~l2~0_4} AuxVars[] AssignedVars[] 1657#L17 [85] L17-->L17-1: Formula: (let ((.cse0 (* 4 v_ULTIMATE.start_diff_~i~0_5))) (let ((.cse1 (+ .cse0 v_ULTIMATE.start_diff_~A.offset_3))) (and (<= (+ .cse0 v_ULTIMATE.start_diff_~A.offset_3 4) (select |v_#length_5| v_ULTIMATE.start_diff_~A.base_3)) (= 1 (select |v_#valid_11| v_ULTIMATE.start_diff_~A.base_3)) (= (select (select |v_#memory_int_1| v_ULTIMATE.start_diff_~A.base_3) .cse1) |v_ULTIMATE.start_diff_#t~mem0_2|) (<= 0 .cse1)))) InVars {ULTIMATE.start_diff_~i~0=v_ULTIMATE.start_diff_~i~0_5, ULTIMATE.start_diff_~A.base=v_ULTIMATE.start_diff_~A.base_3, #valid=|v_#valid_11|, #memory_int=|v_#memory_int_1|, #length=|v_#length_5|, ULTIMATE.start_diff_~A.offset=v_ULTIMATE.start_diff_~A.offset_3} OutVars{ULTIMATE.start_diff_#t~mem0=|v_ULTIMATE.start_diff_#t~mem0_2|, ULTIMATE.start_diff_~i~0=v_ULTIMATE.start_diff_~i~0_5, ULTIMATE.start_diff_~A.base=v_ULTIMATE.start_diff_~A.base_3, #valid=|v_#valid_11|, #memory_int=|v_#memory_int_1|, #length=|v_#length_5|, ULTIMATE.start_diff_~A.offset=v_ULTIMATE.start_diff_~A.offset_3} AuxVars[] AssignedVars[ULTIMATE.start_diff_#t~mem0] 1662#L17-1 [82] L17-1-->L17-2: Formula: (let ((.cse1 (* 4 v_ULTIMATE.start_diff_~j~0_5))) (let ((.cse0 (+ v_ULTIMATE.start_diff_~B.offset_3 .cse1))) (and (<= 0 .cse0) (= 1 (select |v_#valid_13| v_ULTIMATE.start_diff_~B.base_3)) (= (select (select |v_#memory_int_2| v_ULTIMATE.start_diff_~B.base_3) .cse0) |v_ULTIMATE.start_diff_#t~mem1_2|) (<= (+ v_ULTIMATE.start_diff_~B.offset_3 .cse1 4) (select |v_#length_7| v_ULTIMATE.start_diff_~B.base_3))))) InVars {ULTIMATE.start_diff_~B.offset=v_ULTIMATE.start_diff_~B.offset_3, ULTIMATE.start_diff_~j~0=v_ULTIMATE.start_diff_~j~0_5, #valid=|v_#valid_13|, ULTIMATE.start_diff_~B.base=v_ULTIMATE.start_diff_~B.base_3, #memory_int=|v_#memory_int_2|, #length=|v_#length_7|} OutVars{ULTIMATE.start_diff_#t~mem1=|v_ULTIMATE.start_diff_#t~mem1_2|, ULTIMATE.start_diff_~B.offset=v_ULTIMATE.start_diff_~B.offset_3, ULTIMATE.start_diff_~j~0=v_ULTIMATE.start_diff_~j~0_5, #valid=|v_#valid_13|, ULTIMATE.start_diff_~B.base=v_ULTIMATE.start_diff_~B.base_3, #memory_int=|v_#memory_int_2|, #length=|v_#length_7|} AuxVars[] AssignedVars[ULTIMATE.start_diff_#t~mem1] 1660#L17-2 [80] L17-2-->L17-4: Formula: (and (= |v_ULTIMATE.start_diff_#t~mem1_4| |v_ULTIMATE.start_diff_#t~mem0_4|) (= v_ULTIMATE.start_diff_~found~0_6 1)) InVars {ULTIMATE.start_diff_#t~mem0=|v_ULTIMATE.start_diff_#t~mem0_4|, ULTIMATE.start_diff_#t~mem1=|v_ULTIMATE.start_diff_#t~mem1_4|} OutVars{ULTIMATE.start_diff_#t~mem0=|v_ULTIMATE.start_diff_#t~mem0_3|, ULTIMATE.start_diff_#t~mem1=|v_ULTIMATE.start_diff_#t~mem1_3|, ULTIMATE.start_diff_~found~0=v_ULTIMATE.start_diff_~found~0_6} AuxVars[] AssignedVars[ULTIMATE.start_diff_#t~mem0, ULTIMATE.start_diff_#t~mem1, ULTIMATE.start_diff_~found~0] 1656#L17-4 [127] L17-4-->L16-2: Formula: (< 0 v_ULTIMATE.start_diff_~found~0_4) InVars {ULTIMATE.start_diff_~found~0=v_ULTIMATE.start_diff_~found~0_4} OutVars{ULTIMATE.start_diff_~found~0=v_ULTIMATE.start_diff_~found~0_4} AuxVars[] AssignedVars[] 1653#L16-2 [130] L16-2-->L23-1: Formula: (< 0 v_ULTIMATE.start_diff_~found~0_8) InVars {ULTIMATE.start_diff_~found~0=v_ULTIMATE.start_diff_~found~0_8} OutVars{ULTIMATE.start_diff_~found~0=v_ULTIMATE.start_diff_~found~0_8} AuxVars[] AssignedVars[] 1644#L23-1 [74] L23-1-->L13-2: Formula: (= v_ULTIMATE.start_diff_~i~0_9 (+ v_ULTIMATE.start_diff_~i~0_10 1)) InVars {ULTIMATE.start_diff_~i~0=v_ULTIMATE.start_diff_~i~0_10} OutVars{ULTIMATE.start_diff_#t~post5=|v_ULTIMATE.start_diff_#t~post5_2|, ULTIMATE.start_diff_~i~0=v_ULTIMATE.start_diff_~i~0_9} AuxVars[] AssignedVars[ULTIMATE.start_diff_#t~post5, ULTIMATE.start_diff_~i~0] 1645#L13-2 72.80/34.79 [2019-03-28 12:50:40,476 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 72.80/34.79 [2019-03-28 12:50:40,476 INFO L82 PathProgramCache]: Analyzing trace with hash 5467621, now seen corresponding path program 1 times 72.80/34.79 [2019-03-28 12:50:40,476 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 72.80/34.79 [2019-03-28 12:50:40,476 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 72.80/34.79 [2019-03-28 12:50:40,477 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 72.80/34.79 [2019-03-28 12:50:40,477 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 72.80/34.79 [2019-03-28 12:50:40,477 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 72.80/34.79 [2019-03-28 12:50:40,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 72.80/34.79 [2019-03-28 12:50:40,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 72.80/34.79 [2019-03-28 12:50:40,488 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 72.80/34.79 [2019-03-28 12:50:40,488 INFO L82 PathProgramCache]: Analyzing trace with hash -1945236739, now seen corresponding path program 7 times 72.80/34.79 [2019-03-28 12:50:40,488 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 72.80/34.79 [2019-03-28 12:50:40,488 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 72.80/34.79 [2019-03-28 12:50:40,489 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 72.80/34.79 [2019-03-28 12:50:40,489 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 72.80/34.79 [2019-03-28 12:50:40,489 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 72.80/34.79 [2019-03-28 12:50:40,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 72.80/34.79 [2019-03-28 12:50:40,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 72.80/34.79 [2019-03-28 12:50:40,494 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 72.80/34.79 [2019-03-28 12:50:40,494 INFO L82 PathProgramCache]: Analyzing trace with hash -1181264671, now seen corresponding path program 1 times 72.80/34.79 [2019-03-28 12:50:40,494 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 72.80/34.79 [2019-03-28 12:50:40,494 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 72.80/34.79 [2019-03-28 12:50:40,495 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 72.80/34.79 [2019-03-28 12:50:40,495 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 72.80/34.79 [2019-03-28 12:50:40,495 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 72.80/34.79 [2019-03-28 12:50:40,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 72.80/34.79 [2019-03-28 12:50:40,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 72.80/34.79 [2019-03-28 12:50:40,792 WARN L188 SmtUtils]: Spent 172.00 ms on a formula simplification that was a NOOP. DAG size: 105 72.80/34.79 [2019-03-28 12:50:40,956 WARN L188 SmtUtils]: Spent 162.00 ms on a formula simplification that was a NOOP. DAG size: 101 72.80/34.79 [2019-03-28 12:50:40,959 INFO L216 LassoAnalysis]: Preferences: 72.80/34.79 [2019-03-28 12:50:40,959 INFO L124 ssoRankerPreferences]: Compute integeral hull: false 72.80/34.79 [2019-03-28 12:50:40,959 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true 72.80/34.79 [2019-03-28 12:50:40,959 INFO L126 ssoRankerPreferences]: Term annotations enabled: false 72.80/34.79 [2019-03-28 12:50:40,960 INFO L127 ssoRankerPreferences]: Use exernal solver: false 72.80/34.79 [2019-03-28 12:50:40,960 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 72.80/34.79 [2019-03-28 12:50:40,960 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false 72.80/34.79 [2019-03-28 12:50:40,960 INFO L130 ssoRankerPreferences]: Path of dumped script: 72.80/34.79 [2019-03-28 12:50:40,960 INFO L131 ssoRankerPreferences]: Filename of dumped script: theBenchmark.c_BEv2_Iteration10_Lasso 72.80/34.79 [2019-03-28 12:50:40,960 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank 72.80/34.79 [2019-03-28 12:50:40,960 INFO L282 LassoAnalysis]: Starting lasso preprocessing... 72.80/34.79 [2019-03-28 12:50:40,963 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 72.80/34.79 [2019-03-28 12:50:40,965 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 72.80/34.79 [2019-03-28 12:50:41,265 WARN L188 SmtUtils]: Spent 234.00 ms on a formula simplification. DAG size of input: 96 DAG size of output: 90 72.80/34.79 [2019-03-28 12:50:41,304 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 72.80/34.79 [2019-03-28 12:50:41,306 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 72.80/34.79 [2019-03-28 12:50:41,307 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 72.80/34.79 [2019-03-28 12:50:41,309 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 72.80/34.79 [2019-03-28 12:50:41,310 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 72.80/34.79 [2019-03-28 12:50:41,312 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 72.80/34.79 [2019-03-28 12:50:41,313 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 72.80/34.79 [2019-03-28 12:50:41,315 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 72.80/34.79 [2019-03-28 12:50:41,321 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 72.80/34.79 [2019-03-28 12:50:41,322 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 72.80/34.79 [2019-03-28 12:50:41,324 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 72.80/34.79 [2019-03-28 12:50:41,325 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 72.80/34.79 [2019-03-28 12:50:41,327 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 72.80/34.79 [2019-03-28 12:50:41,795 INFO L300 LassoAnalysis]: Preprocessing complete. 72.80/34.79 [2019-03-28 12:50:41,796 INFO L497 LassoAnalysis]: Using template 'affine'. 72.80/34.79 [2019-03-28 12:50:41,796 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 72.80/34.79 Termination analysis: LINEAR_WITH_GUESSES 72.80/34.79 Number of strict supporting invariants: 0 72.80/34.79 Number of non-strict supporting invariants: 1 72.80/34.79 Consider only non-deceasing supporting invariants: true 72.80/34.79 Simplify termination arguments: true 72.80/34.79 Simplify supporting invariants: trueOverapproximate stem: false 72.80/34.79 [2019-03-28 12:50:41,797 INFO L339 nArgumentSynthesizer]: Template has degree 0. 72.80/34.79 [2019-03-28 12:50:41,797 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 72.80/34.79 [2019-03-28 12:50:41,797 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 72.80/34.79 [2019-03-28 12:50:41,797 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 72.80/34.79 [2019-03-28 12:50:41,798 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. 72.80/34.79 [2019-03-28 12:50:41,798 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. 72.80/34.79 [2019-03-28 12:50:41,799 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 72.80/34.79 [2019-03-28 12:50:41,799 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 72.80/34.79 Termination analysis: LINEAR_WITH_GUESSES 72.80/34.79 Number of strict supporting invariants: 0 72.80/34.79 Number of non-strict supporting invariants: 1 72.80/34.79 Consider only non-deceasing supporting invariants: true 72.80/34.79 Simplify termination arguments: true 72.80/34.79 Simplify supporting invariants: trueOverapproximate stem: false 72.80/34.79 [2019-03-28 12:50:41,799 INFO L339 nArgumentSynthesizer]: Template has degree 0. 72.80/34.79 [2019-03-28 12:50:41,800 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 72.80/34.79 [2019-03-28 12:50:41,800 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 72.80/34.79 [2019-03-28 12:50:41,800 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 72.80/34.79 [2019-03-28 12:50:41,800 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. 72.80/34.79 [2019-03-28 12:50:41,801 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. 72.80/34.79 [2019-03-28 12:50:41,802 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 72.80/34.79 [2019-03-28 12:50:41,802 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 72.80/34.79 Termination analysis: LINEAR_WITH_GUESSES 72.80/34.79 Number of strict supporting invariants: 0 72.80/34.79 Number of non-strict supporting invariants: 1 72.80/34.79 Consider only non-deceasing supporting invariants: true 72.80/34.79 Simplify termination arguments: true 72.80/34.79 Simplify supporting invariants: trueOverapproximate stem: false 72.80/34.79 [2019-03-28 12:50:41,802 INFO L339 nArgumentSynthesizer]: Template has degree 0. 72.80/34.79 [2019-03-28 12:50:41,802 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 72.80/34.79 [2019-03-28 12:50:41,803 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 72.80/34.79 [2019-03-28 12:50:41,803 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 72.80/34.79 [2019-03-28 12:50:41,804 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. 72.80/34.79 [2019-03-28 12:50:41,804 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. 72.80/34.79 [2019-03-28 12:50:41,810 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 72.80/34.79 [2019-03-28 12:50:41,810 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 72.80/34.79 Termination analysis: LINEAR_WITH_GUESSES 72.80/34.79 Number of strict supporting invariants: 0 72.80/34.79 Number of non-strict supporting invariants: 1 72.80/34.79 Consider only non-deceasing supporting invariants: true 72.80/34.79 Simplify termination arguments: true 72.80/34.79 Simplify supporting invariants: trueOverapproximate stem: false 72.80/34.79 [2019-03-28 12:50:41,811 INFO L339 nArgumentSynthesizer]: Template has degree 0. 72.80/34.79 [2019-03-28 12:50:41,811 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 72.80/34.79 [2019-03-28 12:50:41,811 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 72.80/34.79 [2019-03-28 12:50:41,811 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 72.80/34.79 [2019-03-28 12:50:41,812 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. 72.80/34.79 [2019-03-28 12:50:41,812 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. 72.80/34.79 [2019-03-28 12:50:41,814 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 72.80/34.79 [2019-03-28 12:50:41,815 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 72.80/34.79 Termination analysis: LINEAR_WITH_GUESSES 72.80/34.79 Number of strict supporting invariants: 0 72.80/34.79 Number of non-strict supporting invariants: 1 72.80/34.79 Consider only non-deceasing supporting invariants: true 72.80/34.79 Simplify termination arguments: true 72.80/34.79 Simplify supporting invariants: trueOverapproximate stem: false 72.80/34.79 [2019-03-28 12:50:41,815 INFO L339 nArgumentSynthesizer]: Template has degree 0. 72.80/34.79 [2019-03-28 12:50:41,815 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 72.80/34.79 [2019-03-28 12:50:41,815 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 72.80/34.79 [2019-03-28 12:50:41,815 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 72.80/34.79 [2019-03-28 12:50:41,815 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 72.80/34.79 [2019-03-28 12:50:41,816 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 72.80/34.79 [2019-03-28 12:50:41,816 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 72.80/34.79 [2019-03-28 12:50:41,816 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 72.80/34.79 [2019-03-28 12:50:41,817 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 72.80/34.79 Termination analysis: LINEAR_WITH_GUESSES 72.80/34.79 Number of strict supporting invariants: 0 72.80/34.79 Number of non-strict supporting invariants: 1 72.80/34.79 Consider only non-deceasing supporting invariants: true 72.80/34.79 Simplify termination arguments: true 72.80/34.79 Simplify supporting invariants: trueOverapproximate stem: false 72.80/34.79 [2019-03-28 12:50:41,817 INFO L339 nArgumentSynthesizer]: Template has degree 0. 72.80/34.79 [2019-03-28 12:50:41,817 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 72.80/34.79 [2019-03-28 12:50:41,817 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 72.80/34.79 [2019-03-28 12:50:41,817 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 72.80/34.79 [2019-03-28 12:50:41,818 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. 72.80/34.79 [2019-03-28 12:50:41,818 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. 72.80/34.79 [2019-03-28 12:50:41,820 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 72.80/34.79 [2019-03-28 12:50:41,820 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 72.80/34.79 Termination analysis: LINEAR_WITH_GUESSES 72.80/34.79 Number of strict supporting invariants: 0 72.80/34.79 Number of non-strict supporting invariants: 1 72.80/34.79 Consider only non-deceasing supporting invariants: true 72.80/34.79 Simplify termination arguments: true 72.80/34.79 Simplify supporting invariants: trueOverapproximate stem: false 72.80/34.79 [2019-03-28 12:50:41,821 INFO L339 nArgumentSynthesizer]: Template has degree 0. 72.80/34.79 [2019-03-28 12:50:41,821 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 72.80/34.79 [2019-03-28 12:50:41,821 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 72.80/34.79 [2019-03-28 12:50:41,821 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 72.80/34.79 [2019-03-28 12:50:41,822 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. 72.80/34.79 [2019-03-28 12:50:41,822 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. 72.80/34.79 [2019-03-28 12:50:41,824 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 72.80/34.79 [2019-03-28 12:50:41,824 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 72.80/34.79 Termination analysis: LINEAR_WITH_GUESSES 72.80/34.79 Number of strict supporting invariants: 0 72.80/34.79 Number of non-strict supporting invariants: 1 72.80/34.79 Consider only non-deceasing supporting invariants: true 72.80/34.79 Simplify termination arguments: true 72.80/34.79 Simplify supporting invariants: trueOverapproximate stem: false 72.80/34.79 [2019-03-28 12:50:41,824 INFO L339 nArgumentSynthesizer]: Template has degree 0. 72.80/34.79 [2019-03-28 12:50:41,825 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 72.80/34.79 [2019-03-28 12:50:41,825 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 72.80/34.79 [2019-03-28 12:50:41,825 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 72.80/34.79 [2019-03-28 12:50:41,826 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. 72.80/34.79 [2019-03-28 12:50:41,826 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. 72.80/34.79 [2019-03-28 12:50:41,832 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 72.80/34.79 [2019-03-28 12:50:41,832 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 72.80/34.79 Termination analysis: LINEAR_WITH_GUESSES 72.80/34.79 Number of strict supporting invariants: 0 72.80/34.79 Number of non-strict supporting invariants: 1 72.80/34.79 Consider only non-deceasing supporting invariants: true 72.80/34.79 Simplify termination arguments: true 72.80/34.79 Simplify supporting invariants: trueOverapproximate stem: false 72.80/34.79 [2019-03-28 12:50:41,833 INFO L339 nArgumentSynthesizer]: Template has degree 0. 72.80/34.79 [2019-03-28 12:50:41,833 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 72.80/34.79 [2019-03-28 12:50:41,833 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 72.80/34.79 [2019-03-28 12:50:41,833 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 72.80/34.79 [2019-03-28 12:50:41,835 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. 72.80/34.79 [2019-03-28 12:50:41,835 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. 72.80/34.79 [2019-03-28 12:50:41,843 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. 72.80/34.79 [2019-03-28 12:50:41,850 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. 72.80/34.79 [2019-03-28 12:50:41,850 INFO L444 ModelExtractionUtils]: 35 out of 40 variables were initially zero. Simplification set additionally 1 variables to zero. 72.80/34.79 [2019-03-28 12:50:41,851 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... 72.80/34.79 [2019-03-28 12:50:41,851 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. 72.80/34.79 [2019-03-28 12:50:41,852 INFO L518 LassoAnalysis]: Proved termination. 72.80/34.79 [2019-03-28 12:50:41,852 INFO L520 LassoAnalysis]: Termination argument consisting of: 72.80/34.79 Ranking function f(ULTIMATE.start_diff_~i~0, v_rep(select #length ULTIMATE.start_diff_~A.base)_7, ULTIMATE.start_diff_~A.offset) = -4*ULTIMATE.start_diff_~i~0 + 1*v_rep(select #length ULTIMATE.start_diff_~A.base)_7 - 1*ULTIMATE.start_diff_~A.offset 72.80/34.79 Supporting invariants [] 72.80/34.79 [2019-03-28 12:50:41,902 INFO L297 tatePredicateManager]: 15 out of 15 supporting invariants were superfluous and have been removed 72.80/34.79 [2019-03-28 12:50:41,903 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 72.80/34.79 [2019-03-28 12:50:41,917 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 72.80/34.79 [2019-03-28 12:50:41,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 72.80/34.79 [2019-03-28 12:50:41,933 INFO L256 TraceCheckSpWp]: Trace formula consists of 83 conjuncts, 2 conjunts are in the unsatisfiable core 72.80/34.79 [2019-03-28 12:50:41,934 INFO L279 TraceCheckSpWp]: Computing forward predicates... 72.80/34.79 [2019-03-28 12:50:41,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 72.80/34.79 [2019-03-28 12:50:41,941 INFO L256 TraceCheckSpWp]: Trace formula consists of 30 conjuncts, 4 conjunts are in the unsatisfiable core 72.80/34.79 [2019-03-28 12:50:41,941 INFO L279 TraceCheckSpWp]: Computing forward predicates... 72.80/34.79 [2019-03-28 12:50:41,952 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 72.80/34.79 [2019-03-28 12:50:41,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 72.80/34.79 [2019-03-28 12:50:41,985 INFO L256 TraceCheckSpWp]: Trace formula consists of 30 conjuncts, 4 conjunts are in the unsatisfiable core 72.80/34.79 [2019-03-28 12:50:41,985 INFO L279 TraceCheckSpWp]: Computing forward predicates... 72.80/34.79 [2019-03-28 12:50:42,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 72.80/34.79 [2019-03-28 12:50:42,018 INFO L256 TraceCheckSpWp]: Trace formula consists of 30 conjuncts, 4 conjunts are in the unsatisfiable core 72.80/34.79 [2019-03-28 12:50:42,019 INFO L279 TraceCheckSpWp]: Computing forward predicates... 72.80/34.79 [2019-03-28 12:50:42,052 INFO L98 LoopCannibalizer]: 2 predicates before loop cannibalization 3 predicates after loop cannibalization 72.80/34.79 [2019-03-28 12:50:42,052 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 72.80/34.79 [2019-03-28 12:50:42,053 INFO L69 BuchiDifferenceNCSB]: Start buchiDifferenceNCSB. First operand 41 states and 72 transitions. cyclomatic complexity: 34 Second operand 4 states. 72.80/34.79 [2019-03-28 12:50:42,124 INFO L73 BuchiDifferenceNCSB]: Finished buchiDifferenceNCSB. First operand 41 states and 72 transitions. cyclomatic complexity: 34. Second operand 4 states. Result 75 states and 125 transitions. Complement of second has 6 states. 72.80/34.79 [2019-03-28 12:50:42,125 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 72.89/34.79 [2019-03-28 12:50:42,125 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. 72.89/34.79 [2019-03-28 12:50:42,126 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 44 transitions. 72.89/34.79 [2019-03-28 12:50:42,126 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 44 transitions. Stem has 4 letters. Loop has 8 letters. 72.89/34.79 [2019-03-28 12:50:42,126 INFO L116 BuchiAccepts]: Finished buchiAccepts. 72.89/34.79 [2019-03-28 12:50:42,126 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 44 transitions. Stem has 12 letters. Loop has 8 letters. 72.89/34.79 [2019-03-28 12:50:42,126 INFO L116 BuchiAccepts]: Finished buchiAccepts. 72.89/34.79 [2019-03-28 12:50:42,126 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 44 transitions. Stem has 4 letters. Loop has 16 letters. 72.89/34.79 [2019-03-28 12:50:42,127 INFO L116 BuchiAccepts]: Finished buchiAccepts. 72.89/34.79 [2019-03-28 12:50:42,131 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 75 states and 125 transitions. 72.89/34.79 [2019-03-28 12:50:42,131 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 29 72.89/34.79 [2019-03-28 12:50:42,132 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 75 states to 70 states and 116 transitions. 72.89/34.79 [2019-03-28 12:50:42,132 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 36 72.89/34.79 [2019-03-28 12:50:42,133 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 37 72.89/34.79 [2019-03-28 12:50:42,133 INFO L73 IsDeterministic]: Start isDeterministic. Operand 70 states and 116 transitions. 72.89/34.79 [2019-03-28 12:50:42,133 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. 72.89/34.79 [2019-03-28 12:50:42,133 INFO L706 BuchiCegarLoop]: Abstraction has 70 states and 116 transitions. 72.89/34.79 [2019-03-28 12:50:42,133 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states and 116 transitions. 72.89/34.79 [2019-03-28 12:50:42,134 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 41. 72.89/34.79 [2019-03-28 12:50:42,135 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. 72.89/34.79 [2019-03-28 12:50:42,135 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 72 transitions. 72.89/34.79 [2019-03-28 12:50:42,135 INFO L729 BuchiCegarLoop]: Abstraction has 41 states and 72 transitions. 72.89/34.79 [2019-03-28 12:50:42,135 INFO L609 BuchiCegarLoop]: Abstraction has 41 states and 72 transitions. 72.89/34.79 [2019-03-28 12:50:42,135 INFO L442 BuchiCegarLoop]: ======== Iteration 11============ 72.89/34.79 [2019-03-28 12:50:42,135 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 41 states and 72 transitions. 72.89/34.79 [2019-03-28 12:50:42,136 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 20 72.89/34.79 [2019-03-28 12:50:42,136 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false 72.89/34.79 [2019-03-28 12:50:42,136 INFO L119 BuchiIsEmpty]: Starting construction of run 72.89/34.79 [2019-03-28 12:50:42,136 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] 72.89/34.79 [2019-03-28 12:50:42,136 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1] 72.89/34.79 [2019-03-28 12:50:42,137 INFO L794 eck$LassoCheckResult]: Stem: 1917#ULTIMATE.startENTRY [150] ULTIMATE.startENTRY-->L34: Formula: (and (= |v_#NULL.offset_2| 0) (= (store |v_#valid_20| 0 0) |v_#valid_19|) (= 0 |v_#NULL.base_2|)) InVars {#valid=|v_#valid_20|} OutVars{ULTIMATE.start_main_#t~malloc8.base=|v_ULTIMATE.start_main_#t~malloc8.base_5|, ULTIMATE.start_main_#t~malloc9.base=|v_ULTIMATE.start_main_#t~malloc9.base_5|, ULTIMATE.start_main_~A~0.base=v_ULTIMATE.start_main_~A~0.base_3, ULTIMATE.start_main_~B~0.offset=v_ULTIMATE.start_main_~B~0.offset_3, #NULL.offset=|v_#NULL.offset_2|, ULTIMATE.start_main_#t~nondet6=|v_ULTIMATE.start_main_#t~nondet6_6|, ULTIMATE.start_main_#t~nondet7=|v_ULTIMATE.start_main_#t~nondet7_6|, ULTIMATE.start_main_~B~0.base=v_ULTIMATE.start_main_~B~0.base_3, #NULL.base=|v_#NULL.base_2|, ULTIMATE.start_main_~D~0.offset=v_ULTIMATE.start_main_~D~0.offset_3, ULTIMATE.start_main_#t~malloc10.base=|v_ULTIMATE.start_main_#t~malloc10.base_5|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_4|, ULTIMATE.start_main_#t~malloc8.offset=|v_ULTIMATE.start_main_#t~malloc8.offset_5|, #valid=|v_#valid_19|, ULTIMATE.start_main_#t~malloc9.offset=|v_ULTIMATE.start_main_#t~malloc9.offset_5|, ULTIMATE.start_main_~D~0.base=v_ULTIMATE.start_main_~D~0.base_3, ULTIMATE.start_main_~A~0.offset=v_ULTIMATE.start_main_~A~0.offset_3, ULTIMATE.start_main_~Blen~0=v_ULTIMATE.start_main_~Blen~0_8, ULTIMATE.start_main_~Alen~0=v_ULTIMATE.start_main_~Alen~0_8, ULTIMATE.start_main_#t~malloc10.offset=|v_ULTIMATE.start_main_#t~malloc10.offset_5|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~malloc8.base, ULTIMATE.start_main_#t~malloc9.base, ULTIMATE.start_main_~A~0.base, ULTIMATE.start_main_~B~0.offset, #NULL.offset, ULTIMATE.start_main_#t~nondet6, ULTIMATE.start_main_#t~nondet7, ULTIMATE.start_main_~B~0.base, #NULL.base, ULTIMATE.start_main_~D~0.offset, ULTIMATE.start_main_#t~malloc10.base, ULTIMATE.start_main_#res, ULTIMATE.start_main_#t~malloc8.offset, #valid, ULTIMATE.start_main_#t~malloc9.offset, ULTIMATE.start_main_~D~0.base, ULTIMATE.start_main_~A~0.offset, ULTIMATE.start_main_~Blen~0, ULTIMATE.start_main_~Alen~0, ULTIMATE.start_main_#t~malloc10.offset] 1918#L34 [75] L34-->L34-2: Formula: (and (< v_ULTIMATE.start_main_~Alen~0_5 1) (= v_ULTIMATE.start_main_~Alen~0_4 1)) InVars {ULTIMATE.start_main_~Alen~0=v_ULTIMATE.start_main_~Alen~0_5} OutVars{ULTIMATE.start_main_~Alen~0=v_ULTIMATE.start_main_~Alen~0_4} AuxVars[] AssignedVars[ULTIMATE.start_main_~Alen~0] 1919#L34-2 [105] L34-2-->L37-1: Formula: (>= v_ULTIMATE.start_main_~Blen~0_6 1) InVars {ULTIMATE.start_main_~Blen~0=v_ULTIMATE.start_main_~Blen~0_6} OutVars{ULTIMATE.start_main_~Blen~0=v_ULTIMATE.start_main_~Blen~0_6} AuxVars[] AssignedVars[] 1920#L37-1 [119] L37-1-->L13-2: Formula: (let ((.cse2 (store |v_#valid_10| |v_ULTIMATE.start_main_#t~malloc8.base_4| 1))) (let ((.cse0 (store .cse2 |v_ULTIMATE.start_main_#t~malloc9.base_4| 1))) (and (= v_ULTIMATE.start_diff_~k~0_1 0) (= v_ULTIMATE.start_diff_~l2~0_1 v_ULTIMATE.start_diff_~Blen_1) (= v_ULTIMATE.start_diff_~A.base_1 |v_ULTIMATE.start_diff_#in~A.base_1|) (= |v_#valid_7| (store .cse0 |v_ULTIMATE.start_main_#t~malloc10.base_4| 1)) (< |v_ULTIMATE.start_main_#t~malloc10.base_4| |v_#StackHeapBarrier_1|) (= v_ULTIMATE.start_diff_~Blen_1 |v_ULTIMATE.start_diff_#in~Blen_1|) (= v_ULTIMATE.start_diff_~B.base_1 |v_ULTIMATE.start_diff_#in~B.base_1|) (= v_ULTIMATE.start_diff_~Alen_1 |v_ULTIMATE.start_diff_#in~Alen_1|) (= v_ULTIMATE.start_main_~B~0.offset_2 |v_ULTIMATE.start_main_#t~malloc9.offset_4|) (= v_ULTIMATE.start_main_~B~0.base_2 |v_ULTIMATE.start_main_#t~malloc9.base_4|) (= |v_ULTIMATE.start_diff_#in~A.base_1| v_ULTIMATE.start_main_~A~0.base_2) (= |v_ULTIMATE.start_main_#t~malloc8.offset_4| 0) (> |v_ULTIMATE.start_main_#t~malloc10.base_4| 0) (= |v_#length_1| (let ((.cse1 (* 4 v_ULTIMATE.start_main_~Alen~0_7))) (store (store (store |v_#length_4| |v_ULTIMATE.start_main_#t~malloc8.base_4| .cse1) |v_ULTIMATE.start_main_#t~malloc9.base_4| (* 4 v_ULTIMATE.start_main_~Blen~0_7)) |v_ULTIMATE.start_main_#t~malloc10.base_4| .cse1))) (= v_ULTIMATE.start_diff_~D.base_1 |v_ULTIMATE.start_diff_#in~D.base_1|) (= |v_ULTIMATE.start_main_#t~malloc9.offset_4| 0) (= |v_ULTIMATE.start_diff_#in~B.offset_1| v_ULTIMATE.start_main_~B~0.offset_2) (= |v_ULTIMATE.start_diff_#in~A.offset_1| v_ULTIMATE.start_main_~A~0.offset_2) (= v_ULTIMATE.start_diff_~B.offset_1 |v_ULTIMATE.start_diff_#in~B.offset_1|) (= v_ULTIMATE.start_main_~A~0.base_2 |v_ULTIMATE.start_main_#t~malloc8.base_4|) (< |v_ULTIMATE.start_main_#t~malloc8.base_4| |v_#StackHeapBarrier_1|) (= |v_ULTIMATE.start_diff_#in~B.base_1| v_ULTIMATE.start_main_~B~0.base_2) (< |v_ULTIMATE.start_main_#t~malloc9.base_4| |v_#StackHeapBarrier_1|) (= |v_ULTIMATE.start_diff_#in~D.offset_1| v_ULTIMATE.start_main_~D~0.offset_2) (= v_ULTIMATE.start_main_~D~0.offset_2 |v_ULTIMATE.start_main_#t~malloc10.offset_4|) (= v_ULTIMATE.start_diff_~i~0_1 0) (= 0 (select .cse2 |v_ULTIMATE.start_main_#t~malloc9.base_4|)) (= v_ULTIMATE.start_main_~D~0.base_2 |v_ULTIMATE.start_main_#t~malloc10.base_4|) (= |v_ULTIMATE.start_diff_#in~Blen_1| v_ULTIMATE.start_main_~Blen~0_7) (= v_ULTIMATE.start_diff_~l1~0_1 v_ULTIMATE.start_diff_~Alen_1) (= 0 (select .cse0 |v_ULTIMATE.start_main_#t~malloc10.base_4|)) (= (select |v_#valid_10| |v_ULTIMATE.start_main_#t~malloc8.base_4|) 0) (= v_ULTIMATE.start_diff_~A.offset_1 |v_ULTIMATE.start_diff_#in~A.offset_1|) (< |v_ULTIMATE.start_main_#t~malloc8.base_4| 0) (= |v_ULTIMATE.start_diff_#in~Alen_1| v_ULTIMATE.start_main_~Alen~0_7) (> 0 |v_ULTIMATE.start_main_#t~malloc9.base_4|) (= v_ULTIMATE.start_main_~A~0.offset_2 |v_ULTIMATE.start_main_#t~malloc8.offset_4|) (= |v_ULTIMATE.start_main_#t~malloc10.offset_4| 0) (= |v_ULTIMATE.start_diff_#in~D.base_1| v_ULTIMATE.start_main_~D~0.base_2) (= v_ULTIMATE.start_diff_~D.offset_1 |v_ULTIMATE.start_diff_#in~D.offset_1|)))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_4|, #valid=|v_#valid_10|, ULTIMATE.start_main_~Blen~0=v_ULTIMATE.start_main_~Blen~0_7, ULTIMATE.start_main_~Alen~0=v_ULTIMATE.start_main_~Alen~0_7} OutVars{ULTIMATE.start_diff_#in~A.base=|v_ULTIMATE.start_diff_#in~A.base_1|, ULTIMATE.start_diff_#in~B.base=|v_ULTIMATE.start_diff_#in~B.base_1|, ULTIMATE.start_diff_~B.offset=v_ULTIMATE.start_diff_~B.offset_1, ULTIMATE.start_diff_~Alen=v_ULTIMATE.start_diff_~Alen_1, ULTIMATE.start_diff_~D.base=v_ULTIMATE.start_diff_~D.base_1, ULTIMATE.start_diff_#in~Blen=|v_ULTIMATE.start_diff_#in~Blen_1|, ULTIMATE.start_main_~B~0.offset=v_ULTIMATE.start_main_~B~0.offset_2, ULTIMATE.start_main_~B~0.base=v_ULTIMATE.start_main_~B~0.base_2, ULTIMATE.start_diff_#in~A.offset=|v_ULTIMATE.start_diff_#in~A.offset_1|, ULTIMATE.start_main_~D~0.offset=v_ULTIMATE.start_main_~D~0.offset_2, ULTIMATE.start_diff_#in~D.offset=|v_ULTIMATE.start_diff_#in~D.offset_1|, ULTIMATE.start_diff_#in~Alen=|v_ULTIMATE.start_diff_#in~Alen_1|, ULTIMATE.start_diff_~A.base=v_ULTIMATE.start_diff_~A.base_1, ULTIMATE.start_diff_~B.base=v_ULTIMATE.start_diff_~B.base_1, #length=|v_#length_1|, ULTIMATE.start_main_#t~malloc9.offset=|v_ULTIMATE.start_main_#t~malloc9.offset_4|, ULTIMATE.start_diff_#t~mem3=|v_ULTIMATE.start_diff_#t~mem3_1|, ULTIMATE.start_main_~A~0.offset=v_ULTIMATE.start_main_~A~0.offset_2, ULTIMATE.start_main_#t~malloc10.offset=|v_ULTIMATE.start_main_#t~malloc10.offset_4|, ULTIMATE.start_main_~Blen~0=v_ULTIMATE.start_main_~Blen~0_7, ULTIMATE.start_main_~Alen~0=v_ULTIMATE.start_main_~Alen~0_7, ULTIMATE.start_diff_~Blen=v_ULTIMATE.start_diff_~Blen_1, ULTIMATE.start_main_#t~malloc8.base=|v_ULTIMATE.start_main_#t~malloc8.base_4|, ULTIMATE.start_diff_#t~mem0=|v_ULTIMATE.start_diff_#t~mem0_1|, ULTIMATE.start_main_#t~malloc9.base=|v_ULTIMATE.start_main_#t~malloc9.base_4|, ULTIMATE.start_diff_#t~mem1=|v_ULTIMATE.start_diff_#t~mem1_1|, ULTIMATE.start_main_~A~0.base=v_ULTIMATE.start_main_~A~0.base_2, ULTIMATE.start_diff_#t~post4=|v_ULTIMATE.start_diff_#t~post4_1|, ULTIMATE.start_diff_~found~0=v_ULTIMATE.start_diff_~found~0_1, ULTIMATE.start_diff_#in~B.offset=|v_ULTIMATE.start_diff_#in~B.offset_1|, ULTIMATE.start_diff_~i~0=v_ULTIMATE.start_diff_~i~0_1, ULTIMATE.start_diff_~l1~0=v_ULTIMATE.start_diff_~l1~0_1, ULTIMATE.start_diff_#t~post5=|v_ULTIMATE.start_diff_#t~post5_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, ULTIMATE.start_main_#t~malloc10.base=|v_ULTIMATE.start_main_#t~malloc10.base_4|, ULTIMATE.start_diff_~D.offset=v_ULTIMATE.start_diff_~D.offset_1, ULTIMATE.start_diff_~l2~0=v_ULTIMATE.start_diff_~l2~0_1, ULTIMATE.start_diff_~j~0=v_ULTIMATE.start_diff_~j~0_1, ULTIMATE.start_main_#t~malloc8.offset=|v_ULTIMATE.start_main_#t~malloc8.offset_4|, #valid=|v_#valid_7|, ULTIMATE.start_diff_~k~0=v_ULTIMATE.start_diff_~k~0_1, ULTIMATE.start_diff_#in~D.base=|v_ULTIMATE.start_diff_#in~D.base_1|, ULTIMATE.start_diff_#t~post2=|v_ULTIMATE.start_diff_#t~post2_1|, ULTIMATE.start_diff_~A.offset=v_ULTIMATE.start_diff_~A.offset_1, ULTIMATE.start_main_~D~0.base=v_ULTIMATE.start_main_~D~0.base_2} AuxVars[] AssignedVars[ULTIMATE.start_diff_#in~A.base, ULTIMATE.start_diff_#in~B.base, ULTIMATE.start_diff_~B.offset, ULTIMATE.start_diff_~Alen, ULTIMATE.start_diff_~D.base, ULTIMATE.start_diff_#in~Blen, ULTIMATE.start_main_~B~0.offset, ULTIMATE.start_main_~B~0.base, ULTIMATE.start_diff_#in~A.offset, ULTIMATE.start_main_~D~0.offset, ULTIMATE.start_diff_#in~D.offset, ULTIMATE.start_diff_#in~Alen, ULTIMATE.start_diff_~A.base, ULTIMATE.start_diff_~B.base, #length, ULTIMATE.start_main_#t~malloc9.offset, ULTIMATE.start_diff_#t~mem3, ULTIMATE.start_main_~A~0.offset, ULTIMATE.start_main_#t~malloc10.offset, ULTIMATE.start_diff_~Blen, ULTIMATE.start_main_#t~malloc8.base, ULTIMATE.start_diff_#t~mem0, ULTIMATE.start_main_#t~malloc9.base, ULTIMATE.start_diff_#t~mem1, ULTIMATE.start_main_~A~0.base, ULTIMATE.start_diff_#t~post4, ULTIMATE.start_diff_~found~0, ULTIMATE.start_diff_#in~B.offset, ULTIMATE.start_diff_~i~0, ULTIMATE.start_diff_~l1~0, ULTIMATE.start_diff_#t~post5, ULTIMATE.start_main_#t~malloc10.base, ULTIMATE.start_diff_~D.offset, ULTIMATE.start_diff_~l2~0, ULTIMATE.start_diff_~j~0, ULTIMATE.start_main_#t~malloc8.offset, #valid, ULTIMATE.start_diff_~k~0, ULTIMATE.start_diff_#in~D.base, ULTIMATE.start_diff_#t~post2, ULTIMATE.start_diff_~A.offset, ULTIMATE.start_main_~D~0.base] 1925#L13-2 72.89/34.79 [2019-03-28 12:50:42,137 INFO L796 eck$LassoCheckResult]: Loop: 1925#L13-2 [91] L13-2-->L17-4: Formula: (and (< v_ULTIMATE.start_diff_~i~0_4 v_ULTIMATE.start_diff_~l1~0_4) (= v_ULTIMATE.start_diff_~j~0_2 0) (= v_ULTIMATE.start_diff_~found~0_3 0)) InVars {ULTIMATE.start_diff_~i~0=v_ULTIMATE.start_diff_~i~0_4, ULTIMATE.start_diff_~l1~0=v_ULTIMATE.start_diff_~l1~0_4} OutVars{ULTIMATE.start_diff_~found~0=v_ULTIMATE.start_diff_~found~0_3, ULTIMATE.start_diff_~i~0=v_ULTIMATE.start_diff_~i~0_4, ULTIMATE.start_diff_~l1~0=v_ULTIMATE.start_diff_~l1~0_4, ULTIMATE.start_diff_~j~0=v_ULTIMATE.start_diff_~j~0_2} AuxVars[] AssignedVars[ULTIMATE.start_diff_~found~0, ULTIMATE.start_diff_~j~0] 1943#L17-4 [99] L17-4-->L17: Formula: (and (= 0 v_ULTIMATE.start_diff_~found~0_5) (< v_ULTIMATE.start_diff_~j~0_4 v_ULTIMATE.start_diff_~l2~0_4)) InVars {ULTIMATE.start_diff_~found~0=v_ULTIMATE.start_diff_~found~0_5, ULTIMATE.start_diff_~j~0=v_ULTIMATE.start_diff_~j~0_4, ULTIMATE.start_diff_~l2~0=v_ULTIMATE.start_diff_~l2~0_4} OutVars{ULTIMATE.start_diff_~found~0=v_ULTIMATE.start_diff_~found~0_5, ULTIMATE.start_diff_~j~0=v_ULTIMATE.start_diff_~j~0_4, ULTIMATE.start_diff_~l2~0=v_ULTIMATE.start_diff_~l2~0_4} AuxVars[] AssignedVars[] 1937#L17 [85] L17-->L17-1: Formula: (let ((.cse0 (* 4 v_ULTIMATE.start_diff_~i~0_5))) (let ((.cse1 (+ .cse0 v_ULTIMATE.start_diff_~A.offset_3))) (and (<= (+ .cse0 v_ULTIMATE.start_diff_~A.offset_3 4) (select |v_#length_5| v_ULTIMATE.start_diff_~A.base_3)) (= 1 (select |v_#valid_11| v_ULTIMATE.start_diff_~A.base_3)) (= (select (select |v_#memory_int_1| v_ULTIMATE.start_diff_~A.base_3) .cse1) |v_ULTIMATE.start_diff_#t~mem0_2|) (<= 0 .cse1)))) InVars {ULTIMATE.start_diff_~i~0=v_ULTIMATE.start_diff_~i~0_5, ULTIMATE.start_diff_~A.base=v_ULTIMATE.start_diff_~A.base_3, #valid=|v_#valid_11|, #memory_int=|v_#memory_int_1|, #length=|v_#length_5|, ULTIMATE.start_diff_~A.offset=v_ULTIMATE.start_diff_~A.offset_3} OutVars{ULTIMATE.start_diff_#t~mem0=|v_ULTIMATE.start_diff_#t~mem0_2|, ULTIMATE.start_diff_~i~0=v_ULTIMATE.start_diff_~i~0_5, ULTIMATE.start_diff_~A.base=v_ULTIMATE.start_diff_~A.base_3, #valid=|v_#valid_11|, #memory_int=|v_#memory_int_1|, #length=|v_#length_5|, ULTIMATE.start_diff_~A.offset=v_ULTIMATE.start_diff_~A.offset_3} AuxVars[] AssignedVars[ULTIMATE.start_diff_#t~mem0] 1942#L17-1 [82] L17-1-->L17-2: Formula: (let ((.cse1 (* 4 v_ULTIMATE.start_diff_~j~0_5))) (let ((.cse0 (+ v_ULTIMATE.start_diff_~B.offset_3 .cse1))) (and (<= 0 .cse0) (= 1 (select |v_#valid_13| v_ULTIMATE.start_diff_~B.base_3)) (= (select (select |v_#memory_int_2| v_ULTIMATE.start_diff_~B.base_3) .cse0) |v_ULTIMATE.start_diff_#t~mem1_2|) (<= (+ v_ULTIMATE.start_diff_~B.offset_3 .cse1 4) (select |v_#length_7| v_ULTIMATE.start_diff_~B.base_3))))) InVars {ULTIMATE.start_diff_~B.offset=v_ULTIMATE.start_diff_~B.offset_3, ULTIMATE.start_diff_~j~0=v_ULTIMATE.start_diff_~j~0_5, #valid=|v_#valid_13|, ULTIMATE.start_diff_~B.base=v_ULTIMATE.start_diff_~B.base_3, #memory_int=|v_#memory_int_2|, #length=|v_#length_7|} OutVars{ULTIMATE.start_diff_#t~mem1=|v_ULTIMATE.start_diff_#t~mem1_2|, ULTIMATE.start_diff_~B.offset=v_ULTIMATE.start_diff_~B.offset_3, ULTIMATE.start_diff_~j~0=v_ULTIMATE.start_diff_~j~0_5, #valid=|v_#valid_13|, ULTIMATE.start_diff_~B.base=v_ULTIMATE.start_diff_~B.base_3, #memory_int=|v_#memory_int_2|, #length=|v_#length_7|} AuxVars[] AssignedVars[ULTIMATE.start_diff_#t~mem1] 1940#L17-2 [80] L17-2-->L17-4: Formula: (and (= |v_ULTIMATE.start_diff_#t~mem1_4| |v_ULTIMATE.start_diff_#t~mem0_4|) (= v_ULTIMATE.start_diff_~found~0_6 1)) InVars {ULTIMATE.start_diff_#t~mem0=|v_ULTIMATE.start_diff_#t~mem0_4|, ULTIMATE.start_diff_#t~mem1=|v_ULTIMATE.start_diff_#t~mem1_4|} OutVars{ULTIMATE.start_diff_#t~mem0=|v_ULTIMATE.start_diff_#t~mem0_3|, ULTIMATE.start_diff_#t~mem1=|v_ULTIMATE.start_diff_#t~mem1_3|, ULTIMATE.start_diff_~found~0=v_ULTIMATE.start_diff_~found~0_6} AuxVars[] AssignedVars[ULTIMATE.start_diff_#t~mem0, ULTIMATE.start_diff_#t~mem1, ULTIMATE.start_diff_~found~0] 1936#L17-4 [127] L17-4-->L16-2: Formula: (< 0 v_ULTIMATE.start_diff_~found~0_4) InVars {ULTIMATE.start_diff_~found~0=v_ULTIMATE.start_diff_~found~0_4} OutVars{ULTIMATE.start_diff_~found~0=v_ULTIMATE.start_diff_~found~0_4} AuxVars[] AssignedVars[] 1933#L16-2 [130] L16-2-->L23-1: Formula: (< 0 v_ULTIMATE.start_diff_~found~0_8) InVars {ULTIMATE.start_diff_~found~0=v_ULTIMATE.start_diff_~found~0_8} OutVars{ULTIMATE.start_diff_~found~0=v_ULTIMATE.start_diff_~found~0_8} AuxVars[] AssignedVars[] 1924#L23-1 [74] L23-1-->L13-2: Formula: (= v_ULTIMATE.start_diff_~i~0_9 (+ v_ULTIMATE.start_diff_~i~0_10 1)) InVars {ULTIMATE.start_diff_~i~0=v_ULTIMATE.start_diff_~i~0_10} OutVars{ULTIMATE.start_diff_#t~post5=|v_ULTIMATE.start_diff_#t~post5_2|, ULTIMATE.start_diff_~i~0=v_ULTIMATE.start_diff_~i~0_9} AuxVars[] AssignedVars[ULTIMATE.start_diff_#t~post5, ULTIMATE.start_diff_~i~0] 1925#L13-2 72.89/34.79 [2019-03-28 12:50:42,138 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 72.89/34.79 [2019-03-28 12:50:42,138 INFO L82 PathProgramCache]: Analyzing trace with hash 5467620, now seen corresponding path program 1 times 72.89/34.79 [2019-03-28 12:50:42,138 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 72.89/34.79 [2019-03-28 12:50:42,138 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 72.89/34.79 [2019-03-28 12:50:42,139 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 72.89/34.79 [2019-03-28 12:50:42,139 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 72.89/34.79 [2019-03-28 12:50:42,139 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 72.89/34.79 [2019-03-28 12:50:42,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 72.89/34.79 [2019-03-28 12:50:42,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 72.89/34.79 [2019-03-28 12:50:42,147 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 72.89/34.79 [2019-03-28 12:50:42,147 INFO L82 PathProgramCache]: Analyzing trace with hash -1945236739, now seen corresponding path program 8 times 72.89/34.79 [2019-03-28 12:50:42,147 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 72.89/34.79 [2019-03-28 12:50:42,147 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 72.89/34.79 [2019-03-28 12:50:42,148 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 72.89/34.79 [2019-03-28 12:50:42,148 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 72.89/34.79 [2019-03-28 12:50:42,148 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 72.89/34.79 [2019-03-28 12:50:42,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 72.89/34.79 [2019-03-28 12:50:42,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 72.89/34.79 [2019-03-28 12:50:42,152 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 72.89/34.79 [2019-03-28 12:50:42,153 INFO L82 PathProgramCache]: Analyzing trace with hash 626189792, now seen corresponding path program 1 times 72.89/34.79 [2019-03-28 12:50:42,153 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 72.89/34.79 [2019-03-28 12:50:42,153 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 72.89/34.79 [2019-03-28 12:50:42,153 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 72.89/34.79 [2019-03-28 12:50:42,154 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY 72.89/34.79 [2019-03-28 12:50:42,154 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 72.89/34.79 [2019-03-28 12:50:42,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 72.89/34.79 [2019-03-28 12:50:42,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 72.89/34.79 [2019-03-28 12:50:42,599 WARN L188 SmtUtils]: Spent 311.00 ms on a formula simplification. DAG size of input: 105 DAG size of output: 103 72.89/34.79 [2019-03-28 12:50:42,739 WARN L188 SmtUtils]: Spent 138.00 ms on a formula simplification that was a NOOP. DAG size: 99 72.89/34.79 [2019-03-28 12:50:42,741 INFO L216 LassoAnalysis]: Preferences: 72.89/34.79 [2019-03-28 12:50:42,741 INFO L124 ssoRankerPreferences]: Compute integeral hull: false 72.89/34.79 [2019-03-28 12:50:42,741 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true 72.89/34.79 [2019-03-28 12:50:42,741 INFO L126 ssoRankerPreferences]: Term annotations enabled: false 72.89/34.79 [2019-03-28 12:50:42,741 INFO L127 ssoRankerPreferences]: Use exernal solver: false 72.89/34.79 [2019-03-28 12:50:42,741 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 72.89/34.79 [2019-03-28 12:50:42,741 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false 72.89/34.79 [2019-03-28 12:50:42,742 INFO L130 ssoRankerPreferences]: Path of dumped script: 72.89/34.79 [2019-03-28 12:50:42,742 INFO L131 ssoRankerPreferences]: Filename of dumped script: theBenchmark.c_BEv2_Iteration11_Lasso 72.89/34.79 [2019-03-28 12:50:42,742 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank 72.89/34.79 [2019-03-28 12:50:42,742 INFO L282 LassoAnalysis]: Starting lasso preprocessing... 72.89/34.79 [2019-03-28 12:50:42,744 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 72.89/34.79 [2019-03-28 12:50:43,025 WARN L188 SmtUtils]: Spent 217.00 ms on a formula simplification. DAG size of input: 94 DAG size of output: 88 72.89/34.79 [2019-03-28 12:50:43,064 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 72.89/34.79 [2019-03-28 12:50:43,065 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 72.89/34.79 [2019-03-28 12:50:43,067 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 72.89/34.79 [2019-03-28 12:50:43,069 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 72.89/34.79 [2019-03-28 12:50:43,071 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 72.89/34.79 [2019-03-28 12:50:43,072 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 72.89/34.79 [2019-03-28 12:50:43,075 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 72.89/34.79 [2019-03-28 12:50:43,076 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 72.89/34.79 [2019-03-28 12:50:43,077 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 72.89/34.79 [2019-03-28 12:50:43,084 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 72.89/34.79 [2019-03-28 12:50:43,085 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 72.89/34.79 [2019-03-28 12:50:43,087 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 72.89/34.79 [2019-03-28 12:50:43,088 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 72.89/34.79 [2019-03-28 12:50:43,089 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 72.89/34.79 [2019-03-28 12:50:43,494 INFO L300 LassoAnalysis]: Preprocessing complete. 72.89/34.79 [2019-03-28 12:50:43,494 INFO L497 LassoAnalysis]: Using template 'affine'. 72.89/34.79 [2019-03-28 12:50:43,494 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 72.89/34.79 Termination analysis: LINEAR_WITH_GUESSES 72.89/34.79 Number of strict supporting invariants: 0 72.89/34.79 Number of non-strict supporting invariants: 1 72.89/34.79 Consider only non-deceasing supporting invariants: true 72.89/34.79 Simplify termination arguments: true 72.89/34.79 Simplify supporting invariants: trueOverapproximate stem: false 72.89/34.79 [2019-03-28 12:50:43,495 INFO L339 nArgumentSynthesizer]: Template has degree 0. 72.89/34.79 [2019-03-28 12:50:43,495 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 72.89/34.79 [2019-03-28 12:50:43,495 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 72.89/34.79 [2019-03-28 12:50:43,495 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 72.89/34.79 [2019-03-28 12:50:43,497 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. 72.89/34.79 [2019-03-28 12:50:43,497 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. 72.89/34.79 [2019-03-28 12:50:43,502 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 72.89/34.79 [2019-03-28 12:50:43,503 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 72.89/34.79 Termination analysis: LINEAR_WITH_GUESSES 72.89/34.79 Number of strict supporting invariants: 0 72.89/34.79 Number of non-strict supporting invariants: 1 72.89/34.79 Consider only non-deceasing supporting invariants: true 72.89/34.79 Simplify termination arguments: true 72.89/34.79 Simplify supporting invariants: trueOverapproximate stem: false 72.89/34.79 [2019-03-28 12:50:43,503 INFO L339 nArgumentSynthesizer]: Template has degree 0. 72.89/34.79 [2019-03-28 12:50:43,503 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 72.89/34.79 [2019-03-28 12:50:43,503 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 72.89/34.79 [2019-03-28 12:50:43,503 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 72.89/34.79 [2019-03-28 12:50:43,504 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. 72.89/34.79 [2019-03-28 12:50:43,504 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. 72.89/34.79 [2019-03-28 12:50:43,506 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 72.89/34.79 [2019-03-28 12:50:43,507 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 72.89/34.79 Termination analysis: LINEAR_WITH_GUESSES 72.89/34.79 Number of strict supporting invariants: 0 72.89/34.79 Number of non-strict supporting invariants: 1 72.89/34.79 Consider only non-deceasing supporting invariants: true 72.89/34.79 Simplify termination arguments: true 72.89/34.79 Simplify supporting invariants: trueOverapproximate stem: false 72.89/34.79 [2019-03-28 12:50:43,507 INFO L339 nArgumentSynthesizer]: Template has degree 0. 72.89/34.79 [2019-03-28 12:50:43,507 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 72.89/34.79 [2019-03-28 12:50:43,507 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 72.89/34.79 [2019-03-28 12:50:43,507 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 72.89/34.79 [2019-03-28 12:50:43,508 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. 72.89/34.79 [2019-03-28 12:50:43,508 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. 72.89/34.79 [2019-03-28 12:50:43,511 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 72.89/34.79 [2019-03-28 12:50:43,511 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 72.89/34.79 Termination analysis: LINEAR_WITH_GUESSES 72.89/34.79 Number of strict supporting invariants: 0 72.89/34.79 Number of non-strict supporting invariants: 1 72.89/34.79 Consider only non-deceasing supporting invariants: true 72.89/34.79 Simplify termination arguments: true 72.89/34.79 Simplify supporting invariants: trueOverapproximate stem: false 72.89/34.79 [2019-03-28 12:50:43,511 INFO L339 nArgumentSynthesizer]: Template has degree 0. 72.89/34.79 [2019-03-28 12:50:43,511 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 72.89/34.79 [2019-03-28 12:50:43,512 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 72.89/34.79 [2019-03-28 12:50:43,512 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 72.89/34.79 [2019-03-28 12:50:43,513 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. 72.89/34.79 [2019-03-28 12:50:43,513 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. 72.89/34.79 [2019-03-28 12:50:43,521 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. 72.89/34.79 [2019-03-28 12:50:43,525 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. 72.89/34.79 [2019-03-28 12:50:43,525 INFO L444 ModelExtractionUtils]: 36 out of 40 variables were initially zero. Simplification set additionally 1 variables to zero. 72.89/34.79 [2019-03-28 12:50:43,525 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... 72.89/34.79 [2019-03-28 12:50:43,526 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. 72.89/34.79 [2019-03-28 12:50:43,526 INFO L518 LassoAnalysis]: Proved termination. 72.89/34.79 [2019-03-28 12:50:43,526 INFO L520 LassoAnalysis]: Termination argument consisting of: 72.89/34.79 Ranking function f(ULTIMATE.start_diff_~l1~0, ULTIMATE.start_diff_~i~0) = 1*ULTIMATE.start_diff_~l1~0 - 1*ULTIMATE.start_diff_~i~0 72.89/34.79 Supporting invariants [] 72.89/34.79 [2019-03-28 12:50:43,569 INFO L297 tatePredicateManager]: 15 out of 15 supporting invariants were superfluous and have been removed 72.89/34.79 [2019-03-28 12:50:43,583 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 72.89/34.79 [2019-03-28 12:50:43,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 72.89/34.79 [2019-03-28 12:50:43,601 INFO L256 TraceCheckSpWp]: Trace formula consists of 83 conjuncts, 2 conjunts are in the unsatisfiable core 72.89/34.79 [2019-03-28 12:50:43,602 INFO L279 TraceCheckSpWp]: Computing forward predicates... 72.89/34.79 [2019-03-28 12:50:43,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 72.89/34.79 [2019-03-28 12:50:43,609 INFO L256 TraceCheckSpWp]: Trace formula consists of 30 conjuncts, 4 conjunts are in the unsatisfiable core 72.89/34.79 [2019-03-28 12:50:43,609 INFO L279 TraceCheckSpWp]: Computing forward predicates... 72.89/34.79 [2019-03-28 12:50:43,619 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. 72.89/34.79 [2019-03-28 12:50:43,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 72.89/34.79 [2019-03-28 12:50:43,654 INFO L256 TraceCheckSpWp]: Trace formula consists of 30 conjuncts, 4 conjunts are in the unsatisfiable core 72.89/34.79 [2019-03-28 12:50:43,654 INFO L279 TraceCheckSpWp]: Computing forward predicates... 72.89/34.79 [2019-03-28 12:50:43,672 INFO L98 LoopCannibalizer]: 2 predicates before loop cannibalization 3 predicates after loop cannibalization 72.89/34.79 [2019-03-28 12:50:43,673 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 72.89/34.79 [2019-03-28 12:50:43,673 INFO L69 BuchiDifferenceNCSB]: Start buchiDifferenceNCSB. First operand 41 states and 72 transitions. cyclomatic complexity: 34 Second operand 3 states. 72.89/34.79 [2019-03-28 12:50:43,724 INFO L73 BuchiDifferenceNCSB]: Finished buchiDifferenceNCSB. First operand 41 states and 72 transitions. cyclomatic complexity: 34. Second operand 3 states. Result 57 states and 98 transitions. Complement of second has 4 states. 72.89/34.79 [2019-03-28 12:50:43,724 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 72.89/34.79 [2019-03-28 12:50:43,725 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. 72.89/34.79 [2019-03-28 12:50:43,725 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 42 transitions. 72.89/34.79 [2019-03-28 12:50:43,725 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 42 transitions. Stem has 4 letters. Loop has 8 letters. 72.89/34.79 [2019-03-28 12:50:43,725 INFO L116 BuchiAccepts]: Finished buchiAccepts. 72.89/34.79 [2019-03-28 12:50:43,725 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 42 transitions. Stem has 12 letters. Loop has 8 letters. 72.89/34.79 [2019-03-28 12:50:43,726 INFO L116 BuchiAccepts]: Finished buchiAccepts. 72.89/34.79 [2019-03-28 12:50:43,726 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 42 transitions. Stem has 4 letters. Loop has 16 letters. 72.89/34.79 [2019-03-28 12:50:43,726 INFO L116 BuchiAccepts]: Finished buchiAccepts. 72.89/34.79 [2019-03-28 12:50:43,730 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 57 states and 98 transitions. 72.89/34.79 [2019-03-28 12:50:43,731 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 13 72.89/34.79 [2019-03-28 12:50:43,731 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 57 states to 52 states and 89 transitions. 72.89/34.79 [2019-03-28 12:50:43,731 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 19 72.89/34.79 [2019-03-28 12:50:43,732 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 20 72.89/34.79 [2019-03-28 12:50:43,732 INFO L73 IsDeterministic]: Start isDeterministic. Operand 52 states and 89 transitions. 72.89/34.79 [2019-03-28 12:50:43,732 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. 72.89/34.79 [2019-03-28 12:50:43,732 INFO L706 BuchiCegarLoop]: Abstraction has 52 states and 89 transitions. 72.89/34.79 [2019-03-28 12:50:43,732 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states and 89 transitions. 72.89/34.79 [2019-03-28 12:50:43,733 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 25. 72.89/34.79 [2019-03-28 12:50:43,733 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. 72.89/34.79 [2019-03-28 12:50:43,733 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 47 transitions. 72.89/34.79 [2019-03-28 12:50:43,734 INFO L729 BuchiCegarLoop]: Abstraction has 25 states and 47 transitions. 72.89/34.79 [2019-03-28 12:50:43,734 INFO L609 BuchiCegarLoop]: Abstraction has 25 states and 47 transitions. 72.89/34.79 [2019-03-28 12:50:43,734 INFO L442 BuchiCegarLoop]: ======== Iteration 12============ 72.89/34.79 [2019-03-28 12:50:43,734 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 25 states and 47 transitions. 72.89/34.79 [2019-03-28 12:50:43,734 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 72.89/34.79 [2019-03-28 12:50:43,734 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false 72.89/34.79 [2019-03-28 12:50:43,734 INFO L119 BuchiIsEmpty]: Starting construction of run 72.89/34.79 [2019-03-28 12:50:43,735 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] 72.89/34.79 [2019-03-28 12:50:43,735 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] 72.89/34.79 [2019-03-28 12:50:43,735 INFO L794 eck$LassoCheckResult]: Stem: 2155#ULTIMATE.startENTRY [150] ULTIMATE.startENTRY-->L34: Formula: (and (= |v_#NULL.offset_2| 0) (= (store |v_#valid_20| 0 0) |v_#valid_19|) (= 0 |v_#NULL.base_2|)) InVars {#valid=|v_#valid_20|} OutVars{ULTIMATE.start_main_#t~malloc8.base=|v_ULTIMATE.start_main_#t~malloc8.base_5|, ULTIMATE.start_main_#t~malloc9.base=|v_ULTIMATE.start_main_#t~malloc9.base_5|, ULTIMATE.start_main_~A~0.base=v_ULTIMATE.start_main_~A~0.base_3, ULTIMATE.start_main_~B~0.offset=v_ULTIMATE.start_main_~B~0.offset_3, #NULL.offset=|v_#NULL.offset_2|, ULTIMATE.start_main_#t~nondet6=|v_ULTIMATE.start_main_#t~nondet6_6|, ULTIMATE.start_main_#t~nondet7=|v_ULTIMATE.start_main_#t~nondet7_6|, ULTIMATE.start_main_~B~0.base=v_ULTIMATE.start_main_~B~0.base_3, #NULL.base=|v_#NULL.base_2|, ULTIMATE.start_main_~D~0.offset=v_ULTIMATE.start_main_~D~0.offset_3, ULTIMATE.start_main_#t~malloc10.base=|v_ULTIMATE.start_main_#t~malloc10.base_5|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_4|, ULTIMATE.start_main_#t~malloc8.offset=|v_ULTIMATE.start_main_#t~malloc8.offset_5|, #valid=|v_#valid_19|, ULTIMATE.start_main_#t~malloc9.offset=|v_ULTIMATE.start_main_#t~malloc9.offset_5|, ULTIMATE.start_main_~D~0.base=v_ULTIMATE.start_main_~D~0.base_3, ULTIMATE.start_main_~A~0.offset=v_ULTIMATE.start_main_~A~0.offset_3, ULTIMATE.start_main_~Blen~0=v_ULTIMATE.start_main_~Blen~0_8, ULTIMATE.start_main_~Alen~0=v_ULTIMATE.start_main_~Alen~0_8, ULTIMATE.start_main_#t~malloc10.offset=|v_ULTIMATE.start_main_#t~malloc10.offset_5|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~malloc8.base, ULTIMATE.start_main_#t~malloc9.base, ULTIMATE.start_main_~A~0.base, ULTIMATE.start_main_~B~0.offset, #NULL.offset, ULTIMATE.start_main_#t~nondet6, ULTIMATE.start_main_#t~nondet7, ULTIMATE.start_main_~B~0.base, #NULL.base, ULTIMATE.start_main_~D~0.offset, ULTIMATE.start_main_#t~malloc10.base, ULTIMATE.start_main_#res, ULTIMATE.start_main_#t~malloc8.offset, #valid, ULTIMATE.start_main_#t~malloc9.offset, ULTIMATE.start_main_~D~0.base, ULTIMATE.start_main_~A~0.offset, ULTIMATE.start_main_~Blen~0, ULTIMATE.start_main_~Alen~0, ULTIMATE.start_main_#t~malloc10.offset] 2156#L34 [75] L34-->L34-2: Formula: (and (< v_ULTIMATE.start_main_~Alen~0_5 1) (= v_ULTIMATE.start_main_~Alen~0_4 1)) InVars {ULTIMATE.start_main_~Alen~0=v_ULTIMATE.start_main_~Alen~0_5} OutVars{ULTIMATE.start_main_~Alen~0=v_ULTIMATE.start_main_~Alen~0_4} AuxVars[] AssignedVars[ULTIMATE.start_main_~Alen~0] 2157#L34-2 [105] L34-2-->L37-1: Formula: (>= v_ULTIMATE.start_main_~Blen~0_6 1) InVars {ULTIMATE.start_main_~Blen~0=v_ULTIMATE.start_main_~Blen~0_6} OutVars{ULTIMATE.start_main_~Blen~0=v_ULTIMATE.start_main_~Blen~0_6} AuxVars[] AssignedVars[] 2158#L37-1 [126] L37-1-->L13-2: Formula: (let ((.cse2 (store |v_#valid_10| |v_ULTIMATE.start_main_#t~malloc8.base_4| 1))) (let ((.cse0 (store .cse2 |v_ULTIMATE.start_main_#t~malloc9.base_4| 1))) (and (= v_ULTIMATE.start_diff_~k~0_1 0) (= v_ULTIMATE.start_diff_~l2~0_1 v_ULTIMATE.start_diff_~Blen_1) (= v_ULTIMATE.start_diff_~A.base_1 |v_ULTIMATE.start_diff_#in~A.base_1|) (= |v_#valid_7| (store .cse0 |v_ULTIMATE.start_main_#t~malloc10.base_4| 1)) (< |v_ULTIMATE.start_main_#t~malloc10.base_4| |v_#StackHeapBarrier_1|) (= v_ULTIMATE.start_diff_~Blen_1 |v_ULTIMATE.start_diff_#in~Blen_1|) (= v_ULTIMATE.start_diff_~B.base_1 |v_ULTIMATE.start_diff_#in~B.base_1|) (= v_ULTIMATE.start_diff_~Alen_1 |v_ULTIMATE.start_diff_#in~Alen_1|) (= v_ULTIMATE.start_main_~B~0.offset_2 |v_ULTIMATE.start_main_#t~malloc9.offset_4|) (= v_ULTIMATE.start_main_~B~0.base_2 |v_ULTIMATE.start_main_#t~malloc9.base_4|) (= |v_ULTIMATE.start_diff_#in~A.base_1| v_ULTIMATE.start_main_~A~0.base_2) (= |v_ULTIMATE.start_main_#t~malloc8.offset_4| 0) (> |v_ULTIMATE.start_main_#t~malloc10.base_4| 0) (= |v_#length_1| (let ((.cse1 (* 4 v_ULTIMATE.start_main_~Alen~0_7))) (store (store (store |v_#length_4| |v_ULTIMATE.start_main_#t~malloc8.base_4| .cse1) |v_ULTIMATE.start_main_#t~malloc9.base_4| (* 4 v_ULTIMATE.start_main_~Blen~0_7)) |v_ULTIMATE.start_main_#t~malloc10.base_4| .cse1))) (= v_ULTIMATE.start_diff_~D.base_1 |v_ULTIMATE.start_diff_#in~D.base_1|) (= |v_ULTIMATE.start_main_#t~malloc9.offset_4| 0) (= |v_ULTIMATE.start_diff_#in~B.offset_1| v_ULTIMATE.start_main_~B~0.offset_2) (= |v_ULTIMATE.start_diff_#in~A.offset_1| v_ULTIMATE.start_main_~A~0.offset_2) (= v_ULTIMATE.start_diff_~B.offset_1 |v_ULTIMATE.start_diff_#in~B.offset_1|) (= v_ULTIMATE.start_main_~A~0.base_2 |v_ULTIMATE.start_main_#t~malloc8.base_4|) (< |v_ULTIMATE.start_main_#t~malloc8.base_4| |v_#StackHeapBarrier_1|) (= |v_ULTIMATE.start_diff_#in~B.base_1| v_ULTIMATE.start_main_~B~0.base_2) (< 0 |v_ULTIMATE.start_main_#t~malloc9.base_4|) (< |v_ULTIMATE.start_main_#t~malloc9.base_4| |v_#StackHeapBarrier_1|) (= |v_ULTIMATE.start_diff_#in~D.offset_1| v_ULTIMATE.start_main_~D~0.offset_2) (= v_ULTIMATE.start_main_~D~0.offset_2 |v_ULTIMATE.start_main_#t~malloc10.offset_4|) (= v_ULTIMATE.start_diff_~i~0_1 0) (= 0 (select .cse2 |v_ULTIMATE.start_main_#t~malloc9.base_4|)) (= v_ULTIMATE.start_main_~D~0.base_2 |v_ULTIMATE.start_main_#t~malloc10.base_4|) (= |v_ULTIMATE.start_diff_#in~Blen_1| v_ULTIMATE.start_main_~Blen~0_7) (= v_ULTIMATE.start_diff_~l1~0_1 v_ULTIMATE.start_diff_~Alen_1) (= 0 (select .cse0 |v_ULTIMATE.start_main_#t~malloc10.base_4|)) (= (select |v_#valid_10| |v_ULTIMATE.start_main_#t~malloc8.base_4|) 0) (= v_ULTIMATE.start_diff_~A.offset_1 |v_ULTIMATE.start_diff_#in~A.offset_1|) (< |v_ULTIMATE.start_main_#t~malloc8.base_4| 0) (= |v_ULTIMATE.start_diff_#in~Alen_1| v_ULTIMATE.start_main_~Alen~0_7) (= v_ULTIMATE.start_main_~A~0.offset_2 |v_ULTIMATE.start_main_#t~malloc8.offset_4|) (= |v_ULTIMATE.start_main_#t~malloc10.offset_4| 0) (= |v_ULTIMATE.start_diff_#in~D.base_1| v_ULTIMATE.start_main_~D~0.base_2) (= v_ULTIMATE.start_diff_~D.offset_1 |v_ULTIMATE.start_diff_#in~D.offset_1|)))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_4|, #valid=|v_#valid_10|, ULTIMATE.start_main_~Blen~0=v_ULTIMATE.start_main_~Blen~0_7, ULTIMATE.start_main_~Alen~0=v_ULTIMATE.start_main_~Alen~0_7} OutVars{ULTIMATE.start_diff_#in~A.base=|v_ULTIMATE.start_diff_#in~A.base_1|, ULTIMATE.start_diff_#in~B.base=|v_ULTIMATE.start_diff_#in~B.base_1|, ULTIMATE.start_diff_~B.offset=v_ULTIMATE.start_diff_~B.offset_1, ULTIMATE.start_diff_~Alen=v_ULTIMATE.start_diff_~Alen_1, ULTIMATE.start_diff_~D.base=v_ULTIMATE.start_diff_~D.base_1, ULTIMATE.start_diff_#in~Blen=|v_ULTIMATE.start_diff_#in~Blen_1|, ULTIMATE.start_main_~B~0.offset=v_ULTIMATE.start_main_~B~0.offset_2, ULTIMATE.start_main_~B~0.base=v_ULTIMATE.start_main_~B~0.base_2, ULTIMATE.start_diff_#in~A.offset=|v_ULTIMATE.start_diff_#in~A.offset_1|, ULTIMATE.start_main_~D~0.offset=v_ULTIMATE.start_main_~D~0.offset_2, ULTIMATE.start_diff_#in~D.offset=|v_ULTIMATE.start_diff_#in~D.offset_1|, ULTIMATE.start_diff_#in~Alen=|v_ULTIMATE.start_diff_#in~Alen_1|, ULTIMATE.start_diff_~A.base=v_ULTIMATE.start_diff_~A.base_1, ULTIMATE.start_diff_~B.base=v_ULTIMATE.start_diff_~B.base_1, #length=|v_#length_1|, ULTIMATE.start_main_#t~malloc9.offset=|v_ULTIMATE.start_main_#t~malloc9.offset_4|, ULTIMATE.start_diff_#t~mem3=|v_ULTIMATE.start_diff_#t~mem3_1|, ULTIMATE.start_main_~A~0.offset=v_ULTIMATE.start_main_~A~0.offset_2, ULTIMATE.start_main_#t~malloc10.offset=|v_ULTIMATE.start_main_#t~malloc10.offset_4|, ULTIMATE.start_main_~Blen~0=v_ULTIMATE.start_main_~Blen~0_7, ULTIMATE.start_main_~Alen~0=v_ULTIMATE.start_main_~Alen~0_7, ULTIMATE.start_diff_~Blen=v_ULTIMATE.start_diff_~Blen_1, ULTIMATE.start_main_#t~malloc8.base=|v_ULTIMATE.start_main_#t~malloc8.base_4|, ULTIMATE.start_diff_#t~mem0=|v_ULTIMATE.start_diff_#t~mem0_1|, ULTIMATE.start_main_#t~malloc9.base=|v_ULTIMATE.start_main_#t~malloc9.base_4|, ULTIMATE.start_diff_#t~mem1=|v_ULTIMATE.start_diff_#t~mem1_1|, ULTIMATE.start_main_~A~0.base=v_ULTIMATE.start_main_~A~0.base_2, ULTIMATE.start_diff_#t~post4=|v_ULTIMATE.start_diff_#t~post4_1|, ULTIMATE.start_diff_~found~0=v_ULTIMATE.start_diff_~found~0_1, ULTIMATE.start_diff_#in~B.offset=|v_ULTIMATE.start_diff_#in~B.offset_1|, ULTIMATE.start_diff_~i~0=v_ULTIMATE.start_diff_~i~0_1, ULTIMATE.start_diff_~l1~0=v_ULTIMATE.start_diff_~l1~0_1, ULTIMATE.start_diff_#t~post5=|v_ULTIMATE.start_diff_#t~post5_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, ULTIMATE.start_main_#t~malloc10.base=|v_ULTIMATE.start_main_#t~malloc10.base_4|, ULTIMATE.start_diff_~D.offset=v_ULTIMATE.start_diff_~D.offset_1, ULTIMATE.start_diff_~l2~0=v_ULTIMATE.start_diff_~l2~0_1, ULTIMATE.start_diff_~j~0=v_ULTIMATE.start_diff_~j~0_1, ULTIMATE.start_main_#t~malloc8.offset=|v_ULTIMATE.start_main_#t~malloc8.offset_4|, #valid=|v_#valid_7|, ULTIMATE.start_diff_~k~0=v_ULTIMATE.start_diff_~k~0_1, ULTIMATE.start_diff_#in~D.base=|v_ULTIMATE.start_diff_#in~D.base_1|, ULTIMATE.start_diff_#t~post2=|v_ULTIMATE.start_diff_#t~post2_1|, ULTIMATE.start_diff_~A.offset=v_ULTIMATE.start_diff_~A.offset_1, ULTIMATE.start_main_~D~0.base=v_ULTIMATE.start_main_~D~0.base_2} AuxVars[] AssignedVars[ULTIMATE.start_diff_#in~A.base, ULTIMATE.start_diff_#in~B.base, ULTIMATE.start_diff_~B.offset, ULTIMATE.start_diff_~Alen, ULTIMATE.start_diff_~D.base, ULTIMATE.start_diff_#in~Blen, ULTIMATE.start_main_~B~0.offset, ULTIMATE.start_main_~B~0.base, ULTIMATE.start_diff_#in~A.offset, ULTIMATE.start_main_~D~0.offset, ULTIMATE.start_diff_#in~D.offset, ULTIMATE.start_diff_#in~Alen, ULTIMATE.start_diff_~A.base, ULTIMATE.start_diff_~B.base, #length, ULTIMATE.start_main_#t~malloc9.offset, ULTIMATE.start_diff_#t~mem3, ULTIMATE.start_main_~A~0.offset, ULTIMATE.start_main_#t~malloc10.offset, ULTIMATE.start_diff_~Blen, ULTIMATE.start_main_#t~malloc8.base, ULTIMATE.start_diff_#t~mem0, ULTIMATE.start_main_#t~malloc9.base, ULTIMATE.start_diff_#t~mem1, ULTIMATE.start_main_~A~0.base, ULTIMATE.start_diff_#t~post4, ULTIMATE.start_diff_~found~0, ULTIMATE.start_diff_#in~B.offset, ULTIMATE.start_diff_~i~0, ULTIMATE.start_diff_~l1~0, ULTIMATE.start_diff_#t~post5, ULTIMATE.start_main_#t~malloc10.base, ULTIMATE.start_diff_~D.offset, ULTIMATE.start_diff_~l2~0, ULTIMATE.start_diff_~j~0, ULTIMATE.start_main_#t~malloc8.offset, #valid, ULTIMATE.start_diff_~k~0, ULTIMATE.start_diff_#in~D.base, ULTIMATE.start_diff_#t~post2, ULTIMATE.start_diff_~A.offset, ULTIMATE.start_main_~D~0.base] 2159#L13-2 [91] L13-2-->L17-4: Formula: (and (< v_ULTIMATE.start_diff_~i~0_4 v_ULTIMATE.start_diff_~l1~0_4) (= v_ULTIMATE.start_diff_~j~0_2 0) (= v_ULTIMATE.start_diff_~found~0_3 0)) InVars {ULTIMATE.start_diff_~i~0=v_ULTIMATE.start_diff_~i~0_4, ULTIMATE.start_diff_~l1~0=v_ULTIMATE.start_diff_~l1~0_4} OutVars{ULTIMATE.start_diff_~found~0=v_ULTIMATE.start_diff_~found~0_3, ULTIMATE.start_diff_~i~0=v_ULTIMATE.start_diff_~i~0_4, ULTIMATE.start_diff_~l1~0=v_ULTIMATE.start_diff_~l1~0_4, ULTIMATE.start_diff_~j~0=v_ULTIMATE.start_diff_~j~0_2} AuxVars[] AssignedVars[ULTIMATE.start_diff_~found~0, ULTIMATE.start_diff_~j~0] 2147#L17-4 72.89/34.79 [2019-03-28 12:50:43,736 INFO L796 eck$LassoCheckResult]: Loop: 2147#L17-4 [99] L17-4-->L17: Formula: (and (= 0 v_ULTIMATE.start_diff_~found~0_5) (< v_ULTIMATE.start_diff_~j~0_4 v_ULTIMATE.start_diff_~l2~0_4)) InVars {ULTIMATE.start_diff_~found~0=v_ULTIMATE.start_diff_~found~0_5, ULTIMATE.start_diff_~j~0=v_ULTIMATE.start_diff_~j~0_4, ULTIMATE.start_diff_~l2~0=v_ULTIMATE.start_diff_~l2~0_4} OutVars{ULTIMATE.start_diff_~found~0=v_ULTIMATE.start_diff_~found~0_5, ULTIMATE.start_diff_~j~0=v_ULTIMATE.start_diff_~j~0_4, ULTIMATE.start_diff_~l2~0=v_ULTIMATE.start_diff_~l2~0_4} AuxVars[] AssignedVars[] 2153#L17 [85] L17-->L17-1: Formula: (let ((.cse0 (* 4 v_ULTIMATE.start_diff_~i~0_5))) (let ((.cse1 (+ .cse0 v_ULTIMATE.start_diff_~A.offset_3))) (and (<= (+ .cse0 v_ULTIMATE.start_diff_~A.offset_3 4) (select |v_#length_5| v_ULTIMATE.start_diff_~A.base_3)) (= 1 (select |v_#valid_11| v_ULTIMATE.start_diff_~A.base_3)) (= (select (select |v_#memory_int_1| v_ULTIMATE.start_diff_~A.base_3) .cse1) |v_ULTIMATE.start_diff_#t~mem0_2|) (<= 0 .cse1)))) InVars {ULTIMATE.start_diff_~i~0=v_ULTIMATE.start_diff_~i~0_5, ULTIMATE.start_diff_~A.base=v_ULTIMATE.start_diff_~A.base_3, #valid=|v_#valid_11|, #memory_int=|v_#memory_int_1|, #length=|v_#length_5|, ULTIMATE.start_diff_~A.offset=v_ULTIMATE.start_diff_~A.offset_3} OutVars{ULTIMATE.start_diff_#t~mem0=|v_ULTIMATE.start_diff_#t~mem0_2|, ULTIMATE.start_diff_~i~0=v_ULTIMATE.start_diff_~i~0_5, ULTIMATE.start_diff_~A.base=v_ULTIMATE.start_diff_~A.base_3, #valid=|v_#valid_11|, #memory_int=|v_#memory_int_1|, #length=|v_#length_5|, ULTIMATE.start_diff_~A.offset=v_ULTIMATE.start_diff_~A.offset_3} AuxVars[] AssignedVars[ULTIMATE.start_diff_#t~mem0] 2151#L17-1 [82] L17-1-->L17-2: Formula: (let ((.cse1 (* 4 v_ULTIMATE.start_diff_~j~0_5))) (let ((.cse0 (+ v_ULTIMATE.start_diff_~B.offset_3 .cse1))) (and (<= 0 .cse0) (= 1 (select |v_#valid_13| v_ULTIMATE.start_diff_~B.base_3)) (= (select (select |v_#memory_int_2| v_ULTIMATE.start_diff_~B.base_3) .cse0) |v_ULTIMATE.start_diff_#t~mem1_2|) (<= (+ v_ULTIMATE.start_diff_~B.offset_3 .cse1 4) (select |v_#length_7| v_ULTIMATE.start_diff_~B.base_3))))) InVars {ULTIMATE.start_diff_~B.offset=v_ULTIMATE.start_diff_~B.offset_3, ULTIMATE.start_diff_~j~0=v_ULTIMATE.start_diff_~j~0_5, #valid=|v_#valid_13|, ULTIMATE.start_diff_~B.base=v_ULTIMATE.start_diff_~B.base_3, #memory_int=|v_#memory_int_2|, #length=|v_#length_7|} OutVars{ULTIMATE.start_diff_#t~mem1=|v_ULTIMATE.start_diff_#t~mem1_2|, ULTIMATE.start_diff_~B.offset=v_ULTIMATE.start_diff_~B.offset_3, ULTIMATE.start_diff_~j~0=v_ULTIMATE.start_diff_~j~0_5, #valid=|v_#valid_13|, ULTIMATE.start_diff_~B.base=v_ULTIMATE.start_diff_~B.base_3, #memory_int=|v_#memory_int_2|, #length=|v_#length_7|} AuxVars[] AssignedVars[ULTIMATE.start_diff_#t~mem1] 2146#L17-2 [80] L17-2-->L17-4: Formula: (and (= |v_ULTIMATE.start_diff_#t~mem1_4| |v_ULTIMATE.start_diff_#t~mem0_4|) (= v_ULTIMATE.start_diff_~found~0_6 1)) InVars {ULTIMATE.start_diff_#t~mem0=|v_ULTIMATE.start_diff_#t~mem0_4|, ULTIMATE.start_diff_#t~mem1=|v_ULTIMATE.start_diff_#t~mem1_4|} OutVars{ULTIMATE.start_diff_#t~mem0=|v_ULTIMATE.start_diff_#t~mem0_3|, ULTIMATE.start_diff_#t~mem1=|v_ULTIMATE.start_diff_#t~mem1_3|, ULTIMATE.start_diff_~found~0=v_ULTIMATE.start_diff_~found~0_6} AuxVars[] AssignedVars[ULTIMATE.start_diff_#t~mem0, ULTIMATE.start_diff_#t~mem1, ULTIMATE.start_diff_~found~0] 2147#L17-4 72.89/34.79 [2019-03-28 12:50:43,736 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 72.89/34.79 [2019-03-28 12:50:43,736 INFO L82 PathProgramCache]: Analyzing trace with hash 169496528, now seen corresponding path program 1 times 72.89/34.79 [2019-03-28 12:50:43,736 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 72.89/34.79 [2019-03-28 12:50:43,736 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 72.89/34.79 [2019-03-28 12:50:43,737 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 72.89/34.79 [2019-03-28 12:50:43,737 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 72.89/34.79 [2019-03-28 12:50:43,737 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 72.89/34.79 [2019-03-28 12:50:43,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 72.89/34.79 [2019-03-28 12:50:43,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 72.89/34.79 [2019-03-28 12:50:43,746 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 72.89/34.79 [2019-03-28 12:50:43,746 INFO L82 PathProgramCache]: Analyzing trace with hash 3957137, now seen corresponding path program 1 times 72.89/34.79 [2019-03-28 12:50:43,746 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 72.89/34.79 [2019-03-28 12:50:43,746 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 72.89/34.79 [2019-03-28 12:50:43,747 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 72.89/34.79 [2019-03-28 12:50:43,747 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 72.89/34.79 [2019-03-28 12:50:43,747 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 72.89/34.79 [2019-03-28 12:50:43,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 72.89/34.79 [2019-03-28 12:50:43,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 72.89/34.79 [2019-03-28 12:50:43,751 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 72.89/34.79 [2019-03-28 12:50:43,751 INFO L82 PathProgramCache]: Analyzing trace with hash -772001312, now seen corresponding path program 1 times 72.89/34.79 [2019-03-28 12:50:43,751 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 72.89/34.79 [2019-03-28 12:50:43,751 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 72.89/34.79 [2019-03-28 12:50:43,752 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 72.89/34.79 [2019-03-28 12:50:43,752 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 72.89/34.79 [2019-03-28 12:50:43,752 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 72.89/34.79 [2019-03-28 12:50:43,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 72.89/34.79 [2019-03-28 12:50:43,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 72.89/34.79 [2019-03-28 12:50:44,369 WARN L188 SmtUtils]: Spent 543.00 ms on a formula simplification. DAG size of input: 110 DAG size of output: 108 72.89/34.79 [2019-03-28 12:50:44,618 WARN L188 SmtUtils]: Spent 248.00 ms on a formula simplification that was a NOOP. DAG size: 104 72.89/34.79 [2019-03-28 12:50:44,621 INFO L216 LassoAnalysis]: Preferences: 72.89/34.79 [2019-03-28 12:50:44,621 INFO L124 ssoRankerPreferences]: Compute integeral hull: false 72.89/34.79 [2019-03-28 12:50:44,621 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true 72.89/34.79 [2019-03-28 12:50:44,622 INFO L126 ssoRankerPreferences]: Term annotations enabled: false 72.89/34.79 [2019-03-28 12:50:44,622 INFO L127 ssoRankerPreferences]: Use exernal solver: false 72.89/34.79 [2019-03-28 12:50:44,622 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 72.89/34.79 [2019-03-28 12:50:44,622 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false 72.89/34.79 [2019-03-28 12:50:44,622 INFO L130 ssoRankerPreferences]: Path of dumped script: 72.89/34.79 [2019-03-28 12:50:44,622 INFO L131 ssoRankerPreferences]: Filename of dumped script: theBenchmark.c_BEv2_Iteration12_Lasso 72.89/34.79 [2019-03-28 12:50:44,622 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank 72.89/34.79 [2019-03-28 12:50:44,622 INFO L282 LassoAnalysis]: Starting lasso preprocessing... 72.89/34.79 [2019-03-28 12:50:44,625 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 72.89/34.79 [2019-03-28 12:50:44,628 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 72.89/34.79 [2019-03-28 12:50:44,629 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 72.89/34.79 [2019-03-28 12:50:44,637 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 72.89/34.79 [2019-03-28 12:50:44,639 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 72.89/34.79 [2019-03-28 12:50:44,640 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 72.89/34.79 [2019-03-28 12:50:44,643 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 72.89/34.79 [2019-03-28 12:50:44,644 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 72.89/34.79 [2019-03-28 12:50:44,646 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 72.89/34.79 [2019-03-28 12:50:44,652 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 72.89/34.79 [2019-03-28 12:50:44,654 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 72.89/34.79 [2019-03-28 12:50:44,656 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 72.89/34.79 [2019-03-28 12:50:45,072 WARN L188 SmtUtils]: Spent 347.00 ms on a formula simplification. DAG size of input: 102 DAG size of output: 95 72.89/34.79 [2019-03-28 12:50:45,129 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 72.89/34.79 [2019-03-28 12:50:45,131 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 72.89/34.79 [2019-03-28 12:50:45,132 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 72.89/34.79 [2019-03-28 12:50:45,355 WARN L188 SmtUtils]: Spent 106.00 ms on a formula simplification that was a NOOP. DAG size: 72 72.89/34.79 [2019-03-28 12:50:45,610 WARN L188 SmtUtils]: Spent 124.00 ms on a formula simplification that was a NOOP. DAG size: 72 72.89/34.79 [2019-03-28 12:50:45,631 INFO L300 LassoAnalysis]: Preprocessing complete. 72.89/34.79 [2019-03-28 12:50:45,632 INFO L497 LassoAnalysis]: Using template 'affine'. 72.89/34.79 [2019-03-28 12:50:45,632 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 72.89/34.79 Termination analysis: LINEAR_WITH_GUESSES 72.89/34.79 Number of strict supporting invariants: 0 72.89/34.79 Number of non-strict supporting invariants: 1 72.89/34.79 Consider only non-deceasing supporting invariants: true 72.89/34.79 Simplify termination arguments: true 72.89/34.79 Simplify supporting invariants: trueOverapproximate stem: false 72.89/34.79 [2019-03-28 12:50:45,633 INFO L339 nArgumentSynthesizer]: Template has degree 0. 72.89/34.79 [2019-03-28 12:50:45,633 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 72.89/34.79 [2019-03-28 12:50:45,633 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 72.89/34.79 [2019-03-28 12:50:45,633 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 72.89/34.79 [2019-03-28 12:50:45,634 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. 72.89/34.79 [2019-03-28 12:50:45,634 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. 72.89/34.79 [2019-03-28 12:50:45,635 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 72.89/34.79 [2019-03-28 12:50:45,635 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 72.89/34.79 Termination analysis: LINEAR_WITH_GUESSES 72.89/34.79 Number of strict supporting invariants: 0 72.89/34.79 Number of non-strict supporting invariants: 1 72.89/34.79 Consider only non-deceasing supporting invariants: true 72.89/34.79 Simplify termination arguments: true 72.89/34.79 Simplify supporting invariants: trueOverapproximate stem: false 72.89/34.79 [2019-03-28 12:50:45,635 INFO L339 nArgumentSynthesizer]: Template has degree 0. 72.89/34.79 [2019-03-28 12:50:45,635 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 72.89/34.79 [2019-03-28 12:50:45,636 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 72.89/34.79 [2019-03-28 12:50:45,636 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 72.89/34.79 [2019-03-28 12:50:45,636 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 72.89/34.79 [2019-03-28 12:50:45,636 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 72.89/34.79 [2019-03-28 12:50:45,636 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 72.89/34.79 [2019-03-28 12:50:45,636 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 72.89/34.79 [2019-03-28 12:50:45,637 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 72.89/34.79 Termination analysis: LINEAR_WITH_GUESSES 72.89/34.79 Number of strict supporting invariants: 0 72.89/34.79 Number of non-strict supporting invariants: 1 72.89/34.79 Consider only non-deceasing supporting invariants: true 72.89/34.79 Simplify termination arguments: true 72.89/34.79 Simplify supporting invariants: trueOverapproximate stem: false 72.89/34.79 [2019-03-28 12:50:45,637 INFO L339 nArgumentSynthesizer]: Template has degree 0. 72.89/34.79 [2019-03-28 12:50:45,637 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 72.89/34.79 [2019-03-28 12:50:45,637 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 72.89/34.79 [2019-03-28 12:50:45,637 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 72.89/34.79 [2019-03-28 12:50:45,638 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. 72.89/34.79 [2019-03-28 12:50:45,638 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. 72.89/34.79 [2019-03-28 12:50:45,639 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 72.89/34.79 [2019-03-28 12:50:45,639 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 72.89/34.79 Termination analysis: LINEAR_WITH_GUESSES 72.89/34.79 Number of strict supporting invariants: 0 72.89/34.79 Number of non-strict supporting invariants: 1 72.89/34.79 Consider only non-deceasing supporting invariants: true 72.89/34.79 Simplify termination arguments: true 72.89/34.79 Simplify supporting invariants: trueOverapproximate stem: false 72.89/34.79 [2019-03-28 12:50:45,640 INFO L339 nArgumentSynthesizer]: Template has degree 0. 72.89/34.79 [2019-03-28 12:50:45,640 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 72.89/34.79 [2019-03-28 12:50:45,640 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 72.89/34.79 [2019-03-28 12:50:45,640 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 72.89/34.79 [2019-03-28 12:50:45,641 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. 72.89/34.79 [2019-03-28 12:50:45,641 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. 72.89/34.79 [2019-03-28 12:50:45,642 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 72.89/34.79 [2019-03-28 12:50:45,642 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 72.89/34.79 Termination analysis: LINEAR_WITH_GUESSES 72.89/34.79 Number of strict supporting invariants: 0 72.89/34.79 Number of non-strict supporting invariants: 1 72.89/34.79 Consider only non-deceasing supporting invariants: true 72.89/34.79 Simplify termination arguments: true 72.89/34.79 Simplify supporting invariants: trueOverapproximate stem: false 72.89/34.79 [2019-03-28 12:50:45,642 INFO L339 nArgumentSynthesizer]: Template has degree 0. 72.89/34.80 [2019-03-28 12:50:45,642 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 72.89/34.80 [2019-03-28 12:50:45,643 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 72.89/34.80 [2019-03-28 12:50:45,643 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 72.89/34.80 [2019-03-28 12:50:45,643 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 72.89/34.80 [2019-03-28 12:50:45,643 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 72.89/34.80 [2019-03-28 12:50:45,643 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 72.89/34.80 [2019-03-28 12:50:45,643 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 72.89/34.80 [2019-03-28 12:50:45,644 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 72.89/34.80 Termination analysis: LINEAR_WITH_GUESSES 72.89/34.80 Number of strict supporting invariants: 0 72.89/34.80 Number of non-strict supporting invariants: 1 72.89/34.80 Consider only non-deceasing supporting invariants: true 72.89/34.80 Simplify termination arguments: true 72.89/34.80 Simplify supporting invariants: trueOverapproximate stem: false 72.89/34.80 [2019-03-28 12:50:45,644 INFO L339 nArgumentSynthesizer]: Template has degree 0. 72.89/34.80 [2019-03-28 12:50:45,644 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 72.89/34.80 [2019-03-28 12:50:45,644 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 72.89/34.80 [2019-03-28 12:50:45,644 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 72.89/34.80 [2019-03-28 12:50:45,645 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. 72.89/34.80 [2019-03-28 12:50:45,645 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. 72.89/34.80 [2019-03-28 12:50:45,646 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 72.89/34.80 [2019-03-28 12:50:45,646 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 72.89/34.80 Termination analysis: LINEAR_WITH_GUESSES 72.89/34.80 Number of strict supporting invariants: 0 72.89/34.80 Number of non-strict supporting invariants: 1 72.89/34.80 Consider only non-deceasing supporting invariants: true 72.89/34.80 Simplify termination arguments: true 72.89/34.80 Simplify supporting invariants: trueOverapproximate stem: false 72.89/34.80 [2019-03-28 12:50:45,646 INFO L339 nArgumentSynthesizer]: Template has degree 0. 72.89/34.80 [2019-03-28 12:50:45,646 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 72.89/34.80 [2019-03-28 12:50:45,647 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 72.89/34.80 [2019-03-28 12:50:45,647 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 72.89/34.80 [2019-03-28 12:50:45,647 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 72.89/34.80 [2019-03-28 12:50:45,647 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 72.89/34.80 [2019-03-28 12:50:45,647 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 72.89/34.80 [2019-03-28 12:50:45,647 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 72.89/34.80 [2019-03-28 12:50:45,648 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 72.89/34.80 Termination analysis: LINEAR_WITH_GUESSES 72.89/34.80 Number of strict supporting invariants: 0 72.89/34.80 Number of non-strict supporting invariants: 1 72.89/34.80 Consider only non-deceasing supporting invariants: true 72.89/34.80 Simplify termination arguments: true 72.89/34.80 Simplify supporting invariants: trueOverapproximate stem: false 72.89/34.80 [2019-03-28 12:50:45,648 INFO L339 nArgumentSynthesizer]: Template has degree 0. 72.89/34.80 [2019-03-28 12:50:45,648 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 72.89/34.80 [2019-03-28 12:50:45,648 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 72.89/34.80 [2019-03-28 12:50:45,648 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 72.89/34.80 [2019-03-28 12:50:45,648 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 72.89/34.80 [2019-03-28 12:50:45,649 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 72.89/34.80 [2019-03-28 12:50:45,649 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 72.89/34.80 [2019-03-28 12:50:45,649 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 72.89/34.80 [2019-03-28 12:50:45,649 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 72.89/34.80 Termination analysis: LINEAR_WITH_GUESSES 72.89/34.80 Number of strict supporting invariants: 0 72.89/34.80 Number of non-strict supporting invariants: 1 72.89/34.80 Consider only non-deceasing supporting invariants: true 72.89/34.80 Simplify termination arguments: true 72.89/34.80 Simplify supporting invariants: trueOverapproximate stem: false 72.89/34.80 [2019-03-28 12:50:45,649 INFO L339 nArgumentSynthesizer]: Template has degree 0. 72.89/34.80 [2019-03-28 12:50:45,650 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 72.89/34.80 [2019-03-28 12:50:45,650 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 72.89/34.80 [2019-03-28 12:50:45,650 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 72.89/34.80 [2019-03-28 12:50:45,650 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. 72.89/34.80 [2019-03-28 12:50:45,650 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. 72.89/34.80 [2019-03-28 12:50:45,653 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. 72.89/34.80 [2019-03-28 12:50:45,655 INFO L443 ModelExtractionUtils]: Simplification made 5 calls to the SMT solver. 72.89/34.80 [2019-03-28 12:50:45,655 INFO L444 ModelExtractionUtils]: 2 out of 7 variables were initially zero. Simplification set additionally 2 variables to zero. 72.89/34.80 [2019-03-28 12:50:45,656 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... 72.89/34.80 [2019-03-28 12:50:45,656 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. 72.89/34.80 [2019-03-28 12:50:45,656 INFO L518 LassoAnalysis]: Proved termination. 72.89/34.80 [2019-03-28 12:50:45,656 INFO L520 LassoAnalysis]: Termination argument consisting of: 72.89/34.80 Ranking function f(ULTIMATE.start_diff_~found~0) = -2*ULTIMATE.start_diff_~found~0 + 1 72.89/34.80 Supporting invariants [] 72.89/34.80 [2019-03-28 12:50:45,699 INFO L297 tatePredicateManager]: 16 out of 16 supporting invariants were superfluous and have been removed 72.89/34.80 [2019-03-28 12:50:45,710 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 72.89/34.80 [2019-03-28 12:50:45,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 72.89/34.80 [2019-03-28 12:50:45,728 INFO L256 TraceCheckSpWp]: Trace formula consists of 88 conjuncts, 2 conjunts are in the unsatisfiable core 72.89/34.80 [2019-03-28 12:50:45,729 INFO L279 TraceCheckSpWp]: Computing forward predicates... 72.89/34.80 [2019-03-28 12:50:45,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 72.89/34.80 [2019-03-28 12:50:45,736 INFO L256 TraceCheckSpWp]: Trace formula consists of 21 conjuncts, 4 conjunts are in the unsatisfiable core 72.89/34.80 [2019-03-28 12:50:45,737 INFO L279 TraceCheckSpWp]: Computing forward predicates... 72.89/34.80 [2019-03-28 12:50:45,747 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 72.89/34.80 [2019-03-28 12:50:45,748 INFO L98 LoopCannibalizer]: 2 predicates before loop cannibalization 2 predicates after loop cannibalization 72.89/34.80 [2019-03-28 12:50:45,749 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 2 loop predicates 72.89/34.80 [2019-03-28 12:50:45,749 INFO L69 BuchiDifferenceNCSB]: Start buchiDifferenceNCSB. First operand 25 states and 47 transitions. cyclomatic complexity: 24 Second operand 3 states. 72.89/34.80 [2019-03-28 12:50:45,817 INFO L73 BuchiDifferenceNCSB]: Finished buchiDifferenceNCSB. First operand 25 states and 47 transitions. cyclomatic complexity: 24. Second operand 3 states. Result 53 states and 89 transitions. Complement of second has 8 states. 72.89/34.80 [2019-03-28 12:50:45,818 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 72.89/34.80 [2019-03-28 12:50:45,818 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. 72.89/34.80 [2019-03-28 12:50:45,818 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 46 transitions. 72.89/34.80 [2019-03-28 12:50:45,818 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 46 transitions. Stem has 5 letters. Loop has 4 letters. 72.89/34.80 [2019-03-28 12:50:45,819 INFO L116 BuchiAccepts]: Finished buchiAccepts. 72.89/34.80 [2019-03-28 12:50:45,819 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 46 transitions. Stem has 9 letters. Loop has 4 letters. 72.89/34.80 [2019-03-28 12:50:45,819 INFO L116 BuchiAccepts]: Finished buchiAccepts. 72.89/34.80 [2019-03-28 12:50:45,819 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 46 transitions. Stem has 5 letters. Loop has 8 letters. 72.89/34.80 [2019-03-28 12:50:45,819 INFO L116 BuchiAccepts]: Finished buchiAccepts. 72.89/34.80 [2019-03-28 12:50:45,823 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 53 states and 89 transitions. 72.89/34.80 [2019-03-28 12:50:45,824 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 72.89/34.80 [2019-03-28 12:50:45,825 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 53 states to 51 states and 87 transitions. 72.89/34.80 [2019-03-28 12:50:45,825 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 12 72.89/34.80 [2019-03-28 12:50:45,825 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 13 72.89/34.80 [2019-03-28 12:50:45,825 INFO L73 IsDeterministic]: Start isDeterministic. Operand 51 states and 87 transitions. 72.89/34.80 [2019-03-28 12:50:45,825 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. 72.89/34.80 [2019-03-28 12:50:45,825 INFO L706 BuchiCegarLoop]: Abstraction has 51 states and 87 transitions. 72.89/34.80 [2019-03-28 12:50:45,826 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states and 87 transitions. 72.89/34.80 [2019-03-28 12:50:45,827 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 45. 72.89/34.80 [2019-03-28 12:50:45,827 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. 72.89/34.80 [2019-03-28 12:50:45,827 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 80 transitions. 72.89/34.80 [2019-03-28 12:50:45,827 INFO L729 BuchiCegarLoop]: Abstraction has 45 states and 80 transitions. 72.89/34.80 [2019-03-28 12:50:45,828 INFO L609 BuchiCegarLoop]: Abstraction has 45 states and 80 transitions. 72.89/34.80 [2019-03-28 12:50:45,828 INFO L442 BuchiCegarLoop]: ======== Iteration 13============ 72.89/34.80 [2019-03-28 12:50:45,828 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 45 states and 80 transitions. 72.89/34.80 [2019-03-28 12:50:45,828 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 72.89/34.80 [2019-03-28 12:50:45,828 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false 72.89/34.80 [2019-03-28 12:50:45,828 INFO L119 BuchiIsEmpty]: Starting construction of run 72.89/34.80 [2019-03-28 12:50:45,829 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] 72.89/34.80 [2019-03-28 12:50:45,829 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] 72.89/34.80 [2019-03-28 12:50:45,829 INFO L794 eck$LassoCheckResult]: Stem: 2349#ULTIMATE.startENTRY [150] ULTIMATE.startENTRY-->L34: Formula: (and (= |v_#NULL.offset_2| 0) (= (store |v_#valid_20| 0 0) |v_#valid_19|) (= 0 |v_#NULL.base_2|)) InVars {#valid=|v_#valid_20|} OutVars{ULTIMATE.start_main_#t~malloc8.base=|v_ULTIMATE.start_main_#t~malloc8.base_5|, ULTIMATE.start_main_#t~malloc9.base=|v_ULTIMATE.start_main_#t~malloc9.base_5|, ULTIMATE.start_main_~A~0.base=v_ULTIMATE.start_main_~A~0.base_3, ULTIMATE.start_main_~B~0.offset=v_ULTIMATE.start_main_~B~0.offset_3, #NULL.offset=|v_#NULL.offset_2|, ULTIMATE.start_main_#t~nondet6=|v_ULTIMATE.start_main_#t~nondet6_6|, ULTIMATE.start_main_#t~nondet7=|v_ULTIMATE.start_main_#t~nondet7_6|, ULTIMATE.start_main_~B~0.base=v_ULTIMATE.start_main_~B~0.base_3, #NULL.base=|v_#NULL.base_2|, ULTIMATE.start_main_~D~0.offset=v_ULTIMATE.start_main_~D~0.offset_3, ULTIMATE.start_main_#t~malloc10.base=|v_ULTIMATE.start_main_#t~malloc10.base_5|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_4|, ULTIMATE.start_main_#t~malloc8.offset=|v_ULTIMATE.start_main_#t~malloc8.offset_5|, #valid=|v_#valid_19|, ULTIMATE.start_main_#t~malloc9.offset=|v_ULTIMATE.start_main_#t~malloc9.offset_5|, ULTIMATE.start_main_~D~0.base=v_ULTIMATE.start_main_~D~0.base_3, ULTIMATE.start_main_~A~0.offset=v_ULTIMATE.start_main_~A~0.offset_3, ULTIMATE.start_main_~Blen~0=v_ULTIMATE.start_main_~Blen~0_8, ULTIMATE.start_main_~Alen~0=v_ULTIMATE.start_main_~Alen~0_8, ULTIMATE.start_main_#t~malloc10.offset=|v_ULTIMATE.start_main_#t~malloc10.offset_5|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~malloc8.base, ULTIMATE.start_main_#t~malloc9.base, ULTIMATE.start_main_~A~0.base, ULTIMATE.start_main_~B~0.offset, #NULL.offset, ULTIMATE.start_main_#t~nondet6, ULTIMATE.start_main_#t~nondet7, ULTIMATE.start_main_~B~0.base, #NULL.base, ULTIMATE.start_main_~D~0.offset, ULTIMATE.start_main_#t~malloc10.base, ULTIMATE.start_main_#res, ULTIMATE.start_main_#t~malloc8.offset, #valid, ULTIMATE.start_main_#t~malloc9.offset, ULTIMATE.start_main_~D~0.base, ULTIMATE.start_main_~A~0.offset, ULTIMATE.start_main_~Blen~0, ULTIMATE.start_main_~Alen~0, ULTIMATE.start_main_#t~malloc10.offset] 2350#L34 [75] L34-->L34-2: Formula: (and (< v_ULTIMATE.start_main_~Alen~0_5 1) (= v_ULTIMATE.start_main_~Alen~0_4 1)) InVars {ULTIMATE.start_main_~Alen~0=v_ULTIMATE.start_main_~Alen~0_5} OutVars{ULTIMATE.start_main_~Alen~0=v_ULTIMATE.start_main_~Alen~0_4} AuxVars[] AssignedVars[ULTIMATE.start_main_~Alen~0] 2351#L34-2 [105] L34-2-->L37-1: Formula: (>= v_ULTIMATE.start_main_~Blen~0_6 1) InVars {ULTIMATE.start_main_~Blen~0=v_ULTIMATE.start_main_~Blen~0_6} OutVars{ULTIMATE.start_main_~Blen~0=v_ULTIMATE.start_main_~Blen~0_6} AuxVars[] AssignedVars[] 2352#L37-1 [126] L37-1-->L13-2: Formula: (let ((.cse2 (store |v_#valid_10| |v_ULTIMATE.start_main_#t~malloc8.base_4| 1))) (let ((.cse0 (store .cse2 |v_ULTIMATE.start_main_#t~malloc9.base_4| 1))) (and (= v_ULTIMATE.start_diff_~k~0_1 0) (= v_ULTIMATE.start_diff_~l2~0_1 v_ULTIMATE.start_diff_~Blen_1) (= v_ULTIMATE.start_diff_~A.base_1 |v_ULTIMATE.start_diff_#in~A.base_1|) (= |v_#valid_7| (store .cse0 |v_ULTIMATE.start_main_#t~malloc10.base_4| 1)) (< |v_ULTIMATE.start_main_#t~malloc10.base_4| |v_#StackHeapBarrier_1|) (= v_ULTIMATE.start_diff_~Blen_1 |v_ULTIMATE.start_diff_#in~Blen_1|) (= v_ULTIMATE.start_diff_~B.base_1 |v_ULTIMATE.start_diff_#in~B.base_1|) (= v_ULTIMATE.start_diff_~Alen_1 |v_ULTIMATE.start_diff_#in~Alen_1|) (= v_ULTIMATE.start_main_~B~0.offset_2 |v_ULTIMATE.start_main_#t~malloc9.offset_4|) (= v_ULTIMATE.start_main_~B~0.base_2 |v_ULTIMATE.start_main_#t~malloc9.base_4|) (= |v_ULTIMATE.start_diff_#in~A.base_1| v_ULTIMATE.start_main_~A~0.base_2) (= |v_ULTIMATE.start_main_#t~malloc8.offset_4| 0) (> |v_ULTIMATE.start_main_#t~malloc10.base_4| 0) (= |v_#length_1| (let ((.cse1 (* 4 v_ULTIMATE.start_main_~Alen~0_7))) (store (store (store |v_#length_4| |v_ULTIMATE.start_main_#t~malloc8.base_4| .cse1) |v_ULTIMATE.start_main_#t~malloc9.base_4| (* 4 v_ULTIMATE.start_main_~Blen~0_7)) |v_ULTIMATE.start_main_#t~malloc10.base_4| .cse1))) (= v_ULTIMATE.start_diff_~D.base_1 |v_ULTIMATE.start_diff_#in~D.base_1|) (= |v_ULTIMATE.start_main_#t~malloc9.offset_4| 0) (= |v_ULTIMATE.start_diff_#in~B.offset_1| v_ULTIMATE.start_main_~B~0.offset_2) (= |v_ULTIMATE.start_diff_#in~A.offset_1| v_ULTIMATE.start_main_~A~0.offset_2) (= v_ULTIMATE.start_diff_~B.offset_1 |v_ULTIMATE.start_diff_#in~B.offset_1|) (= v_ULTIMATE.start_main_~A~0.base_2 |v_ULTIMATE.start_main_#t~malloc8.base_4|) (< |v_ULTIMATE.start_main_#t~malloc8.base_4| |v_#StackHeapBarrier_1|) (= |v_ULTIMATE.start_diff_#in~B.base_1| v_ULTIMATE.start_main_~B~0.base_2) (< 0 |v_ULTIMATE.start_main_#t~malloc9.base_4|) (< |v_ULTIMATE.start_main_#t~malloc9.base_4| |v_#StackHeapBarrier_1|) (= |v_ULTIMATE.start_diff_#in~D.offset_1| v_ULTIMATE.start_main_~D~0.offset_2) (= v_ULTIMATE.start_main_~D~0.offset_2 |v_ULTIMATE.start_main_#t~malloc10.offset_4|) (= v_ULTIMATE.start_diff_~i~0_1 0) (= 0 (select .cse2 |v_ULTIMATE.start_main_#t~malloc9.base_4|)) (= v_ULTIMATE.start_main_~D~0.base_2 |v_ULTIMATE.start_main_#t~malloc10.base_4|) (= |v_ULTIMATE.start_diff_#in~Blen_1| v_ULTIMATE.start_main_~Blen~0_7) (= v_ULTIMATE.start_diff_~l1~0_1 v_ULTIMATE.start_diff_~Alen_1) (= 0 (select .cse0 |v_ULTIMATE.start_main_#t~malloc10.base_4|)) (= (select |v_#valid_10| |v_ULTIMATE.start_main_#t~malloc8.base_4|) 0) (= v_ULTIMATE.start_diff_~A.offset_1 |v_ULTIMATE.start_diff_#in~A.offset_1|) (< |v_ULTIMATE.start_main_#t~malloc8.base_4| 0) (= |v_ULTIMATE.start_diff_#in~Alen_1| v_ULTIMATE.start_main_~Alen~0_7) (= v_ULTIMATE.start_main_~A~0.offset_2 |v_ULTIMATE.start_main_#t~malloc8.offset_4|) (= |v_ULTIMATE.start_main_#t~malloc10.offset_4| 0) (= |v_ULTIMATE.start_diff_#in~D.base_1| v_ULTIMATE.start_main_~D~0.base_2) (= v_ULTIMATE.start_diff_~D.offset_1 |v_ULTIMATE.start_diff_#in~D.offset_1|)))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_4|, #valid=|v_#valid_10|, ULTIMATE.start_main_~Blen~0=v_ULTIMATE.start_main_~Blen~0_7, ULTIMATE.start_main_~Alen~0=v_ULTIMATE.start_main_~Alen~0_7} OutVars{ULTIMATE.start_diff_#in~A.base=|v_ULTIMATE.start_diff_#in~A.base_1|, ULTIMATE.start_diff_#in~B.base=|v_ULTIMATE.start_diff_#in~B.base_1|, ULTIMATE.start_diff_~B.offset=v_ULTIMATE.start_diff_~B.offset_1, ULTIMATE.start_diff_~Alen=v_ULTIMATE.start_diff_~Alen_1, ULTIMATE.start_diff_~D.base=v_ULTIMATE.start_diff_~D.base_1, ULTIMATE.start_diff_#in~Blen=|v_ULTIMATE.start_diff_#in~Blen_1|, ULTIMATE.start_main_~B~0.offset=v_ULTIMATE.start_main_~B~0.offset_2, ULTIMATE.start_main_~B~0.base=v_ULTIMATE.start_main_~B~0.base_2, ULTIMATE.start_diff_#in~A.offset=|v_ULTIMATE.start_diff_#in~A.offset_1|, ULTIMATE.start_main_~D~0.offset=v_ULTIMATE.start_main_~D~0.offset_2, ULTIMATE.start_diff_#in~D.offset=|v_ULTIMATE.start_diff_#in~D.offset_1|, ULTIMATE.start_diff_#in~Alen=|v_ULTIMATE.start_diff_#in~Alen_1|, ULTIMATE.start_diff_~A.base=v_ULTIMATE.start_diff_~A.base_1, ULTIMATE.start_diff_~B.base=v_ULTIMATE.start_diff_~B.base_1, #length=|v_#length_1|, ULTIMATE.start_main_#t~malloc9.offset=|v_ULTIMATE.start_main_#t~malloc9.offset_4|, ULTIMATE.start_diff_#t~mem3=|v_ULTIMATE.start_diff_#t~mem3_1|, ULTIMATE.start_main_~A~0.offset=v_ULTIMATE.start_main_~A~0.offset_2, ULTIMATE.start_main_#t~malloc10.offset=|v_ULTIMATE.start_main_#t~malloc10.offset_4|, ULTIMATE.start_main_~Blen~0=v_ULTIMATE.start_main_~Blen~0_7, ULTIMATE.start_main_~Alen~0=v_ULTIMATE.start_main_~Alen~0_7, ULTIMATE.start_diff_~Blen=v_ULTIMATE.start_diff_~Blen_1, ULTIMATE.start_main_#t~malloc8.base=|v_ULTIMATE.start_main_#t~malloc8.base_4|, ULTIMATE.start_diff_#t~mem0=|v_ULTIMATE.start_diff_#t~mem0_1|, ULTIMATE.start_main_#t~malloc9.base=|v_ULTIMATE.start_main_#t~malloc9.base_4|, ULTIMATE.start_diff_#t~mem1=|v_ULTIMATE.start_diff_#t~mem1_1|, ULTIMATE.start_main_~A~0.base=v_ULTIMATE.start_main_~A~0.base_2, ULTIMATE.start_diff_#t~post4=|v_ULTIMATE.start_diff_#t~post4_1|, ULTIMATE.start_diff_~found~0=v_ULTIMATE.start_diff_~found~0_1, ULTIMATE.start_diff_#in~B.offset=|v_ULTIMATE.start_diff_#in~B.offset_1|, ULTIMATE.start_diff_~i~0=v_ULTIMATE.start_diff_~i~0_1, ULTIMATE.start_diff_~l1~0=v_ULTIMATE.start_diff_~l1~0_1, ULTIMATE.start_diff_#t~post5=|v_ULTIMATE.start_diff_#t~post5_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, ULTIMATE.start_main_#t~malloc10.base=|v_ULTIMATE.start_main_#t~malloc10.base_4|, ULTIMATE.start_diff_~D.offset=v_ULTIMATE.start_diff_~D.offset_1, ULTIMATE.start_diff_~l2~0=v_ULTIMATE.start_diff_~l2~0_1, ULTIMATE.start_diff_~j~0=v_ULTIMATE.start_diff_~j~0_1, ULTIMATE.start_main_#t~malloc8.offset=|v_ULTIMATE.start_main_#t~malloc8.offset_4|, #valid=|v_#valid_7|, ULTIMATE.start_diff_~k~0=v_ULTIMATE.start_diff_~k~0_1, ULTIMATE.start_diff_#in~D.base=|v_ULTIMATE.start_diff_#in~D.base_1|, ULTIMATE.start_diff_#t~post2=|v_ULTIMATE.start_diff_#t~post2_1|, ULTIMATE.start_diff_~A.offset=v_ULTIMATE.start_diff_~A.offset_1, ULTIMATE.start_main_~D~0.base=v_ULTIMATE.start_main_~D~0.base_2} AuxVars[] AssignedVars[ULTIMATE.start_diff_#in~A.base, ULTIMATE.start_diff_#in~B.base, ULTIMATE.start_diff_~B.offset, ULTIMATE.start_diff_~Alen, ULTIMATE.start_diff_~D.base, ULTIMATE.start_diff_#in~Blen, ULTIMATE.start_main_~B~0.offset, ULTIMATE.start_main_~B~0.base, ULTIMATE.start_diff_#in~A.offset, ULTIMATE.start_main_~D~0.offset, ULTIMATE.start_diff_#in~D.offset, ULTIMATE.start_diff_#in~Alen, ULTIMATE.start_diff_~A.base, ULTIMATE.start_diff_~B.base, #length, ULTIMATE.start_main_#t~malloc9.offset, ULTIMATE.start_diff_#t~mem3, ULTIMATE.start_main_~A~0.offset, ULTIMATE.start_main_#t~malloc10.offset, ULTIMATE.start_diff_~Blen, ULTIMATE.start_main_#t~malloc8.base, ULTIMATE.start_diff_#t~mem0, ULTIMATE.start_main_#t~malloc9.base, ULTIMATE.start_diff_#t~mem1, ULTIMATE.start_main_~A~0.base, ULTIMATE.start_diff_#t~post4, ULTIMATE.start_diff_~found~0, ULTIMATE.start_diff_#in~B.offset, ULTIMATE.start_diff_~i~0, ULTIMATE.start_diff_~l1~0, ULTIMATE.start_diff_#t~post5, ULTIMATE.start_main_#t~malloc10.base, ULTIMATE.start_diff_~D.offset, ULTIMATE.start_diff_~l2~0, ULTIMATE.start_diff_~j~0, ULTIMATE.start_main_#t~malloc8.offset, #valid, ULTIMATE.start_diff_~k~0, ULTIMATE.start_diff_#in~D.base, ULTIMATE.start_diff_#t~post2, ULTIMATE.start_diff_~A.offset, ULTIMATE.start_main_~D~0.base] 2353#L13-2 [91] L13-2-->L17-4: Formula: (and (< v_ULTIMATE.start_diff_~i~0_4 v_ULTIMATE.start_diff_~l1~0_4) (= v_ULTIMATE.start_diff_~j~0_2 0) (= v_ULTIMATE.start_diff_~found~0_3 0)) InVars {ULTIMATE.start_diff_~i~0=v_ULTIMATE.start_diff_~i~0_4, ULTIMATE.start_diff_~l1~0=v_ULTIMATE.start_diff_~l1~0_4} OutVars{ULTIMATE.start_diff_~found~0=v_ULTIMATE.start_diff_~found~0_3, ULTIMATE.start_diff_~i~0=v_ULTIMATE.start_diff_~i~0_4, ULTIMATE.start_diff_~l1~0=v_ULTIMATE.start_diff_~l1~0_4, ULTIMATE.start_diff_~j~0=v_ULTIMATE.start_diff_~j~0_2} AuxVars[] AssignedVars[ULTIMATE.start_diff_~found~0, ULTIMATE.start_diff_~j~0] 2355#L17-4 [99] L17-4-->L17: Formula: (and (= 0 v_ULTIMATE.start_diff_~found~0_5) (< v_ULTIMATE.start_diff_~j~0_4 v_ULTIMATE.start_diff_~l2~0_4)) InVars {ULTIMATE.start_diff_~found~0=v_ULTIMATE.start_diff_~found~0_5, ULTIMATE.start_diff_~j~0=v_ULTIMATE.start_diff_~j~0_4, ULTIMATE.start_diff_~l2~0=v_ULTIMATE.start_diff_~l2~0_4} OutVars{ULTIMATE.start_diff_~found~0=v_ULTIMATE.start_diff_~found~0_5, ULTIMATE.start_diff_~j~0=v_ULTIMATE.start_diff_~j~0_4, ULTIMATE.start_diff_~l2~0=v_ULTIMATE.start_diff_~l2~0_4} AuxVars[] AssignedVars[] 2347#L17 72.89/34.80 [2019-03-28 12:50:45,830 INFO L796 eck$LassoCheckResult]: Loop: 2347#L17 [85] L17-->L17-1: Formula: (let ((.cse0 (* 4 v_ULTIMATE.start_diff_~i~0_5))) (let ((.cse1 (+ .cse0 v_ULTIMATE.start_diff_~A.offset_3))) (and (<= (+ .cse0 v_ULTIMATE.start_diff_~A.offset_3 4) (select |v_#length_5| v_ULTIMATE.start_diff_~A.base_3)) (= 1 (select |v_#valid_11| v_ULTIMATE.start_diff_~A.base_3)) (= (select (select |v_#memory_int_1| v_ULTIMATE.start_diff_~A.base_3) .cse1) |v_ULTIMATE.start_diff_#t~mem0_2|) (<= 0 .cse1)))) InVars {ULTIMATE.start_diff_~i~0=v_ULTIMATE.start_diff_~i~0_5, ULTIMATE.start_diff_~A.base=v_ULTIMATE.start_diff_~A.base_3, #valid=|v_#valid_11|, #memory_int=|v_#memory_int_1|, #length=|v_#length_5|, ULTIMATE.start_diff_~A.offset=v_ULTIMATE.start_diff_~A.offset_3} OutVars{ULTIMATE.start_diff_#t~mem0=|v_ULTIMATE.start_diff_#t~mem0_2|, ULTIMATE.start_diff_~i~0=v_ULTIMATE.start_diff_~i~0_5, ULTIMATE.start_diff_~A.base=v_ULTIMATE.start_diff_~A.base_3, #valid=|v_#valid_11|, #memory_int=|v_#memory_int_1|, #length=|v_#length_5|, ULTIMATE.start_diff_~A.offset=v_ULTIMATE.start_diff_~A.offset_3} AuxVars[] AssignedVars[ULTIMATE.start_diff_#t~mem0] 2345#L17-1 [82] L17-1-->L17-2: Formula: (let ((.cse1 (* 4 v_ULTIMATE.start_diff_~j~0_5))) (let ((.cse0 (+ v_ULTIMATE.start_diff_~B.offset_3 .cse1))) (and (<= 0 .cse0) (= 1 (select |v_#valid_13| v_ULTIMATE.start_diff_~B.base_3)) (= (select (select |v_#memory_int_2| v_ULTIMATE.start_diff_~B.base_3) .cse0) |v_ULTIMATE.start_diff_#t~mem1_2|) (<= (+ v_ULTIMATE.start_diff_~B.offset_3 .cse1 4) (select |v_#length_7| v_ULTIMATE.start_diff_~B.base_3))))) InVars {ULTIMATE.start_diff_~B.offset=v_ULTIMATE.start_diff_~B.offset_3, ULTIMATE.start_diff_~j~0=v_ULTIMATE.start_diff_~j~0_5, #valid=|v_#valid_13|, ULTIMATE.start_diff_~B.base=v_ULTIMATE.start_diff_~B.base_3, #memory_int=|v_#memory_int_2|, #length=|v_#length_7|} OutVars{ULTIMATE.start_diff_#t~mem1=|v_ULTIMATE.start_diff_#t~mem1_2|, ULTIMATE.start_diff_~B.offset=v_ULTIMATE.start_diff_~B.offset_3, ULTIMATE.start_diff_~j~0=v_ULTIMATE.start_diff_~j~0_5, #valid=|v_#valid_13|, ULTIMATE.start_diff_~B.base=v_ULTIMATE.start_diff_~B.base_3, #memory_int=|v_#memory_int_2|, #length=|v_#length_7|} AuxVars[] AssignedVars[ULTIMATE.start_diff_#t~mem1] 2341#L17-2 [148] L17-2-->L17-4: Formula: (and (= v_ULTIMATE.start_diff_~j~0_7 (+ v_ULTIMATE.start_diff_~j~0_8 1)) (< |v_ULTIMATE.start_diff_#t~mem1_6| |v_ULTIMATE.start_diff_#t~mem0_6|)) InVars {ULTIMATE.start_diff_#t~mem0=|v_ULTIMATE.start_diff_#t~mem0_6|, ULTIMATE.start_diff_#t~mem1=|v_ULTIMATE.start_diff_#t~mem1_6|, ULTIMATE.start_diff_~j~0=v_ULTIMATE.start_diff_~j~0_8} OutVars{ULTIMATE.start_diff_#t~mem0=|v_ULTIMATE.start_diff_#t~mem0_5|, ULTIMATE.start_diff_#t~mem1=|v_ULTIMATE.start_diff_#t~mem1_5|, ULTIMATE.start_diff_#t~post2=|v_ULTIMATE.start_diff_#t~post2_2|, ULTIMATE.start_diff_~j~0=v_ULTIMATE.start_diff_~j~0_7} AuxVars[] AssignedVars[ULTIMATE.start_diff_#t~mem0, ULTIMATE.start_diff_#t~mem1, ULTIMATE.start_diff_~j~0, ULTIMATE.start_diff_#t~post2] 2342#L17-4 [99] L17-4-->L17: Formula: (and (= 0 v_ULTIMATE.start_diff_~found~0_5) (< v_ULTIMATE.start_diff_~j~0_4 v_ULTIMATE.start_diff_~l2~0_4)) InVars {ULTIMATE.start_diff_~found~0=v_ULTIMATE.start_diff_~found~0_5, ULTIMATE.start_diff_~j~0=v_ULTIMATE.start_diff_~j~0_4, ULTIMATE.start_diff_~l2~0=v_ULTIMATE.start_diff_~l2~0_4} OutVars{ULTIMATE.start_diff_~found~0=v_ULTIMATE.start_diff_~found~0_5, ULTIMATE.start_diff_~j~0=v_ULTIMATE.start_diff_~j~0_4, ULTIMATE.start_diff_~l2~0=v_ULTIMATE.start_diff_~l2~0_4} AuxVars[] AssignedVars[] 2347#L17 72.89/34.80 [2019-03-28 12:50:45,830 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 72.89/34.80 [2019-03-28 12:50:45,830 INFO L82 PathProgramCache]: Analyzing trace with hash 959425171, now seen corresponding path program 1 times 72.89/34.80 [2019-03-28 12:50:45,830 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 72.89/34.80 [2019-03-28 12:50:45,830 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 72.89/34.80 [2019-03-28 12:50:45,831 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 72.89/34.80 [2019-03-28 12:50:45,831 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 72.89/34.80 [2019-03-28 12:50:45,831 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 72.89/34.80 [2019-03-28 12:50:45,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 72.89/34.80 [2019-03-28 12:50:45,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 72.89/34.80 [2019-03-28 12:50:45,841 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 72.89/34.80 [2019-03-28 12:50:45,841 INFO L82 PathProgramCache]: Analyzing trace with hash 3539245, now seen corresponding path program 1 times 72.89/34.80 [2019-03-28 12:50:45,841 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 72.89/34.80 [2019-03-28 12:50:45,841 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 72.89/34.80 [2019-03-28 12:50:45,842 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 72.89/34.80 [2019-03-28 12:50:45,842 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 72.89/34.80 [2019-03-28 12:50:45,842 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 72.89/34.80 [2019-03-28 12:50:45,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 72.89/34.80 [2019-03-28 12:50:45,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 72.89/34.80 [2019-03-28 12:50:45,846 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 72.89/34.80 [2019-03-28 12:50:45,846 INFO L82 PathProgramCache]: Analyzing trace with hash 1837765311, now seen corresponding path program 1 times 72.89/34.80 [2019-03-28 12:50:45,846 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 72.89/34.80 [2019-03-28 12:50:45,846 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 72.89/34.80 [2019-03-28 12:50:45,847 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 72.89/34.80 [2019-03-28 12:50:45,847 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 72.89/34.80 [2019-03-28 12:50:45,847 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 72.89/34.80 [2019-03-28 12:50:45,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 72.89/34.80 [2019-03-28 12:50:45,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 72.89/34.80 [2019-03-28 12:50:46,275 WARN L188 SmtUtils]: Spent 357.00 ms on a formula simplification. DAG size of input: 111 DAG size of output: 108 72.89/34.80 [2019-03-28 12:50:46,437 WARN L188 SmtUtils]: Spent 160.00 ms on a formula simplification that was a NOOP. DAG size: 104 72.89/34.80 [2019-03-28 12:50:46,439 INFO L216 LassoAnalysis]: Preferences: 72.89/34.80 [2019-03-28 12:50:46,439 INFO L124 ssoRankerPreferences]: Compute integeral hull: false 72.89/34.80 [2019-03-28 12:50:46,439 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true 72.89/34.80 [2019-03-28 12:50:46,439 INFO L126 ssoRankerPreferences]: Term annotations enabled: false 72.89/34.80 [2019-03-28 12:50:46,439 INFO L127 ssoRankerPreferences]: Use exernal solver: false 72.89/34.80 [2019-03-28 12:50:46,439 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 72.89/34.80 [2019-03-28 12:50:46,440 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false 72.89/34.80 [2019-03-28 12:50:46,440 INFO L130 ssoRankerPreferences]: Path of dumped script: 72.89/34.80 [2019-03-28 12:50:46,440 INFO L131 ssoRankerPreferences]: Filename of dumped script: theBenchmark.c_BEv2_Iteration13_Lasso 72.89/34.80 [2019-03-28 12:50:46,440 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank 72.89/34.80 [2019-03-28 12:50:46,440 INFO L282 LassoAnalysis]: Starting lasso preprocessing... 72.89/34.80 [2019-03-28 12:50:46,442 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 72.89/34.80 [2019-03-28 12:50:46,444 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 72.89/34.80 [2019-03-28 12:50:46,445 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 72.89/34.80 [2019-03-28 12:50:46,447 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 72.89/34.80 [2019-03-28 12:50:46,448 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 72.89/34.80 [2019-03-28 12:50:46,449 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 72.89/34.80 [2019-03-28 12:50:46,451 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 72.89/34.80 [2019-03-28 12:50:46,767 WARN L188 SmtUtils]: Spent 247.00 ms on a formula simplification. DAG size of input: 102 DAG size of output: 95 72.89/34.80 [2019-03-28 12:50:46,800 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 72.89/34.80 [2019-03-28 12:50:46,802 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 72.89/34.80 [2019-03-28 12:50:46,804 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 72.89/34.80 [2019-03-28 12:50:46,806 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 72.89/34.80 [2019-03-28 12:50:46,813 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 72.89/34.80 [2019-03-28 12:50:46,814 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 72.89/34.80 [2019-03-28 12:50:46,815 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 72.89/34.80 [2019-03-28 12:50:46,818 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 72.89/34.80 [2019-03-28 12:50:46,994 WARN L188 SmtUtils]: Spent 127.00 ms on a formula simplification that was a NOOP. DAG size: 78 72.89/34.80 [2019-03-28 12:50:47,240 WARN L188 SmtUtils]: Spent 125.00 ms on a formula simplification that was a NOOP. DAG size: 78 72.89/34.80 [2019-03-28 12:50:47,320 INFO L300 LassoAnalysis]: Preprocessing complete. 72.89/34.80 [2019-03-28 12:50:47,320 INFO L497 LassoAnalysis]: Using template 'affine'. 72.89/34.80 [2019-03-28 12:50:47,321 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 72.89/34.80 Termination analysis: LINEAR_WITH_GUESSES 72.89/34.80 Number of strict supporting invariants: 0 72.89/34.80 Number of non-strict supporting invariants: 1 72.89/34.80 Consider only non-deceasing supporting invariants: true 72.89/34.80 Simplify termination arguments: true 72.89/34.80 Simplify supporting invariants: trueOverapproximate stem: false 72.89/34.80 [2019-03-28 12:50:47,321 INFO L339 nArgumentSynthesizer]: Template has degree 0. 72.89/34.80 [2019-03-28 12:50:47,321 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 72.89/34.80 [2019-03-28 12:50:47,322 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 72.89/34.80 [2019-03-28 12:50:47,322 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 72.89/34.80 [2019-03-28 12:50:47,322 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 72.89/34.80 [2019-03-28 12:50:47,322 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 72.89/34.80 [2019-03-28 12:50:47,322 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 72.89/34.80 [2019-03-28 12:50:47,323 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 72.89/34.80 [2019-03-28 12:50:47,323 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 72.89/34.80 Termination analysis: LINEAR_WITH_GUESSES 72.89/34.80 Number of strict supporting invariants: 0 72.89/34.80 Number of non-strict supporting invariants: 1 72.89/34.80 Consider only non-deceasing supporting invariants: true 72.89/34.80 Simplify termination arguments: true 72.89/34.80 Simplify supporting invariants: trueOverapproximate stem: false 72.89/34.80 [2019-03-28 12:50:47,323 INFO L339 nArgumentSynthesizer]: Template has degree 0. 72.89/34.80 [2019-03-28 12:50:47,323 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 72.89/34.80 [2019-03-28 12:50:47,324 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 72.89/34.80 [2019-03-28 12:50:47,324 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 72.89/34.80 [2019-03-28 12:50:47,324 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 72.89/34.80 [2019-03-28 12:50:47,324 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 72.89/34.80 [2019-03-28 12:50:47,324 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 72.89/34.80 [2019-03-28 12:50:47,324 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 72.89/34.80 [2019-03-28 12:50:47,325 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 72.89/34.80 Termination analysis: LINEAR_WITH_GUESSES 72.89/34.80 Number of strict supporting invariants: 0 72.89/34.80 Number of non-strict supporting invariants: 1 72.89/34.80 Consider only non-deceasing supporting invariants: true 72.89/34.80 Simplify termination arguments: true 72.89/34.80 Simplify supporting invariants: trueOverapproximate stem: false 72.89/34.80 [2019-03-28 12:50:47,325 INFO L339 nArgumentSynthesizer]: Template has degree 0. 72.89/34.80 [2019-03-28 12:50:47,325 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 72.89/34.80 [2019-03-28 12:50:47,325 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 72.89/34.80 [2019-03-28 12:50:47,325 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 72.89/34.80 [2019-03-28 12:50:47,325 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 72.89/34.80 [2019-03-28 12:50:47,326 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 72.89/34.80 [2019-03-28 12:50:47,326 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 72.89/34.80 [2019-03-28 12:50:47,326 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 72.89/34.80 [2019-03-28 12:50:47,326 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 72.89/34.80 Termination analysis: LINEAR_WITH_GUESSES 72.89/34.80 Number of strict supporting invariants: 0 72.89/34.80 Number of non-strict supporting invariants: 1 72.89/34.80 Consider only non-deceasing supporting invariants: true 72.89/34.80 Simplify termination arguments: true 72.89/34.80 Simplify supporting invariants: trueOverapproximate stem: false 72.89/34.80 [2019-03-28 12:50:47,326 INFO L339 nArgumentSynthesizer]: Template has degree 0. 72.89/34.80 [2019-03-28 12:50:47,327 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 72.89/34.80 [2019-03-28 12:50:47,327 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 72.89/34.80 [2019-03-28 12:50:47,327 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 72.89/34.80 [2019-03-28 12:50:47,327 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 72.89/34.80 [2019-03-28 12:50:47,327 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 72.89/34.80 [2019-03-28 12:50:47,327 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 72.89/34.80 [2019-03-28 12:50:47,328 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 72.89/34.80 [2019-03-28 12:50:47,328 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 72.89/34.80 Termination analysis: LINEAR_WITH_GUESSES 72.89/34.80 Number of strict supporting invariants: 0 72.89/34.80 Number of non-strict supporting invariants: 1 72.89/34.80 Consider only non-deceasing supporting invariants: true 72.89/34.80 Simplify termination arguments: true 72.89/34.80 Simplify supporting invariants: trueOverapproximate stem: false 72.89/34.80 [2019-03-28 12:50:47,328 INFO L339 nArgumentSynthesizer]: Template has degree 0. 72.89/34.80 [2019-03-28 12:50:47,328 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 72.89/34.80 [2019-03-28 12:50:47,328 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 72.89/34.80 [2019-03-28 12:50:47,328 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 72.89/34.80 [2019-03-28 12:50:47,329 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 72.89/34.80 [2019-03-28 12:50:47,329 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 72.89/34.80 [2019-03-28 12:50:47,329 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 72.89/34.80 [2019-03-28 12:50:47,329 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 72.89/34.80 [2019-03-28 12:50:47,329 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 72.89/34.80 Termination analysis: LINEAR_WITH_GUESSES 72.89/34.80 Number of strict supporting invariants: 0 72.89/34.80 Number of non-strict supporting invariants: 1 72.89/34.80 Consider only non-deceasing supporting invariants: true 72.89/34.80 Simplify termination arguments: true 72.89/34.80 Simplify supporting invariants: trueOverapproximate stem: false 72.89/34.80 [2019-03-28 12:50:47,330 INFO L339 nArgumentSynthesizer]: Template has degree 0. 72.89/34.80 [2019-03-28 12:50:47,330 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 72.89/34.80 [2019-03-28 12:50:47,330 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 72.89/34.80 [2019-03-28 12:50:47,330 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 72.89/34.80 [2019-03-28 12:50:47,331 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. 72.89/34.80 [2019-03-28 12:50:47,331 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. 72.89/34.80 [2019-03-28 12:50:47,331 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 72.89/34.80 [2019-03-28 12:50:47,332 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 72.89/34.80 Termination analysis: LINEAR_WITH_GUESSES 72.89/34.80 Number of strict supporting invariants: 0 72.89/34.80 Number of non-strict supporting invariants: 1 72.89/34.80 Consider only non-deceasing supporting invariants: true 72.89/34.80 Simplify termination arguments: true 72.89/34.80 Simplify supporting invariants: trueOverapproximate stem: false 72.89/34.80 [2019-03-28 12:50:47,332 INFO L339 nArgumentSynthesizer]: Template has degree 0. 72.89/34.80 [2019-03-28 12:50:47,332 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 72.89/34.80 [2019-03-28 12:50:47,332 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 72.89/34.80 [2019-03-28 12:50:47,332 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 72.89/34.80 [2019-03-28 12:50:47,333 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. 72.89/34.80 [2019-03-28 12:50:47,333 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. 72.89/34.80 [2019-03-28 12:50:47,335 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 72.89/34.80 [2019-03-28 12:50:47,336 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 72.89/34.80 Termination analysis: LINEAR_WITH_GUESSES 72.89/34.80 Number of strict supporting invariants: 0 72.89/34.80 Number of non-strict supporting invariants: 1 72.89/34.80 Consider only non-deceasing supporting invariants: true 72.89/34.80 Simplify termination arguments: true 72.89/34.80 Simplify supporting invariants: trueOverapproximate stem: false 72.89/34.80 [2019-03-28 12:50:47,336 INFO L339 nArgumentSynthesizer]: Template has degree 0. 72.89/34.80 [2019-03-28 12:50:47,336 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 72.89/34.80 [2019-03-28 12:50:47,336 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 72.89/34.80 [2019-03-28 12:50:47,336 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 72.89/34.80 [2019-03-28 12:50:47,337 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. 72.89/34.80 [2019-03-28 12:50:47,337 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. 72.89/34.80 [2019-03-28 12:50:47,339 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 72.89/34.80 [2019-03-28 12:50:47,339 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 72.89/34.80 Termination analysis: LINEAR_WITH_GUESSES 72.89/34.80 Number of strict supporting invariants: 0 72.89/34.80 Number of non-strict supporting invariants: 1 72.89/34.80 Consider only non-deceasing supporting invariants: true 72.89/34.80 Simplify termination arguments: true 72.89/34.80 Simplify supporting invariants: trueOverapproximate stem: false 72.89/34.80 [2019-03-28 12:50:47,340 INFO L339 nArgumentSynthesizer]: Template has degree 0. 72.89/34.80 [2019-03-28 12:50:47,340 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 72.89/34.80 [2019-03-28 12:50:47,340 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 72.89/34.80 [2019-03-28 12:50:47,340 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 72.89/34.80 [2019-03-28 12:50:47,341 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. 72.89/34.80 [2019-03-28 12:50:47,341 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. 72.89/34.80 [2019-03-28 12:50:47,343 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 72.89/34.80 [2019-03-28 12:50:47,343 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 72.89/34.80 Termination analysis: LINEAR_WITH_GUESSES 72.89/34.80 Number of strict supporting invariants: 0 72.89/34.80 Number of non-strict supporting invariants: 1 72.89/34.80 Consider only non-deceasing supporting invariants: true 72.89/34.80 Simplify termination arguments: true 72.89/34.80 Simplify supporting invariants: trueOverapproximate stem: false 72.89/34.80 [2019-03-28 12:50:47,343 INFO L339 nArgumentSynthesizer]: Template has degree 0. 72.89/34.80 [2019-03-28 12:50:47,344 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 72.89/34.80 [2019-03-28 12:50:47,344 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 72.89/34.80 [2019-03-28 12:50:47,344 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 72.89/34.80 [2019-03-28 12:50:47,344 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. 72.89/34.80 [2019-03-28 12:50:47,345 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. 72.89/34.80 [2019-03-28 12:50:47,345 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 72.89/34.80 [2019-03-28 12:50:47,345 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 72.89/34.80 Termination analysis: LINEAR_WITH_GUESSES 72.89/34.80 Number of strict supporting invariants: 0 72.89/34.80 Number of non-strict supporting invariants: 1 72.89/34.80 Consider only non-deceasing supporting invariants: true 72.89/34.80 Simplify termination arguments: true 72.89/34.80 Simplify supporting invariants: trueOverapproximate stem: false 72.89/34.80 [2019-03-28 12:50:47,346 INFO L339 nArgumentSynthesizer]: Template has degree 0. 72.89/34.80 [2019-03-28 12:50:47,346 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 72.89/34.80 [2019-03-28 12:50:47,346 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 72.89/34.80 [2019-03-28 12:50:47,346 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 72.89/34.80 [2019-03-28 12:50:47,348 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. 72.89/34.80 [2019-03-28 12:50:47,349 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. 72.89/34.80 [2019-03-28 12:50:47,363 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. 72.89/34.80 [2019-03-28 12:50:47,380 INFO L443 ModelExtractionUtils]: Simplification made 6 calls to the SMT solver. 72.89/34.80 [2019-03-28 12:50:47,381 INFO L444 ModelExtractionUtils]: 65 out of 73 variables were initially zero. Simplification set additionally 4 variables to zero. 72.89/34.80 [2019-03-28 12:50:47,381 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... 72.89/34.80 [2019-03-28 12:50:47,382 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. 72.89/34.80 [2019-03-28 12:50:47,382 INFO L518 LassoAnalysis]: Proved termination. 72.89/34.80 [2019-03-28 12:50:47,382 INFO L520 LassoAnalysis]: Termination argument consisting of: 72.89/34.80 Ranking function f(ULTIMATE.start_diff_~B.offset, v_rep(select #length ULTIMATE.start_diff_~B.base)_10, ULTIMATE.start_diff_~j~0) = -1*ULTIMATE.start_diff_~B.offset + 1*v_rep(select #length ULTIMATE.start_diff_~B.base)_10 - 4*ULTIMATE.start_diff_~j~0 72.89/34.80 Supporting invariants [] 72.89/34.80 [2019-03-28 12:50:47,421 INFO L297 tatePredicateManager]: 15 out of 15 supporting invariants were superfluous and have been removed 72.89/34.80 [2019-03-28 12:50:47,422 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 72.89/34.80 [2019-03-28 12:50:47,433 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 72.89/34.80 [2019-03-28 12:50:47,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 72.89/34.80 [2019-03-28 12:50:47,453 INFO L256 TraceCheckSpWp]: Trace formula consists of 91 conjuncts, 2 conjunts are in the unsatisfiable core 72.89/34.80 [2019-03-28 12:50:47,454 INFO L279 TraceCheckSpWp]: Computing forward predicates... 72.89/34.80 [2019-03-28 12:50:47,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 72.89/34.80 [2019-03-28 12:50:47,460 INFO L256 TraceCheckSpWp]: Trace formula consists of 20 conjuncts, 4 conjunts are in the unsatisfiable core 72.89/34.80 [2019-03-28 12:50:47,460 INFO L279 TraceCheckSpWp]: Computing forward predicates... 72.89/34.80 [2019-03-28 12:50:47,484 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 72.89/34.80 [2019-03-28 12:50:47,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 72.89/34.80 [2019-03-28 12:50:47,500 INFO L256 TraceCheckSpWp]: Trace formula consists of 20 conjuncts, 4 conjunts are in the unsatisfiable core 72.89/34.80 [2019-03-28 12:50:47,500 INFO L279 TraceCheckSpWp]: Computing forward predicates... 72.89/34.80 [2019-03-28 12:50:47,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 72.89/34.80 [2019-03-28 12:50:47,520 INFO L256 TraceCheckSpWp]: Trace formula consists of 20 conjuncts, 4 conjunts are in the unsatisfiable core 72.89/34.80 [2019-03-28 12:50:47,520 INFO L279 TraceCheckSpWp]: Computing forward predicates... 72.89/34.80 [2019-03-28 12:50:47,524 INFO L98 LoopCannibalizer]: 3 predicates before loop cannibalization 4 predicates after loop cannibalization 72.89/34.80 [2019-03-28 12:50:47,525 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 72.89/34.80 [2019-03-28 12:50:47,525 INFO L69 BuchiDifferenceNCSB]: Start buchiDifferenceNCSB. First operand 45 states and 80 transitions. cyclomatic complexity: 39 Second operand 5 states. 72.89/34.80 [2019-03-28 12:50:47,602 INFO L73 BuchiDifferenceNCSB]: Finished buchiDifferenceNCSB. First operand 45 states and 80 transitions. cyclomatic complexity: 39. Second operand 5 states. Result 128 states and 178 transitions. Complement of second has 14 states. 72.89/34.80 [2019-03-28 12:50:47,603 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 72.89/34.80 [2019-03-28 12:50:47,603 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. 72.89/34.80 [2019-03-28 12:50:47,603 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 50 transitions. 72.89/34.80 [2019-03-28 12:50:47,603 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 50 transitions. Stem has 6 letters. Loop has 4 letters. 72.89/34.80 [2019-03-28 12:50:47,604 INFO L116 BuchiAccepts]: Finished buchiAccepts. 72.89/34.80 [2019-03-28 12:50:47,604 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 50 transitions. Stem has 10 letters. Loop has 4 letters. 72.89/34.80 [2019-03-28 12:50:47,604 INFO L116 BuchiAccepts]: Finished buchiAccepts. 72.89/34.80 [2019-03-28 12:50:47,604 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 50 transitions. Stem has 6 letters. Loop has 8 letters. 72.89/34.80 [2019-03-28 12:50:47,605 INFO L116 BuchiAccepts]: Finished buchiAccepts. 72.89/34.80 [2019-03-28 12:50:47,608 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 128 states and 178 transitions. 72.89/34.80 [2019-03-28 12:50:47,610 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 72.89/34.80 [2019-03-28 12:50:47,610 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 128 states to 0 states and 0 transitions. 72.89/34.80 [2019-03-28 12:50:47,610 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 72.89/34.80 [2019-03-28 12:50:47,610 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 72.89/34.80 [2019-03-28 12:50:47,610 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. 72.89/34.80 [2019-03-28 12:50:47,610 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. 72.89/34.80 [2019-03-28 12:50:47,610 INFO L706 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. 72.89/34.80 [2019-03-28 12:50:47,610 INFO L729 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. 72.89/34.80 [2019-03-28 12:50:47,611 INFO L609 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. 72.89/34.80 [2019-03-28 12:50:47,611 INFO L442 BuchiCegarLoop]: ======== Iteration 14============ 72.89/34.80 [2019-03-28 12:50:47,611 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. 72.89/34.80 [2019-03-28 12:50:47,611 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 72.89/34.80 [2019-03-28 12:50:47,611 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true 72.89/34.80 [2019-03-28 12:50:47,617 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 28.03 12:50:47 BasicIcfg 72.89/34.80 [2019-03-28 12:50:47,617 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- 72.89/34.80 [2019-03-28 12:50:47,618 INFO L168 Benchmark]: Toolchain (without parser) took 29698.61 ms. Allocated memory was 649.6 MB in the beginning and 1.2 GB in the end (delta: 502.8 MB). Free memory was 564.6 MB in the beginning and 379.8 MB in the end (delta: 184.8 MB). Peak memory consumption was 687.6 MB. Max. memory is 50.3 GB. 72.89/34.80 [2019-03-28 12:50:47,619 INFO L168 Benchmark]: CDTParser took 0.17 ms. Allocated memory is still 649.6 MB. Free memory is still 585.4 MB. There was no memory consumed. Max. memory is 50.3 GB. 72.89/34.80 [2019-03-28 12:50:47,619 INFO L168 Benchmark]: CACSL2BoogieTranslator took 309.29 ms. Allocated memory was 649.6 MB in the beginning and 661.1 MB in the end (delta: 11.5 MB). Free memory was 564.6 MB in the beginning and 627.9 MB in the end (delta: -63.4 MB). Peak memory consumption was 30.0 MB. Max. memory is 50.3 GB. 72.89/34.80 [2019-03-28 12:50:47,619 INFO L168 Benchmark]: Boogie Procedure Inliner took 41.91 ms. Allocated memory is still 661.1 MB. Free memory was 627.9 MB in the beginning and 624.0 MB in the end (delta: 4.0 MB). Peak memory consumption was 4.0 MB. Max. memory is 50.3 GB. 72.89/34.80 [2019-03-28 12:50:47,620 INFO L168 Benchmark]: Boogie Preprocessor took 27.41 ms. Allocated memory is still 661.1 MB. Free memory was 624.0 MB in the beginning and 621.8 MB in the end (delta: 2.2 MB). Peak memory consumption was 2.2 MB. Max. memory is 50.3 GB. 72.89/34.80 [2019-03-28 12:50:47,620 INFO L168 Benchmark]: RCFGBuilder took 314.74 ms. Allocated memory is still 661.1 MB. Free memory was 621.8 MB in the beginning and 599.7 MB in the end (delta: 22.1 MB). Peak memory consumption was 22.1 MB. Max. memory is 50.3 GB. 72.89/34.80 [2019-03-28 12:50:47,621 INFO L168 Benchmark]: BlockEncodingV2 took 138.99 ms. Allocated memory is still 661.1 MB. Free memory was 599.7 MB in the beginning and 590.0 MB in the end (delta: 9.7 MB). Peak memory consumption was 9.7 MB. Max. memory is 50.3 GB. 72.89/34.80 [2019-03-28 12:50:47,621 INFO L168 Benchmark]: TraceAbstraction took 9644.37 ms. Allocated memory was 661.1 MB in the beginning and 847.8 MB in the end (delta: 186.6 MB). Free memory was 590.0 MB in the beginning and 382.2 MB in the end (delta: 207.8 MB). Peak memory consumption was 394.9 MB. Max. memory is 50.3 GB. 72.89/34.80 [2019-03-28 12:50:47,622 INFO L168 Benchmark]: BuchiAutomizer took 19216.49 ms. Allocated memory was 847.8 MB in the beginning and 1.2 GB in the end (delta: 304.6 MB). Free memory was 382.2 MB in the beginning and 379.8 MB in the end (delta: 2.4 MB). Peak memory consumption was 307.0 MB. Max. memory is 50.3 GB. 72.89/34.80 [2019-03-28 12:50:47,625 INFO L337 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### 72.89/34.80 --- Results --- 72.89/34.80 * Results from de.uni_freiburg.informatik.ultimate.plugins.blockencoding: 72.89/34.80 - StatisticsResult: Initial Icfg 72.89/34.80 27 locations, 34 edges 72.89/34.80 - StatisticsResult: Encoded RCFG 72.89/34.80 21 locations, 45 edges 72.89/34.80 * Results from de.uni_freiburg.informatik.ultimate.core: 72.89/34.80 - StatisticsResult: Toolchain Benchmarks 72.89/34.80 Benchmark results are: 72.89/34.80 * CDTParser took 0.17 ms. Allocated memory is still 649.6 MB. Free memory is still 585.4 MB. There was no memory consumed. Max. memory is 50.3 GB. 72.89/34.80 * CACSL2BoogieTranslator took 309.29 ms. Allocated memory was 649.6 MB in the beginning and 661.1 MB in the end (delta: 11.5 MB). Free memory was 564.6 MB in the beginning and 627.9 MB in the end (delta: -63.4 MB). Peak memory consumption was 30.0 MB. Max. memory is 50.3 GB. 72.89/34.80 * Boogie Procedure Inliner took 41.91 ms. Allocated memory is still 661.1 MB. Free memory was 627.9 MB in the beginning and 624.0 MB in the end (delta: 4.0 MB). Peak memory consumption was 4.0 MB. Max. memory is 50.3 GB. 72.89/34.80 * Boogie Preprocessor took 27.41 ms. Allocated memory is still 661.1 MB. Free memory was 624.0 MB in the beginning and 621.8 MB in the end (delta: 2.2 MB). Peak memory consumption was 2.2 MB. Max. memory is 50.3 GB. 72.89/34.80 * RCFGBuilder took 314.74 ms. Allocated memory is still 661.1 MB. Free memory was 621.8 MB in the beginning and 599.7 MB in the end (delta: 22.1 MB). Peak memory consumption was 22.1 MB. Max. memory is 50.3 GB. 72.89/34.80 * BlockEncodingV2 took 138.99 ms. Allocated memory is still 661.1 MB. Free memory was 599.7 MB in the beginning and 590.0 MB in the end (delta: 9.7 MB). Peak memory consumption was 9.7 MB. Max. memory is 50.3 GB. 72.89/34.80 * TraceAbstraction took 9644.37 ms. Allocated memory was 661.1 MB in the beginning and 847.8 MB in the end (delta: 186.6 MB). Free memory was 590.0 MB in the beginning and 382.2 MB in the end (delta: 207.8 MB). Peak memory consumption was 394.9 MB. Max. memory is 50.3 GB. 72.89/34.80 * BuchiAutomizer took 19216.49 ms. Allocated memory was 847.8 MB in the beginning and 1.2 GB in the end (delta: 304.6 MB). Free memory was 382.2 MB in the beginning and 379.8 MB in the end (delta: 2.4 MB). Peak memory consumption was 307.0 MB. Max. memory is 50.3 GB. 72.89/34.80 * Results from de.uni_freiburg.informatik.ultimate.boogie.preprocessor: 72.89/34.80 - GenericResult: Unfinished Backtranslation 72.89/34.80 Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] 72.89/34.80 - GenericResult: Unfinished Backtranslation 72.89/34.80 Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] 72.89/34.80 - GenericResult: Unfinished Backtranslation 72.89/34.80 Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_#t~malloc8.base,QUANTIFIED] 72.89/34.80 - GenericResult: Unfinished Backtranslation 72.89/34.80 Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] 72.89/34.80 - GenericResult: Unfinished Backtranslation 72.89/34.80 Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] 72.89/34.80 - GenericResult: Unfinished Backtranslation 72.89/34.80 Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] 72.89/34.80 - GenericResult: Unfinished Backtranslation 72.89/34.80 Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_#t~malloc8.base,QUANTIFIED] 72.89/34.80 - GenericResult: Unfinished Backtranslation 72.89/34.80 Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] 72.89/34.80 - GenericResult: Unfinished Backtranslation 72.89/34.80 Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] 72.89/34.80 - GenericResult: Unfinished Backtranslation 72.89/34.80 Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] 72.89/34.80 - GenericResult: Unfinished Backtranslation 72.89/34.80 Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_#t~malloc8.base,QUANTIFIED] 72.89/34.80 - GenericResult: Unfinished Backtranslation 72.89/34.80 Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] 72.89/34.80 - GenericResult: Unfinished Backtranslation 72.89/34.80 Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] 72.89/34.80 - GenericResult: Unfinished Backtranslation 72.89/34.80 Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] 72.89/34.80 - GenericResult: Unfinished Backtranslation 72.89/34.80 Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_#t~malloc8.base,QUANTIFIED] 72.89/34.80 - GenericResult: Unfinished Backtranslation 72.89/34.80 Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] 72.89/34.80 - GenericResult: Unfinished Backtranslation 72.89/34.80 Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] 72.89/34.80 - GenericResult: Unfinished Backtranslation 72.89/34.80 Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] 72.89/34.80 - GenericResult: Unfinished Backtranslation 72.89/34.80 Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_#t~malloc8.base,QUANTIFIED] 72.89/34.80 - GenericResult: Unfinished Backtranslation 72.89/34.80 Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] 72.89/34.80 - GenericResult: Unfinished Backtranslation 72.89/34.80 Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] 72.89/34.80 - GenericResult: Unfinished Backtranslation 72.89/34.80 Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] 72.89/34.80 - GenericResult: Unfinished Backtranslation 72.89/34.80 Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_#t~malloc8.base,QUANTIFIED] 72.89/34.80 - GenericResult: Unfinished Backtranslation 72.89/34.80 Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] 72.89/34.80 - GenericResult: Unfinished Backtranslation 72.89/34.80 Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] 72.89/34.80 - GenericResult: Unfinished Backtranslation 72.89/34.80 Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] 72.89/34.80 - GenericResult: Unfinished Backtranslation 72.89/34.80 Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_#t~malloc8.base,QUANTIFIED] 72.89/34.80 - GenericResult: Unfinished Backtranslation 72.89/34.80 Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] 72.89/34.80 - GenericResult: Unfinished Backtranslation 72.89/34.80 Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] 72.89/34.80 - GenericResult: Unfinished Backtranslation 72.89/34.80 Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] 72.89/34.80 - GenericResult: Unfinished Backtranslation 72.89/34.80 Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_#t~malloc8.base,QUANTIFIED] 72.89/34.80 - GenericResult: Unfinished Backtranslation 72.89/34.80 Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] 72.89/34.80 - GenericResult: Unfinished Backtranslation 72.89/34.80 Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] 72.89/34.80 - GenericResult: Unfinished Backtranslation 72.89/34.80 Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] 72.89/34.80 - GenericResult: Unfinished Backtranslation 72.89/34.80 Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_#t~malloc8.base,QUANTIFIED] 72.89/34.80 - GenericResult: Unfinished Backtranslation 72.89/34.80 Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] 72.89/34.80 - GenericResult: Unfinished Backtranslation 72.89/34.80 Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] 72.89/34.80 - GenericResult: Unfinished Backtranslation 72.89/34.80 Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] 72.89/34.80 - GenericResult: Unfinished Backtranslation 72.89/34.80 Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_#t~malloc8.base,QUANTIFIED] 72.89/34.80 - GenericResult: Unfinished Backtranslation 72.89/34.80 Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] 72.89/34.80 * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: 72.89/34.80 - GenericResult: Unfinished Backtranslation 72.89/34.80 unknown boogie variable #length 72.89/34.80 - GenericResult: Unfinished Backtranslation 72.89/34.80 unknown boogie variable #length 72.89/34.80 - GenericResult: Unfinished Backtranslation 72.89/34.80 unknown boogie variable #length 72.89/34.80 - GenericResult: Unfinished Backtranslation 72.89/34.80 unknown boogie variable #length 72.89/34.80 - GenericResult: Unfinished Backtranslation 72.89/34.80 unknown boogie variable #length 72.89/34.80 - GenericResult: Unfinished Backtranslation 72.89/34.80 unknown boogie variable #length 72.89/34.80 - GenericResult: Unfinished Backtranslation 72.89/34.80 unknown boogie variable #length 72.89/34.80 - GenericResult: Unfinished Backtranslation 72.89/34.80 unknown boogie variable #length 72.89/34.80 - GenericResult: Unfinished Backtranslation 72.89/34.80 unknown boogie variable #length 72.89/34.80 - GenericResult: Unfinished Backtranslation 72.89/34.80 unknown boogie variable #length 72.89/34.80 - GenericResult: Unfinished Backtranslation 72.89/34.80 unknown boogie variable #length 72.89/34.80 - GenericResult: Unfinished Backtranslation 72.89/34.80 unknown boogie variable #length 72.89/34.80 - GenericResult: Unfinished Backtranslation 72.89/34.80 unknown boogie variable #length 72.89/34.80 - GenericResult: Unfinished Backtranslation 72.89/34.80 unknown boogie variable #length 72.89/34.80 - GenericResult: Unfinished Backtranslation 72.89/34.80 unknown boogie variable #length 72.89/34.80 - GenericResult: Unfinished Backtranslation 72.89/34.80 unknown boogie variable #length 72.89/34.80 - GenericResult: Unfinished Backtranslation 72.89/34.80 unknown boogie variable #length 72.89/34.80 - GenericResult: Unfinished Backtranslation 72.89/34.80 unknown boogie variable #length 72.89/34.80 - GenericResult: Unfinished Backtranslation 72.89/34.80 unknown boogie variable #length 72.89/34.80 - GenericResult: Unfinished Backtranslation 72.89/34.80 unknown boogie variable #length 72.89/34.80 - GenericResult: Unfinished Backtranslation 72.89/34.80 unknown boogie variable #length 72.89/34.80 - GenericResult: Unfinished Backtranslation 72.89/34.80 unknown boogie variable #length 72.89/34.80 - GenericResult: Unfinished Backtranslation 72.89/34.80 unknown boogie variable #length 72.89/34.80 - GenericResult: Unfinished Backtranslation 72.89/34.80 unknown boogie variable #length 72.89/34.80 - GenericResult: Unfinished Backtranslation 72.89/34.80 unknown boogie variable #length 72.89/34.80 - GenericResult: Unfinished Backtranslation 72.89/34.80 unknown boogie variable #length 72.89/34.80 - GenericResult: Unfinished Backtranslation 72.89/34.80 unknown boogie variable #length 72.89/34.80 - GenericResult: Unfinished Backtranslation 72.89/34.80 unknown boogie variable #length 72.89/34.80 - GenericResult: Unfinished Backtranslation 72.89/34.80 unknown boogie variable #length 72.89/34.80 - GenericResult: Unfinished Backtranslation 72.89/34.80 unknown boogie variable #length 72.89/34.80 - GenericResult: Unfinished Backtranslation 72.89/34.80 unknown boogie variable #length 72.89/34.80 - GenericResult: Unfinished Backtranslation 72.89/34.80 unknown boogie variable #length 72.89/34.80 - GenericResult: Unfinished Backtranslation 72.89/34.80 unknown boogie variable #length 72.89/34.80 - GenericResult: Unfinished Backtranslation 72.89/34.80 unknown boogie variable #length 72.89/34.80 - GenericResult: Unfinished Backtranslation 72.89/34.80 unknown boogie variable #length 72.89/34.80 - GenericResult: Unfinished Backtranslation 72.89/34.80 unknown boogie variable #length 72.89/34.80 - GenericResult: Unfinished Backtranslation 72.89/34.80 unknown boogie variable #length 72.89/34.80 - GenericResult: Unfinished Backtranslation 72.89/34.80 unknown boogie variable #length 72.89/34.80 - GenericResult: Unfinished Backtranslation 72.89/34.80 unknown boogie variable #length 72.89/34.80 - GenericResult: Unfinished Backtranslation 72.89/34.80 unknown boogie variable #length 72.89/34.80 - GenericResult: Unfinished Backtranslation 72.89/34.80 unknown boogie variable #length 72.89/34.80 - GenericResult: Unfinished Backtranslation 72.89/34.80 unknown boogie variable #length 72.89/34.80 - GenericResult: Unfinished Backtranslation 72.89/34.80 unknown boogie variable #length 72.89/34.80 - GenericResult: Unfinished Backtranslation 72.89/34.80 unknown boogie variable #length 72.89/34.80 - GenericResult: Unfinished Backtranslation 72.89/34.80 unknown boogie variable #length 72.89/34.80 - GenericResult: Unfinished Backtranslation 72.89/34.80 unknown boogie variable #length 72.89/34.80 - GenericResult: Unfinished Backtranslation 72.89/34.80 unknown boogie variable #length 72.89/34.80 - GenericResult: Unfinished Backtranslation 72.89/34.80 unknown boogie variable #length 72.89/34.80 - GenericResult: Unfinished Backtranslation 72.89/34.80 unknown boogie variable #length 72.89/34.80 - GenericResult: Unfinished Backtranslation 72.89/34.80 unknown boogie variable #length 72.89/34.80 - GenericResult: Unfinished Backtranslation 72.89/34.80 unknown boogie variable #length 72.89/34.80 - GenericResult: Unfinished Backtranslation 72.89/34.80 unknown boogie variable #length 72.89/34.80 - GenericResult: Unfinished Backtranslation 72.89/34.80 unknown boogie variable #length 72.89/34.80 - GenericResult: Unfinished Backtranslation 72.89/34.80 unknown boogie variable #length 72.89/34.80 - GenericResult: Unfinished Backtranslation 72.89/34.80 unknown boogie variable #length 72.89/34.80 - GenericResult: Unfinished Backtranslation 72.89/34.80 unknown boogie variable #length 72.89/34.80 - GenericResult: Unfinished Backtranslation 72.89/34.80 unknown boogie variable #length 72.89/34.80 - GenericResult: Unfinished Backtranslation 72.89/34.80 unknown boogie variable #length 72.89/34.80 - GenericResult: Unfinished Backtranslation 72.89/34.80 unknown boogie variable #length 72.89/34.80 - GenericResult: Unfinished Backtranslation 72.89/34.80 unknown boogie variable #length 72.89/34.80 - GenericResult: Unfinished Backtranslation 72.89/34.80 unknown boogie variable #length 72.89/34.80 - GenericResult: Unfinished Backtranslation 72.89/34.80 unknown boogie variable #length 72.89/34.80 - GenericResult: Unfinished Backtranslation 72.89/34.80 unknown boogie variable #length 72.89/34.80 - GenericResult: Unfinished Backtranslation 72.89/34.80 unknown boogie variable #length 72.89/34.80 - GenericResult: Unfinished Backtranslation 72.89/34.80 unknown boogie variable #length 72.89/34.80 - GenericResult: Unfinished Backtranslation 72.89/34.80 unknown boogie variable #length 72.89/34.80 - GenericResult: Unfinished Backtranslation 72.89/34.80 unknown boogie variable #length 72.89/34.80 - GenericResult: Unfinished Backtranslation 72.89/34.80 unknown boogie variable #length 72.89/34.80 - GenericResult: Unfinished Backtranslation 72.89/34.80 unknown boogie variable #length 72.89/34.80 - GenericResult: Unfinished Backtranslation 72.89/34.80 unknown boogie variable #length 72.89/34.80 - GenericResult: Unfinished Backtranslation 72.89/34.80 unknown boogie variable #length 72.89/34.80 - GenericResult: Unfinished Backtranslation 72.89/34.80 unknown boogie variable #length 72.89/34.80 - GenericResult: Unfinished Backtranslation 72.89/34.80 unknown boogie variable #length 72.89/34.80 - GenericResult: Unfinished Backtranslation 72.89/34.80 unknown boogie variable #length 72.89/34.80 - GenericResult: Unfinished Backtranslation 72.89/34.80 unknown boogie variable #length 72.89/34.80 - GenericResult: Unfinished Backtranslation 72.89/34.80 unknown boogie variable #length 72.89/34.80 - GenericResult: Unfinished Backtranslation 72.89/34.80 unknown boogie variable #length 72.89/34.80 - GenericResult: Unfinished Backtranslation 72.89/34.80 unknown boogie variable #length 72.89/34.80 - GenericResult: Unfinished Backtranslation 72.89/34.80 unknown boogie variable #length 72.89/34.80 - GenericResult: Unfinished Backtranslation 72.89/34.80 unknown boogie variable #length 72.89/34.80 - GenericResult: Unfinished Backtranslation 72.89/34.80 unknown boogie variable #length 72.89/34.80 - GenericResult: Unfinished Backtranslation 72.89/34.80 unknown boogie variable #length 72.89/34.80 - GenericResult: Unfinished Backtranslation 72.89/34.80 unknown boogie variable #length 72.89/34.80 - GenericResult: Unfinished Backtranslation 72.89/34.80 unknown boogie variable #length 72.89/34.80 - GenericResult: Unfinished Backtranslation 72.89/34.80 unknown boogie variable #length 72.89/34.80 - GenericResult: Unfinished Backtranslation 72.89/34.80 unknown boogie variable #length 72.89/34.80 - GenericResult: Unfinished Backtranslation 72.89/34.80 unknown boogie variable #length 72.89/34.80 - GenericResult: Unfinished Backtranslation 72.89/34.80 unknown boogie variable #length 72.89/34.80 - GenericResult: Unfinished Backtranslation 72.89/34.80 unknown boogie variable #length 72.89/34.80 - GenericResult: Unfinished Backtranslation 72.89/34.80 unknown boogie variable #length 72.89/34.80 - GenericResult: Unfinished Backtranslation 72.89/34.80 unknown boogie variable #length 72.89/34.80 - GenericResult: Unfinished Backtranslation 72.89/34.80 unknown boogie variable #length 72.89/34.80 - GenericResult: Unfinished Backtranslation 72.89/34.80 unknown boogie variable #length 72.89/34.80 - GenericResult: Unfinished Backtranslation 72.89/34.80 unknown boogie variable #length 72.89/34.80 - GenericResult: Unfinished Backtranslation 72.89/34.80 unknown boogie variable #length 72.89/34.80 - GenericResult: Unfinished Backtranslation 72.89/34.80 unknown boogie variable #length 72.89/34.80 - GenericResult: Unfinished Backtranslation 72.89/34.80 unknown boogie variable #length 72.89/34.80 - GenericResult: Unfinished Backtranslation 72.89/34.80 unknown boogie variable #length 72.89/34.80 - GenericResult: Unfinished Backtranslation 72.89/34.80 unknown boogie variable #length 72.89/34.80 - GenericResult: Unfinished Backtranslation 72.89/34.80 unknown boogie variable #length 72.89/34.80 - GenericResult: Unfinished Backtranslation 72.89/34.80 unknown boogie variable #length 72.89/34.80 - GenericResult: Unfinished Backtranslation 72.89/34.80 unknown boogie variable #length 72.89/34.80 - GenericResult: Unfinished Backtranslation 72.89/34.80 unknown boogie variable #length 72.89/34.80 - GenericResult: Unfinished Backtranslation 72.89/34.80 unknown boogie variable #length 72.89/34.80 - GenericResult: Unfinished Backtranslation 72.89/34.80 unknown boogie variable #length 72.89/34.80 - GenericResult: Unfinished Backtranslation 72.89/34.80 unknown boogie variable #length 72.89/34.80 - GenericResult: Unfinished Backtranslation 72.89/34.80 unknown boogie variable #length 72.89/34.80 - GenericResult: Unfinished Backtranslation 72.89/34.80 unknown boogie variable #length 72.89/34.80 - GenericResult: Unfinished Backtranslation 72.89/34.80 unknown boogie variable #length 72.89/34.80 - GenericResult: Unfinished Backtranslation 72.89/34.80 unknown boogie variable #length 72.89/34.80 - GenericResult: Unfinished Backtranslation 72.89/34.80 unknown boogie variable #length 72.89/34.80 - GenericResult: Unfinished Backtranslation 72.89/34.80 unknown boogie variable #length 72.89/34.80 - GenericResult: Unfinished Backtranslation 72.89/34.80 unknown boogie variable #length 72.89/34.80 - GenericResult: Unfinished Backtranslation 72.89/34.80 unknown boogie variable #length 72.89/34.80 - GenericResult: Unfinished Backtranslation 72.89/34.80 unknown boogie variable #length 72.89/34.80 - GenericResult: Unfinished Backtranslation 72.89/34.80 unknown boogie variable #length 72.89/34.80 * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: 72.89/34.80 - PositiveResult [Line: 24]: pointer dereference always succeeds 72.89/34.80 For all program executions holds that pointer dereference always succeeds at this location 72.89/34.80 - PositiveResult [Line: 24]: pointer dereference always succeeds 72.89/34.80 For all program executions holds that pointer dereference always succeeds at this location 72.89/34.80 - PositiveResult [Line: 17]: pointer dereference always succeeds 72.89/34.80 For all program executions holds that pointer dereference always succeeds at this location 72.89/34.80 - PositiveResult [Line: 24]: pointer dereference always succeeds 72.89/34.80 For all program executions holds that pointer dereference always succeeds at this location 72.89/34.80 - PositiveResult [Line: 17]: pointer dereference always succeeds 72.89/34.80 For all program executions holds that pointer dereference always succeeds at this location 72.89/34.80 - PositiveResult [Line: 17]: pointer dereference always succeeds 72.89/34.80 For all program executions holds that pointer dereference always succeeds at this location 72.89/34.80 - PositiveResult [Line: 17]: pointer dereference always succeeds 72.89/34.80 For all program executions holds that pointer dereference always succeeds at this location 72.89/34.80 - PositiveResult [Line: 24]: pointer dereference always succeeds 72.89/34.80 For all program executions holds that pointer dereference always succeeds at this location 72.89/34.80 - AllSpecificationsHoldResult: All specifications hold 72.89/34.80 8 specifications checked. All of them hold 72.89/34.80 - InvariantResult [Line: 13]: Loop Invariant 72.89/34.80 [2019-03-28 12:50:47,636 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] 72.89/34.80 [2019-03-28 12:50:47,637 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] 72.89/34.80 [2019-03-28 12:50:47,637 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_#t~malloc8.base,QUANTIFIED] 72.89/34.80 [2019-03-28 12:50:47,637 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] 72.89/34.80 [2019-03-28 12:50:47,638 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 72.89/34.80 [2019-03-28 12:50:47,638 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 72.89/34.80 [2019-03-28 12:50:47,638 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 72.89/34.80 [2019-03-28 12:50:47,638 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 72.89/34.80 [2019-03-28 12:50:47,639 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 72.89/34.80 [2019-03-28 12:50:47,639 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 72.89/34.80 [2019-03-28 12:50:47,639 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 72.89/34.80 [2019-03-28 12:50:47,639 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 72.89/34.80 [2019-03-28 12:50:47,639 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 72.89/34.80 [2019-03-28 12:50:47,640 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 72.89/34.80 [2019-03-28 12:50:47,640 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 72.89/34.80 [2019-03-28 12:50:47,641 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] 72.89/34.80 [2019-03-28 12:50:47,641 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] 72.89/34.80 [2019-03-28 12:50:47,641 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_#t~malloc8.base,QUANTIFIED] 72.89/34.80 [2019-03-28 12:50:47,641 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] 72.89/34.80 [2019-03-28 12:50:47,642 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 72.89/34.80 [2019-03-28 12:50:47,642 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 72.89/34.80 [2019-03-28 12:50:47,642 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 72.89/34.80 [2019-03-28 12:50:47,642 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 72.89/34.80 [2019-03-28 12:50:47,643 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 72.89/34.80 [2019-03-28 12:50:47,643 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 72.89/34.80 [2019-03-28 12:50:47,643 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 72.89/34.80 [2019-03-28 12:50:47,643 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 72.89/34.80 [2019-03-28 12:50:47,643 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 72.89/34.80 [2019-03-28 12:50:47,644 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 72.89/34.80 [2019-03-28 12:50:47,644 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 72.89/34.80 Derived loop invariant: ((((((4 * k + 4 * l1 <= 4 * i + A + unknown-#length-unknown[D] && 4 <= 4 * i + A) && 1 <= Alen) && (4 * l2 <= unknown-#length-unknown[B] && (((((4 * l1 <= unknown-#length-unknown[A] && \valid[A] == 1) && 1 <= Blen) && 1 == \valid[D]) && 0 == B) && 1 == \valid[B]) && 1 <= l2) && 0 <= 4 * j + B) && 0 == D) && 0 == A) && 4 <= 4 * k + D) || ((((0 == D && 0 == A) && (((((((((((4 * l1 <= unknown-#length-unknown[A] && \valid[A] == 1) && 4 * l2 <= unknown-#length-unknown[B]) && 1 <= Blen) && 1 == \valid[D]) && 0 == i) && 0 == B) && 1 == \valid[B]) && 1 <= l2) && 4 <= unknown-#length-unknown[D]) && 1 <= Alen) || (((4 <= unknown-#length-unknown[D] && 4 <= 4 * i + A) && 1 <= Alen) && (4 * l2 <= unknown-#length-unknown[B] && (((((4 * l1 <= unknown-#length-unknown[A] && \valid[A] == 1) && 1 <= Blen) && 1 == \valid[D]) && 0 == B) && 1 == \valid[B]) && 1 <= l2) && 0 <= 4 * j + B))) && 0 == k) && (\exists v_prenex_1 : int, ULTIMATE.start_main_#t~malloc8.base : int :: (l1 <= v_prenex_1 && 4 * v_prenex_1 == unknown-#length-unknown[ULTIMATE.start_main_#t~malloc8.base]) && 4 * v_prenex_1 == unknown-#length-unknown[D])) 72.89/34.80 - InvariantResult [Line: 16]: Loop Invariant 72.89/34.80 [2019-03-28 12:50:47,645 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] 72.89/34.80 [2019-03-28 12:50:47,645 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] 72.89/34.80 [2019-03-28 12:50:47,645 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_#t~malloc8.base,QUANTIFIED] 72.89/34.80 [2019-03-28 12:50:47,645 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] 72.89/34.80 [2019-03-28 12:50:47,646 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] 72.89/34.80 [2019-03-28 12:50:47,646 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] 72.89/34.80 [2019-03-28 12:50:47,646 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_#t~malloc8.base,QUANTIFIED] 72.89/34.80 [2019-03-28 12:50:47,646 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] 72.89/34.80 [2019-03-28 12:50:47,647 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] 72.89/34.80 [2019-03-28 12:50:47,647 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] 72.89/34.80 [2019-03-28 12:50:47,647 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_#t~malloc8.base,QUANTIFIED] 72.89/34.80 [2019-03-28 12:50:47,647 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] 72.89/34.80 [2019-03-28 12:50:47,648 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] 72.89/34.80 [2019-03-28 12:50:47,648 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] 72.89/34.80 [2019-03-28 12:50:47,648 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_#t~malloc8.base,QUANTIFIED] 72.89/34.80 [2019-03-28 12:50:47,648 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] 72.89/34.80 [2019-03-28 12:50:47,650 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 72.89/34.80 [2019-03-28 12:50:47,650 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 72.89/34.80 [2019-03-28 12:50:47,650 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 72.89/34.80 [2019-03-28 12:50:47,651 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 72.89/34.80 [2019-03-28 12:50:47,651 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 72.89/34.80 [2019-03-28 12:50:47,651 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 72.89/34.80 [2019-03-28 12:50:47,651 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 72.89/34.80 [2019-03-28 12:50:47,652 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 72.89/34.80 [2019-03-28 12:50:47,652 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 72.89/34.80 [2019-03-28 12:50:47,652 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 72.89/34.80 [2019-03-28 12:50:47,652 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 72.89/34.80 [2019-03-28 12:50:47,653 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 72.89/34.80 [2019-03-28 12:50:47,653 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 72.89/34.80 [2019-03-28 12:50:47,653 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 72.89/34.80 [2019-03-28 12:50:47,653 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 72.89/34.80 [2019-03-28 12:50:47,654 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 72.89/34.80 [2019-03-28 12:50:47,654 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 72.89/34.80 [2019-03-28 12:50:47,654 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 72.89/34.80 [2019-03-28 12:50:47,654 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 72.89/34.80 [2019-03-28 12:50:47,655 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 72.89/34.80 [2019-03-28 12:50:47,655 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 72.89/34.80 [2019-03-28 12:50:47,655 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 72.89/34.80 [2019-03-28 12:50:47,656 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 72.89/34.80 [2019-03-28 12:50:47,656 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 72.89/34.80 [2019-03-28 12:50:47,656 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 72.89/34.80 [2019-03-28 12:50:47,656 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 72.89/34.80 [2019-03-28 12:50:47,657 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 72.89/34.80 [2019-03-28 12:50:47,657 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 72.89/34.80 [2019-03-28 12:50:47,657 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 72.89/34.80 [2019-03-28 12:50:47,657 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 72.89/34.80 [2019-03-28 12:50:47,658 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 72.89/34.80 [2019-03-28 12:50:47,658 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 72.89/34.80 [2019-03-28 12:50:47,658 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 72.89/34.80 [2019-03-28 12:50:47,658 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 72.89/34.80 [2019-03-28 12:50:47,659 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 72.89/34.80 [2019-03-28 12:50:47,659 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 72.89/34.80 [2019-03-28 12:50:47,659 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 72.89/34.80 [2019-03-28 12:50:47,659 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 72.89/34.80 [2019-03-28 12:50:47,660 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 72.89/34.80 [2019-03-28 12:50:47,660 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 72.89/34.80 [2019-03-28 12:50:47,660 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 72.89/34.80 [2019-03-28 12:50:47,660 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 72.89/34.80 [2019-03-28 12:50:47,660 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 72.89/34.80 [2019-03-28 12:50:47,661 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 72.89/34.80 [2019-03-28 12:50:47,661 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 72.89/34.80 [2019-03-28 12:50:47,661 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 72.89/34.80 [2019-03-28 12:50:47,662 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] 72.89/34.80 [2019-03-28 12:50:47,662 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] 72.89/34.80 [2019-03-28 12:50:47,663 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_#t~malloc8.base,QUANTIFIED] 72.89/34.80 [2019-03-28 12:50:47,663 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] 72.89/34.80 [2019-03-28 12:50:47,663 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] 72.89/34.80 [2019-03-28 12:50:47,663 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] 72.89/34.80 [2019-03-28 12:50:47,664 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_#t~malloc8.base,QUANTIFIED] 72.89/34.80 [2019-03-28 12:50:47,664 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] 72.89/34.80 [2019-03-28 12:50:47,664 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] 72.89/34.80 [2019-03-28 12:50:47,664 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] 72.89/34.80 [2019-03-28 12:50:47,665 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_#t~malloc8.base,QUANTIFIED] 72.89/34.80 [2019-03-28 12:50:47,665 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] 72.89/34.80 [2019-03-28 12:50:47,665 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] 72.89/34.80 [2019-03-28 12:50:47,665 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] 72.89/34.80 [2019-03-28 12:50:47,665 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_#t~malloc8.base,QUANTIFIED] 72.89/34.80 [2019-03-28 12:50:47,665 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] 72.89/34.80 [2019-03-28 12:50:47,667 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 72.89/34.80 [2019-03-28 12:50:47,667 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 72.89/34.80 [2019-03-28 12:50:47,668 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 72.89/34.80 [2019-03-28 12:50:47,668 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 72.89/34.80 [2019-03-28 12:50:47,668 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 72.89/34.80 [2019-03-28 12:50:47,668 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 72.89/34.80 [2019-03-28 12:50:47,669 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 72.89/34.80 [2019-03-28 12:50:47,669 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 72.89/34.80 [2019-03-28 12:50:47,669 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 72.89/34.80 [2019-03-28 12:50:47,669 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 72.89/34.80 [2019-03-28 12:50:47,670 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 72.89/34.80 [2019-03-28 12:50:47,670 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 72.89/34.80 [2019-03-28 12:50:47,670 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 72.89/34.80 [2019-03-28 12:50:47,671 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 72.89/34.80 [2019-03-28 12:50:47,671 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 72.89/34.80 [2019-03-28 12:50:47,671 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 72.89/34.80 [2019-03-28 12:50:47,671 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 72.89/34.80 [2019-03-28 12:50:47,672 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 72.89/34.80 [2019-03-28 12:50:47,672 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 72.89/34.80 [2019-03-28 12:50:47,672 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 72.89/34.80 [2019-03-28 12:50:47,672 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 72.89/34.80 [2019-03-28 12:50:47,673 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 72.89/34.80 [2019-03-28 12:50:47,673 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 72.89/34.80 [2019-03-28 12:50:47,673 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 72.89/34.80 [2019-03-28 12:50:47,673 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 72.89/34.80 [2019-03-28 12:50:47,674 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 72.89/34.80 [2019-03-28 12:50:47,674 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 72.89/34.80 [2019-03-28 12:50:47,674 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 72.89/34.80 [2019-03-28 12:50:47,674 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 72.89/34.80 [2019-03-28 12:50:47,675 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 72.89/34.80 [2019-03-28 12:50:47,675 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 72.89/34.80 [2019-03-28 12:50:47,675 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 72.89/34.80 [2019-03-28 12:50:47,675 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 72.89/34.80 [2019-03-28 12:50:47,675 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 72.89/34.80 [2019-03-28 12:50:47,676 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 72.89/34.80 [2019-03-28 12:50:47,676 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 72.89/34.80 [2019-03-28 12:50:47,676 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 72.89/34.80 [2019-03-28 12:50:47,676 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 72.89/34.80 [2019-03-28 12:50:47,677 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 72.89/34.80 [2019-03-28 12:50:47,677 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 72.89/34.80 [2019-03-28 12:50:47,677 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 72.89/34.80 [2019-03-28 12:50:47,677 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 72.89/34.80 [2019-03-28 12:50:47,677 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 72.89/34.80 [2019-03-28 12:50:47,678 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 72.89/34.80 [2019-03-28 12:50:47,678 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 72.89/34.80 [2019-03-28 12:50:47,678 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 72.89/34.80 Derived loop invariant: (((((((((((((((4 <= unknown-#length-unknown[D] && 1 == found) && ((((((((4 * l1 <= unknown-#length-unknown[A] && 4 * i + 4 <= unknown-#length-unknown[A]) && \valid[A] == 1) && 4 * l2 <= unknown-#length-unknown[B]) && 1 <= Blen) && 1 == \valid[D]) && 0 == B) && 4 * j + 4 <= unknown-#length-unknown[B]) && 1 == \valid[B]) && 1 <= l2) && 1 <= Alen) && 0 <= 4 * i + A) && 4 <= 4 * j + B) && 0 == D) && 0 == A) && 0 == k) && (\exists v_prenex_1 : int, ULTIMATE.start_main_#t~malloc8.base : int :: (l1 <= v_prenex_1 && 4 * v_prenex_1 == unknown-#length-unknown[ULTIMATE.start_main_#t~malloc8.base]) && 4 * v_prenex_1 == unknown-#length-unknown[D])) || (((((((((1 == found && 4 * k + 4 * l1 <= 4 * i + A + unknown-#length-unknown[D]) && ((((((((4 * l1 <= unknown-#length-unknown[A] && 4 * i + 4 <= unknown-#length-unknown[A]) && \valid[A] == 1) && 4 * l2 <= unknown-#length-unknown[B]) && 1 <= Blen) && 1 == \valid[D]) && 0 == B) && 4 * j + 4 <= unknown-#length-unknown[B]) && 1 == \valid[B]) && 1 <= l2) && 4 <= 4 * i + A) && 1 <= Alen) && 0 == D) && 4 * k + 4 <= A + unknown-#length-unknown[D]) && 0 == A) && 4 <= 4 * j + B) && 4 <= 4 * k + D)) || ((((((((4 * k + 4 * l1 <= 4 * i + A + unknown-#length-unknown[D] && 4 <= 4 * i + A) && ((((((((4 * l1 <= unknown-#length-unknown[A] && 4 * i + 4 <= unknown-#length-unknown[A]) && \valid[A] == 1) && 0 == found) && 4 * l2 <= unknown-#length-unknown[B]) && 1 <= Blen) && 1 == \valid[D]) && 0 == B) && 1 == \valid[B]) && 1 <= l2) && 1 <= Alen) && 0 == D) && 4 * k + 4 <= A + unknown-#length-unknown[D]) && 0 == A) && 4 <= 4 * j + B) && 4 <= 4 * k + D)) || ((((0 == D && 0 == A) && (((4 <= unknown-#length-unknown[D] && ((((((((4 * l1 <= unknown-#length-unknown[A] && 4 * i + 4 <= unknown-#length-unknown[A]) && \valid[A] == 1) && 0 == found) && 4 * l2 <= unknown-#length-unknown[B]) && 1 <= Blen) && 1 == \valid[D]) && 0 == B) && 1 == \valid[B]) && 1 <= l2) && 1 <= Alen) && 0 <= 4 * i + A) && 4 <= 4 * j + B) && 0 == k) && (\exists v_prenex_1 : int, ULTIMATE.start_main_#t~malloc8.base : int :: (l1 <= v_prenex_1 && 4 * v_prenex_1 == unknown-#length-unknown[ULTIMATE.start_main_#t~malloc8.base]) && 4 * v_prenex_1 == unknown-#length-unknown[D]))) || (((((((((((((((((4 * l1 <= unknown-#length-unknown[A] && 1 <= Blen) && 4 * i + 4 <= unknown-#length-unknown[A]) && \valid[A] == 1) && 0 == j) && 4 * l2 <= unknown-#length-unknown[B]) && 1 == \valid[D]) && 0 == B) && 1 == \valid[B]) && 0 == A) && 1 <= l2) && 4 <= unknown-#length-unknown[D]) && 1 == found) && 1 <= Alen) && 0 <= 4 * i + A) && 0 == D) && 0 == k) && (\exists v_prenex_1 : int, ULTIMATE.start_main_#t~malloc8.base : int :: (l1 <= v_prenex_1 && 4 * v_prenex_1 == unknown-#length-unknown[ULTIMATE.start_main_#t~malloc8.base]) && 4 * v_prenex_1 == unknown-#length-unknown[D]))) || ((((0 == D && 0 == A) && ((4 <= unknown-#length-unknown[D] && (((((((((4 * l1 <= unknown-#length-unknown[A] && 0 == found) && 1 <= Blen) && 4 * i + 4 <= unknown-#length-unknown[A]) && \valid[A] == 1) && 0 == j) && 4 * l2 <= unknown-#length-unknown[B]) && 1 == \valid[D]) && 0 == B) && 1 == \valid[B]) && 1 <= l2) && 1 <= Alen) && 0 <= 4 * i + A) && 0 == k) && (\exists v_prenex_1 : int, ULTIMATE.start_main_#t~malloc8.base : int :: (l1 <= v_prenex_1 && 4 * v_prenex_1 == unknown-#length-unknown[ULTIMATE.start_main_#t~malloc8.base]) && 4 * v_prenex_1 == unknown-#length-unknown[D]))) || (((((((((((((((((4 * l1 <= unknown-#length-unknown[A] && 1 <= Blen) && 4 * i + 4 <= unknown-#length-unknown[A]) && \valid[A] == 1) && 0 == j) && 4 * l2 <= unknown-#length-unknown[B]) && 1 == \valid[D]) && 0 == B) && 1 == \valid[B]) && 0 == A) && 1 <= l2) && 1 == found) && 4 * k + 4 * l1 <= 4 * i + A + unknown-#length-unknown[D]) && 4 <= 4 * i + A) && 1 <= Alen) && 0 == D) && 4 * k + 4 <= A + unknown-#length-unknown[D]) && 4 <= 4 * k + D)) || (((((((4 * k + 4 * l1 <= 4 * i + A + unknown-#length-unknown[D] && 4 <= 4 * i + A) && 1 <= Alen) && 0 == D) && (((((((((4 * l1 <= unknown-#length-unknown[A] && 4 * i + 4 <= unknown-#length-unknown[A]) && \valid[A] == 1) && 0 == j) && 0 == found) && 4 * l2 <= unknown-#length-unknown[B]) && 1 <= Blen) && 1 == \valid[D]) && 0 == B) && 1 == \valid[B]) && 1 <= l2) && 4 * k + 4 <= A + unknown-#length-unknown[D]) && 0 == A) && 4 <= 4 * k + D) 72.89/34.80 - StatisticsResult: Ultimate Automizer benchmark data 72.89/34.80 CFG has 1 procedures, 21 locations, 8 error locations. SAFE Result, 9.4s OverallTime, 16 OverallIterations, 2 TraceHistogramMax, 2.7s AutomataDifference, 0.0s DeadEndRemovalTime, 4.7s HoareAnnotationTime, HoareTripleCheckerStatistics: 178 SDtfs, 843 SDslu, 411 SDs, 0 SdLazy, 1009 SolverSat, 197 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.5s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 119 GetRequests, 49 SyntacticMatches, 7 SemanticMatches, 63 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 66 ImplicationChecksByTransitivity, 1.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=83occurred in iteration=13, 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.1s AutomataMinimizationTime, 16 MinimizatonAttempts, 253 StatesRemovedByMinimization, 11 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 2 LocationsWithAnnotation, 2 PreInvPairs, 20 NumberOfFragments, 1090 HoareAnnotationTreeSize, 2 FomulaSimplifications, 89706 FormulaSimplificationTreeSizeReduction, 0.4s HoareSimplificationTime, 2 FomulaSimplificationsInter, 41876 FormulaSimplificationTreeSizeReductionInter, 4.2s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 1.2s InterpolantComputationTime, 234 NumberOfCodeBlocks, 234 NumberOfCodeBlocksAsserted, 19 NumberOfCheckSat, 215 ConstructedInterpolants, 27 QuantifiedInterpolants, 31653 SizeOfPredicates, 32 NumberOfNonLiveVariables, 387 ConjunctsInSsa, 45 ConjunctsInUnsatCore, 19 InterpolantComputations, 14 PerfectInterpolantSequences, 33/61 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available 72.89/34.80 - StatisticsResult: Constructed decomposition of program 72.89/34.80 Your program was decomposed into 13 terminating modules (3 trivial, 0 deterministic, 10 nondeterministic). One nondeterministic module has affine ranking function -1 * i + l1 and consists of 3 locations. One nondeterministic module has affine ranking function -1 * i + l1 and consists of 3 locations. One nondeterministic module has affine ranking function l1 + -1 * i and consists of 3 locations. One nondeterministic module has affine ranking function l1 + -1 * i and consists of 3 locations. One nondeterministic module has affine ranking function -1 * i + l1 and consists of 3 locations. One nondeterministic module has affine ranking function -1 * i + l1 and consists of 3 locations. One nondeterministic module has affine ranking function -4 * i + unknown-#length-unknown[A] + -1 * A and consists of 4 locations. One nondeterministic module has affine ranking function l1 + -1 * i and consists of 3 locations. One nondeterministic module has affine ranking function -2 * found + 1 and consists of 4 locations. One nondeterministic module has affine ranking function -1 * B + unknown-#length-unknown[B] + -4 * j and consists of 4 locations. 3 modules have a trivial ranking function, the largest among these consists of 5 locations. 72.89/34.80 - StatisticsResult: Timing statistics 72.89/34.80 BüchiAutomizer plugin needed 19.1s and 14 iterations. TraceHistogramMax:1. Analysis of lassos took 16.9s. Construction of modules took 0.6s. Büchi inclusion checks took 1.5s. Highest rank in rank-based complementation 3. Minimization of det autom 4. Minimization of nondet autom 9. Automata minimization 0.0s AutomataMinimizationTime, 12 MinimizatonAttempts, 211 StatesRemovedByMinimization, 12 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 45 states and ocurred in iteration 12. Nontrivial modules had stage [10, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 8/8 HoareTripleCheckerStatistics: 205 SDtfs, 621 SDslu, 210 SDs, 0 SdLazy, 558 SolverSat, 42 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.6s Time LassoAnalysisResults: nont0 unkn0 SFLI2 SFLT0 conc1 concLT0 SILN0 SILU0 SILI0 SILT0 lasso10 LassoPreprocessingBenchmarks: Lassos: inital261 mio100 ax100 hnf100 lsp90 ukn87 mio100 lsp38 div100 bol100 ite100 ukn100 eq191 hnf89 smp100 dnf100 smp100 tf100 neg100 sie101 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 5ms VariablesStem: 1 VariablesLoop: 0 DisjunctsStem: 1 DisjunctsLoop: 1 SupportingInvariants: 2 MotzkinApplications: 6 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 0 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 0 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.0s 72.89/34.80 - TerminationAnalysisResult: Termination proven 72.89/34.80 Buchi Automizer proved that your program is terminating 72.89/34.80 RESULT: Ultimate proved your program to be correct! 72.89/34.80 !SESSION 2019-03-28 12:50:14.660 ----------------------------------------------- 72.89/34.80 eclipse.buildId=unknown 72.89/34.80 java.version=1.8.0_181 72.89/34.80 java.vendor=Oracle Corporation 72.89/34.80 BootLoader constants: OS=linux, ARCH=x86_64, WS=gtk, NL=en_US 72.89/34.80 Framework arguments: -tc ./../AutomizerAndBuchiAutomizerCInlineWithBlockEncoding.xml -s ./../termcomp2017.epf -i /export/starexec/sandbox/benchmark/theBenchmark.c 72.89/34.80 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 72.89/34.80 72.89/34.80 !ENTRY org.eclipse.core.resources 2 10035 2019-03-28 12:50:47.946 72.89/34.80 !MESSAGE The workspace will exit with unsaved changes in this session. 72.89/34.80 Received shutdown request... 72.89/34.80 Ultimate: 72.89/34.80 GTK+ Version Check 72.89/34.80 EOF