./Ultimate.py --spec ../sv-benchmarks/c/properties/termination.prp --file ../sv-benchmarks/c/ldv-memsafety/memleaks_test17_2-2.i --full-output -ea --architecture 32bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 8bd4bc60 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx12G -Xms1G -ea -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-8bd4bc6 [2020-07-29 03:27:14,761 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-07-29 03:27:14,763 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-07-29 03:27:14,781 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-07-29 03:27:14,782 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-07-29 03:27:14,784 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-07-29 03:27:14,786 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-07-29 03:27:14,796 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-07-29 03:27:14,801 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-07-29 03:27:14,805 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-07-29 03:27:14,807 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-07-29 03:27:14,809 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-07-29 03:27:14,809 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-07-29 03:27:14,812 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-07-29 03:27:14,813 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-07-29 03:27:14,814 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-07-29 03:27:14,816 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-07-29 03:27:14,817 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-07-29 03:27:14,819 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-07-29 03:27:14,823 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-07-29 03:27:14,828 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-07-29 03:27:14,832 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-07-29 03:27:14,834 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-07-29 03:27:14,835 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-07-29 03:27:14,838 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-07-29 03:27:14,838 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-07-29 03:27:14,838 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-07-29 03:27:14,840 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-07-29 03:27:14,841 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-07-29 03:27:14,842 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-07-29 03:27:14,842 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-07-29 03:27:14,843 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-07-29 03:27:14,844 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-07-29 03:27:14,845 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-07-29 03:27:14,846 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-07-29 03:27:14,847 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-07-29 03:27:14,847 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-07-29 03:27:14,848 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-07-29 03:27:14,848 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-07-29 03:27:14,849 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-07-29 03:27:14,851 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-07-29 03:27:14,852 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-32bit-Automizer_Default.epf [2020-07-29 03:27:14,884 INFO L113 SettingsManager]: Loading preferences was successful [2020-07-29 03:27:14,885 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-07-29 03:27:14,887 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-07-29 03:27:14,887 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-07-29 03:27:14,887 INFO L138 SettingsManager]: * Use SBE=true [2020-07-29 03:27:14,888 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2020-07-29 03:27:14,888 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2020-07-29 03:27:14,888 INFO L138 SettingsManager]: * Use old map elimination=false [2020-07-29 03:27:14,889 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2020-07-29 03:27:14,889 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2020-07-29 03:27:14,890 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2020-07-29 03:27:14,891 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-07-29 03:27:14,891 INFO L138 SettingsManager]: * sizeof long=4 [2020-07-29 03:27:14,891 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2020-07-29 03:27:14,892 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-07-29 03:27:14,892 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-07-29 03:27:14,892 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-07-29 03:27:14,892 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2020-07-29 03:27:14,893 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2020-07-29 03:27:14,893 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2020-07-29 03:27:14,893 INFO L138 SettingsManager]: * sizeof long double=12 [2020-07-29 03:27:14,894 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-07-29 03:27:14,894 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2020-07-29 03:27:14,894 INFO L138 SettingsManager]: * Use constant arrays=true [2020-07-29 03:27:14,894 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2020-07-29 03:27:14,895 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-07-29 03:27:14,895 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-07-29 03:27:14,895 INFO L138 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2020-07-29 03:27:14,896 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-07-29 03:27:14,896 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-07-29 03:27:14,896 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-07-29 03:27:14,897 INFO L138 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2020-07-29 03:27:14,899 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2020-07-29 03:27:14,899 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-07-29 03:27:15,255 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-07-29 03:27:15,277 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-07-29 03:27:15,280 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-07-29 03:27:15,282 INFO L271 PluginConnector]: Initializing CDTParser... [2020-07-29 03:27:15,282 INFO L275 PluginConnector]: CDTParser initialized [2020-07-29 03:27:15,283 INFO L429 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-07-29 03:27:15,359 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e67258480/f4ce0bfdf6ef4c56951e1ffeaa85b85d/FLAGdbdda7e68 [2020-07-29 03:27:15,920 INFO L306 CDTParser]: Found 1 translation units. [2020-07-29 03:27:15,920 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-memsafety/memleaks_test17_2-2.i [2020-07-29 03:27:15,940 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e67258480/f4ce0bfdf6ef4c56951e1ffeaa85b85d/FLAGdbdda7e68 [2020-07-29 03:27:16,262 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e67258480/f4ce0bfdf6ef4c56951e1ffeaa85b85d [2020-07-29 03:27:16,265 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-07-29 03:27:16,268 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2020-07-29 03:27:16,269 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-07-29 03:27:16,269 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-07-29 03:27:16,274 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-07-29 03:27:16,276 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.07 03:27:16" (1/1) ... [2020-07-29 03:27:16,279 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@552c473f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 03:27:16, skipping insertion in model container [2020-07-29 03:27:16,279 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.07 03:27:16" (1/1) ... [2020-07-29 03:27:16,287 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-07-29 03:27:16,346 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-07-29 03:27:16,783 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-29 03:27:16,807 INFO L203 MainTranslator]: Completed pre-run [2020-07-29 03:27:16,890 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-29 03:27:16,997 INFO L208 MainTranslator]: Completed translation [2020-07-29 03:27:16,998 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 03:27:16 WrapperNode [2020-07-29 03:27:16,999 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-07-29 03:27:17,001 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-07-29 03:27:17,002 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-07-29 03:27:17,002 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-07-29 03:27:17,012 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 03:27:16" (1/1) ... [2020-07-29 03:27:17,043 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 03:27:16" (1/1) ... [2020-07-29 03:27:17,076 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-07-29 03:27:17,076 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-07-29 03:27:17,076 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-07-29 03:27:17,077 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-07-29 03:27:17,087 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 03:27:16" (1/1) ... [2020-07-29 03:27:17,087 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 03:27:16" (1/1) ... [2020-07-29 03:27:17,091 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 03:27:16" (1/1) ... [2020-07-29 03:27:17,091 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 03:27:16" (1/1) ... [2020-07-29 03:27:17,110 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 03:27:16" (1/1) ... [2020-07-29 03:27:17,123 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 03:27:16" (1/1) ... [2020-07-29 03:27:17,125 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 03:27:16" (1/1) ... [2020-07-29 03:27:17,129 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-07-29 03:27:17,129 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-07-29 03:27:17,129 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-07-29 03:27:17,130 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-07-29 03:27:17,131 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 03:27:16" (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-07-29 03:27:17,204 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2020-07-29 03:27:17,204 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2020-07-29 03:27:17,205 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-07-29 03:27:17,205 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2020-07-29 03:27:17,205 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-07-29 03:27:17,206 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2020-07-29 03:27:17,206 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-07-29 03:27:17,207 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-07-29 03:27:17,711 INFO L290 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-07-29 03:27:17,711 INFO L295 CfgBuilder]: Removed 20 assume(true) statements. [2020-07-29 03:27:17,715 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.07 03:27:17 BoogieIcfgContainer [2020-07-29 03:27:17,715 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-07-29 03:27:17,716 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2020-07-29 03:27:17,716 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2020-07-29 03:27:17,719 INFO L275 PluginConnector]: BuchiAutomizer initialized [2020-07-29 03:27:17,721 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-07-29 03:27:17,722 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 29.07 03:27:16" (1/3) ... [2020-07-29 03:27:17,723 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@3eb302b6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 29.07 03:27:17, skipping insertion in model container [2020-07-29 03:27:17,724 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-07-29 03:27:17,724 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 03:27:16" (2/3) ... [2020-07-29 03:27:17,725 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@3eb302b6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 29.07 03:27:17, skipping insertion in model container [2020-07-29 03:27:17,725 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-07-29 03:27:17,725 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.07 03:27:17" (3/3) ... [2020-07-29 03:27:17,727 INFO L371 chiAutomizerObserver]: Analyzing ICFG memleaks_test17_2-2.i [2020-07-29 03:27:17,788 INFO L356 BuchiCegarLoop]: Interprodecural is true [2020-07-29 03:27:17,789 INFO L357 BuchiCegarLoop]: Hoare is false [2020-07-29 03:27:17,789 INFO L358 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2020-07-29 03:27:17,789 INFO L359 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2020-07-29 03:27:17,789 INFO L360 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-07-29 03:27:17,789 INFO L361 BuchiCegarLoop]: Difference is false [2020-07-29 03:27:17,789 INFO L362 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-07-29 03:27:17,790 INFO L365 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2020-07-29 03:27:17,808 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 28 states. [2020-07-29 03:27:17,842 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 11 [2020-07-29 03:27:17,842 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 03:27:17,842 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 03:27:17,849 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-29 03:27:17,849 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2020-07-29 03:27:17,849 INFO L424 BuchiCegarLoop]: ======== Iteration 1============ [2020-07-29 03:27:17,850 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 28 states. [2020-07-29 03:27:17,855 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 11 [2020-07-29 03:27:17,855 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 03:27:17,855 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 03:27:17,856 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-29 03:27:17,856 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2020-07-29 03:27:17,862 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-07-29 03:27:17,862 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-07-29 03:27:17,868 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 03:27:17,868 INFO L82 PathProgramCache]: Analyzing trace with hash 1182787569, now seen corresponding path program 1 times [2020-07-29 03:27:17,879 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 03:27:17,879 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [581654241] [2020-07-29 03:27:17,879 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 03:27:17,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 03:27:18,110 INFO L280 TraceCheckUtils]: 0: Hoare triple {32#true} #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); {32#true} is VALID [2020-07-29 03:27:18,110 INFO L280 TraceCheckUtils]: 1: Hoare triple {32#true} 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; {32#true} is VALID [2020-07-29 03:27:18,111 INFO L280 TraceCheckUtils]: 2: Hoare triple {32#true} assume !(ldv_positive_~r~1 > 0);ldv_positive_#res := 1; {32#true} is VALID [2020-07-29 03:27:18,111 INFO L280 TraceCheckUtils]: 3: Hoare triple {32#true} entry_point_#t~ret44 := ldv_positive_#res;entry_point_~len~0 := entry_point_#t~ret44;havoc entry_point_#t~ret44; {32#true} is VALID [2020-07-29 03:27:18,111 INFO L280 TraceCheckUtils]: 4: Hoare triple {32#true} assume !!(entry_point_~len~0 < 16777216); {32#true} is VALID [2020-07-29 03:27:18,112 INFO L280 TraceCheckUtils]: 5: Hoare triple {32#true} 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; {32#true} is VALID [2020-07-29 03:27:18,113 INFO L280 TraceCheckUtils]: 6: Hoare triple {32#true} assume !(0 != ldv_malloc_#t~nondet11);havoc ldv_malloc_#t~nondet11;ldv_malloc_#res.base, ldv_malloc_#res.offset := 0, 0; {34#(and (= 0 |ULTIMATE.start_ldv_malloc_#res.base|) (= 0 |ULTIMATE.start_ldv_malloc_#res.offset|))} is VALID [2020-07-29 03:27:18,115 INFO L280 TraceCheckUtils]: 7: Hoare triple {34#(and (= 0 |ULTIMATE.start_ldv_malloc_#res.base|) (= 0 |ULTIMATE.start_ldv_malloc_#res.offset|))} 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; {35#(and (= ULTIMATE.start_entry_point_~array~0.base 0) (= 0 ULTIMATE.start_entry_point_~array~0.offset))} is VALID [2020-07-29 03:27:18,116 INFO L280 TraceCheckUtils]: 8: Hoare triple {35#(and (= ULTIMATE.start_entry_point_~array~0.base 0) (= 0 ULTIMATE.start_entry_point_~array~0.offset))} assume entry_point_~array~0.base != 0 || entry_point_~array~0.offset != 0;entry_point_~i~2 := 0; {33#false} is VALID [2020-07-29 03:27:18,119 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-29 03:27:18,120 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [581654241] [2020-07-29 03:27:18,121 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-29 03:27:18,121 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-07-29 03:27:18,122 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [606108813] [2020-07-29 03:27:18,128 INFO L799 eck$LassoCheckResult]: stem already infeasible [2020-07-29 03:27:18,129 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 03:27:18,129 INFO L82 PathProgramCache]: Analyzing trace with hash 2051, now seen corresponding path program 1 times [2020-07-29 03:27:18,129 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 03:27:18,130 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2075458751] [2020-07-29 03:27:18,130 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 03:27:18,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 03:27:18,144 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 03:27:18,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 03:27:18,153 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 03:27:18,174 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 03:27:18,270 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-29 03:27:18,284 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-07-29 03:27:18,285 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-07-29 03:27:18,288 INFO L87 Difference]: Start difference. First operand 28 states. Second operand 4 states. [2020-07-29 03:27:18,540 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 03:27:18,541 INFO L93 Difference]: Finished difference Result 49 states and 58 transitions. [2020-07-29 03:27:18,541 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-07-29 03:27:18,542 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states. [2020-07-29 03:27:18,560 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 9 edges. 9 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-29 03:27:18,563 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 49 states and 58 transitions. [2020-07-29 03:27:18,570 INFO L131 ngComponentsAnalysis]: Automaton has 6 accepting balls. 19 [2020-07-29 03:27:18,577 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 49 states to 37 states and 46 transitions. [2020-07-29 03:27:18,579 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 37 [2020-07-29 03:27:18,579 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 37 [2020-07-29 03:27:18,580 INFO L73 IsDeterministic]: Start isDeterministic. Operand 37 states and 46 transitions. [2020-07-29 03:27:18,581 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-07-29 03:27:18,581 INFO L688 BuchiCegarLoop]: Abstraction has 37 states and 46 transitions. [2020-07-29 03:27:18,601 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states and 46 transitions. [2020-07-29 03:27:18,612 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 25. [2020-07-29 03:27:18,613 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-29 03:27:18,613 INFO L82 GeneralOperation]: Start isEquivalent. First operand 37 states and 46 transitions. Second operand 25 states. [2020-07-29 03:27:18,614 INFO L74 IsIncluded]: Start isIncluded. First operand 37 states and 46 transitions. Second operand 25 states. [2020-07-29 03:27:18,616 INFO L87 Difference]: Start difference. First operand 37 states and 46 transitions. Second operand 25 states. [2020-07-29 03:27:18,620 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 03:27:18,620 INFO L93 Difference]: Finished difference Result 37 states and 46 transitions. [2020-07-29 03:27:18,621 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 46 transitions. [2020-07-29 03:27:18,622 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 03:27:18,622 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 03:27:18,623 INFO L74 IsIncluded]: Start isIncluded. First operand 25 states. Second operand 37 states and 46 transitions. [2020-07-29 03:27:18,623 INFO L87 Difference]: Start difference. First operand 25 states. Second operand 37 states and 46 transitions. [2020-07-29 03:27:18,626 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 03:27:18,627 INFO L93 Difference]: Finished difference Result 37 states and 46 transitions. [2020-07-29 03:27:18,627 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 46 transitions. [2020-07-29 03:27:18,627 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 03:27:18,628 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 03:27:18,628 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-29 03:27:18,628 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-29 03:27:18,629 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2020-07-29 03:27:18,631 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 31 transitions. [2020-07-29 03:27:18,633 INFO L711 BuchiCegarLoop]: Abstraction has 25 states and 31 transitions. [2020-07-29 03:27:18,633 INFO L591 BuchiCegarLoop]: Abstraction has 25 states and 31 transitions. [2020-07-29 03:27:18,633 INFO L424 BuchiCegarLoop]: ======== Iteration 2============ [2020-07-29 03:27:18,633 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 25 states and 31 transitions. [2020-07-29 03:27:18,635 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 11 [2020-07-29 03:27:18,635 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 03:27:18,635 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 03:27:18,636 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-29 03:27:18,636 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2020-07-29 03:27:18,636 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-07-29 03:27:18,636 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-07-29 03:27:18,637 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 03:27:18,637 INFO L82 PathProgramCache]: Analyzing trace with hash 1182785647, now seen corresponding path program 1 times [2020-07-29 03:27:18,637 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 03:27:18,638 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2009136612] [2020-07-29 03:27:18,638 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 03:27:18,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 03:27:18,657 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 03:27:18,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 03:27:18,684 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 03:27:18,696 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 03:27:18,697 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 03:27:18,697 INFO L82 PathProgramCache]: Analyzing trace with hash 2051, now seen corresponding path program 2 times [2020-07-29 03:27:18,697 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 03:27:18,698 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2057697489] [2020-07-29 03:27:18,698 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 03:27:18,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 03:27:18,721 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 03:27:18,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 03:27:18,735 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 03:27:18,745 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 03:27:18,746 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 03:27:18,746 INFO L82 PathProgramCache]: Analyzing trace with hash -1509325583, now seen corresponding path program 1 times [2020-07-29 03:27:18,746 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 03:27:18,746 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1977927031] [2020-07-29 03:27:18,747 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 03:27:18,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 03:27:18,794 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 03:27:18,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 03:27:18,813 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 03:27:18,820 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 03:27:19,201 WARN L193 SmtUtils]: Spent 288.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 80 [2020-07-29 03:27:19,380 INFO L210 LassoAnalysis]: Preferences: [2020-07-29 03:27:19,381 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2020-07-29 03:27:19,381 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-07-29 03:27:19,381 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2020-07-29 03:27:19,381 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2020-07-29 03:27:19,382 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 03:27:19,382 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2020-07-29 03:27:19,382 INFO L132 ssoRankerPreferences]: Path of dumped script: [2020-07-29 03:27:19,383 INFO L133 ssoRankerPreferences]: Filename of dumped script: memleaks_test17_2-2.i_Iteration2_Lasso [2020-07-29 03:27:19,383 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2020-07-29 03:27:19,383 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2020-07-29 03:27:19,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-07-29 03:27:19,453 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:27:19,459 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:27:19,714 WARN L193 SmtUtils]: Spent 155.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 60 [2020-07-29 03:27:19,766 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:27:19,771 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:27:19,775 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:27:19,780 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:27:19,784 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:27:19,789 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:27:19,793 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:27:19,797 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:27:19,807 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:27:19,820 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:27:19,825 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:27:19,829 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:27:19,833 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:27:20,615 WARN L193 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 26 DAG size of output: 26 [2020-07-29 03:27:20,782 INFO L292 LassoAnalysis]: Preprocessing complete. [2020-07-29 03:27:20,787 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) Waiting until toolchain timeout for monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 03:27:20,800 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-07-29 03:27:20,802 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 03:27:20,802 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 03:27:20,803 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 03:27:20,803 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 03:27:20,803 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 03:27:20,806 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 03:27:20,806 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 03:27:20,809 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) Waiting until toolchain timeout for monitored process 3 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 03:27:20,836 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-07-29 03:27:20,838 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 03:27:20,838 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 03:27:20,838 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 03:27:20,838 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 03:27:20,843 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-29 03:27:20,844 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-07-29 03:27:20,849 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-07-29 03:27:20,876 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 4 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 03:27:20,877 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 03:27:20,878 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 03:27:20,878 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 03:27:20,878 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 03:27:20,880 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-29 03:27:20,881 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-07-29 03:27:20,885 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-07-29 03:27:20,907 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 5 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 03:27:20,909 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 03:27:20,909 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 03:27:20,909 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 03:27:20,910 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 03:27:20,910 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 03:27:20,910 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 03:27:20,911 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 03:27:20,912 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-07-29 03:27:20,936 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-07-29 03:27:20,942 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 03:27:20,943 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 03:27:20,943 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 03:27:20,943 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 03:27:20,943 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 03:27:20,946 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 03:27:20,946 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 03:27:20,949 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-07-29 03:27:20,977 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-07-29 03:27:20,979 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 03:27:20,979 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 03:27:20,980 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 03:27:20,980 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 03:27:20,982 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-29 03:27:20,983 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-07-29 03:27:20,987 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-07-29 03:27:21,014 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-07-29 03:27:21,015 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 03:27:21,016 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 03:27:21,016 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 03:27:21,016 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 03:27:21,042 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-29 03:27:21,043 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-07-29 03:27:21,066 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2020-07-29 03:27:21,126 INFO L443 ModelExtractionUtils]: Simplification made 16 calls to the SMT solver. [2020-07-29 03:27:21,126 INFO L444 ModelExtractionUtils]: 11 out of 43 variables were initially zero. Simplification set additionally 28 variables to zero. 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-07-29 03:27:21,136 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... Waiting until toolchain timeout for monitored process 9 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 03:27:21,141 INFO L438 nArgumentSynthesizer]: Removed 1 redundant supporting invariants from a total of 2. [2020-07-29 03:27:21,141 INFO L510 LassoAnalysis]: Proved termination. [2020-07-29 03:27:21,142 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select #length ULTIMATE.start_ldv_malloc_#t~malloc12.base)_1, ULTIMATE.start_entry_point_~i~2) = 1*v_rep(select #length ULTIMATE.start_ldv_malloc_#t~malloc12.base)_1 - 4*ULTIMATE.start_entry_point_~i~2 Supporting invariants [1*ULTIMATE.start_entry_point_~array~0.offset >= 0] [2020-07-29 03:27:21,236 INFO L297 tatePredicateManager]: 6 out of 8 supporting invariants were superfluous and have been removed [2020-07-29 03:27:21,252 INFO L393 LassoCheck]: Loop: "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);" "entry_point_#t~post46 := entry_point_~i~2;entry_point_~i~2 := 1 + entry_point_#t~post46;havoc entry_point_#t~post46;" [2020-07-29 03:27:21,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 03:27:21,277 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-29 03:27:21,321 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 03:27:21,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 03:27:21,368 INFO L263 TraceCheckSpWp]: Trace formula consists of 55 conjuncts, 9 conjunts are in the unsatisfiable core [2020-07-29 03:27:21,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 03:27:21,384 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 03:27:21,488 INFO L280 TraceCheckUtils]: 0: Hoare triple {197#unseeded} #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); {197#unseeded} is VALID [2020-07-29 03:27:21,489 INFO L280 TraceCheckUtils]: 1: Hoare triple {197#unseeded} 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; {197#unseeded} is VALID [2020-07-29 03:27:21,490 INFO L280 TraceCheckUtils]: 2: Hoare triple {197#unseeded} assume !(ldv_positive_~r~1 > 0);ldv_positive_#res := 1; {197#unseeded} is VALID [2020-07-29 03:27:21,491 INFO L280 TraceCheckUtils]: 3: Hoare triple {197#unseeded} entry_point_#t~ret44 := ldv_positive_#res;entry_point_~len~0 := entry_point_#t~ret44;havoc entry_point_#t~ret44; {197#unseeded} is VALID [2020-07-29 03:27:21,492 INFO L280 TraceCheckUtils]: 4: Hoare triple {197#unseeded} assume !!(entry_point_~len~0 < 16777216); {197#unseeded} is VALID [2020-07-29 03:27:21,492 INFO L280 TraceCheckUtils]: 5: Hoare triple {197#unseeded} 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; {197#unseeded} is VALID [2020-07-29 03:27:21,494 INFO L280 TraceCheckUtils]: 6: Hoare triple {197#unseeded} 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; {279#(and (<= 0 |ULTIMATE.start_ldv_malloc_#res.offset|) (= |ULTIMATE.start_ldv_malloc_#t~malloc12.base| |ULTIMATE.start_ldv_malloc_#res.base|) unseeded)} is VALID [2020-07-29 03:27:21,495 INFO L280 TraceCheckUtils]: 7: Hoare triple {279#(and (<= 0 |ULTIMATE.start_ldv_malloc_#res.offset|) (= |ULTIMATE.start_ldv_malloc_#t~malloc12.base| |ULTIMATE.start_ldv_malloc_#res.base|) unseeded)} 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; {252#(and (>= ULTIMATE.start_entry_point_~array~0.offset 0) (= ULTIMATE.start_entry_point_~array~0.base |ULTIMATE.start_ldv_malloc_#t~malloc12.base|) unseeded)} is VALID [2020-07-29 03:27:21,496 INFO L280 TraceCheckUtils]: 8: Hoare triple {252#(and (>= ULTIMATE.start_entry_point_~array~0.offset 0) (= ULTIMATE.start_entry_point_~array~0.base |ULTIMATE.start_ldv_malloc_#t~malloc12.base|) unseeded)} assume entry_point_~array~0.base != 0 || entry_point_~array~0.offset != 0;entry_point_~i~2 := 0; {252#(and (>= ULTIMATE.start_entry_point_~array~0.offset 0) (= ULTIMATE.start_entry_point_~array~0.base |ULTIMATE.start_ldv_malloc_#t~malloc12.base|) unseeded)} is VALID [2020-07-29 03:27:21,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 03:27:21,507 INFO L263 TraceCheckSpWp]: Trace formula consists of 15 conjuncts, 7 conjunts are in the unsatisfiable core [2020-07-29 03:27:21,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 03:27:21,515 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 03:27:21,554 INFO L280 TraceCheckUtils]: 0: Hoare triple {253#(and (>= ULTIMATE.start_entry_point_~array~0.offset 0) (>= oldRank0 (+ (select |#length| |ULTIMATE.start_ldv_malloc_#t~malloc12.base|) (* (- 4) ULTIMATE.start_entry_point_~i~2))) (= ULTIMATE.start_entry_point_~array~0.base |ULTIMATE.start_ldv_malloc_#t~malloc12.base|))} 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); {286#(and (<= (+ ULTIMATE.start_entry_point_~array~0.offset (* 4 ULTIMATE.start_entry_point_~i~2) 4) (select |#length| ULTIMATE.start_entry_point_~array~0.base)) (<= (select |#length| |ULTIMATE.start_ldv_malloc_#t~malloc12.base|) (+ oldRank0 (* 4 ULTIMATE.start_entry_point_~i~2))) (= ULTIMATE.start_entry_point_~array~0.base |ULTIMATE.start_ldv_malloc_#t~malloc12.base|) (<= 0 ULTIMATE.start_entry_point_~array~0.offset))} is VALID [2020-07-29 03:27:21,556 INFO L280 TraceCheckUtils]: 1: Hoare triple {286#(and (<= (+ ULTIMATE.start_entry_point_~array~0.offset (* 4 ULTIMATE.start_entry_point_~i~2) 4) (select |#length| ULTIMATE.start_entry_point_~array~0.base)) (<= (select |#length| |ULTIMATE.start_ldv_malloc_#t~malloc12.base|) (+ oldRank0 (* 4 ULTIMATE.start_entry_point_~i~2))) (= ULTIMATE.start_entry_point_~array~0.base |ULTIMATE.start_ldv_malloc_#t~malloc12.base|) (<= 0 ULTIMATE.start_entry_point_~array~0.offset))} entry_point_#t~post46 := entry_point_~i~2;entry_point_~i~2 := 1 + entry_point_#t~post46;havoc entry_point_#t~post46; {255#(and (>= ULTIMATE.start_entry_point_~array~0.offset 0) (or (and (>= oldRank0 0) (> oldRank0 (+ (select |#length| |ULTIMATE.start_ldv_malloc_#t~malloc12.base|) (* (- 4) ULTIMATE.start_entry_point_~i~2)))) unseeded) (= ULTIMATE.start_entry_point_~array~0.base |ULTIMATE.start_ldv_malloc_#t~malloc12.base|))} is VALID [2020-07-29 03:27:21,557 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-29 03:27:21,558 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states. [2020-07-29 03:27:21,576 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 11 edges. 11 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-29 03:27:21,578 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 9 letters. Loop has 2 letters. [2020-07-29 03:27:21,578 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:27:21,581 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.3 stem predicates 2 loop predicates [2020-07-29 03:27:21,582 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 25 states and 31 transitions. cyclomatic complexity: 10 Second operand 5 states. [2020-07-29 03:27:21,833 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 25 states and 31 transitions. cyclomatic complexity: 10. Second operand 5 states. Result 38 states and 49 transitions. Complement of second has 9 states. [2020-07-29 03:27:21,833 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 6 states 3 stem states 2 non-accepting loop states 1 accepting loop states [2020-07-29 03:27:21,833 INFO L123 tractBuchiDifference]: Start testing correctness of buchiDifferenceNCSBLazy3 [2020-07-29 03:27:21,834 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 25 states and 31 transitions. cyclomatic complexity: 10 [2020-07-29 03:27:21,834 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 03:27:21,834 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 03:27:21,834 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 5 states. [2020-07-29 03:27:21,841 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2020-07-29 03:27:21,841 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 03:27:21,841 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 03:27:21,842 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 38 states and 49 transitions. [2020-07-29 03:27:21,845 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 11 [2020-07-29 03:27:21,845 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 03:27:21,845 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 03:27:21,849 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 25 states and 31 transitions. cyclomatic complexity: 10 [2020-07-29 03:27:21,857 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 11 examples of accepted words. [2020-07-29 03:27:21,857 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 5 states. [2020-07-29 03:27:21,861 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2020-07-29 03:27:21,862 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 1 examples of accepted words. [2020-07-29 03:27:21,862 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 38 states and 49 transitions. cyclomatic complexity: 17 [2020-07-29 03:27:21,872 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 11 examples of accepted words. [2020-07-29 03:27:21,872 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 25 states and 31 transitions. cyclomatic complexity: 10 Stem has 9 letters. Loop has 2 letters. [2020-07-29 03:27:21,873 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:27:21,873 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 9 letters. Loop has 2 letters. [2020-07-29 03:27:21,873 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:27:21,873 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 38 states and 49 transitions. cyclomatic complexity: 17 Stem has 9 letters. Loop has 2 letters. [2020-07-29 03:27:21,874 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:27:21,874 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 25 states and 31 transitions. cyclomatic complexity: 10 Stem has 3 letters. Loop has 2 letters. [2020-07-29 03:27:21,874 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:27:21,874 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 3 letters. Loop has 2 letters. [2020-07-29 03:27:21,875 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:27:21,875 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 38 states and 49 transitions. cyclomatic complexity: 17 Stem has 3 letters. Loop has 2 letters. [2020-07-29 03:27:21,875 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:27:21,875 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 25 states and 31 transitions. cyclomatic complexity: 10 Stem has 12 letters. Loop has 5 letters. [2020-07-29 03:27:21,875 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:27:21,876 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 12 letters. Loop has 5 letters. [2020-07-29 03:27:21,876 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:27:21,876 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 38 states and 49 transitions. cyclomatic complexity: 17 Stem has 12 letters. Loop has 5 letters. [2020-07-29 03:27:21,876 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:27:21,877 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 25 states and 31 transitions. cyclomatic complexity: 10 Stem has 38 letters. Loop has 38 letters. [2020-07-29 03:27:21,877 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:27:21,877 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 38 letters. Loop has 38 letters. [2020-07-29 03:27:21,879 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:27:21,880 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 38 states and 49 transitions. cyclomatic complexity: 17 Stem has 38 letters. Loop has 38 letters. [2020-07-29 03:27:21,880 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:27:21,880 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 25 states and 31 transitions. cyclomatic complexity: 10 Stem has 25 letters. Loop has 25 letters. [2020-07-29 03:27:21,880 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:27:21,880 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 25 letters. Loop has 25 letters. [2020-07-29 03:27:21,881 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:27:21,881 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 38 states and 49 transitions. cyclomatic complexity: 17 Stem has 25 letters. Loop has 25 letters. [2020-07-29 03:27:21,881 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:27:21,881 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 25 states and 31 transitions. cyclomatic complexity: 10 Stem has 6 letters. Loop has 6 letters. [2020-07-29 03:27:21,882 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:27:21,882 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 6 letters. Loop has 6 letters. [2020-07-29 03:27:21,882 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:27:21,882 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 38 states and 49 transitions. cyclomatic complexity: 17 Stem has 6 letters. Loop has 6 letters. [2020-07-29 03:27:21,882 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:27:21,883 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 25 states and 31 transitions. cyclomatic complexity: 10 Stem has 14 letters. Loop has 2 letters. [2020-07-29 03:27:21,883 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:27:21,883 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 14 letters. Loop has 2 letters. [2020-07-29 03:27:21,884 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:27:21,884 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 38 states and 49 transitions. cyclomatic complexity: 17 Stem has 14 letters. Loop has 2 letters. [2020-07-29 03:27:21,884 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:27:21,884 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 25 states and 31 transitions. cyclomatic complexity: 10 Stem has 15 letters. Loop has 2 letters. [2020-07-29 03:27:21,885 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:27:21,885 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 15 letters. Loop has 2 letters. [2020-07-29 03:27:21,887 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:27:21,888 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 38 states and 49 transitions. cyclomatic complexity: 17 Stem has 15 letters. Loop has 2 letters. [2020-07-29 03:27:21,891 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:27:21,892 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 25 states and 31 transitions. cyclomatic complexity: 10 Stem has 17 letters. Loop has 2 letters. [2020-07-29 03:27:21,892 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:27:21,892 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 17 letters. Loop has 2 letters. [2020-07-29 03:27:21,893 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:27:21,893 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 38 states and 49 transitions. cyclomatic complexity: 17 Stem has 17 letters. Loop has 2 letters. [2020-07-29 03:27:21,893 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:27:21,893 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 25 states and 31 transitions. cyclomatic complexity: 10 Stem has 16 letters. Loop has 2 letters. [2020-07-29 03:27:21,894 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:27:21,894 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 16 letters. Loop has 2 letters. [2020-07-29 03:27:21,894 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:27:21,894 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 38 states and 49 transitions. cyclomatic complexity: 17 Stem has 16 letters. Loop has 2 letters. [2020-07-29 03:27:21,895 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:27:21,895 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 25 states and 31 transitions. cyclomatic complexity: 10 Stem has 14 letters. Loop has 5 letters. [2020-07-29 03:27:21,895 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:27:21,895 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 14 letters. Loop has 5 letters. [2020-07-29 03:27:21,896 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:27:21,897 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 38 states and 49 transitions. cyclomatic complexity: 17 Stem has 14 letters. Loop has 5 letters. [2020-07-29 03:27:21,897 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:27:21,897 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 25 states and 31 transitions. cyclomatic complexity: 10 Stem has 15 letters. Loop has 5 letters. [2020-07-29 03:27:21,898 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:27:21,898 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 15 letters. Loop has 5 letters. [2020-07-29 03:27:21,898 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:27:21,898 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 38 states and 49 transitions. cyclomatic complexity: 17 Stem has 15 letters. Loop has 5 letters. [2020-07-29 03:27:21,898 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:27:21,899 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 25 states and 31 transitions. cyclomatic complexity: 10 Stem has 11 letters. Loop has 5 letters. [2020-07-29 03:27:21,899 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:27:21,899 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 11 letters. Loop has 5 letters. [2020-07-29 03:27:21,899 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:27:21,900 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 38 states and 49 transitions. cyclomatic complexity: 17 Stem has 11 letters. Loop has 5 letters. [2020-07-29 03:27:21,900 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:27:21,900 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 25 states and 31 transitions. cyclomatic complexity: 10 Stem has 12 letters. Loop has 5 letters. [2020-07-29 03:27:21,900 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:27:21,901 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 12 letters. Loop has 5 letters. [2020-07-29 03:27:21,901 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:27:21,904 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 38 states and 49 transitions. cyclomatic complexity: 17 Stem has 12 letters. Loop has 5 letters. [2020-07-29 03:27:21,905 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:27:21,905 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 25 states and 31 transitions. cyclomatic complexity: 10 Stem has 13 letters. Loop has 5 letters. [2020-07-29 03:27:21,906 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:27:21,906 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 13 letters. Loop has 5 letters. [2020-07-29 03:27:21,906 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:27:21,906 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 38 states and 49 transitions. cyclomatic complexity: 17 Stem has 13 letters. Loop has 5 letters. [2020-07-29 03:27:21,907 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:27:21,907 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 25 states and 31 transitions. cyclomatic complexity: 10 Stem has 10 letters. Loop has 2 letters. [2020-07-29 03:27:21,907 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:27:21,907 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 10 letters. Loop has 2 letters. [2020-07-29 03:27:21,908 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:27:21,908 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 38 states and 49 transitions. cyclomatic complexity: 17 Stem has 10 letters. Loop has 2 letters. [2020-07-29 03:27:21,909 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:27:21,909 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 25 states and 31 transitions. cyclomatic complexity: 10 Stem has 9 letters. Loop has 2 letters. [2020-07-29 03:27:21,909 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:27:21,909 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 9 letters. Loop has 2 letters. [2020-07-29 03:27:21,910 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:27:21,910 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 38 states and 49 transitions. cyclomatic complexity: 17 Stem has 9 letters. Loop has 2 letters. [2020-07-29 03:27:21,910 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:27:21,910 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 25 states and 31 transitions. cyclomatic complexity: 10 Stem has 3 letters. Loop has 2 letters. [2020-07-29 03:27:21,911 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:27:21,911 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 3 letters. Loop has 2 letters. [2020-07-29 03:27:21,911 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:27:21,912 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 38 states and 49 transitions. cyclomatic complexity: 17 Stem has 3 letters. Loop has 2 letters. [2020-07-29 03:27:21,912 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:27:21,912 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 25 states and 31 transitions. cyclomatic complexity: 10 Stem has 14 letters. Loop has 2 letters. [2020-07-29 03:27:21,912 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:27:21,912 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 14 letters. Loop has 2 letters. [2020-07-29 03:27:21,913 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:27:21,913 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 38 states and 49 transitions. cyclomatic complexity: 17 Stem has 14 letters. Loop has 2 letters. [2020-07-29 03:27:21,913 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:27:21,913 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 25 states and 31 transitions. cyclomatic complexity: 10 Stem has 15 letters. Loop has 2 letters. [2020-07-29 03:27:21,914 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:27:21,914 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 15 letters. Loop has 2 letters. [2020-07-29 03:27:21,914 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:27:21,914 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 38 states and 49 transitions. cyclomatic complexity: 17 Stem has 15 letters. Loop has 2 letters. [2020-07-29 03:27:21,915 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:27:21,915 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 25 states and 31 transitions. cyclomatic complexity: 10 Stem has 19 letters. Loop has 2 letters. [2020-07-29 03:27:21,915 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:27:21,916 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 19 letters. Loop has 2 letters. [2020-07-29 03:27:21,916 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:27:21,916 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 38 states and 49 transitions. cyclomatic complexity: 17 Stem has 19 letters. Loop has 2 letters. [2020-07-29 03:27:21,916 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:27:21,917 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 25 states and 31 transitions. cyclomatic complexity: 10 Stem has 20 letters. Loop has 2 letters. [2020-07-29 03:27:21,917 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:27:21,917 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 20 letters. Loop has 2 letters. [2020-07-29 03:27:21,918 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:27:21,918 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 38 states and 49 transitions. cyclomatic complexity: 17 Stem has 20 letters. Loop has 2 letters. [2020-07-29 03:27:21,918 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:27:21,919 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 25 states and 31 transitions. cyclomatic complexity: 10 Stem has 16 letters. Loop has 2 letters. [2020-07-29 03:27:21,919 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:27:21,919 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 16 letters. Loop has 2 letters. [2020-07-29 03:27:21,920 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:27:21,920 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 38 states and 49 transitions. cyclomatic complexity: 17 Stem has 16 letters. Loop has 2 letters. [2020-07-29 03:27:21,920 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:27:21,920 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 25 states and 31 transitions. cyclomatic complexity: 10 Stem has 17 letters. Loop has 2 letters. [2020-07-29 03:27:21,921 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:27:21,921 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 17 letters. Loop has 2 letters. [2020-07-29 03:27:21,921 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:27:21,921 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 38 states and 49 transitions. cyclomatic complexity: 17 Stem has 17 letters. Loop has 2 letters. [2020-07-29 03:27:21,922 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:27:21,922 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 25 states and 31 transitions. cyclomatic complexity: 10 Stem has 16 letters. Loop has 5 letters. [2020-07-29 03:27:21,922 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:27:21,922 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 16 letters. Loop has 5 letters. [2020-07-29 03:27:21,923 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:27:21,924 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 38 states and 49 transitions. cyclomatic complexity: 17 Stem has 16 letters. Loop has 5 letters. [2020-07-29 03:27:21,926 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:27:21,926 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 25 states and 31 transitions. cyclomatic complexity: 10 Stem has 12 letters. Loop has 5 letters. [2020-07-29 03:27:21,927 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:27:21,927 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 12 letters. Loop has 5 letters. [2020-07-29 03:27:21,927 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:27:21,927 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 38 states and 49 transitions. cyclomatic complexity: 17 Stem has 12 letters. Loop has 5 letters. [2020-07-29 03:27:21,928 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:27:21,928 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 25 states and 31 transitions. cyclomatic complexity: 10 Stem has 13 letters. Loop has 5 letters. [2020-07-29 03:27:21,928 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:27:21,928 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 13 letters. Loop has 5 letters. [2020-07-29 03:27:21,929 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:27:21,929 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 38 states and 49 transitions. cyclomatic complexity: 17 Stem has 13 letters. Loop has 5 letters. [2020-07-29 03:27:21,929 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:27:21,929 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 25 states and 31 transitions. cyclomatic complexity: 10 Stem has 14 letters. Loop has 5 letters. [2020-07-29 03:27:21,929 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:27:21,930 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 14 letters. Loop has 5 letters. [2020-07-29 03:27:21,930 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:27:21,930 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 38 states and 49 transitions. cyclomatic complexity: 17 Stem has 14 letters. Loop has 5 letters. [2020-07-29 03:27:21,930 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:27:21,930 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 25 states and 31 transitions. cyclomatic complexity: 10 Stem has 15 letters. Loop has 5 letters. [2020-07-29 03:27:21,931 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:27:21,931 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 15 letters. Loop has 5 letters. [2020-07-29 03:27:21,931 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:27:21,931 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 38 states and 49 transitions. cyclomatic complexity: 17 Stem has 15 letters. Loop has 5 letters. [2020-07-29 03:27:21,932 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:27:21,932 INFO L161 tractBuchiDifference]: Finished testing correctness of buchiDifferenceNCSBLazy3 [2020-07-29 03:27:21,932 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-07-29 03:27:21,935 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 19 transitions. [2020-07-29 03:27:21,936 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 19 transitions. Stem has 9 letters. Loop has 2 letters. [2020-07-29 03:27:21,936 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:27:21,936 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 19 transitions. Stem has 11 letters. Loop has 2 letters. [2020-07-29 03:27:21,937 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:27:21,937 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 19 transitions. Stem has 9 letters. Loop has 4 letters. [2020-07-29 03:27:21,937 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:27:21,937 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 38 states and 49 transitions. cyclomatic complexity: 17 [2020-07-29 03:27:21,949 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 11 [2020-07-29 03:27:21,951 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 38 states to 31 states and 39 transitions. [2020-07-29 03:27:21,952 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 28 [2020-07-29 03:27:21,952 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 29 [2020-07-29 03:27:21,953 INFO L73 IsDeterministic]: Start isDeterministic. Operand 31 states and 39 transitions. [2020-07-29 03:27:21,953 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-07-29 03:27:21,953 INFO L688 BuchiCegarLoop]: Abstraction has 31 states and 39 transitions. [2020-07-29 03:27:21,954 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states and 39 transitions. [2020-07-29 03:27:21,957 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 26. [2020-07-29 03:27:21,957 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-29 03:27:21,958 INFO L82 GeneralOperation]: Start isEquivalent. First operand 31 states and 39 transitions. Second operand 26 states. [2020-07-29 03:27:21,958 INFO L74 IsIncluded]: Start isIncluded. First operand 31 states and 39 transitions. Second operand 26 states. [2020-07-29 03:27:21,958 INFO L87 Difference]: Start difference. First operand 31 states and 39 transitions. Second operand 26 states. [2020-07-29 03:27:21,960 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 03:27:21,960 INFO L93 Difference]: Finished difference Result 31 states and 39 transitions. [2020-07-29 03:27:21,961 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 39 transitions. [2020-07-29 03:27:21,962 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 03:27:21,962 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 03:27:21,962 INFO L74 IsIncluded]: Start isIncluded. First operand 26 states. Second operand 31 states and 39 transitions. [2020-07-29 03:27:21,962 INFO L87 Difference]: Start difference. First operand 26 states. Second operand 31 states and 39 transitions. [2020-07-29 03:27:21,965 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 03:27:21,965 INFO L93 Difference]: Finished difference Result 31 states and 39 transitions. [2020-07-29 03:27:21,966 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 39 transitions. [2020-07-29 03:27:21,967 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 03:27:21,967 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 03:27:21,968 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-29 03:27:21,968 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-29 03:27:21,968 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2020-07-29 03:27:21,970 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 33 transitions. [2020-07-29 03:27:21,971 INFO L711 BuchiCegarLoop]: Abstraction has 26 states and 33 transitions. [2020-07-29 03:27:21,971 INFO L591 BuchiCegarLoop]: Abstraction has 26 states and 33 transitions. [2020-07-29 03:27:21,971 INFO L424 BuchiCegarLoop]: ======== Iteration 3============ [2020-07-29 03:27:21,971 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 26 states and 33 transitions. [2020-07-29 03:27:21,974 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 9 [2020-07-29 03:27:21,975 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 03:27:21,975 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 03:27:21,976 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-29 03:27:21,976 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2020-07-29 03:27:21,978 INFO L794 eck$LassoCheckResult]: Stem: 368#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); 355#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; 356#L520 assume !(ldv_positive_~r~1 > 0);ldv_positive_#res := 1; 359#L521 entry_point_#t~ret44 := ldv_positive_#res;entry_point_~len~0 := entry_point_#t~ret44;havoc entry_point_#t~ret44; 360#L787 assume !!(entry_point_~len~0 < 16777216); 369#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; 344#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; 345#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; 348#L789 assume entry_point_~array~0.base != 0 || entry_point_~array~0.offset != 0;entry_point_~i~2 := 0; 349#L790-3 assume !(entry_point_~i~2 < entry_point_~len~0); 361#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; 362#L765-3 [2020-07-29 03:27:21,978 INFO L796 eck$LassoCheckResult]: Loop: 362#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; 346#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; 347#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; 352#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); 354#L765-2 alloc_17_#t~post38 := alloc_17_~i~0;alloc_17_~i~0 := 1 + alloc_17_#t~post38;havoc alloc_17_#t~post38; 362#L765-3 [2020-07-29 03:27:21,979 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 03:27:21,979 INFO L82 PathProgramCache]: Analyzing trace with hash -1509325641, now seen corresponding path program 1 times [2020-07-29 03:27:21,979 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 03:27:21,979 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1741040395] [2020-07-29 03:27:21,980 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 03:27:22,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 03:27:22,079 INFO L280 TraceCheckUtils]: 0: Hoare triple {435#true} #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); {435#true} is VALID [2020-07-29 03:27:22,079 INFO L280 TraceCheckUtils]: 1: Hoare triple {435#true} 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; {435#true} is VALID [2020-07-29 03:27:22,080 INFO L280 TraceCheckUtils]: 2: Hoare triple {435#true} assume !(ldv_positive_~r~1 > 0);ldv_positive_#res := 1; {437#(= 1 |ULTIMATE.start_ldv_positive_#res|)} is VALID [2020-07-29 03:27:22,081 INFO L280 TraceCheckUtils]: 3: Hoare triple {437#(= 1 |ULTIMATE.start_ldv_positive_#res|)} entry_point_#t~ret44 := ldv_positive_#res;entry_point_~len~0 := entry_point_#t~ret44;havoc entry_point_#t~ret44; {438#(= 1 ULTIMATE.start_entry_point_~len~0)} is VALID [2020-07-29 03:27:22,082 INFO L280 TraceCheckUtils]: 4: Hoare triple {438#(= 1 ULTIMATE.start_entry_point_~len~0)} assume !!(entry_point_~len~0 < 16777216); {438#(= 1 ULTIMATE.start_entry_point_~len~0)} is VALID [2020-07-29 03:27:22,082 INFO L280 TraceCheckUtils]: 5: Hoare triple {438#(= 1 ULTIMATE.start_entry_point_~len~0)} 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; {438#(= 1 ULTIMATE.start_entry_point_~len~0)} is VALID [2020-07-29 03:27:22,083 INFO L280 TraceCheckUtils]: 6: Hoare triple {438#(= 1 ULTIMATE.start_entry_point_~len~0)} 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; {438#(= 1 ULTIMATE.start_entry_point_~len~0)} is VALID [2020-07-29 03:27:22,084 INFO L280 TraceCheckUtils]: 7: Hoare triple {438#(= 1 ULTIMATE.start_entry_point_~len~0)} 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; {438#(= 1 ULTIMATE.start_entry_point_~len~0)} is VALID [2020-07-29 03:27:22,085 INFO L280 TraceCheckUtils]: 8: Hoare triple {438#(= 1 ULTIMATE.start_entry_point_~len~0)} assume entry_point_~array~0.base != 0 || entry_point_~array~0.offset != 0;entry_point_~i~2 := 0; {439#(and (= 1 ULTIMATE.start_entry_point_~len~0) (= ULTIMATE.start_entry_point_~i~2 0))} is VALID [2020-07-29 03:27:22,086 INFO L280 TraceCheckUtils]: 9: Hoare triple {439#(and (= 1 ULTIMATE.start_entry_point_~len~0) (= ULTIMATE.start_entry_point_~i~2 0))} assume !(entry_point_~i~2 < entry_point_~len~0); {436#false} is VALID [2020-07-29 03:27:22,087 INFO L280 TraceCheckUtils]: 10: Hoare triple {436#false} 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; {436#false} is VALID [2020-07-29 03:27:22,087 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-29 03:27:22,087 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1741040395] [2020-07-29 03:27:22,088 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-29 03:27:22,088 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-07-29 03:27:22,088 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [739338759] [2020-07-29 03:27:22,089 INFO L799 eck$LassoCheckResult]: stem already infeasible [2020-07-29 03:27:22,089 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 03:27:22,089 INFO L82 PathProgramCache]: Analyzing trace with hash 74532277, now seen corresponding path program 1 times [2020-07-29 03:27:22,089 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 03:27:22,090 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [232852904] [2020-07-29 03:27:22,090 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 03:27:22,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 03:27:22,100 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 03:27:22,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 03:27:22,108 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 03:27:22,111 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 03:27:22,263 WARN L193 SmtUtils]: Spent 147.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 74 [2020-07-29 03:27:22,371 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-29 03:27:22,372 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-07-29 03:27:22,372 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-07-29 03:27:22,372 INFO L87 Difference]: Start difference. First operand 26 states and 33 transitions. cyclomatic complexity: 11 Second operand 5 states. [2020-07-29 03:27:22,600 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 03:27:22,600 INFO L93 Difference]: Finished difference Result 50 states and 62 transitions. [2020-07-29 03:27:22,601 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-07-29 03:27:22,601 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states. [2020-07-29 03:27:22,624 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 11 edges. 11 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-29 03:27:22,625 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 50 states and 62 transitions. [2020-07-29 03:27:22,627 INFO L131 ngComponentsAnalysis]: Automaton has 6 accepting balls. 18 [2020-07-29 03:27:22,630 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 50 states to 50 states and 62 transitions. [2020-07-29 03:27:22,630 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 45 [2020-07-29 03:27:22,630 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 45 [2020-07-29 03:27:22,630 INFO L73 IsDeterministic]: Start isDeterministic. Operand 50 states and 62 transitions. [2020-07-29 03:27:22,631 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-07-29 03:27:22,631 INFO L688 BuchiCegarLoop]: Abstraction has 50 states and 62 transitions. [2020-07-29 03:27:22,631 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states and 62 transitions. [2020-07-29 03:27:22,634 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 33. [2020-07-29 03:27:22,634 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-29 03:27:22,634 INFO L82 GeneralOperation]: Start isEquivalent. First operand 50 states and 62 transitions. Second operand 33 states. [2020-07-29 03:27:22,634 INFO L74 IsIncluded]: Start isIncluded. First operand 50 states and 62 transitions. Second operand 33 states. [2020-07-29 03:27:22,635 INFO L87 Difference]: Start difference. First operand 50 states and 62 transitions. Second operand 33 states. [2020-07-29 03:27:22,637 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 03:27:22,637 INFO L93 Difference]: Finished difference Result 50 states and 62 transitions. [2020-07-29 03:27:22,637 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 62 transitions. [2020-07-29 03:27:22,638 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 03:27:22,638 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 03:27:22,638 INFO L74 IsIncluded]: Start isIncluded. First operand 33 states. Second operand 50 states and 62 transitions. [2020-07-29 03:27:22,638 INFO L87 Difference]: Start difference. First operand 33 states. Second operand 50 states and 62 transitions. [2020-07-29 03:27:22,641 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 03:27:22,641 INFO L93 Difference]: Finished difference Result 50 states and 62 transitions. [2020-07-29 03:27:22,641 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 62 transitions. [2020-07-29 03:27:22,642 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 03:27:22,642 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 03:27:22,642 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-29 03:27:22,642 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-29 03:27:22,642 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2020-07-29 03:27:22,644 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 40 transitions. [2020-07-29 03:27:22,644 INFO L711 BuchiCegarLoop]: Abstraction has 33 states and 40 transitions. [2020-07-29 03:27:22,644 INFO L591 BuchiCegarLoop]: Abstraction has 33 states and 40 transitions. [2020-07-29 03:27:22,644 INFO L424 BuchiCegarLoop]: ======== Iteration 4============ [2020-07-29 03:27:22,644 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 33 states and 40 transitions. [2020-07-29 03:27:22,645 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 9 [2020-07-29 03:27:22,645 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 03:27:22,645 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 03:27:22,646 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-29 03:27:22,646 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2020-07-29 03:27:22,646 INFO L794 eck$LassoCheckResult]: Stem: 521#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); 507#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; 508#L520 assume ldv_positive_~r~1 > 0;ldv_positive_#res := ldv_positive_~r~1; 524#L521 entry_point_#t~ret44 := ldv_positive_#res;entry_point_~len~0 := entry_point_#t~ret44;havoc entry_point_#t~ret44; 522#L787 assume !!(entry_point_~len~0 < 16777216); 523#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; 528#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; 526#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; 500#L789 assume entry_point_~array~0.base != 0 || entry_point_~array~0.offset != 0;entry_point_~i~2 := 0; 501#L790-3 assume !(entry_point_~i~2 < entry_point_~len~0); 514#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; 515#L765-3 [2020-07-29 03:27:22,646 INFO L796 eck$LassoCheckResult]: Loop: 515#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; 498#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; 499#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; 504#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); 506#L765-2 alloc_17_#t~post38 := alloc_17_~i~0;alloc_17_~i~0 := 1 + alloc_17_#t~post38;havoc alloc_17_#t~post38; 515#L765-3 [2020-07-29 03:27:22,646 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 03:27:22,647 INFO L82 PathProgramCache]: Analyzing trace with hash 2105583285, now seen corresponding path program 1 times [2020-07-29 03:27:22,647 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 03:27:22,647 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [910039269] [2020-07-29 03:27:22,647 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 03:27:22,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 03:27:22,705 INFO L280 TraceCheckUtils]: 0: Hoare triple {632#true} #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); {632#true} is VALID [2020-07-29 03:27:22,705 INFO L280 TraceCheckUtils]: 1: Hoare triple {632#true} 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; {632#true} is VALID [2020-07-29 03:27:22,706 INFO L280 TraceCheckUtils]: 2: Hoare triple {632#true} assume ldv_positive_~r~1 > 0;ldv_positive_#res := ldv_positive_~r~1; {634#(<= 1 |ULTIMATE.start_ldv_positive_#res|)} is VALID [2020-07-29 03:27:22,707 INFO L280 TraceCheckUtils]: 3: Hoare triple {634#(<= 1 |ULTIMATE.start_ldv_positive_#res|)} entry_point_#t~ret44 := ldv_positive_#res;entry_point_~len~0 := entry_point_#t~ret44;havoc entry_point_#t~ret44; {635#(<= 1 ULTIMATE.start_entry_point_~len~0)} is VALID [2020-07-29 03:27:22,708 INFO L280 TraceCheckUtils]: 4: Hoare triple {635#(<= 1 ULTIMATE.start_entry_point_~len~0)} assume !!(entry_point_~len~0 < 16777216); {635#(<= 1 ULTIMATE.start_entry_point_~len~0)} is VALID [2020-07-29 03:27:22,708 INFO L280 TraceCheckUtils]: 5: Hoare triple {635#(<= 1 ULTIMATE.start_entry_point_~len~0)} 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; {635#(<= 1 ULTIMATE.start_entry_point_~len~0)} is VALID [2020-07-29 03:27:22,709 INFO L280 TraceCheckUtils]: 6: Hoare triple {635#(<= 1 ULTIMATE.start_entry_point_~len~0)} 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; {635#(<= 1 ULTIMATE.start_entry_point_~len~0)} is VALID [2020-07-29 03:27:22,710 INFO L280 TraceCheckUtils]: 7: Hoare triple {635#(<= 1 ULTIMATE.start_entry_point_~len~0)} 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; {635#(<= 1 ULTIMATE.start_entry_point_~len~0)} is VALID [2020-07-29 03:27:22,711 INFO L280 TraceCheckUtils]: 8: Hoare triple {635#(<= 1 ULTIMATE.start_entry_point_~len~0)} assume entry_point_~array~0.base != 0 || entry_point_~array~0.offset != 0;entry_point_~i~2 := 0; {636#(and (<= 1 ULTIMATE.start_entry_point_~len~0) (= ULTIMATE.start_entry_point_~i~2 0))} is VALID [2020-07-29 03:27:22,712 INFO L280 TraceCheckUtils]: 9: Hoare triple {636#(and (<= 1 ULTIMATE.start_entry_point_~len~0) (= ULTIMATE.start_entry_point_~i~2 0))} assume !(entry_point_~i~2 < entry_point_~len~0); {633#false} is VALID [2020-07-29 03:27:22,712 INFO L280 TraceCheckUtils]: 10: Hoare triple {633#false} 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; {633#false} is VALID [2020-07-29 03:27:22,713 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-29 03:27:22,713 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [910039269] [2020-07-29 03:27:22,713 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-29 03:27:22,714 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-07-29 03:27:22,714 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [66349612] [2020-07-29 03:27:22,714 INFO L799 eck$LassoCheckResult]: stem already infeasible [2020-07-29 03:27:22,714 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 03:27:22,715 INFO L82 PathProgramCache]: Analyzing trace with hash 74532277, now seen corresponding path program 2 times [2020-07-29 03:27:22,715 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 03:27:22,715 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [521302752] [2020-07-29 03:27:22,715 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 03:27:22,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 03:27:22,723 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 03:27:22,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 03:27:22,730 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 03:27:22,733 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 03:27:22,923 WARN L193 SmtUtils]: Spent 130.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 74 [2020-07-29 03:27:23,025 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-29 03:27:23,025 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-07-29 03:27:23,026 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-07-29 03:27:23,026 INFO L87 Difference]: Start difference. First operand 33 states and 40 transitions. cyclomatic complexity: 11 Second operand 5 states. [2020-07-29 03:27:23,153 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 03:27:23,153 INFO L93 Difference]: Finished difference Result 34 states and 40 transitions. [2020-07-29 03:27:23,153 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-07-29 03:27:23,154 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states. [2020-07-29 03:27:23,174 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 11 edges. 11 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-29 03:27:23,174 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 34 states and 40 transitions. [2020-07-29 03:27:23,176 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 9 [2020-07-29 03:27:23,177 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 34 states to 34 states and 40 transitions. [2020-07-29 03:27:23,177 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 31 [2020-07-29 03:27:23,178 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 31 [2020-07-29 03:27:23,178 INFO L73 IsDeterministic]: Start isDeterministic. Operand 34 states and 40 transitions. [2020-07-29 03:27:23,178 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-07-29 03:27:23,178 INFO L688 BuchiCegarLoop]: Abstraction has 34 states and 40 transitions. [2020-07-29 03:27:23,179 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states and 40 transitions. [2020-07-29 03:27:23,181 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 26. [2020-07-29 03:27:23,181 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-29 03:27:23,181 INFO L82 GeneralOperation]: Start isEquivalent. First operand 34 states and 40 transitions. Second operand 26 states. [2020-07-29 03:27:23,182 INFO L74 IsIncluded]: Start isIncluded. First operand 34 states and 40 transitions. Second operand 26 states. [2020-07-29 03:27:23,182 INFO L87 Difference]: Start difference. First operand 34 states and 40 transitions. Second operand 26 states. [2020-07-29 03:27:23,183 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 03:27:23,184 INFO L93 Difference]: Finished difference Result 34 states and 40 transitions. [2020-07-29 03:27:23,184 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 40 transitions. [2020-07-29 03:27:23,184 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 03:27:23,184 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 03:27:23,185 INFO L74 IsIncluded]: Start isIncluded. First operand 26 states. Second operand 34 states and 40 transitions. [2020-07-29 03:27:23,185 INFO L87 Difference]: Start difference. First operand 26 states. Second operand 34 states and 40 transitions. [2020-07-29 03:27:23,186 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 03:27:23,187 INFO L93 Difference]: Finished difference Result 34 states and 40 transitions. [2020-07-29 03:27:23,187 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 40 transitions. [2020-07-29 03:27:23,187 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 03:27:23,187 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 03:27:23,188 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-29 03:27:23,188 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-29 03:27:23,188 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2020-07-29 03:27:23,189 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 32 transitions. [2020-07-29 03:27:23,189 INFO L711 BuchiCegarLoop]: Abstraction has 26 states and 32 transitions. [2020-07-29 03:27:23,190 INFO L591 BuchiCegarLoop]: Abstraction has 26 states and 32 transitions. [2020-07-29 03:27:23,190 INFO L424 BuchiCegarLoop]: ======== Iteration 5============ [2020-07-29 03:27:23,190 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 26 states and 32 transitions. [2020-07-29 03:27:23,190 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 9 [2020-07-29 03:27:23,191 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 03:27:23,191 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 03:27:23,191 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-29 03:27:23,191 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2020-07-29 03:27:23,192 INFO L794 eck$LassoCheckResult]: Stem: 702#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); 688#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; 689#L520 assume !(ldv_positive_~r~1 > 0);ldv_positive_#res := 1; 692#L521 entry_point_#t~ret44 := ldv_positive_#res;entry_point_~len~0 := entry_point_#t~ret44;havoc entry_point_#t~ret44; 693#L787 assume !!(entry_point_~len~0 < 16777216); 701#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; 677#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; 678#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; 681#L789 assume entry_point_~array~0.base != 0 || entry_point_~array~0.offset != 0;entry_point_~i~2 := 0; 682#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); 690#L790-2 entry_point_#t~post46 := entry_point_~i~2;entry_point_~i~2 := 1 + entry_point_#t~post46;havoc entry_point_#t~post46; 691#L790-3 assume !(entry_point_~i~2 < entry_point_~len~0); 694#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; 695#L765-3 [2020-07-29 03:27:23,192 INFO L796 eck$LassoCheckResult]: Loop: 695#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; 679#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; 680#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; 685#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); 687#L765-2 alloc_17_#t~post38 := alloc_17_~i~0;alloc_17_~i~0 := 1 + alloc_17_#t~post38;havoc alloc_17_#t~post38; 695#L765-3 [2020-07-29 03:27:23,192 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 03:27:23,193 INFO L82 PathProgramCache]: Analyzing trace with hash 1237061817, now seen corresponding path program 1 times [2020-07-29 03:27:23,193 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 03:27:23,193 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [124536220] [2020-07-29 03:27:23,193 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 03:27:23,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 03:27:23,206 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 03:27:23,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 03:27:23,217 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 03:27:23,223 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 03:27:23,224 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 03:27:23,224 INFO L82 PathProgramCache]: Analyzing trace with hash 74532277, now seen corresponding path program 3 times [2020-07-29 03:27:23,224 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 03:27:23,225 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1182209950] [2020-07-29 03:27:23,225 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 03:27:23,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 03:27:23,232 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 03:27:23,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 03:27:23,237 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 03:27:23,240 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 03:27:23,241 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 03:27:23,241 INFO L82 PathProgramCache]: Analyzing trace with hash -138745859, now seen corresponding path program 1 times [2020-07-29 03:27:23,241 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 03:27:23,242 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2132295364] [2020-07-29 03:27:23,242 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 03:27:23,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 03:27:23,263 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 03:27:23,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 03:27:23,280 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 03:27:23,287 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 03:27:23,441 WARN L193 SmtUtils]: Spent 135.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 74 [2020-07-29 03:27:23,970 WARN L193 SmtUtils]: Spent 427.00 ms on a formula simplification. DAG size of input: 137 DAG size of output: 123 [2020-07-29 03:27:24,189 WARN L193 SmtUtils]: Spent 162.00 ms on a formula simplification that was a NOOP. DAG size: 113 [2020-07-29 03:27:24,193 INFO L210 LassoAnalysis]: Preferences: [2020-07-29 03:27:24,193 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2020-07-29 03:27:24,193 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-07-29 03:27:24,193 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2020-07-29 03:27:24,193 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2020-07-29 03:27:24,194 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 03:27:24,194 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2020-07-29 03:27:24,194 INFO L132 ssoRankerPreferences]: Path of dumped script: [2020-07-29 03:27:24,194 INFO L133 ssoRankerPreferences]: Filename of dumped script: memleaks_test17_2-2.i_Iteration5_Lasso [2020-07-29 03:27:24,194 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2020-07-29 03:27:24,194 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2020-07-29 03:27:24,240 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:27:24,246 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:27:24,249 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:27:24,253 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:27:24,258 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:27:24,261 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:27:24,264 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:27:24,269 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:27:24,272 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:27:24,275 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:27:24,277 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:27:24,282 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:27:24,286 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:27:24,288 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:27:24,292 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:27:24,296 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:27:24,300 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:27:24,738 WARN L193 SmtUtils]: Spent 274.00 ms on a formula simplification. DAG size of input: 96 DAG size of output: 85 [2020-07-29 03:27:24,864 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:27:24,867 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:27:24,871 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:27:24,874 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:27:24,877 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:27:24,882 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:27:24,892 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:27:25,635 WARN L193 SmtUtils]: Spent 206.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 55 [2020-07-29 03:27:25,985 WARN L193 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 26 DAG size of output: 26 [2020-07-29 03:27:26,400 INFO L292 LassoAnalysis]: Preprocessing complete. [2020-07-29 03:27:26,400 INFO L489 LassoAnalysis]: Using template 'affine'. 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) Waiting until toolchain timeout for monitored process 10 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 03:27:26,413 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-07-29 03:27:26,414 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 03:27:26,414 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 03:27:26,414 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 03:27:26,414 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 03:27:26,415 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 03:27:26,415 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 03:27:26,415 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 03:27:26,416 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-07-29 03:27:26,440 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-07-29 03:27:26,441 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 03:27:26,441 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 03:27:26,441 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 03:27:26,441 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 03:27:26,442 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 03:27:26,443 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 03:27:26,443 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 03:27:26,445 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-07-29 03:27:26,478 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-07-29 03:27:26,480 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 03:27:26,480 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 03:27:26,480 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 03:27:26,480 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 03:27:26,481 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-29 03:27:26,482 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-07-29 03:27:26,486 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-07-29 03:27:26,523 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-07-29 03:27:26,525 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 03:27:26,525 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 03:27:26,525 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 03:27:26,525 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 03:27:26,527 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-29 03:27:26,527 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-07-29 03:27:26,533 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 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-07-29 03:27:26,563 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-07-29 03:27:26,564 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 03:27:26,565 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 03:27:26,565 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 03:27:26,565 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 03:27:26,566 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-29 03:27:26,566 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-07-29 03:27:26,569 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 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-07-29 03:27:26,591 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-07-29 03:27:26,593 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 03:27:26,593 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 03:27:26,593 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 03:27:26,593 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 03:27:26,593 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 03:27:26,593 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 03:27:26,594 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 03:27:26,595 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-07-29 03:27:26,619 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-07-29 03:27:26,621 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 03:27:26,621 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 03:27:26,621 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 03:27:26,621 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 03:27:26,622 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-29 03:27:26,622 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-07-29 03:27:26,626 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-07-29 03:27:26,656 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-07-29 03:27:26,657 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 03:27:26,657 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 03:27:26,657 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 03:27:26,657 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 03:27:26,657 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 03:27:26,658 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 03:27:26,658 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 03:27:26,659 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-07-29 03:27:26,684 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-07-29 03:27:26,685 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 03:27:26,685 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 03:27:26,685 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 03:27:26,686 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 03:27:26,686 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 03:27:26,686 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 03:27:26,686 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 03:27:26,692 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) Waiting until toolchain timeout for monitored process 19 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 03:27:26,729 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-07-29 03:27:26,730 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 03:27:26,731 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 03:27:26,731 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 03:27:26,731 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 03:27:26,731 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 03:27:26,731 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 03:27:26,731 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 03:27:26,740 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-07-29 03:27:26,777 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-07-29 03:27:26,781 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 03:27:26,782 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 03:27:26,782 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 03:27:26,782 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 03:27:26,783 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-29 03:27:26,783 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-07-29 03:27:26,787 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-07-29 03:27:26,813 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-07-29 03:27:26,815 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 03:27:26,815 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 03:27:26,815 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 03:27:26,815 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 03:27:26,815 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 03:27:26,816 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 03:27:26,816 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 03:27:26,817 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-07-29 03:27:26,842 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-07-29 03:27:26,844 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 03:27:26,844 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 03:27:26,844 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 03:27:26,844 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 03:27:26,844 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 03:27:26,845 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 03:27:26,845 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 03:27:26,853 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-07-29 03:27:26,874 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-07-29 03:27:26,876 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 03:27:26,876 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 03:27:26,876 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 03:27:26,876 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 03:27:26,878 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-29 03:27:26,878 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-07-29 03:27:26,881 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-07-29 03:27:26,903 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-07-29 03:27:26,904 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 03:27:26,904 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 03:27:26,904 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 03:27:26,904 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 03:27:26,905 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 03:27:26,906 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 03:27:26,906 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 03:27:26,908 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-07-29 03:27:26,931 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-07-29 03:27:26,932 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 03:27:26,933 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 03:27:26,933 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 03:27:26,933 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 03:27:26,933 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 03:27:26,933 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 03:27:26,933 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 03:27:26,934 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-07-29 03:27:26,957 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-07-29 03:27:26,962 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 03:27:26,962 INFO L203 nArgumentSynthesizer]: 2 stem disjuncts [2020-07-29 03:27:26,962 INFO L204 nArgumentSynthesizer]: 2 loop disjuncts [2020-07-29 03:27:26,962 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 03:27:26,979 INFO L401 nArgumentSynthesizer]: We have 20 Motzkin's Theorem applications. [2020-07-29 03:27:26,979 INFO L402 nArgumentSynthesizer]: A total of 4 supporting invariants were added. [2020-07-29 03:27:27,023 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) [2020-07-29 03:27:27,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-07-29 03:27:27,063 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 03:27:27,063 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 03:27:27,063 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 03:27:27,064 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 03:27:27,065 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-29 03:27:27,066 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. Waiting until toolchain timeout for monitored process 27 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 03:27:27,070 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-07-29 03:27:27,096 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-07-29 03:27:27,099 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 03:27:27,099 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 03:27:27,099 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 03:27:27,099 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 03:27:27,100 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-29 03:27:27,101 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-07-29 03:27:27,104 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) [2020-07-29 03:27:27,140 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-07-29 03:27:27,141 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 03:27:27,141 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 03:27:27,141 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 03:27:27,142 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 03:27:27,142 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 03:27:27,142 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 03:27:27,142 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 29 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 03:27:27,149 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-07-29 03:27:27,180 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-07-29 03:27:27,181 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 03:27:27,181 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 03:27:27,181 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 03:27:27,181 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 03:27:27,182 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-29 03:27:27,182 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-07-29 03:27:27,187 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) Waiting until toolchain timeout for monitored process 31 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 03:27:27,214 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-07-29 03:27:27,216 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 03:27:27,216 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 03:27:27,216 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 03:27:27,216 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 03:27:27,216 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 03:27:27,217 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 03:27:27,217 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 03:27:27,218 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 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-07-29 03:27:27,240 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-07-29 03:27:27,242 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 03:27:27,242 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 03:27:27,242 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 03:27:27,242 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 03:27:27,244 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-29 03:27:27,244 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-07-29 03:27:27,247 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 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-07-29 03:27:27,271 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-07-29 03:27:27,272 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 03:27:27,273 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 03:27:27,273 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 03:27:27,273 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 03:27:27,274 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-29 03:27:27,274 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-07-29 03:27:27,278 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-07-29 03:27:27,306 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-07-29 03:27:27,307 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 03:27:27,307 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 03:27:27,307 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 03:27:27,307 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 03:27:27,308 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-29 03:27:27,309 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-07-29 03:27:27,312 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-07-29 03:27:27,334 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-07-29 03:27:27,336 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 03:27:27,336 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 03:27:27,336 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 03:27:27,336 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 03:27:27,336 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 03:27:27,336 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 03:27:27,336 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 03:27:27,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 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-07-29 03:27:27,362 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-07-29 03:27:27,363 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 03:27:27,363 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 03:27:27,363 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 03:27:27,363 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 03:27:27,365 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-29 03:27:27,365 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-07-29 03:27:27,368 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-07-29 03:27:27,391 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-07-29 03:27:27,393 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 03:27:27,393 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 03:27:27,393 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 03:27:27,394 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 03:27:27,406 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-29 03:27:27,406 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-07-29 03:27:27,435 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2020-07-29 03:27:27,472 INFO L443 ModelExtractionUtils]: Simplification made 10 calls to the SMT solver. [2020-07-29 03:27:27,473 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 38 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-07-29 03:27:27,477 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... Waiting until toolchain timeout for monitored process 38 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 03:27:27,481 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2020-07-29 03:27:27,481 INFO L510 LassoAnalysis]: Proved termination. [2020-07-29 03:27:27,481 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-07-29 03:27:27,544 INFO L297 tatePredicateManager]: 9 out of 9 supporting invariants were superfluous and have been removed [2020-07-29 03:27:27,549 INFO L393 LassoCheck]: Loop: "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;" "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;" "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;" "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);" "alloc_17_#t~post38 := alloc_17_~i~0;alloc_17_~i~0 := 1 + alloc_17_#t~post38;havoc alloc_17_#t~post38;" [2020-07-29 03:27:27,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 03:27:27,567 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 03:27:27,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 03:27:27,588 INFO L263 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 2 conjunts are in the unsatisfiable core [2020-07-29 03:27:27,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 03:27:27,597 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 03:27:27,605 INFO L280 TraceCheckUtils]: 0: Hoare triple {780#unseeded} #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); {780#unseeded} is VALID [2020-07-29 03:27:27,606 INFO L280 TraceCheckUtils]: 1: Hoare triple {780#unseeded} 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; {780#unseeded} is VALID [2020-07-29 03:27:27,606 INFO L280 TraceCheckUtils]: 2: Hoare triple {780#unseeded} assume !(ldv_positive_~r~1 > 0);ldv_positive_#res := 1; {780#unseeded} is VALID [2020-07-29 03:27:27,607 INFO L280 TraceCheckUtils]: 3: Hoare triple {780#unseeded} entry_point_#t~ret44 := ldv_positive_#res;entry_point_~len~0 := entry_point_#t~ret44;havoc entry_point_#t~ret44; {780#unseeded} is VALID [2020-07-29 03:27:27,607 INFO L280 TraceCheckUtils]: 4: Hoare triple {780#unseeded} assume !!(entry_point_~len~0 < 16777216); {780#unseeded} is VALID [2020-07-29 03:27:27,608 INFO L280 TraceCheckUtils]: 5: Hoare triple {780#unseeded} 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; {780#unseeded} is VALID [2020-07-29 03:27:27,609 INFO L280 TraceCheckUtils]: 6: Hoare triple {780#unseeded} 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; {780#unseeded} is VALID [2020-07-29 03:27:27,609 INFO L280 TraceCheckUtils]: 7: Hoare triple {780#unseeded} 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; {780#unseeded} is VALID [2020-07-29 03:27:27,609 INFO L280 TraceCheckUtils]: 8: Hoare triple {780#unseeded} assume entry_point_~array~0.base != 0 || entry_point_~array~0.offset != 0;entry_point_~i~2 := 0; {780#unseeded} is VALID [2020-07-29 03:27:27,610 INFO L280 TraceCheckUtils]: 9: Hoare triple {780#unseeded} 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); {780#unseeded} is VALID [2020-07-29 03:27:27,613 INFO L280 TraceCheckUtils]: 10: Hoare triple {780#unseeded} entry_point_#t~post46 := entry_point_~i~2;entry_point_~i~2 := 1 + entry_point_#t~post46;havoc entry_point_#t~post46; {780#unseeded} is VALID [2020-07-29 03:27:27,613 INFO L280 TraceCheckUtils]: 11: Hoare triple {780#unseeded} assume !(entry_point_~i~2 < entry_point_~len~0); {780#unseeded} is VALID [2020-07-29 03:27:27,614 INFO L280 TraceCheckUtils]: 12: Hoare triple {780#unseeded} 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; {780#unseeded} is VALID [2020-07-29 03:27:27,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 03:27:27,623 INFO L263 TraceCheckSpWp]: Trace formula consists of 34 conjuncts, 4 conjunts are in the unsatisfiable core [2020-07-29 03:27:27,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 03:27:27,629 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 03:27:27,650 INFO L280 TraceCheckUtils]: 0: Hoare triple {783#(>= oldRank0 (+ (* (- 1) ULTIMATE.start_alloc_17_~i~0) ULTIMATE.start_alloc_17_~len))} 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; {879#(and (<= ULTIMATE.start_alloc_17_~len (+ oldRank0 ULTIMATE.start_alloc_17_~i~0)) (< ULTIMATE.start_alloc_17_~i~0 ULTIMATE.start_alloc_17_~len))} is VALID [2020-07-29 03:27:27,651 INFO L280 TraceCheckUtils]: 1: Hoare triple {879#(and (<= ULTIMATE.start_alloc_17_~len (+ oldRank0 ULTIMATE.start_alloc_17_~i~0)) (< ULTIMATE.start_alloc_17_~i~0 ULTIMATE.start_alloc_17_~len))} 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; {879#(and (<= ULTIMATE.start_alloc_17_~len (+ oldRank0 ULTIMATE.start_alloc_17_~i~0)) (< ULTIMATE.start_alloc_17_~i~0 ULTIMATE.start_alloc_17_~len))} is VALID [2020-07-29 03:27:27,652 INFO L280 TraceCheckUtils]: 2: Hoare triple {879#(and (<= ULTIMATE.start_alloc_17_~len (+ oldRank0 ULTIMATE.start_alloc_17_~i~0)) (< ULTIMATE.start_alloc_17_~i~0 ULTIMATE.start_alloc_17_~len))} 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; {879#(and (<= ULTIMATE.start_alloc_17_~len (+ oldRank0 ULTIMATE.start_alloc_17_~i~0)) (< ULTIMATE.start_alloc_17_~i~0 ULTIMATE.start_alloc_17_~len))} is VALID [2020-07-29 03:27:27,654 INFO L280 TraceCheckUtils]: 3: Hoare triple {879#(and (<= ULTIMATE.start_alloc_17_~len (+ oldRank0 ULTIMATE.start_alloc_17_~i~0)) (< ULTIMATE.start_alloc_17_~i~0 ULTIMATE.start_alloc_17_~len))} 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); {879#(and (<= ULTIMATE.start_alloc_17_~len (+ oldRank0 ULTIMATE.start_alloc_17_~i~0)) (< ULTIMATE.start_alloc_17_~i~0 ULTIMATE.start_alloc_17_~len))} is VALID [2020-07-29 03:27:27,655 INFO L280 TraceCheckUtils]: 4: Hoare triple {879#(and (<= ULTIMATE.start_alloc_17_~len (+ oldRank0 ULTIMATE.start_alloc_17_~i~0)) (< ULTIMATE.start_alloc_17_~i~0 ULTIMATE.start_alloc_17_~len))} alloc_17_#t~post38 := alloc_17_~i~0;alloc_17_~i~0 := 1 + alloc_17_#t~post38;havoc alloc_17_#t~post38; {838#(or (and (>= oldRank0 0) (> oldRank0 (+ (* (- 1) ULTIMATE.start_alloc_17_~i~0) ULTIMATE.start_alloc_17_~len))) unseeded)} is VALID [2020-07-29 03:27:27,655 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-29 03:27:27,655 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2020-07-29 03:27:27,666 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 18 edges. 18 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-29 03:27:27,666 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 13 letters. Loop has 5 letters. [2020-07-29 03:27:27,667 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:27:27,667 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-07-29 03:27:27,667 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 26 states and 32 transitions. cyclomatic complexity: 10 Second operand 3 states. [2020-07-29 03:27:27,767 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-07-29 03:27:27,767 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-07-29 03:27:27,767 INFO L123 tractBuchiDifference]: Start testing correctness of buchiDifferenceNCSBLazy3 [2020-07-29 03:27:27,767 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 26 states and 32 transitions. cyclomatic complexity: 10 [2020-07-29 03:27:27,767 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 03:27:27,767 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 03:27:27,767 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 3 states. [2020-07-29 03:27:27,769 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2020-07-29 03:27:27,769 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 03:27:27,769 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 03:27:27,769 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 45 states and 58 transitions. [2020-07-29 03:27:27,770 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 6 [2020-07-29 03:27:27,770 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 03:27:27,770 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 03:27:27,770 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 26 states and 32 transitions. cyclomatic complexity: 10 [2020-07-29 03:27:27,771 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 9 examples of accepted words. [2020-07-29 03:27:27,771 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 3 states. [2020-07-29 03:27:27,772 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2020-07-29 03:27:27,773 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 1 examples of accepted words. [2020-07-29 03:27:27,773 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 45 states and 58 transitions. cyclomatic complexity: 21 [2020-07-29 03:27:27,773 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 6 examples of accepted words. [2020-07-29 03:27:27,774 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 26 states and 32 transitions. cyclomatic complexity: 10 Stem has 13 letters. Loop has 5 letters. [2020-07-29 03:27:27,774 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:27:27,774 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 13 letters. Loop has 5 letters. [2020-07-29 03:27:27,774 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:27:27,774 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 45 states and 58 transitions. cyclomatic complexity: 21 Stem has 13 letters. Loop has 5 letters. [2020-07-29 03:27:27,774 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:27:27,775 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 26 states and 32 transitions. cyclomatic complexity: 10 Stem has 1 letters. Loop has 2 letters. [2020-07-29 03:27:27,775 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:27:27,775 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 1 letters. Loop has 2 letters. [2020-07-29 03:27:27,775 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:27:27,775 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 45 states and 58 transitions. cyclomatic complexity: 21 Stem has 1 letters. Loop has 2 letters. [2020-07-29 03:27:27,775 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:27:27,775 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 26 states and 32 transitions. cyclomatic complexity: 10 Stem has 16 letters. Loop has 2 letters. [2020-07-29 03:27:27,775 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:27:27,776 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 16 letters. Loop has 2 letters. [2020-07-29 03:27:27,776 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:27:27,776 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 45 states and 58 transitions. cyclomatic complexity: 21 Stem has 16 letters. Loop has 2 letters. [2020-07-29 03:27:27,776 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:27:27,776 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 26 states and 32 transitions. cyclomatic complexity: 10 Stem has 45 letters. Loop has 45 letters. [2020-07-29 03:27:27,776 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:27:27,776 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 45 letters. Loop has 45 letters. [2020-07-29 03:27:27,777 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:27:27,777 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 45 states and 58 transitions. cyclomatic complexity: 21 Stem has 45 letters. Loop has 45 letters. [2020-07-29 03:27:27,777 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:27:27,777 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 26 states and 32 transitions. cyclomatic complexity: 10 Stem has 26 letters. Loop has 26 letters. [2020-07-29 03:27:27,777 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:27:27,777 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 26 letters. Loop has 26 letters. [2020-07-29 03:27:27,777 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:27:27,777 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 45 states and 58 transitions. cyclomatic complexity: 21 Stem has 26 letters. Loop has 26 letters. [2020-07-29 03:27:27,777 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:27:27,778 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 26 states and 32 transitions. cyclomatic complexity: 10 Stem has 4 letters. Loop has 4 letters. [2020-07-29 03:27:27,778 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:27:27,778 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 4 letters. Loop has 4 letters. [2020-07-29 03:27:27,778 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:27:27,778 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 45 states and 58 transitions. cyclomatic complexity: 21 Stem has 4 letters. Loop has 4 letters. [2020-07-29 03:27:27,778 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:27:27,778 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 26 states and 32 transitions. cyclomatic complexity: 10 Stem has 17 letters. Loop has 2 letters. [2020-07-29 03:27:27,778 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:27:27,779 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 17 letters. Loop has 2 letters. [2020-07-29 03:27:27,779 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:27:27,779 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 45 states and 58 transitions. cyclomatic complexity: 21 Stem has 17 letters. Loop has 2 letters. [2020-07-29 03:27:27,779 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:27:27,779 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 26 states and 32 transitions. cyclomatic complexity: 10 Stem has 16 letters. Loop has 2 letters. [2020-07-29 03:27:27,779 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:27:27,779 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 16 letters. Loop has 2 letters. [2020-07-29 03:27:27,780 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:27:27,780 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 45 states and 58 transitions. cyclomatic complexity: 21 Stem has 16 letters. Loop has 2 letters. [2020-07-29 03:27:27,780 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:27:27,780 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 26 states and 32 transitions. cyclomatic complexity: 10 Stem has 19 letters. Loop has 2 letters. [2020-07-29 03:27:27,780 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:27:27,780 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 19 letters. Loop has 2 letters. [2020-07-29 03:27:27,780 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:27:27,780 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 45 states and 58 transitions. cyclomatic complexity: 21 Stem has 19 letters. Loop has 2 letters. [2020-07-29 03:27:27,781 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:27:27,781 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 26 states and 32 transitions. cyclomatic complexity: 10 Stem has 18 letters. Loop has 2 letters. [2020-07-29 03:27:27,781 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:27:27,781 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 18 letters. Loop has 2 letters. [2020-07-29 03:27:27,781 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:27:27,781 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 45 states and 58 transitions. cyclomatic complexity: 21 Stem has 18 letters. Loop has 2 letters. [2020-07-29 03:27:27,781 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:27:27,782 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 26 states and 32 transitions. cyclomatic complexity: 10 Stem has 14 letters. Loop has 5 letters. [2020-07-29 03:27:27,782 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:27:27,782 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 14 letters. Loop has 5 letters. [2020-07-29 03:27:27,782 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:27:27,782 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 45 states and 58 transitions. cyclomatic complexity: 21 Stem has 14 letters. Loop has 5 letters. [2020-07-29 03:27:27,782 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:27:27,782 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 26 states and 32 transitions. cyclomatic complexity: 10 Stem has 13 letters. Loop has 5 letters. [2020-07-29 03:27:27,783 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:27:27,783 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 13 letters. Loop has 5 letters. [2020-07-29 03:27:27,783 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:27:27,783 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 45 states and 58 transitions. cyclomatic complexity: 21 Stem has 13 letters. Loop has 5 letters. [2020-07-29 03:27:27,783 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:27:27,783 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 26 states and 32 transitions. cyclomatic complexity: 10 Stem has 15 letters. Loop has 5 letters. [2020-07-29 03:27:27,783 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:27:27,784 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 15 letters. Loop has 5 letters. [2020-07-29 03:27:27,784 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:27:27,784 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 45 states and 58 transitions. cyclomatic complexity: 21 Stem has 15 letters. Loop has 5 letters. [2020-07-29 03:27:27,784 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:27:27,784 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 26 states and 32 transitions. cyclomatic complexity: 10 Stem has 16 letters. Loop has 5 letters. [2020-07-29 03:27:27,784 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:27:27,784 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 16 letters. Loop has 5 letters. [2020-07-29 03:27:27,785 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:27:27,785 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 45 states and 58 transitions. cyclomatic complexity: 21 Stem has 16 letters. Loop has 5 letters. [2020-07-29 03:27:27,785 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:27:27,785 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 26 states and 32 transitions. cyclomatic complexity: 10 Stem has 17 letters. Loop has 5 letters. [2020-07-29 03:27:27,785 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:27:27,785 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 17 letters. Loop has 5 letters. [2020-07-29 03:27:27,785 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:27:27,786 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 45 states and 58 transitions. cyclomatic complexity: 21 Stem has 17 letters. Loop has 5 letters. [2020-07-29 03:27:27,786 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:27:27,786 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 26 states and 32 transitions. cyclomatic complexity: 10 Stem has 1 letters. Loop has 2 letters. [2020-07-29 03:27:27,786 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:27:27,786 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 1 letters. Loop has 2 letters. [2020-07-29 03:27:27,786 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:27:27,786 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 45 states and 58 transitions. cyclomatic complexity: 21 Stem has 1 letters. Loop has 2 letters. [2020-07-29 03:27:27,786 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:27:27,787 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 26 states and 32 transitions. cyclomatic complexity: 10 Stem has 17 letters. Loop has 2 letters. [2020-07-29 03:27:27,787 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:27:27,787 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 17 letters. Loop has 2 letters. [2020-07-29 03:27:27,787 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:27:27,787 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 45 states and 58 transitions. cyclomatic complexity: 21 Stem has 17 letters. Loop has 2 letters. [2020-07-29 03:27:27,787 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:27:27,787 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 26 states and 32 transitions. cyclomatic complexity: 10 Stem has 16 letters. Loop has 2 letters. [2020-07-29 03:27:27,787 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:27:27,788 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 16 letters. Loop has 2 letters. [2020-07-29 03:27:27,788 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:27:27,788 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 45 states and 58 transitions. cyclomatic complexity: 21 Stem has 16 letters. Loop has 2 letters. [2020-07-29 03:27:27,788 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:27:27,788 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 26 states and 32 transitions. cyclomatic complexity: 10 Stem has 22 letters. Loop has 2 letters. [2020-07-29 03:27:27,788 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:27:27,788 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 22 letters. Loop has 2 letters. [2020-07-29 03:27:27,789 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:27:27,789 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 45 states and 58 transitions. cyclomatic complexity: 21 Stem has 22 letters. Loop has 2 letters. [2020-07-29 03:27:27,789 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:27:27,789 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 26 states and 32 transitions. cyclomatic complexity: 10 Stem has 21 letters. Loop has 2 letters. [2020-07-29 03:27:27,789 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:27:27,789 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 21 letters. Loop has 2 letters. [2020-07-29 03:27:27,789 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:27:27,789 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 45 states and 58 transitions. cyclomatic complexity: 21 Stem has 21 letters. Loop has 2 letters. [2020-07-29 03:27:27,790 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:27:27,790 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 26 states and 32 transitions. cyclomatic complexity: 10 Stem has 18 letters. Loop has 2 letters. [2020-07-29 03:27:27,790 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:27:27,790 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 18 letters. Loop has 2 letters. [2020-07-29 03:27:27,790 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:27:27,790 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 45 states and 58 transitions. cyclomatic complexity: 21 Stem has 18 letters. Loop has 2 letters. [2020-07-29 03:27:27,790 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:27:27,791 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 26 states and 32 transitions. cyclomatic complexity: 10 Stem has 19 letters. Loop has 2 letters. [2020-07-29 03:27:27,791 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:27:27,791 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 19 letters. Loop has 2 letters. [2020-07-29 03:27:27,791 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:27:27,791 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 45 states and 58 transitions. cyclomatic complexity: 21 Stem has 19 letters. Loop has 2 letters. [2020-07-29 03:27:27,791 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:27:27,791 INFO L161 tractBuchiDifference]: Finished testing correctness of buchiDifferenceNCSBLazy3 [2020-07-29 03:27:27,792 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-29 03:27:27,792 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 34 transitions. [2020-07-29 03:27:27,793 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 34 transitions. Stem has 13 letters. Loop has 5 letters. [2020-07-29 03:27:27,793 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:27:27,793 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 34 transitions. Stem has 18 letters. Loop has 5 letters. [2020-07-29 03:27:27,793 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:27:27,793 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 34 transitions. Stem has 13 letters. Loop has 10 letters. [2020-07-29 03:27:27,793 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:27:27,793 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 45 states and 58 transitions. cyclomatic complexity: 21 [2020-07-29 03:27:27,795 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 6 [2020-07-29 03:27:27,797 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 45 states to 33 states and 42 transitions. [2020-07-29 03:27:27,797 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 24 [2020-07-29 03:27:27,797 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 26 [2020-07-29 03:27:27,797 INFO L73 IsDeterministic]: Start isDeterministic. Operand 33 states and 42 transitions. [2020-07-29 03:27:27,797 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-07-29 03:27:27,797 INFO L688 BuchiCegarLoop]: Abstraction has 33 states and 42 transitions. [2020-07-29 03:27:27,797 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states and 42 transitions. [2020-07-29 03:27:27,799 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 30. [2020-07-29 03:27:27,800 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-29 03:27:27,800 INFO L82 GeneralOperation]: Start isEquivalent. First operand 33 states and 42 transitions. Second operand 30 states. [2020-07-29 03:27:27,800 INFO L74 IsIncluded]: Start isIncluded. First operand 33 states and 42 transitions. Second operand 30 states. [2020-07-29 03:27:27,800 INFO L87 Difference]: Start difference. First operand 33 states and 42 transitions. Second operand 30 states. [2020-07-29 03:27:27,801 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2020-07-29 03:27:27,804 INFO L93 Difference]: Finished difference Result 33 states and 42 transitions. [2020-07-29 03:27:27,804 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 42 transitions. [2020-07-29 03:27:27,804 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 03:27:27,804 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 03:27:27,805 INFO L74 IsIncluded]: Start isIncluded. First operand 30 states. Second operand 33 states and 42 transitions. [2020-07-29 03:27:27,805 INFO L87 Difference]: Start difference. First operand 30 states. Second operand 33 states and 42 transitions. [2020-07-29 03:27:27,805 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2020-07-29 03:27:27,807 INFO L93 Difference]: Finished difference Result 33 states and 42 transitions. [2020-07-29 03:27:27,808 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 42 transitions. [2020-07-29 03:27:27,808 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 03:27:27,808 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 03:27:27,808 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-29 03:27:27,808 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-29 03:27:27,808 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2020-07-29 03:27:27,809 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 39 transitions. [2020-07-29 03:27:27,809 INFO L711 BuchiCegarLoop]: Abstraction has 30 states and 39 transitions. [2020-07-29 03:27:27,810 INFO L591 BuchiCegarLoop]: Abstraction has 30 states and 39 transitions. [2020-07-29 03:27:27,810 INFO L424 BuchiCegarLoop]: ======== Iteration 6============ [2020-07-29 03:27:27,810 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 30 states and 39 transitions. [2020-07-29 03:27:27,810 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 4 [2020-07-29 03:27:27,810 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 03:27:27,810 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 03:27:27,811 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-29 03:27:27,811 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2020-07-29 03:27:27,811 INFO L794 eck$LassoCheckResult]: Stem: 973#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); 962#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; 963#L520 assume !(ldv_positive_~r~1 > 0);ldv_positive_#res := 1; 964#L521 entry_point_#t~ret44 := ldv_positive_#res;entry_point_~len~0 := entry_point_#t~ret44;havoc entry_point_#t~ret44; 965#L787 assume !!(entry_point_~len~0 < 16777216); 974#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; 946#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; 947#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; 952#L789 assume entry_point_~array~0.base != 0 || entry_point_~array~0.offset != 0;entry_point_~i~2 := 0; 953#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); 960#L790-2 entry_point_#t~post46 := entry_point_~i~2;entry_point_~i~2 := 1 + entry_point_#t~post46;havoc entry_point_#t~post46; 961#L790-3 assume !(entry_point_~i~2 < entry_point_~len~0); 966#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; 967#L765-3 assume !(alloc_17_~i~0 < alloc_17_~len); 968#L765-4 alloc_17_#res := 0; 969#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; 955#L780-3 [2020-07-29 03:27:27,811 INFO L796 eck$LassoCheckResult]: Loop: 955#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; 954#L780-2 free_17_#t~post42 := free_17_~i~1;free_17_~i~1 := 1 + free_17_#t~post42;havoc free_17_#t~post42; 955#L780-3 [2020-07-29 03:27:27,811 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 03:27:27,812 INFO L82 PathProgramCache]: Analyzing trace with hash -1805730393, now seen corresponding path program 1 times [2020-07-29 03:27:27,812 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 03:27:27,812 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1810607899] [2020-07-29 03:27:27,812 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 03:27:27,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 03:27:27,868 INFO L280 TraceCheckUtils]: 0: Hoare triple {1134#true} #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); {1134#true} is VALID [2020-07-29 03:27:27,868 INFO L280 TraceCheckUtils]: 1: Hoare triple {1134#true} 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; {1134#true} is VALID [2020-07-29 03:27:27,870 INFO L280 TraceCheckUtils]: 2: Hoare triple {1134#true} assume !(ldv_positive_~r~1 > 0);ldv_positive_#res := 1; {1136#(= 1 |ULTIMATE.start_ldv_positive_#res|)} is VALID [2020-07-29 03:27:27,871 INFO L280 TraceCheckUtils]: 3: Hoare triple {1136#(= 1 |ULTIMATE.start_ldv_positive_#res|)} entry_point_#t~ret44 := ldv_positive_#res;entry_point_~len~0 := entry_point_#t~ret44;havoc entry_point_#t~ret44; {1137#(= 1 ULTIMATE.start_entry_point_~len~0)} is VALID [2020-07-29 03:27:27,872 INFO L280 TraceCheckUtils]: 4: Hoare triple {1137#(= 1 ULTIMATE.start_entry_point_~len~0)} assume !!(entry_point_~len~0 < 16777216); {1137#(= 1 ULTIMATE.start_entry_point_~len~0)} is VALID [2020-07-29 03:27:27,872 INFO L280 TraceCheckUtils]: 5: Hoare triple {1137#(= 1 ULTIMATE.start_entry_point_~len~0)} 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; {1137#(= 1 ULTIMATE.start_entry_point_~len~0)} is VALID [2020-07-29 03:27:27,873 INFO L280 TraceCheckUtils]: 6: Hoare triple {1137#(= 1 ULTIMATE.start_entry_point_~len~0)} 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; {1137#(= 1 ULTIMATE.start_entry_point_~len~0)} is VALID [2020-07-29 03:27:27,873 INFO L280 TraceCheckUtils]: 7: Hoare triple {1137#(= 1 ULTIMATE.start_entry_point_~len~0)} 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; {1137#(= 1 ULTIMATE.start_entry_point_~len~0)} is VALID [2020-07-29 03:27:27,874 INFO L280 TraceCheckUtils]: 8: Hoare triple {1137#(= 1 ULTIMATE.start_entry_point_~len~0)} assume entry_point_~array~0.base != 0 || entry_point_~array~0.offset != 0;entry_point_~i~2 := 0; {1137#(= 1 ULTIMATE.start_entry_point_~len~0)} is VALID [2020-07-29 03:27:27,875 INFO L280 TraceCheckUtils]: 9: Hoare triple {1137#(= 1 ULTIMATE.start_entry_point_~len~0)} 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); {1137#(= 1 ULTIMATE.start_entry_point_~len~0)} is VALID [2020-07-29 03:27:27,876 INFO L280 TraceCheckUtils]: 10: Hoare triple {1137#(= 1 ULTIMATE.start_entry_point_~len~0)} entry_point_#t~post46 := entry_point_~i~2;entry_point_~i~2 := 1 + entry_point_#t~post46;havoc entry_point_#t~post46; {1137#(= 1 ULTIMATE.start_entry_point_~len~0)} is VALID [2020-07-29 03:27:27,876 INFO L280 TraceCheckUtils]: 11: Hoare triple {1137#(= 1 ULTIMATE.start_entry_point_~len~0)} assume !(entry_point_~i~2 < entry_point_~len~0); {1137#(= 1 ULTIMATE.start_entry_point_~len~0)} is VALID [2020-07-29 03:27:27,877 INFO L280 TraceCheckUtils]: 12: Hoare triple {1137#(= 1 ULTIMATE.start_entry_point_~len~0)} 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; {1138#(and (= 1 ULTIMATE.start_alloc_17_~len) (= 0 ULTIMATE.start_alloc_17_~i~0))} is VALID [2020-07-29 03:27:27,878 INFO L280 TraceCheckUtils]: 13: Hoare triple {1138#(and (= 1 ULTIMATE.start_alloc_17_~len) (= 0 ULTIMATE.start_alloc_17_~i~0))} assume !(alloc_17_~i~0 < alloc_17_~len); {1135#false} is VALID [2020-07-29 03:27:27,878 INFO L280 TraceCheckUtils]: 14: Hoare triple {1135#false} alloc_17_#res := 0; {1135#false} is VALID [2020-07-29 03:27:27,878 INFO L280 TraceCheckUtils]: 15: Hoare triple {1135#false} 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; {1135#false} is VALID [2020-07-29 03:27:27,879 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2020-07-29 03:27:27,879 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1810607899] [2020-07-29 03:27:27,879 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-29 03:27:27,880 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-07-29 03:27:27,880 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1149018845] [2020-07-29 03:27:27,880 INFO L799 eck$LassoCheckResult]: stem already infeasible [2020-07-29 03:27:27,880 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 03:27:27,880 INFO L82 PathProgramCache]: Analyzing trace with hash 3907, now seen corresponding path program 1 times [2020-07-29 03:27:27,881 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 03:27:27,881 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [981578319] [2020-07-29 03:27:27,881 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 03:27:27,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 03:27:27,886 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 03:27:27,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 03:27:27,888 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 03:27:27,890 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 03:27:27,922 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-29 03:27:27,922 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-07-29 03:27:27,922 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-07-29 03:27:27,922 INFO L87 Difference]: Start difference. First operand 30 states and 39 transitions. cyclomatic complexity: 13 Second operand 5 states. [2020-07-29 03:27:28,213 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 03:27:28,213 INFO L93 Difference]: Finished difference Result 71 states and 90 transitions. [2020-07-29 03:27:28,213 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-07-29 03:27:28,213 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states. [2020-07-29 03:27:28,239 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 16 edges. 16 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-29 03:27:28,240 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 71 states and 90 transitions. [2020-07-29 03:27:28,244 INFO L131 ngComponentsAnalysis]: Automaton has 6 accepting balls. 12 [2020-07-29 03:27:28,246 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 71 states to 71 states and 90 transitions. [2020-07-29 03:27:28,247 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 53 [2020-07-29 03:27:28,248 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 53 [2020-07-29 03:27:28,248 INFO L73 IsDeterministic]: Start isDeterministic. Operand 71 states and 90 transitions. [2020-07-29 03:27:28,248 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-07-29 03:27:28,248 INFO L688 BuchiCegarLoop]: Abstraction has 71 states and 90 transitions. [2020-07-29 03:27:28,248 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states and 90 transitions. [2020-07-29 03:27:28,251 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 41. [2020-07-29 03:27:28,251 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-29 03:27:28,251 INFO L82 GeneralOperation]: Start isEquivalent. First operand 71 states and 90 transitions. Second operand 41 states. [2020-07-29 03:27:28,252 INFO L74 IsIncluded]: Start isIncluded. First operand 71 states and 90 transitions. Second operand 41 states. [2020-07-29 03:27:28,252 INFO L87 Difference]: Start difference. First operand 71 states and 90 transitions. Second operand 41 states. [2020-07-29 03:27:28,253 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2020-07-29 03:27:28,256 INFO L93 Difference]: Finished difference Result 71 states and 90 transitions. [2020-07-29 03:27:28,256 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 90 transitions. [2020-07-29 03:27:28,257 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 03:27:28,257 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 03:27:28,257 INFO L74 IsIncluded]: Start isIncluded. First operand 41 states. Second operand 71 states and 90 transitions. [2020-07-29 03:27:28,257 INFO L87 Difference]: Start difference. First operand 41 states. Second operand 71 states and 90 transitions. [2020-07-29 03:27:28,258 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2020-07-29 03:27:28,263 INFO L93 Difference]: Finished difference Result 71 states and 90 transitions. [2020-07-29 03:27:28,263 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 90 transitions. [2020-07-29 03:27:28,263 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 03:27:28,263 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 03:27:28,264 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-29 03:27:28,264 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-29 03:27:28,264 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2020-07-29 03:27:28,265 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 52 transitions. [2020-07-29 03:27:28,265 INFO L711 BuchiCegarLoop]: Abstraction has 41 states and 52 transitions. [2020-07-29 03:27:28,266 INFO L591 BuchiCegarLoop]: Abstraction has 41 states and 52 transitions. [2020-07-29 03:27:28,266 INFO L424 BuchiCegarLoop]: ======== Iteration 7============ [2020-07-29 03:27:28,266 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 41 states and 52 transitions. [2020-07-29 03:27:28,266 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 4 [2020-07-29 03:27:28,266 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 03:27:28,266 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 03:27:28,267 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-29 03:27:28,267 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2020-07-29 03:27:28,267 INFO L794 eck$LassoCheckResult]: Stem: 1247#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); 1232#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; 1233#L520 assume ldv_positive_~r~1 > 0;ldv_positive_#res := ldv_positive_~r~1; 1250#L521 entry_point_#t~ret44 := ldv_positive_#res;entry_point_~len~0 := entry_point_#t~ret44;havoc entry_point_#t~ret44; 1248#L787 assume !!(entry_point_~len~0 < 16777216); 1249#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; 1216#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; 1217#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; 1222#L789 assume entry_point_~array~0.base != 0 || entry_point_~array~0.offset != 0;entry_point_~i~2 := 0; 1223#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); 1230#L790-2 entry_point_#t~post46 := entry_point_~i~2;entry_point_~i~2 := 1 + entry_point_#t~post46;havoc entry_point_#t~post46; 1231#L790-3 assume !(entry_point_~i~2 < entry_point_~len~0); 1240#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; 1241#L765-3 assume !(alloc_17_~i~0 < alloc_17_~len); 1242#L765-4 alloc_17_#res := 0; 1243#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; 1225#L780-3 [2020-07-29 03:27:28,267 INFO L796 eck$LassoCheckResult]: Loop: 1225#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; 1224#L780-2 free_17_#t~post42 := free_17_~i~1;free_17_~i~1 := 1 + free_17_#t~post42;havoc free_17_#t~post42; 1225#L780-3 [2020-07-29 03:27:28,267 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 03:27:28,267 INFO L82 PathProgramCache]: Analyzing trace with hash -794613143, now seen corresponding path program 1 times [2020-07-29 03:27:28,268 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 03:27:28,268 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1912699015] [2020-07-29 03:27:28,268 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 03:27:28,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 03:27:28,339 INFO L280 TraceCheckUtils]: 0: Hoare triple {1556#true} #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); {1556#true} is VALID [2020-07-29 03:27:28,339 INFO L280 TraceCheckUtils]: 1: Hoare triple {1556#true} 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; {1556#true} is VALID [2020-07-29 03:27:28,340 INFO L280 TraceCheckUtils]: 2: Hoare triple {1556#true} assume ldv_positive_~r~1 > 0;ldv_positive_#res := ldv_positive_~r~1; {1558#(<= 1 |ULTIMATE.start_ldv_positive_#res|)} is VALID [2020-07-29 03:27:28,341 INFO L280 TraceCheckUtils]: 3: Hoare triple {1558#(<= 1 |ULTIMATE.start_ldv_positive_#res|)} entry_point_#t~ret44 := ldv_positive_#res;entry_point_~len~0 := entry_point_#t~ret44;havoc entry_point_#t~ret44; {1559#(<= 1 ULTIMATE.start_entry_point_~len~0)} is VALID [2020-07-29 03:27:28,342 INFO L280 TraceCheckUtils]: 4: Hoare triple {1559#(<= 1 ULTIMATE.start_entry_point_~len~0)} assume !!(entry_point_~len~0 < 16777216); {1559#(<= 1 ULTIMATE.start_entry_point_~len~0)} is VALID [2020-07-29 03:27:28,342 INFO L280 TraceCheckUtils]: 5: Hoare triple {1559#(<= 1 ULTIMATE.start_entry_point_~len~0)} 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; {1559#(<= 1 ULTIMATE.start_entry_point_~len~0)} is VALID [2020-07-29 03:27:28,343 INFO L280 TraceCheckUtils]: 6: Hoare triple {1559#(<= 1 ULTIMATE.start_entry_point_~len~0)} 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; {1559#(<= 1 ULTIMATE.start_entry_point_~len~0)} is VALID [2020-07-29 03:27:28,343 INFO L280 TraceCheckUtils]: 7: Hoare triple {1559#(<= 1 ULTIMATE.start_entry_point_~len~0)} 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; {1559#(<= 1 ULTIMATE.start_entry_point_~len~0)} is VALID [2020-07-29 03:27:28,344 INFO L280 TraceCheckUtils]: 8: Hoare triple {1559#(<= 1 ULTIMATE.start_entry_point_~len~0)} assume entry_point_~array~0.base != 0 || entry_point_~array~0.offset != 0;entry_point_~i~2 := 0; {1559#(<= 1 ULTIMATE.start_entry_point_~len~0)} is VALID [2020-07-29 03:27:28,344 INFO L280 TraceCheckUtils]: 9: Hoare triple {1559#(<= 1 ULTIMATE.start_entry_point_~len~0)} 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); {1559#(<= 1 ULTIMATE.start_entry_point_~len~0)} is VALID [2020-07-29 03:27:28,345 INFO L280 TraceCheckUtils]: 10: Hoare triple {1559#(<= 1 ULTIMATE.start_entry_point_~len~0)} entry_point_#t~post46 := entry_point_~i~2;entry_point_~i~2 := 1 + entry_point_#t~post46;havoc entry_point_#t~post46; {1559#(<= 1 ULTIMATE.start_entry_point_~len~0)} is VALID [2020-07-29 03:27:28,345 INFO L280 TraceCheckUtils]: 11: Hoare triple {1559#(<= 1 ULTIMATE.start_entry_point_~len~0)} assume !(entry_point_~i~2 < entry_point_~len~0); {1559#(<= 1 ULTIMATE.start_entry_point_~len~0)} is VALID [2020-07-29 03:27:28,346 INFO L280 TraceCheckUtils]: 12: Hoare triple {1559#(<= 1 ULTIMATE.start_entry_point_~len~0)} 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; {1560#(and (= 0 ULTIMATE.start_alloc_17_~i~0) (<= 1 ULTIMATE.start_alloc_17_~len))} is VALID [2020-07-29 03:27:28,346 INFO L280 TraceCheckUtils]: 13: Hoare triple {1560#(and (= 0 ULTIMATE.start_alloc_17_~i~0) (<= 1 ULTIMATE.start_alloc_17_~len))} assume !(alloc_17_~i~0 < alloc_17_~len); {1557#false} is VALID [2020-07-29 03:27:28,346 INFO L280 TraceCheckUtils]: 14: Hoare triple {1557#false} alloc_17_#res := 0; {1557#false} is VALID [2020-07-29 03:27:28,347 INFO L280 TraceCheckUtils]: 15: Hoare triple {1557#false} 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; {1557#false} is VALID [2020-07-29 03:27:28,347 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2020-07-29 03:27:28,347 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1912699015] [2020-07-29 03:27:28,347 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-29 03:27:28,348 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-07-29 03:27:28,348 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [676902558] [2020-07-29 03:27:28,348 INFO L799 eck$LassoCheckResult]: stem already infeasible [2020-07-29 03:27:28,348 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 03:27:28,348 INFO L82 PathProgramCache]: Analyzing trace with hash 3907, now seen corresponding path program 2 times [2020-07-29 03:27:28,348 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 03:27:28,349 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [884155482] [2020-07-29 03:27:28,349 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 03:27:28,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 03:27:28,352 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 03:27:28,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 03:27:28,354 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 03:27:28,356 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 03:27:28,393 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-29 03:27:28,393 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-07-29 03:27:28,393 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-07-29 03:27:28,393 INFO L87 Difference]: Start difference. First operand 41 states and 52 transitions. cyclomatic complexity: 16 Second operand 5 states. [2020-07-29 03:27:28,548 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 03:27:28,548 INFO L93 Difference]: Finished difference Result 55 states and 68 transitions. [2020-07-29 03:27:28,548 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-07-29 03:27:28,548 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states. [2020-07-29 03:27:28,582 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 16 edges. 16 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-29 03:27:28,583 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 55 states and 68 transitions. [2020-07-29 03:27:28,585 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 8 [2020-07-29 03:27:28,587 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 55 states to 55 states and 68 transitions. [2020-07-29 03:27:28,587 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 42 [2020-07-29 03:27:28,588 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 42 [2020-07-29 03:27:28,588 INFO L73 IsDeterministic]: Start isDeterministic. Operand 55 states and 68 transitions. [2020-07-29 03:27:28,588 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-07-29 03:27:28,588 INFO L688 BuchiCegarLoop]: Abstraction has 55 states and 68 transitions. [2020-07-29 03:27:28,588 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states and 68 transitions. [2020-07-29 03:27:28,590 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 30. [2020-07-29 03:27:28,590 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-29 03:27:28,590 INFO L82 GeneralOperation]: Start isEquivalent. First operand 55 states and 68 transitions. Second operand 30 states. [2020-07-29 03:27:28,590 INFO L74 IsIncluded]: Start isIncluded. First operand 55 states and 68 transitions. Second operand 30 states. [2020-07-29 03:27:28,590 INFO L87 Difference]: Start difference. First operand 55 states and 68 transitions. Second operand 30 states. [2020-07-29 03:27:28,591 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2020-07-29 03:27:28,594 INFO L93 Difference]: Finished difference Result 55 states and 68 transitions. [2020-07-29 03:27:28,594 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 68 transitions. [2020-07-29 03:27:28,594 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 03:27:28,594 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 03:27:28,594 INFO L74 IsIncluded]: Start isIncluded. First operand 30 states. Second operand 55 states and 68 transitions. [2020-07-29 03:27:28,595 INFO L87 Difference]: Start difference. First operand 30 states. Second operand 55 states and 68 transitions. [2020-07-29 03:27:28,595 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2020-07-29 03:27:28,598 INFO L93 Difference]: Finished difference Result 55 states and 68 transitions. [2020-07-29 03:27:28,598 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 68 transitions. [2020-07-29 03:27:28,598 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 03:27:28,598 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 03:27:28,598 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-29 03:27:28,598 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-29 03:27:28,599 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2020-07-29 03:27:28,599 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 38 transitions. [2020-07-29 03:27:28,600 INFO L711 BuchiCegarLoop]: Abstraction has 30 states and 38 transitions. [2020-07-29 03:27:28,600 INFO L591 BuchiCegarLoop]: Abstraction has 30 states and 38 transitions. [2020-07-29 03:27:28,600 INFO L424 BuchiCegarLoop]: ======== Iteration 8============ [2020-07-29 03:27:28,600 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 30 states and 38 transitions. [2020-07-29 03:27:28,600 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 4 [2020-07-29 03:27:28,600 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 03:27:28,600 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 03:27:28,601 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-29 03:27:28,601 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2020-07-29 03:27:28,601 INFO L794 eck$LassoCheckResult]: Stem: 1649#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); 1636#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; 1637#L520 assume !(ldv_positive_~r~1 > 0);ldv_positive_#res := 1; 1640#L521 entry_point_#t~ret44 := ldv_positive_#res;entry_point_~len~0 := entry_point_#t~ret44;havoc entry_point_#t~ret44; 1641#L787 assume !!(entry_point_~len~0 < 16777216); 1650#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; 1622#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; 1623#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; 1628#L789 assume entry_point_~array~0.base != 0 || entry_point_~array~0.offset != 0;entry_point_~i~2 := 0; 1629#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); 1638#L790-2 entry_point_#t~post46 := entry_point_~i~2;entry_point_~i~2 := 1 + entry_point_#t~post46;havoc entry_point_#t~post46; 1639#L790-3 assume !(entry_point_~i~2 < entry_point_~len~0); 1642#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; 1643#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; 1624#L526-1 assume !(0 != ldv_malloc_#t~nondet11);havoc ldv_malloc_#t~nondet11;ldv_malloc_#res.base, ldv_malloc_#res.offset := 0, 0; 1625#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; 1632#L767 assume alloc_17_~p~0.base == 0 && alloc_17_~p~0.offset == 0; 1633#L767-1 alloc_17_~j~0 := alloc_17_~i~0 - 1; 1647#L772-3 [2020-07-29 03:27:28,601 INFO L796 eck$LassoCheckResult]: Loop: 1647#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); 1646#L772-2 alloc_17_#t~post40 := alloc_17_~j~0;alloc_17_~j~0 := alloc_17_#t~post40 - 1;havoc alloc_17_#t~post40; 1647#L772-3 [2020-07-29 03:27:28,602 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 03:27:28,602 INFO L82 PathProgramCache]: Analyzing trace with hash -138686333, now seen corresponding path program 1 times [2020-07-29 03:27:28,602 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 03:27:28,602 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1907212129] [2020-07-29 03:27:28,602 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 03:27:28,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 03:27:28,612 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 03:27:28,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 03:27:28,621 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 03:27:28,626 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 03:27:28,627 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 03:27:28,627 INFO L82 PathProgramCache]: Analyzing trace with hash 3395, now seen corresponding path program 1 times [2020-07-29 03:27:28,627 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 03:27:28,627 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [291561048] [2020-07-29 03:27:28,627 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 03:27:28,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 03:27:28,631 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 03:27:28,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 03:27:28,634 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 03:27:28,636 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 03:27:28,636 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 03:27:28,636 INFO L82 PathProgramCache]: Analyzing trace with hash -133577403, now seen corresponding path program 1 times [2020-07-29 03:27:28,636 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 03:27:28,637 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1372319926] [2020-07-29 03:27:28,637 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 03:27:28,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 03:27:28,679 INFO L280 TraceCheckUtils]: 0: Hoare triple {1899#true} #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); {1899#true} is VALID [2020-07-29 03:27:28,679 INFO L280 TraceCheckUtils]: 1: Hoare triple {1899#true} 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; {1899#true} is VALID [2020-07-29 03:27:28,679 INFO L280 TraceCheckUtils]: 2: Hoare triple {1899#true} assume !(ldv_positive_~r~1 > 0);ldv_positive_#res := 1; {1899#true} is VALID [2020-07-29 03:27:28,680 INFO L280 TraceCheckUtils]: 3: Hoare triple {1899#true} entry_point_#t~ret44 := ldv_positive_#res;entry_point_~len~0 := entry_point_#t~ret44;havoc entry_point_#t~ret44; {1899#true} is VALID [2020-07-29 03:27:28,680 INFO L280 TraceCheckUtils]: 4: Hoare triple {1899#true} assume !!(entry_point_~len~0 < 16777216); {1899#true} is VALID [2020-07-29 03:27:28,680 INFO L280 TraceCheckUtils]: 5: Hoare triple {1899#true} 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; {1899#true} is VALID [2020-07-29 03:27:28,680 INFO L280 TraceCheckUtils]: 6: Hoare triple {1899#true} 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; {1899#true} is VALID [2020-07-29 03:27:28,681 INFO L280 TraceCheckUtils]: 7: Hoare triple {1899#true} 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; {1899#true} is VALID [2020-07-29 03:27:28,681 INFO L280 TraceCheckUtils]: 8: Hoare triple {1899#true} assume entry_point_~array~0.base != 0 || entry_point_~array~0.offset != 0;entry_point_~i~2 := 0; {1899#true} is VALID [2020-07-29 03:27:28,681 INFO L280 TraceCheckUtils]: 9: Hoare triple {1899#true} 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); {1899#true} is VALID [2020-07-29 03:27:28,681 INFO L280 TraceCheckUtils]: 10: Hoare triple {1899#true} entry_point_#t~post46 := entry_point_~i~2;entry_point_~i~2 := 1 + entry_point_#t~post46;havoc entry_point_#t~post46; {1899#true} is VALID [2020-07-29 03:27:28,682 INFO L280 TraceCheckUtils]: 11: Hoare triple {1899#true} assume !(entry_point_~i~2 < entry_point_~len~0); {1899#true} is VALID [2020-07-29 03:27:28,682 INFO L280 TraceCheckUtils]: 12: Hoare triple {1899#true} 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; {1901#(= 0 ULTIMATE.start_alloc_17_~i~0)} is VALID [2020-07-29 03:27:28,683 INFO L280 TraceCheckUtils]: 13: Hoare triple {1901#(= 0 ULTIMATE.start_alloc_17_~i~0)} 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; {1901#(= 0 ULTIMATE.start_alloc_17_~i~0)} is VALID [2020-07-29 03:27:28,684 INFO L280 TraceCheckUtils]: 14: Hoare triple {1901#(= 0 ULTIMATE.start_alloc_17_~i~0)} assume !(0 != ldv_malloc_#t~nondet11);havoc ldv_malloc_#t~nondet11;ldv_malloc_#res.base, ldv_malloc_#res.offset := 0, 0; {1901#(= 0 ULTIMATE.start_alloc_17_~i~0)} is VALID [2020-07-29 03:27:28,685 INFO L280 TraceCheckUtils]: 15: Hoare triple {1901#(= 0 ULTIMATE.start_alloc_17_~i~0)} 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; {1901#(= 0 ULTIMATE.start_alloc_17_~i~0)} is VALID [2020-07-29 03:27:28,685 INFO L280 TraceCheckUtils]: 16: Hoare triple {1901#(= 0 ULTIMATE.start_alloc_17_~i~0)} assume alloc_17_~p~0.base == 0 && alloc_17_~p~0.offset == 0; {1901#(= 0 ULTIMATE.start_alloc_17_~i~0)} is VALID [2020-07-29 03:27:28,688 INFO L280 TraceCheckUtils]: 17: Hoare triple {1901#(= 0 ULTIMATE.start_alloc_17_~i~0)} alloc_17_~j~0 := alloc_17_~i~0 - 1; {1902#(<= (+ ULTIMATE.start_alloc_17_~j~0 1) 0)} is VALID [2020-07-29 03:27:28,690 INFO L280 TraceCheckUtils]: 18: Hoare triple {1902#(<= (+ ULTIMATE.start_alloc_17_~j~0 1) 0)} 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); {1900#false} is VALID [2020-07-29 03:27:28,690 INFO L280 TraceCheckUtils]: 19: Hoare triple {1900#false} alloc_17_#t~post40 := alloc_17_~j~0;alloc_17_~j~0 := alloc_17_#t~post40 - 1;havoc alloc_17_#t~post40; {1900#false} is VALID [2020-07-29 03:27:28,691 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2020-07-29 03:27:28,691 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1372319926] [2020-07-29 03:27:28,691 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-29 03:27:28,691 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-07-29 03:27:28,692 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [987525245] [2020-07-29 03:27:28,792 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-29 03:27:28,792 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-07-29 03:27:28,792 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-07-29 03:27:28,792 INFO L87 Difference]: Start difference. First operand 30 states and 38 transitions. cyclomatic complexity: 12 Second operand 4 states. [2020-07-29 03:27:28,912 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 03:27:28,912 INFO L93 Difference]: Finished difference Result 46 states and 56 transitions. [2020-07-29 03:27:28,912 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-07-29 03:27:28,912 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states. [2020-07-29 03:27:28,939 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 20 edges. 20 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-29 03:27:28,939 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 46 states and 56 transitions. [2020-07-29 03:27:28,941 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 8 [2020-07-29 03:27:28,942 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 46 states to 46 states and 56 transitions. [2020-07-29 03:27:28,942 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 35 [2020-07-29 03:27:28,942 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 35 [2020-07-29 03:27:28,943 INFO L73 IsDeterministic]: Start isDeterministic. Operand 46 states and 56 transitions. [2020-07-29 03:27:28,943 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-07-29 03:27:28,943 INFO L688 BuchiCegarLoop]: Abstraction has 46 states and 56 transitions. [2020-07-29 03:27:28,943 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states and 56 transitions. [2020-07-29 03:27:28,945 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 35. [2020-07-29 03:27:28,945 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-29 03:27:28,945 INFO L82 GeneralOperation]: Start isEquivalent. First operand 46 states and 56 transitions. Second operand 35 states. [2020-07-29 03:27:28,946 INFO L74 IsIncluded]: Start isIncluded. First operand 46 states and 56 transitions. Second operand 35 states. [2020-07-29 03:27:28,946 INFO L87 Difference]: Start difference. First operand 46 states and 56 transitions. Second operand 35 states. [2020-07-29 03:27:28,946 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2020-07-29 03:27:28,948 INFO L93 Difference]: Finished difference Result 46 states and 56 transitions. [2020-07-29 03:27:28,948 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 56 transitions. [2020-07-29 03:27:28,948 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 03:27:28,949 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 03:27:28,949 INFO L74 IsIncluded]: Start isIncluded. First operand 35 states. Second operand 46 states and 56 transitions. [2020-07-29 03:27:28,949 INFO L87 Difference]: Start difference. First operand 35 states. Second operand 46 states and 56 transitions. [2020-07-29 03:27:28,949 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2020-07-29 03:27:28,951 INFO L93 Difference]: Finished difference Result 46 states and 56 transitions. [2020-07-29 03:27:28,951 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 56 transitions. [2020-07-29 03:27:28,951 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 03:27:28,952 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 03:27:28,952 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-29 03:27:28,952 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-29 03:27:28,952 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2020-07-29 03:27:28,953 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 44 transitions. [2020-07-29 03:27:28,953 INFO L711 BuchiCegarLoop]: Abstraction has 35 states and 44 transitions. [2020-07-29 03:27:28,953 INFO L591 BuchiCegarLoop]: Abstraction has 35 states and 44 transitions. [2020-07-29 03:27:28,953 INFO L424 BuchiCegarLoop]: ======== Iteration 9============ [2020-07-29 03:27:28,953 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 35 states and 44 transitions. [2020-07-29 03:27:28,954 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 4 [2020-07-29 03:27:28,954 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 03:27:28,954 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 03:27:28,954 INFO L849 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-07-29 03:27:28,955 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2020-07-29 03:27:28,955 INFO L794 eck$LassoCheckResult]: Stem: 1979#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); 1965#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; 1966#L520 assume !(ldv_positive_~r~1 > 0);ldv_positive_#res := 1; 1969#L521 entry_point_#t~ret44 := ldv_positive_#res;entry_point_~len~0 := entry_point_#t~ret44;havoc entry_point_#t~ret44; 1970#L787 assume !!(entry_point_~len~0 < 16777216); 1980#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; 1951#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; 1952#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; 1957#L789 assume entry_point_~array~0.base != 0 || entry_point_~array~0.offset != 0;entry_point_~i~2 := 0; 1958#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); 1967#L790-2 entry_point_#t~post46 := entry_point_~i~2;entry_point_~i~2 := 1 + entry_point_#t~post46;havoc entry_point_#t~post46; 1968#L790-3 assume !(entry_point_~i~2 < entry_point_~len~0); 1971#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; 1972#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; 1953#L526-1 assume !(0 != ldv_malloc_#t~nondet11);havoc ldv_malloc_#t~nondet11;ldv_malloc_#res.base, ldv_malloc_#res.offset := 0, 0; 1954#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; 1961#L767 assume alloc_17_~p~0.base == 0 && alloc_17_~p~0.offset == 0; 1962#L767-1 alloc_17_~j~0 := alloc_17_~i~0 - 1; 1977#L772-3 assume !(alloc_17_~j~0 >= 0); 1978#L772-4 alloc_17_#res := 3; 1974#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; 1960#L780-3 [2020-07-29 03:27:28,955 INFO L796 eck$LassoCheckResult]: Loop: 1960#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; 1959#L780-2 free_17_#t~post42 := free_17_~i~1;free_17_~i~1 := 1 + free_17_#t~post42;havoc free_17_#t~post42; 1960#L780-3 [2020-07-29 03:27:28,955 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 03:27:28,956 INFO L82 PathProgramCache]: Analyzing trace with hash 154066089, now seen corresponding path program 1 times [2020-07-29 03:27:28,956 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 03:27:28,956 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2053869562] [2020-07-29 03:27:28,956 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 03:27:28,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 03:27:28,967 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 03:27:28,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 03:27:28,976 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 03:27:28,982 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 03:27:28,983 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 03:27:28,983 INFO L82 PathProgramCache]: Analyzing trace with hash 3907, now seen corresponding path program 3 times [2020-07-29 03:27:28,983 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 03:27:28,983 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2140748143] [2020-07-29 03:27:28,984 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 03:27:28,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 03:27:28,987 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 03:27:28,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 03:27:28,989 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 03:27:28,991 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 03:27:28,991 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 03:27:28,991 INFO L82 PathProgramCache]: Analyzing trace with hash 2028626411, now seen corresponding path program 1 times [2020-07-29 03:27:28,992 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 03:27:28,992 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1916867080] [2020-07-29 03:27:28,992 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 03:27:29,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 03:27:29,005 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 03:27:29,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 03:27:29,017 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 03:27:29,023 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 03:27:29,749 WARN L193 SmtUtils]: Spent 685.00 ms on a formula simplification. DAG size of input: 177 DAG size of output: 157 [2020-07-29 03:27:30,007 WARN L193 SmtUtils]: Spent 210.00 ms on a formula simplification that was a NOOP. DAG size: 132 [2020-07-29 03:27:30,010 INFO L210 LassoAnalysis]: Preferences: [2020-07-29 03:27:30,010 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2020-07-29 03:27:30,010 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-07-29 03:27:30,010 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2020-07-29 03:27:30,010 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2020-07-29 03:27:30,011 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 03:27:30,011 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2020-07-29 03:27:30,011 INFO L132 ssoRankerPreferences]: Path of dumped script: [2020-07-29 03:27:30,011 INFO L133 ssoRankerPreferences]: Filename of dumped script: memleaks_test17_2-2.i_Iteration9_Lasso [2020-07-29 03:27:30,011 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2020-07-29 03:27:30,011 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2020-07-29 03:27:30,049 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:27:30,059 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:27:30,063 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:27:30,068 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:27:30,071 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:27:30,427 WARN L193 SmtUtils]: Spent 214.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 77 [2020-07-29 03:27:30,477 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:27:30,479 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:27:30,483 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:27:30,486 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:27:30,490 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:27:30,494 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:27:30,497 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:27:30,505 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:27:30,509 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:27:30,512 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:27:30,515 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:27:30,518 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:27:30,522 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:27:30,525 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:27:30,527 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:27:30,531 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:27:30,533 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:27:30,536 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:27:30,542 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:27:30,549 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:27:30,553 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:27:30,557 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:27:30,564 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:27:30,566 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:27:30,572 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:27:30,575 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:27:30,579 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:27:31,074 WARN L193 SmtUtils]: Spent 107.00 ms on a formula simplification that was a NOOP. DAG size: 58 [2020-07-29 03:27:31,651 WARN L193 SmtUtils]: Spent 128.00 ms on a formula simplification. DAG size of input: 26 DAG size of output: 26 [2020-07-29 03:27:31,888 INFO L292 LassoAnalysis]: Preprocessing complete. [2020-07-29 03:27:31,888 INFO L489 LassoAnalysis]: Using template 'affine'. 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-07-29 03:27:31,894 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-07-29 03:27:31,895 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 03:27:31,895 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 03:27:31,895 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 03:27:31,895 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 03:27:31,895 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 03:27:31,896 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 03:27:31,896 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 03:27:31,897 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 40 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-07-29 03:27:31,920 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-07-29 03:27:31,922 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 03:27:31,922 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 03:27:31,922 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 03:27:31,922 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 03:27:31,924 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-29 03:27:31,924 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. Waiting until toolchain timeout for monitored process 40 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 03:27:31,926 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 41 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-07-29 03:27:31,948 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 41 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 03:27:31,950 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 03:27:31,950 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 03:27:31,950 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 03:27:31,950 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 03:27:31,950 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 03:27:31,951 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 03:27:31,951 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 03:27:31,952 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 42 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 42 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 03:27:31,973 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-07-29 03:27:31,975 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 03:27:31,975 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 03:27:31,975 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 03:27:31,975 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 03:27:31,976 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-29 03:27:31,977 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-07-29 03:27:31,979 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 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-07-29 03:27:32,004 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-07-29 03:27:32,005 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 03:27:32,005 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 03:27:32,005 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 03:27:32,005 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 03:27:32,006 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-29 03:27:32,006 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-07-29 03:27:32,009 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) Waiting until toolchain timeout for monitored process 44 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 03:27:32,032 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-07-29 03:27:32,033 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 03:27:32,033 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 03:27:32,033 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 03:27:32,033 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 03:27:32,035 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-29 03:27:32,035 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-07-29 03:27:32,041 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-07-29 03:27:32,064 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-07-29 03:27:32,065 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 03:27:32,065 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 03:27:32,065 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 03:27:32,066 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 03:27:32,067 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-29 03:27:32,067 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-07-29 03:27:32,070 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) Waiting until toolchain timeout for monitored process 46 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 03:27:32,092 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-07-29 03:27:32,093 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 03:27:32,093 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 03:27:32,094 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 03:27:32,094 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 03:27:32,094 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-29 03:27:32,095 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-07-29 03:27:32,098 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-07-29 03:27:32,121 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-07-29 03:27:32,122 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 03:27:32,122 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 03:27:32,122 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 03:27:32,123 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 03:27:32,124 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-29 03:27:32,124 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-07-29 03:27:32,127 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) [2020-07-29 03:27:32,150 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-07-29 03:27:32,152 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 03:27:32,152 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 03:27:32,152 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 03:27:32,152 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 03:27:32,154 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-29 03:27:32,154 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. Waiting until toolchain timeout for monitored process 48 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 03:27:32,158 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-07-29 03:27:32,181 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-07-29 03:27:32,182 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 03:27:32,183 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 03:27:32,183 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 03:27:32,183 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 03:27:32,183 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 03:27:32,183 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 03:27:32,183 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 03:27:32,184 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-07-29 03:27:32,207 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-07-29 03:27:32,208 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 03:27:32,209 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 03:27:32,209 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 03:27:32,209 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 03:27:32,216 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-29 03:27:32,217 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-07-29 03:27:32,243 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2020-07-29 03:27:32,305 INFO L443 ModelExtractionUtils]: Simplification made 25 calls to the SMT solver. [2020-07-29 03:27:32,305 INFO L444 ModelExtractionUtils]: 17 out of 52 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 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-07-29 03:27:32,308 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2020-07-29 03:27:32,309 INFO L438 nArgumentSynthesizer]: Removed 1 redundant supporting invariants from a total of 2. [2020-07-29 03:27:32,310 INFO L510 LassoAnalysis]: Proved termination. [2020-07-29 03:27:32,310 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select #length ULTIMATE.start_free_17_~array.base)_1, ULTIMATE.start_free_17_~i~1) = 1*v_rep(select #length ULTIMATE.start_free_17_~array.base)_1 - 4*ULTIMATE.start_free_17_~i~1 Supporting invariants [1*ULTIMATE.start_free_17_~array.offset >= 0] [2020-07-29 03:27:32,370 INFO L297 tatePredicateManager]: 9 out of 10 supporting invariants were superfluous and have been removed [2020-07-29 03:27:32,374 INFO L393 LassoCheck]: Loop: "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;" "free_17_#t~post42 := free_17_~i~1;free_17_~i~1 := 1 + free_17_#t~post42;havoc free_17_#t~post42;" [2020-07-29 03:27:32,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 03:27:32,379 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-29 03:27:32,406 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 03:27:32,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 03:27:32,434 INFO L263 TraceCheckSpWp]: Trace formula consists of 118 conjuncts, 7 conjunts are in the unsatisfiable core [2020-07-29 03:27:32,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 03:27:32,445 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 03:27:32,517 INFO L280 TraceCheckUtils]: 0: Hoare triple {2191#unseeded} #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); {2191#unseeded} is VALID [2020-07-29 03:27:32,517 INFO L280 TraceCheckUtils]: 1: Hoare triple {2191#unseeded} 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; {2191#unseeded} is VALID [2020-07-29 03:27:32,518 INFO L280 TraceCheckUtils]: 2: Hoare triple {2191#unseeded} assume !(ldv_positive_~r~1 > 0);ldv_positive_#res := 1; {2191#unseeded} is VALID [2020-07-29 03:27:32,519 INFO L280 TraceCheckUtils]: 3: Hoare triple {2191#unseeded} entry_point_#t~ret44 := ldv_positive_#res;entry_point_~len~0 := entry_point_#t~ret44;havoc entry_point_#t~ret44; {2191#unseeded} is VALID [2020-07-29 03:27:32,520 INFO L280 TraceCheckUtils]: 4: Hoare triple {2191#unseeded} assume !!(entry_point_~len~0 < 16777216); {2191#unseeded} is VALID [2020-07-29 03:27:32,520 INFO L280 TraceCheckUtils]: 5: Hoare triple {2191#unseeded} 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; {2191#unseeded} is VALID [2020-07-29 03:27:32,521 INFO L280 TraceCheckUtils]: 6: Hoare triple {2191#unseeded} 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; {2282#(and (<= 0 |ULTIMATE.start_ldv_malloc_#res.offset|) unseeded)} is VALID [2020-07-29 03:27:32,522 INFO L280 TraceCheckUtils]: 7: Hoare triple {2282#(and (<= 0 |ULTIMATE.start_ldv_malloc_#res.offset|) unseeded)} 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; {2286#(and (<= 0 ULTIMATE.start_entry_point_~array~0.offset) unseeded)} is VALID [2020-07-29 03:27:32,527 INFO L280 TraceCheckUtils]: 8: Hoare triple {2286#(and (<= 0 ULTIMATE.start_entry_point_~array~0.offset) unseeded)} assume entry_point_~array~0.base != 0 || entry_point_~array~0.offset != 0;entry_point_~i~2 := 0; {2286#(and (<= 0 ULTIMATE.start_entry_point_~array~0.offset) unseeded)} is VALID [2020-07-29 03:27:32,529 INFO L280 TraceCheckUtils]: 9: Hoare triple {2286#(and (<= 0 ULTIMATE.start_entry_point_~array~0.offset) unseeded)} 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); {2286#(and (<= 0 ULTIMATE.start_entry_point_~array~0.offset) unseeded)} is VALID [2020-07-29 03:27:32,529 INFO L280 TraceCheckUtils]: 10: Hoare triple {2286#(and (<= 0 ULTIMATE.start_entry_point_~array~0.offset) unseeded)} entry_point_#t~post46 := entry_point_~i~2;entry_point_~i~2 := 1 + entry_point_#t~post46;havoc entry_point_#t~post46; {2286#(and (<= 0 ULTIMATE.start_entry_point_~array~0.offset) unseeded)} is VALID [2020-07-29 03:27:32,530 INFO L280 TraceCheckUtils]: 11: Hoare triple {2286#(and (<= 0 ULTIMATE.start_entry_point_~array~0.offset) unseeded)} assume !(entry_point_~i~2 < entry_point_~len~0); {2286#(and (<= 0 ULTIMATE.start_entry_point_~array~0.offset) unseeded)} is VALID [2020-07-29 03:27:32,531 INFO L280 TraceCheckUtils]: 12: Hoare triple {2286#(and (<= 0 ULTIMATE.start_entry_point_~array~0.offset) unseeded)} 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; {2286#(and (<= 0 ULTIMATE.start_entry_point_~array~0.offset) unseeded)} is VALID [2020-07-29 03:27:32,532 INFO L280 TraceCheckUtils]: 13: Hoare triple {2286#(and (<= 0 ULTIMATE.start_entry_point_~array~0.offset) unseeded)} 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; {2286#(and (<= 0 ULTIMATE.start_entry_point_~array~0.offset) unseeded)} is VALID [2020-07-29 03:27:32,532 INFO L280 TraceCheckUtils]: 14: Hoare triple {2286#(and (<= 0 ULTIMATE.start_entry_point_~array~0.offset) unseeded)} assume !(0 != ldv_malloc_#t~nondet11);havoc ldv_malloc_#t~nondet11;ldv_malloc_#res.base, ldv_malloc_#res.offset := 0, 0; {2286#(and (<= 0 ULTIMATE.start_entry_point_~array~0.offset) unseeded)} is VALID [2020-07-29 03:27:32,533 INFO L280 TraceCheckUtils]: 15: Hoare triple {2286#(and (<= 0 ULTIMATE.start_entry_point_~array~0.offset) unseeded)} 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; {2286#(and (<= 0 ULTIMATE.start_entry_point_~array~0.offset) unseeded)} is VALID [2020-07-29 03:27:32,534 INFO L280 TraceCheckUtils]: 16: Hoare triple {2286#(and (<= 0 ULTIMATE.start_entry_point_~array~0.offset) unseeded)} assume alloc_17_~p~0.base == 0 && alloc_17_~p~0.offset == 0; {2286#(and (<= 0 ULTIMATE.start_entry_point_~array~0.offset) unseeded)} is VALID [2020-07-29 03:27:32,534 INFO L280 TraceCheckUtils]: 17: Hoare triple {2286#(and (<= 0 ULTIMATE.start_entry_point_~array~0.offset) unseeded)} alloc_17_~j~0 := alloc_17_~i~0 - 1; {2286#(and (<= 0 ULTIMATE.start_entry_point_~array~0.offset) unseeded)} is VALID [2020-07-29 03:27:32,535 INFO L280 TraceCheckUtils]: 18: Hoare triple {2286#(and (<= 0 ULTIMATE.start_entry_point_~array~0.offset) unseeded)} assume !(alloc_17_~j~0 >= 0); {2286#(and (<= 0 ULTIMATE.start_entry_point_~array~0.offset) unseeded)} is VALID [2020-07-29 03:27:32,535 INFO L280 TraceCheckUtils]: 19: Hoare triple {2286#(and (<= 0 ULTIMATE.start_entry_point_~array~0.offset) unseeded)} alloc_17_#res := 3; {2286#(and (<= 0 ULTIMATE.start_entry_point_~array~0.offset) unseeded)} is VALID [2020-07-29 03:27:32,536 INFO L280 TraceCheckUtils]: 20: Hoare triple {2286#(and (<= 0 ULTIMATE.start_entry_point_~array~0.offset) unseeded)} 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; {2255#(and unseeded (>= ULTIMATE.start_free_17_~array.offset 0))} is VALID [2020-07-29 03:27:32,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 03:27:32,541 INFO L263 TraceCheckSpWp]: Trace formula consists of 11 conjuncts, 5 conjunts are in the unsatisfiable core [2020-07-29 03:27:32,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 03:27:32,544 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 03:27:32,570 INFO L280 TraceCheckUtils]: 0: Hoare triple {2256#(and (>= oldRank0 (+ (select |#length| ULTIMATE.start_free_17_~array.base) (* (- 4) ULTIMATE.start_free_17_~i~1))) (>= ULTIMATE.start_free_17_~array.offset 0))} 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; {2326#(and (<= 0 ULTIMATE.start_free_17_~array.offset) (<= (select |#length| ULTIMATE.start_free_17_~array.base) (+ oldRank0 (* 4 ULTIMATE.start_free_17_~i~1))) (<= (+ ULTIMATE.start_free_17_~array.offset (* 4 ULTIMATE.start_free_17_~i~1) 4) (select |#length| ULTIMATE.start_free_17_~array.base)))} is VALID [2020-07-29 03:27:32,571 INFO L280 TraceCheckUtils]: 1: Hoare triple {2326#(and (<= 0 ULTIMATE.start_free_17_~array.offset) (<= (select |#length| ULTIMATE.start_free_17_~array.base) (+ oldRank0 (* 4 ULTIMATE.start_free_17_~i~1))) (<= (+ ULTIMATE.start_free_17_~array.offset (* 4 ULTIMATE.start_free_17_~i~1) 4) (select |#length| ULTIMATE.start_free_17_~array.base)))} free_17_#t~post42 := free_17_~i~1;free_17_~i~1 := 1 + free_17_#t~post42;havoc free_17_#t~post42; {2258#(and (or (and (>= oldRank0 0) (> oldRank0 (+ (select |#length| ULTIMATE.start_free_17_~array.base) (* (- 4) ULTIMATE.start_free_17_~i~1)))) unseeded) (>= ULTIMATE.start_free_17_~array.offset 0))} is VALID [2020-07-29 03:27:32,572 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-29 03:27:32,572 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states. [2020-07-29 03:27:32,592 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 23 edges. 23 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-29 03:27:32,592 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 21 letters. Loop has 2 letters. [2020-07-29 03:27:32,593 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:27:32,593 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.3 stem predicates 2 loop predicates [2020-07-29 03:27:32,593 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 35 states and 44 transitions. cyclomatic complexity: 13 Second operand 5 states. [2020-07-29 03:27:32,725 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 35 states and 44 transitions. cyclomatic complexity: 13. Second operand 5 states. Result 37 states and 47 transitions. Complement of second has 7 states. [2020-07-29 03:27:32,725 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 6 states 4 stem states 1 non-accepting loop states 1 accepting loop states [2020-07-29 03:27:32,725 INFO L123 tractBuchiDifference]: Start testing correctness of buchiDifferenceNCSBLazy3 [2020-07-29 03:27:32,726 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 35 states and 44 transitions. cyclomatic complexity: 13 [2020-07-29 03:27:32,726 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 03:27:32,726 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 03:27:32,726 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 5 states. [2020-07-29 03:27:32,728 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2020-07-29 03:27:32,728 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 03:27:32,728 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 03:27:32,728 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 37 states and 47 transitions. [2020-07-29 03:27:32,728 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2020-07-29 03:27:32,729 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 03:27:32,729 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 03:27:32,729 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 35 states and 44 transitions. cyclomatic complexity: 13 [2020-07-29 03:27:32,730 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 4 examples of accepted words. [2020-07-29 03:27:32,730 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 5 states. [2020-07-29 03:27:32,730 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2020-07-29 03:27:32,731 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 1 examples of accepted words. [2020-07-29 03:27:32,731 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 37 states and 47 transitions. cyclomatic complexity: 14 [2020-07-29 03:27:32,731 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 2 examples of accepted words. [2020-07-29 03:27:32,731 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 35 states and 44 transitions. cyclomatic complexity: 13 Stem has 21 letters. Loop has 2 letters. [2020-07-29 03:27:32,731 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:27:32,732 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 21 letters. Loop has 2 letters. [2020-07-29 03:27:32,732 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:27:32,732 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 37 states and 47 transitions. cyclomatic complexity: 14 Stem has 21 letters. Loop has 2 letters. [2020-07-29 03:27:32,732 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:27:32,732 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 35 states and 44 transitions. cyclomatic complexity: 13 Stem has 3 letters. Loop has 2 letters. [2020-07-29 03:27:32,732 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:27:32,732 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 3 letters. Loop has 2 letters. [2020-07-29 03:27:32,732 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:27:32,732 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 37 states and 47 transitions. cyclomatic complexity: 14 Stem has 3 letters. Loop has 2 letters. [2020-07-29 03:27:32,733 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:27:32,733 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 35 states and 44 transitions. cyclomatic complexity: 13 Stem has 23 letters. Loop has 2 letters. [2020-07-29 03:27:32,733 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:27:32,733 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 23 letters. Loop has 2 letters. [2020-07-29 03:27:32,733 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:27:32,733 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 37 states and 47 transitions. cyclomatic complexity: 14 Stem has 23 letters. Loop has 2 letters. [2020-07-29 03:27:32,733 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:27:32,733 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 35 states and 44 transitions. cyclomatic complexity: 13 Stem has 37 letters. Loop has 37 letters. [2020-07-29 03:27:32,734 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:27:32,734 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 37 letters. Loop has 37 letters. [2020-07-29 03:27:32,734 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:27:32,734 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 37 states and 47 transitions. cyclomatic complexity: 14 Stem has 37 letters. Loop has 37 letters. [2020-07-29 03:27:32,734 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:27:32,734 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 35 states and 44 transitions. cyclomatic complexity: 13 Stem has 35 letters. Loop has 35 letters. [2020-07-29 03:27:32,734 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:27:32,734 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 35 letters. Loop has 35 letters. [2020-07-29 03:27:32,735 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:27:32,735 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 37 states and 47 transitions. cyclomatic complexity: 14 Stem has 35 letters. Loop has 35 letters. [2020-07-29 03:27:32,735 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:27:32,735 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 35 states and 44 transitions. cyclomatic complexity: 13 Stem has 6 letters. Loop has 6 letters. [2020-07-29 03:27:32,735 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:27:32,735 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 6 letters. Loop has 6 letters. [2020-07-29 03:27:32,735 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:27:32,735 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 37 states and 47 transitions. cyclomatic complexity: 14 Stem has 6 letters. Loop has 6 letters. [2020-07-29 03:27:32,735 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:27:32,735 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 35 states and 44 transitions. cyclomatic complexity: 13 Stem has 22 letters. Loop has 2 letters. [2020-07-29 03:27:32,736 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:27:32,736 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 22 letters. Loop has 2 letters. [2020-07-29 03:27:32,736 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:27:32,736 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 37 states and 47 transitions. cyclomatic complexity: 14 Stem has 22 letters. Loop has 2 letters. [2020-07-29 03:27:32,736 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:27:32,736 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 35 states and 44 transitions. cyclomatic complexity: 13 Stem has 21 letters. Loop has 2 letters. [2020-07-29 03:27:32,736 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:27:32,736 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 21 letters. Loop has 2 letters. [2020-07-29 03:27:32,737 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:27:32,737 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 37 states and 47 transitions. cyclomatic complexity: 14 Stem has 21 letters. Loop has 2 letters. [2020-07-29 03:27:32,737 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:27:32,737 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 35 states and 44 transitions. cyclomatic complexity: 13 Stem has 24 letters. Loop has 2 letters. [2020-07-29 03:27:32,737 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:27:32,737 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 24 letters. Loop has 2 letters. [2020-07-29 03:27:32,737 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:27:32,738 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 37 states and 47 transitions. cyclomatic complexity: 14 Stem has 24 letters. Loop has 2 letters. [2020-07-29 03:27:32,738 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:27:32,738 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 35 states and 44 transitions. cyclomatic complexity: 13 Stem has 23 letters. Loop has 2 letters. [2020-07-29 03:27:32,738 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:27:32,738 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 23 letters. Loop has 2 letters. [2020-07-29 03:27:32,738 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:27:32,738 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 37 states and 47 transitions. cyclomatic complexity: 14 Stem has 23 letters. Loop has 2 letters. [2020-07-29 03:27:32,738 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:27:32,739 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 35 states and 44 transitions. cyclomatic complexity: 13 Stem has 3 letters. Loop has 2 letters. [2020-07-29 03:27:32,739 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:27:32,739 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 3 letters. Loop has 2 letters. [2020-07-29 03:27:32,739 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:27:32,739 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 37 states and 47 transitions. cyclomatic complexity: 14 Stem has 3 letters. Loop has 2 letters. [2020-07-29 03:27:32,739 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:27:32,739 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 35 states and 44 transitions. cyclomatic complexity: 13 Stem has 23 letters. Loop has 2 letters. [2020-07-29 03:27:32,739 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:27:32,740 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 23 letters. Loop has 2 letters. [2020-07-29 03:27:32,740 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:27:32,740 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 37 states and 47 transitions. cyclomatic complexity: 14 Stem has 23 letters. Loop has 2 letters. [2020-07-29 03:27:32,740 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:27:32,740 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 35 states and 44 transitions. cyclomatic complexity: 13 Stem has 24 letters. Loop has 2 letters. [2020-07-29 03:27:32,740 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:27:32,740 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 24 letters. Loop has 2 letters. [2020-07-29 03:27:32,740 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:27:32,740 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 37 states and 47 transitions. cyclomatic complexity: 14 Stem has 24 letters. Loop has 2 letters. [2020-07-29 03:27:32,741 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:27:32,741 INFO L161 tractBuchiDifference]: Finished testing correctness of buchiDifferenceNCSBLazy3 [2020-07-29 03:27:32,741 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-07-29 03:27:32,741 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 31 transitions. [2020-07-29 03:27:32,741 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 31 transitions. Stem has 21 letters. Loop has 2 letters. [2020-07-29 03:27:32,742 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:27:32,742 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 31 transitions. Stem has 23 letters. Loop has 2 letters. [2020-07-29 03:27:32,742 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:27:32,742 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 31 transitions. Stem has 21 letters. Loop has 4 letters. [2020-07-29 03:27:32,742 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:27:32,742 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 37 states and 47 transitions. cyclomatic complexity: 14 [2020-07-29 03:27:32,743 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2020-07-29 03:27:32,744 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 37 states to 25 states and 30 transitions. [2020-07-29 03:27:32,744 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 18 [2020-07-29 03:27:32,744 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 18 [2020-07-29 03:27:32,744 INFO L73 IsDeterministic]: Start isDeterministic. Operand 25 states and 30 transitions. [2020-07-29 03:27:32,744 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-07-29 03:27:32,744 INFO L688 BuchiCegarLoop]: Abstraction has 25 states and 30 transitions. [2020-07-29 03:27:32,745 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states and 30 transitions. [2020-07-29 03:27:32,746 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 25. [2020-07-29 03:27:32,746 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-29 03:27:32,746 INFO L82 GeneralOperation]: Start isEquivalent. First operand 25 states and 30 transitions. Second operand 25 states. [2020-07-29 03:27:32,746 INFO L74 IsIncluded]: Start isIncluded. First operand 25 states and 30 transitions. Second operand 25 states. [2020-07-29 03:27:32,746 INFO L87 Difference]: Start difference. First operand 25 states and 30 transitions. Second operand 25 states. [2020-07-29 03:27:32,747 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2020-07-29 03:27:32,747 INFO L93 Difference]: Finished difference Result 28 states and 34 transitions. [2020-07-29 03:27:32,748 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 34 transitions. [2020-07-29 03:27:32,748 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 03:27:32,748 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 03:27:32,748 INFO L74 IsIncluded]: Start isIncluded. First operand 25 states. Second operand 25 states and 30 transitions. [2020-07-29 03:27:32,748 INFO L87 Difference]: Start difference. First operand 25 states. Second operand 25 states and 30 transitions. [2020-07-29 03:27:32,748 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2020-07-29 03:27:32,749 INFO L93 Difference]: Finished difference Result 28 states and 34 transitions. [2020-07-29 03:27:32,749 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 34 transitions. [2020-07-29 03:27:32,750 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 03:27:32,750 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 03:27:32,750 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-29 03:27:32,750 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-29 03:27:32,750 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2020-07-29 03:27:32,751 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 30 transitions. [2020-07-29 03:27:32,751 INFO L711 BuchiCegarLoop]: Abstraction has 25 states and 30 transitions. [2020-07-29 03:27:32,751 INFO L591 BuchiCegarLoop]: Abstraction has 25 states and 30 transitions. [2020-07-29 03:27:32,751 INFO L424 BuchiCegarLoop]: ======== Iteration 10============ [2020-07-29 03:27:32,751 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 25 states and 30 transitions. [2020-07-29 03:27:32,751 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2020-07-29 03:27:32,751 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 03:27:32,751 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 03:27:32,752 INFO L849 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-07-29 03:27:32,752 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2020-07-29 03:27:32,752 INFO L794 eck$LassoCheckResult]: Stem: 2401#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); 2395#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; 2396#L520 assume !(ldv_positive_~r~1 > 0);ldv_positive_#res := 1; 2399#L521 entry_point_#t~ret44 := ldv_positive_#res;entry_point_~len~0 := entry_point_#t~ret44;havoc entry_point_#t~ret44; 2400#L787 assume !!(entry_point_~len~0 < 16777216); 2402#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; 2381#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; 2382#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; 2389#L789 assume entry_point_~array~0.base != 0 || entry_point_~array~0.offset != 0;entry_point_~i~2 := 0; 2390#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); 2397#L790-2 entry_point_#t~post46 := entry_point_~i~2;entry_point_~i~2 := 1 + entry_point_#t~post46;havoc entry_point_#t~post46; 2398#L790-3 assume !(entry_point_~i~2 < entry_point_~len~0); 2403#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; 2404#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; 2385#L526-1 assume !(0 != ldv_malloc_#t~nondet11);havoc ldv_malloc_#t~nondet11;ldv_malloc_#res.base, ldv_malloc_#res.offset := 0, 0; 2386#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; 2393#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); 2394#L765-2 alloc_17_#t~post38 := alloc_17_~i~0;alloc_17_~i~0 := 1 + alloc_17_#t~post38;havoc alloc_17_#t~post38; 2405#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; 2383#L526-1 assume !(0 != ldv_malloc_#t~nondet11);havoc ldv_malloc_#t~nondet11;ldv_malloc_#res.base, ldv_malloc_#res.offset := 0, 0; 2384#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; 2391#L767 assume alloc_17_~p~0.base == 0 && alloc_17_~p~0.offset == 0; 2392#L767-1 alloc_17_~j~0 := alloc_17_~i~0 - 1; 2388#L772-3 [2020-07-29 03:27:32,752 INFO L796 eck$LassoCheckResult]: Loop: 2388#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); 2387#L772-2 alloc_17_#t~post40 := alloc_17_~j~0;alloc_17_~j~0 := alloc_17_#t~post40 - 1;havoc alloc_17_#t~post40; 2388#L772-3 [2020-07-29 03:27:32,752 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 03:27:32,753 INFO L82 PathProgramCache]: Analyzing trace with hash -688012863, now seen corresponding path program 1 times [2020-07-29 03:27:32,753 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 03:27:32,753 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [944921200] [2020-07-29 03:27:32,753 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 03:27:32,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 03:27:32,818 INFO L280 TraceCheckUtils]: 0: Hoare triple {2557#true} #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); {2557#true} is VALID [2020-07-29 03:27:32,818 INFO L280 TraceCheckUtils]: 1: Hoare triple {2557#true} 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; {2557#true} is VALID [2020-07-29 03:27:32,818 INFO L280 TraceCheckUtils]: 2: Hoare triple {2557#true} assume !(ldv_positive_~r~1 > 0);ldv_positive_#res := 1; {2557#true} is VALID [2020-07-29 03:27:32,818 INFO L280 TraceCheckUtils]: 3: Hoare triple {2557#true} entry_point_#t~ret44 := ldv_positive_#res;entry_point_~len~0 := entry_point_#t~ret44;havoc entry_point_#t~ret44; {2557#true} is VALID [2020-07-29 03:27:32,819 INFO L280 TraceCheckUtils]: 4: Hoare triple {2557#true} assume !!(entry_point_~len~0 < 16777216); {2557#true} is VALID [2020-07-29 03:27:32,819 INFO L280 TraceCheckUtils]: 5: Hoare triple {2557#true} 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; {2557#true} is VALID [2020-07-29 03:27:32,819 INFO L280 TraceCheckUtils]: 6: Hoare triple {2557#true} 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; {2557#true} is VALID [2020-07-29 03:27:32,820 INFO L280 TraceCheckUtils]: 7: Hoare triple {2557#true} 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; {2557#true} is VALID [2020-07-29 03:27:32,820 INFO L280 TraceCheckUtils]: 8: Hoare triple {2557#true} assume entry_point_~array~0.base != 0 || entry_point_~array~0.offset != 0;entry_point_~i~2 := 0; {2557#true} is VALID [2020-07-29 03:27:32,820 INFO L280 TraceCheckUtils]: 9: Hoare triple {2557#true} 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); {2557#true} is VALID [2020-07-29 03:27:32,820 INFO L280 TraceCheckUtils]: 10: Hoare triple {2557#true} entry_point_#t~post46 := entry_point_~i~2;entry_point_~i~2 := 1 + entry_point_#t~post46;havoc entry_point_#t~post46; {2557#true} is VALID [2020-07-29 03:27:32,820 INFO L280 TraceCheckUtils]: 11: Hoare triple {2557#true} assume !(entry_point_~i~2 < entry_point_~len~0); {2557#true} is VALID [2020-07-29 03:27:32,821 INFO L280 TraceCheckUtils]: 12: Hoare triple {2557#true} 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; {2557#true} is VALID [2020-07-29 03:27:32,821 INFO L280 TraceCheckUtils]: 13: Hoare triple {2557#true} 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; {2557#true} is VALID [2020-07-29 03:27:32,823 INFO L280 TraceCheckUtils]: 14: Hoare triple {2557#true} assume !(0 != ldv_malloc_#t~nondet11);havoc ldv_malloc_#t~nondet11;ldv_malloc_#res.base, ldv_malloc_#res.offset := 0, 0; {2559#(and (= 0 |ULTIMATE.start_ldv_malloc_#res.base|) (= 0 |ULTIMATE.start_ldv_malloc_#res.offset|))} is VALID [2020-07-29 03:27:32,830 INFO L280 TraceCheckUtils]: 15: Hoare triple {2559#(and (= 0 |ULTIMATE.start_ldv_malloc_#res.base|) (= 0 |ULTIMATE.start_ldv_malloc_#res.offset|))} 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; {2560#(and (= 0 ULTIMATE.start_alloc_17_~p~0.base) (= 0 ULTIMATE.start_alloc_17_~p~0.offset))} is VALID [2020-07-29 03:27:32,831 INFO L280 TraceCheckUtils]: 16: Hoare triple {2560#(and (= 0 ULTIMATE.start_alloc_17_~p~0.base) (= 0 ULTIMATE.start_alloc_17_~p~0.offset))} 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); {2558#false} is VALID [2020-07-29 03:27:32,831 INFO L280 TraceCheckUtils]: 17: Hoare triple {2558#false} alloc_17_#t~post38 := alloc_17_~i~0;alloc_17_~i~0 := 1 + alloc_17_#t~post38;havoc alloc_17_#t~post38; {2558#false} is VALID [2020-07-29 03:27:32,831 INFO L280 TraceCheckUtils]: 18: Hoare triple {2558#false} 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; {2558#false} is VALID [2020-07-29 03:27:32,832 INFO L280 TraceCheckUtils]: 19: Hoare triple {2558#false} assume !(0 != ldv_malloc_#t~nondet11);havoc ldv_malloc_#t~nondet11;ldv_malloc_#res.base, ldv_malloc_#res.offset := 0, 0; {2558#false} is VALID [2020-07-29 03:27:32,832 INFO L280 TraceCheckUtils]: 20: Hoare triple {2558#false} 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; {2558#false} is VALID [2020-07-29 03:27:32,832 INFO L280 TraceCheckUtils]: 21: Hoare triple {2558#false} assume alloc_17_~p~0.base == 0 && alloc_17_~p~0.offset == 0; {2558#false} is VALID [2020-07-29 03:27:32,832 INFO L280 TraceCheckUtils]: 22: Hoare triple {2558#false} alloc_17_~j~0 := alloc_17_~i~0 - 1; {2558#false} is VALID [2020-07-29 03:27:32,833 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2020-07-29 03:27:32,833 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [944921200] [2020-07-29 03:27:32,833 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-29 03:27:32,834 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-07-29 03:27:32,834 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1396266541] [2020-07-29 03:27:32,834 INFO L799 eck$LassoCheckResult]: stem already infeasible [2020-07-29 03:27:32,834 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 03:27:32,834 INFO L82 PathProgramCache]: Analyzing trace with hash 3395, now seen corresponding path program 2 times [2020-07-29 03:27:32,835 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 03:27:32,835 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [730662843] [2020-07-29 03:27:32,835 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 03:27:32,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 03:27:32,843 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 03:27:32,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 03:27:32,853 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 03:27:32,855 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 03:27:32,949 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-29 03:27:32,949 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-07-29 03:27:32,949 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-07-29 03:27:32,949 INFO L87 Difference]: Start difference. First operand 25 states and 30 transitions. cyclomatic complexity: 8 Second operand 4 states. [2020-07-29 03:27:33,039 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 03:27:33,039 INFO L93 Difference]: Finished difference Result 32 states and 36 transitions. [2020-07-29 03:27:33,039 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-07-29 03:27:33,039 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states. [2020-07-29 03:27:33,067 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 23 edges. 23 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-29 03:27:33,067 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 32 states and 36 transitions. [2020-07-29 03:27:33,068 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 4 [2020-07-29 03:27:33,069 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 32 states to 30 states and 34 transitions. [2020-07-29 03:27:33,069 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 23 [2020-07-29 03:27:33,070 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 23 [2020-07-29 03:27:33,070 INFO L73 IsDeterministic]: Start isDeterministic. Operand 30 states and 34 transitions. [2020-07-29 03:27:33,070 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-07-29 03:27:33,070 INFO L688 BuchiCegarLoop]: Abstraction has 30 states and 34 transitions. [2020-07-29 03:27:33,070 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states and 34 transitions. [2020-07-29 03:27:33,071 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 25. [2020-07-29 03:27:33,072 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-29 03:27:33,072 INFO L82 GeneralOperation]: Start isEquivalent. First operand 30 states and 34 transitions. Second operand 25 states. [2020-07-29 03:27:33,072 INFO L74 IsIncluded]: Start isIncluded. First operand 30 states and 34 transitions. Second operand 25 states. [2020-07-29 03:27:33,072 INFO L87 Difference]: Start difference. First operand 30 states and 34 transitions. Second operand 25 states. [2020-07-29 03:27:33,072 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2020-07-29 03:27:33,073 INFO L93 Difference]: Finished difference Result 33 states and 37 transitions. [2020-07-29 03:27:33,073 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 37 transitions. [2020-07-29 03:27:33,074 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 03:27:33,074 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 03:27:33,074 INFO L74 IsIncluded]: Start isIncluded. First operand 25 states. Second operand 30 states and 34 transitions. [2020-07-29 03:27:33,074 INFO L87 Difference]: Start difference. First operand 25 states. Second operand 30 states and 34 transitions. [2020-07-29 03:27:33,074 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2020-07-29 03:27:33,075 INFO L93 Difference]: Finished difference Result 33 states and 37 transitions. [2020-07-29 03:27:33,075 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 37 transitions. [2020-07-29 03:27:33,076 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 03:27:33,076 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 03:27:33,076 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-29 03:27:33,076 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-29 03:27:33,076 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2020-07-29 03:27:33,076 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 29 transitions. [2020-07-29 03:27:33,077 INFO L711 BuchiCegarLoop]: Abstraction has 25 states and 29 transitions. [2020-07-29 03:27:33,077 INFO L591 BuchiCegarLoop]: Abstraction has 25 states and 29 transitions. [2020-07-29 03:27:33,077 INFO L424 BuchiCegarLoop]: ======== Iteration 11============ [2020-07-29 03:27:33,077 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 25 states and 29 transitions. [2020-07-29 03:27:33,077 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2020-07-29 03:27:33,077 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 03:27:33,077 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 03:27:33,078 INFO L849 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-07-29 03:27:33,078 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2020-07-29 03:27:33,078 INFO L794 eck$LassoCheckResult]: Stem: 2617#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); 2611#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; 2612#L520 assume !(ldv_positive_~r~1 > 0);ldv_positive_#res := 1; 2615#L521 entry_point_#t~ret44 := ldv_positive_#res;entry_point_~len~0 := entry_point_#t~ret44;havoc entry_point_#t~ret44; 2616#L787 assume !!(entry_point_~len~0 < 16777216); 2618#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; 2597#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; 2598#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; 2605#L789 assume entry_point_~array~0.base != 0 || entry_point_~array~0.offset != 0;entry_point_~i~2 := 0; 2606#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); 2613#L790-2 entry_point_#t~post46 := entry_point_~i~2;entry_point_~i~2 := 1 + entry_point_#t~post46;havoc entry_point_#t~post46; 2614#L790-3 assume !(entry_point_~i~2 < entry_point_~len~0); 2619#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; 2620#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; 2601#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; 2602#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; 2609#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); 2610#L765-2 alloc_17_#t~post38 := alloc_17_~i~0;alloc_17_~i~0 := 1 + alloc_17_#t~post38;havoc alloc_17_#t~post38; 2621#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; 2599#L526-1 assume !(0 != ldv_malloc_#t~nondet11);havoc ldv_malloc_#t~nondet11;ldv_malloc_#res.base, ldv_malloc_#res.offset := 0, 0; 2600#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; 2607#L767 assume alloc_17_~p~0.base == 0 && alloc_17_~p~0.offset == 0; 2608#L767-1 alloc_17_~j~0 := alloc_17_~i~0 - 1; 2604#L772-3 [2020-07-29 03:27:33,078 INFO L796 eck$LassoCheckResult]: Loop: 2604#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); 2603#L772-2 alloc_17_#t~post40 := alloc_17_~j~0;alloc_17_~j~0 := alloc_17_#t~post40 - 1;havoc alloc_17_#t~post40; 2604#L772-3 [2020-07-29 03:27:33,078 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 03:27:33,078 INFO L82 PathProgramCache]: Analyzing trace with hash -1368071233, now seen corresponding path program 1 times [2020-07-29 03:27:33,079 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 03:27:33,079 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [800422935] [2020-07-29 03:27:33,079 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 03:27:33,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 03:27:33,153 INFO L280 TraceCheckUtils]: 0: Hoare triple {2790#true} #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); {2790#true} is VALID [2020-07-29 03:27:33,153 INFO L280 TraceCheckUtils]: 1: Hoare triple {2790#true} 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; {2790#true} is VALID [2020-07-29 03:27:33,155 INFO L280 TraceCheckUtils]: 2: Hoare triple {2790#true} assume !(ldv_positive_~r~1 > 0);ldv_positive_#res := 1; {2792#(= 1 |ULTIMATE.start_ldv_positive_#res|)} is VALID [2020-07-29 03:27:33,155 INFO L280 TraceCheckUtils]: 3: Hoare triple {2792#(= 1 |ULTIMATE.start_ldv_positive_#res|)} entry_point_#t~ret44 := ldv_positive_#res;entry_point_~len~0 := entry_point_#t~ret44;havoc entry_point_#t~ret44; {2793#(= 1 ULTIMATE.start_entry_point_~len~0)} is VALID [2020-07-29 03:27:33,156 INFO L280 TraceCheckUtils]: 4: Hoare triple {2793#(= 1 ULTIMATE.start_entry_point_~len~0)} assume !!(entry_point_~len~0 < 16777216); {2793#(= 1 ULTIMATE.start_entry_point_~len~0)} is VALID [2020-07-29 03:27:33,157 INFO L280 TraceCheckUtils]: 5: Hoare triple {2793#(= 1 ULTIMATE.start_entry_point_~len~0)} 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; {2793#(= 1 ULTIMATE.start_entry_point_~len~0)} is VALID [2020-07-29 03:27:33,157 INFO L280 TraceCheckUtils]: 6: Hoare triple {2793#(= 1 ULTIMATE.start_entry_point_~len~0)} 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; {2793#(= 1 ULTIMATE.start_entry_point_~len~0)} is VALID [2020-07-29 03:27:33,157 INFO L280 TraceCheckUtils]: 7: Hoare triple {2793#(= 1 ULTIMATE.start_entry_point_~len~0)} 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; {2793#(= 1 ULTIMATE.start_entry_point_~len~0)} is VALID [2020-07-29 03:27:33,158 INFO L280 TraceCheckUtils]: 8: Hoare triple {2793#(= 1 ULTIMATE.start_entry_point_~len~0)} assume entry_point_~array~0.base != 0 || entry_point_~array~0.offset != 0;entry_point_~i~2 := 0; {2793#(= 1 ULTIMATE.start_entry_point_~len~0)} is VALID [2020-07-29 03:27:33,158 INFO L280 TraceCheckUtils]: 9: Hoare triple {2793#(= 1 ULTIMATE.start_entry_point_~len~0)} 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); {2793#(= 1 ULTIMATE.start_entry_point_~len~0)} is VALID [2020-07-29 03:27:33,159 INFO L280 TraceCheckUtils]: 10: Hoare triple {2793#(= 1 ULTIMATE.start_entry_point_~len~0)} entry_point_#t~post46 := entry_point_~i~2;entry_point_~i~2 := 1 + entry_point_#t~post46;havoc entry_point_#t~post46; {2793#(= 1 ULTIMATE.start_entry_point_~len~0)} is VALID [2020-07-29 03:27:33,159 INFO L280 TraceCheckUtils]: 11: Hoare triple {2793#(= 1 ULTIMATE.start_entry_point_~len~0)} assume !(entry_point_~i~2 < entry_point_~len~0); {2793#(= 1 ULTIMATE.start_entry_point_~len~0)} is VALID [2020-07-29 03:27:33,160 INFO L280 TraceCheckUtils]: 12: Hoare triple {2793#(= 1 ULTIMATE.start_entry_point_~len~0)} 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; {2794#(and (= 1 ULTIMATE.start_alloc_17_~len) (= 0 ULTIMATE.start_alloc_17_~i~0))} is VALID [2020-07-29 03:27:33,161 INFO L280 TraceCheckUtils]: 13: Hoare triple {2794#(and (= 1 ULTIMATE.start_alloc_17_~len) (= 0 ULTIMATE.start_alloc_17_~i~0))} 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; {2794#(and (= 1 ULTIMATE.start_alloc_17_~len) (= 0 ULTIMATE.start_alloc_17_~i~0))} is VALID [2020-07-29 03:27:33,161 INFO L280 TraceCheckUtils]: 14: Hoare triple {2794#(and (= 1 ULTIMATE.start_alloc_17_~len) (= 0 ULTIMATE.start_alloc_17_~i~0))} 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; {2794#(and (= 1 ULTIMATE.start_alloc_17_~len) (= 0 ULTIMATE.start_alloc_17_~i~0))} is VALID [2020-07-29 03:27:33,162 INFO L280 TraceCheckUtils]: 15: Hoare triple {2794#(and (= 1 ULTIMATE.start_alloc_17_~len) (= 0 ULTIMATE.start_alloc_17_~i~0))} 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; {2794#(and (= 1 ULTIMATE.start_alloc_17_~len) (= 0 ULTIMATE.start_alloc_17_~i~0))} is VALID [2020-07-29 03:27:33,163 INFO L280 TraceCheckUtils]: 16: Hoare triple {2794#(and (= 1 ULTIMATE.start_alloc_17_~len) (= 0 ULTIMATE.start_alloc_17_~i~0))} 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); {2794#(and (= 1 ULTIMATE.start_alloc_17_~len) (= 0 ULTIMATE.start_alloc_17_~i~0))} is VALID [2020-07-29 03:27:33,164 INFO L280 TraceCheckUtils]: 17: Hoare triple {2794#(and (= 1 ULTIMATE.start_alloc_17_~len) (= 0 ULTIMATE.start_alloc_17_~i~0))} alloc_17_#t~post38 := alloc_17_~i~0;alloc_17_~i~0 := 1 + alloc_17_#t~post38;havoc alloc_17_#t~post38; {2795#(and (= 1 ULTIMATE.start_alloc_17_~len) (<= 1 ULTIMATE.start_alloc_17_~i~0))} is VALID [2020-07-29 03:27:33,165 INFO L280 TraceCheckUtils]: 18: Hoare triple {2795#(and (= 1 ULTIMATE.start_alloc_17_~len) (<= 1 ULTIMATE.start_alloc_17_~i~0))} 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; {2791#false} is VALID [2020-07-29 03:27:33,165 INFO L280 TraceCheckUtils]: 19: Hoare triple {2791#false} assume !(0 != ldv_malloc_#t~nondet11);havoc ldv_malloc_#t~nondet11;ldv_malloc_#res.base, ldv_malloc_#res.offset := 0, 0; {2791#false} is VALID [2020-07-29 03:27:33,165 INFO L280 TraceCheckUtils]: 20: Hoare triple {2791#false} 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; {2791#false} is VALID [2020-07-29 03:27:33,166 INFO L280 TraceCheckUtils]: 21: Hoare triple {2791#false} assume alloc_17_~p~0.base == 0 && alloc_17_~p~0.offset == 0; {2791#false} is VALID [2020-07-29 03:27:33,166 INFO L280 TraceCheckUtils]: 22: Hoare triple {2791#false} alloc_17_~j~0 := alloc_17_~i~0 - 1; {2791#false} is VALID [2020-07-29 03:27:33,167 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2020-07-29 03:27:33,168 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [800422935] [2020-07-29 03:27:33,168 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1172532011] [2020-07-29 03:27:33,168 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 52 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 52 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-29 03:27:33,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 03:27:33,234 INFO L263 TraceCheckSpWp]: Trace formula consists of 133 conjuncts, 7 conjunts are in the unsatisfiable core [2020-07-29 03:27:33,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 03:27:33,245 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 03:27:33,421 INFO L280 TraceCheckUtils]: 0: Hoare triple {2790#true} #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); {2790#true} is VALID [2020-07-29 03:27:33,421 INFO L280 TraceCheckUtils]: 1: Hoare triple {2790#true} 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; {2790#true} is VALID [2020-07-29 03:27:33,422 INFO L280 TraceCheckUtils]: 2: Hoare triple {2790#true} assume !(ldv_positive_~r~1 > 0);ldv_positive_#res := 1; {2805#(<= |ULTIMATE.start_ldv_positive_#res| 1)} is VALID [2020-07-29 03:27:33,422 INFO L280 TraceCheckUtils]: 3: Hoare triple {2805#(<= |ULTIMATE.start_ldv_positive_#res| 1)} entry_point_#t~ret44 := ldv_positive_#res;entry_point_~len~0 := entry_point_#t~ret44;havoc entry_point_#t~ret44; {2809#(<= ULTIMATE.start_entry_point_~len~0 1)} is VALID [2020-07-29 03:27:33,423 INFO L280 TraceCheckUtils]: 4: Hoare triple {2809#(<= ULTIMATE.start_entry_point_~len~0 1)} assume !!(entry_point_~len~0 < 16777216); {2809#(<= ULTIMATE.start_entry_point_~len~0 1)} is VALID [2020-07-29 03:27:33,423 INFO L280 TraceCheckUtils]: 5: Hoare triple {2809#(<= ULTIMATE.start_entry_point_~len~0 1)} 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; {2809#(<= ULTIMATE.start_entry_point_~len~0 1)} is VALID [2020-07-29 03:27:33,424 INFO L280 TraceCheckUtils]: 6: Hoare triple {2809#(<= ULTIMATE.start_entry_point_~len~0 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; {2809#(<= ULTIMATE.start_entry_point_~len~0 1)} is VALID [2020-07-29 03:27:33,424 INFO L280 TraceCheckUtils]: 7: Hoare triple {2809#(<= ULTIMATE.start_entry_point_~len~0 1)} 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; {2809#(<= ULTIMATE.start_entry_point_~len~0 1)} is VALID [2020-07-29 03:27:33,425 INFO L280 TraceCheckUtils]: 8: Hoare triple {2809#(<= ULTIMATE.start_entry_point_~len~0 1)} assume entry_point_~array~0.base != 0 || entry_point_~array~0.offset != 0;entry_point_~i~2 := 0; {2809#(<= ULTIMATE.start_entry_point_~len~0 1)} is VALID [2020-07-29 03:27:33,425 INFO L280 TraceCheckUtils]: 9: Hoare triple {2809#(<= ULTIMATE.start_entry_point_~len~0 1)} 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); {2809#(<= ULTIMATE.start_entry_point_~len~0 1)} is VALID [2020-07-29 03:27:33,425 INFO L280 TraceCheckUtils]: 10: Hoare triple {2809#(<= ULTIMATE.start_entry_point_~len~0 1)} entry_point_#t~post46 := entry_point_~i~2;entry_point_~i~2 := 1 + entry_point_#t~post46;havoc entry_point_#t~post46; {2809#(<= ULTIMATE.start_entry_point_~len~0 1)} is VALID [2020-07-29 03:27:33,429 INFO L280 TraceCheckUtils]: 11: Hoare triple {2809#(<= ULTIMATE.start_entry_point_~len~0 1)} assume !(entry_point_~i~2 < entry_point_~len~0); {2809#(<= ULTIMATE.start_entry_point_~len~0 1)} is VALID [2020-07-29 03:27:33,430 INFO L280 TraceCheckUtils]: 12: Hoare triple {2809#(<= ULTIMATE.start_entry_point_~len~0 1)} 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; {2837#(and (<= 0 ULTIMATE.start_alloc_17_~i~0) (<= ULTIMATE.start_alloc_17_~len 1))} is VALID [2020-07-29 03:27:33,432 INFO L280 TraceCheckUtils]: 13: Hoare triple {2837#(and (<= 0 ULTIMATE.start_alloc_17_~i~0) (<= ULTIMATE.start_alloc_17_~len 1))} 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; {2837#(and (<= 0 ULTIMATE.start_alloc_17_~i~0) (<= ULTIMATE.start_alloc_17_~len 1))} is VALID [2020-07-29 03:27:33,432 INFO L280 TraceCheckUtils]: 14: Hoare triple {2837#(and (<= 0 ULTIMATE.start_alloc_17_~i~0) (<= ULTIMATE.start_alloc_17_~len 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; {2837#(and (<= 0 ULTIMATE.start_alloc_17_~i~0) (<= ULTIMATE.start_alloc_17_~len 1))} is VALID [2020-07-29 03:27:33,433 INFO L280 TraceCheckUtils]: 15: Hoare triple {2837#(and (<= 0 ULTIMATE.start_alloc_17_~i~0) (<= ULTIMATE.start_alloc_17_~len 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; {2837#(and (<= 0 ULTIMATE.start_alloc_17_~i~0) (<= ULTIMATE.start_alloc_17_~len 1))} is VALID [2020-07-29 03:27:33,434 INFO L280 TraceCheckUtils]: 16: Hoare triple {2837#(and (<= 0 ULTIMATE.start_alloc_17_~i~0) (<= ULTIMATE.start_alloc_17_~len 1))} 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); {2837#(and (<= 0 ULTIMATE.start_alloc_17_~i~0) (<= ULTIMATE.start_alloc_17_~len 1))} is VALID [2020-07-29 03:27:33,435 INFO L280 TraceCheckUtils]: 17: Hoare triple {2837#(and (<= 0 ULTIMATE.start_alloc_17_~i~0) (<= ULTIMATE.start_alloc_17_~len 1))} alloc_17_#t~post38 := alloc_17_~i~0;alloc_17_~i~0 := 1 + alloc_17_#t~post38;havoc alloc_17_#t~post38; {2853#(and (<= ULTIMATE.start_alloc_17_~len 1) (<= 1 ULTIMATE.start_alloc_17_~i~0))} is VALID [2020-07-29 03:27:33,436 INFO L280 TraceCheckUtils]: 18: Hoare triple {2853#(and (<= ULTIMATE.start_alloc_17_~len 1) (<= 1 ULTIMATE.start_alloc_17_~i~0))} 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; {2791#false} is VALID [2020-07-29 03:27:33,437 INFO L280 TraceCheckUtils]: 19: Hoare triple {2791#false} assume !(0 != ldv_malloc_#t~nondet11);havoc ldv_malloc_#t~nondet11;ldv_malloc_#res.base, ldv_malloc_#res.offset := 0, 0; {2791#false} is VALID [2020-07-29 03:27:33,437 INFO L280 TraceCheckUtils]: 20: Hoare triple {2791#false} 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; {2791#false} is VALID [2020-07-29 03:27:33,437 INFO L280 TraceCheckUtils]: 21: Hoare triple {2791#false} assume alloc_17_~p~0.base == 0 && alloc_17_~p~0.offset == 0; {2791#false} is VALID [2020-07-29 03:27:33,437 INFO L280 TraceCheckUtils]: 22: Hoare triple {2791#false} alloc_17_~j~0 := alloc_17_~i~0 - 1; {2791#false} is VALID [2020-07-29 03:27:33,438 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2020-07-29 03:27:33,438 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2020-07-29 03:27:33,439 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [6] total 10 [2020-07-29 03:27:33,439 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [56613085] [2020-07-29 03:27:33,439 INFO L799 eck$LassoCheckResult]: stem already infeasible [2020-07-29 03:27:33,439 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 03:27:33,439 INFO L82 PathProgramCache]: Analyzing trace with hash 3395, now seen corresponding path program 3 times [2020-07-29 03:27:33,440 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 03:27:33,440 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [765642302] [2020-07-29 03:27:33,440 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 03:27:33,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 03:27:33,451 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 03:27:33,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 03:27:33,453 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 03:27:33,455 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 03:27:33,558 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-29 03:27:33,558 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-07-29 03:27:33,558 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2020-07-29 03:27:33,558 INFO L87 Difference]: Start difference. First operand 25 states and 29 transitions. cyclomatic complexity: 7 Second operand 6 states. [2020-07-29 03:27:33,744 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 03:27:33,744 INFO L93 Difference]: Finished difference Result 41 states and 45 transitions. [2020-07-29 03:27:33,744 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-07-29 03:27:33,744 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states. [2020-07-29 03:27:33,779 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 23 edges. 23 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-29 03:27:33,780 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 41 states and 45 transitions. [2020-07-29 03:27:33,781 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2020-07-29 03:27:33,782 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 41 states to 25 states and 28 transitions. [2020-07-29 03:27:33,782 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 18 [2020-07-29 03:27:33,782 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 18 [2020-07-29 03:27:33,782 INFO L73 IsDeterministic]: Start isDeterministic. Operand 25 states and 28 transitions. [2020-07-29 03:27:33,783 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-07-29 03:27:33,783 INFO L688 BuchiCegarLoop]: Abstraction has 25 states and 28 transitions. [2020-07-29 03:27:33,783 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states and 28 transitions. [2020-07-29 03:27:33,784 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 25. [2020-07-29 03:27:33,784 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-29 03:27:33,784 INFO L82 GeneralOperation]: Start isEquivalent. First operand 25 states and 28 transitions. Second operand 25 states. [2020-07-29 03:27:33,784 INFO L74 IsIncluded]: Start isIncluded. First operand 25 states and 28 transitions. Second operand 25 states. [2020-07-29 03:27:33,784 INFO L87 Difference]: Start difference. First operand 25 states and 28 transitions. Second operand 25 states. [2020-07-29 03:27:33,785 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2020-07-29 03:27:33,785 INFO L93 Difference]: Finished difference Result 30 states and 33 transitions. [2020-07-29 03:27:33,786 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 33 transitions. [2020-07-29 03:27:33,786 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 03:27:33,786 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 03:27:33,786 INFO L74 IsIncluded]: Start isIncluded. First operand 25 states. Second operand 25 states and 28 transitions. [2020-07-29 03:27:33,786 INFO L87 Difference]: Start difference. First operand 25 states. Second operand 25 states and 28 transitions. [2020-07-29 03:27:33,786 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2020-07-29 03:27:33,787 INFO L93 Difference]: Finished difference Result 30 states and 33 transitions. [2020-07-29 03:27:33,787 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 33 transitions. [2020-07-29 03:27:33,787 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 03:27:33,787 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 03:27:33,787 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-29 03:27:33,788 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-29 03:27:33,788 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2020-07-29 03:27:33,788 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 28 transitions. [2020-07-29 03:27:33,788 INFO L711 BuchiCegarLoop]: Abstraction has 25 states and 28 transitions. [2020-07-29 03:27:33,788 INFO L591 BuchiCegarLoop]: Abstraction has 25 states and 28 transitions. [2020-07-29 03:27:33,789 INFO L424 BuchiCegarLoop]: ======== Iteration 12============ [2020-07-29 03:27:33,789 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 25 states and 28 transitions. [2020-07-29 03:27:33,789 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2020-07-29 03:27:33,789 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 03:27:33,789 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 03:27:33,790 INFO L849 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-07-29 03:27:33,790 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2020-07-29 03:27:33,790 INFO L794 eck$LassoCheckResult]: Stem: 2936#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); 2931#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; 2932#L520 assume ldv_positive_~r~1 > 0;ldv_positive_#res := ldv_positive_~r~1; 2933#L521 entry_point_#t~ret44 := ldv_positive_#res;entry_point_~len~0 := entry_point_#t~ret44;havoc entry_point_#t~ret44; 2934#L787 assume !!(entry_point_~len~0 < 16777216); 2937#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; 2915#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; 2916#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; 2923#L789 assume entry_point_~array~0.base != 0 || entry_point_~array~0.offset != 0;entry_point_~i~2 := 0; 2924#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); 2929#L790-2 entry_point_#t~post46 := entry_point_~i~2;entry_point_~i~2 := 1 + entry_point_#t~post46;havoc entry_point_#t~post46; 2930#L790-3 assume !(entry_point_~i~2 < entry_point_~len~0); 2935#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; 2938#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; 2919#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; 2920#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; 2927#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); 2928#L765-2 alloc_17_#t~post38 := alloc_17_~i~0;alloc_17_~i~0 := 1 + alloc_17_#t~post38;havoc alloc_17_#t~post38; 2939#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; 2917#L526-1 assume !(0 != ldv_malloc_#t~nondet11);havoc ldv_malloc_#t~nondet11;ldv_malloc_#res.base, ldv_malloc_#res.offset := 0, 0; 2918#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; 2925#L767 assume alloc_17_~p~0.base == 0 && alloc_17_~p~0.offset == 0; 2926#L767-1 alloc_17_~j~0 := alloc_17_~i~0 - 1; 2922#L772-3 [2020-07-29 03:27:33,790 INFO L796 eck$LassoCheckResult]: Loop: 2922#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); 2921#L772-2 alloc_17_#t~post40 := alloc_17_~j~0;alloc_17_~j~0 := alloc_17_#t~post40 - 1;havoc alloc_17_#t~post40; 2922#L772-3 [2020-07-29 03:27:33,790 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 03:27:33,790 INFO L82 PathProgramCache]: Analyzing trace with hash -1790773059, now seen corresponding path program 1 times [2020-07-29 03:27:33,790 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 03:27:33,791 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [895788167] [2020-07-29 03:27:33,791 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 03:27:33,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 03:27:33,868 INFO L280 TraceCheckUtils]: 0: Hoare triple {3099#true} #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); {3099#true} is VALID [2020-07-29 03:27:33,868 INFO L280 TraceCheckUtils]: 1: Hoare triple {3099#true} 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; {3099#true} is VALID [2020-07-29 03:27:33,868 INFO L280 TraceCheckUtils]: 2: Hoare triple {3099#true} assume ldv_positive_~r~1 > 0;ldv_positive_#res := ldv_positive_~r~1; {3099#true} is VALID [2020-07-29 03:27:33,868 INFO L280 TraceCheckUtils]: 3: Hoare triple {3099#true} entry_point_#t~ret44 := ldv_positive_#res;entry_point_~len~0 := entry_point_#t~ret44;havoc entry_point_#t~ret44; {3099#true} is VALID [2020-07-29 03:27:33,869 INFO L280 TraceCheckUtils]: 4: Hoare triple {3099#true} assume !!(entry_point_~len~0 < 16777216); {3099#true} is VALID [2020-07-29 03:27:33,869 INFO L280 TraceCheckUtils]: 5: Hoare triple {3099#true} 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; {3099#true} is VALID [2020-07-29 03:27:33,869 INFO L280 TraceCheckUtils]: 6: Hoare triple {3099#true} 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; {3099#true} is VALID [2020-07-29 03:27:33,869 INFO L280 TraceCheckUtils]: 7: Hoare triple {3099#true} 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; {3099#true} is VALID [2020-07-29 03:27:33,874 INFO L280 TraceCheckUtils]: 8: Hoare triple {3099#true} assume entry_point_~array~0.base != 0 || entry_point_~array~0.offset != 0;entry_point_~i~2 := 0; {3101#(= ULTIMATE.start_entry_point_~i~2 0)} is VALID [2020-07-29 03:27:33,875 INFO L280 TraceCheckUtils]: 9: Hoare triple {3101#(= ULTIMATE.start_entry_point_~i~2 0)} 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); {3101#(= ULTIMATE.start_entry_point_~i~2 0)} is VALID [2020-07-29 03:27:33,876 INFO L280 TraceCheckUtils]: 10: Hoare triple {3101#(= ULTIMATE.start_entry_point_~i~2 0)} entry_point_#t~post46 := entry_point_~i~2;entry_point_~i~2 := 1 + entry_point_#t~post46;havoc entry_point_#t~post46; {3102#(<= ULTIMATE.start_entry_point_~i~2 1)} is VALID [2020-07-29 03:27:33,879 INFO L280 TraceCheckUtils]: 11: Hoare triple {3102#(<= ULTIMATE.start_entry_point_~i~2 1)} assume !(entry_point_~i~2 < entry_point_~len~0); {3103#(<= ULTIMATE.start_entry_point_~len~0 1)} is VALID [2020-07-29 03:27:33,882 INFO L280 TraceCheckUtils]: 12: Hoare triple {3103#(<= ULTIMATE.start_entry_point_~len~0 1)} 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; {3104#(and (<= ULTIMATE.start_alloc_17_~len 1) (= 0 ULTIMATE.start_alloc_17_~i~0))} is VALID [2020-07-29 03:27:33,884 INFO L280 TraceCheckUtils]: 13: Hoare triple {3104#(and (<= ULTIMATE.start_alloc_17_~len 1) (= 0 ULTIMATE.start_alloc_17_~i~0))} 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; {3104#(and (<= ULTIMATE.start_alloc_17_~len 1) (= 0 ULTIMATE.start_alloc_17_~i~0))} is VALID [2020-07-29 03:27:33,886 INFO L280 TraceCheckUtils]: 14: Hoare triple {3104#(and (<= ULTIMATE.start_alloc_17_~len 1) (= 0 ULTIMATE.start_alloc_17_~i~0))} 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; {3104#(and (<= ULTIMATE.start_alloc_17_~len 1) (= 0 ULTIMATE.start_alloc_17_~i~0))} is VALID [2020-07-29 03:27:33,887 INFO L280 TraceCheckUtils]: 15: Hoare triple {3104#(and (<= ULTIMATE.start_alloc_17_~len 1) (= 0 ULTIMATE.start_alloc_17_~i~0))} 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; {3104#(and (<= ULTIMATE.start_alloc_17_~len 1) (= 0 ULTIMATE.start_alloc_17_~i~0))} is VALID [2020-07-29 03:27:33,891 INFO L280 TraceCheckUtils]: 16: Hoare triple {3104#(and (<= ULTIMATE.start_alloc_17_~len 1) (= 0 ULTIMATE.start_alloc_17_~i~0))} 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); {3104#(and (<= ULTIMATE.start_alloc_17_~len 1) (= 0 ULTIMATE.start_alloc_17_~i~0))} is VALID [2020-07-29 03:27:33,895 INFO L280 TraceCheckUtils]: 17: Hoare triple {3104#(and (<= ULTIMATE.start_alloc_17_~len 1) (= 0 ULTIMATE.start_alloc_17_~i~0))} alloc_17_#t~post38 := alloc_17_~i~0;alloc_17_~i~0 := 1 + alloc_17_#t~post38;havoc alloc_17_#t~post38; {3105#(<= ULTIMATE.start_alloc_17_~len ULTIMATE.start_alloc_17_~i~0)} is VALID [2020-07-29 03:27:33,896 INFO L280 TraceCheckUtils]: 18: Hoare triple {3105#(<= ULTIMATE.start_alloc_17_~len ULTIMATE.start_alloc_17_~i~0)} 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; {3100#false} is VALID [2020-07-29 03:27:33,896 INFO L280 TraceCheckUtils]: 19: Hoare triple {3100#false} assume !(0 != ldv_malloc_#t~nondet11);havoc ldv_malloc_#t~nondet11;ldv_malloc_#res.base, ldv_malloc_#res.offset := 0, 0; {3100#false} is VALID [2020-07-29 03:27:33,896 INFO L280 TraceCheckUtils]: 20: Hoare triple {3100#false} 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; {3100#false} is VALID [2020-07-29 03:27:33,896 INFO L280 TraceCheckUtils]: 21: Hoare triple {3100#false} assume alloc_17_~p~0.base == 0 && alloc_17_~p~0.offset == 0; {3100#false} is VALID [2020-07-29 03:27:33,896 INFO L280 TraceCheckUtils]: 22: Hoare triple {3100#false} alloc_17_~j~0 := alloc_17_~i~0 - 1; {3100#false} is VALID [2020-07-29 03:27:33,898 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-29 03:27:33,898 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [895788167] [2020-07-29 03:27:33,898 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [28036359] [2020-07-29 03:27:33,898 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 53 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 53 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-29 03:27:33,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 03:27:33,967 INFO L263 TraceCheckSpWp]: Trace formula consists of 133 conjuncts, 8 conjunts are in the unsatisfiable core [2020-07-29 03:27:33,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 03:27:33,979 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 03:27:34,372 INFO L280 TraceCheckUtils]: 0: Hoare triple {3099#true} #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); {3099#true} is VALID [2020-07-29 03:27:34,372 INFO L280 TraceCheckUtils]: 1: Hoare triple {3099#true} 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; {3099#true} is VALID [2020-07-29 03:27:34,373 INFO L280 TraceCheckUtils]: 2: Hoare triple {3099#true} assume ldv_positive_~r~1 > 0;ldv_positive_#res := ldv_positive_~r~1; {3099#true} is VALID [2020-07-29 03:27:34,373 INFO L280 TraceCheckUtils]: 3: Hoare triple {3099#true} entry_point_#t~ret44 := ldv_positive_#res;entry_point_~len~0 := entry_point_#t~ret44;havoc entry_point_#t~ret44; {3099#true} is VALID [2020-07-29 03:27:34,373 INFO L280 TraceCheckUtils]: 4: Hoare triple {3099#true} assume !!(entry_point_~len~0 < 16777216); {3099#true} is VALID [2020-07-29 03:27:34,374 INFO L280 TraceCheckUtils]: 5: Hoare triple {3099#true} 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; {3099#true} is VALID [2020-07-29 03:27:34,374 INFO L280 TraceCheckUtils]: 6: Hoare triple {3099#true} 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; {3099#true} is VALID [2020-07-29 03:27:34,375 INFO L280 TraceCheckUtils]: 7: Hoare triple {3099#true} 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; {3099#true} is VALID [2020-07-29 03:27:34,376 INFO L280 TraceCheckUtils]: 8: Hoare triple {3099#true} assume entry_point_~array~0.base != 0 || entry_point_~array~0.offset != 0;entry_point_~i~2 := 0; {3133#(<= ULTIMATE.start_entry_point_~i~2 0)} is VALID [2020-07-29 03:27:34,377 INFO L280 TraceCheckUtils]: 9: Hoare triple {3133#(<= ULTIMATE.start_entry_point_~i~2 0)} 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); {3133#(<= ULTIMATE.start_entry_point_~i~2 0)} is VALID [2020-07-29 03:27:34,378 INFO L280 TraceCheckUtils]: 10: Hoare triple {3133#(<= ULTIMATE.start_entry_point_~i~2 0)} entry_point_#t~post46 := entry_point_~i~2;entry_point_~i~2 := 1 + entry_point_#t~post46;havoc entry_point_#t~post46; {3102#(<= ULTIMATE.start_entry_point_~i~2 1)} is VALID [2020-07-29 03:27:34,379 INFO L280 TraceCheckUtils]: 11: Hoare triple {3102#(<= ULTIMATE.start_entry_point_~i~2 1)} assume !(entry_point_~i~2 < entry_point_~len~0); {3103#(<= ULTIMATE.start_entry_point_~len~0 1)} is VALID [2020-07-29 03:27:34,381 INFO L280 TraceCheckUtils]: 12: Hoare triple {3103#(<= ULTIMATE.start_entry_point_~len~0 1)} 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; {3146#(and (<= 0 ULTIMATE.start_alloc_17_~i~0) (<= ULTIMATE.start_alloc_17_~len 1))} is VALID [2020-07-29 03:27:34,382 INFO L280 TraceCheckUtils]: 13: Hoare triple {3146#(and (<= 0 ULTIMATE.start_alloc_17_~i~0) (<= ULTIMATE.start_alloc_17_~len 1))} 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; {3146#(and (<= 0 ULTIMATE.start_alloc_17_~i~0) (<= ULTIMATE.start_alloc_17_~len 1))} is VALID [2020-07-29 03:27:34,384 INFO L280 TraceCheckUtils]: 14: Hoare triple {3146#(and (<= 0 ULTIMATE.start_alloc_17_~i~0) (<= ULTIMATE.start_alloc_17_~len 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; {3146#(and (<= 0 ULTIMATE.start_alloc_17_~i~0) (<= ULTIMATE.start_alloc_17_~len 1))} is VALID [2020-07-29 03:27:34,385 INFO L280 TraceCheckUtils]: 15: Hoare triple {3146#(and (<= 0 ULTIMATE.start_alloc_17_~i~0) (<= ULTIMATE.start_alloc_17_~len 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; {3146#(and (<= 0 ULTIMATE.start_alloc_17_~i~0) (<= ULTIMATE.start_alloc_17_~len 1))} is VALID [2020-07-29 03:27:34,386 INFO L280 TraceCheckUtils]: 16: Hoare triple {3146#(and (<= 0 ULTIMATE.start_alloc_17_~i~0) (<= ULTIMATE.start_alloc_17_~len 1))} 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); {3146#(and (<= 0 ULTIMATE.start_alloc_17_~i~0) (<= ULTIMATE.start_alloc_17_~len 1))} is VALID [2020-07-29 03:27:34,387 INFO L280 TraceCheckUtils]: 17: Hoare triple {3146#(and (<= 0 ULTIMATE.start_alloc_17_~i~0) (<= ULTIMATE.start_alloc_17_~len 1))} alloc_17_#t~post38 := alloc_17_~i~0;alloc_17_~i~0 := 1 + alloc_17_#t~post38;havoc alloc_17_#t~post38; {3162#(and (<= ULTIMATE.start_alloc_17_~len 1) (<= 1 ULTIMATE.start_alloc_17_~i~0))} is VALID [2020-07-29 03:27:34,388 INFO L280 TraceCheckUtils]: 18: Hoare triple {3162#(and (<= ULTIMATE.start_alloc_17_~len 1) (<= 1 ULTIMATE.start_alloc_17_~i~0))} 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; {3100#false} is VALID [2020-07-29 03:27:34,388 INFO L280 TraceCheckUtils]: 19: Hoare triple {3100#false} assume !(0 != ldv_malloc_#t~nondet11);havoc ldv_malloc_#t~nondet11;ldv_malloc_#res.base, ldv_malloc_#res.offset := 0, 0; {3100#false} is VALID [2020-07-29 03:27:34,389 INFO L280 TraceCheckUtils]: 20: Hoare triple {3100#false} 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; {3100#false} is VALID [2020-07-29 03:27:34,389 INFO L280 TraceCheckUtils]: 21: Hoare triple {3100#false} assume alloc_17_~p~0.base == 0 && alloc_17_~p~0.offset == 0; {3100#false} is VALID [2020-07-29 03:27:34,389 INFO L280 TraceCheckUtils]: 22: Hoare triple {3100#false} alloc_17_~j~0 := alloc_17_~i~0 - 1; {3100#false} is VALID [2020-07-29 03:27:34,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-07-29 03:27:34,390 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-29 03:27:34,390 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 10 [2020-07-29 03:27:34,391 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1801507934] [2020-07-29 03:27:34,391 INFO L799 eck$LassoCheckResult]: stem already infeasible [2020-07-29 03:27:34,391 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 03:27:34,393 INFO L82 PathProgramCache]: Analyzing trace with hash 3395, now seen corresponding path program 4 times [2020-07-29 03:27:34,393 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 03:27:34,393 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1800667969] [2020-07-29 03:27:34,394 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 03:27:34,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 03:27:34,398 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 03:27:34,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 03:27:34,400 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 03:27:34,403 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 03:27:34,496 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-29 03:27:34,496 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-07-29 03:27:34,496 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2020-07-29 03:27:34,496 INFO L87 Difference]: Start difference. First operand 25 states and 28 transitions. cyclomatic complexity: 6 Second operand 10 states. [2020-07-29 03:27:34,799 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 03:27:34,799 INFO L93 Difference]: Finished difference Result 35 states and 38 transitions. [2020-07-29 03:27:34,799 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-07-29 03:27:34,799 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 10 states. [2020-07-29 03:27:34,838 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 33 edges. 33 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-29 03:27:34,839 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 35 states and 38 transitions. [2020-07-29 03:27:34,840 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2020-07-29 03:27:34,840 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 35 states to 28 states and 31 transitions. [2020-07-29 03:27:34,840 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 18 [2020-07-29 03:27:34,841 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 18 [2020-07-29 03:27:34,841 INFO L73 IsDeterministic]: Start isDeterministic. Operand 28 states and 31 transitions. [2020-07-29 03:27:34,841 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-07-29 03:27:34,841 INFO L688 BuchiCegarLoop]: Abstraction has 28 states and 31 transitions. [2020-07-29 03:27:34,841 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states and 31 transitions. [2020-07-29 03:27:34,842 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 27. [2020-07-29 03:27:34,842 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-29 03:27:34,842 INFO L82 GeneralOperation]: Start isEquivalent. First operand 28 states and 31 transitions. Second operand 27 states. [2020-07-29 03:27:34,842 INFO L74 IsIncluded]: Start isIncluded. First operand 28 states and 31 transitions. Second operand 27 states. [2020-07-29 03:27:34,842 INFO L87 Difference]: Start difference. First operand 28 states and 31 transitions. Second operand 27 states. [2020-07-29 03:27:34,843 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2020-07-29 03:27:34,844 INFO L93 Difference]: Finished difference Result 33 states and 36 transitions. [2020-07-29 03:27:34,844 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 36 transitions. [2020-07-29 03:27:34,844 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 03:27:34,844 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 03:27:34,844 INFO L74 IsIncluded]: Start isIncluded. First operand 27 states. Second operand 28 states and 31 transitions. [2020-07-29 03:27:34,844 INFO L87 Difference]: Start difference. First operand 27 states. Second operand 28 states and 31 transitions. [2020-07-29 03:27:34,845 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2020-07-29 03:27:34,846 INFO L93 Difference]: Finished difference Result 33 states and 36 transitions. [2020-07-29 03:27:34,846 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 36 transitions. [2020-07-29 03:27:34,846 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 03:27:34,846 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 03:27:34,846 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-29 03:27:34,846 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-29 03:27:34,846 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2020-07-29 03:27:34,847 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 30 transitions. [2020-07-29 03:27:34,847 INFO L711 BuchiCegarLoop]: Abstraction has 27 states and 30 transitions. [2020-07-29 03:27:34,847 INFO L591 BuchiCegarLoop]: Abstraction has 27 states and 30 transitions. [2020-07-29 03:27:34,847 INFO L424 BuchiCegarLoop]: ======== Iteration 13============ [2020-07-29 03:27:34,847 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 27 states and 30 transitions. [2020-07-29 03:27:34,848 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2020-07-29 03:27:34,848 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 03:27:34,848 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 03:27:34,848 INFO L849 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-07-29 03:27:34,848 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2020-07-29 03:27:34,848 INFO L794 eck$LassoCheckResult]: Stem: 3238#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); 3232#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; 3233#L520 assume ldv_positive_~r~1 > 0;ldv_positive_#res := ldv_positive_~r~1; 3236#L521 entry_point_#t~ret44 := ldv_positive_#res;entry_point_~len~0 := entry_point_#t~ret44;havoc entry_point_#t~ret44; 3237#L787 assume !!(entry_point_~len~0 < 16777216); 3239#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; 3218#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; 3219#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; 3226#L789 assume entry_point_~array~0.base != 0 || entry_point_~array~0.offset != 0;entry_point_~i~2 := 0; 3227#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); 3234#L790-2 entry_point_#t~post46 := entry_point_~i~2;entry_point_~i~2 := 1 + entry_point_#t~post46;havoc entry_point_#t~post46; 3235#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); 3240#L790-2 entry_point_#t~post46 := entry_point_~i~2;entry_point_~i~2 := 1 + entry_point_#t~post46;havoc entry_point_#t~post46; 3244#L790-3 assume !(entry_point_~i~2 < entry_point_~len~0); 3241#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; 3242#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; 3222#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; 3223#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; 3230#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); 3231#L765-2 alloc_17_#t~post38 := alloc_17_~i~0;alloc_17_~i~0 := 1 + alloc_17_#t~post38;havoc alloc_17_#t~post38; 3243#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; 3220#L526-1 assume !(0 != ldv_malloc_#t~nondet11);havoc ldv_malloc_#t~nondet11;ldv_malloc_#res.base, ldv_malloc_#res.offset := 0, 0; 3221#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; 3228#L767 assume alloc_17_~p~0.base == 0 && alloc_17_~p~0.offset == 0; 3229#L767-1 alloc_17_~j~0 := alloc_17_~i~0 - 1; 3225#L772-3 [2020-07-29 03:27:34,848 INFO L796 eck$LassoCheckResult]: Loop: 3225#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); 3224#L772-2 alloc_17_#t~post40 := alloc_17_~j~0;alloc_17_~j~0 := alloc_17_#t~post40 - 1;havoc alloc_17_#t~post40; 3225#L772-3 [2020-07-29 03:27:34,849 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 03:27:34,849 INFO L82 PathProgramCache]: Analyzing trace with hash 1196968511, now seen corresponding path program 2 times [2020-07-29 03:27:34,849 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 03:27:34,849 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1627478077] [2020-07-29 03:27:34,849 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 03:27:34,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 03:27:34,863 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 03:27:34,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 03:27:34,877 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 03:27:34,883 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 03:27:34,884 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 03:27:34,884 INFO L82 PathProgramCache]: Analyzing trace with hash 3395, now seen corresponding path program 5 times [2020-07-29 03:27:34,884 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 03:27:34,884 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1463533652] [2020-07-29 03:27:34,884 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 03:27:34,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 03:27:34,887 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 03:27:34,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 03:27:34,889 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 03:27:34,891 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 03:27:34,891 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 03:27:34,891 INFO L82 PathProgramCache]: Analyzing trace with hash -764493823, now seen corresponding path program 1 times [2020-07-29 03:27:34,892 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 03:27:34,892 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [91226636] [2020-07-29 03:27:34,892 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 03:27:34,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 03:27:34,907 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 03:27:34,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 03:27:34,922 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 03:27:34,928 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 03:27:37,920 WARN L193 SmtUtils]: Spent 2.90 s on a formula simplification. DAG size of input: 249 DAG size of output: 210 [2020-07-29 03:27:38,124 INFO L544 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-07-29 03:27:38,604 WARN L193 SmtUtils]: Spent 479.00 ms on a formula simplification that was a NOOP. DAG size: 145 [2020-07-29 03:27:38,604 INFO L624 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-29 03:27:38,613 INFO L544 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-07-29 03:27:39,062 WARN L193 SmtUtils]: Spent 448.00 ms on a formula simplification that was a NOOP. DAG size: 141 [2020-07-29 03:27:39,062 INFO L624 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-29 03:27:39,075 INFO L544 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-07-29 03:27:39,075 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:384, output treesize:376 [2020-07-29 03:27:39,170 WARN L406 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2020-07-29 03:27:39,170 WARN L407 uantifierElimination]: Input elimination task: ∃ [v_ULTIMATE.start_alloc_17_~p~0.base_16, |v_#memory_int_70|, |v_#memory_int_71|]. (let ((.cse11 (store |v_#valid_168| 0 0))) (let ((.cse12 (* v_ULTIMATE.start_entry_point_~i~2_169 4)) (.cse7 (store .cse11 |v_~#ldv_global_msg_list~0.base_320| 1))) (let ((.cse2 (select |v_#memory_$Pointer$.base_133| |v_~#ldv_global_msg_list~0.base_320|)) (.cse1 (+ |v_~#ldv_global_msg_list~0.offset_200| 4)) (.cse3 (store .cse7 v_ULTIMATE.start_entry_point_~array~0.base_260 1)) (.cse0 (select |v_#memory_$Pointer$.offset_101| |v_~#ldv_global_msg_list~0.base_320|)) (.cse4 (select |v_#memory_int_71| v_ULTIMATE.start_entry_point_~array~0.base_260)) (.cse6 (+ (* v_ULTIMATE.start_alloc_17_~i~0_81 4) v_ULTIMATE.start_alloc_17_~array.offset_77 (- 4))) (.cse8 (+ .cse12 v_ULTIMATE.start_entry_point_~array~0.offset_164 (- 8))) (.cse5 (+ .cse12 v_ULTIMATE.start_entry_point_~array~0.offset_164 (- 4)))) (and (= v_ULTIMATE.start_ldv_positive_~r~1_12 |v_ULTIMATE.start_ldv_positive_#res_14|) (= (select .cse0 .cse1) |v_~#ldv_global_msg_list~0.offset_200|) (= v_ULTIMATE.start_entry_point_~len~0_21 |v_ULTIMATE.start_ldv_positive_#res_14|) (= 0 |v_~#ldv_global_msg_list~0.offset_200|) (<= 4 (+ (* 4 v_ULTIMATE.start_alloc_17_~i~0_81) v_ULTIMATE.start_alloc_17_~array.offset_77)) (< v_ULTIMATE.start_entry_point_~array~0.base_260 |v_#StackHeapBarrier_10|) (= 0 (+ v_ULTIMATE.start_entry_point_~i~2_169 (- 2))) (= v_ULTIMATE.start_ldv_malloc_~size_18 |v_ULTIMATE.start_ldv_malloc_#in~size_14|) (= (select .cse2 |v_~#ldv_global_msg_list~0.offset_200|) |v_~#ldv_global_msg_list~0.base_320|) (= 0 v_ULTIMATE.start_alloc_17_~p~0.base_15) (< v_ULTIMATE.start_alloc_17_~i~0_81 v_ULTIMATE.start_alloc_17_~len_12) (= 0 (select .cse3 v_ULTIMATE.start_alloc_17_~p~0.base_16)) (not (= 0 v_ULTIMATE.start_alloc_17_~p~0.base_16)) (= v_ULTIMATE.start_alloc_17_~j~0_23 (+ v_ULTIMATE.start_alloc_17_~i~0_81 (- 1))) (= 4 |v_ULTIMATE.start_ldv_malloc_#in~size_14|) (= |v_ULTIMATE.start_alloc_17_#in~len_6| v_ULTIMATE.start_alloc_17_~len_12) (< v_ULTIMATE.start_alloc_17_~p~0.base_16 |v_#StackHeapBarrier_10|) (= 0 v_ULTIMATE.start_entry_point_~array~0.offset_164) (= |v_ULTIMATE.start_alloc_17_#in~array.offset_6| v_ULTIMATE.start_alloc_17_~array.offset_77) (= v_ULTIMATE.start_alloc_17_~p~0.base_15 |v_ULTIMATE.start_ldv_malloc_#res.base_27|) (= 0 |v_#NULL.offset_8|) (= |v_#length_112| (store (store (store |v_#length_115| |v_~#ldv_global_msg_list~0.base_320| 8) v_ULTIMATE.start_entry_point_~array~0.base_260 (* v_ULTIMATE.start_entry_point_~len~0_21 4)) v_ULTIMATE.start_alloc_17_~p~0.base_16 4)) (< 0 |v_#StackHeapBarrier_10|) (not (= 0 v_ULTIMATE.start_entry_point_~array~0.base_260)) (= (select .cse2 .cse1) |v_~#ldv_global_msg_list~0.base_320|) (= (store .cse3 v_ULTIMATE.start_alloc_17_~p~0.base_16 1) |v_#valid_165|) (= 0 |v_ULTIMATE.start_ldv_malloc_#res.offset_27|) (= 0 |v_#NULL.base_8|) (= (store |v_#memory_int_71| v_ULTIMATE.start_entry_point_~array~0.base_260 (store .cse4 .cse5 (select (select |v_#memory_int_70| v_ULTIMATE.start_entry_point_~array~0.base_260) .cse5))) |v_#memory_int_70|) (= (store |v_#memory_int_70| v_ULTIMATE.start_alloc_17_~array.base_123 (store (select |v_#memory_int_70| v_ULTIMATE.start_alloc_17_~array.base_123) .cse6 (select (select |v_#memory_int_69| v_ULTIMATE.start_alloc_17_~array.base_123) .cse6))) |v_#memory_int_69|) (= v_ULTIMATE.start_entry_point_~array~0.base_260 |v_ULTIMATE.start_alloc_17_#in~array.base_6|) (= v_ULTIMATE.start_entry_point_~len~0_21 |v_ULTIMATE.start_alloc_17_#in~len_6|) (= 0 (select .cse7 v_ULTIMATE.start_entry_point_~array~0.base_260)) (= |v_~#ldv_global_msg_list~0.offset_200| (select .cse0 |v_~#ldv_global_msg_list~0.offset_200|)) (= (store |v_#memory_int_72| v_ULTIMATE.start_entry_point_~array~0.base_260 (store (select |v_#memory_int_72| v_ULTIMATE.start_entry_point_~array~0.base_260) .cse8 (select .cse4 .cse8))) |v_#memory_int_71|) (< |v_#StackHeapBarrier_10| |v_~#ldv_global_msg_list~0.base_320|) (= |v_#memory_$Pointer$.offset_98| (let ((.cse9 (store |v_#memory_$Pointer$.offset_101| v_ULTIMATE.start_entry_point_~array~0.base_260 (store (store (select |v_#memory_$Pointer$.offset_101| v_ULTIMATE.start_entry_point_~array~0.base_260) .cse8 0) .cse5 0)))) (store .cse9 v_ULTIMATE.start_alloc_17_~array.base_123 (store (select .cse9 v_ULTIMATE.start_alloc_17_~array.base_123) .cse6 0)))) (= |v_ULTIMATE.start_alloc_17_#in~array.offset_6| v_ULTIMATE.start_entry_point_~array~0.offset_164) (= |v_#memory_$Pointer$.base_130| (let ((.cse10 (store |v_#memory_$Pointer$.base_133| v_ULTIMATE.start_entry_point_~array~0.base_260 (store (store (select |v_#memory_$Pointer$.base_133| v_ULTIMATE.start_entry_point_~array~0.base_260) .cse8 0) .cse5 0)))) (store .cse10 v_ULTIMATE.start_alloc_17_~array.base_123 (store (select .cse10 v_ULTIMATE.start_alloc_17_~array.base_123) .cse6 v_ULTIMATE.start_alloc_17_~p~0.base_16)))) (not (< v_ULTIMATE.start_entry_point_~i~2_169 v_ULTIMATE.start_entry_point_~len~0_21)) (= (select .cse11 |v_~#ldv_global_msg_list~0.base_320|) 0) (= v_ULTIMATE.start_alloc_17_~array.base_123 |v_ULTIMATE.start_alloc_17_#in~array.base_6|) (= 0 v_ULTIMATE.start_alloc_17_~p~0.offset_15))))) [2020-07-29 03:27:39,171 WARN L408 uantifierElimination]: ElimStorePlain result: ∃ [v_DerPreprocessor_2, v_DerPreprocessor_1, v_ULTIMATE.start_alloc_17_~p~0.base_16]. (let ((.cse11 (store |v_#valid_168| 0 0))) (let ((.cse12 (* v_ULTIMATE.start_entry_point_~i~2_169 4)) (.cse8 (store .cse11 |v_~#ldv_global_msg_list~0.base_320| 1))) (let ((.cse2 (select |v_#memory_$Pointer$.base_133| |v_~#ldv_global_msg_list~0.base_320|)) (.cse1 (+ |v_~#ldv_global_msg_list~0.offset_200| 4)) (.cse3 (store .cse8 v_ULTIMATE.start_entry_point_~array~0.base_260 1)) (.cse0 (select |v_#memory_$Pointer$.offset_101| |v_~#ldv_global_msg_list~0.base_320|)) (.cse5 (+ (* v_ULTIMATE.start_alloc_17_~i~0_81 4) v_ULTIMATE.start_alloc_17_~array.offset_77 (- 4))) (.cse6 (+ .cse12 v_ULTIMATE.start_entry_point_~array~0.offset_164 (- 8))) (.cse7 (+ .cse12 v_ULTIMATE.start_entry_point_~array~0.offset_164 (- 4)))) (and (= v_ULTIMATE.start_ldv_positive_~r~1_12 |v_ULTIMATE.start_ldv_positive_#res_14|) (= (select .cse0 .cse1) |v_~#ldv_global_msg_list~0.offset_200|) (= v_ULTIMATE.start_entry_point_~len~0_21 |v_ULTIMATE.start_ldv_positive_#res_14|) (= 0 |v_~#ldv_global_msg_list~0.offset_200|) (<= 4 (+ (* 4 v_ULTIMATE.start_alloc_17_~i~0_81) v_ULTIMATE.start_alloc_17_~array.offset_77)) (< v_ULTIMATE.start_entry_point_~array~0.base_260 |v_#StackHeapBarrier_10|) (= 0 (+ v_ULTIMATE.start_entry_point_~i~2_169 (- 2))) (= v_ULTIMATE.start_ldv_malloc_~size_18 |v_ULTIMATE.start_ldv_malloc_#in~size_14|) (= (select .cse2 |v_~#ldv_global_msg_list~0.offset_200|) |v_~#ldv_global_msg_list~0.base_320|) (= 0 v_ULTIMATE.start_alloc_17_~p~0.base_15) (< v_ULTIMATE.start_alloc_17_~i~0_81 v_ULTIMATE.start_alloc_17_~len_12) (= 0 (select .cse3 v_ULTIMATE.start_alloc_17_~p~0.base_16)) (not (= 0 v_ULTIMATE.start_alloc_17_~p~0.base_16)) (= v_ULTIMATE.start_alloc_17_~j~0_23 (+ v_ULTIMATE.start_alloc_17_~i~0_81 (- 1))) (= 4 |v_ULTIMATE.start_ldv_malloc_#in~size_14|) (= |v_ULTIMATE.start_alloc_17_#in~len_6| v_ULTIMATE.start_alloc_17_~len_12) (< v_ULTIMATE.start_alloc_17_~p~0.base_16 |v_#StackHeapBarrier_10|) (= 0 v_ULTIMATE.start_entry_point_~array~0.offset_164) (= |v_ULTIMATE.start_alloc_17_#in~array.offset_6| v_ULTIMATE.start_alloc_17_~array.offset_77) (= v_ULTIMATE.start_alloc_17_~p~0.base_15 |v_ULTIMATE.start_ldv_malloc_#res.base_27|) (= 0 |v_#NULL.offset_8|) (= |v_#length_112| (store (store (store |v_#length_115| |v_~#ldv_global_msg_list~0.base_320| 8) v_ULTIMATE.start_entry_point_~array~0.base_260 (* v_ULTIMATE.start_entry_point_~len~0_21 4)) v_ULTIMATE.start_alloc_17_~p~0.base_16 4)) (< 0 |v_#StackHeapBarrier_10|) (not (= 0 v_ULTIMATE.start_entry_point_~array~0.base_260)) (= (select .cse2 .cse1) |v_~#ldv_global_msg_list~0.base_320|) (= (store .cse3 v_ULTIMATE.start_alloc_17_~p~0.base_16 1) |v_#valid_165|) (= 0 |v_ULTIMATE.start_ldv_malloc_#res.offset_27|) (= 0 |v_#NULL.base_8|) (= v_ULTIMATE.start_entry_point_~array~0.base_260 |v_ULTIMATE.start_alloc_17_#in~array.base_6|) (= v_ULTIMATE.start_entry_point_~len~0_21 |v_ULTIMATE.start_alloc_17_#in~len_6|) (= |v_#memory_int_69| (let ((.cse4 (store |v_#memory_int_72| v_ULTIMATE.start_entry_point_~array~0.base_260 (store (store (select |v_#memory_int_72| v_ULTIMATE.start_entry_point_~array~0.base_260) .cse6 v_DerPreprocessor_2) .cse7 v_DerPreprocessor_1)))) (store .cse4 v_ULTIMATE.start_alloc_17_~array.base_123 (store (select .cse4 v_ULTIMATE.start_alloc_17_~array.base_123) .cse5 (select (select |v_#memory_int_69| v_ULTIMATE.start_alloc_17_~array.base_123) .cse5))))) (= 0 (select .cse8 v_ULTIMATE.start_entry_point_~array~0.base_260)) (= |v_~#ldv_global_msg_list~0.offset_200| (select .cse0 |v_~#ldv_global_msg_list~0.offset_200|)) (< |v_#StackHeapBarrier_10| |v_~#ldv_global_msg_list~0.base_320|) (= |v_#memory_$Pointer$.offset_98| (let ((.cse9 (store |v_#memory_$Pointer$.offset_101| v_ULTIMATE.start_entry_point_~array~0.base_260 (store (store (select |v_#memory_$Pointer$.offset_101| v_ULTIMATE.start_entry_point_~array~0.base_260) .cse6 0) .cse7 0)))) (store .cse9 v_ULTIMATE.start_alloc_17_~array.base_123 (store (select .cse9 v_ULTIMATE.start_alloc_17_~array.base_123) .cse5 0)))) (= |v_ULTIMATE.start_alloc_17_#in~array.offset_6| v_ULTIMATE.start_entry_point_~array~0.offset_164) (= |v_#memory_$Pointer$.base_130| (let ((.cse10 (store |v_#memory_$Pointer$.base_133| v_ULTIMATE.start_entry_point_~array~0.base_260 (store (store (select |v_#memory_$Pointer$.base_133| v_ULTIMATE.start_entry_point_~array~0.base_260) .cse6 0) .cse7 0)))) (store .cse10 v_ULTIMATE.start_alloc_17_~array.base_123 (store (select .cse10 v_ULTIMATE.start_alloc_17_~array.base_123) .cse5 v_ULTIMATE.start_alloc_17_~p~0.base_16)))) (not (< v_ULTIMATE.start_entry_point_~i~2_169 v_ULTIMATE.start_entry_point_~len~0_21)) (= (select .cse11 |v_~#ldv_global_msg_list~0.base_320|) 0) (= v_ULTIMATE.start_alloc_17_~array.base_123 |v_ULTIMATE.start_alloc_17_#in~array.base_6|) (= 0 v_ULTIMATE.start_alloc_17_~p~0.offset_15))))) [2020-07-29 03:27:39,615 WARN L193 SmtUtils]: Spent 426.00 ms on a formula simplification that was a NOOP. DAG size: 141 [2020-07-29 03:27:39,620 INFO L210 LassoAnalysis]: Preferences: [2020-07-29 03:27:39,620 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2020-07-29 03:27:39,620 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-07-29 03:27:39,620 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2020-07-29 03:27:39,621 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2020-07-29 03:27:39,621 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 03:27:39,621 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2020-07-29 03:27:39,621 INFO L132 ssoRankerPreferences]: Path of dumped script: [2020-07-29 03:27:39,621 INFO L133 ssoRankerPreferences]: Filename of dumped script: memleaks_test17_2-2.i_Iteration13_Lasso [2020-07-29 03:27:39,621 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2020-07-29 03:27:39,622 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2020-07-29 03:27:39,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-07-29 03:27:39,665 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:27:39,669 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:27:39,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-07-29 03:27:39,676 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:27:39,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-07-29 03:27:39,684 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:27:39,690 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:27:39,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-07-29 03:27:40,099 WARN L193 SmtUtils]: Spent 238.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 82 [2020-07-29 03:27:40,215 WARN L257 bleTransFormulaUtils]: 3 quantified variables [2020-07-29 03:27:40,216 WARN L257 bleTransFormulaUtils]: 1 quantified variables [2020-07-29 03:27:40,227 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:27:40,230 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:27:40,233 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:27:40,238 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:27:40,242 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:27:40,247 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:27:40,250 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:27:40,253 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:27:40,257 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:27:40,262 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:27:40,266 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:27:40,271 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:27:40,275 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:27:40,280 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:27:40,284 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:27:40,292 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:27:40,297 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:27:40,301 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:27:40,306 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:27:40,849 WARN L193 SmtUtils]: Spent 122.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 45 [2020-07-29 03:27:41,557 WARN L193 SmtUtils]: Spent 278.00 ms on a formula simplification. DAG size of input: 34 DAG size of output: 34 [2020-07-29 03:27:41,792 INFO L292 LassoAnalysis]: Preprocessing complete. [2020-07-29 03:27:41,792 INFO L489 LassoAnalysis]: Using template 'affine'. 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) Waiting until toolchain timeout for monitored process 54 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 03:27:41,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-07-29 03:27:41,804 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 03:27:41,804 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 03:27:41,804 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 03:27:41,804 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 03:27:41,806 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-29 03:27:41,806 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-07-29 03:27:41,809 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-07-29 03:27:41,832 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-07-29 03:27:41,833 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 03:27:41,833 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 03:27:41,833 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 03:27:41,833 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 03:27:41,833 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 03:27:41,834 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 03:27:41,834 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 03:27:41,835 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-07-29 03:27:41,858 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-07-29 03:27:41,860 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 03:27:41,860 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 03:27:41,860 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 03:27:41,860 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 03:27:41,861 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-29 03:27:41,861 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-07-29 03:27:41,870 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-07-29 03:27:41,903 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-07-29 03:27:41,904 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 03:27:41,905 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 03:27:41,905 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 03:27:41,905 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 03:27:41,906 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-29 03:27:41,906 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-07-29 03:27:41,908 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-07-29 03:27:41,932 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-07-29 03:27:41,933 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 03:27:41,934 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 03:27:41,934 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 03:27:41,934 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 03:27:41,934 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 03:27:41,934 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 03:27:41,934 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 03:27:41,936 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-07-29 03:27:41,957 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-07-29 03:27:41,958 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 03:27:41,958 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 03:27:41,959 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 03:27:41,959 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 03:27:41,959 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 03:27:41,959 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 03:27:41,959 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 03:27:41,960 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-07-29 03:27:41,983 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-07-29 03:27:41,985 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 03:27:41,985 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 03:27:41,985 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 03:27:41,985 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 03:27:41,987 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-29 03:27:41,987 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-07-29 03:27:41,991 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-07-29 03:27:42,014 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-07-29 03:27:42,015 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 03:27:42,015 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 03:27:42,015 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 03:27:42,016 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 03:27:42,016 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-29 03:27:42,016 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-07-29 03:27:42,019 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-07-29 03:27:42,042 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-07-29 03:27:42,043 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 03:27:42,043 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 03:27:42,043 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 03:27:42,043 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 03:27:42,044 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-29 03:27:42,044 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-07-29 03:27:42,047 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) Waiting until toolchain timeout for monitored process 63 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 03:27:42,072 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-07-29 03:27:42,073 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 03:27:42,073 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 03:27:42,073 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 03:27:42,073 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 03:27:42,073 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 03:27:42,074 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 03:27:42,074 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 03:27:42,075 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-07-29 03:27:42,097 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-07-29 03:27:42,098 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 03:27:42,098 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 03:27:42,098 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 03:27:42,098 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 03:27:42,099 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 03:27:42,099 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 03:27:42,099 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 03:27:42,100 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-07-29 03:27:42,121 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-07-29 03:27:42,123 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 03:27:42,123 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 03:27:42,123 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 03:27:42,123 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 03:27:42,124 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-29 03:27:42,124 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-07-29 03:27:42,129 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) Waiting until toolchain timeout for monitored process 66 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 03:27:42,161 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-07-29 03:27:42,163 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 03:27:42,163 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 03:27:42,163 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 03:27:42,163 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 03:27:42,168 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-29 03:27:42,168 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-07-29 03:27:42,187 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2020-07-29 03:27:42,204 INFO L443 ModelExtractionUtils]: Simplification made 6 calls to the SMT solver. [2020-07-29 03:27:42,205 INFO L444 ModelExtractionUtils]: 10 out of 46 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 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-07-29 03:27:42,208 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2020-07-29 03:27:42,210 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2020-07-29 03:27:42,210 INFO L510 LassoAnalysis]: Proved termination. [2020-07-29 03:27:42,210 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_alloc_17_~i~0, ULTIMATE.start_alloc_17_~j~0, ULTIMATE.start_alloc_17_~array.offset, ~#ldv_global_msg_list~0.offset) = 4*ULTIMATE.start_alloc_17_~i~0 + 8*ULTIMATE.start_alloc_17_~j~0 + 3*ULTIMATE.start_alloc_17_~array.offset - 1*~#ldv_global_msg_list~0.offset Supporting invariants [] [2020-07-29 03:27:42,272 INFO L297 tatePredicateManager]: 8 out of 9 supporting invariants were superfluous and have been removed [2020-07-29 03:27:42,277 INFO L393 LassoCheck]: Loop: "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);" "alloc_17_#t~post40 := alloc_17_~j~0;alloc_17_~j~0 := alloc_17_#t~post40 - 1;havoc alloc_17_#t~post40;" [2020-07-29 03:27:42,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 03:27:42,320 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 03:27:42,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 03:27:42,350 INFO L263 TraceCheckSpWp]: Trace formula consists of 143 conjuncts, 17 conjunts are in the unsatisfiable core [2020-07-29 03:27:42,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 03:27:42,363 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 03:27:42,634 INFO L280 TraceCheckUtils]: 0: Hoare triple {3427#unseeded} #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); {3495#(and (= 0 |~#ldv_global_msg_list~0.offset|) unseeded)} is VALID [2020-07-29 03:27:42,636 INFO L280 TraceCheckUtils]: 1: Hoare triple {3495#(and (= 0 |~#ldv_global_msg_list~0.offset|) unseeded)} 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; {3495#(and (= 0 |~#ldv_global_msg_list~0.offset|) unseeded)} is VALID [2020-07-29 03:27:42,637 INFO L280 TraceCheckUtils]: 2: Hoare triple {3495#(and (= 0 |~#ldv_global_msg_list~0.offset|) unseeded)} assume ldv_positive_~r~1 > 0;ldv_positive_#res := ldv_positive_~r~1; {3495#(and (= 0 |~#ldv_global_msg_list~0.offset|) unseeded)} is VALID [2020-07-29 03:27:42,639 INFO L280 TraceCheckUtils]: 3: Hoare triple {3495#(and (= 0 |~#ldv_global_msg_list~0.offset|) unseeded)} entry_point_#t~ret44 := ldv_positive_#res;entry_point_~len~0 := entry_point_#t~ret44;havoc entry_point_#t~ret44; {3495#(and (= 0 |~#ldv_global_msg_list~0.offset|) unseeded)} is VALID [2020-07-29 03:27:42,640 INFO L280 TraceCheckUtils]: 4: Hoare triple {3495#(and (= 0 |~#ldv_global_msg_list~0.offset|) unseeded)} assume !!(entry_point_~len~0 < 16777216); {3495#(and (= 0 |~#ldv_global_msg_list~0.offset|) unseeded)} is VALID [2020-07-29 03:27:42,643 INFO L280 TraceCheckUtils]: 5: Hoare triple {3495#(and (= 0 |~#ldv_global_msg_list~0.offset|) unseeded)} 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; {3495#(and (= 0 |~#ldv_global_msg_list~0.offset|) unseeded)} is VALID [2020-07-29 03:27:42,645 INFO L280 TraceCheckUtils]: 6: Hoare triple {3495#(and (= 0 |~#ldv_global_msg_list~0.offset|) unseeded)} 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; {3514#(and (= 0 |~#ldv_global_msg_list~0.offset|) (<= |ULTIMATE.start_ldv_malloc_#res.offset| 0) unseeded)} is VALID [2020-07-29 03:27:42,646 INFO L280 TraceCheckUtils]: 7: Hoare triple {3514#(and (= 0 |~#ldv_global_msg_list~0.offset|) (<= |ULTIMATE.start_ldv_malloc_#res.offset| 0) unseeded)} 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; {3518#(and (= 0 |~#ldv_global_msg_list~0.offset|) (<= ULTIMATE.start_entry_point_~array~0.offset 0) unseeded)} is VALID [2020-07-29 03:27:42,646 INFO L280 TraceCheckUtils]: 8: Hoare triple {3518#(and (= 0 |~#ldv_global_msg_list~0.offset|) (<= ULTIMATE.start_entry_point_~array~0.offset 0) unseeded)} assume entry_point_~array~0.base != 0 || entry_point_~array~0.offset != 0;entry_point_~i~2 := 0; {3522#(and (= 0 |~#ldv_global_msg_list~0.offset|) (<= ULTIMATE.start_entry_point_~i~2 0) (<= ULTIMATE.start_entry_point_~array~0.offset 0) unseeded)} is VALID [2020-07-29 03:27:42,647 INFO L280 TraceCheckUtils]: 9: Hoare triple {3522#(and (= 0 |~#ldv_global_msg_list~0.offset|) (<= ULTIMATE.start_entry_point_~i~2 0) (<= ULTIMATE.start_entry_point_~array~0.offset 0) unseeded)} 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); {3526#(and (= 0 |~#ldv_global_msg_list~0.offset|) (<= (div ULTIMATE.start_entry_point_~array~0.offset (- 4)) 0) (<= ULTIMATE.start_entry_point_~array~0.offset 0) unseeded)} is VALID [2020-07-29 03:27:42,648 INFO L280 TraceCheckUtils]: 10: Hoare triple {3526#(and (= 0 |~#ldv_global_msg_list~0.offset|) (<= (div ULTIMATE.start_entry_point_~array~0.offset (- 4)) 0) (<= ULTIMATE.start_entry_point_~array~0.offset 0) unseeded)} entry_point_#t~post46 := entry_point_~i~2;entry_point_~i~2 := 1 + entry_point_#t~post46;havoc entry_point_#t~post46; {3526#(and (= 0 |~#ldv_global_msg_list~0.offset|) (<= (div ULTIMATE.start_entry_point_~array~0.offset (- 4)) 0) (<= ULTIMATE.start_entry_point_~array~0.offset 0) unseeded)} is VALID [2020-07-29 03:27:42,649 INFO L280 TraceCheckUtils]: 11: Hoare triple {3526#(and (= 0 |~#ldv_global_msg_list~0.offset|) (<= (div ULTIMATE.start_entry_point_~array~0.offset (- 4)) 0) (<= ULTIMATE.start_entry_point_~array~0.offset 0) unseeded)} 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); {3526#(and (= 0 |~#ldv_global_msg_list~0.offset|) (<= (div ULTIMATE.start_entry_point_~array~0.offset (- 4)) 0) (<= ULTIMATE.start_entry_point_~array~0.offset 0) unseeded)} is VALID [2020-07-29 03:27:42,650 INFO L280 TraceCheckUtils]: 12: Hoare triple {3526#(and (= 0 |~#ldv_global_msg_list~0.offset|) (<= (div ULTIMATE.start_entry_point_~array~0.offset (- 4)) 0) (<= ULTIMATE.start_entry_point_~array~0.offset 0) unseeded)} entry_point_#t~post46 := entry_point_~i~2;entry_point_~i~2 := 1 + entry_point_#t~post46;havoc entry_point_#t~post46; {3526#(and (= 0 |~#ldv_global_msg_list~0.offset|) (<= (div ULTIMATE.start_entry_point_~array~0.offset (- 4)) 0) (<= ULTIMATE.start_entry_point_~array~0.offset 0) unseeded)} is VALID [2020-07-29 03:27:42,651 INFO L280 TraceCheckUtils]: 13: Hoare triple {3526#(and (= 0 |~#ldv_global_msg_list~0.offset|) (<= (div ULTIMATE.start_entry_point_~array~0.offset (- 4)) 0) (<= ULTIMATE.start_entry_point_~array~0.offset 0) unseeded)} assume !(entry_point_~i~2 < entry_point_~len~0); {3526#(and (= 0 |~#ldv_global_msg_list~0.offset|) (<= (div ULTIMATE.start_entry_point_~array~0.offset (- 4)) 0) (<= ULTIMATE.start_entry_point_~array~0.offset 0) unseeded)} is VALID [2020-07-29 03:27:42,652 INFO L280 TraceCheckUtils]: 14: Hoare triple {3526#(and (= 0 |~#ldv_global_msg_list~0.offset|) (<= (div ULTIMATE.start_entry_point_~array~0.offset (- 4)) 0) (<= ULTIMATE.start_entry_point_~array~0.offset 0) unseeded)} 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; {3542#(and (<= ULTIMATE.start_alloc_17_~array.offset 0) (= 0 |~#ldv_global_msg_list~0.offset|) (<= (div ULTIMATE.start_alloc_17_~array.offset (- 4)) 0) (= 0 ULTIMATE.start_alloc_17_~i~0) unseeded)} is VALID [2020-07-29 03:27:42,653 INFO L280 TraceCheckUtils]: 15: Hoare triple {3542#(and (<= ULTIMATE.start_alloc_17_~array.offset 0) (= 0 |~#ldv_global_msg_list~0.offset|) (<= (div ULTIMATE.start_alloc_17_~array.offset (- 4)) 0) (= 0 ULTIMATE.start_alloc_17_~i~0) unseeded)} 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; {3542#(and (<= ULTIMATE.start_alloc_17_~array.offset 0) (= 0 |~#ldv_global_msg_list~0.offset|) (<= (div ULTIMATE.start_alloc_17_~array.offset (- 4)) 0) (= 0 ULTIMATE.start_alloc_17_~i~0) unseeded)} is VALID [2020-07-29 03:27:42,654 INFO L280 TraceCheckUtils]: 16: Hoare triple {3542#(and (<= ULTIMATE.start_alloc_17_~array.offset 0) (= 0 |~#ldv_global_msg_list~0.offset|) (<= (div ULTIMATE.start_alloc_17_~array.offset (- 4)) 0) (= 0 ULTIMATE.start_alloc_17_~i~0) unseeded)} 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; {3542#(and (<= ULTIMATE.start_alloc_17_~array.offset 0) (= 0 |~#ldv_global_msg_list~0.offset|) (<= (div ULTIMATE.start_alloc_17_~array.offset (- 4)) 0) (= 0 ULTIMATE.start_alloc_17_~i~0) unseeded)} is VALID [2020-07-29 03:27:42,654 INFO L280 TraceCheckUtils]: 17: Hoare triple {3542#(and (<= ULTIMATE.start_alloc_17_~array.offset 0) (= 0 |~#ldv_global_msg_list~0.offset|) (<= (div ULTIMATE.start_alloc_17_~array.offset (- 4)) 0) (= 0 ULTIMATE.start_alloc_17_~i~0) unseeded)} 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; {3542#(and (<= ULTIMATE.start_alloc_17_~array.offset 0) (= 0 |~#ldv_global_msg_list~0.offset|) (<= (div ULTIMATE.start_alloc_17_~array.offset (- 4)) 0) (= 0 ULTIMATE.start_alloc_17_~i~0) unseeded)} is VALID [2020-07-29 03:27:42,655 INFO L280 TraceCheckUtils]: 18: Hoare triple {3542#(and (<= ULTIMATE.start_alloc_17_~array.offset 0) (= 0 |~#ldv_global_msg_list~0.offset|) (<= (div ULTIMATE.start_alloc_17_~array.offset (- 4)) 0) (= 0 ULTIMATE.start_alloc_17_~i~0) unseeded)} 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); {3542#(and (<= ULTIMATE.start_alloc_17_~array.offset 0) (= 0 |~#ldv_global_msg_list~0.offset|) (<= (div ULTIMATE.start_alloc_17_~array.offset (- 4)) 0) (= 0 ULTIMATE.start_alloc_17_~i~0) unseeded)} is VALID [2020-07-29 03:27:42,656 INFO L280 TraceCheckUtils]: 19: Hoare triple {3542#(and (<= ULTIMATE.start_alloc_17_~array.offset 0) (= 0 |~#ldv_global_msg_list~0.offset|) (<= (div ULTIMATE.start_alloc_17_~array.offset (- 4)) 0) (= 0 ULTIMATE.start_alloc_17_~i~0) unseeded)} alloc_17_#t~post38 := alloc_17_~i~0;alloc_17_~i~0 := 1 + alloc_17_#t~post38;havoc alloc_17_#t~post38; {3558#(and (<= ULTIMATE.start_alloc_17_~array.offset 0) (= 0 |~#ldv_global_msg_list~0.offset|) (<= (div ULTIMATE.start_alloc_17_~array.offset (- 4)) 0) unseeded (= 1 ULTIMATE.start_alloc_17_~i~0))} is VALID [2020-07-29 03:27:42,657 INFO L280 TraceCheckUtils]: 20: Hoare triple {3558#(and (<= ULTIMATE.start_alloc_17_~array.offset 0) (= 0 |~#ldv_global_msg_list~0.offset|) (<= (div ULTIMATE.start_alloc_17_~array.offset (- 4)) 0) unseeded (= 1 ULTIMATE.start_alloc_17_~i~0))} 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; {3558#(and (<= ULTIMATE.start_alloc_17_~array.offset 0) (= 0 |~#ldv_global_msg_list~0.offset|) (<= (div ULTIMATE.start_alloc_17_~array.offset (- 4)) 0) unseeded (= 1 ULTIMATE.start_alloc_17_~i~0))} is VALID [2020-07-29 03:27:42,658 INFO L280 TraceCheckUtils]: 21: Hoare triple {3558#(and (<= ULTIMATE.start_alloc_17_~array.offset 0) (= 0 |~#ldv_global_msg_list~0.offset|) (<= (div ULTIMATE.start_alloc_17_~array.offset (- 4)) 0) unseeded (= 1 ULTIMATE.start_alloc_17_~i~0))} assume !(0 != ldv_malloc_#t~nondet11);havoc ldv_malloc_#t~nondet11;ldv_malloc_#res.base, ldv_malloc_#res.offset := 0, 0; {3558#(and (<= ULTIMATE.start_alloc_17_~array.offset 0) (= 0 |~#ldv_global_msg_list~0.offset|) (<= (div ULTIMATE.start_alloc_17_~array.offset (- 4)) 0) unseeded (= 1 ULTIMATE.start_alloc_17_~i~0))} is VALID [2020-07-29 03:27:42,659 INFO L280 TraceCheckUtils]: 22: Hoare triple {3558#(and (<= ULTIMATE.start_alloc_17_~array.offset 0) (= 0 |~#ldv_global_msg_list~0.offset|) (<= (div ULTIMATE.start_alloc_17_~array.offset (- 4)) 0) unseeded (= 1 ULTIMATE.start_alloc_17_~i~0))} 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; {3558#(and (<= ULTIMATE.start_alloc_17_~array.offset 0) (= 0 |~#ldv_global_msg_list~0.offset|) (<= (div ULTIMATE.start_alloc_17_~array.offset (- 4)) 0) unseeded (= 1 ULTIMATE.start_alloc_17_~i~0))} is VALID [2020-07-29 03:27:42,660 INFO L280 TraceCheckUtils]: 23: Hoare triple {3558#(and (<= ULTIMATE.start_alloc_17_~array.offset 0) (= 0 |~#ldv_global_msg_list~0.offset|) (<= (div ULTIMATE.start_alloc_17_~array.offset (- 4)) 0) unseeded (= 1 ULTIMATE.start_alloc_17_~i~0))} assume alloc_17_~p~0.base == 0 && alloc_17_~p~0.offset == 0; {3558#(and (<= ULTIMATE.start_alloc_17_~array.offset 0) (= 0 |~#ldv_global_msg_list~0.offset|) (<= (div ULTIMATE.start_alloc_17_~array.offset (- 4)) 0) unseeded (= 1 ULTIMATE.start_alloc_17_~i~0))} is VALID [2020-07-29 03:27:42,661 INFO L280 TraceCheckUtils]: 24: Hoare triple {3558#(and (<= ULTIMATE.start_alloc_17_~array.offset 0) (= 0 |~#ldv_global_msg_list~0.offset|) (<= (div ULTIMATE.start_alloc_17_~array.offset (- 4)) 0) unseeded (= 1 ULTIMATE.start_alloc_17_~i~0))} alloc_17_~j~0 := alloc_17_~i~0 - 1; {3486#(and (= |~#ldv_global_msg_list~0.offset| (+ (* ULTIMATE.start_alloc_17_~i~0 4) ULTIMATE.start_alloc_17_~array.offset (- 4))) unseeded)} is VALID [2020-07-29 03:27:42,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 03:27:42,667 INFO L263 TraceCheckSpWp]: Trace formula consists of 17 conjuncts, 6 conjunts are in the unsatisfiable core [2020-07-29 03:27:42,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 03:27:42,672 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 03:27:42,711 INFO L280 TraceCheckUtils]: 0: Hoare triple {3487#(and (= |~#ldv_global_msg_list~0.offset| (+ (* ULTIMATE.start_alloc_17_~i~0 4) ULTIMATE.start_alloc_17_~array.offset (- 4))) (>= oldRank0 (+ (* 4 ULTIMATE.start_alloc_17_~i~0) (* 8 ULTIMATE.start_alloc_17_~j~0) (* 3 ULTIMATE.start_alloc_17_~array.offset) (* (- 1) |~#ldv_global_msg_list~0.offset|))))} 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); {3574#(and (<= 0 (+ ULTIMATE.start_alloc_17_~array.offset (* 4 ULTIMATE.start_alloc_17_~j~0))) (= (+ |~#ldv_global_msg_list~0.offset| 4) (+ ULTIMATE.start_alloc_17_~array.offset (* 4 ULTIMATE.start_alloc_17_~i~0))) (<= (+ (* 3 ULTIMATE.start_alloc_17_~array.offset) (* 4 ULTIMATE.start_alloc_17_~i~0) (* 8 ULTIMATE.start_alloc_17_~j~0)) (+ oldRank0 |~#ldv_global_msg_list~0.offset|)))} is VALID [2020-07-29 03:27:42,712 INFO L280 TraceCheckUtils]: 1: Hoare triple {3574#(and (<= 0 (+ ULTIMATE.start_alloc_17_~array.offset (* 4 ULTIMATE.start_alloc_17_~j~0))) (= (+ |~#ldv_global_msg_list~0.offset| 4) (+ ULTIMATE.start_alloc_17_~array.offset (* 4 ULTIMATE.start_alloc_17_~i~0))) (<= (+ (* 3 ULTIMATE.start_alloc_17_~array.offset) (* 4 ULTIMATE.start_alloc_17_~i~0) (* 8 ULTIMATE.start_alloc_17_~j~0)) (+ oldRank0 |~#ldv_global_msg_list~0.offset|)))} alloc_17_#t~post40 := alloc_17_~j~0;alloc_17_~j~0 := alloc_17_#t~post40 - 1;havoc alloc_17_#t~post40; {3489#(and (= |~#ldv_global_msg_list~0.offset| (+ (* ULTIMATE.start_alloc_17_~i~0 4) ULTIMATE.start_alloc_17_~array.offset (- 4))) (or unseeded (and (>= oldRank0 0) (> oldRank0 (+ (* 4 ULTIMATE.start_alloc_17_~i~0) (* 8 ULTIMATE.start_alloc_17_~j~0) (* 3 ULTIMATE.start_alloc_17_~array.offset) (* (- 1) |~#ldv_global_msg_list~0.offset|))))))} is VALID [2020-07-29 03:27:42,713 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-29 03:27:42,713 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 10 states. [2020-07-29 03:27:42,750 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 26 edges. 26 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-29 03:27:42,751 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 10 states. Stem has 25 letters. Loop has 2 letters. [2020-07-29 03:27:42,751 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:27:42,751 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.8 stem predicates 2 loop predicates [2020-07-29 03:27:42,752 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 27 states and 30 transitions. cyclomatic complexity: 6 Second operand 10 states. [2020-07-29 03:27:43,537 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 27 states and 30 transitions. cyclomatic complexity: 6. Second operand 10 states. Result 46 states and 52 transitions. Complement of second has 17 states. [2020-07-29 03:27:43,537 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 15 states 12 stem states 1 non-accepting loop states 2 accepting loop states [2020-07-29 03:27:43,537 INFO L123 tractBuchiDifference]: Start testing correctness of buchiDifferenceNCSBLazy3 [2020-07-29 03:27:43,537 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 27 states and 30 transitions. cyclomatic complexity: 6 [2020-07-29 03:27:43,537 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 03:27:43,537 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 03:27:43,538 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 10 states. [2020-07-29 03:27:43,539 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2020-07-29 03:27:43,539 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 03:27:43,539 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 03:27:43,540 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 46 states and 52 transitions. [2020-07-29 03:27:43,540 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2020-07-29 03:27:43,540 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 03:27:43,540 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 03:27:43,541 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 27 states and 30 transitions. cyclomatic complexity: 6 [2020-07-29 03:27:43,541 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 2 examples of accepted words. [2020-07-29 03:27:43,542 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 10 states. [2020-07-29 03:27:43,543 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2020-07-29 03:27:43,543 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 1 examples of accepted words. [2020-07-29 03:27:43,543 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 46 states and 52 transitions. cyclomatic complexity: 10 [2020-07-29 03:27:43,544 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 2 examples of accepted words. [2020-07-29 03:27:43,544 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 27 states and 30 transitions. cyclomatic complexity: 6 Stem has 25 letters. Loop has 2 letters. [2020-07-29 03:27:43,544 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:27:43,544 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 10 states. Stem has 25 letters. Loop has 2 letters. [2020-07-29 03:27:43,544 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:27:43,545 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 46 states and 52 transitions. cyclomatic complexity: 10 Stem has 25 letters. Loop has 2 letters. [2020-07-29 03:27:43,545 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:27:43,545 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 27 states and 30 transitions. cyclomatic complexity: 6 Stem has 9 letters. Loop has 2 letters. [2020-07-29 03:27:43,545 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:27:43,545 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 10 states. Stem has 9 letters. Loop has 2 letters. [2020-07-29 03:27:43,546 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:27:43,546 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 46 states and 52 transitions. cyclomatic complexity: 10 Stem has 9 letters. Loop has 2 letters. [2020-07-29 03:27:43,546 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:27:43,546 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 27 states and 30 transitions. cyclomatic complexity: 6 Stem has 32 letters. Loop has 2 letters. [2020-07-29 03:27:43,546 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:27:43,547 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 10 states. Stem has 32 letters. Loop has 2 letters. [2020-07-29 03:27:43,547 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:27:43,547 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 46 states and 52 transitions. cyclomatic complexity: 10 Stem has 32 letters. Loop has 2 letters. [2020-07-29 03:27:43,547 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:27:43,547 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 27 states and 30 transitions. cyclomatic complexity: 6 Stem has 46 letters. Loop has 46 letters. [2020-07-29 03:27:43,547 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:27:43,548 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 10 states. Stem has 46 letters. Loop has 46 letters. [2020-07-29 03:27:43,548 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:27:43,548 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 46 states and 52 transitions. cyclomatic complexity: 10 Stem has 46 letters. Loop has 46 letters. [2020-07-29 03:27:43,548 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:27:43,548 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 27 states and 30 transitions. cyclomatic complexity: 6 Stem has 27 letters. Loop has 27 letters. [2020-07-29 03:27:43,549 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:27:43,549 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 10 states. Stem has 27 letters. Loop has 27 letters. [2020-07-29 03:27:43,549 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:27:43,549 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 46 states and 52 transitions. cyclomatic complexity: 10 Stem has 27 letters. Loop has 27 letters. [2020-07-29 03:27:43,549 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:27:43,550 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 27 states and 30 transitions. cyclomatic complexity: 6 Stem has 15 letters. Loop has 15 letters. [2020-07-29 03:27:43,550 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:27:43,550 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 10 states. Stem has 15 letters. Loop has 15 letters. [2020-07-29 03:27:43,550 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:27:43,550 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 46 states and 52 transitions. cyclomatic complexity: 10 Stem has 15 letters. Loop has 15 letters. [2020-07-29 03:27:43,551 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:27:43,551 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 27 states and 30 transitions. cyclomatic complexity: 6 Stem has 26 letters. Loop has 2 letters. [2020-07-29 03:27:43,551 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:27:43,551 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 10 states. Stem has 26 letters. Loop has 2 letters. [2020-07-29 03:27:43,551 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:27:43,552 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 46 states and 52 transitions. cyclomatic complexity: 10 Stem has 26 letters. Loop has 2 letters. [2020-07-29 03:27:43,552 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:27:43,552 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 27 states and 30 transitions. cyclomatic complexity: 6 Stem has 25 letters. Loop has 2 letters. [2020-07-29 03:27:43,552 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:27:43,552 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 10 states. Stem has 25 letters. Loop has 2 letters. [2020-07-29 03:27:43,553 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:27:43,553 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 46 states and 52 transitions. cyclomatic complexity: 10 Stem has 25 letters. Loop has 2 letters. [2020-07-29 03:27:43,553 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:27:43,553 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 27 states and 30 transitions. cyclomatic complexity: 6 Stem has 9 letters. Loop has 2 letters. [2020-07-29 03:27:43,553 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:27:43,554 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 10 states. Stem has 9 letters. Loop has 2 letters. [2020-07-29 03:27:43,554 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:27:43,554 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 46 states and 52 transitions. cyclomatic complexity: 10 Stem has 9 letters. Loop has 2 letters. [2020-07-29 03:27:43,554 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:27:43,554 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 27 states and 30 transitions. cyclomatic complexity: 6 Stem has 32 letters. Loop has 2 letters. [2020-07-29 03:27:43,555 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:27:43,555 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 10 states. Stem has 32 letters. Loop has 2 letters. [2020-07-29 03:27:43,555 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:27:43,555 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 46 states and 52 transitions. cyclomatic complexity: 10 Stem has 32 letters. Loop has 2 letters. [2020-07-29 03:27:43,555 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:27:43,556 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 27 states and 30 transitions. cyclomatic complexity: 6 Stem has 33 letters. Loop has 2 letters. [2020-07-29 03:27:43,556 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:27:43,556 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 10 states. Stem has 33 letters. Loop has 2 letters. [2020-07-29 03:27:43,556 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:27:43,556 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 46 states and 52 transitions. cyclomatic complexity: 10 Stem has 33 letters. Loop has 2 letters. [2020-07-29 03:27:43,557 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:27:43,557 INFO L161 tractBuchiDifference]: Finished testing correctness of buchiDifferenceNCSBLazy3 [2020-07-29 03:27:43,557 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2020-07-29 03:27:43,558 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 38 transitions. [2020-07-29 03:27:43,558 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 15 states and 38 transitions. Stem has 25 letters. Loop has 2 letters. [2020-07-29 03:27:43,558 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:27:43,558 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 15 states and 38 transitions. Stem has 27 letters. Loop has 2 letters. [2020-07-29 03:27:43,558 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:27:43,558 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 15 states and 38 transitions. Stem has 25 letters. Loop has 4 letters. [2020-07-29 03:27:43,559 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:27:43,559 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 46 states and 52 transitions. cyclomatic complexity: 10 [2020-07-29 03:27:43,559 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2020-07-29 03:27:43,560 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 46 states to 38 states and 41 transitions. [2020-07-29 03:27:43,560 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 19 [2020-07-29 03:27:43,560 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 20 [2020-07-29 03:27:43,561 INFO L73 IsDeterministic]: Start isDeterministic. Operand 38 states and 41 transitions. [2020-07-29 03:27:43,561 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-07-29 03:27:43,561 INFO L688 BuchiCegarLoop]: Abstraction has 38 states and 41 transitions. [2020-07-29 03:27:43,561 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states and 41 transitions. [2020-07-29 03:27:43,563 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 32. [2020-07-29 03:27:43,563 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-29 03:27:43,563 INFO L82 GeneralOperation]: Start isEquivalent. First operand 38 states and 41 transitions. Second operand 32 states. [2020-07-29 03:27:43,563 INFO L74 IsIncluded]: Start isIncluded. First operand 38 states and 41 transitions. Second operand 32 states. [2020-07-29 03:27:43,564 INFO L87 Difference]: Start difference. First operand 38 states and 41 transitions. Second operand 32 states. [2020-07-29 03:27:43,564 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2020-07-29 03:27:43,565 INFO L93 Difference]: Finished difference Result 40 states and 43 transitions. [2020-07-29 03:27:43,565 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 43 transitions. [2020-07-29 03:27:43,566 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 03:27:43,566 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 03:27:43,566 INFO L74 IsIncluded]: Start isIncluded. First operand 32 states. Second operand 38 states and 41 transitions. [2020-07-29 03:27:43,566 INFO L87 Difference]: Start difference. First operand 32 states. Second operand 38 states and 41 transitions. [2020-07-29 03:27:43,567 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2020-07-29 03:27:43,568 INFO L93 Difference]: Finished difference Result 40 states and 43 transitions. [2020-07-29 03:27:43,568 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 43 transitions. [2020-07-29 03:27:43,569 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 03:27:43,569 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 03:27:43,569 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-29 03:27:43,569 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-29 03:27:43,569 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2020-07-29 03:27:43,570 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 35 transitions. [2020-07-29 03:27:43,570 INFO L711 BuchiCegarLoop]: Abstraction has 32 states and 35 transitions. [2020-07-29 03:27:43,570 INFO L591 BuchiCegarLoop]: Abstraction has 32 states and 35 transitions. [2020-07-29 03:27:43,571 INFO L424 BuchiCegarLoop]: ======== Iteration 14============ [2020-07-29 03:27:43,571 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 32 states and 35 transitions. [2020-07-29 03:27:43,571 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2020-07-29 03:27:43,571 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 03:27:43,572 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 03:27:43,572 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-29 03:27:43,572 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2020-07-29 03:27:43,573 INFO L794 eck$LassoCheckResult]: Stem: 3688#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); 3683#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; 3684#L520 assume ldv_positive_~r~1 > 0;ldv_positive_#res := ldv_positive_~r~1; 3685#L521 entry_point_#t~ret44 := ldv_positive_#res;entry_point_~len~0 := entry_point_#t~ret44;havoc entry_point_#t~ret44; 3686#L787 assume !!(entry_point_~len~0 < 16777216); 3689#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; 3667#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; 3668#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; 3675#L789 assume entry_point_~array~0.base != 0 || entry_point_~array~0.offset != 0;entry_point_~i~2 := 0; 3676#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); 3681#L790-2 entry_point_#t~post46 := entry_point_~i~2;entry_point_~i~2 := 1 + entry_point_#t~post46;havoc entry_point_#t~post46; 3682#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); 3687#L790-2 entry_point_#t~post46 := entry_point_~i~2;entry_point_~i~2 := 1 + entry_point_#t~post46;havoc entry_point_#t~post46; 3696#L790-3 assume !(entry_point_~i~2 < entry_point_~len~0); 3690#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; 3691#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; 3694#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; 3698#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; 3697#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); 3692#L765-2 alloc_17_#t~post38 := alloc_17_~i~0;alloc_17_~i~0 := 1 + alloc_17_#t~post38;havoc alloc_17_#t~post38; 3693#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; 3671#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; 3672#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; 3679#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); 3680#L765-2 alloc_17_#t~post38 := alloc_17_~i~0;alloc_17_~i~0 := 1 + alloc_17_#t~post38;havoc alloc_17_#t~post38; 3695#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; 3669#L526-1 assume !(0 != ldv_malloc_#t~nondet11);havoc ldv_malloc_#t~nondet11;ldv_malloc_#res.base, ldv_malloc_#res.offset := 0, 0; 3670#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; 3677#L767 assume alloc_17_~p~0.base == 0 && alloc_17_~p~0.offset == 0; 3678#L767-1 alloc_17_~j~0 := alloc_17_~i~0 - 1; 3674#L772-3 [2020-07-29 03:27:43,573 INFO L796 eck$LassoCheckResult]: Loop: 3674#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); 3673#L772-2 alloc_17_#t~post40 := alloc_17_~j~0;alloc_17_~j~0 := alloc_17_#t~post40 - 1;havoc alloc_17_#t~post40; 3674#L772-3 [2020-07-29 03:27:43,573 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 03:27:43,573 INFO L82 PathProgramCache]: Analyzing trace with hash 2072715139, now seen corresponding path program 3 times [2020-07-29 03:27:43,574 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 03:27:43,574 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [350841674] [2020-07-29 03:27:43,574 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 03:27:43,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 03:27:43,698 INFO L280 TraceCheckUtils]: 0: Hoare triple {3909#true} #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); {3909#true} is VALID [2020-07-29 03:27:43,698 INFO L280 TraceCheckUtils]: 1: Hoare triple {3909#true} 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; {3909#true} is VALID [2020-07-29 03:27:43,699 INFO L280 TraceCheckUtils]: 2: Hoare triple {3909#true} assume ldv_positive_~r~1 > 0;ldv_positive_#res := ldv_positive_~r~1; {3909#true} is VALID [2020-07-29 03:27:43,699 INFO L280 TraceCheckUtils]: 3: Hoare triple {3909#true} entry_point_#t~ret44 := ldv_positive_#res;entry_point_~len~0 := entry_point_#t~ret44;havoc entry_point_#t~ret44; {3909#true} is VALID [2020-07-29 03:27:43,699 INFO L280 TraceCheckUtils]: 4: Hoare triple {3909#true} assume !!(entry_point_~len~0 < 16777216); {3909#true} is VALID [2020-07-29 03:27:43,699 INFO L280 TraceCheckUtils]: 5: Hoare triple {3909#true} 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; {3909#true} is VALID [2020-07-29 03:27:43,699 INFO L280 TraceCheckUtils]: 6: Hoare triple {3909#true} 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; {3909#true} is VALID [2020-07-29 03:27:43,700 INFO L280 TraceCheckUtils]: 7: Hoare triple {3909#true} 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; {3909#true} is VALID [2020-07-29 03:27:43,701 INFO L280 TraceCheckUtils]: 8: Hoare triple {3909#true} assume entry_point_~array~0.base != 0 || entry_point_~array~0.offset != 0;entry_point_~i~2 := 0; {3911#(= ULTIMATE.start_entry_point_~i~2 0)} is VALID [2020-07-29 03:27:43,701 INFO L280 TraceCheckUtils]: 9: Hoare triple {3911#(= ULTIMATE.start_entry_point_~i~2 0)} 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); {3911#(= ULTIMATE.start_entry_point_~i~2 0)} is VALID [2020-07-29 03:27:43,702 INFO L280 TraceCheckUtils]: 10: Hoare triple {3911#(= ULTIMATE.start_entry_point_~i~2 0)} entry_point_#t~post46 := entry_point_~i~2;entry_point_~i~2 := 1 + entry_point_#t~post46;havoc entry_point_#t~post46; {3912#(<= ULTIMATE.start_entry_point_~i~2 1)} is VALID [2020-07-29 03:27:43,703 INFO L280 TraceCheckUtils]: 11: Hoare triple {3912#(<= ULTIMATE.start_entry_point_~i~2 1)} 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); {3912#(<= ULTIMATE.start_entry_point_~i~2 1)} is VALID [2020-07-29 03:27:43,704 INFO L280 TraceCheckUtils]: 12: Hoare triple {3912#(<= ULTIMATE.start_entry_point_~i~2 1)} entry_point_#t~post46 := entry_point_~i~2;entry_point_~i~2 := 1 + entry_point_#t~post46;havoc entry_point_#t~post46; {3913#(<= ULTIMATE.start_entry_point_~i~2 2)} is VALID [2020-07-29 03:27:43,705 INFO L280 TraceCheckUtils]: 13: Hoare triple {3913#(<= ULTIMATE.start_entry_point_~i~2 2)} assume !(entry_point_~i~2 < entry_point_~len~0); {3914#(<= ULTIMATE.start_entry_point_~len~0 2)} is VALID [2020-07-29 03:27:43,706 INFO L280 TraceCheckUtils]: 14: Hoare triple {3914#(<= ULTIMATE.start_entry_point_~len~0 2)} 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; {3915#(and (<= ULTIMATE.start_alloc_17_~len 2) (= 0 ULTIMATE.start_alloc_17_~i~0))} is VALID [2020-07-29 03:27:43,707 INFO L280 TraceCheckUtils]: 15: Hoare triple {3915#(and (<= ULTIMATE.start_alloc_17_~len 2) (= 0 ULTIMATE.start_alloc_17_~i~0))} 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; {3915#(and (<= ULTIMATE.start_alloc_17_~len 2) (= 0 ULTIMATE.start_alloc_17_~i~0))} is VALID [2020-07-29 03:27:43,708 INFO L280 TraceCheckUtils]: 16: Hoare triple {3915#(and (<= ULTIMATE.start_alloc_17_~len 2) (= 0 ULTIMATE.start_alloc_17_~i~0))} 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; {3915#(and (<= ULTIMATE.start_alloc_17_~len 2) (= 0 ULTIMATE.start_alloc_17_~i~0))} is VALID [2020-07-29 03:27:43,709 INFO L280 TraceCheckUtils]: 17: Hoare triple {3915#(and (<= ULTIMATE.start_alloc_17_~len 2) (= 0 ULTIMATE.start_alloc_17_~i~0))} 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; {3915#(and (<= ULTIMATE.start_alloc_17_~len 2) (= 0 ULTIMATE.start_alloc_17_~i~0))} is VALID [2020-07-29 03:27:43,710 INFO L280 TraceCheckUtils]: 18: Hoare triple {3915#(and (<= ULTIMATE.start_alloc_17_~len 2) (= 0 ULTIMATE.start_alloc_17_~i~0))} 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); {3915#(and (<= ULTIMATE.start_alloc_17_~len 2) (= 0 ULTIMATE.start_alloc_17_~i~0))} is VALID [2020-07-29 03:27:43,711 INFO L280 TraceCheckUtils]: 19: Hoare triple {3915#(and (<= ULTIMATE.start_alloc_17_~len 2) (= 0 ULTIMATE.start_alloc_17_~i~0))} alloc_17_#t~post38 := alloc_17_~i~0;alloc_17_~i~0 := 1 + alloc_17_#t~post38;havoc alloc_17_#t~post38; {3916#(<= ULTIMATE.start_alloc_17_~len (+ ULTIMATE.start_alloc_17_~i~0 1))} is VALID [2020-07-29 03:27:43,712 INFO L280 TraceCheckUtils]: 20: Hoare triple {3916#(<= ULTIMATE.start_alloc_17_~len (+ ULTIMATE.start_alloc_17_~i~0 1))} 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; {3916#(<= ULTIMATE.start_alloc_17_~len (+ ULTIMATE.start_alloc_17_~i~0 1))} is VALID [2020-07-29 03:27:43,713 INFO L280 TraceCheckUtils]: 21: Hoare triple {3916#(<= ULTIMATE.start_alloc_17_~len (+ ULTIMATE.start_alloc_17_~i~0 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; {3916#(<= ULTIMATE.start_alloc_17_~len (+ ULTIMATE.start_alloc_17_~i~0 1))} is VALID [2020-07-29 03:27:43,714 INFO L280 TraceCheckUtils]: 22: Hoare triple {3916#(<= ULTIMATE.start_alloc_17_~len (+ ULTIMATE.start_alloc_17_~i~0 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; {3916#(<= ULTIMATE.start_alloc_17_~len (+ ULTIMATE.start_alloc_17_~i~0 1))} is VALID [2020-07-29 03:27:43,715 INFO L280 TraceCheckUtils]: 23: Hoare triple {3916#(<= ULTIMATE.start_alloc_17_~len (+ ULTIMATE.start_alloc_17_~i~0 1))} 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); {3916#(<= ULTIMATE.start_alloc_17_~len (+ ULTIMATE.start_alloc_17_~i~0 1))} is VALID [2020-07-29 03:27:43,716 INFO L280 TraceCheckUtils]: 24: Hoare triple {3916#(<= ULTIMATE.start_alloc_17_~len (+ ULTIMATE.start_alloc_17_~i~0 1))} alloc_17_#t~post38 := alloc_17_~i~0;alloc_17_~i~0 := 1 + alloc_17_#t~post38;havoc alloc_17_#t~post38; {3917#(<= ULTIMATE.start_alloc_17_~len ULTIMATE.start_alloc_17_~i~0)} is VALID [2020-07-29 03:27:43,717 INFO L280 TraceCheckUtils]: 25: Hoare triple {3917#(<= ULTIMATE.start_alloc_17_~len ULTIMATE.start_alloc_17_~i~0)} 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; {3910#false} is VALID [2020-07-29 03:27:43,717 INFO L280 TraceCheckUtils]: 26: Hoare triple {3910#false} assume !(0 != ldv_malloc_#t~nondet11);havoc ldv_malloc_#t~nondet11;ldv_malloc_#res.base, ldv_malloc_#res.offset := 0, 0; {3910#false} is VALID [2020-07-29 03:27:43,717 INFO L280 TraceCheckUtils]: 27: Hoare triple {3910#false} 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; {3910#false} is VALID [2020-07-29 03:27:43,718 INFO L280 TraceCheckUtils]: 28: Hoare triple {3910#false} assume alloc_17_~p~0.base == 0 && alloc_17_~p~0.offset == 0; {3910#false} is VALID [2020-07-29 03:27:43,718 INFO L280 TraceCheckUtils]: 29: Hoare triple {3910#false} alloc_17_~j~0 := alloc_17_~i~0 - 1; {3910#false} is VALID [2020-07-29 03:27:43,719 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 7 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-29 03:27:43,720 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [350841674] [2020-07-29 03:27:43,720 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [623945377] [2020-07-29 03:27:43,720 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 68 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 68 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-29 03:27:43,787 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2020-07-29 03:27:43,787 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-07-29 03:27:43,789 INFO L263 TraceCheckSpWp]: Trace formula consists of 175 conjuncts, 10 conjunts are in the unsatisfiable core [2020-07-29 03:27:43,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 03:27:43,804 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 03:27:44,072 INFO L280 TraceCheckUtils]: 0: Hoare triple {3909#true} #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); {3909#true} is VALID [2020-07-29 03:27:44,072 INFO L280 TraceCheckUtils]: 1: Hoare triple {3909#true} 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; {3909#true} is VALID [2020-07-29 03:27:44,072 INFO L280 TraceCheckUtils]: 2: Hoare triple {3909#true} assume ldv_positive_~r~1 > 0;ldv_positive_#res := ldv_positive_~r~1; {3909#true} is VALID [2020-07-29 03:27:44,072 INFO L280 TraceCheckUtils]: 3: Hoare triple {3909#true} entry_point_#t~ret44 := ldv_positive_#res;entry_point_~len~0 := entry_point_#t~ret44;havoc entry_point_#t~ret44; {3909#true} is VALID [2020-07-29 03:27:44,072 INFO L280 TraceCheckUtils]: 4: Hoare triple {3909#true} assume !!(entry_point_~len~0 < 16777216); {3909#true} is VALID [2020-07-29 03:27:44,073 INFO L280 TraceCheckUtils]: 5: Hoare triple {3909#true} 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; {3909#true} is VALID [2020-07-29 03:27:44,073 INFO L280 TraceCheckUtils]: 6: Hoare triple {3909#true} 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; {3909#true} is VALID [2020-07-29 03:27:44,073 INFO L280 TraceCheckUtils]: 7: Hoare triple {3909#true} 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; {3909#true} is VALID [2020-07-29 03:27:44,074 INFO L280 TraceCheckUtils]: 8: Hoare triple {3909#true} assume entry_point_~array~0.base != 0 || entry_point_~array~0.offset != 0;entry_point_~i~2 := 0; {3945#(<= ULTIMATE.start_entry_point_~i~2 0)} is VALID [2020-07-29 03:27:44,074 INFO L280 TraceCheckUtils]: 9: Hoare triple {3945#(<= ULTIMATE.start_entry_point_~i~2 0)} 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); {3945#(<= ULTIMATE.start_entry_point_~i~2 0)} is VALID [2020-07-29 03:27:44,075 INFO L280 TraceCheckUtils]: 10: Hoare triple {3945#(<= ULTIMATE.start_entry_point_~i~2 0)} entry_point_#t~post46 := entry_point_~i~2;entry_point_~i~2 := 1 + entry_point_#t~post46;havoc entry_point_#t~post46; {3912#(<= ULTIMATE.start_entry_point_~i~2 1)} is VALID [2020-07-29 03:27:44,075 INFO L280 TraceCheckUtils]: 11: Hoare triple {3912#(<= ULTIMATE.start_entry_point_~i~2 1)} 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); {3912#(<= ULTIMATE.start_entry_point_~i~2 1)} is VALID [2020-07-29 03:27:44,076 INFO L280 TraceCheckUtils]: 12: Hoare triple {3912#(<= ULTIMATE.start_entry_point_~i~2 1)} entry_point_#t~post46 := entry_point_~i~2;entry_point_~i~2 := 1 + entry_point_#t~post46;havoc entry_point_#t~post46; {3913#(<= ULTIMATE.start_entry_point_~i~2 2)} is VALID [2020-07-29 03:27:44,077 INFO L280 TraceCheckUtils]: 13: Hoare triple {3913#(<= ULTIMATE.start_entry_point_~i~2 2)} assume !(entry_point_~i~2 < entry_point_~len~0); {3914#(<= ULTIMATE.start_entry_point_~len~0 2)} is VALID [2020-07-29 03:27:44,078 INFO L280 TraceCheckUtils]: 14: Hoare triple {3914#(<= ULTIMATE.start_entry_point_~len~0 2)} 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; {3964#(and (<= 0 ULTIMATE.start_alloc_17_~i~0) (<= ULTIMATE.start_alloc_17_~len 2))} is VALID [2020-07-29 03:27:44,079 INFO L280 TraceCheckUtils]: 15: Hoare triple {3964#(and (<= 0 ULTIMATE.start_alloc_17_~i~0) (<= ULTIMATE.start_alloc_17_~len 2))} 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; {3964#(and (<= 0 ULTIMATE.start_alloc_17_~i~0) (<= ULTIMATE.start_alloc_17_~len 2))} is VALID [2020-07-29 03:27:44,080 INFO L280 TraceCheckUtils]: 16: Hoare triple {3964#(and (<= 0 ULTIMATE.start_alloc_17_~i~0) (<= ULTIMATE.start_alloc_17_~len 2))} 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; {3964#(and (<= 0 ULTIMATE.start_alloc_17_~i~0) (<= ULTIMATE.start_alloc_17_~len 2))} is VALID [2020-07-29 03:27:44,080 INFO L280 TraceCheckUtils]: 17: Hoare triple {3964#(and (<= 0 ULTIMATE.start_alloc_17_~i~0) (<= ULTIMATE.start_alloc_17_~len 2))} 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; {3964#(and (<= 0 ULTIMATE.start_alloc_17_~i~0) (<= ULTIMATE.start_alloc_17_~len 2))} is VALID [2020-07-29 03:27:44,082 INFO L280 TraceCheckUtils]: 18: Hoare triple {3964#(and (<= 0 ULTIMATE.start_alloc_17_~i~0) (<= ULTIMATE.start_alloc_17_~len 2))} 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); {3964#(and (<= 0 ULTIMATE.start_alloc_17_~i~0) (<= ULTIMATE.start_alloc_17_~len 2))} is VALID [2020-07-29 03:27:44,083 INFO L280 TraceCheckUtils]: 19: Hoare triple {3964#(and (<= 0 ULTIMATE.start_alloc_17_~i~0) (<= ULTIMATE.start_alloc_17_~len 2))} alloc_17_#t~post38 := alloc_17_~i~0;alloc_17_~i~0 := 1 + alloc_17_#t~post38;havoc alloc_17_#t~post38; {3980#(and (<= ULTIMATE.start_alloc_17_~len 2) (<= 1 ULTIMATE.start_alloc_17_~i~0))} is VALID [2020-07-29 03:27:44,084 INFO L280 TraceCheckUtils]: 20: Hoare triple {3980#(and (<= ULTIMATE.start_alloc_17_~len 2) (<= 1 ULTIMATE.start_alloc_17_~i~0))} 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; {3980#(and (<= ULTIMATE.start_alloc_17_~len 2) (<= 1 ULTIMATE.start_alloc_17_~i~0))} is VALID [2020-07-29 03:27:44,085 INFO L280 TraceCheckUtils]: 21: Hoare triple {3980#(and (<= ULTIMATE.start_alloc_17_~len 2) (<= 1 ULTIMATE.start_alloc_17_~i~0))} 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; {3980#(and (<= ULTIMATE.start_alloc_17_~len 2) (<= 1 ULTIMATE.start_alloc_17_~i~0))} is VALID [2020-07-29 03:27:44,085 INFO L280 TraceCheckUtils]: 22: Hoare triple {3980#(and (<= ULTIMATE.start_alloc_17_~len 2) (<= 1 ULTIMATE.start_alloc_17_~i~0))} 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; {3980#(and (<= ULTIMATE.start_alloc_17_~len 2) (<= 1 ULTIMATE.start_alloc_17_~i~0))} is VALID [2020-07-29 03:27:44,086 INFO L280 TraceCheckUtils]: 23: Hoare triple {3980#(and (<= ULTIMATE.start_alloc_17_~len 2) (<= 1 ULTIMATE.start_alloc_17_~i~0))} 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); {3980#(and (<= ULTIMATE.start_alloc_17_~len 2) (<= 1 ULTIMATE.start_alloc_17_~i~0))} is VALID [2020-07-29 03:27:44,087 INFO L280 TraceCheckUtils]: 24: Hoare triple {3980#(and (<= ULTIMATE.start_alloc_17_~len 2) (<= 1 ULTIMATE.start_alloc_17_~i~0))} alloc_17_#t~post38 := alloc_17_~i~0;alloc_17_~i~0 := 1 + alloc_17_#t~post38;havoc alloc_17_#t~post38; {3996#(and (<= 2 ULTIMATE.start_alloc_17_~i~0) (<= ULTIMATE.start_alloc_17_~len 2))} is VALID [2020-07-29 03:27:44,088 INFO L280 TraceCheckUtils]: 25: Hoare triple {3996#(and (<= 2 ULTIMATE.start_alloc_17_~i~0) (<= ULTIMATE.start_alloc_17_~len 2))} 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; {3910#false} is VALID [2020-07-29 03:27:44,088 INFO L280 TraceCheckUtils]: 26: Hoare triple {3910#false} assume !(0 != ldv_malloc_#t~nondet11);havoc ldv_malloc_#t~nondet11;ldv_malloc_#res.base, ldv_malloc_#res.offset := 0, 0; {3910#false} is VALID [2020-07-29 03:27:44,088 INFO L280 TraceCheckUtils]: 27: Hoare triple {3910#false} 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; {3910#false} is VALID [2020-07-29 03:27:44,089 INFO L280 TraceCheckUtils]: 28: Hoare triple {3910#false} assume alloc_17_~p~0.base == 0 && alloc_17_~p~0.offset == 0; {3910#false} is VALID [2020-07-29 03:27:44,089 INFO L280 TraceCheckUtils]: 29: Hoare triple {3910#false} alloc_17_~j~0 := alloc_17_~i~0 - 1; {3910#false} is VALID [2020-07-29 03:27:44,090 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 13 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-29 03:27:44,091 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-29 03:27:44,091 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 13 [2020-07-29 03:27:44,091 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [395777489] [2020-07-29 03:27:44,092 INFO L799 eck$LassoCheckResult]: stem already infeasible [2020-07-29 03:27:44,092 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 03:27:44,092 INFO L82 PathProgramCache]: Analyzing trace with hash 3395, now seen corresponding path program 6 times [2020-07-29 03:27:44,092 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 03:27:44,092 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1515823097] [2020-07-29 03:27:44,092 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 03:27:44,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 03:27:44,096 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 03:27:44,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 03:27:44,099 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 03:27:44,100 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 03:27:44,205 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-29 03:27:44,205 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-07-29 03:27:44,205 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=119, Unknown=0, NotChecked=0, Total=156 [2020-07-29 03:27:44,205 INFO L87 Difference]: Start difference. First operand 32 states and 35 transitions. cyclomatic complexity: 6 Second operand 13 states. [2020-07-29 03:27:44,630 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 03:27:44,630 INFO L93 Difference]: Finished difference Result 47 states and 50 transitions. [2020-07-29 03:27:44,631 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-07-29 03:27:44,631 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 13 states. [2020-07-29 03:27:44,703 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 45 edges. 45 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-29 03:27:44,704 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 47 states and 50 transitions. [2020-07-29 03:27:44,705 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2020-07-29 03:27:44,707 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 47 states to 35 states and 38 transitions. [2020-07-29 03:27:44,708 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 18 [2020-07-29 03:27:44,708 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 18 [2020-07-29 03:27:44,708 INFO L73 IsDeterministic]: Start isDeterministic. Operand 35 states and 38 transitions. [2020-07-29 03:27:44,708 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-07-29 03:27:44,708 INFO L688 BuchiCegarLoop]: Abstraction has 35 states and 38 transitions. [2020-07-29 03:27:44,708 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states and 38 transitions. [2020-07-29 03:27:44,710 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 34. [2020-07-29 03:27:44,710 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-29 03:27:44,710 INFO L82 GeneralOperation]: Start isEquivalent. First operand 35 states and 38 transitions. Second operand 34 states. [2020-07-29 03:27:44,710 INFO L74 IsIncluded]: Start isIncluded. First operand 35 states and 38 transitions. Second operand 34 states. [2020-07-29 03:27:44,714 INFO L87 Difference]: Start difference. First operand 35 states and 38 transitions. Second operand 34 states. [2020-07-29 03:27:44,715 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2020-07-29 03:27:44,718 INFO L93 Difference]: Finished difference Result 40 states and 43 transitions. [2020-07-29 03:27:44,718 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 43 transitions. [2020-07-29 03:27:44,720 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 03:27:44,720 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 03:27:44,720 INFO L74 IsIncluded]: Start isIncluded. First operand 34 states. Second operand 35 states and 38 transitions. [2020-07-29 03:27:44,721 INFO L87 Difference]: Start difference. First operand 34 states. Second operand 35 states and 38 transitions. [2020-07-29 03:27:44,721 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2020-07-29 03:27:44,722 INFO L93 Difference]: Finished difference Result 40 states and 43 transitions. [2020-07-29 03:27:44,723 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 43 transitions. [2020-07-29 03:27:44,723 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 03:27:44,723 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 03:27:44,723 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-29 03:27:44,724 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-29 03:27:44,724 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2020-07-29 03:27:44,725 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 37 transitions. [2020-07-29 03:27:44,725 INFO L711 BuchiCegarLoop]: Abstraction has 34 states and 37 transitions. [2020-07-29 03:27:44,725 INFO L591 BuchiCegarLoop]: Abstraction has 34 states and 37 transitions. [2020-07-29 03:27:44,725 INFO L424 BuchiCegarLoop]: ======== Iteration 15============ [2020-07-29 03:27:44,725 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 34 states and 37 transitions. [2020-07-29 03:27:44,726 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2020-07-29 03:27:44,729 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 03:27:44,729 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 03:27:44,730 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-29 03:27:44,730 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2020-07-29 03:27:44,730 INFO L794 eck$LassoCheckResult]: Stem: 4088#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); 4082#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; 4083#L520 assume ldv_positive_~r~1 > 0;ldv_positive_#res := ldv_positive_~r~1; 4084#L521 entry_point_#t~ret44 := ldv_positive_#res;entry_point_~len~0 := entry_point_#t~ret44;havoc entry_point_#t~ret44; 4085#L787 assume !!(entry_point_~len~0 < 16777216); 4089#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; 4066#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; 4067#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; 4074#L789 assume entry_point_~array~0.base != 0 || entry_point_~array~0.offset != 0;entry_point_~i~2 := 0; 4075#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); 4086#L790-2 entry_point_#t~post46 := entry_point_~i~2;entry_point_~i~2 := 1 + entry_point_#t~post46;havoc entry_point_#t~post46; 4087#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); 4080#L790-2 entry_point_#t~post46 := entry_point_~i~2;entry_point_~i~2 := 1 + entry_point_#t~post46;havoc entry_point_#t~post46; 4081#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); 4099#L790-2 entry_point_#t~post46 := entry_point_~i~2;entry_point_~i~2 := 1 + entry_point_#t~post46;havoc entry_point_#t~post46; 4098#L790-3 assume !(entry_point_~i~2 < entry_point_~len~0); 4090#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; 4091#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; 4070#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; 4071#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; 4078#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); 4079#L765-2 alloc_17_#t~post38 := alloc_17_~i~0;alloc_17_~i~0 := 1 + alloc_17_#t~post38;havoc alloc_17_#t~post38; 4092#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; 4093#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; 4097#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; 4096#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); 4095#L765-2 alloc_17_#t~post38 := alloc_17_~i~0;alloc_17_~i~0 := 1 + alloc_17_#t~post38;havoc alloc_17_#t~post38; 4094#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; 4068#L526-1 assume !(0 != ldv_malloc_#t~nondet11);havoc ldv_malloc_#t~nondet11;ldv_malloc_#res.base, ldv_malloc_#res.offset := 0, 0; 4069#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; 4076#L767 assume alloc_17_~p~0.base == 0 && alloc_17_~p~0.offset == 0; 4077#L767-1 alloc_17_~j~0 := alloc_17_~i~0 - 1; 4073#L772-3 [2020-07-29 03:27:44,731 INFO L796 eck$LassoCheckResult]: Loop: 4073#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); 4072#L772-2 alloc_17_#t~post40 := alloc_17_~j~0;alloc_17_~j~0 := alloc_17_#t~post40 - 1;havoc alloc_17_#t~post40; 4073#L772-3 [2020-07-29 03:27:44,731 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 03:27:44,731 INFO L82 PathProgramCache]: Analyzing trace with hash 929134529, now seen corresponding path program 4 times [2020-07-29 03:27:44,731 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 03:27:44,732 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2144862872] [2020-07-29 03:27:44,732 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 03:27:44,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 03:27:44,768 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 03:27:44,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 03:27:44,802 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 03:27:44,815 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 03:27:44,816 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 03:27:44,817 INFO L82 PathProgramCache]: Analyzing trace with hash 3395, now seen corresponding path program 7 times [2020-07-29 03:27:44,817 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 03:27:44,817 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1353325649] [2020-07-29 03:27:44,817 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 03:27:44,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 03:27:44,821 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 03:27:44,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 03:27:44,824 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 03:27:44,825 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 03:27:44,826 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 03:27:44,826 INFO L82 PathProgramCache]: Analyzing trace with hash -454912765, now seen corresponding path program 2 times [2020-07-29 03:27:44,827 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 03:27:44,827 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [847315594] [2020-07-29 03:27:44,827 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 03:27:44,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 03:27:44,872 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 03:27:44,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 03:27:44,906 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 03:27:44,917 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 03:27:58,644 WARN L193 SmtUtils]: Spent 13.60 s on a formula simplification. DAG size of input: 340 DAG size of output: 284 [2020-07-29 03:27:59,001 INFO L544 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-07-29 03:28:00,574 WARN L193 SmtUtils]: Spent 1.57 s on a formula simplification that was a NOOP. DAG size: 172 [2020-07-29 03:28:00,574 INFO L624 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-29 03:28:00,589 INFO L544 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-07-29 03:28:01,986 WARN L193 SmtUtils]: Spent 1.40 s on a formula simplification that was a NOOP. DAG size: 168 [2020-07-29 03:28:01,987 INFO L624 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-29 03:28:01,998 INFO L544 ElimStorePlain]: Start of recursive call 4: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-07-29 03:28:03,115 WARN L193 SmtUtils]: Spent 1.12 s on a formula simplification that was a NOOP. DAG size: 165 [2020-07-29 03:28:03,116 INFO L624 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-29 03:28:03,128 INFO L544 ElimStorePlain]: Start of recursive call 5: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-07-29 03:28:04,081 WARN L193 SmtUtils]: Spent 951.00 ms on a formula simplification that was a NOOP. DAG size: 161 [2020-07-29 03:28:04,082 INFO L624 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-29 03:28:04,122 INFO L544 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 4 dim-2 vars, End of recursive call: 6 dim-0 vars, and 1 xjuncts. [2020-07-29 03:28:04,123 INFO L244 ElimStorePlain]: Needed 5 recursive calls to eliminate 6 variables, input treesize:488, output treesize:454 [2020-07-29 03:28:16,132 WARN L406 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2020-07-29 03:28:16,132 WARN L407 uantifierElimination]: Input elimination task: ∃ [|v_ULTIMATE.start_ldv_malloc_#t~malloc12.base_111|, |v_ULTIMATE.start_ldv_malloc_#t~malloc12.base_109|, |v_#memory_int_98|, |v_#memory_int_100|, |v_#memory_int_101|, |v_#memory_int_99|]. (let ((.cse0 (store |v_#valid_230| 0 0))) (let ((.cse13 (store .cse0 |v_~#ldv_global_msg_list~0.base_446| 1))) (let ((.cse15 (store .cse13 v_ULTIMATE.start_entry_point_~array~0.base_307 1)) (.cse16 (* v_ULTIMATE.start_entry_point_~i~2_176 4)) (.cse17 (* v_ULTIMATE.start_alloc_17_~i~0_147 4))) (let ((.cse4 (select |v_#memory_$Pointer$.base_201| |v_~#ldv_global_msg_list~0.base_446|)) (.cse3 (select |v_#memory_$Pointer$.offset_143| |v_~#ldv_global_msg_list~0.base_446|)) (.cse5 (+ |v_~#ldv_global_msg_list~0.offset_282| 4)) (.cse2 (+ v_ULTIMATE.start_alloc_17_~array.offset_227 .cse17 (- 4))) (.cse8 (+ v_ULTIMATE.start_entry_point_~array~0.offset_167 .cse16 (- 8))) (.cse10 (store .cse15 |v_ULTIMATE.start_ldv_malloc_#t~malloc12.base_111| 1)) (.cse1 (select |v_#memory_int_98| v_ULTIMATE.start_alloc_17_~array.base_317)) (.cse7 (+ v_ULTIMATE.start_alloc_17_~array.offset_227 .cse17 (- 8))) (.cse11 (select |v_#memory_int_101| v_ULTIMATE.start_entry_point_~array~0.base_307)) (.cse12 (select |v_#memory_int_100| v_ULTIMATE.start_entry_point_~array~0.base_307)) (.cse9 (+ v_ULTIMATE.start_entry_point_~array~0.offset_167 .cse16 (- 4)))) (and (= 0 |v_~#ldv_global_msg_list~0.offset_282|) (= |v_ULTIMATE.start_alloc_17_#in~len_8| v_ULTIMATE.start_alloc_17_~len_14) (= v_ULTIMATE.start_ldv_positive_~r~1_14 |v_ULTIMATE.start_ldv_positive_#res_17|) (= 1 (+ v_ULTIMATE.start_entry_point_~i~2_176 (- 2))) (= 0 (select .cse0 |v_~#ldv_global_msg_list~0.base_446|)) (not (= 0 v_ULTIMATE.start_entry_point_~array~0.base_307)) (< v_ULTIMATE.start_alloc_17_~i~0_147 v_ULTIMATE.start_alloc_17_~len_14) (= v_ULTIMATE.start_ldv_malloc_~size_22 |v_ULTIMATE.start_ldv_malloc_#in~size_18|) (= (store (store (store (store |v_#length_145| |v_~#ldv_global_msg_list~0.base_446| 8) v_ULTIMATE.start_entry_point_~array~0.base_307 (* v_ULTIMATE.start_entry_point_~len~0_24 4)) |v_ULTIMATE.start_ldv_malloc_#t~malloc12.base_111| 4) |v_ULTIMATE.start_ldv_malloc_#t~malloc12.base_109| 4) |v_#length_141|) (= (store |v_#memory_int_98| v_ULTIMATE.start_alloc_17_~array.base_317 (store .cse1 .cse2 (select (select |v_#memory_int_97| v_ULTIMATE.start_alloc_17_~array.base_317) .cse2))) |v_#memory_int_97|) (= |v_~#ldv_global_msg_list~0.offset_282| (select .cse3 |v_~#ldv_global_msg_list~0.offset_282|)) (<= 8 (+ v_ULTIMATE.start_alloc_17_~array.offset_227 (* 4 v_ULTIMATE.start_alloc_17_~i~0_147))) (= 0 |v_#NULL.offset_10|) (= v_ULTIMATE.start_entry_point_~array~0.base_307 |v_ULTIMATE.start_alloc_17_#in~array.base_8|) (not (= 0 |v_ULTIMATE.start_ldv_malloc_#t~malloc12.base_111|)) (< |v_ULTIMATE.start_ldv_malloc_#t~malloc12.base_109| |v_#StackHeapBarrier_11|) (= v_ULTIMATE.start_alloc_17_~p~0.base_20 |v_ULTIMATE.start_ldv_malloc_#res.base_34|) (= (select .cse4 .cse5) |v_~#ldv_global_msg_list~0.base_446|) (= (select .cse4 |v_~#ldv_global_msg_list~0.offset_282|) |v_~#ldv_global_msg_list~0.base_446|) (= |v_#memory_$Pointer$.base_196| (let ((.cse6 (store |v_#memory_$Pointer$.base_201| v_ULTIMATE.start_entry_point_~array~0.base_307 (store (store (store (select |v_#memory_$Pointer$.base_201| v_ULTIMATE.start_entry_point_~array~0.base_307) v_ULTIMATE.start_entry_point_~array~0.offset_167 0) .cse8 0) .cse9 0)))) (store .cse6 v_ULTIMATE.start_alloc_17_~array.base_317 (store (store (select .cse6 v_ULTIMATE.start_alloc_17_~array.base_317) .cse7 |v_ULTIMATE.start_ldv_malloc_#t~malloc12.base_111|) .cse2 |v_ULTIMATE.start_ldv_malloc_#t~malloc12.base_109|)))) (= 4 |v_ULTIMATE.start_ldv_malloc_#in~size_18|) (= v_ULTIMATE.start_alloc_17_~array.base_317 |v_ULTIMATE.start_alloc_17_#in~array.base_8|) (= 0 (select .cse10 |v_ULTIMATE.start_ldv_malloc_#t~malloc12.base_109|)) (= (store |v_#memory_int_101| v_ULTIMATE.start_entry_point_~array~0.base_307 (store .cse11 .cse8 (select .cse12 .cse8))) |v_#memory_int_100|) (= 0 |v_ULTIMATE.start_ldv_malloc_#res.offset_34|) (= 0 (select .cse13 v_ULTIMATE.start_entry_point_~array~0.base_307)) (not (< v_ULTIMATE.start_entry_point_~i~2_176 v_ULTIMATE.start_entry_point_~len~0_24)) (= 0 |v_#NULL.base_10|) (= |v_ULTIMATE.start_alloc_17_#in~array.offset_8| v_ULTIMATE.start_entry_point_~array~0.offset_167) (< |v_#StackHeapBarrier_11| |v_~#ldv_global_msg_list~0.base_446|) (= (select .cse3 .cse5) |v_~#ldv_global_msg_list~0.offset_282|) (not (= 0 |v_ULTIMATE.start_ldv_malloc_#t~malloc12.base_109|)) (= v_ULTIMATE.start_entry_point_~len~0_24 |v_ULTIMATE.start_ldv_positive_#res_17|) (= |v_#memory_$Pointer$.offset_138| (let ((.cse14 (store |v_#memory_$Pointer$.offset_143| v_ULTIMATE.start_entry_point_~array~0.base_307 (store (store (store (select |v_#memory_$Pointer$.offset_143| v_ULTIMATE.start_entry_point_~array~0.base_307) v_ULTIMATE.start_entry_point_~array~0.offset_167 0) .cse8 0) .cse9 0)))) (store .cse14 v_ULTIMATE.start_alloc_17_~array.base_317 (store (store (select .cse14 v_ULTIMATE.start_alloc_17_~array.base_317) .cse7 0) .cse2 0)))) (= v_ULTIMATE.start_alloc_17_~j~0_116 (+ v_ULTIMATE.start_alloc_17_~i~0_147 (- 1))) (= v_ULTIMATE.start_entry_point_~len~0_24 |v_ULTIMATE.start_alloc_17_#in~len_8|) (= |v_#valid_226| (store .cse10 |v_ULTIMATE.start_ldv_malloc_#t~malloc12.base_109| 1)) (= |v_ULTIMATE.start_alloc_17_#in~array.offset_8| v_ULTIMATE.start_alloc_17_~array.offset_227) (< v_ULTIMATE.start_entry_point_~array~0.base_307 |v_#StackHeapBarrier_11|) (= (store |v_#memory_int_99| v_ULTIMATE.start_alloc_17_~array.base_317 (store (select |v_#memory_int_99| v_ULTIMATE.start_alloc_17_~array.base_317) .cse7 (select .cse1 .cse7))) |v_#memory_int_98|) (= 0 v_ULTIMATE.start_alloc_17_~p~0.offset_19) (< |v_ULTIMATE.start_ldv_malloc_#t~malloc12.base_111| |v_#StackHeapBarrier_11|) (= 0 (select .cse15 |v_ULTIMATE.start_ldv_malloc_#t~malloc12.base_111|)) (<= (+ v_ULTIMATE.start_entry_point_~array~0.offset_167 (* 4 v_ULTIMATE.start_entry_point_~i~2_176)) (* 4 v_ULTIMATE.start_entry_point_~len~0_24)) (= 0 v_ULTIMATE.start_alloc_17_~p~0.base_20) (= |v_#memory_int_101| (store |v_#memory_int_102| v_ULTIMATE.start_entry_point_~array~0.base_307 (store (select |v_#memory_int_102| v_ULTIMATE.start_entry_point_~array~0.base_307) v_ULTIMATE.start_entry_point_~array~0.offset_167 (select .cse11 v_ULTIMATE.start_entry_point_~array~0.offset_167)))) (= (store |v_#memory_int_100| v_ULTIMATE.start_entry_point_~array~0.base_307 (store .cse12 .cse9 (select (select |v_#memory_int_99| v_ULTIMATE.start_entry_point_~array~0.base_307) .cse9))) |v_#memory_int_99|) (< 0 |v_#StackHeapBarrier_11|)))))) [2020-07-29 03:28:16,133 WARN L408 uantifierElimination]: ElimStorePlain result: ∃ [v_DerPreprocessor_6, v_DerPreprocessor_5, v_DerPreprocessor_7, v_DerPreprocessor_8, |v_ULTIMATE.start_ldv_malloc_#t~malloc12.base_111|, |v_ULTIMATE.start_ldv_malloc_#t~malloc12.base_109|]. (let ((.cse0 (store |v_#valid_230| 0 0))) (let ((.cse11 (store .cse0 |v_~#ldv_global_msg_list~0.base_446| 1))) (let ((.cse13 (store .cse11 v_ULTIMATE.start_entry_point_~array~0.base_307 1)) (.cse14 (* v_ULTIMATE.start_entry_point_~i~2_176 4)) (.cse15 (* v_ULTIMATE.start_alloc_17_~i~0_147 4))) (let ((.cse2 (select |v_#memory_$Pointer$.base_201| |v_~#ldv_global_msg_list~0.base_446|)) (.cse1 (select |v_#memory_$Pointer$.offset_143| |v_~#ldv_global_msg_list~0.base_446|)) (.cse3 (+ |v_~#ldv_global_msg_list~0.offset_282| 4)) (.cse5 (+ v_ULTIMATE.start_alloc_17_~array.offset_227 .cse15 (- 8))) (.cse6 (+ v_ULTIMATE.start_alloc_17_~array.offset_227 .cse15 (- 4))) (.cse7 (+ v_ULTIMATE.start_entry_point_~array~0.offset_167 .cse14 (- 8))) (.cse8 (+ v_ULTIMATE.start_entry_point_~array~0.offset_167 .cse14 (- 4))) (.cse9 (store .cse13 |v_ULTIMATE.start_ldv_malloc_#t~malloc12.base_111| 1))) (and (= 0 |v_~#ldv_global_msg_list~0.offset_282|) (= |v_ULTIMATE.start_alloc_17_#in~len_8| v_ULTIMATE.start_alloc_17_~len_14) (= v_ULTIMATE.start_ldv_positive_~r~1_14 |v_ULTIMATE.start_ldv_positive_#res_17|) (= 1 (+ v_ULTIMATE.start_entry_point_~i~2_176 (- 2))) (= 0 (select .cse0 |v_~#ldv_global_msg_list~0.base_446|)) (not (= 0 v_ULTIMATE.start_entry_point_~array~0.base_307)) (< v_ULTIMATE.start_alloc_17_~i~0_147 v_ULTIMATE.start_alloc_17_~len_14) (= v_ULTIMATE.start_ldv_malloc_~size_22 |v_ULTIMATE.start_ldv_malloc_#in~size_18|) (= (store (store (store (store |v_#length_145| |v_~#ldv_global_msg_list~0.base_446| 8) v_ULTIMATE.start_entry_point_~array~0.base_307 (* v_ULTIMATE.start_entry_point_~len~0_24 4)) |v_ULTIMATE.start_ldv_malloc_#t~malloc12.base_111| 4) |v_ULTIMATE.start_ldv_malloc_#t~malloc12.base_109| 4) |v_#length_141|) (= |v_~#ldv_global_msg_list~0.offset_282| (select .cse1 |v_~#ldv_global_msg_list~0.offset_282|)) (<= 8 (+ v_ULTIMATE.start_alloc_17_~array.offset_227 (* 4 v_ULTIMATE.start_alloc_17_~i~0_147))) (= 0 |v_#NULL.offset_10|) (not (= 0 |v_ULTIMATE.start_ldv_malloc_#t~malloc12.base_111|)) (= v_ULTIMATE.start_entry_point_~array~0.base_307 |v_ULTIMATE.start_alloc_17_#in~array.base_8|) (< |v_ULTIMATE.start_ldv_malloc_#t~malloc12.base_109| |v_#StackHeapBarrier_11|) (= v_ULTIMATE.start_alloc_17_~p~0.base_20 |v_ULTIMATE.start_ldv_malloc_#res.base_34|) (= (select .cse2 .cse3) |v_~#ldv_global_msg_list~0.base_446|) (= (select .cse2 |v_~#ldv_global_msg_list~0.offset_282|) |v_~#ldv_global_msg_list~0.base_446|) (= |v_#memory_$Pointer$.base_196| (let ((.cse4 (store |v_#memory_$Pointer$.base_201| v_ULTIMATE.start_entry_point_~array~0.base_307 (store (store (store (select |v_#memory_$Pointer$.base_201| v_ULTIMATE.start_entry_point_~array~0.base_307) v_ULTIMATE.start_entry_point_~array~0.offset_167 0) .cse7 0) .cse8 0)))) (store .cse4 v_ULTIMATE.start_alloc_17_~array.base_317 (store (store (select .cse4 v_ULTIMATE.start_alloc_17_~array.base_317) .cse5 |v_ULTIMATE.start_ldv_malloc_#t~malloc12.base_111|) .cse6 |v_ULTIMATE.start_ldv_malloc_#t~malloc12.base_109|)))) (= 4 |v_ULTIMATE.start_ldv_malloc_#in~size_18|) (= v_ULTIMATE.start_alloc_17_~array.base_317 |v_ULTIMATE.start_alloc_17_#in~array.base_8|) (= 0 (select .cse9 |v_ULTIMATE.start_ldv_malloc_#t~malloc12.base_109|)) (= (let ((.cse10 (store |v_#memory_int_102| v_ULTIMATE.start_entry_point_~array~0.base_307 (store (store (store (select |v_#memory_int_102| v_ULTIMATE.start_entry_point_~array~0.base_307) v_ULTIMATE.start_entry_point_~array~0.offset_167 v_DerPreprocessor_6) .cse7 v_DerPreprocessor_5) .cse8 v_DerPreprocessor_7)))) (store .cse10 v_ULTIMATE.start_alloc_17_~array.base_317 (store (store (select .cse10 v_ULTIMATE.start_alloc_17_~array.base_317) .cse5 v_DerPreprocessor_8) .cse6 (select (select |v_#memory_int_97| v_ULTIMATE.start_alloc_17_~array.base_317) .cse6)))) |v_#memory_int_97|) (= 0 |v_ULTIMATE.start_ldv_malloc_#res.offset_34|) (= 0 (select .cse11 v_ULTIMATE.start_entry_point_~array~0.base_307)) (not (< v_ULTIMATE.start_entry_point_~i~2_176 v_ULTIMATE.start_entry_point_~len~0_24)) (= 0 |v_#NULL.base_10|) (= |v_ULTIMATE.start_alloc_17_#in~array.offset_8| v_ULTIMATE.start_entry_point_~array~0.offset_167) (< |v_#StackHeapBarrier_11| |v_~#ldv_global_msg_list~0.base_446|) (= (select .cse1 .cse3) |v_~#ldv_global_msg_list~0.offset_282|) (not (= 0 |v_ULTIMATE.start_ldv_malloc_#t~malloc12.base_109|)) (= v_ULTIMATE.start_entry_point_~len~0_24 |v_ULTIMATE.start_ldv_positive_#res_17|) (= |v_#memory_$Pointer$.offset_138| (let ((.cse12 (store |v_#memory_$Pointer$.offset_143| v_ULTIMATE.start_entry_point_~array~0.base_307 (store (store (store (select |v_#memory_$Pointer$.offset_143| v_ULTIMATE.start_entry_point_~array~0.base_307) v_ULTIMATE.start_entry_point_~array~0.offset_167 0) .cse7 0) .cse8 0)))) (store .cse12 v_ULTIMATE.start_alloc_17_~array.base_317 (store (store (select .cse12 v_ULTIMATE.start_alloc_17_~array.base_317) .cse5 0) .cse6 0)))) (= v_ULTIMATE.start_alloc_17_~j~0_116 (+ v_ULTIMATE.start_alloc_17_~i~0_147 (- 1))) (= v_ULTIMATE.start_entry_point_~len~0_24 |v_ULTIMATE.start_alloc_17_#in~len_8|) (= |v_#valid_226| (store .cse9 |v_ULTIMATE.start_ldv_malloc_#t~malloc12.base_109| 1)) (= |v_ULTIMATE.start_alloc_17_#in~array.offset_8| v_ULTIMATE.start_alloc_17_~array.offset_227) (< v_ULTIMATE.start_entry_point_~array~0.base_307 |v_#StackHeapBarrier_11|) (= 0 v_ULTIMATE.start_alloc_17_~p~0.offset_19) (= 0 (select .cse13 |v_ULTIMATE.start_ldv_malloc_#t~malloc12.base_111|)) (< |v_ULTIMATE.start_ldv_malloc_#t~malloc12.base_111| |v_#StackHeapBarrier_11|) (<= (+ v_ULTIMATE.start_entry_point_~array~0.offset_167 (* 4 v_ULTIMATE.start_entry_point_~i~2_176)) (* 4 v_ULTIMATE.start_entry_point_~len~0_24)) (= 0 v_ULTIMATE.start_alloc_17_~p~0.base_20) (< 0 |v_#StackHeapBarrier_11|)))))) [2020-07-29 03:28:17,116 WARN L193 SmtUtils]: Spent 946.00 ms on a formula simplification that was a NOOP. DAG size: 161 [2020-07-29 03:28:17,121 INFO L210 LassoAnalysis]: Preferences: [2020-07-29 03:28:17,121 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2020-07-29 03:28:17,121 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-07-29 03:28:17,121 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2020-07-29 03:28:17,122 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2020-07-29 03:28:17,122 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 03:28:17,122 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2020-07-29 03:28:17,122 INFO L132 ssoRankerPreferences]: Path of dumped script: [2020-07-29 03:28:17,122 INFO L133 ssoRankerPreferences]: Filename of dumped script: memleaks_test17_2-2.i_Iteration15_Lasso [2020-07-29 03:28:17,122 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2020-07-29 03:28:17,122 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2020-07-29 03:28:17,157 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:28:17,161 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:28:17,165 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:28:17,171 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:28:17,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-07-29 03:28:17,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-07-29 03:28:17,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-07-29 03:28:17,191 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:28:17,201 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:28:17,206 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:28:17,211 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:28:17,217 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:28:17,222 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:28:17,227 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:28:17,808 WARN L193 SmtUtils]: Spent 311.00 ms on a formula simplification. DAG size of input: 90 DAG size of output: 84 [2020-07-29 03:28:17,914 WARN L257 bleTransFormulaUtils]: 6 quantified variables [2020-07-29 03:28:17,914 WARN L257 bleTransFormulaUtils]: 2 quantified variables [2020-07-29 03:28:17,939 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:28:17,951 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:28:17,956 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:28:17,962 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:28:17,966 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:28:17,972 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:28:17,976 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:28:17,985 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:28:17,991 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:28:17,995 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:28:18,001 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:28:18,006 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:28:18,011 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:28:18,016 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:28:18,520 WARN L193 SmtUtils]: Spent 140.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 48 [2020-07-29 03:28:19,607 WARN L193 SmtUtils]: Spent 554.00 ms on a formula simplification. DAG size of input: 41 DAG size of output: 41 [2020-07-29 03:28:19,811 INFO L292 LassoAnalysis]: Preprocessing complete. [2020-07-29 03:28:19,811 INFO L489 LassoAnalysis]: Using template 'affine'. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 69 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 69 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 03:28:19,814 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-07-29 03:28:19,815 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 03:28:19,816 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 03:28:19,816 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 03:28:19,816 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 03:28:19,816 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 03:28:19,816 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 03:28:19,816 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 03:28:19,817 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 70 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 70 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 03:28:19,838 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-07-29 03:28:19,839 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 03:28:19,839 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 03:28:19,839 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 03:28:19,839 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 03:28:19,839 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 03:28:19,840 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 03:28:19,840 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 03:28:19,841 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 71 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 71 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 03:28:19,863 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-07-29 03:28:19,864 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 03:28:19,864 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 03:28:19,864 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 03:28:19,864 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 03:28:19,865 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-29 03:28:19,865 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-07-29 03:28:19,869 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 72 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 72 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 03:28:19,890 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-07-29 03:28:19,892 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 03:28:19,892 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 03:28:19,892 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 03:28:19,892 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 03:28:19,893 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-29 03:28:19,893 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-07-29 03:28:19,897 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 73 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 73 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 03:28:19,919 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-07-29 03:28:19,920 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 03:28:19,920 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 03:28:19,920 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 03:28:19,920 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 03:28:19,921 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-29 03:28:19,921 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-07-29 03:28:19,923 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 74 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-07-29 03:28:19,949 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 74 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 03:28:19,950 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 03:28:19,950 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 03:28:19,950 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 03:28:19,950 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 03:28:19,951 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-29 03:28:19,951 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-07-29 03:28:19,954 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 75 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 75 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 03:28:19,977 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-07-29 03:28:19,979 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 03:28:19,979 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 03:28:19,979 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 03:28:19,979 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 03:28:19,979 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 03:28:19,980 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 03:28:19,980 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 03:28:19,981 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 76 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 76 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 03:28:20,002 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-07-29 03:28:20,003 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 03:28:20,003 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 03:28:20,003 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 03:28:20,003 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 03:28:20,004 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-29 03:28:20,004 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-07-29 03:28:20,008 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 77 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 77 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 03:28:20,029 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-07-29 03:28:20,030 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 03:28:20,030 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 03:28:20,030 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 03:28:20,030 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 03:28:20,030 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 03:28:20,030 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 03:28:20,030 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 03:28:20,031 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 78 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 78 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 03:28:20,053 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-07-29 03:28:20,054 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 03:28:20,055 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 03:28:20,055 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 03:28:20,055 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 03:28:20,055 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 03:28:20,055 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 03:28:20,055 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 03:28:20,056 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 79 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 79 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 03:28:20,078 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-07-29 03:28:20,079 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 03:28:20,079 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 03:28:20,080 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 03:28:20,080 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 03:28:20,080 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-29 03:28:20,081 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-07-29 03:28:20,084 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 80 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 80 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 03:28:20,106 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-07-29 03:28:20,107 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 03:28:20,107 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 03:28:20,108 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 03:28:20,108 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 03:28:20,108 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 03:28:20,108 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 03:28:20,108 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 03:28:20,109 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 81 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 81 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 03:28:20,132 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-07-29 03:28:20,133 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 03:28:20,133 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 03:28:20,134 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 03:28:20,134 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 03:28:20,134 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 03:28:20,134 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 03:28:20,134 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 03:28:20,136 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 82 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-07-29 03:28:20,157 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 82 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 03:28:20,159 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 03:28:20,159 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 03:28:20,159 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 03:28:20,159 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 03:28:20,159 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 03:28:20,160 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 03:28:20,160 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 03:28:20,161 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 83 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 83 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 03:28:20,183 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-07-29 03:28:20,184 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 03:28:20,184 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 03:28:20,184 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 03:28:20,184 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 03:28:20,184 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 03:28:20,184 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 03:28:20,185 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 03:28:20,186 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 84 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 84 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 03:28:20,208 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-07-29 03:28:20,210 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 03:28:20,211 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 03:28:20,211 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 03:28:20,211 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 03:28:20,217 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-29 03:28:20,217 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-07-29 03:28:20,234 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2020-07-29 03:28:20,249 INFO L443 ModelExtractionUtils]: Simplification made 5 calls to the SMT solver. [2020-07-29 03:28:20,249 INFO L444 ModelExtractionUtils]: 30 out of 46 variables were initially zero. Simplification set additionally 13 variables to zero. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 85 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 85 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 03:28:20,251 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2020-07-29 03:28:20,253 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2020-07-29 03:28:20,254 INFO L510 LassoAnalysis]: Proved termination. [2020-07-29 03:28:20,254 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_alloc_17_~j~0) = 2*ULTIMATE.start_alloc_17_~j~0 + 1 Supporting invariants [] [2020-07-29 03:28:20,304 INFO L297 tatePredicateManager]: 7 out of 7 supporting invariants were superfluous and have been removed [2020-07-29 03:28:20,308 INFO L393 LassoCheck]: Loop: "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);" "alloc_17_#t~post40 := alloc_17_~j~0;alloc_17_~j~0 := alloc_17_#t~post40 - 1;havoc alloc_17_#t~post40;" [2020-07-29 03:28:20,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 03:28:20,328 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 03:28:20,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 03:28:20,362 INFO L263 TraceCheckSpWp]: Trace formula consists of 185 conjuncts, 2 conjunts are in the unsatisfiable core [2020-07-29 03:28:20,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 03:28:20,377 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 03:28:20,401 INFO L280 TraceCheckUtils]: 0: Hoare triple {4324#unseeded} #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); {4324#unseeded} is VALID [2020-07-29 03:28:20,402 INFO L280 TraceCheckUtils]: 1: Hoare triple {4324#unseeded} 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; {4324#unseeded} is VALID [2020-07-29 03:28:20,402 INFO L280 TraceCheckUtils]: 2: Hoare triple {4324#unseeded} assume ldv_positive_~r~1 > 0;ldv_positive_#res := ldv_positive_~r~1; {4324#unseeded} is VALID [2020-07-29 03:28:20,403 INFO L280 TraceCheckUtils]: 3: Hoare triple {4324#unseeded} entry_point_#t~ret44 := ldv_positive_#res;entry_point_~len~0 := entry_point_#t~ret44;havoc entry_point_#t~ret44; {4324#unseeded} is VALID [2020-07-29 03:28:20,404 INFO L280 TraceCheckUtils]: 4: Hoare triple {4324#unseeded} assume !!(entry_point_~len~0 < 16777216); {4324#unseeded} is VALID [2020-07-29 03:28:20,404 INFO L280 TraceCheckUtils]: 5: Hoare triple {4324#unseeded} 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; {4324#unseeded} is VALID [2020-07-29 03:28:20,405 INFO L280 TraceCheckUtils]: 6: Hoare triple {4324#unseeded} 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; {4324#unseeded} is VALID [2020-07-29 03:28:20,406 INFO L280 TraceCheckUtils]: 7: Hoare triple {4324#unseeded} 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; {4324#unseeded} is VALID [2020-07-29 03:28:20,406 INFO L280 TraceCheckUtils]: 8: Hoare triple {4324#unseeded} assume entry_point_~array~0.base != 0 || entry_point_~array~0.offset != 0;entry_point_~i~2 := 0; {4324#unseeded} is VALID [2020-07-29 03:28:20,407 INFO L280 TraceCheckUtils]: 9: Hoare triple {4324#unseeded} 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); {4324#unseeded} is VALID [2020-07-29 03:28:20,408 INFO L280 TraceCheckUtils]: 10: Hoare triple {4324#unseeded} entry_point_#t~post46 := entry_point_~i~2;entry_point_~i~2 := 1 + entry_point_#t~post46;havoc entry_point_#t~post46; {4324#unseeded} is VALID [2020-07-29 03:28:20,409 INFO L280 TraceCheckUtils]: 11: Hoare triple {4324#unseeded} 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); {4324#unseeded} is VALID [2020-07-29 03:28:20,409 INFO L280 TraceCheckUtils]: 12: Hoare triple {4324#unseeded} entry_point_#t~post46 := entry_point_~i~2;entry_point_~i~2 := 1 + entry_point_#t~post46;havoc entry_point_#t~post46; {4324#unseeded} is VALID [2020-07-29 03:28:20,410 INFO L280 TraceCheckUtils]: 13: Hoare triple {4324#unseeded} 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); {4324#unseeded} is VALID [2020-07-29 03:28:20,411 INFO L280 TraceCheckUtils]: 14: Hoare triple {4324#unseeded} entry_point_#t~post46 := entry_point_~i~2;entry_point_~i~2 := 1 + entry_point_#t~post46;havoc entry_point_#t~post46; {4324#unseeded} is VALID [2020-07-29 03:28:20,412 INFO L280 TraceCheckUtils]: 15: Hoare triple {4324#unseeded} assume !(entry_point_~i~2 < entry_point_~len~0); {4324#unseeded} is VALID [2020-07-29 03:28:20,413 INFO L280 TraceCheckUtils]: 16: Hoare triple {4324#unseeded} 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; {4324#unseeded} is VALID [2020-07-29 03:28:20,413 INFO L280 TraceCheckUtils]: 17: Hoare triple {4324#unseeded} 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; {4324#unseeded} is VALID [2020-07-29 03:28:20,414 INFO L280 TraceCheckUtils]: 18: Hoare triple {4324#unseeded} 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; {4324#unseeded} is VALID [2020-07-29 03:28:20,415 INFO L280 TraceCheckUtils]: 19: Hoare triple {4324#unseeded} 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; {4324#unseeded} is VALID [2020-07-29 03:28:20,415 INFO L280 TraceCheckUtils]: 20: Hoare triple {4324#unseeded} 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); {4324#unseeded} is VALID [2020-07-29 03:28:20,416 INFO L280 TraceCheckUtils]: 21: Hoare triple {4324#unseeded} alloc_17_#t~post38 := alloc_17_~i~0;alloc_17_~i~0 := 1 + alloc_17_#t~post38;havoc alloc_17_#t~post38; {4324#unseeded} is VALID [2020-07-29 03:28:20,417 INFO L280 TraceCheckUtils]: 22: Hoare triple {4324#unseeded} 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; {4324#unseeded} is VALID [2020-07-29 03:28:20,417 INFO L280 TraceCheckUtils]: 23: Hoare triple {4324#unseeded} 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; {4324#unseeded} is VALID [2020-07-29 03:28:20,418 INFO L280 TraceCheckUtils]: 24: Hoare triple {4324#unseeded} 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; {4324#unseeded} is VALID [2020-07-29 03:28:20,419 INFO L280 TraceCheckUtils]: 25: Hoare triple {4324#unseeded} 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); {4324#unseeded} is VALID [2020-07-29 03:28:20,419 INFO L280 TraceCheckUtils]: 26: Hoare triple {4324#unseeded} alloc_17_#t~post38 := alloc_17_~i~0;alloc_17_~i~0 := 1 + alloc_17_#t~post38;havoc alloc_17_#t~post38; {4324#unseeded} is VALID [2020-07-29 03:28:20,420 INFO L280 TraceCheckUtils]: 27: Hoare triple {4324#unseeded} 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; {4324#unseeded} is VALID [2020-07-29 03:28:20,421 INFO L280 TraceCheckUtils]: 28: Hoare triple {4324#unseeded} assume !(0 != ldv_malloc_#t~nondet11);havoc ldv_malloc_#t~nondet11;ldv_malloc_#res.base, ldv_malloc_#res.offset := 0, 0; {4324#unseeded} is VALID [2020-07-29 03:28:20,421 INFO L280 TraceCheckUtils]: 29: Hoare triple {4324#unseeded} 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; {4324#unseeded} is VALID [2020-07-29 03:28:20,422 INFO L280 TraceCheckUtils]: 30: Hoare triple {4324#unseeded} assume alloc_17_~p~0.base == 0 && alloc_17_~p~0.offset == 0; {4324#unseeded} is VALID [2020-07-29 03:28:20,422 INFO L280 TraceCheckUtils]: 31: Hoare triple {4324#unseeded} alloc_17_~j~0 := alloc_17_~i~0 - 1; {4324#unseeded} is VALID [2020-07-29 03:28:20,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 03:28:20,429 INFO L263 TraceCheckSpWp]: Trace formula consists of 15 conjuncts, 4 conjunts are in the unsatisfiable core [2020-07-29 03:28:20,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 03:28:20,432 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 03:28:20,450 INFO L280 TraceCheckUtils]: 0: Hoare triple {4327#(>= oldRank0 (+ (* 2 ULTIMATE.start_alloc_17_~j~0) 1))} 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); {4470#(and (<= 0 ULTIMATE.start_alloc_17_~j~0) (<= (+ (* 2 ULTIMATE.start_alloc_17_~j~0) 1) oldRank0))} is VALID [2020-07-29 03:28:20,452 INFO L280 TraceCheckUtils]: 1: Hoare triple {4470#(and (<= 0 ULTIMATE.start_alloc_17_~j~0) (<= (+ (* 2 ULTIMATE.start_alloc_17_~j~0) 1) oldRank0))} alloc_17_#t~post40 := alloc_17_~j~0;alloc_17_~j~0 := alloc_17_#t~post40 - 1;havoc alloc_17_#t~post40; {4372#(or (and (> oldRank0 (+ (* 2 ULTIMATE.start_alloc_17_~j~0) 1)) (>= oldRank0 0)) unseeded)} is VALID [2020-07-29 03:28:20,452 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-29 03:28:20,452 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2020-07-29 03:28:20,470 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 23 edges. 23 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-29 03:28:20,470 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 32 letters. Loop has 2 letters. [2020-07-29 03:28:20,470 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:28:20,471 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-07-29 03:28:20,471 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 34 states and 37 transitions. cyclomatic complexity: 6 Second operand 3 states. [2020-07-29 03:28:20,511 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 34 states and 37 transitions. cyclomatic complexity: 6. Second operand 3 states. Result 36 states and 40 transitions. Complement of second has 4 states. [2020-07-29 03:28:20,511 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-07-29 03:28:20,511 INFO L123 tractBuchiDifference]: Start testing correctness of buchiDifferenceNCSBLazy3 [2020-07-29 03:28:20,511 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 34 states and 37 transitions. cyclomatic complexity: 6 [2020-07-29 03:28:20,511 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 03:28:20,511 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 03:28:20,512 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 3 states. [2020-07-29 03:28:20,512 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2020-07-29 03:28:20,512 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 03:28:20,513 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 03:28:20,513 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 36 states and 40 transitions. [2020-07-29 03:28:20,513 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2020-07-29 03:28:20,513 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2020-07-29 03:28:20,513 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 34 states and 37 transitions. cyclomatic complexity: 6 [2020-07-29 03:28:20,514 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 2 examples of accepted words. [2020-07-29 03:28:20,514 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 3 states. [2020-07-29 03:28:20,515 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2020-07-29 03:28:20,515 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 1 examples of accepted words. [2020-07-29 03:28:20,515 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 36 states and 40 transitions. cyclomatic complexity: 7 [2020-07-29 03:28:20,515 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 36 states and 40 transitions. cyclomatic complexity: 7 [2020-07-29 03:28:20,515 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2020-07-29 03:28:20,515 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 0 examples of accepted words. [2020-07-29 03:28:20,516 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 34 states and 37 transitions. cyclomatic complexity: 6 Stem has 32 letters. Loop has 2 letters. [2020-07-29 03:28:20,516 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:28:20,516 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 32 letters. Loop has 2 letters. [2020-07-29 03:28:20,516 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:28:20,516 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 36 states and 40 transitions. cyclomatic complexity: 7 Stem has 32 letters. Loop has 2 letters. [2020-07-29 03:28:20,516 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:28:20,516 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 34 states and 37 transitions. cyclomatic complexity: 6 Stem has 1 letters. Loop has 2 letters. [2020-07-29 03:28:20,516 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:28:20,516 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 1 letters. Loop has 2 letters. [2020-07-29 03:28:20,517 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:28:20,517 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 36 states and 40 transitions. cyclomatic complexity: 7 Stem has 1 letters. Loop has 2 letters. [2020-07-29 03:28:20,517 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:28:20,517 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 34 states and 37 transitions. cyclomatic complexity: 6 Stem has 36 letters. Loop has 36 letters. [2020-07-29 03:28:20,517 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:28:20,517 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 36 letters. Loop has 36 letters. [2020-07-29 03:28:20,517 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:28:20,517 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 36 states and 40 transitions. cyclomatic complexity: 7 Stem has 36 letters. Loop has 36 letters. [2020-07-29 03:28:20,518 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:28:20,518 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 34 states and 37 transitions. cyclomatic complexity: 6 Stem has 34 letters. Loop has 34 letters. [2020-07-29 03:28:20,518 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:28:20,518 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 34 letters. Loop has 34 letters. [2020-07-29 03:28:20,518 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:28:20,518 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 36 states and 40 transitions. cyclomatic complexity: 7 Stem has 34 letters. Loop has 34 letters. [2020-07-29 03:28:20,518 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:28:20,518 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 34 states and 37 transitions. cyclomatic complexity: 6 Stem has 3 letters. Loop has 3 letters. [2020-07-29 03:28:20,518 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:28:20,519 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 3 letters. Loop has 3 letters. [2020-07-29 03:28:20,519 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:28:20,519 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 36 states and 40 transitions. cyclomatic complexity: 7 Stem has 3 letters. Loop has 3 letters. [2020-07-29 03:28:20,519 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:28:20,519 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 34 states and 37 transitions. cyclomatic complexity: 6 Stem has 33 letters. Loop has 2 letters. [2020-07-29 03:28:20,520 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:28:20,520 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 33 letters. Loop has 2 letters. [2020-07-29 03:28:20,520 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:28:20,520 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 36 states and 40 transitions. cyclomatic complexity: 7 Stem has 33 letters. Loop has 2 letters. [2020-07-29 03:28:20,520 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:28:20,521 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 34 states and 37 transitions. cyclomatic complexity: 6 Stem has 32 letters. Loop has 2 letters. [2020-07-29 03:28:20,521 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:28:20,521 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 32 letters. Loop has 2 letters. [2020-07-29 03:28:20,521 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:28:20,521 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 36 states and 40 transitions. cyclomatic complexity: 7 Stem has 32 letters. Loop has 2 letters. [2020-07-29 03:28:20,522 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:28:20,522 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 34 states and 37 transitions. cyclomatic complexity: 6 Stem has 1 letters. Loop has 2 letters. [2020-07-29 03:28:20,522 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:28:20,522 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 1 letters. Loop has 2 letters. [2020-07-29 03:28:20,522 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:28:20,522 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 36 states and 40 transitions. cyclomatic complexity: 7 Stem has 1 letters. Loop has 2 letters. [2020-07-29 03:28:20,523 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:28:20,523 INFO L161 tractBuchiDifference]: Finished testing correctness of buchiDifferenceNCSBLazy3 [2020-07-29 03:28:20,523 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-29 03:28:20,523 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 23 transitions. [2020-07-29 03:28:20,523 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 23 transitions. Stem has 32 letters. Loop has 2 letters. [2020-07-29 03:28:20,523 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:28:20,524 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 23 transitions. Stem has 34 letters. Loop has 2 letters. [2020-07-29 03:28:20,524 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:28:20,524 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 23 transitions. Stem has 32 letters. Loop has 4 letters. [2020-07-29 03:28:20,524 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:28:20,524 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 36 states and 40 transitions. cyclomatic complexity: 7 [2020-07-29 03:28:20,524 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2020-07-29 03:28:20,525 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 36 states to 0 states and 0 transitions. [2020-07-29 03:28:20,525 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2020-07-29 03:28:20,525 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2020-07-29 03:28:20,525 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2020-07-29 03:28:20,525 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-07-29 03:28:20,525 INFO L688 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-07-29 03:28:20,525 INFO L711 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-07-29 03:28:20,525 INFO L591 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-07-29 03:28:20,525 INFO L424 BuchiCegarLoop]: ======== Iteration 16============ [2020-07-29 03:28:20,525 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2020-07-29 03:28:20,525 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2020-07-29 03:28:20,526 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2020-07-29 03:28:20,532 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 29.07 03:28:20 BoogieIcfgContainer [2020-07-29 03:28:20,532 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2020-07-29 03:28:20,533 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2020-07-29 03:28:20,533 INFO L271 PluginConnector]: Initializing Witness Printer... [2020-07-29 03:28:20,533 INFO L275 PluginConnector]: Witness Printer initialized [2020-07-29 03:28:20,534 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.07 03:27:17" (3/4) ... [2020-07-29 03:28:20,538 INFO L140 WitnessPrinter]: No result that supports witness generation found [2020-07-29 03:28:20,538 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2020-07-29 03:28:20,539 INFO L168 Benchmark]: Toolchain (without parser) took 64273.44 ms. Allocated memory was 1.0 GB in the beginning and 1.7 GB in the end (delta: 632.8 MB). Free memory was 961.6 MB in the beginning and 1.1 GB in the end (delta: -100.8 MB). Peak memory consumption was 532.0 MB. Max. memory is 11.5 GB. [2020-07-29 03:28:20,540 INFO L168 Benchmark]: CDTParser took 0.25 ms. Allocated memory is still 1.0 GB. Free memory is still 987.1 MB. There was no memory consumed. Max. memory is 11.5 GB. [2020-07-29 03:28:20,540 INFO L168 Benchmark]: CACSL2BoogieTranslator took 731.33 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 152.0 MB). Free memory was 956.2 MB in the beginning and 1.1 GB in the end (delta: -157.5 MB). Peak memory consumption was 26.3 MB. Max. memory is 11.5 GB. [2020-07-29 03:28:20,540 INFO L168 Benchmark]: Boogie Procedure Inliner took 74.59 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-07-29 03:28:20,541 INFO L168 Benchmark]: Boogie Preprocessor took 52.59 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-07-29 03:28:20,541 INFO L168 Benchmark]: RCFGBuilder took 586.07 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: 37.3 MB). Peak memory consumption was 37.3 MB. Max. memory is 11.5 GB. [2020-07-29 03:28:20,542 INFO L168 Benchmark]: BuchiAutomizer took 62816.80 ms. Allocated memory was 1.2 GB in the beginning and 1.7 GB in the end (delta: 480.8 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 7.5 MB). Peak memory consumption was 488.2 MB. Max. memory is 11.5 GB. [2020-07-29 03:28:20,542 INFO L168 Benchmark]: Witness Printer took 5.07 ms. Allocated memory is still 1.7 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2020-07-29 03:28:20,544 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - AssertionsEnabledResult: Assertions are enabled Assertions are enabled - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.25 ms. Allocated memory is still 1.0 GB. Free memory is still 987.1 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 731.33 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 152.0 MB). Free memory was 956.2 MB in the beginning and 1.1 GB in the end (delta: -157.5 MB). Peak memory consumption was 26.3 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 74.59 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. * Boogie Preprocessor took 52.59 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. * RCFGBuilder took 586.07 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: 37.3 MB). Peak memory consumption was 37.3 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 62816.80 ms. Allocated memory was 1.2 GB in the beginning and 1.7 GB in the end (delta: 480.8 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 7.5 MB). Peak memory consumption was 488.2 MB. Max. memory is 11.5 GB. * Witness Printer took 5.07 ms. Allocated memory is still 1.7 GB. Free memory is still 1.1 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 15 terminating modules (10 trivial, 5 deterministic, 0 nondeterministic). One deterministic module has affine ranking function unknown-#length-unknown[malloc(size)] + -4 * i and consists of 6 locations. One deterministic module has affine ranking function -1 * i + len and consists of 4 locations. One deterministic module has affine ranking function unknown-#length-unknown[array] + -4 * i and consists of 6 locations. One deterministic module has affine ranking function 4 * i + 8 * j + 3 * array + -1 * ldv_global_msg_list and consists of 15 locations. One deterministic module has affine ranking function 2 * j + 1 and consists of 3 locations. 10 modules have a trivial ranking function, the largest among these consists of 13 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 62.7s and 16 iterations. TraceHistogramMax:3. Analysis of lassos took 57.0s. Construction of modules took 0.7s. Büchi inclusion checks took 4.5s. Highest rank in rank-based complementation 3. Minimization of det autom 5. Minimization of nondet autom 10. Automata minimization 0.1s AutomataMinimizationTime, 14 MinimizatonAttempts, 124 StatesRemovedByMinimization, 12 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 [5, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 407 SDtfs, 551 SDslu, 734 SDs, 0 SdLazy, 442 SolverSat, 71 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.7s Time LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT0 conc1 concLT0 SILN0 SILU9 SILI0 SILT0 lasso5 LassoPreprocessingBenchmarks: Lassos: inital378 mio100 ax108 hnf100 lsp85 ukn54 mio100 lsp57 div100 bol100 ite100 ukn100 eq189 hnf90 smp93 dnf139 smp94 tf100 neg97 sie111 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 68ms 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...