./Ultimate.py --spec ../sv-benchmarks/c/properties/termination.prp --file ../sv-benchmarks/c/ldv-memsafety/memleaks_test17_2-2.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 906a4fb5 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx12G -Xms1G -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerTermination.xml -i ../sv-benchmarks/c/ldv-memsafety/memleaks_test17_2-2.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(F end) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 997a9a1542245daddc995e1305672f611f291eda ............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................ Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.25-906a4fb [2020-10-19 20:27:01,167 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-10-19 20:27:01,169 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-10-19 20:27:01,199 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-10-19 20:27:01,200 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-10-19 20:27:01,201 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-10-19 20:27:01,203 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-10-19 20:27:01,205 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-10-19 20:27:01,207 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-10-19 20:27:01,208 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-10-19 20:27:01,209 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-10-19 20:27:01,211 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-10-19 20:27:01,211 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-10-19 20:27:01,215 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-10-19 20:27:01,218 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-10-19 20:27:01,220 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-10-19 20:27:01,221 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-10-19 20:27:01,225 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-10-19 20:27:01,228 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-10-19 20:27:01,231 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-10-19 20:27:01,235 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-10-19 20:27:01,237 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-10-19 20:27:01,239 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-10-19 20:27:01,240 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-10-19 20:27:01,248 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-10-19 20:27:01,248 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-10-19 20:27:01,249 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-10-19 20:27:01,251 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-10-19 20:27:01,252 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-10-19 20:27:01,253 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-10-19 20:27:01,253 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-10-19 20:27:01,254 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-10-19 20:27:01,255 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-10-19 20:27:01,256 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-10-19 20:27:01,257 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-10-19 20:27:01,258 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-10-19 20:27:01,258 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-10-19 20:27:01,259 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-10-19 20:27:01,259 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-10-19 20:27:01,269 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-10-19 20:27:01,275 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-10-19 20:27:01,276 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-32bit-Automizer_Default.epf [2020-10-19 20:27:01,323 INFO L113 SettingsManager]: Loading preferences was successful [2020-10-19 20:27:01,323 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-10-19 20:27:01,326 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-10-19 20:27:01,326 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-10-19 20:27:01,327 INFO L138 SettingsManager]: * Use SBE=true [2020-10-19 20:27:01,327 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2020-10-19 20:27:01,327 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2020-10-19 20:27:01,327 INFO L138 SettingsManager]: * Use old map elimination=false [2020-10-19 20:27:01,328 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2020-10-19 20:27:01,328 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2020-10-19 20:27:01,329 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2020-10-19 20:27:01,329 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-10-19 20:27:01,330 INFO L138 SettingsManager]: * sizeof long=4 [2020-10-19 20:27:01,330 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2020-10-19 20:27:01,331 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-10-19 20:27:01,331 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-10-19 20:27:01,331 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-10-19 20:27:01,331 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2020-10-19 20:27:01,332 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2020-10-19 20:27:01,332 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2020-10-19 20:27:01,332 INFO L138 SettingsManager]: * sizeof long double=12 [2020-10-19 20:27:01,332 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-10-19 20:27:01,333 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2020-10-19 20:27:01,333 INFO L138 SettingsManager]: * Use constant arrays=true [2020-10-19 20:27:01,333 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2020-10-19 20:27:01,334 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-10-19 20:27:01,334 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-10-19 20:27:01,334 INFO L138 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2020-10-19 20:27:01,334 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-10-19 20:27:01,335 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-10-19 20:27:01,335 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-10-19 20:27:01,335 INFO L138 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2020-10-19 20:27:01,337 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2020-10-19 20:27:01,337 INFO L138 SettingsManager]: * TransformationType=MODULO_NEIGHBOR Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(F end) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 997a9a1542245daddc995e1305672f611f291eda [2020-10-19 20:27:01,664 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-10-19 20:27:01,677 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-10-19 20:27:01,680 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-10-19 20:27:01,681 INFO L271 PluginConnector]: Initializing CDTParser... [2020-10-19 20:27:01,682 INFO L275 PluginConnector]: CDTParser initialized [2020-10-19 20:27:01,682 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/ldv-memsafety/memleaks_test17_2-2.i [2020-10-19 20:27:01,748 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/63e4dc391/ac5f7a2b9a134d859f2a7e0b6d563bce/FLAGb413776b5 [2020-10-19 20:27:02,293 INFO L306 CDTParser]: Found 1 translation units. [2020-10-19 20:27:02,294 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-memsafety/memleaks_test17_2-2.i [2020-10-19 20:27:02,317 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/63e4dc391/ac5f7a2b9a134d859f2a7e0b6d563bce/FLAGb413776b5 [2020-10-19 20:27:02,498 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/63e4dc391/ac5f7a2b9a134d859f2a7e0b6d563bce [2020-10-19 20:27:02,501 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-10-19 20:27:02,509 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2020-10-19 20:27:02,510 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-10-19 20:27:02,510 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-10-19 20:27:02,514 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-10-19 20:27:02,515 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.10 08:27:02" (1/1) ... [2020-10-19 20:27:02,518 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@13d30930 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.10 08:27:02, skipping insertion in model container [2020-10-19 20:27:02,519 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.10 08:27:02" (1/1) ... [2020-10-19 20:27:02,531 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-10-19 20:27:02,603 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-10-19 20:27:03,140 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-10-19 20:27:03,161 INFO L203 MainTranslator]: Completed pre-run [2020-10-19 20:27:03,230 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-10-19 20:27:03,320 INFO L208 MainTranslator]: Completed translation [2020-10-19 20:27:03,321 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.10 08:27:03 WrapperNode [2020-10-19 20:27:03,321 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-10-19 20:27:03,322 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-10-19 20:27:03,323 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-10-19 20:27:03,323 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-10-19 20:27:03,332 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.10 08:27:03" (1/1) ... [2020-10-19 20:27:03,356 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.10 08:27:03" (1/1) ... [2020-10-19 20:27:03,389 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-10-19 20:27:03,391 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-10-19 20:27:03,391 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-10-19 20:27:03,391 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-10-19 20:27:03,399 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.10 08:27:03" (1/1) ... [2020-10-19 20:27:03,399 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.10 08:27:03" (1/1) ... [2020-10-19 20:27:03,403 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.10 08:27:03" (1/1) ... [2020-10-19 20:27:03,403 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.10 08:27:03" (1/1) ... [2020-10-19 20:27:03,412 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.10 08:27:03" (1/1) ... [2020-10-19 20:27:03,417 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.10 08:27:03" (1/1) ... [2020-10-19 20:27:03,419 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.10 08:27:03" (1/1) ... [2020-10-19 20:27:03,422 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-10-19 20:27:03,423 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-10-19 20:27:03,423 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-10-19 20:27:03,423 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-10-19 20:27:03,424 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.10 08:27:03" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-19 20:27:03,502 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2020-10-19 20:27:03,502 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2020-10-19 20:27:03,502 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-10-19 20:27:03,503 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2020-10-19 20:27:03,503 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-10-19 20:27:03,503 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2020-10-19 20:27:03,503 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-10-19 20:27:03,504 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-10-19 20:27:03,906 INFO L293 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-10-19 20:27:03,906 INFO L298 CfgBuilder]: Removed 20 assume(true) statements. [2020-10-19 20:27:03,908 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.10 08:27:03 BoogieIcfgContainer [2020-10-19 20:27:03,908 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-10-19 20:27:03,908 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2020-10-19 20:27:03,909 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2020-10-19 20:27:03,912 INFO L275 PluginConnector]: BuchiAutomizer initialized [2020-10-19 20:27:03,913 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-10-19 20:27:03,913 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 19.10 08:27:02" (1/3) ... [2020-10-19 20:27:03,914 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@4fc860c3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 19.10 08:27:03, skipping insertion in model container [2020-10-19 20:27:03,914 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-10-19 20:27:03,915 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.10 08:27:03" (2/3) ... [2020-10-19 20:27:03,915 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@4fc860c3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 19.10 08:27:03, skipping insertion in model container [2020-10-19 20:27:03,915 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-10-19 20:27:03,915 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.10 08:27:03" (3/3) ... [2020-10-19 20:27:03,917 INFO L373 chiAutomizerObserver]: Analyzing ICFG memleaks_test17_2-2.i [2020-10-19 20:27:03,966 INFO L359 BuchiCegarLoop]: Interprodecural is true [2020-10-19 20:27:03,967 INFO L360 BuchiCegarLoop]: Hoare is false [2020-10-19 20:27:03,967 INFO L361 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2020-10-19 20:27:03,967 INFO L362 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2020-10-19 20:27:03,967 INFO L363 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-10-19 20:27:03,968 INFO L364 BuchiCegarLoop]: Difference is false [2020-10-19 20:27:03,968 INFO L365 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-10-19 20:27:03,968 INFO L368 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2020-10-19 20:27:03,981 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 28 states. [2020-10-19 20:27:04,001 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 11 [2020-10-19 20:27:04,002 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-10-19 20:27:04,002 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-10-19 20:27:04,008 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-19 20:27:04,008 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2020-10-19 20:27:04,008 INFO L427 BuchiCegarLoop]: ======== Iteration 1============ [2020-10-19 20:27:04,009 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 28 states. [2020-10-19 20:27:04,011 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 11 [2020-10-19 20:27:04,012 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-10-19 20:27:04,012 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-10-19 20:27:04,012 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-19 20:27:04,012 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2020-10-19 20:27:04,017 INFO L794 eck$LassoCheckResult]: Stem: 22#ULTIMATE.startENTRYtrue #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call ~#ldv_global_msg_list~0.base, ~#ldv_global_msg_list~0.offset := #Ultimate.allocOnStack(8);call write~init~$Pointer$(~#ldv_global_msg_list~0.base, ~#ldv_global_msg_list~0.offset, ~#ldv_global_msg_list~0.base, ~#ldv_global_msg_list~0.offset, 4);call write~init~$Pointer$(~#ldv_global_msg_list~0.base, ~#ldv_global_msg_list~0.offset, ~#ldv_global_msg_list~0.base, 4 + ~#ldv_global_msg_list~0.offset, 4); 9#L-1true havoc entry_point_#t~ret44, entry_point_#t~ret45.base, entry_point_#t~ret45.offset, entry_point_#t~post46, entry_point_#t~ret47, entry_point_~i~2, entry_point_~len~0, entry_point_~array~0.base, entry_point_~array~0.offset;havoc entry_point_~i~2;havoc ldv_positive_#res;havoc ldv_positive_#t~nondet4, ldv_positive_~r~1;ldv_positive_~r~1 := ldv_positive_#t~nondet4;havoc ldv_positive_#t~nondet4; 24#L520true assume !(ldv_positive_~r~1 > 0);ldv_positive_#res := 1; 11#L521true entry_point_#t~ret44 := ldv_positive_#res;entry_point_~len~0 := entry_point_#t~ret44;havoc entry_point_#t~ret44; 23#L787true assume !!(entry_point_~len~0 < 16777216); 26#L787-2true ldv_malloc_#in~size := 4 * entry_point_~len~0;havoc ldv_malloc_#res.base, ldv_malloc_#res.offset;havoc ldv_malloc_#t~nondet11, ldv_malloc_#t~malloc12.base, ldv_malloc_#t~malloc12.offset, ldv_malloc_~size;ldv_malloc_~size := ldv_malloc_#in~size; 3#L526true assume !(0 != ldv_malloc_#t~nondet11);havoc ldv_malloc_#t~nondet11;ldv_malloc_#res.base, ldv_malloc_#res.offset := 0, 0; 27#L529true entry_point_#t~ret45.base, entry_point_#t~ret45.offset := ldv_malloc_#res.base, ldv_malloc_#res.offset;entry_point_~array~0.base, entry_point_~array~0.offset := entry_point_#t~ret45.base, entry_point_#t~ret45.offset;havoc entry_point_#t~ret45.base, entry_point_#t~ret45.offset; 5#L789true assume entry_point_~array~0.base != 0 || entry_point_~array~0.offset != 0;entry_point_~i~2 := 0; 12#L790-3true [2020-10-19 20:27:04,018 INFO L796 eck$LassoCheckResult]: Loop: 12#L790-3true assume !!(entry_point_~i~2 < entry_point_~len~0);call write~$Pointer$(0, 0, entry_point_~array~0.base, entry_point_~array~0.offset + 4 * entry_point_~i~2, 4); 10#L790-2true entry_point_#t~post46 := entry_point_~i~2;entry_point_~i~2 := 1 + entry_point_#t~post46;havoc entry_point_#t~post46; 12#L790-3true [2020-10-19 20:27:04,024 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-19 20:27:04,025 INFO L82 PathProgramCache]: Analyzing trace with hash 1182787569, now seen corresponding path program 1 times [2020-10-19 20:27:04,033 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-19 20:27:04,033 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1782328086] [2020-10-19 20:27:04,034 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-19 20:27:04,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-19 20:27:04,258 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-19 20:27:04,259 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1782328086] [2020-10-19 20:27:04,260 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-19 20:27:04,260 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-19 20:27:04,261 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [18376192] [2020-10-19 20:27:04,267 INFO L799 eck$LassoCheckResult]: stem already infeasible [2020-10-19 20:27:04,267 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-19 20:27:04,267 INFO L82 PathProgramCache]: Analyzing trace with hash 2051, now seen corresponding path program 1 times [2020-10-19 20:27:04,267 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-19 20:27:04,268 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [837579224] [2020-10-19 20:27:04,268 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-19 20:27:04,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-19 20:27:04,281 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-19 20:27:04,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-19 20:27:04,290 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-19 20:27:04,311 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-19 20:27:04,406 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-19 20:27:04,422 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-19 20:27:04,423 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-10-19 20:27:04,425 INFO L87 Difference]: Start difference. First operand 28 states. Second operand 4 states. [2020-10-19 20:27:04,506 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-19 20:27:04,506 INFO L93 Difference]: Finished difference Result 49 states and 58 transitions. [2020-10-19 20:27:04,507 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-10-19 20:27:04,509 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 49 states and 58 transitions. [2020-10-19 20:27:04,513 INFO L131 ngComponentsAnalysis]: Automaton has 6 accepting balls. 19 [2020-10-19 20:27:04,518 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 49 states to 37 states and 46 transitions. [2020-10-19 20:27:04,519 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 37 [2020-10-19 20:27:04,519 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 37 [2020-10-19 20:27:04,520 INFO L73 IsDeterministic]: Start isDeterministic. Operand 37 states and 46 transitions. [2020-10-19 20:27:04,521 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-19 20:27:04,521 INFO L691 BuchiCegarLoop]: Abstraction has 37 states and 46 transitions. [2020-10-19 20:27:04,538 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states and 46 transitions. [2020-10-19 20:27:04,547 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 25. [2020-10-19 20:27:04,548 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2020-10-19 20:27:04,549 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 31 transitions. [2020-10-19 20:27:04,550 INFO L714 BuchiCegarLoop]: Abstraction has 25 states and 31 transitions. [2020-10-19 20:27:04,550 INFO L594 BuchiCegarLoop]: Abstraction has 25 states and 31 transitions. [2020-10-19 20:27:04,551 INFO L427 BuchiCegarLoop]: ======== Iteration 2============ [2020-10-19 20:27:04,551 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 25 states and 31 transitions. [2020-10-19 20:27:04,552 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 11 [2020-10-19 20:27:04,553 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-10-19 20:27:04,553 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-10-19 20:27:04,553 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-19 20:27:04,554 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2020-10-19 20:27:04,554 INFO L794 eck$LassoCheckResult]: Stem: 112#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call ~#ldv_global_msg_list~0.base, ~#ldv_global_msg_list~0.offset := #Ultimate.allocOnStack(8);call write~init~$Pointer$(~#ldv_global_msg_list~0.base, ~#ldv_global_msg_list~0.offset, ~#ldv_global_msg_list~0.base, ~#ldv_global_msg_list~0.offset, 4);call write~init~$Pointer$(~#ldv_global_msg_list~0.base, ~#ldv_global_msg_list~0.offset, ~#ldv_global_msg_list~0.base, 4 + ~#ldv_global_msg_list~0.offset, 4); 100#L-1 havoc entry_point_#t~ret44, entry_point_#t~ret45.base, entry_point_#t~ret45.offset, entry_point_#t~post46, entry_point_#t~ret47, entry_point_~i~2, entry_point_~len~0, entry_point_~array~0.base, entry_point_~array~0.offset;havoc entry_point_~i~2;havoc ldv_positive_#res;havoc ldv_positive_#t~nondet4, ldv_positive_~r~1;ldv_positive_~r~1 := ldv_positive_#t~nondet4;havoc ldv_positive_#t~nondet4; 101#L520 assume !(ldv_positive_~r~1 > 0);ldv_positive_#res := 1; 103#L521 entry_point_#t~ret44 := ldv_positive_#res;entry_point_~len~0 := entry_point_#t~ret44;havoc entry_point_#t~ret44; 104#L787 assume !!(entry_point_~len~0 < 16777216); 113#L787-2 ldv_malloc_#in~size := 4 * entry_point_~len~0;havoc ldv_malloc_#res.base, ldv_malloc_#res.offset;havoc ldv_malloc_#t~nondet11, ldv_malloc_#t~malloc12.base, ldv_malloc_#t~malloc12.offset, ldv_malloc_~size;ldv_malloc_~size := ldv_malloc_#in~size; 89#L526 assume 0 != ldv_malloc_#t~nondet11;havoc ldv_malloc_#t~nondet11;call ldv_malloc_#t~malloc12.base, ldv_malloc_#t~malloc12.offset := #Ultimate.allocOnHeap(ldv_malloc_~size);ldv_malloc_#res.base, ldv_malloc_#res.offset := ldv_malloc_#t~malloc12.base, ldv_malloc_#t~malloc12.offset; 90#L529 entry_point_#t~ret45.base, entry_point_#t~ret45.offset := ldv_malloc_#res.base, ldv_malloc_#res.offset;entry_point_~array~0.base, entry_point_~array~0.offset := entry_point_#t~ret45.base, entry_point_#t~ret45.offset;havoc entry_point_#t~ret45.base, entry_point_#t~ret45.offset; 93#L789 assume entry_point_~array~0.base != 0 || entry_point_~array~0.offset != 0;entry_point_~i~2 := 0; 94#L790-3 [2020-10-19 20:27:04,554 INFO L796 eck$LassoCheckResult]: Loop: 94#L790-3 assume !!(entry_point_~i~2 < entry_point_~len~0);call write~$Pointer$(0, 0, entry_point_~array~0.base, entry_point_~array~0.offset + 4 * entry_point_~i~2, 4); 102#L790-2 entry_point_#t~post46 := entry_point_~i~2;entry_point_~i~2 := 1 + entry_point_#t~post46;havoc entry_point_#t~post46; 94#L790-3 [2020-10-19 20:27:04,555 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-19 20:27:04,555 INFO L82 PathProgramCache]: Analyzing trace with hash 1182785647, now seen corresponding path program 1 times [2020-10-19 20:27:04,555 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-19 20:27:04,556 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1007641806] [2020-10-19 20:27:04,556 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-19 20:27:04,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-19 20:27:04,576 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-19 20:27:04,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-19 20:27:04,594 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-19 20:27:04,600 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-19 20:27:04,601 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-19 20:27:04,601 INFO L82 PathProgramCache]: Analyzing trace with hash 2051, now seen corresponding path program 2 times [2020-10-19 20:27:04,601 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-19 20:27:04,602 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1881618490] [2020-10-19 20:27:04,602 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-19 20:27:04,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-19 20:27:04,612 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-19 20:27:04,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-19 20:27:04,620 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-19 20:27:04,623 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-19 20:27:04,624 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-19 20:27:04,624 INFO L82 PathProgramCache]: Analyzing trace with hash -1509325583, now seen corresponding path program 1 times [2020-10-19 20:27:04,625 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-19 20:27:04,625 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1038038727] [2020-10-19 20:27:04,625 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-19 20:27:04,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-19 20:27:04,667 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-19 20:27:04,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-19 20:27:04,717 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-19 20:27:04,731 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-19 20:27:05,089 WARN L193 SmtUtils]: Spent 268.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 80 [2020-10-19 20:27:05,280 WARN L193 SmtUtils]: Spent 141.00 ms on a formula simplification that was a NOOP. DAG size: 71 [2020-10-19 20:27:05,293 INFO L210 LassoAnalysis]: Preferences: [2020-10-19 20:27:05,294 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2020-10-19 20:27:05,295 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-10-19 20:27:05,295 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2020-10-19 20:27:05,295 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2020-10-19 20:27:05,295 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-19 20:27:05,296 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2020-10-19 20:27:05,296 INFO L132 ssoRankerPreferences]: Path of dumped script: [2020-10-19 20:27:05,296 INFO L133 ssoRankerPreferences]: Filename of dumped script: memleaks_test17_2-2.i_Iteration2_Lasso [2020-10-19 20:27:05,296 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2020-10-19 20:27:05,297 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2020-10-19 20:27:05,323 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-19 20:27:05,330 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-19 20:27:05,334 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-19 20:27:05,338 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-19 20:27:05,341 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-19 20:27:05,345 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-19 20:27:05,348 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-19 20:27:05,352 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-19 20:27:05,584 WARN L193 SmtUtils]: Spent 162.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 60 [2020-10-19 20:27:05,631 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-19 20:27:05,635 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-19 20:27:05,639 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-19 20:27:05,643 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-19 20:27:05,646 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-19 20:27:05,651 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-19 20:27:05,654 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-19 20:27:05,657 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-19 20:27:06,211 WARN L193 SmtUtils]: Spent 138.00 ms on a formula simplification. DAG size of input: 26 DAG size of output: 26 [2020-10-19 20:27:06,271 INFO L292 LassoAnalysis]: Preprocessing complete. [2020-10-19 20:27:06,276 INFO L489 LassoAnalysis]: Using template 'affine'. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-10-19 20:27:06,294 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-10-19 20:27:06,297 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-19 20:27:06,298 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-19 20:27:06,299 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-19 20:27:06,299 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-19 20:27:06,299 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-19 20:27:06,302 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-19 20:27:06,302 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-19 20:27:06,338 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-10-19 20:27:06,379 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-10-19 20:27:06,380 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-19 20:27:06,381 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-19 20:27:06,381 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-19 20:27:06,381 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-19 20:27:06,385 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-19 20:27:06,385 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. Waiting until toolchain timeout for monitored process 3 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-19 20:27:06,390 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-10-19 20:27:06,428 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-10-19 20:27:06,429 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-19 20:27:06,430 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-19 20:27:06,430 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-19 20:27:06,430 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-19 20:27:06,433 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-19 20:27:06,433 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. Waiting until toolchain timeout for monitored process 4 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-19 20:27:06,438 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-10-19 20:27:06,475 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-10-19 20:27:06,476 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-19 20:27:06,477 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. Waiting until toolchain timeout for monitored process 5 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-19 20:27:06,477 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-19 20:27:06,478 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-19 20:27:06,478 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-19 20:27:06,479 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-19 20:27:06,479 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-19 20:27:06,481 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-19 20:27:06,513 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-10-19 20:27:06,517 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-19 20:27:06,518 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-19 20:27:06,518 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-19 20:27:06,518 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-19 20:27:06,531 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-19 20:27:06,531 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-10-19 20:27:06,538 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-19 20:27:06,584 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-10-19 20:27:06,586 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-19 20:27:06,586 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-19 20:27:06,587 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-19 20:27:06,587 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-19 20:27:06,587 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-19 20:27:06,588 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-19 20:27:06,588 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-19 20:27:06,591 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-19 20:27:06,628 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-10-19 20:27:06,630 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-19 20:27:06,630 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-19 20:27:06,630 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-19 20:27:06,630 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-19 20:27:06,633 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-19 20:27:06,633 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-10-19 20:27:06,643 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-10-19 20:27:06,686 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-10-19 20:27:06,688 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-19 20:27:06,689 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-19 20:27:06,689 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-19 20:27:06,689 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-19 20:27:06,693 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-19 20:27:06,693 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. Waiting until toolchain timeout for monitored process 9 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-19 20:27:06,698 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-10-19 20:27:06,737 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false Waiting until toolchain timeout for monitored process 10 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-19 20:27:06,739 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-19 20:27:06,739 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-19 20:27:06,739 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-19 20:27:06,740 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-19 20:27:06,740 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-19 20:27:06,742 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-19 20:27:06,742 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-19 20:27:06,744 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 11 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-19 20:27:06,769 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-10-19 20:27:06,771 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-19 20:27:06,771 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-19 20:27:06,771 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-19 20:27:06,771 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-19 20:27:06,771 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-19 20:27:06,772 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-19 20:27:06,772 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-19 20:27:06,773 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 12 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-19 20:27:06,797 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-10-19 20:27:06,799 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-19 20:27:06,799 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-19 20:27:06,799 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-19 20:27:06,800 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-19 20:27:06,802 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-19 20:27:06,802 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-10-19 20:27:06,806 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 13 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-19 20:27:06,830 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-10-19 20:27:06,832 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-19 20:27:06,833 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-19 20:27:06,833 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-19 20:27:06,833 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-19 20:27:06,846 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-19 20:27:06,846 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-10-19 20:27:06,868 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2020-10-19 20:27:06,927 INFO L443 ModelExtractionUtils]: Simplification made 10 calls to the SMT solver. [2020-10-19 20:27:06,928 INFO L444 ModelExtractionUtils]: 8 out of 43 variables were initially zero. Simplification set additionally 31 variables to zero. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 14 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-19 20:27:06,936 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2020-10-19 20:27:06,944 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2020-10-19 20:27:06,945 INFO L510 LassoAnalysis]: Proved termination. [2020-10-19 20:27:06,946 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select #length ULTIMATE.start_entry_point_~array~0.base)_1, ULTIMATE.start_entry_point_~array~0.offset, ULTIMATE.start_entry_point_~i~2) = 1*v_rep(select #length ULTIMATE.start_entry_point_~array~0.base)_1 - 1*ULTIMATE.start_entry_point_~array~0.offset - 4*ULTIMATE.start_entry_point_~i~2 Supporting invariants [] [2020-10-19 20:27:07,011 INFO L297 tatePredicateManager]: 7 out of 7 supporting invariants were superfluous and have been removed [2020-10-19 20:27:07,023 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-10-19 20:27:07,044 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-19 20:27:07,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-19 20:27:07,076 INFO L263 TraceCheckSpWp]: Trace formula consists of 55 conjuncts, 2 conjunts are in the unsatisfiable core [2020-10-19 20:27:07,079 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-19 20:27:07,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-19 20:27:07,101 INFO L263 TraceCheckSpWp]: Trace formula consists of 12 conjuncts, 4 conjunts are in the unsatisfiable core [2020-10-19 20:27:07,103 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-19 20:27:07,130 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-19 20:27:07,136 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2020-10-19 20:27:07,137 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 25 states and 31 transitions. cyclomatic complexity: 10 Second operand 3 states. [2020-10-19 20:27:07,233 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 25 states and 31 transitions. cyclomatic complexity: 10. Second operand 3 states. Result 54 states and 71 transitions. Complement of second has 7 states. [2020-10-19 20:27:07,237 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2020-10-19 20:27:07,238 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-10-19 20:27:07,239 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 30 transitions. [2020-10-19 20:27:07,240 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 30 transitions. Stem has 9 letters. Loop has 2 letters. [2020-10-19 20:27:07,242 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-10-19 20:27:07,242 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 30 transitions. Stem has 11 letters. Loop has 2 letters. [2020-10-19 20:27:07,242 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-10-19 20:27:07,243 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 30 transitions. Stem has 9 letters. Loop has 4 letters. [2020-10-19 20:27:07,243 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-10-19 20:27:07,243 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 54 states and 71 transitions. [2020-10-19 20:27:07,250 INFO L131 ngComponentsAnalysis]: Automaton has 6 accepting balls. 18 [2020-10-19 20:27:07,253 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 54 states to 39 states and 50 transitions. [2020-10-19 20:27:07,253 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 36 [2020-10-19 20:27:07,254 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 37 [2020-10-19 20:27:07,254 INFO L73 IsDeterministic]: Start isDeterministic. Operand 39 states and 50 transitions. [2020-10-19 20:27:07,255 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-19 20:27:07,255 INFO L691 BuchiCegarLoop]: Abstraction has 39 states and 50 transitions. [2020-10-19 20:27:07,255 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states and 50 transitions. [2020-10-19 20:27:07,261 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 26. [2020-10-19 20:27:07,261 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2020-10-19 20:27:07,264 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 33 transitions. [2020-10-19 20:27:07,264 INFO L714 BuchiCegarLoop]: Abstraction has 26 states and 33 transitions. [2020-10-19 20:27:07,264 INFO L594 BuchiCegarLoop]: Abstraction has 26 states and 33 transitions. [2020-10-19 20:27:07,264 INFO L427 BuchiCegarLoop]: ======== Iteration 3============ [2020-10-19 20:27:07,265 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 26 states and 33 transitions. [2020-10-19 20:27:07,266 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 9 [2020-10-19 20:27:07,266 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-10-19 20:27:07,267 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-10-19 20:27:07,267 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-19 20:27:07,267 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2020-10-19 20:27:07,268 INFO L794 eck$LassoCheckResult]: Stem: 278#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call ~#ldv_global_msg_list~0.base, ~#ldv_global_msg_list~0.offset := #Ultimate.allocOnStack(8);call write~init~$Pointer$(~#ldv_global_msg_list~0.base, ~#ldv_global_msg_list~0.offset, ~#ldv_global_msg_list~0.base, ~#ldv_global_msg_list~0.offset, 4);call write~init~$Pointer$(~#ldv_global_msg_list~0.base, ~#ldv_global_msg_list~0.offset, ~#ldv_global_msg_list~0.base, 4 + ~#ldv_global_msg_list~0.offset, 4); 266#L-1 havoc entry_point_#t~ret44, entry_point_#t~ret45.base, entry_point_#t~ret45.offset, entry_point_#t~post46, entry_point_#t~ret47, entry_point_~i~2, entry_point_~len~0, entry_point_~array~0.base, entry_point_~array~0.offset;havoc entry_point_~i~2;havoc ldv_positive_#res;havoc ldv_positive_#t~nondet4, ldv_positive_~r~1;ldv_positive_~r~1 := ldv_positive_#t~nondet4;havoc ldv_positive_#t~nondet4; 267#L520 assume !(ldv_positive_~r~1 > 0);ldv_positive_#res := 1; 268#L521 entry_point_#t~ret44 := ldv_positive_#res;entry_point_~len~0 := entry_point_#t~ret44;havoc entry_point_#t~ret44; 269#L787 assume !!(entry_point_~len~0 < 16777216); 277#L787-2 ldv_malloc_#in~size := 4 * entry_point_~len~0;havoc ldv_malloc_#res.base, ldv_malloc_#res.offset;havoc ldv_malloc_#t~nondet11, ldv_malloc_#t~malloc12.base, ldv_malloc_#t~malloc12.offset, ldv_malloc_~size;ldv_malloc_~size := ldv_malloc_#in~size; 253#L526 assume 0 != ldv_malloc_#t~nondet11;havoc ldv_malloc_#t~nondet11;call ldv_malloc_#t~malloc12.base, ldv_malloc_#t~malloc12.offset := #Ultimate.allocOnHeap(ldv_malloc_~size);ldv_malloc_#res.base, ldv_malloc_#res.offset := ldv_malloc_#t~malloc12.base, ldv_malloc_#t~malloc12.offset; 254#L529 entry_point_#t~ret45.base, entry_point_#t~ret45.offset := ldv_malloc_#res.base, ldv_malloc_#res.offset;entry_point_~array~0.base, entry_point_~array~0.offset := entry_point_#t~ret45.base, entry_point_#t~ret45.offset;havoc entry_point_#t~ret45.base, entry_point_#t~ret45.offset; 257#L789 assume entry_point_~array~0.base != 0 || entry_point_~array~0.offset != 0;entry_point_~i~2 := 0; 258#L790-3 assume !(entry_point_~i~2 < entry_point_~len~0); 270#L790-4 alloc_17_#in~array.base, alloc_17_#in~array.offset, alloc_17_#in~len := entry_point_~array~0.base, entry_point_~array~0.offset, entry_point_~len~0;havoc alloc_17_#res;havoc alloc_17_#t~ret39.base, alloc_17_#t~ret39.offset, alloc_17_#t~post38, alloc_17_#t~mem41.base, alloc_17_#t~mem41.offset, alloc_17_#t~post40, alloc_17_~array.base, alloc_17_~array.offset, alloc_17_~len, alloc_17_~p~0.base, alloc_17_~p~0.offset, alloc_17_~i~0, alloc_17_~j~0;alloc_17_~array.base, alloc_17_~array.offset := alloc_17_#in~array.base, alloc_17_#in~array.offset;alloc_17_~len := alloc_17_#in~len;havoc alloc_17_~p~0.base, alloc_17_~p~0.offset;alloc_17_~i~0 := 0;havoc alloc_17_~j~0; 271#L765-3 [2020-10-19 20:27:07,269 INFO L796 eck$LassoCheckResult]: Loop: 271#L765-3 assume !!(alloc_17_~i~0 < alloc_17_~len);ldv_malloc_#in~size := 4;havoc ldv_malloc_#res.base, ldv_malloc_#res.offset;havoc ldv_malloc_#t~nondet11, ldv_malloc_#t~malloc12.base, ldv_malloc_#t~malloc12.offset, ldv_malloc_~size;ldv_malloc_~size := ldv_malloc_#in~size; 255#L526-1 assume 0 != ldv_malloc_#t~nondet11;havoc ldv_malloc_#t~nondet11;call ldv_malloc_#t~malloc12.base, ldv_malloc_#t~malloc12.offset := #Ultimate.allocOnHeap(ldv_malloc_~size);ldv_malloc_#res.base, ldv_malloc_#res.offset := ldv_malloc_#t~malloc12.base, ldv_malloc_#t~malloc12.offset; 256#L529-1 alloc_17_#t~ret39.base, alloc_17_#t~ret39.offset := ldv_malloc_#res.base, ldv_malloc_#res.offset;alloc_17_~p~0.base, alloc_17_~p~0.offset := alloc_17_#t~ret39.base, alloc_17_#t~ret39.offset;havoc alloc_17_#t~ret39.base, alloc_17_#t~ret39.offset; 261#L767 assume !(alloc_17_~p~0.base == 0 && alloc_17_~p~0.offset == 0);call write~$Pointer$(alloc_17_~p~0.base, alloc_17_~p~0.offset, alloc_17_~array.base, alloc_17_~array.offset + 4 * alloc_17_~i~0, 4); 263#L765-2 alloc_17_#t~post38 := alloc_17_~i~0;alloc_17_~i~0 := 1 + alloc_17_#t~post38;havoc alloc_17_#t~post38; 271#L765-3 [2020-10-19 20:27:07,269 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-19 20:27:07,269 INFO L82 PathProgramCache]: Analyzing trace with hash -1509325641, now seen corresponding path program 1 times [2020-10-19 20:27:07,270 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-19 20:27:07,271 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1553706477] [2020-10-19 20:27:07,271 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-19 20:27:07,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-19 20:27:07,377 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-19 20:27:07,377 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1553706477] [2020-10-19 20:27:07,378 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-19 20:27:07,378 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-10-19 20:27:07,378 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [499395074] [2020-10-19 20:27:07,379 INFO L799 eck$LassoCheckResult]: stem already infeasible [2020-10-19 20:27:07,379 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-19 20:27:07,379 INFO L82 PathProgramCache]: Analyzing trace with hash 74532277, now seen corresponding path program 1 times [2020-10-19 20:27:07,380 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-19 20:27:07,380 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1794357380] [2020-10-19 20:27:07,380 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-19 20:27:07,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-19 20:27:07,404 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-19 20:27:07,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-19 20:27:07,423 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-19 20:27:07,434 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-19 20:27:07,593 WARN L193 SmtUtils]: Spent 156.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 74 [2020-10-19 20:27:07,663 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-19 20:27:07,663 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-10-19 20:27:07,663 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-10-19 20:27:07,663 INFO L87 Difference]: Start difference. First operand 26 states and 33 transitions. cyclomatic complexity: 11 Second operand 5 states. [2020-10-19 20:27:07,742 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-19 20:27:07,743 INFO L93 Difference]: Finished difference Result 50 states and 62 transitions. [2020-10-19 20:27:07,746 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-10-19 20:27:07,746 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 50 states and 62 transitions. [2020-10-19 20:27:07,750 INFO L131 ngComponentsAnalysis]: Automaton has 6 accepting balls. 18 [2020-10-19 20:27:07,751 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 50 states to 50 states and 62 transitions. [2020-10-19 20:27:07,751 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 45 [2020-10-19 20:27:07,752 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 45 [2020-10-19 20:27:07,752 INFO L73 IsDeterministic]: Start isDeterministic. Operand 50 states and 62 transitions. [2020-10-19 20:27:07,752 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-19 20:27:07,752 INFO L691 BuchiCegarLoop]: Abstraction has 50 states and 62 transitions. [2020-10-19 20:27:07,753 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states and 62 transitions. [2020-10-19 20:27:07,757 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 33. [2020-10-19 20:27:07,759 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2020-10-19 20:27:07,760 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 40 transitions. [2020-10-19 20:27:07,761 INFO L714 BuchiCegarLoop]: Abstraction has 33 states and 40 transitions. [2020-10-19 20:27:07,761 INFO L594 BuchiCegarLoop]: Abstraction has 33 states and 40 transitions. [2020-10-19 20:27:07,761 INFO L427 BuchiCegarLoop]: ======== Iteration 4============ [2020-10-19 20:27:07,762 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 33 states and 40 transitions. [2020-10-19 20:27:07,763 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 9 [2020-10-19 20:27:07,763 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-10-19 20:27:07,763 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-10-19 20:27:07,764 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-19 20:27:07,764 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2020-10-19 20:27:07,765 INFO L794 eck$LassoCheckResult]: Stem: 366#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call ~#ldv_global_msg_list~0.base, ~#ldv_global_msg_list~0.offset := #Ultimate.allocOnStack(8);call write~init~$Pointer$(~#ldv_global_msg_list~0.base, ~#ldv_global_msg_list~0.offset, ~#ldv_global_msg_list~0.base, ~#ldv_global_msg_list~0.offset, 4);call write~init~$Pointer$(~#ldv_global_msg_list~0.base, ~#ldv_global_msg_list~0.offset, ~#ldv_global_msg_list~0.base, 4 + ~#ldv_global_msg_list~0.offset, 4); 352#L-1 havoc entry_point_#t~ret44, entry_point_#t~ret45.base, entry_point_#t~ret45.offset, entry_point_#t~post46, entry_point_#t~ret47, entry_point_~i~2, entry_point_~len~0, entry_point_~array~0.base, entry_point_~array~0.offset;havoc entry_point_~i~2;havoc ldv_positive_#res;havoc ldv_positive_#t~nondet4, ldv_positive_~r~1;ldv_positive_~r~1 := ldv_positive_#t~nondet4;havoc ldv_positive_#t~nondet4; 353#L520 assume ldv_positive_~r~1 > 0;ldv_positive_#res := ldv_positive_~r~1; 369#L521 entry_point_#t~ret44 := ldv_positive_#res;entry_point_~len~0 := entry_point_#t~ret44;havoc entry_point_#t~ret44; 367#L787 assume !!(entry_point_~len~0 < 16777216); 368#L787-2 ldv_malloc_#in~size := 4 * entry_point_~len~0;havoc ldv_malloc_#res.base, ldv_malloc_#res.offset;havoc ldv_malloc_#t~nondet11, ldv_malloc_#t~malloc12.base, ldv_malloc_#t~malloc12.offset, ldv_malloc_~size;ldv_malloc_~size := ldv_malloc_#in~size; 373#L526 assume 0 != ldv_malloc_#t~nondet11;havoc ldv_malloc_#t~nondet11;call ldv_malloc_#t~malloc12.base, ldv_malloc_#t~malloc12.offset := #Ultimate.allocOnHeap(ldv_malloc_~size);ldv_malloc_#res.base, ldv_malloc_#res.offset := ldv_malloc_#t~malloc12.base, ldv_malloc_#t~malloc12.offset; 371#L529 entry_point_#t~ret45.base, entry_point_#t~ret45.offset := ldv_malloc_#res.base, ldv_malloc_#res.offset;entry_point_~array~0.base, entry_point_~array~0.offset := entry_point_#t~ret45.base, entry_point_#t~ret45.offset;havoc entry_point_#t~ret45.base, entry_point_#t~ret45.offset; 345#L789 assume entry_point_~array~0.base != 0 || entry_point_~array~0.offset != 0;entry_point_~i~2 := 0; 346#L790-3 assume !(entry_point_~i~2 < entry_point_~len~0); 359#L790-4 alloc_17_#in~array.base, alloc_17_#in~array.offset, alloc_17_#in~len := entry_point_~array~0.base, entry_point_~array~0.offset, entry_point_~len~0;havoc alloc_17_#res;havoc alloc_17_#t~ret39.base, alloc_17_#t~ret39.offset, alloc_17_#t~post38, alloc_17_#t~mem41.base, alloc_17_#t~mem41.offset, alloc_17_#t~post40, alloc_17_~array.base, alloc_17_~array.offset, alloc_17_~len, alloc_17_~p~0.base, alloc_17_~p~0.offset, alloc_17_~i~0, alloc_17_~j~0;alloc_17_~array.base, alloc_17_~array.offset := alloc_17_#in~array.base, alloc_17_#in~array.offset;alloc_17_~len := alloc_17_#in~len;havoc alloc_17_~p~0.base, alloc_17_~p~0.offset;alloc_17_~i~0 := 0;havoc alloc_17_~j~0; 360#L765-3 [2020-10-19 20:27:07,765 INFO L796 eck$LassoCheckResult]: Loop: 360#L765-3 assume !!(alloc_17_~i~0 < alloc_17_~len);ldv_malloc_#in~size := 4;havoc ldv_malloc_#res.base, ldv_malloc_#res.offset;havoc ldv_malloc_#t~nondet11, ldv_malloc_#t~malloc12.base, ldv_malloc_#t~malloc12.offset, ldv_malloc_~size;ldv_malloc_~size := ldv_malloc_#in~size; 343#L526-1 assume 0 != ldv_malloc_#t~nondet11;havoc ldv_malloc_#t~nondet11;call ldv_malloc_#t~malloc12.base, ldv_malloc_#t~malloc12.offset := #Ultimate.allocOnHeap(ldv_malloc_~size);ldv_malloc_#res.base, ldv_malloc_#res.offset := ldv_malloc_#t~malloc12.base, ldv_malloc_#t~malloc12.offset; 344#L529-1 alloc_17_#t~ret39.base, alloc_17_#t~ret39.offset := ldv_malloc_#res.base, ldv_malloc_#res.offset;alloc_17_~p~0.base, alloc_17_~p~0.offset := alloc_17_#t~ret39.base, alloc_17_#t~ret39.offset;havoc alloc_17_#t~ret39.base, alloc_17_#t~ret39.offset; 349#L767 assume !(alloc_17_~p~0.base == 0 && alloc_17_~p~0.offset == 0);call write~$Pointer$(alloc_17_~p~0.base, alloc_17_~p~0.offset, alloc_17_~array.base, alloc_17_~array.offset + 4 * alloc_17_~i~0, 4); 351#L765-2 alloc_17_#t~post38 := alloc_17_~i~0;alloc_17_~i~0 := 1 + alloc_17_#t~post38;havoc alloc_17_#t~post38; 360#L765-3 [2020-10-19 20:27:07,765 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-19 20:27:07,765 INFO L82 PathProgramCache]: Analyzing trace with hash 2105583285, now seen corresponding path program 1 times [2020-10-19 20:27:07,766 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-19 20:27:07,766 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1760567713] [2020-10-19 20:27:07,767 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-19 20:27:07,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-19 20:27:07,813 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-19 20:27:07,814 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1760567713] [2020-10-19 20:27:07,814 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-19 20:27:07,815 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-10-19 20:27:07,815 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [609832159] [2020-10-19 20:27:07,815 INFO L799 eck$LassoCheckResult]: stem already infeasible [2020-10-19 20:27:07,815 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-19 20:27:07,816 INFO L82 PathProgramCache]: Analyzing trace with hash 74532277, now seen corresponding path program 2 times [2020-10-19 20:27:07,816 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-19 20:27:07,816 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2052670622] [2020-10-19 20:27:07,817 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-19 20:27:07,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-19 20:27:07,825 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-19 20:27:07,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-19 20:27:07,831 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-19 20:27:07,834 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-19 20:27:07,975 WARN L193 SmtUtils]: Spent 138.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 74 [2020-10-19 20:27:08,040 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-19 20:27:08,040 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-10-19 20:27:08,041 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-10-19 20:27:08,041 INFO L87 Difference]: Start difference. First operand 33 states and 40 transitions. cyclomatic complexity: 11 Second operand 5 states. [2020-10-19 20:27:08,080 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-19 20:27:08,080 INFO L93 Difference]: Finished difference Result 34 states and 40 transitions. [2020-10-19 20:27:08,081 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-10-19 20:27:08,081 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 34 states and 40 transitions. [2020-10-19 20:27:08,082 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 9 [2020-10-19 20:27:08,082 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 34 states to 34 states and 40 transitions. [2020-10-19 20:27:08,083 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 31 [2020-10-19 20:27:08,083 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 31 [2020-10-19 20:27:08,083 INFO L73 IsDeterministic]: Start isDeterministic. Operand 34 states and 40 transitions. [2020-10-19 20:27:08,084 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-19 20:27:08,084 INFO L691 BuchiCegarLoop]: Abstraction has 34 states and 40 transitions. [2020-10-19 20:27:08,084 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states and 40 transitions. [2020-10-19 20:27:08,086 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 26. [2020-10-19 20:27:08,086 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2020-10-19 20:27:08,087 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 32 transitions. [2020-10-19 20:27:08,087 INFO L714 BuchiCegarLoop]: Abstraction has 26 states and 32 transitions. [2020-10-19 20:27:08,087 INFO L594 BuchiCegarLoop]: Abstraction has 26 states and 32 transitions. [2020-10-19 20:27:08,087 INFO L427 BuchiCegarLoop]: ======== Iteration 5============ [2020-10-19 20:27:08,087 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 26 states and 32 transitions. [2020-10-19 20:27:08,088 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 9 [2020-10-19 20:27:08,088 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-10-19 20:27:08,088 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-10-19 20:27:08,089 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-19 20:27:08,089 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2020-10-19 20:27:08,090 INFO L794 eck$LassoCheckResult]: Stem: 445#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call ~#ldv_global_msg_list~0.base, ~#ldv_global_msg_list~0.offset := #Ultimate.allocOnStack(8);call write~init~$Pointer$(~#ldv_global_msg_list~0.base, ~#ldv_global_msg_list~0.offset, ~#ldv_global_msg_list~0.base, ~#ldv_global_msg_list~0.offset, 4);call write~init~$Pointer$(~#ldv_global_msg_list~0.base, ~#ldv_global_msg_list~0.offset, ~#ldv_global_msg_list~0.base, 4 + ~#ldv_global_msg_list~0.offset, 4); 433#L-1 havoc entry_point_#t~ret44, entry_point_#t~ret45.base, entry_point_#t~ret45.offset, entry_point_#t~post46, entry_point_#t~ret47, entry_point_~i~2, entry_point_~len~0, entry_point_~array~0.base, entry_point_~array~0.offset;havoc entry_point_~i~2;havoc ldv_positive_#res;havoc ldv_positive_#t~nondet4, ldv_positive_~r~1;ldv_positive_~r~1 := ldv_positive_#t~nondet4;havoc ldv_positive_#t~nondet4; 434#L520 assume !(ldv_positive_~r~1 > 0);ldv_positive_#res := 1; 435#L521 entry_point_#t~ret44 := ldv_positive_#res;entry_point_~len~0 := entry_point_#t~ret44;havoc entry_point_#t~ret44; 436#L787 assume !!(entry_point_~len~0 < 16777216); 444#L787-2 ldv_malloc_#in~size := 4 * entry_point_~len~0;havoc ldv_malloc_#res.base, ldv_malloc_#res.offset;havoc ldv_malloc_#t~nondet11, ldv_malloc_#t~malloc12.base, ldv_malloc_#t~malloc12.offset, ldv_malloc_~size;ldv_malloc_~size := ldv_malloc_#in~size; 420#L526 assume 0 != ldv_malloc_#t~nondet11;havoc ldv_malloc_#t~nondet11;call ldv_malloc_#t~malloc12.base, ldv_malloc_#t~malloc12.offset := #Ultimate.allocOnHeap(ldv_malloc_~size);ldv_malloc_#res.base, ldv_malloc_#res.offset := ldv_malloc_#t~malloc12.base, ldv_malloc_#t~malloc12.offset; 421#L529 entry_point_#t~ret45.base, entry_point_#t~ret45.offset := ldv_malloc_#res.base, ldv_malloc_#res.offset;entry_point_~array~0.base, entry_point_~array~0.offset := entry_point_#t~ret45.base, entry_point_#t~ret45.offset;havoc entry_point_#t~ret45.base, entry_point_#t~ret45.offset; 424#L789 assume entry_point_~array~0.base != 0 || entry_point_~array~0.offset != 0;entry_point_~i~2 := 0; 425#L790-3 assume !!(entry_point_~i~2 < entry_point_~len~0);call write~$Pointer$(0, 0, entry_point_~array~0.base, entry_point_~array~0.offset + 4 * entry_point_~i~2, 4); 431#L790-2 entry_point_#t~post46 := entry_point_~i~2;entry_point_~i~2 := 1 + entry_point_#t~post46;havoc entry_point_#t~post46; 432#L790-3 assume !(entry_point_~i~2 < entry_point_~len~0); 437#L790-4 alloc_17_#in~array.base, alloc_17_#in~array.offset, alloc_17_#in~len := entry_point_~array~0.base, entry_point_~array~0.offset, entry_point_~len~0;havoc alloc_17_#res;havoc alloc_17_#t~ret39.base, alloc_17_#t~ret39.offset, alloc_17_#t~post38, alloc_17_#t~mem41.base, alloc_17_#t~mem41.offset, alloc_17_#t~post40, alloc_17_~array.base, alloc_17_~array.offset, alloc_17_~len, alloc_17_~p~0.base, alloc_17_~p~0.offset, alloc_17_~i~0, alloc_17_~j~0;alloc_17_~array.base, alloc_17_~array.offset := alloc_17_#in~array.base, alloc_17_#in~array.offset;alloc_17_~len := alloc_17_#in~len;havoc alloc_17_~p~0.base, alloc_17_~p~0.offset;alloc_17_~i~0 := 0;havoc alloc_17_~j~0; 438#L765-3 [2020-10-19 20:27:08,090 INFO L796 eck$LassoCheckResult]: Loop: 438#L765-3 assume !!(alloc_17_~i~0 < alloc_17_~len);ldv_malloc_#in~size := 4;havoc ldv_malloc_#res.base, ldv_malloc_#res.offset;havoc ldv_malloc_#t~nondet11, ldv_malloc_#t~malloc12.base, ldv_malloc_#t~malloc12.offset, ldv_malloc_~size;ldv_malloc_~size := ldv_malloc_#in~size; 422#L526-1 assume 0 != ldv_malloc_#t~nondet11;havoc ldv_malloc_#t~nondet11;call ldv_malloc_#t~malloc12.base, ldv_malloc_#t~malloc12.offset := #Ultimate.allocOnHeap(ldv_malloc_~size);ldv_malloc_#res.base, ldv_malloc_#res.offset := ldv_malloc_#t~malloc12.base, ldv_malloc_#t~malloc12.offset; 423#L529-1 alloc_17_#t~ret39.base, alloc_17_#t~ret39.offset := ldv_malloc_#res.base, ldv_malloc_#res.offset;alloc_17_~p~0.base, alloc_17_~p~0.offset := alloc_17_#t~ret39.base, alloc_17_#t~ret39.offset;havoc alloc_17_#t~ret39.base, alloc_17_#t~ret39.offset; 428#L767 assume !(alloc_17_~p~0.base == 0 && alloc_17_~p~0.offset == 0);call write~$Pointer$(alloc_17_~p~0.base, alloc_17_~p~0.offset, alloc_17_~array.base, alloc_17_~array.offset + 4 * alloc_17_~i~0, 4); 430#L765-2 alloc_17_#t~post38 := alloc_17_~i~0;alloc_17_~i~0 := 1 + alloc_17_#t~post38;havoc alloc_17_#t~post38; 438#L765-3 [2020-10-19 20:27:08,090 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-19 20:27:08,090 INFO L82 PathProgramCache]: Analyzing trace with hash 1237061817, now seen corresponding path program 1 times [2020-10-19 20:27:08,091 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-19 20:27:08,091 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [839697497] [2020-10-19 20:27:08,091 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-19 20:27:08,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-19 20:27:08,105 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-19 20:27:08,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-19 20:27:08,117 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-19 20:27:08,122 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-19 20:27:08,123 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-19 20:27:08,123 INFO L82 PathProgramCache]: Analyzing trace with hash 74532277, now seen corresponding path program 3 times [2020-10-19 20:27:08,123 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-19 20:27:08,123 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [654585235] [2020-10-19 20:27:08,124 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-19 20:27:08,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-19 20:27:08,140 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-19 20:27:08,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-19 20:27:08,146 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-19 20:27:08,153 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-19 20:27:08,156 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-19 20:27:08,156 INFO L82 PathProgramCache]: Analyzing trace with hash -138745859, now seen corresponding path program 1 times [2020-10-19 20:27:08,156 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-19 20:27:08,157 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [659792971] [2020-10-19 20:27:08,157 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-19 20:27:08,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-19 20:27:08,199 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-19 20:27:08,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-19 20:27:08,231 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-19 20:27:08,243 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-19 20:27:08,387 WARN L193 SmtUtils]: Spent 140.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 74 [2020-10-19 20:27:08,877 WARN L193 SmtUtils]: Spent 418.00 ms on a formula simplification. DAG size of input: 137 DAG size of output: 123 [2020-10-19 20:27:09,065 WARN L193 SmtUtils]: Spent 181.00 ms on a formula simplification that was a NOOP. DAG size: 113 [2020-10-19 20:27:09,068 INFO L210 LassoAnalysis]: Preferences: [2020-10-19 20:27:09,068 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2020-10-19 20:27:09,068 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-10-19 20:27:09,068 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2020-10-19 20:27:09,068 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2020-10-19 20:27:09,069 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-19 20:27:09,069 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2020-10-19 20:27:09,069 INFO L132 ssoRankerPreferences]: Path of dumped script: [2020-10-19 20:27:09,069 INFO L133 ssoRankerPreferences]: Filename of dumped script: memleaks_test17_2-2.i_Iteration5_Lasso [2020-10-19 20:27:09,069 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2020-10-19 20:27:09,070 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2020-10-19 20:27:09,077 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-19 20:27:09,097 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-19 20:27:09,099 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-19 20:27:09,102 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-19 20:27:09,107 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-19 20:27:09,111 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-19 20:27:09,115 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-19 20:27:09,118 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-19 20:27:09,570 WARN L193 SmtUtils]: Spent 340.00 ms on a formula simplification. DAG size of input: 96 DAG size of output: 85 [2020-10-19 20:27:09,689 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-19 20:27:09,692 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-19 20:27:09,694 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-19 20:27:09,697 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-19 20:27:09,699 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-19 20:27:09,705 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-19 20:27:09,707 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-19 20:27:09,712 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-19 20:27:09,715 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-19 20:27:09,719 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-19 20:27:09,721 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-19 20:27:09,725 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-19 20:27:09,727 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-19 20:27:09,729 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-19 20:27:09,734 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-19 20:27:09,736 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-19 20:27:09,994 WARN L193 SmtUtils]: Spent 143.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 50 [2020-10-19 20:27:10,276 WARN L193 SmtUtils]: Spent 122.00 ms on a formula simplification. DAG size of input: 26 DAG size of output: 26 [2020-10-19 20:27:10,567 INFO L292 LassoAnalysis]: Preprocessing complete. [2020-10-19 20:27:10,567 INFO L489 LassoAnalysis]: Using template 'affine'. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 15 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-19 20:27:10,573 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-10-19 20:27:10,575 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-19 20:27:10,575 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-19 20:27:10,575 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-19 20:27:10,575 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-19 20:27:10,576 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-19 20:27:10,576 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-19 20:27:10,576 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-19 20:27:10,578 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 16 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-19 20:27:10,601 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-10-19 20:27:10,602 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-19 20:27:10,602 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-19 20:27:10,603 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-19 20:27:10,603 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-19 20:27:10,603 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-19 20:27:10,603 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-19 20:27:10,603 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-19 20:27:10,605 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 17 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 17 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-19 20:27:10,628 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-10-19 20:27:10,629 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-19 20:27:10,630 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-19 20:27:10,630 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-19 20:27:10,630 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-19 20:27:10,633 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-19 20:27:10,633 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-10-19 20:27:10,643 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 18 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 18 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-19 20:27:10,676 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-10-19 20:27:10,677 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-19 20:27:10,677 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-19 20:27:10,677 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-19 20:27:10,678 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-19 20:27:10,681 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-19 20:27:10,681 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-10-19 20:27:10,684 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 19 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-10-19 20:27:10,707 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-10-19 20:27:10,709 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-19 20:27:10,710 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-19 20:27:10,710 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-19 20:27:10,710 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-19 20:27:10,712 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-19 20:27:10,712 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. Waiting until toolchain timeout for monitored process 19 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-19 20:27:10,717 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 20 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 20 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-19 20:27:10,764 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-10-19 20:27:10,765 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-19 20:27:10,766 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-19 20:27:10,766 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-19 20:27:10,766 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-19 20:27:10,766 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-19 20:27:10,766 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-19 20:27:10,767 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-19 20:27:10,772 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 21 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 21 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-19 20:27:10,802 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-10-19 20:27:10,804 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-19 20:27:10,804 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-19 20:27:10,804 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-19 20:27:10,804 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-19 20:27:10,806 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-19 20:27:10,806 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-10-19 20:27:10,810 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 22 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 22 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-19 20:27:10,833 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-10-19 20:27:10,835 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-19 20:27:10,835 INFO L203 nArgumentSynthesizer]: 2 stem disjuncts [2020-10-19 20:27:10,835 INFO L204 nArgumentSynthesizer]: 2 loop disjuncts [2020-10-19 20:27:10,835 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-19 20:27:10,852 INFO L401 nArgumentSynthesizer]: We have 20 Motzkin's Theorem applications. [2020-10-19 20:27:10,853 INFO L402 nArgumentSynthesizer]: A total of 4 supporting invariants were added. [2020-10-19 20:27:10,892 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 23 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-10-19 20:27:10,930 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-10-19 20:27:10,932 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-19 20:27:10,933 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-19 20:27:10,933 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-19 20:27:10,933 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-19 20:27:10,935 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-19 20:27:10,935 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. Waiting until toolchain timeout for monitored process 23 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-19 20:27:10,943 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 24 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 24 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-19 20:27:10,968 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-10-19 20:27:10,969 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-19 20:27:10,969 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-19 20:27:10,970 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-19 20:27:10,970 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-19 20:27:10,970 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-19 20:27:10,970 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-19 20:27:10,970 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-19 20:27:10,972 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 25 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 25 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-19 20:27:10,996 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-10-19 20:27:10,998 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-19 20:27:10,998 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-19 20:27:10,998 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-19 20:27:10,998 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-19 20:27:10,999 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-19 20:27:10,999 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-10-19 20:27:11,002 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 26 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 26 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-19 20:27:11,026 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-10-19 20:27:11,027 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-19 20:27:11,027 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-19 20:27:11,027 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-19 20:27:11,028 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-19 20:27:11,028 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-19 20:27:11,028 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-19 20:27:11,029 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-19 20:27:11,030 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 27 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 27 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-19 20:27:11,062 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-10-19 20:27:11,063 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-19 20:27:11,063 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-19 20:27:11,063 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-19 20:27:11,063 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-19 20:27:11,064 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-19 20:27:11,065 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-10-19 20:27:11,069 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 28 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 28 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-19 20:27:11,095 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-10-19 20:27:11,096 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-19 20:27:11,096 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-19 20:27:11,096 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-19 20:27:11,097 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-19 20:27:11,098 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-19 20:27:11,098 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-10-19 20:27:11,102 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 29 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 29 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-19 20:27:11,126 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-10-19 20:27:11,130 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-19 20:27:11,130 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-19 20:27:11,130 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-19 20:27:11,130 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-19 20:27:11,131 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-19 20:27:11,131 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-19 20:27:11,131 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-19 20:27:11,133 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 30 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 30 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-19 20:27:11,156 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-10-19 20:27:11,157 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-19 20:27:11,157 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-19 20:27:11,157 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-19 20:27:11,157 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-19 20:27:11,159 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-19 20:27:11,159 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-10-19 20:27:11,167 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 31 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-10-19 20:27:11,202 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-10-19 20:27:11,205 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-19 20:27:11,205 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-19 20:27:11,205 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-19 20:27:11,205 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-19 20:27:11,216 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-19 20:27:11,217 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. Waiting until toolchain timeout for monitored process 31 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-19 20:27:11,248 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2020-10-19 20:27:11,282 INFO L443 ModelExtractionUtils]: Simplification made 6 calls to the SMT solver. [2020-10-19 20:27:11,282 INFO L444 ModelExtractionUtils]: 24 out of 58 variables were initially zero. Simplification set additionally 31 variables to zero. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 32 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 32 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-19 20:27:11,284 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2020-10-19 20:27:11,287 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2020-10-19 20:27:11,288 INFO L510 LassoAnalysis]: Proved termination. [2020-10-19 20:27:11,288 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_alloc_17_~i~0, ULTIMATE.start_alloc_17_~len) = -1*ULTIMATE.start_alloc_17_~i~0 + 1*ULTIMATE.start_alloc_17_~len Supporting invariants [] [2020-10-19 20:27:11,354 INFO L297 tatePredicateManager]: 9 out of 9 supporting invariants were superfluous and have been removed [2020-10-19 20:27:11,368 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-19 20:27:11,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-19 20:27:11,385 INFO L263 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 2 conjunts are in the unsatisfiable core [2020-10-19 20:27:11,386 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-19 20:27:11,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-19 20:27:11,401 INFO L263 TraceCheckSpWp]: Trace formula consists of 34 conjuncts, 4 conjunts are in the unsatisfiable core [2020-10-19 20:27:11,402 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-19 20:27:11,416 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-19 20:27:11,416 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2020-10-19 20:27:11,416 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 26 states and 32 transitions. cyclomatic complexity: 10 Second operand 3 states. [2020-10-19 20:27:11,437 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 26 states and 32 transitions. cyclomatic complexity: 10. Second operand 3 states. Result 45 states and 58 transitions. Complement of second has 6 states. [2020-10-19 20:27:11,439 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2020-10-19 20:27:11,439 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-10-19 20:27:11,439 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 34 transitions. [2020-10-19 20:27:11,439 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 34 transitions. Stem has 13 letters. Loop has 5 letters. [2020-10-19 20:27:11,440 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-10-19 20:27:11,440 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 34 transitions. Stem has 18 letters. Loop has 5 letters. [2020-10-19 20:27:11,440 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-10-19 20:27:11,440 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 34 transitions. Stem has 13 letters. Loop has 10 letters. [2020-10-19 20:27:11,441 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-10-19 20:27:11,441 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 45 states and 58 transitions. [2020-10-19 20:27:11,442 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 6 [2020-10-19 20:27:11,443 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 45 states to 33 states and 42 transitions. [2020-10-19 20:27:11,443 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 24 [2020-10-19 20:27:11,443 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 26 [2020-10-19 20:27:11,443 INFO L73 IsDeterministic]: Start isDeterministic. Operand 33 states and 42 transitions. [2020-10-19 20:27:11,443 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-10-19 20:27:11,444 INFO L691 BuchiCegarLoop]: Abstraction has 33 states and 42 transitions. [2020-10-19 20:27:11,444 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states and 42 transitions. [2020-10-19 20:27:11,446 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 30. [2020-10-19 20:27:11,446 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2020-10-19 20:27:11,447 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 39 transitions. [2020-10-19 20:27:11,447 INFO L714 BuchiCegarLoop]: Abstraction has 30 states and 39 transitions. [2020-10-19 20:27:11,447 INFO L594 BuchiCegarLoop]: Abstraction has 30 states and 39 transitions. [2020-10-19 20:27:11,447 INFO L427 BuchiCegarLoop]: ======== Iteration 6============ [2020-10-19 20:27:11,448 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 30 states and 39 transitions. [2020-10-19 20:27:11,448 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 4 [2020-10-19 20:27:11,448 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-10-19 20:27:11,448 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-10-19 20:27:11,449 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-19 20:27:11,449 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2020-10-19 20:27:11,450 INFO L794 eck$LassoCheckResult]: Stem: 631#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call ~#ldv_global_msg_list~0.base, ~#ldv_global_msg_list~0.offset := #Ultimate.allocOnStack(8);call write~init~$Pointer$(~#ldv_global_msg_list~0.base, ~#ldv_global_msg_list~0.offset, ~#ldv_global_msg_list~0.base, ~#ldv_global_msg_list~0.offset, 4);call write~init~$Pointer$(~#ldv_global_msg_list~0.base, ~#ldv_global_msg_list~0.offset, ~#ldv_global_msg_list~0.base, 4 + ~#ldv_global_msg_list~0.offset, 4); 618#L-1 havoc entry_point_#t~ret44, entry_point_#t~ret45.base, entry_point_#t~ret45.offset, entry_point_#t~post46, entry_point_#t~ret47, entry_point_~i~2, entry_point_~len~0, entry_point_~array~0.base, entry_point_~array~0.offset;havoc entry_point_~i~2;havoc ldv_positive_#res;havoc ldv_positive_#t~nondet4, ldv_positive_~r~1;ldv_positive_~r~1 := ldv_positive_#t~nondet4;havoc ldv_positive_#t~nondet4; 619#L520 assume !(ldv_positive_~r~1 > 0);ldv_positive_#res := 1; 622#L521 entry_point_#t~ret44 := ldv_positive_#res;entry_point_~len~0 := entry_point_#t~ret44;havoc entry_point_#t~ret44; 623#L787 assume !!(entry_point_~len~0 < 16777216); 632#L787-2 ldv_malloc_#in~size := 4 * entry_point_~len~0;havoc ldv_malloc_#res.base, ldv_malloc_#res.offset;havoc ldv_malloc_#t~nondet11, ldv_malloc_#t~malloc12.base, ldv_malloc_#t~malloc12.offset, ldv_malloc_~size;ldv_malloc_~size := ldv_malloc_#in~size; 604#L526 assume 0 != ldv_malloc_#t~nondet11;havoc ldv_malloc_#t~nondet11;call ldv_malloc_#t~malloc12.base, ldv_malloc_#t~malloc12.offset := #Ultimate.allocOnHeap(ldv_malloc_~size);ldv_malloc_#res.base, ldv_malloc_#res.offset := ldv_malloc_#t~malloc12.base, ldv_malloc_#t~malloc12.offset; 605#L529 entry_point_#t~ret45.base, entry_point_#t~ret45.offset := ldv_malloc_#res.base, ldv_malloc_#res.offset;entry_point_~array~0.base, entry_point_~array~0.offset := entry_point_#t~ret45.base, entry_point_#t~ret45.offset;havoc entry_point_#t~ret45.base, entry_point_#t~ret45.offset; 610#L789 assume entry_point_~array~0.base != 0 || entry_point_~array~0.offset != 0;entry_point_~i~2 := 0; 611#L790-3 assume !!(entry_point_~i~2 < entry_point_~len~0);call write~$Pointer$(0, 0, entry_point_~array~0.base, entry_point_~array~0.offset + 4 * entry_point_~i~2, 4); 620#L790-2 entry_point_#t~post46 := entry_point_~i~2;entry_point_~i~2 := 1 + entry_point_#t~post46;havoc entry_point_#t~post46; 621#L790-3 assume !(entry_point_~i~2 < entry_point_~len~0); 624#L790-4 alloc_17_#in~array.base, alloc_17_#in~array.offset, alloc_17_#in~len := entry_point_~array~0.base, entry_point_~array~0.offset, entry_point_~len~0;havoc alloc_17_#res;havoc alloc_17_#t~ret39.base, alloc_17_#t~ret39.offset, alloc_17_#t~post38, alloc_17_#t~mem41.base, alloc_17_#t~mem41.offset, alloc_17_#t~post40, alloc_17_~array.base, alloc_17_~array.offset, alloc_17_~len, alloc_17_~p~0.base, alloc_17_~p~0.offset, alloc_17_~i~0, alloc_17_~j~0;alloc_17_~array.base, alloc_17_~array.offset := alloc_17_#in~array.base, alloc_17_#in~array.offset;alloc_17_~len := alloc_17_#in~len;havoc alloc_17_~p~0.base, alloc_17_~p~0.offset;alloc_17_~i~0 := 0;havoc alloc_17_~j~0; 625#L765-3 assume !(alloc_17_~i~0 < alloc_17_~len); 626#L765-4 alloc_17_#res := 0; 627#L776 entry_point_#t~ret47 := alloc_17_#res;havoc entry_point_#t~ret47;free_17_#in~array.base, free_17_#in~array.offset, free_17_#in~len := entry_point_~array~0.base, entry_point_~array~0.offset, entry_point_~len~0;havoc free_17_#t~mem43.base, free_17_#t~mem43.offset, free_17_#t~post42, free_17_~array.base, free_17_~array.offset, free_17_~len, free_17_~i~1;free_17_~array.base, free_17_~array.offset := free_17_#in~array.base, free_17_#in~array.offset;free_17_~len := free_17_#in~len;havoc free_17_~i~1;free_17_~i~1 := 0; 613#L780-3 [2020-10-19 20:27:11,450 INFO L796 eck$LassoCheckResult]: Loop: 613#L780-3 assume !!(free_17_~i~1 < free_17_~len);call free_17_#t~mem43.base, free_17_#t~mem43.offset := read~$Pointer$(free_17_~array.base, free_17_~array.offset + 4 * free_17_~i~1, 4);call ULTIMATE.dealloc(free_17_#t~mem43.base, free_17_#t~mem43.offset);havoc free_17_#t~mem43.base, free_17_#t~mem43.offset; 612#L780-2 free_17_#t~post42 := free_17_~i~1;free_17_~i~1 := 1 + free_17_#t~post42;havoc free_17_#t~post42; 613#L780-3 [2020-10-19 20:27:11,450 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-19 20:27:11,450 INFO L82 PathProgramCache]: Analyzing trace with hash -1805730393, now seen corresponding path program 1 times [2020-10-19 20:27:11,451 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-19 20:27:11,451 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1543820590] [2020-10-19 20:27:11,451 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-19 20:27:11,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-19 20:27:11,482 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2020-10-19 20:27:11,483 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1543820590] [2020-10-19 20:27:11,483 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-19 20:27:11,483 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-10-19 20:27:11,483 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1943420610] [2020-10-19 20:27:11,484 INFO L799 eck$LassoCheckResult]: stem already infeasible [2020-10-19 20:27:11,484 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-19 20:27:11,484 INFO L82 PathProgramCache]: Analyzing trace with hash 3907, now seen corresponding path program 1 times [2020-10-19 20:27:11,484 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-19 20:27:11,484 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [352243002] [2020-10-19 20:27:11,484 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-19 20:27:11,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-19 20:27:11,489 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-19 20:27:11,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-19 20:27:11,491 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-19 20:27:11,493 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-19 20:27:11,520 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-19 20:27:11,520 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-10-19 20:27:11,520 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-10-19 20:27:11,520 INFO L87 Difference]: Start difference. First operand 30 states and 39 transitions. cyclomatic complexity: 13 Second operand 5 states. [2020-10-19 20:27:11,590 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-19 20:27:11,590 INFO L93 Difference]: Finished difference Result 71 states and 90 transitions. [2020-10-19 20:27:11,591 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-10-19 20:27:11,591 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 71 states and 90 transitions. [2020-10-19 20:27:11,592 INFO L131 ngComponentsAnalysis]: Automaton has 6 accepting balls. 12 [2020-10-19 20:27:11,593 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 71 states to 71 states and 90 transitions. [2020-10-19 20:27:11,593 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 53 [2020-10-19 20:27:11,593 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 53 [2020-10-19 20:27:11,593 INFO L73 IsDeterministic]: Start isDeterministic. Operand 71 states and 90 transitions. [2020-10-19 20:27:11,594 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-10-19 20:27:11,594 INFO L691 BuchiCegarLoop]: Abstraction has 71 states and 90 transitions. [2020-10-19 20:27:11,594 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states and 90 transitions. [2020-10-19 20:27:11,597 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 41. [2020-10-19 20:27:11,598 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2020-10-19 20:27:11,598 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 52 transitions. [2020-10-19 20:27:11,598 INFO L714 BuchiCegarLoop]: Abstraction has 41 states and 52 transitions. [2020-10-19 20:27:11,598 INFO L594 BuchiCegarLoop]: Abstraction has 41 states and 52 transitions. [2020-10-19 20:27:11,599 INFO L427 BuchiCegarLoop]: ======== Iteration 7============ [2020-10-19 20:27:11,599 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 41 states and 52 transitions. [2020-10-19 20:27:11,599 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 4 [2020-10-19 20:27:11,600 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-10-19 20:27:11,600 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-10-19 20:27:11,600 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-19 20:27:11,600 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2020-10-19 20:27:11,601 INFO L794 eck$LassoCheckResult]: Stem: 748#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call ~#ldv_global_msg_list~0.base, ~#ldv_global_msg_list~0.offset := #Ultimate.allocOnStack(8);call write~init~$Pointer$(~#ldv_global_msg_list~0.base, ~#ldv_global_msg_list~0.offset, ~#ldv_global_msg_list~0.base, ~#ldv_global_msg_list~0.offset, 4);call write~init~$Pointer$(~#ldv_global_msg_list~0.base, ~#ldv_global_msg_list~0.offset, ~#ldv_global_msg_list~0.base, 4 + ~#ldv_global_msg_list~0.offset, 4); 731#L-1 havoc entry_point_#t~ret44, entry_point_#t~ret45.base, entry_point_#t~ret45.offset, entry_point_#t~post46, entry_point_#t~ret47, entry_point_~i~2, entry_point_~len~0, entry_point_~array~0.base, entry_point_~array~0.offset;havoc entry_point_~i~2;havoc ldv_positive_#res;havoc ldv_positive_#t~nondet4, ldv_positive_~r~1;ldv_positive_~r~1 := ldv_positive_#t~nondet4;havoc ldv_positive_#t~nondet4; 732#L520 assume ldv_positive_~r~1 > 0;ldv_positive_#res := ldv_positive_~r~1; 751#L521 entry_point_#t~ret44 := ldv_positive_#res;entry_point_~len~0 := entry_point_#t~ret44;havoc entry_point_#t~ret44; 749#L787 assume !!(entry_point_~len~0 < 16777216); 750#L787-2 ldv_malloc_#in~size := 4 * entry_point_~len~0;havoc ldv_malloc_#res.base, ldv_malloc_#res.offset;havoc ldv_malloc_#t~nondet11, ldv_malloc_#t~malloc12.base, ldv_malloc_#t~malloc12.offset, ldv_malloc_~size;ldv_malloc_~size := ldv_malloc_#in~size; 717#L526 assume 0 != ldv_malloc_#t~nondet11;havoc ldv_malloc_#t~nondet11;call ldv_malloc_#t~malloc12.base, ldv_malloc_#t~malloc12.offset := #Ultimate.allocOnHeap(ldv_malloc_~size);ldv_malloc_#res.base, ldv_malloc_#res.offset := ldv_malloc_#t~malloc12.base, ldv_malloc_#t~malloc12.offset; 718#L529 entry_point_#t~ret45.base, entry_point_#t~ret45.offset := ldv_malloc_#res.base, ldv_malloc_#res.offset;entry_point_~array~0.base, entry_point_~array~0.offset := entry_point_#t~ret45.base, entry_point_#t~ret45.offset;havoc entry_point_#t~ret45.base, entry_point_#t~ret45.offset; 723#L789 assume entry_point_~array~0.base != 0 || entry_point_~array~0.offset != 0;entry_point_~i~2 := 0; 724#L790-3 assume !!(entry_point_~i~2 < entry_point_~len~0);call write~$Pointer$(0, 0, entry_point_~array~0.base, entry_point_~array~0.offset + 4 * entry_point_~i~2, 4); 733#L790-2 entry_point_#t~post46 := entry_point_~i~2;entry_point_~i~2 := 1 + entry_point_#t~post46;havoc entry_point_#t~post46; 734#L790-3 assume !(entry_point_~i~2 < entry_point_~len~0); 741#L790-4 alloc_17_#in~array.base, alloc_17_#in~array.offset, alloc_17_#in~len := entry_point_~array~0.base, entry_point_~array~0.offset, entry_point_~len~0;havoc alloc_17_#res;havoc alloc_17_#t~ret39.base, alloc_17_#t~ret39.offset, alloc_17_#t~post38, alloc_17_#t~mem41.base, alloc_17_#t~mem41.offset, alloc_17_#t~post40, alloc_17_~array.base, alloc_17_~array.offset, alloc_17_~len, alloc_17_~p~0.base, alloc_17_~p~0.offset, alloc_17_~i~0, alloc_17_~j~0;alloc_17_~array.base, alloc_17_~array.offset := alloc_17_#in~array.base, alloc_17_#in~array.offset;alloc_17_~len := alloc_17_#in~len;havoc alloc_17_~p~0.base, alloc_17_~p~0.offset;alloc_17_~i~0 := 0;havoc alloc_17_~j~0; 742#L765-3 assume !(alloc_17_~i~0 < alloc_17_~len); 743#L765-4 alloc_17_#res := 0; 744#L776 entry_point_#t~ret47 := alloc_17_#res;havoc entry_point_#t~ret47;free_17_#in~array.base, free_17_#in~array.offset, free_17_#in~len := entry_point_~array~0.base, entry_point_~array~0.offset, entry_point_~len~0;havoc free_17_#t~mem43.base, free_17_#t~mem43.offset, free_17_#t~post42, free_17_~array.base, free_17_~array.offset, free_17_~len, free_17_~i~1;free_17_~array.base, free_17_~array.offset := free_17_#in~array.base, free_17_#in~array.offset;free_17_~len := free_17_#in~len;havoc free_17_~i~1;free_17_~i~1 := 0; 726#L780-3 [2020-10-19 20:27:11,601 INFO L796 eck$LassoCheckResult]: Loop: 726#L780-3 assume !!(free_17_~i~1 < free_17_~len);call free_17_#t~mem43.base, free_17_#t~mem43.offset := read~$Pointer$(free_17_~array.base, free_17_~array.offset + 4 * free_17_~i~1, 4);call ULTIMATE.dealloc(free_17_#t~mem43.base, free_17_#t~mem43.offset);havoc free_17_#t~mem43.base, free_17_#t~mem43.offset; 725#L780-2 free_17_#t~post42 := free_17_~i~1;free_17_~i~1 := 1 + free_17_#t~post42;havoc free_17_#t~post42; 726#L780-3 [2020-10-19 20:27:11,601 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-19 20:27:11,601 INFO L82 PathProgramCache]: Analyzing trace with hash -794613143, now seen corresponding path program 1 times [2020-10-19 20:27:11,602 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-19 20:27:11,602 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [462341829] [2020-10-19 20:27:11,602 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-19 20:27:11,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-19 20:27:11,639 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2020-10-19 20:27:11,639 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [462341829] [2020-10-19 20:27:11,639 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-19 20:27:11,640 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-10-19 20:27:11,640 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1405620331] [2020-10-19 20:27:11,640 INFO L799 eck$LassoCheckResult]: stem already infeasible [2020-10-19 20:27:11,640 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-19 20:27:11,641 INFO L82 PathProgramCache]: Analyzing trace with hash 3907, now seen corresponding path program 2 times [2020-10-19 20:27:11,641 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-19 20:27:11,641 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1723060789] [2020-10-19 20:27:11,641 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-19 20:27:11,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-19 20:27:11,645 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-19 20:27:11,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-19 20:27:11,647 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-19 20:27:11,648 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-19 20:27:11,673 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-19 20:27:11,673 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-10-19 20:27:11,674 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-10-19 20:27:11,674 INFO L87 Difference]: Start difference. First operand 41 states and 52 transitions. cyclomatic complexity: 16 Second operand 5 states. [2020-10-19 20:27:11,719 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-19 20:27:11,720 INFO L93 Difference]: Finished difference Result 55 states and 68 transitions. [2020-10-19 20:27:11,721 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-10-19 20:27:11,722 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 55 states and 68 transitions. [2020-10-19 20:27:11,722 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 8 [2020-10-19 20:27:11,723 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 55 states to 55 states and 68 transitions. [2020-10-19 20:27:11,723 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 42 [2020-10-19 20:27:11,723 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 42 [2020-10-19 20:27:11,724 INFO L73 IsDeterministic]: Start isDeterministic. Operand 55 states and 68 transitions. [2020-10-19 20:27:11,724 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-10-19 20:27:11,724 INFO L691 BuchiCegarLoop]: Abstraction has 55 states and 68 transitions. [2020-10-19 20:27:11,724 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states and 68 transitions. [2020-10-19 20:27:11,726 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 30. [2020-10-19 20:27:11,726 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2020-10-19 20:27:11,727 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 38 transitions. [2020-10-19 20:27:11,727 INFO L714 BuchiCegarLoop]: Abstraction has 30 states and 38 transitions. [2020-10-19 20:27:11,727 INFO L594 BuchiCegarLoop]: Abstraction has 30 states and 38 transitions. [2020-10-19 20:27:11,727 INFO L427 BuchiCegarLoop]: ======== Iteration 8============ [2020-10-19 20:27:11,727 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 30 states and 38 transitions. [2020-10-19 20:27:11,728 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 4 [2020-10-19 20:27:11,728 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-10-19 20:27:11,728 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-10-19 20:27:11,729 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-19 20:27:11,729 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2020-10-19 20:27:11,729 INFO L794 eck$LassoCheckResult]: Stem: 853#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call ~#ldv_global_msg_list~0.base, ~#ldv_global_msg_list~0.offset := #Ultimate.allocOnStack(8);call write~init~$Pointer$(~#ldv_global_msg_list~0.base, ~#ldv_global_msg_list~0.offset, ~#ldv_global_msg_list~0.base, ~#ldv_global_msg_list~0.offset, 4);call write~init~$Pointer$(~#ldv_global_msg_list~0.base, ~#ldv_global_msg_list~0.offset, ~#ldv_global_msg_list~0.base, 4 + ~#ldv_global_msg_list~0.offset, 4); 841#L-1 havoc entry_point_#t~ret44, entry_point_#t~ret45.base, entry_point_#t~ret45.offset, entry_point_#t~post46, entry_point_#t~ret47, entry_point_~i~2, entry_point_~len~0, entry_point_~array~0.base, entry_point_~array~0.offset;havoc entry_point_~i~2;havoc ldv_positive_#res;havoc ldv_positive_#t~nondet4, ldv_positive_~r~1;ldv_positive_~r~1 := ldv_positive_#t~nondet4;havoc ldv_positive_#t~nondet4; 842#L520 assume !(ldv_positive_~r~1 > 0);ldv_positive_#res := 1; 843#L521 entry_point_#t~ret44 := ldv_positive_#res;entry_point_~len~0 := entry_point_#t~ret44;havoc entry_point_#t~ret44; 844#L787 assume !!(entry_point_~len~0 < 16777216); 852#L787-2 ldv_malloc_#in~size := 4 * entry_point_~len~0;havoc ldv_malloc_#res.base, ldv_malloc_#res.offset;havoc ldv_malloc_#t~nondet11, ldv_malloc_#t~malloc12.base, ldv_malloc_#t~malloc12.offset, ldv_malloc_~size;ldv_malloc_~size := ldv_malloc_#in~size; 825#L526 assume 0 != ldv_malloc_#t~nondet11;havoc ldv_malloc_#t~nondet11;call ldv_malloc_#t~malloc12.base, ldv_malloc_#t~malloc12.offset := #Ultimate.allocOnHeap(ldv_malloc_~size);ldv_malloc_#res.base, ldv_malloc_#res.offset := ldv_malloc_#t~malloc12.base, ldv_malloc_#t~malloc12.offset; 826#L529 entry_point_#t~ret45.base, entry_point_#t~ret45.offset := ldv_malloc_#res.base, ldv_malloc_#res.offset;entry_point_~array~0.base, entry_point_~array~0.offset := entry_point_#t~ret45.base, entry_point_#t~ret45.offset;havoc entry_point_#t~ret45.base, entry_point_#t~ret45.offset; 831#L789 assume entry_point_~array~0.base != 0 || entry_point_~array~0.offset != 0;entry_point_~i~2 := 0; 832#L790-3 assume !!(entry_point_~i~2 < entry_point_~len~0);call write~$Pointer$(0, 0, entry_point_~array~0.base, entry_point_~array~0.offset + 4 * entry_point_~i~2, 4); 839#L790-2 entry_point_#t~post46 := entry_point_~i~2;entry_point_~i~2 := 1 + entry_point_#t~post46;havoc entry_point_#t~post46; 840#L790-3 assume !(entry_point_~i~2 < entry_point_~len~0); 845#L790-4 alloc_17_#in~array.base, alloc_17_#in~array.offset, alloc_17_#in~len := entry_point_~array~0.base, entry_point_~array~0.offset, entry_point_~len~0;havoc alloc_17_#res;havoc alloc_17_#t~ret39.base, alloc_17_#t~ret39.offset, alloc_17_#t~post38, alloc_17_#t~mem41.base, alloc_17_#t~mem41.offset, alloc_17_#t~post40, alloc_17_~array.base, alloc_17_~array.offset, alloc_17_~len, alloc_17_~p~0.base, alloc_17_~p~0.offset, alloc_17_~i~0, alloc_17_~j~0;alloc_17_~array.base, alloc_17_~array.offset := alloc_17_#in~array.base, alloc_17_#in~array.offset;alloc_17_~len := alloc_17_#in~len;havoc alloc_17_~p~0.base, alloc_17_~p~0.offset;alloc_17_~i~0 := 0;havoc alloc_17_~j~0; 846#L765-3 assume !!(alloc_17_~i~0 < alloc_17_~len);ldv_malloc_#in~size := 4;havoc ldv_malloc_#res.base, ldv_malloc_#res.offset;havoc ldv_malloc_#t~nondet11, ldv_malloc_#t~malloc12.base, ldv_malloc_#t~malloc12.offset, ldv_malloc_~size;ldv_malloc_~size := ldv_malloc_#in~size; 827#L526-1 assume !(0 != ldv_malloc_#t~nondet11);havoc ldv_malloc_#t~nondet11;ldv_malloc_#res.base, ldv_malloc_#res.offset := 0, 0; 828#L529-1 alloc_17_#t~ret39.base, alloc_17_#t~ret39.offset := ldv_malloc_#res.base, ldv_malloc_#res.offset;alloc_17_~p~0.base, alloc_17_~p~0.offset := alloc_17_#t~ret39.base, alloc_17_#t~ret39.offset;havoc alloc_17_#t~ret39.base, alloc_17_#t~ret39.offset; 835#L767 assume alloc_17_~p~0.base == 0 && alloc_17_~p~0.offset == 0; 836#L767-1 alloc_17_~j~0 := alloc_17_~i~0 - 1; 850#L772-3 [2020-10-19 20:27:11,729 INFO L796 eck$LassoCheckResult]: Loop: 850#L772-3 assume !!(alloc_17_~j~0 >= 0);call alloc_17_#t~mem41.base, alloc_17_#t~mem41.offset := read~$Pointer$(alloc_17_~array.base, alloc_17_~array.offset + 4 * alloc_17_~j~0, 4);call ULTIMATE.dealloc(alloc_17_#t~mem41.base, alloc_17_#t~mem41.offset);havoc alloc_17_#t~mem41.base, alloc_17_#t~mem41.offset;call write~$Pointer$(0, 0, alloc_17_~array.base, alloc_17_~array.offset + 4 * alloc_17_~j~0, 4); 849#L772-2 alloc_17_#t~post40 := alloc_17_~j~0;alloc_17_~j~0 := alloc_17_#t~post40 - 1;havoc alloc_17_#t~post40; 850#L772-3 [2020-10-19 20:27:11,730 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-19 20:27:11,730 INFO L82 PathProgramCache]: Analyzing trace with hash -138686333, now seen corresponding path program 1 times [2020-10-19 20:27:11,730 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-19 20:27:11,730 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1723326846] [2020-10-19 20:27:11,731 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-19 20:27:11,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-19 20:27:11,741 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-19 20:27:11,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-19 20:27:11,749 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-19 20:27:11,754 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-19 20:27:11,754 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-19 20:27:11,754 INFO L82 PathProgramCache]: Analyzing trace with hash 3395, now seen corresponding path program 1 times [2020-10-19 20:27:11,755 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-19 20:27:11,755 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1724811455] [2020-10-19 20:27:11,755 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-19 20:27:11,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-19 20:27:11,759 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-19 20:27:11,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-19 20:27:11,761 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-19 20:27:11,763 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-19 20:27:11,763 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-19 20:27:11,763 INFO L82 PathProgramCache]: Analyzing trace with hash -133577403, now seen corresponding path program 1 times [2020-10-19 20:27:11,763 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-19 20:27:11,764 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1881081155] [2020-10-19 20:27:11,764 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-19 20:27:11,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-19 20:27:11,793 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2020-10-19 20:27:11,793 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1881081155] [2020-10-19 20:27:11,793 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-19 20:27:11,793 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-10-19 20:27:11,794 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1490783657] [2020-10-19 20:27:11,879 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-19 20:27:11,880 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-19 20:27:11,880 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-10-19 20:27:11,880 INFO L87 Difference]: Start difference. First operand 30 states and 38 transitions. cyclomatic complexity: 12 Second operand 4 states. [2020-10-19 20:27:11,915 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-19 20:27:11,916 INFO L93 Difference]: Finished difference Result 46 states and 56 transitions. [2020-10-19 20:27:11,917 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-10-19 20:27:11,917 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 46 states and 56 transitions. [2020-10-19 20:27:11,918 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 8 [2020-10-19 20:27:11,919 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 46 states to 46 states and 56 transitions. [2020-10-19 20:27:11,919 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 35 [2020-10-19 20:27:11,919 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 35 [2020-10-19 20:27:11,919 INFO L73 IsDeterministic]: Start isDeterministic. Operand 46 states and 56 transitions. [2020-10-19 20:27:11,920 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-10-19 20:27:11,920 INFO L691 BuchiCegarLoop]: Abstraction has 46 states and 56 transitions. [2020-10-19 20:27:11,920 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states and 56 transitions. [2020-10-19 20:27:11,922 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 35. [2020-10-19 20:27:11,922 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2020-10-19 20:27:11,923 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 44 transitions. [2020-10-19 20:27:11,923 INFO L714 BuchiCegarLoop]: Abstraction has 35 states and 44 transitions. [2020-10-19 20:27:11,923 INFO L594 BuchiCegarLoop]: Abstraction has 35 states and 44 transitions. [2020-10-19 20:27:11,923 INFO L427 BuchiCegarLoop]: ======== Iteration 9============ [2020-10-19 20:27:11,924 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 35 states and 44 transitions. [2020-10-19 20:27:11,924 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 4 [2020-10-19 20:27:11,925 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-10-19 20:27:11,925 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-10-19 20:27:11,926 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-19 20:27:11,926 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2020-10-19 20:27:11,926 INFO L794 eck$LassoCheckResult]: Stem: 940#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call ~#ldv_global_msg_list~0.base, ~#ldv_global_msg_list~0.offset := #Ultimate.allocOnStack(8);call write~init~$Pointer$(~#ldv_global_msg_list~0.base, ~#ldv_global_msg_list~0.offset, ~#ldv_global_msg_list~0.base, ~#ldv_global_msg_list~0.offset, 4);call write~init~$Pointer$(~#ldv_global_msg_list~0.base, ~#ldv_global_msg_list~0.offset, ~#ldv_global_msg_list~0.base, 4 + ~#ldv_global_msg_list~0.offset, 4); 926#L-1 havoc entry_point_#t~ret44, entry_point_#t~ret45.base, entry_point_#t~ret45.offset, entry_point_#t~post46, entry_point_#t~ret47, entry_point_~i~2, entry_point_~len~0, entry_point_~array~0.base, entry_point_~array~0.offset;havoc entry_point_~i~2;havoc ldv_positive_#res;havoc ldv_positive_#t~nondet4, ldv_positive_~r~1;ldv_positive_~r~1 := ldv_positive_#t~nondet4;havoc ldv_positive_#t~nondet4; 927#L520 assume !(ldv_positive_~r~1 > 0);ldv_positive_#res := 1; 930#L521 entry_point_#t~ret44 := ldv_positive_#res;entry_point_~len~0 := entry_point_#t~ret44;havoc entry_point_#t~ret44; 931#L787 assume !!(entry_point_~len~0 < 16777216); 941#L787-2 ldv_malloc_#in~size := 4 * entry_point_~len~0;havoc ldv_malloc_#res.base, ldv_malloc_#res.offset;havoc ldv_malloc_#t~nondet11, ldv_malloc_#t~malloc12.base, ldv_malloc_#t~malloc12.offset, ldv_malloc_~size;ldv_malloc_~size := ldv_malloc_#in~size; 912#L526 assume 0 != ldv_malloc_#t~nondet11;havoc ldv_malloc_#t~nondet11;call ldv_malloc_#t~malloc12.base, ldv_malloc_#t~malloc12.offset := #Ultimate.allocOnHeap(ldv_malloc_~size);ldv_malloc_#res.base, ldv_malloc_#res.offset := ldv_malloc_#t~malloc12.base, ldv_malloc_#t~malloc12.offset; 913#L529 entry_point_#t~ret45.base, entry_point_#t~ret45.offset := ldv_malloc_#res.base, ldv_malloc_#res.offset;entry_point_~array~0.base, entry_point_~array~0.offset := entry_point_#t~ret45.base, entry_point_#t~ret45.offset;havoc entry_point_#t~ret45.base, entry_point_#t~ret45.offset; 918#L789 assume entry_point_~array~0.base != 0 || entry_point_~array~0.offset != 0;entry_point_~i~2 := 0; 919#L790-3 assume !!(entry_point_~i~2 < entry_point_~len~0);call write~$Pointer$(0, 0, entry_point_~array~0.base, entry_point_~array~0.offset + 4 * entry_point_~i~2, 4); 928#L790-2 entry_point_#t~post46 := entry_point_~i~2;entry_point_~i~2 := 1 + entry_point_#t~post46;havoc entry_point_#t~post46; 929#L790-3 assume !(entry_point_~i~2 < entry_point_~len~0); 932#L790-4 alloc_17_#in~array.base, alloc_17_#in~array.offset, alloc_17_#in~len := entry_point_~array~0.base, entry_point_~array~0.offset, entry_point_~len~0;havoc alloc_17_#res;havoc alloc_17_#t~ret39.base, alloc_17_#t~ret39.offset, alloc_17_#t~post38, alloc_17_#t~mem41.base, alloc_17_#t~mem41.offset, alloc_17_#t~post40, alloc_17_~array.base, alloc_17_~array.offset, alloc_17_~len, alloc_17_~p~0.base, alloc_17_~p~0.offset, alloc_17_~i~0, alloc_17_~j~0;alloc_17_~array.base, alloc_17_~array.offset := alloc_17_#in~array.base, alloc_17_#in~array.offset;alloc_17_~len := alloc_17_#in~len;havoc alloc_17_~p~0.base, alloc_17_~p~0.offset;alloc_17_~i~0 := 0;havoc alloc_17_~j~0; 933#L765-3 assume !!(alloc_17_~i~0 < alloc_17_~len);ldv_malloc_#in~size := 4;havoc ldv_malloc_#res.base, ldv_malloc_#res.offset;havoc ldv_malloc_#t~nondet11, ldv_malloc_#t~malloc12.base, ldv_malloc_#t~malloc12.offset, ldv_malloc_~size;ldv_malloc_~size := ldv_malloc_#in~size; 914#L526-1 assume !(0 != ldv_malloc_#t~nondet11);havoc ldv_malloc_#t~nondet11;ldv_malloc_#res.base, ldv_malloc_#res.offset := 0, 0; 915#L529-1 alloc_17_#t~ret39.base, alloc_17_#t~ret39.offset := ldv_malloc_#res.base, ldv_malloc_#res.offset;alloc_17_~p~0.base, alloc_17_~p~0.offset := alloc_17_#t~ret39.base, alloc_17_#t~ret39.offset;havoc alloc_17_#t~ret39.base, alloc_17_#t~ret39.offset; 922#L767 assume alloc_17_~p~0.base == 0 && alloc_17_~p~0.offset == 0; 923#L767-1 alloc_17_~j~0 := alloc_17_~i~0 - 1; 938#L772-3 assume !(alloc_17_~j~0 >= 0); 939#L772-4 alloc_17_#res := 3; 935#L776 entry_point_#t~ret47 := alloc_17_#res;havoc entry_point_#t~ret47;free_17_#in~array.base, free_17_#in~array.offset, free_17_#in~len := entry_point_~array~0.base, entry_point_~array~0.offset, entry_point_~len~0;havoc free_17_#t~mem43.base, free_17_#t~mem43.offset, free_17_#t~post42, free_17_~array.base, free_17_~array.offset, free_17_~len, free_17_~i~1;free_17_~array.base, free_17_~array.offset := free_17_#in~array.base, free_17_#in~array.offset;free_17_~len := free_17_#in~len;havoc free_17_~i~1;free_17_~i~1 := 0; 921#L780-3 [2020-10-19 20:27:11,926 INFO L796 eck$LassoCheckResult]: Loop: 921#L780-3 assume !!(free_17_~i~1 < free_17_~len);call free_17_#t~mem43.base, free_17_#t~mem43.offset := read~$Pointer$(free_17_~array.base, free_17_~array.offset + 4 * free_17_~i~1, 4);call ULTIMATE.dealloc(free_17_#t~mem43.base, free_17_#t~mem43.offset);havoc free_17_#t~mem43.base, free_17_#t~mem43.offset; 920#L780-2 free_17_#t~post42 := free_17_~i~1;free_17_~i~1 := 1 + free_17_#t~post42;havoc free_17_#t~post42; 921#L780-3 [2020-10-19 20:27:11,927 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-19 20:27:11,927 INFO L82 PathProgramCache]: Analyzing trace with hash 154066089, now seen corresponding path program 1 times [2020-10-19 20:27:11,927 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-19 20:27:11,928 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1235268905] [2020-10-19 20:27:11,928 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-19 20:27:11,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-19 20:27:11,939 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-19 20:27:11,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-19 20:27:11,950 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-19 20:27:11,956 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-19 20:27:11,956 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-19 20:27:11,956 INFO L82 PathProgramCache]: Analyzing trace with hash 3907, now seen corresponding path program 3 times [2020-10-19 20:27:11,957 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-19 20:27:11,957 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [256265433] [2020-10-19 20:27:11,957 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-19 20:27:11,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-19 20:27:11,961 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-19 20:27:11,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-19 20:27:11,963 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-19 20:27:11,965 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-19 20:27:11,966 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-19 20:27:11,966 INFO L82 PathProgramCache]: Analyzing trace with hash 2028626411, now seen corresponding path program 1 times [2020-10-19 20:27:11,966 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-19 20:27:11,966 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1831893028] [2020-10-19 20:27:11,967 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-19 20:27:11,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-19 20:27:11,980 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-19 20:27:11,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-19 20:27:11,992 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-19 20:27:11,999 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-19 20:27:12,770 WARN L193 SmtUtils]: Spent 734.00 ms on a formula simplification. DAG size of input: 177 DAG size of output: 158 [2020-10-19 20:27:12,973 WARN L193 SmtUtils]: Spent 193.00 ms on a formula simplification that was a NOOP. DAG size: 128 [2020-10-19 20:27:12,976 INFO L210 LassoAnalysis]: Preferences: [2020-10-19 20:27:12,976 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2020-10-19 20:27:12,976 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-10-19 20:27:12,976 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2020-10-19 20:27:12,976 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2020-10-19 20:27:12,976 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-19 20:27:12,976 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2020-10-19 20:27:12,977 INFO L132 ssoRankerPreferences]: Path of dumped script: [2020-10-19 20:27:12,977 INFO L133 ssoRankerPreferences]: Filename of dumped script: memleaks_test17_2-2.i_Iteration9_Lasso [2020-10-19 20:27:12,977 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2020-10-19 20:27:12,977 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2020-10-19 20:27:12,981 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-19 20:27:13,298 WARN L193 SmtUtils]: Spent 213.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 74 [2020-10-19 20:27:13,341 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-19 20:27:13,348 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-19 20:27:13,356 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-19 20:27:13,358 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-19 20:27:13,361 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-19 20:27:13,365 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-19 20:27:13,367 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-19 20:27:13,368 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-19 20:27:13,371 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-19 20:27:13,374 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-19 20:27:13,377 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-19 20:27:13,381 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-19 20:27:13,387 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-19 20:27:13,389 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-19 20:27:13,391 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-19 20:27:13,394 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-19 20:27:13,396 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-19 20:27:13,399 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-19 20:27:13,400 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-19 20:27:13,402 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-19 20:27:13,404 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-19 20:27:13,407 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-19 20:27:13,409 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-19 20:27:13,419 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-19 20:27:13,421 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-19 20:27:13,422 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-19 20:27:13,425 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-19 20:27:13,431 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-19 20:27:13,434 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-19 20:27:13,438 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-19 20:27:13,440 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-19 20:27:13,443 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-19 20:27:13,662 WARN L193 SmtUtils]: Spent 154.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 50 [2020-10-19 20:27:14,103 WARN L193 SmtUtils]: Spent 127.00 ms on a formula simplification. DAG size of input: 26 DAG size of output: 26 [2020-10-19 20:27:14,219 INFO L292 LassoAnalysis]: Preprocessing complete. [2020-10-19 20:27:14,219 INFO L489 LassoAnalysis]: Using template 'affine'. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 33 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 33 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-19 20:27:14,230 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-10-19 20:27:14,231 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-19 20:27:14,231 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-19 20:27:14,231 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-19 20:27:14,232 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-19 20:27:14,235 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-19 20:27:14,235 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-10-19 20:27:14,240 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 34 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 34 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-19 20:27:14,262 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-10-19 20:27:14,263 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-19 20:27:14,264 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-19 20:27:14,264 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-19 20:27:14,264 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-19 20:27:14,265 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-19 20:27:14,265 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-10-19 20:27:14,267 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 35 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 35 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-19 20:27:14,291 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-10-19 20:27:14,292 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-19 20:27:14,292 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-19 20:27:14,292 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-19 20:27:14,293 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-19 20:27:14,294 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-19 20:27:14,295 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-10-19 20:27:14,300 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 36 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 36 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-19 20:27:14,324 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-10-19 20:27:14,326 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-19 20:27:14,327 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-19 20:27:14,327 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-19 20:27:14,327 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-19 20:27:14,328 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-19 20:27:14,328 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-10-19 20:27:14,331 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 37 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 37 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-19 20:27:14,354 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-10-19 20:27:14,355 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-19 20:27:14,356 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-19 20:27:14,356 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-19 20:27:14,356 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-19 20:27:14,357 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-19 20:27:14,357 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-10-19 20:27:14,359 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 38 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 38 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-19 20:27:14,384 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-10-19 20:27:14,385 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-19 20:27:14,385 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-19 20:27:14,385 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-19 20:27:14,386 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-19 20:27:14,387 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-19 20:27:14,387 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-10-19 20:27:14,391 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 39 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 39 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-19 20:27:14,423 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-10-19 20:27:14,425 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-19 20:27:14,425 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-19 20:27:14,425 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-19 20:27:14,425 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-19 20:27:14,432 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-19 20:27:14,433 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-10-19 20:27:14,452 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2020-10-19 20:27:14,506 INFO L443 ModelExtractionUtils]: Simplification made 18 calls to the SMT solver. [2020-10-19 20:27:14,506 INFO L444 ModelExtractionUtils]: 12 out of 49 variables were initially zero. Simplification set additionally 34 variables to zero. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 40 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 40 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-19 20:27:14,508 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2020-10-19 20:27:14,510 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2020-10-19 20:27:14,510 INFO L510 LassoAnalysis]: Proved termination. [2020-10-19 20:27:14,510 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_free_17_~i~1, ULTIMATE.start_free_17_~len) = -1*ULTIMATE.start_free_17_~i~1 + 1*ULTIMATE.start_free_17_~len Supporting invariants [] [2020-10-19 20:27:14,556 INFO L297 tatePredicateManager]: 9 out of 9 supporting invariants were superfluous and have been removed [2020-10-19 20:27:14,569 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-19 20:27:14,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-19 20:27:14,593 INFO L263 TraceCheckSpWp]: Trace formula consists of 118 conjuncts, 2 conjunts are in the unsatisfiable core [2020-10-19 20:27:14,595 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-19 20:27:14,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-19 20:27:14,601 INFO L263 TraceCheckSpWp]: Trace formula consists of 10 conjuncts, 4 conjunts are in the unsatisfiable core [2020-10-19 20:27:14,602 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-19 20:27:14,612 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-19 20:27:14,612 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2020-10-19 20:27:14,612 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 35 states and 44 transitions. cyclomatic complexity: 13 Second operand 3 states. [2020-10-19 20:27:14,626 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 35 states and 44 transitions. cyclomatic complexity: 13. Second operand 3 states. Result 37 states and 47 transitions. Complement of second has 4 states. [2020-10-19 20:27:14,626 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2020-10-19 20:27:14,627 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-10-19 20:27:14,627 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 31 transitions. [2020-10-19 20:27:14,627 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 31 transitions. Stem has 21 letters. Loop has 2 letters. [2020-10-19 20:27:14,627 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-10-19 20:27:14,627 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 31 transitions. Stem has 23 letters. Loop has 2 letters. [2020-10-19 20:27:14,628 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-10-19 20:27:14,628 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 31 transitions. Stem has 21 letters. Loop has 4 letters. [2020-10-19 20:27:14,628 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-10-19 20:27:14,628 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 37 states and 47 transitions. [2020-10-19 20:27:14,629 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2020-10-19 20:27:14,630 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 37 states to 25 states and 30 transitions. [2020-10-19 20:27:14,630 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 18 [2020-10-19 20:27:14,630 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 18 [2020-10-19 20:27:14,631 INFO L73 IsDeterministic]: Start isDeterministic. Operand 25 states and 30 transitions. [2020-10-19 20:27:14,631 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-10-19 20:27:14,631 INFO L691 BuchiCegarLoop]: Abstraction has 25 states and 30 transitions. [2020-10-19 20:27:14,631 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states and 30 transitions. [2020-10-19 20:27:14,634 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 25. [2020-10-19 20:27:14,635 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2020-10-19 20:27:14,635 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 30 transitions. [2020-10-19 20:27:14,637 INFO L714 BuchiCegarLoop]: Abstraction has 25 states and 30 transitions. [2020-10-19 20:27:14,637 INFO L594 BuchiCegarLoop]: Abstraction has 25 states and 30 transitions. [2020-10-19 20:27:14,637 INFO L427 BuchiCegarLoop]: ======== Iteration 10============ [2020-10-19 20:27:14,638 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 25 states and 30 transitions. [2020-10-19 20:27:14,638 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2020-10-19 20:27:14,638 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-10-19 20:27:14,638 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-10-19 20:27:14,639 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-19 20:27:14,639 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2020-10-19 20:27:14,639 INFO L794 eck$LassoCheckResult]: Stem: 1129#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call ~#ldv_global_msg_list~0.base, ~#ldv_global_msg_list~0.offset := #Ultimate.allocOnStack(8);call write~init~$Pointer$(~#ldv_global_msg_list~0.base, ~#ldv_global_msg_list~0.offset, ~#ldv_global_msg_list~0.base, ~#ldv_global_msg_list~0.offset, 4);call write~init~$Pointer$(~#ldv_global_msg_list~0.base, ~#ldv_global_msg_list~0.offset, ~#ldv_global_msg_list~0.base, 4 + ~#ldv_global_msg_list~0.offset, 4); 1123#L-1 havoc entry_point_#t~ret44, entry_point_#t~ret45.base, entry_point_#t~ret45.offset, entry_point_#t~post46, entry_point_#t~ret47, entry_point_~i~2, entry_point_~len~0, entry_point_~array~0.base, entry_point_~array~0.offset;havoc entry_point_~i~2;havoc ldv_positive_#res;havoc ldv_positive_#t~nondet4, ldv_positive_~r~1;ldv_positive_~r~1 := ldv_positive_#t~nondet4;havoc ldv_positive_#t~nondet4; 1124#L520 assume !(ldv_positive_~r~1 > 0);ldv_positive_#res := 1; 1127#L521 entry_point_#t~ret44 := ldv_positive_#res;entry_point_~len~0 := entry_point_#t~ret44;havoc entry_point_#t~ret44; 1128#L787 assume !!(entry_point_~len~0 < 16777216); 1130#L787-2 ldv_malloc_#in~size := 4 * entry_point_~len~0;havoc ldv_malloc_#res.base, ldv_malloc_#res.offset;havoc ldv_malloc_#t~nondet11, ldv_malloc_#t~malloc12.base, ldv_malloc_#t~malloc12.offset, ldv_malloc_~size;ldv_malloc_~size := ldv_malloc_#in~size; 1109#L526 assume 0 != ldv_malloc_#t~nondet11;havoc ldv_malloc_#t~nondet11;call ldv_malloc_#t~malloc12.base, ldv_malloc_#t~malloc12.offset := #Ultimate.allocOnHeap(ldv_malloc_~size);ldv_malloc_#res.base, ldv_malloc_#res.offset := ldv_malloc_#t~malloc12.base, ldv_malloc_#t~malloc12.offset; 1110#L529 entry_point_#t~ret45.base, entry_point_#t~ret45.offset := ldv_malloc_#res.base, ldv_malloc_#res.offset;entry_point_~array~0.base, entry_point_~array~0.offset := entry_point_#t~ret45.base, entry_point_#t~ret45.offset;havoc entry_point_#t~ret45.base, entry_point_#t~ret45.offset; 1117#L789 assume entry_point_~array~0.base != 0 || entry_point_~array~0.offset != 0;entry_point_~i~2 := 0; 1118#L790-3 assume !!(entry_point_~i~2 < entry_point_~len~0);call write~$Pointer$(0, 0, entry_point_~array~0.base, entry_point_~array~0.offset + 4 * entry_point_~i~2, 4); 1125#L790-2 entry_point_#t~post46 := entry_point_~i~2;entry_point_~i~2 := 1 + entry_point_#t~post46;havoc entry_point_#t~post46; 1126#L790-3 assume !(entry_point_~i~2 < entry_point_~len~0); 1131#L790-4 alloc_17_#in~array.base, alloc_17_#in~array.offset, alloc_17_#in~len := entry_point_~array~0.base, entry_point_~array~0.offset, entry_point_~len~0;havoc alloc_17_#res;havoc alloc_17_#t~ret39.base, alloc_17_#t~ret39.offset, alloc_17_#t~post38, alloc_17_#t~mem41.base, alloc_17_#t~mem41.offset, alloc_17_#t~post40, alloc_17_~array.base, alloc_17_~array.offset, alloc_17_~len, alloc_17_~p~0.base, alloc_17_~p~0.offset, alloc_17_~i~0, alloc_17_~j~0;alloc_17_~array.base, alloc_17_~array.offset := alloc_17_#in~array.base, alloc_17_#in~array.offset;alloc_17_~len := alloc_17_#in~len;havoc alloc_17_~p~0.base, alloc_17_~p~0.offset;alloc_17_~i~0 := 0;havoc alloc_17_~j~0; 1132#L765-3 assume !!(alloc_17_~i~0 < alloc_17_~len);ldv_malloc_#in~size := 4;havoc ldv_malloc_#res.base, ldv_malloc_#res.offset;havoc ldv_malloc_#t~nondet11, ldv_malloc_#t~malloc12.base, ldv_malloc_#t~malloc12.offset, ldv_malloc_~size;ldv_malloc_~size := ldv_malloc_#in~size; 1113#L526-1 assume !(0 != ldv_malloc_#t~nondet11);havoc ldv_malloc_#t~nondet11;ldv_malloc_#res.base, ldv_malloc_#res.offset := 0, 0; 1114#L529-1 alloc_17_#t~ret39.base, alloc_17_#t~ret39.offset := ldv_malloc_#res.base, ldv_malloc_#res.offset;alloc_17_~p~0.base, alloc_17_~p~0.offset := alloc_17_#t~ret39.base, alloc_17_#t~ret39.offset;havoc alloc_17_#t~ret39.base, alloc_17_#t~ret39.offset; 1121#L767 assume !(alloc_17_~p~0.base == 0 && alloc_17_~p~0.offset == 0);call write~$Pointer$(alloc_17_~p~0.base, alloc_17_~p~0.offset, alloc_17_~array.base, alloc_17_~array.offset + 4 * alloc_17_~i~0, 4); 1122#L765-2 alloc_17_#t~post38 := alloc_17_~i~0;alloc_17_~i~0 := 1 + alloc_17_#t~post38;havoc alloc_17_#t~post38; 1133#L765-3 assume !!(alloc_17_~i~0 < alloc_17_~len);ldv_malloc_#in~size := 4;havoc ldv_malloc_#res.base, ldv_malloc_#res.offset;havoc ldv_malloc_#t~nondet11, ldv_malloc_#t~malloc12.base, ldv_malloc_#t~malloc12.offset, ldv_malloc_~size;ldv_malloc_~size := ldv_malloc_#in~size; 1111#L526-1 assume !(0 != ldv_malloc_#t~nondet11);havoc ldv_malloc_#t~nondet11;ldv_malloc_#res.base, ldv_malloc_#res.offset := 0, 0; 1112#L529-1 alloc_17_#t~ret39.base, alloc_17_#t~ret39.offset := ldv_malloc_#res.base, ldv_malloc_#res.offset;alloc_17_~p~0.base, alloc_17_~p~0.offset := alloc_17_#t~ret39.base, alloc_17_#t~ret39.offset;havoc alloc_17_#t~ret39.base, alloc_17_#t~ret39.offset; 1119#L767 assume alloc_17_~p~0.base == 0 && alloc_17_~p~0.offset == 0; 1120#L767-1 alloc_17_~j~0 := alloc_17_~i~0 - 1; 1116#L772-3 [2020-10-19 20:27:14,640 INFO L796 eck$LassoCheckResult]: Loop: 1116#L772-3 assume !!(alloc_17_~j~0 >= 0);call alloc_17_#t~mem41.base, alloc_17_#t~mem41.offset := read~$Pointer$(alloc_17_~array.base, alloc_17_~array.offset + 4 * alloc_17_~j~0, 4);call ULTIMATE.dealloc(alloc_17_#t~mem41.base, alloc_17_#t~mem41.offset);havoc alloc_17_#t~mem41.base, alloc_17_#t~mem41.offset;call write~$Pointer$(0, 0, alloc_17_~array.base, alloc_17_~array.offset + 4 * alloc_17_~j~0, 4); 1115#L772-2 alloc_17_#t~post40 := alloc_17_~j~0;alloc_17_~j~0 := alloc_17_#t~post40 - 1;havoc alloc_17_#t~post40; 1116#L772-3 [2020-10-19 20:27:14,640 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-19 20:27:14,640 INFO L82 PathProgramCache]: Analyzing trace with hash -688012863, now seen corresponding path program 1 times [2020-10-19 20:27:14,640 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-19 20:27:14,641 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [388170366] [2020-10-19 20:27:14,641 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-19 20:27:14,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-19 20:27:14,668 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2020-10-19 20:27:14,668 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [388170366] [2020-10-19 20:27:14,669 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-19 20:27:14,669 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-10-19 20:27:14,669 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [44820934] [2020-10-19 20:27:14,669 INFO L799 eck$LassoCheckResult]: stem already infeasible [2020-10-19 20:27:14,669 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-19 20:27:14,670 INFO L82 PathProgramCache]: Analyzing trace with hash 3395, now seen corresponding path program 2 times [2020-10-19 20:27:14,670 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-19 20:27:14,670 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [599080413] [2020-10-19 20:27:14,670 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-19 20:27:14,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-19 20:27:14,674 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-19 20:27:14,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-19 20:27:14,676 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-19 20:27:14,678 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-19 20:27:14,775 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-19 20:27:14,775 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-19 20:27:14,776 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-10-19 20:27:14,776 INFO L87 Difference]: Start difference. First operand 25 states and 30 transitions. cyclomatic complexity: 8 Second operand 4 states. [2020-10-19 20:27:14,802 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-19 20:27:14,803 INFO L93 Difference]: Finished difference Result 32 states and 36 transitions. [2020-10-19 20:27:14,804 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-10-19 20:27:14,804 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 32 states and 36 transitions. [2020-10-19 20:27:14,805 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 4 [2020-10-19 20:27:14,805 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 32 states to 30 states and 34 transitions. [2020-10-19 20:27:14,806 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 23 [2020-10-19 20:27:14,806 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 23 [2020-10-19 20:27:14,806 INFO L73 IsDeterministic]: Start isDeterministic. Operand 30 states and 34 transitions. [2020-10-19 20:27:14,806 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-10-19 20:27:14,806 INFO L691 BuchiCegarLoop]: Abstraction has 30 states and 34 transitions. [2020-10-19 20:27:14,807 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states and 34 transitions. [2020-10-19 20:27:14,808 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 25. [2020-10-19 20:27:14,809 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2020-10-19 20:27:14,809 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 29 transitions. [2020-10-19 20:27:14,809 INFO L714 BuchiCegarLoop]: Abstraction has 25 states and 29 transitions. [2020-10-19 20:27:14,809 INFO L594 BuchiCegarLoop]: Abstraction has 25 states and 29 transitions. [2020-10-19 20:27:14,810 INFO L427 BuchiCegarLoop]: ======== Iteration 11============ [2020-10-19 20:27:14,810 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 25 states and 29 transitions. [2020-10-19 20:27:14,810 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2020-10-19 20:27:14,810 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-10-19 20:27:14,810 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-10-19 20:27:14,811 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-19 20:27:14,811 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2020-10-19 20:27:14,812 INFO L794 eck$LassoCheckResult]: Stem: 1196#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call ~#ldv_global_msg_list~0.base, ~#ldv_global_msg_list~0.offset := #Ultimate.allocOnStack(8);call write~init~$Pointer$(~#ldv_global_msg_list~0.base, ~#ldv_global_msg_list~0.offset, ~#ldv_global_msg_list~0.base, ~#ldv_global_msg_list~0.offset, 4);call write~init~$Pointer$(~#ldv_global_msg_list~0.base, ~#ldv_global_msg_list~0.offset, ~#ldv_global_msg_list~0.base, 4 + ~#ldv_global_msg_list~0.offset, 4); 1189#L-1 havoc entry_point_#t~ret44, entry_point_#t~ret45.base, entry_point_#t~ret45.offset, entry_point_#t~post46, entry_point_#t~ret47, entry_point_~i~2, entry_point_~len~0, entry_point_~array~0.base, entry_point_~array~0.offset;havoc entry_point_~i~2;havoc ldv_positive_#res;havoc ldv_positive_#t~nondet4, ldv_positive_~r~1;ldv_positive_~r~1 := ldv_positive_#t~nondet4;havoc ldv_positive_#t~nondet4; 1190#L520 assume !(ldv_positive_~r~1 > 0);ldv_positive_#res := 1; 1193#L521 entry_point_#t~ret44 := ldv_positive_#res;entry_point_~len~0 := entry_point_#t~ret44;havoc entry_point_#t~ret44; 1194#L787 assume !!(entry_point_~len~0 < 16777216); 1197#L787-2 ldv_malloc_#in~size := 4 * entry_point_~len~0;havoc ldv_malloc_#res.base, ldv_malloc_#res.offset;havoc ldv_malloc_#t~nondet11, ldv_malloc_#t~malloc12.base, ldv_malloc_#t~malloc12.offset, ldv_malloc_~size;ldv_malloc_~size := ldv_malloc_#in~size; 1175#L526 assume 0 != ldv_malloc_#t~nondet11;havoc ldv_malloc_#t~nondet11;call ldv_malloc_#t~malloc12.base, ldv_malloc_#t~malloc12.offset := #Ultimate.allocOnHeap(ldv_malloc_~size);ldv_malloc_#res.base, ldv_malloc_#res.offset := ldv_malloc_#t~malloc12.base, ldv_malloc_#t~malloc12.offset; 1176#L529 entry_point_#t~ret45.base, entry_point_#t~ret45.offset := ldv_malloc_#res.base, ldv_malloc_#res.offset;entry_point_~array~0.base, entry_point_~array~0.offset := entry_point_#t~ret45.base, entry_point_#t~ret45.offset;havoc entry_point_#t~ret45.base, entry_point_#t~ret45.offset; 1183#L789 assume entry_point_~array~0.base != 0 || entry_point_~array~0.offset != 0;entry_point_~i~2 := 0; 1184#L790-3 assume !!(entry_point_~i~2 < entry_point_~len~0);call write~$Pointer$(0, 0, entry_point_~array~0.base, entry_point_~array~0.offset + 4 * entry_point_~i~2, 4); 1191#L790-2 entry_point_#t~post46 := entry_point_~i~2;entry_point_~i~2 := 1 + entry_point_#t~post46;havoc entry_point_#t~post46; 1192#L790-3 assume !(entry_point_~i~2 < entry_point_~len~0); 1195#L790-4 alloc_17_#in~array.base, alloc_17_#in~array.offset, alloc_17_#in~len := entry_point_~array~0.base, entry_point_~array~0.offset, entry_point_~len~0;havoc alloc_17_#res;havoc alloc_17_#t~ret39.base, alloc_17_#t~ret39.offset, alloc_17_#t~post38, alloc_17_#t~mem41.base, alloc_17_#t~mem41.offset, alloc_17_#t~post40, alloc_17_~array.base, alloc_17_~array.offset, alloc_17_~len, alloc_17_~p~0.base, alloc_17_~p~0.offset, alloc_17_~i~0, alloc_17_~j~0;alloc_17_~array.base, alloc_17_~array.offset := alloc_17_#in~array.base, alloc_17_#in~array.offset;alloc_17_~len := alloc_17_#in~len;havoc alloc_17_~p~0.base, alloc_17_~p~0.offset;alloc_17_~i~0 := 0;havoc alloc_17_~j~0; 1198#L765-3 assume !!(alloc_17_~i~0 < alloc_17_~len);ldv_malloc_#in~size := 4;havoc ldv_malloc_#res.base, ldv_malloc_#res.offset;havoc ldv_malloc_#t~nondet11, ldv_malloc_#t~malloc12.base, ldv_malloc_#t~malloc12.offset, ldv_malloc_~size;ldv_malloc_~size := ldv_malloc_#in~size; 1179#L526-1 assume 0 != ldv_malloc_#t~nondet11;havoc ldv_malloc_#t~nondet11;call ldv_malloc_#t~malloc12.base, ldv_malloc_#t~malloc12.offset := #Ultimate.allocOnHeap(ldv_malloc_~size);ldv_malloc_#res.base, ldv_malloc_#res.offset := ldv_malloc_#t~malloc12.base, ldv_malloc_#t~malloc12.offset; 1180#L529-1 alloc_17_#t~ret39.base, alloc_17_#t~ret39.offset := ldv_malloc_#res.base, ldv_malloc_#res.offset;alloc_17_~p~0.base, alloc_17_~p~0.offset := alloc_17_#t~ret39.base, alloc_17_#t~ret39.offset;havoc alloc_17_#t~ret39.base, alloc_17_#t~ret39.offset; 1187#L767 assume !(alloc_17_~p~0.base == 0 && alloc_17_~p~0.offset == 0);call write~$Pointer$(alloc_17_~p~0.base, alloc_17_~p~0.offset, alloc_17_~array.base, alloc_17_~array.offset + 4 * alloc_17_~i~0, 4); 1188#L765-2 alloc_17_#t~post38 := alloc_17_~i~0;alloc_17_~i~0 := 1 + alloc_17_#t~post38;havoc alloc_17_#t~post38; 1199#L765-3 assume !!(alloc_17_~i~0 < alloc_17_~len);ldv_malloc_#in~size := 4;havoc ldv_malloc_#res.base, ldv_malloc_#res.offset;havoc ldv_malloc_#t~nondet11, ldv_malloc_#t~malloc12.base, ldv_malloc_#t~malloc12.offset, ldv_malloc_~size;ldv_malloc_~size := ldv_malloc_#in~size; 1177#L526-1 assume !(0 != ldv_malloc_#t~nondet11);havoc ldv_malloc_#t~nondet11;ldv_malloc_#res.base, ldv_malloc_#res.offset := 0, 0; 1178#L529-1 alloc_17_#t~ret39.base, alloc_17_#t~ret39.offset := ldv_malloc_#res.base, ldv_malloc_#res.offset;alloc_17_~p~0.base, alloc_17_~p~0.offset := alloc_17_#t~ret39.base, alloc_17_#t~ret39.offset;havoc alloc_17_#t~ret39.base, alloc_17_#t~ret39.offset; 1185#L767 assume alloc_17_~p~0.base == 0 && alloc_17_~p~0.offset == 0; 1186#L767-1 alloc_17_~j~0 := alloc_17_~i~0 - 1; 1182#L772-3 [2020-10-19 20:27:14,812 INFO L796 eck$LassoCheckResult]: Loop: 1182#L772-3 assume !!(alloc_17_~j~0 >= 0);call alloc_17_#t~mem41.base, alloc_17_#t~mem41.offset := read~$Pointer$(alloc_17_~array.base, alloc_17_~array.offset + 4 * alloc_17_~j~0, 4);call ULTIMATE.dealloc(alloc_17_#t~mem41.base, alloc_17_#t~mem41.offset);havoc alloc_17_#t~mem41.base, alloc_17_#t~mem41.offset;call write~$Pointer$(0, 0, alloc_17_~array.base, alloc_17_~array.offset + 4 * alloc_17_~j~0, 4); 1181#L772-2 alloc_17_#t~post40 := alloc_17_~j~0;alloc_17_~j~0 := alloc_17_#t~post40 - 1;havoc alloc_17_#t~post40; 1182#L772-3 [2020-10-19 20:27:14,812 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-19 20:27:14,812 INFO L82 PathProgramCache]: Analyzing trace with hash -1368071233, now seen corresponding path program 1 times [2020-10-19 20:27:14,812 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-19 20:27:14,812 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [140281701] [2020-10-19 20:27:14,812 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-19 20:27:14,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-19 20:27:14,859 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2020-10-19 20:27:14,859 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [140281701] [2020-10-19 20:27:14,860 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1680519461] [2020-10-19 20:27:14,860 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 41 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 41 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-10-19 20:27:14,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-19 20:27:14,926 INFO L263 TraceCheckSpWp]: Trace formula consists of 133 conjuncts, 7 conjunts are in the unsatisfiable core [2020-10-19 20:27:14,927 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-19 20:27:14,997 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2020-10-19 20:27:14,997 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2020-10-19 20:27:14,997 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [6] total 10 [2020-10-19 20:27:14,998 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2064836381] [2020-10-19 20:27:14,998 INFO L799 eck$LassoCheckResult]: stem already infeasible [2020-10-19 20:27:14,998 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-19 20:27:14,998 INFO L82 PathProgramCache]: Analyzing trace with hash 3395, now seen corresponding path program 3 times [2020-10-19 20:27:14,999 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-19 20:27:14,999 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1280030412] [2020-10-19 20:27:14,999 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-19 20:27:15,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-19 20:27:15,003 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-19 20:27:15,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-19 20:27:15,006 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-19 20:27:15,007 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-19 20:27:15,093 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-19 20:27:15,094 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-10-19 20:27:15,094 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2020-10-19 20:27:15,094 INFO L87 Difference]: Start difference. First operand 25 states and 29 transitions. cyclomatic complexity: 7 Second operand 6 states. [2020-10-19 20:27:15,179 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-19 20:27:15,179 INFO L93 Difference]: Finished difference Result 41 states and 45 transitions. [2020-10-19 20:27:15,180 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-10-19 20:27:15,181 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 41 states and 45 transitions. [2020-10-19 20:27:15,181 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2020-10-19 20:27:15,182 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 41 states to 25 states and 28 transitions. [2020-10-19 20:27:15,182 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 18 [2020-10-19 20:27:15,182 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 18 [2020-10-19 20:27:15,184 INFO L73 IsDeterministic]: Start isDeterministic. Operand 25 states and 28 transitions. [2020-10-19 20:27:15,184 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-10-19 20:27:15,184 INFO L691 BuchiCegarLoop]: Abstraction has 25 states and 28 transitions. [2020-10-19 20:27:15,185 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states and 28 transitions. [2020-10-19 20:27:15,186 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 25. [2020-10-19 20:27:15,186 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2020-10-19 20:27:15,186 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 28 transitions. [2020-10-19 20:27:15,186 INFO L714 BuchiCegarLoop]: Abstraction has 25 states and 28 transitions. [2020-10-19 20:27:15,186 INFO L594 BuchiCegarLoop]: Abstraction has 25 states and 28 transitions. [2020-10-19 20:27:15,186 INFO L427 BuchiCegarLoop]: ======== Iteration 12============ [2020-10-19 20:27:15,186 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 25 states and 28 transitions. [2020-10-19 20:27:15,187 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2020-10-19 20:27:15,187 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-10-19 20:27:15,187 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-10-19 20:27:15,190 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-19 20:27:15,190 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2020-10-19 20:27:15,190 INFO L794 eck$LassoCheckResult]: Stem: 1348#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call ~#ldv_global_msg_list~0.base, ~#ldv_global_msg_list~0.offset := #Ultimate.allocOnStack(8);call write~init~$Pointer$(~#ldv_global_msg_list~0.base, ~#ldv_global_msg_list~0.offset, ~#ldv_global_msg_list~0.base, ~#ldv_global_msg_list~0.offset, 4);call write~init~$Pointer$(~#ldv_global_msg_list~0.base, ~#ldv_global_msg_list~0.offset, ~#ldv_global_msg_list~0.base, 4 + ~#ldv_global_msg_list~0.offset, 4); 1340#L-1 havoc entry_point_#t~ret44, entry_point_#t~ret45.base, entry_point_#t~ret45.offset, entry_point_#t~post46, entry_point_#t~ret47, entry_point_~i~2, entry_point_~len~0, entry_point_~array~0.base, entry_point_~array~0.offset;havoc entry_point_~i~2;havoc ldv_positive_#res;havoc ldv_positive_#t~nondet4, ldv_positive_~r~1;ldv_positive_~r~1 := ldv_positive_#t~nondet4;havoc ldv_positive_#t~nondet4; 1341#L520 assume ldv_positive_~r~1 > 0;ldv_positive_#res := ldv_positive_~r~1; 1344#L521 entry_point_#t~ret44 := ldv_positive_#res;entry_point_~len~0 := entry_point_#t~ret44;havoc entry_point_#t~ret44; 1345#L787 assume !!(entry_point_~len~0 < 16777216); 1346#L787-2 ldv_malloc_#in~size := 4 * entry_point_~len~0;havoc ldv_malloc_#res.base, ldv_malloc_#res.offset;havoc ldv_malloc_#t~nondet11, ldv_malloc_#t~malloc12.base, ldv_malloc_#t~malloc12.offset, ldv_malloc_~size;ldv_malloc_~size := ldv_malloc_#in~size; 1326#L526 assume 0 != ldv_malloc_#t~nondet11;havoc ldv_malloc_#t~nondet11;call ldv_malloc_#t~malloc12.base, ldv_malloc_#t~malloc12.offset := #Ultimate.allocOnHeap(ldv_malloc_~size);ldv_malloc_#res.base, ldv_malloc_#res.offset := ldv_malloc_#t~malloc12.base, ldv_malloc_#t~malloc12.offset; 1327#L529 entry_point_#t~ret45.base, entry_point_#t~ret45.offset := ldv_malloc_#res.base, ldv_malloc_#res.offset;entry_point_~array~0.base, entry_point_~array~0.offset := entry_point_#t~ret45.base, entry_point_#t~ret45.offset;havoc entry_point_#t~ret45.base, entry_point_#t~ret45.offset; 1334#L789 assume entry_point_~array~0.base != 0 || entry_point_~array~0.offset != 0;entry_point_~i~2 := 0; 1335#L790-3 assume !!(entry_point_~i~2 < entry_point_~len~0);call write~$Pointer$(0, 0, entry_point_~array~0.base, entry_point_~array~0.offset + 4 * entry_point_~i~2, 4); 1342#L790-2 entry_point_#t~post46 := entry_point_~i~2;entry_point_~i~2 := 1 + entry_point_#t~post46;havoc entry_point_#t~post46; 1343#L790-3 assume !(entry_point_~i~2 < entry_point_~len~0); 1347#L790-4 alloc_17_#in~array.base, alloc_17_#in~array.offset, alloc_17_#in~len := entry_point_~array~0.base, entry_point_~array~0.offset, entry_point_~len~0;havoc alloc_17_#res;havoc alloc_17_#t~ret39.base, alloc_17_#t~ret39.offset, alloc_17_#t~post38, alloc_17_#t~mem41.base, alloc_17_#t~mem41.offset, alloc_17_#t~post40, alloc_17_~array.base, alloc_17_~array.offset, alloc_17_~len, alloc_17_~p~0.base, alloc_17_~p~0.offset, alloc_17_~i~0, alloc_17_~j~0;alloc_17_~array.base, alloc_17_~array.offset := alloc_17_#in~array.base, alloc_17_#in~array.offset;alloc_17_~len := alloc_17_#in~len;havoc alloc_17_~p~0.base, alloc_17_~p~0.offset;alloc_17_~i~0 := 0;havoc alloc_17_~j~0; 1349#L765-3 assume !!(alloc_17_~i~0 < alloc_17_~len);ldv_malloc_#in~size := 4;havoc ldv_malloc_#res.base, ldv_malloc_#res.offset;havoc ldv_malloc_#t~nondet11, ldv_malloc_#t~malloc12.base, ldv_malloc_#t~malloc12.offset, ldv_malloc_~size;ldv_malloc_~size := ldv_malloc_#in~size; 1330#L526-1 assume 0 != ldv_malloc_#t~nondet11;havoc ldv_malloc_#t~nondet11;call ldv_malloc_#t~malloc12.base, ldv_malloc_#t~malloc12.offset := #Ultimate.allocOnHeap(ldv_malloc_~size);ldv_malloc_#res.base, ldv_malloc_#res.offset := ldv_malloc_#t~malloc12.base, ldv_malloc_#t~malloc12.offset; 1331#L529-1 alloc_17_#t~ret39.base, alloc_17_#t~ret39.offset := ldv_malloc_#res.base, ldv_malloc_#res.offset;alloc_17_~p~0.base, alloc_17_~p~0.offset := alloc_17_#t~ret39.base, alloc_17_#t~ret39.offset;havoc alloc_17_#t~ret39.base, alloc_17_#t~ret39.offset; 1338#L767 assume !(alloc_17_~p~0.base == 0 && alloc_17_~p~0.offset == 0);call write~$Pointer$(alloc_17_~p~0.base, alloc_17_~p~0.offset, alloc_17_~array.base, alloc_17_~array.offset + 4 * alloc_17_~i~0, 4); 1339#L765-2 alloc_17_#t~post38 := alloc_17_~i~0;alloc_17_~i~0 := 1 + alloc_17_#t~post38;havoc alloc_17_#t~post38; 1350#L765-3 assume !!(alloc_17_~i~0 < alloc_17_~len);ldv_malloc_#in~size := 4;havoc ldv_malloc_#res.base, ldv_malloc_#res.offset;havoc ldv_malloc_#t~nondet11, ldv_malloc_#t~malloc12.base, ldv_malloc_#t~malloc12.offset, ldv_malloc_~size;ldv_malloc_~size := ldv_malloc_#in~size; 1328#L526-1 assume !(0 != ldv_malloc_#t~nondet11);havoc ldv_malloc_#t~nondet11;ldv_malloc_#res.base, ldv_malloc_#res.offset := 0, 0; 1329#L529-1 alloc_17_#t~ret39.base, alloc_17_#t~ret39.offset := ldv_malloc_#res.base, ldv_malloc_#res.offset;alloc_17_~p~0.base, alloc_17_~p~0.offset := alloc_17_#t~ret39.base, alloc_17_#t~ret39.offset;havoc alloc_17_#t~ret39.base, alloc_17_#t~ret39.offset; 1336#L767 assume alloc_17_~p~0.base == 0 && alloc_17_~p~0.offset == 0; 1337#L767-1 alloc_17_~j~0 := alloc_17_~i~0 - 1; 1333#L772-3 [2020-10-19 20:27:15,191 INFO L796 eck$LassoCheckResult]: Loop: 1333#L772-3 assume !!(alloc_17_~j~0 >= 0);call alloc_17_#t~mem41.base, alloc_17_#t~mem41.offset := read~$Pointer$(alloc_17_~array.base, alloc_17_~array.offset + 4 * alloc_17_~j~0, 4);call ULTIMATE.dealloc(alloc_17_#t~mem41.base, alloc_17_#t~mem41.offset);havoc alloc_17_#t~mem41.base, alloc_17_#t~mem41.offset;call write~$Pointer$(0, 0, alloc_17_~array.base, alloc_17_~array.offset + 4 * alloc_17_~j~0, 4); 1332#L772-2 alloc_17_#t~post40 := alloc_17_~j~0;alloc_17_~j~0 := alloc_17_#t~post40 - 1;havoc alloc_17_#t~post40; 1333#L772-3 [2020-10-19 20:27:15,191 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-19 20:27:15,191 INFO L82 PathProgramCache]: Analyzing trace with hash -1790773059, now seen corresponding path program 1 times [2020-10-19 20:27:15,192 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-19 20:27:15,192 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1069003887] [2020-10-19 20:27:15,192 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-19 20:27:15,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-19 20:27:15,288 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-19 20:27:15,288 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1069003887] [2020-10-19 20:27:15,288 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1792408622] [2020-10-19 20:27:15,288 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 42 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 42 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-10-19 20:27:15,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-19 20:27:15,340 INFO L263 TraceCheckSpWp]: Trace formula consists of 133 conjuncts, 8 conjunts are in the unsatisfiable core [2020-10-19 20:27:15,342 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-19 20:27:15,390 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-19 20:27:15,391 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-10-19 20:27:15,391 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 10 [2020-10-19 20:27:15,391 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1441989172] [2020-10-19 20:27:15,391 INFO L799 eck$LassoCheckResult]: stem already infeasible [2020-10-19 20:27:15,392 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-19 20:27:15,392 INFO L82 PathProgramCache]: Analyzing trace with hash 3395, now seen corresponding path program 4 times [2020-10-19 20:27:15,392 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-19 20:27:15,393 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1604732079] [2020-10-19 20:27:15,393 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-19 20:27:15,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-19 20:27:15,397 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-19 20:27:15,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-19 20:27:15,399 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-19 20:27:15,401 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-19 20:27:15,480 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-19 20:27:15,480 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-10-19 20:27:15,480 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2020-10-19 20:27:15,481 INFO L87 Difference]: Start difference. First operand 25 states and 28 transitions. cyclomatic complexity: 6 Second operand 10 states. [2020-10-19 20:27:15,570 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-19 20:27:15,570 INFO L93 Difference]: Finished difference Result 35 states and 38 transitions. [2020-10-19 20:27:15,571 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-10-19 20:27:15,571 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 35 states and 38 transitions. [2020-10-19 20:27:15,571 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2020-10-19 20:27:15,572 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 35 states to 28 states and 31 transitions. [2020-10-19 20:27:15,572 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 18 [2020-10-19 20:27:15,572 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 18 [2020-10-19 20:27:15,572 INFO L73 IsDeterministic]: Start isDeterministic. Operand 28 states and 31 transitions. [2020-10-19 20:27:15,572 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-10-19 20:27:15,572 INFO L691 BuchiCegarLoop]: Abstraction has 28 states and 31 transitions. [2020-10-19 20:27:15,572 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states and 31 transitions. [2020-10-19 20:27:15,574 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 27. [2020-10-19 20:27:15,574 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2020-10-19 20:27:15,574 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 30 transitions. [2020-10-19 20:27:15,574 INFO L714 BuchiCegarLoop]: Abstraction has 27 states and 30 transitions. [2020-10-19 20:27:15,574 INFO L594 BuchiCegarLoop]: Abstraction has 27 states and 30 transitions. [2020-10-19 20:27:15,574 INFO L427 BuchiCegarLoop]: ======== Iteration 13============ [2020-10-19 20:27:15,574 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 27 states and 30 transitions. [2020-10-19 20:27:15,575 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2020-10-19 20:27:15,575 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-10-19 20:27:15,575 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-10-19 20:27:15,576 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-19 20:27:15,576 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2020-10-19 20:27:15,577 INFO L794 eck$LassoCheckResult]: Stem: 1491#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call ~#ldv_global_msg_list~0.base, ~#ldv_global_msg_list~0.offset := #Ultimate.allocOnStack(8);call write~init~$Pointer$(~#ldv_global_msg_list~0.base, ~#ldv_global_msg_list~0.offset, ~#ldv_global_msg_list~0.base, ~#ldv_global_msg_list~0.offset, 4);call write~init~$Pointer$(~#ldv_global_msg_list~0.base, ~#ldv_global_msg_list~0.offset, ~#ldv_global_msg_list~0.base, 4 + ~#ldv_global_msg_list~0.offset, 4); 1485#L-1 havoc entry_point_#t~ret44, entry_point_#t~ret45.base, entry_point_#t~ret45.offset, entry_point_#t~post46, entry_point_#t~ret47, entry_point_~i~2, entry_point_~len~0, entry_point_~array~0.base, entry_point_~array~0.offset;havoc entry_point_~i~2;havoc ldv_positive_#res;havoc ldv_positive_#t~nondet4, ldv_positive_~r~1;ldv_positive_~r~1 := ldv_positive_#t~nondet4;havoc ldv_positive_#t~nondet4; 1486#L520 assume ldv_positive_~r~1 > 0;ldv_positive_#res := ldv_positive_~r~1; 1489#L521 entry_point_#t~ret44 := ldv_positive_#res;entry_point_~len~0 := entry_point_#t~ret44;havoc entry_point_#t~ret44; 1490#L787 assume !!(entry_point_~len~0 < 16777216); 1492#L787-2 ldv_malloc_#in~size := 4 * entry_point_~len~0;havoc ldv_malloc_#res.base, ldv_malloc_#res.offset;havoc ldv_malloc_#t~nondet11, ldv_malloc_#t~malloc12.base, ldv_malloc_#t~malloc12.offset, ldv_malloc_~size;ldv_malloc_~size := ldv_malloc_#in~size; 1471#L526 assume 0 != ldv_malloc_#t~nondet11;havoc ldv_malloc_#t~nondet11;call ldv_malloc_#t~malloc12.base, ldv_malloc_#t~malloc12.offset := #Ultimate.allocOnHeap(ldv_malloc_~size);ldv_malloc_#res.base, ldv_malloc_#res.offset := ldv_malloc_#t~malloc12.base, ldv_malloc_#t~malloc12.offset; 1472#L529 entry_point_#t~ret45.base, entry_point_#t~ret45.offset := ldv_malloc_#res.base, ldv_malloc_#res.offset;entry_point_~array~0.base, entry_point_~array~0.offset := entry_point_#t~ret45.base, entry_point_#t~ret45.offset;havoc entry_point_#t~ret45.base, entry_point_#t~ret45.offset; 1479#L789 assume entry_point_~array~0.base != 0 || entry_point_~array~0.offset != 0;entry_point_~i~2 := 0; 1480#L790-3 assume !!(entry_point_~i~2 < entry_point_~len~0);call write~$Pointer$(0, 0, entry_point_~array~0.base, entry_point_~array~0.offset + 4 * entry_point_~i~2, 4); 1487#L790-2 entry_point_#t~post46 := entry_point_~i~2;entry_point_~i~2 := 1 + entry_point_#t~post46;havoc entry_point_#t~post46; 1488#L790-3 assume !!(entry_point_~i~2 < entry_point_~len~0);call write~$Pointer$(0, 0, entry_point_~array~0.base, entry_point_~array~0.offset + 4 * entry_point_~i~2, 4); 1493#L790-2 entry_point_#t~post46 := entry_point_~i~2;entry_point_~i~2 := 1 + entry_point_#t~post46;havoc entry_point_#t~post46; 1497#L790-3 assume !(entry_point_~i~2 < entry_point_~len~0); 1494#L790-4 alloc_17_#in~array.base, alloc_17_#in~array.offset, alloc_17_#in~len := entry_point_~array~0.base, entry_point_~array~0.offset, entry_point_~len~0;havoc alloc_17_#res;havoc alloc_17_#t~ret39.base, alloc_17_#t~ret39.offset, alloc_17_#t~post38, alloc_17_#t~mem41.base, alloc_17_#t~mem41.offset, alloc_17_#t~post40, alloc_17_~array.base, alloc_17_~array.offset, alloc_17_~len, alloc_17_~p~0.base, alloc_17_~p~0.offset, alloc_17_~i~0, alloc_17_~j~0;alloc_17_~array.base, alloc_17_~array.offset := alloc_17_#in~array.base, alloc_17_#in~array.offset;alloc_17_~len := alloc_17_#in~len;havoc alloc_17_~p~0.base, alloc_17_~p~0.offset;alloc_17_~i~0 := 0;havoc alloc_17_~j~0; 1495#L765-3 assume !!(alloc_17_~i~0 < alloc_17_~len);ldv_malloc_#in~size := 4;havoc ldv_malloc_#res.base, ldv_malloc_#res.offset;havoc ldv_malloc_#t~nondet11, ldv_malloc_#t~malloc12.base, ldv_malloc_#t~malloc12.offset, ldv_malloc_~size;ldv_malloc_~size := ldv_malloc_#in~size; 1475#L526-1 assume 0 != ldv_malloc_#t~nondet11;havoc ldv_malloc_#t~nondet11;call ldv_malloc_#t~malloc12.base, ldv_malloc_#t~malloc12.offset := #Ultimate.allocOnHeap(ldv_malloc_~size);ldv_malloc_#res.base, ldv_malloc_#res.offset := ldv_malloc_#t~malloc12.base, ldv_malloc_#t~malloc12.offset; 1476#L529-1 alloc_17_#t~ret39.base, alloc_17_#t~ret39.offset := ldv_malloc_#res.base, ldv_malloc_#res.offset;alloc_17_~p~0.base, alloc_17_~p~0.offset := alloc_17_#t~ret39.base, alloc_17_#t~ret39.offset;havoc alloc_17_#t~ret39.base, alloc_17_#t~ret39.offset; 1483#L767 assume !(alloc_17_~p~0.base == 0 && alloc_17_~p~0.offset == 0);call write~$Pointer$(alloc_17_~p~0.base, alloc_17_~p~0.offset, alloc_17_~array.base, alloc_17_~array.offset + 4 * alloc_17_~i~0, 4); 1484#L765-2 alloc_17_#t~post38 := alloc_17_~i~0;alloc_17_~i~0 := 1 + alloc_17_#t~post38;havoc alloc_17_#t~post38; 1496#L765-3 assume !!(alloc_17_~i~0 < alloc_17_~len);ldv_malloc_#in~size := 4;havoc ldv_malloc_#res.base, ldv_malloc_#res.offset;havoc ldv_malloc_#t~nondet11, ldv_malloc_#t~malloc12.base, ldv_malloc_#t~malloc12.offset, ldv_malloc_~size;ldv_malloc_~size := ldv_malloc_#in~size; 1473#L526-1 assume !(0 != ldv_malloc_#t~nondet11);havoc ldv_malloc_#t~nondet11;ldv_malloc_#res.base, ldv_malloc_#res.offset := 0, 0; 1474#L529-1 alloc_17_#t~ret39.base, alloc_17_#t~ret39.offset := ldv_malloc_#res.base, ldv_malloc_#res.offset;alloc_17_~p~0.base, alloc_17_~p~0.offset := alloc_17_#t~ret39.base, alloc_17_#t~ret39.offset;havoc alloc_17_#t~ret39.base, alloc_17_#t~ret39.offset; 1481#L767 assume alloc_17_~p~0.base == 0 && alloc_17_~p~0.offset == 0; 1482#L767-1 alloc_17_~j~0 := alloc_17_~i~0 - 1; 1478#L772-3 [2020-10-19 20:27:15,577 INFO L796 eck$LassoCheckResult]: Loop: 1478#L772-3 assume !!(alloc_17_~j~0 >= 0);call alloc_17_#t~mem41.base, alloc_17_#t~mem41.offset := read~$Pointer$(alloc_17_~array.base, alloc_17_~array.offset + 4 * alloc_17_~j~0, 4);call ULTIMATE.dealloc(alloc_17_#t~mem41.base, alloc_17_#t~mem41.offset);havoc alloc_17_#t~mem41.base, alloc_17_#t~mem41.offset;call write~$Pointer$(0, 0, alloc_17_~array.base, alloc_17_~array.offset + 4 * alloc_17_~j~0, 4); 1477#L772-2 alloc_17_#t~post40 := alloc_17_~j~0;alloc_17_~j~0 := alloc_17_#t~post40 - 1;havoc alloc_17_#t~post40; 1478#L772-3 [2020-10-19 20:27:15,577 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-19 20:27:15,577 INFO L82 PathProgramCache]: Analyzing trace with hash 1196968511, now seen corresponding path program 2 times [2020-10-19 20:27:15,578 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-19 20:27:15,578 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [412473640] [2020-10-19 20:27:15,578 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-19 20:27:15,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-19 20:27:15,593 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-19 20:27:15,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-19 20:27:15,607 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-19 20:27:15,613 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-19 20:27:15,613 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-19 20:27:15,614 INFO L82 PathProgramCache]: Analyzing trace with hash 3395, now seen corresponding path program 5 times [2020-10-19 20:27:15,614 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-19 20:27:15,614 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [644427027] [2020-10-19 20:27:15,614 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-19 20:27:15,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-19 20:27:15,619 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-19 20:27:15,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-19 20:27:15,622 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-19 20:27:15,623 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-19 20:27:15,624 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-19 20:27:15,624 INFO L82 PathProgramCache]: Analyzing trace with hash -764493823, now seen corresponding path program 1 times [2020-10-19 20:27:15,624 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-19 20:27:15,624 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [32632520] [2020-10-19 20:27:15,625 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-19 20:27:15,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-19 20:27:15,651 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-19 20:27:15,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-19 20:27:15,694 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-19 20:27:15,704 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-19 20:27:18,661 WARN L193 SmtUtils]: Spent 2.85 s on a formula simplification. DAG size of input: 249 DAG size of output: 213 [2020-10-19 20:27:18,744 INFO L545 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-10-19 20:27:19,071 WARN L193 SmtUtils]: Spent 326.00 ms on a formula simplification that was a NOOP. DAG size: 141 [2020-10-19 20:27:19,072 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-19 20:27:19,079 INFO L545 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-10-19 20:27:19,357 WARN L193 SmtUtils]: Spent 277.00 ms on a formula simplification that was a NOOP. DAG size: 137 [2020-10-19 20:27:19,357 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-19 20:27:19,360 INFO L545 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2020-10-19 20:27:19,361 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:336, output treesize:328 [2020-10-19 20:27:19,634 WARN L193 SmtUtils]: Spent 270.00 ms on a formula simplification that was a NOOP. DAG size: 137 [2020-10-19 20:27:19,637 INFO L210 LassoAnalysis]: Preferences: [2020-10-19 20:27:19,637 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2020-10-19 20:27:19,637 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-10-19 20:27:19,637 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2020-10-19 20:27:19,637 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2020-10-19 20:27:19,637 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-19 20:27:19,637 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2020-10-19 20:27:19,637 INFO L132 ssoRankerPreferences]: Path of dumped script: [2020-10-19 20:27:19,637 INFO L133 ssoRankerPreferences]: Filename of dumped script: memleaks_test17_2-2.i_Iteration13_Lasso [2020-10-19 20:27:19,637 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2020-10-19 20:27:19,638 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2020-10-19 20:27:19,642 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-19 20:27:19,653 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-19 20:27:19,655 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-19 20:27:19,657 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-19 20:27:19,660 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-19 20:27:19,661 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-19 20:27:19,663 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-19 20:27:19,668 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-19 20:27:19,670 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-19 20:27:19,672 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-19 20:27:19,673 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-19 20:27:19,678 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-19 20:27:19,679 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-19 20:27:19,691 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-19 20:27:19,692 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-19 20:27:19,694 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-19 20:27:19,696 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-19 20:27:19,698 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-19 20:27:19,701 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-19 20:27:19,703 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-19 20:27:19,705 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-19 20:27:19,707 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-19 20:27:20,070 WARN L193 SmtUtils]: Spent 240.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 82 [2020-10-19 20:27:20,177 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-19 20:27:20,179 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-19 20:27:20,181 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-19 20:27:20,183 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-19 20:27:20,186 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-19 20:27:20,188 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-19 20:27:20,433 WARN L193 SmtUtils]: Spent 152.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 53 [2020-10-19 20:27:21,126 WARN L193 SmtUtils]: Spent 315.00 ms on a formula simplification. DAG size of input: 34 DAG size of output: 34 [2020-10-19 20:27:21,174 INFO L292 LassoAnalysis]: Preprocessing complete. [2020-10-19 20:27:21,175 INFO L489 LassoAnalysis]: Using template 'affine'. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 43 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 43 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-19 20:27:21,179 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-10-19 20:27:21,180 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-19 20:27:21,180 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-19 20:27:21,180 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-19 20:27:21,180 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-19 20:27:21,181 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-19 20:27:21,181 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-19 20:27:21,181 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-19 20:27:21,182 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 44 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-10-19 20:27:21,205 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false Waiting until toolchain timeout for monitored process 44 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-19 20:27:21,207 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-19 20:27:21,207 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-19 20:27:21,207 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-19 20:27:21,207 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-19 20:27:21,208 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-19 20:27:21,208 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-10-19 20:27:21,212 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 45 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 45 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-19 20:27:21,235 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-10-19 20:27:21,236 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-19 20:27:21,236 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-19 20:27:21,236 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-19 20:27:21,236 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-19 20:27:21,237 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-19 20:27:21,237 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-10-19 20:27:21,240 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 46 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-10-19 20:27:21,263 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false Waiting until toolchain timeout for monitored process 46 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-19 20:27:21,265 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-19 20:27:21,265 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-19 20:27:21,265 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-19 20:27:21,265 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-19 20:27:21,266 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-19 20:27:21,266 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-10-19 20:27:21,268 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 47 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 47 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-19 20:27:21,292 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-10-19 20:27:21,293 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-19 20:27:21,293 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-19 20:27:21,293 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-19 20:27:21,293 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-19 20:27:21,293 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-19 20:27:21,294 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-19 20:27:21,294 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-19 20:27:21,295 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 48 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 48 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-19 20:27:21,319 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-10-19 20:27:21,321 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-19 20:27:21,321 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-19 20:27:21,321 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-19 20:27:21,321 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-19 20:27:21,321 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-19 20:27:21,321 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-19 20:27:21,322 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-19 20:27:21,323 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 49 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 49 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-19 20:27:21,349 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-10-19 20:27:21,350 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-19 20:27:21,350 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-19 20:27:21,350 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-19 20:27:21,350 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-19 20:27:21,352 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-19 20:27:21,352 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-10-19 20:27:21,361 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 50 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 50 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-19 20:27:21,386 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-10-19 20:27:21,387 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-19 20:27:21,387 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-19 20:27:21,388 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-19 20:27:21,388 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-19 20:27:21,389 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-19 20:27:21,389 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-10-19 20:27:21,391 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 51 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 51 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-19 20:27:21,416 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-10-19 20:27:21,418 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-19 20:27:21,418 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-19 20:27:21,418 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-19 20:27:21,418 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-19 20:27:21,419 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-19 20:27:21,419 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-10-19 20:27:21,423 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 52 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 52 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-19 20:27:21,446 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-10-19 20:27:21,447 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-19 20:27:21,447 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-19 20:27:21,447 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-19 20:27:21,448 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-19 20:27:21,448 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-19 20:27:21,448 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-19 20:27:21,448 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-19 20:27:21,449 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 53 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 53 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-19 20:27:21,471 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-10-19 20:27:21,472 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-19 20:27:21,472 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-19 20:27:21,472 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-19 20:27:21,472 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-19 20:27:21,473 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-19 20:27:21,473 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-10-19 20:27:21,476 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 54 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-10-19 20:27:21,499 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-10-19 20:27:21,500 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-19 20:27:21,500 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-19 20:27:21,501 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-19 20:27:21,501 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-19 20:27:21,501 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-19 20:27:21,503 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-19 20:27:21,503 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 54 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-19 20:27:21,508 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 55 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 55 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-19 20:27:21,529 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-10-19 20:27:21,531 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-19 20:27:21,531 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-19 20:27:21,531 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-19 20:27:21,531 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-19 20:27:21,532 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-19 20:27:21,532 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-10-19 20:27:21,535 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 56 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 56 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-19 20:27:21,561 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-10-19 20:27:21,562 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-19 20:27:21,562 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-19 20:27:21,562 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-19 20:27:21,562 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-19 20:27:21,562 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-19 20:27:21,562 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-19 20:27:21,563 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-19 20:27:21,564 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 57 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 57 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-19 20:27:21,587 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-10-19 20:27:21,588 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-19 20:27:21,589 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-19 20:27:21,589 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-19 20:27:21,589 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-19 20:27:21,589 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-19 20:27:21,589 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-19 20:27:21,589 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-19 20:27:21,590 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 58 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 58 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-19 20:27:21,615 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-10-19 20:27:21,616 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-19 20:27:21,616 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-19 20:27:21,616 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-19 20:27:21,617 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-19 20:27:21,617 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-19 20:27:21,617 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-19 20:27:21,618 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-19 20:27:21,619 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 59 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 59 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-19 20:27:21,642 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-10-19 20:27:21,643 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-19 20:27:21,643 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-19 20:27:21,643 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-19 20:27:21,643 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-19 20:27:21,644 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-19 20:27:21,644 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-19 20:27:21,644 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-19 20:27:21,645 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 60 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 60 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-19 20:27:21,668 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-10-19 20:27:21,669 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-19 20:27:21,670 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-19 20:27:21,670 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-19 20:27:21,670 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-19 20:27:21,671 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-19 20:27:21,671 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-10-19 20:27:21,674 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 61 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 61 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-19 20:27:21,698 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-10-19 20:27:21,699 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-19 20:27:21,699 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-19 20:27:21,699 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-19 20:27:21,700 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-19 20:27:21,700 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-19 20:27:21,700 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-19 20:27:21,700 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-19 20:27:21,701 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 62 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 62 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-19 20:27:21,724 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-10-19 20:27:21,726 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-19 20:27:21,726 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-19 20:27:21,726 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-19 20:27:21,726 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-19 20:27:21,726 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-19 20:27:21,726 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-19 20:27:21,726 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-19 20:27:21,727 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 63 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-10-19 20:27:21,749 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false Waiting until toolchain timeout for monitored process 63 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-19 20:27:21,750 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-19 20:27:21,750 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-19 20:27:21,750 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-19 20:27:21,750 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-19 20:27:21,750 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-19 20:27:21,751 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-19 20:27:21,751 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-19 20:27:21,752 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 64 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 64 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-19 20:27:21,774 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-10-19 20:27:21,776 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-19 20:27:21,776 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-19 20:27:21,776 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-19 20:27:21,776 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-19 20:27:21,777 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-19 20:27:21,777 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-10-19 20:27:21,780 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 65 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 65 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-19 20:27:21,803 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-10-19 20:27:21,804 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-19 20:27:21,804 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-19 20:27:21,804 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-19 20:27:21,804 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-19 20:27:21,805 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-19 20:27:21,805 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-19 20:27:21,805 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-19 20:27:21,806 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 66 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-10-19 20:27:21,829 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false Waiting until toolchain timeout for monitored process 66 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-19 20:27:21,830 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-19 20:27:21,830 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-19 20:27:21,830 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-19 20:27:21,830 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-19 20:27:21,830 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-19 20:27:21,831 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-19 20:27:21,831 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-19 20:27:21,833 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 67 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 67 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-19 20:27:21,854 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-10-19 20:27:21,856 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-19 20:27:21,856 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-19 20:27:21,856 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-19 20:27:21,856 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-19 20:27:21,863 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-19 20:27:21,863 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-10-19 20:27:21,882 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2020-10-19 20:27:21,941 INFO L443 ModelExtractionUtils]: Simplification made 25 calls to the SMT solver. [2020-10-19 20:27:21,942 INFO L444 ModelExtractionUtils]: 10 out of 46 variables were initially zero. Simplification set additionally 33 variables to zero. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 68 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 68 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-19 20:27:21,945 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2020-10-19 20:27:21,947 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2020-10-19 20:27:21,947 INFO L510 LassoAnalysis]: Proved termination. [2020-10-19 20:27:21,947 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_alloc_17_~j~0, v_rep(select #length ULTIMATE.start_entry_point_~array~0.base)_4) = 8*ULTIMATE.start_alloc_17_~j~0 + 1*v_rep(select #length ULTIMATE.start_entry_point_~array~0.base)_4 Supporting invariants [] [2020-10-19 20:27:21,997 INFO L297 tatePredicateManager]: 8 out of 9 supporting invariants were superfluous and have been removed [2020-10-19 20:27:21,999 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-10-19 20:27:22,023 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-19 20:27:22,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-19 20:27:22,052 INFO L263 TraceCheckSpWp]: Trace formula consists of 143 conjuncts, 6 conjunts are in the unsatisfiable core [2020-10-19 20:27:22,053 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-19 20:27:22,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-19 20:27:22,062 INFO L263 TraceCheckSpWp]: Trace formula consists of 17 conjuncts, 8 conjunts are in the unsatisfiable core [2020-10-19 20:27:22,063 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-19 20:27:22,081 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-19 20:27:22,081 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.2 stem predicates 2 loop predicates [2020-10-19 20:27:22,081 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 27 states and 30 transitions. cyclomatic complexity: 6 Second operand 4 states. [2020-10-19 20:27:22,126 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 27 states and 30 transitions. cyclomatic complexity: 6. Second operand 4 states. Result 29 states and 33 transitions. Complement of second has 5 states. [2020-10-19 20:27:22,126 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 2 stem states 1 non-accepting loop states 1 accepting loop states [2020-10-19 20:27:22,126 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2020-10-19 20:27:22,127 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 23 transitions. [2020-10-19 20:27:22,127 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 23 transitions. Stem has 25 letters. Loop has 2 letters. [2020-10-19 20:27:22,127 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-10-19 20:27:22,127 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 23 transitions. Stem has 27 letters. Loop has 2 letters. [2020-10-19 20:27:22,128 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-10-19 20:27:22,128 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 23 transitions. Stem has 25 letters. Loop has 4 letters. [2020-10-19 20:27:22,131 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-10-19 20:27:22,132 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 29 states and 33 transitions. [2020-10-19 20:27:22,132 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2020-10-19 20:27:22,132 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 29 states to 0 states and 0 transitions. [2020-10-19 20:27:22,132 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2020-10-19 20:27:22,132 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2020-10-19 20:27:22,133 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2020-10-19 20:27:22,133 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-19 20:27:22,133 INFO L691 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-10-19 20:27:22,133 INFO L714 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-10-19 20:27:22,133 INFO L594 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-10-19 20:27:22,135 INFO L427 BuchiCegarLoop]: ======== Iteration 14============ [2020-10-19 20:27:22,135 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2020-10-19 20:27:22,135 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2020-10-19 20:27:22,135 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2020-10-19 20:27:22,146 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 19.10 08:27:22 BoogieIcfgContainer [2020-10-19 20:27:22,147 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2020-10-19 20:27:22,147 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2020-10-19 20:27:22,147 INFO L271 PluginConnector]: Initializing Witness Printer... [2020-10-19 20:27:22,147 INFO L275 PluginConnector]: Witness Printer initialized [2020-10-19 20:27:22,150 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.10 08:27:03" (3/4) ... [2020-10-19 20:27:22,154 INFO L140 WitnessPrinter]: No result that supports witness generation found [2020-10-19 20:27:22,155 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2020-10-19 20:27:22,158 INFO L168 Benchmark]: Toolchain (without parser) took 19653.50 ms. Allocated memory was 1.0 GB in the beginning and 1.4 GB in the end (delta: 412.6 MB). Free memory was 954.6 MB in the beginning and 1.2 GB in the end (delta: -207.4 MB). Peak memory consumption was 205.2 MB. Max. memory is 11.5 GB. [2020-10-19 20:27:22,158 INFO L168 Benchmark]: CDTParser took 0.19 ms. Allocated memory is still 1.0 GB. Free memory is still 985.5 MB. There was no memory consumed. Max. memory is 11.5 GB. [2020-10-19 20:27:22,159 INFO L168 Benchmark]: CACSL2BoogieTranslator took 811.95 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 134.2 MB). Free memory was 954.6 MB in the beginning and 1.1 GB in the end (delta: -147.5 MB). Peak memory consumption was 22.0 MB. Max. memory is 11.5 GB. [2020-10-19 20:27:22,159 INFO L168 Benchmark]: Boogie Procedure Inliner took 68.25 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.6 MB). Peak memory consumption was 6.6 MB. Max. memory is 11.5 GB. [2020-10-19 20:27:22,159 INFO L168 Benchmark]: Boogie Preprocessor took 31.79 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2020-10-19 20:27:22,160 INFO L168 Benchmark]: RCFGBuilder took 484.96 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 25.2 MB). Peak memory consumption was 25.2 MB. Max. memory is 11.5 GB. [2020-10-19 20:27:22,160 INFO L168 Benchmark]: BuchiAutomizer took 18238.25 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 278.4 MB). Free memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: -91.7 MB). Peak memory consumption was 186.7 MB. Max. memory is 11.5 GB. [2020-10-19 20:27:22,161 INFO L168 Benchmark]: Witness Printer took 7.63 ms. Allocated memory is still 1.4 GB. Free memory is still 1.2 GB. There was no memory consumed. Max. memory is 11.5 GB. [2020-10-19 20:27:22,163 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.19 ms. Allocated memory is still 1.0 GB. Free memory is still 985.5 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 811.95 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 134.2 MB). Free memory was 954.6 MB in the beginning and 1.1 GB in the end (delta: -147.5 MB). Peak memory consumption was 22.0 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 68.25 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.6 MB). Peak memory consumption was 6.6 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 31.79 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 484.96 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 25.2 MB). Peak memory consumption was 25.2 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 18238.25 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 278.4 MB). Free memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: -91.7 MB). Peak memory consumption was 186.7 MB. Max. memory is 11.5 GB. * Witness Printer took 7.63 ms. Allocated memory is still 1.4 GB. Free memory is still 1.2 GB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 13 terminating modules (9 trivial, 4 deterministic, 0 nondeterministic). One deterministic module has affine ranking function unknown-#length-unknown[array] + -1 * array + -4 * i and consists of 4 locations. One deterministic module has affine ranking function -1 * i + len and consists of 4 locations. One deterministic module has affine ranking function -1 * i + len and consists of 3 locations. One deterministic module has affine ranking function 8 * j + unknown-#length-unknown[array] and consists of 4 locations. 9 modules have a trivial ranking function, the largest among these consists of 10 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 18.1s and 14 iterations. TraceHistogramMax:2. Analysis of lassos took 16.8s. Construction of modules took 0.3s. Büchi inclusion checks took 0.7s. Highest rank in rank-based complementation 3. Minimization of det autom 5. Minimization of nondet autom 8. Automata minimization 0.0s AutomataMinimizationTime, 12 MinimizatonAttempts, 125 StatesRemovedByMinimization, 10 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 41 states and ocurred in iteration 6. Nontrivial modules had stage [4, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 396 SDtfs, 469 SDslu, 564 SDs, 0 SdLazy, 291 SolverSat, 31 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.3s Time LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT0 conc1 concLT0 SILN0 SILU8 SILI0 SILT0 lasso4 LassoPreprocessingBenchmarks: Lassos: inital316 mio100 ax110 hnf100 lsp83 ukn60 mio100 lsp57 div100 bol100 ite100 ukn100 eq189 hnf90 smp94 dnf104 smp97 tf100 neg98 sie106 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 60ms VariablesStem: 7 VariablesLoop: 6 DisjunctsStem: 2 DisjunctsLoop: 2 SupportingInvariants: 4 MotzkinApplications: 20 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 0 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 0 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.0s - TerminationAnalysisResult: Termination proven Buchi Automizer proved that your program is terminating RESULT: Ultimate proved your program to be correct! Received shutdown request...