./Ultimate.py --spec ../sv-benchmarks/c/properties/termination.prp --file ../sv-benchmarks/c/list-ext-properties/test-0232_1-2.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 9a8b2e8d Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -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/list-ext-properties/test-0232_1-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 8f053c4de2291716f40c056dd251ccd74d5a7493 ............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. Execution finished normally Using bit-precise analysis No suitable file found in config dir /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config using search string *Termination*32bit*_Bitvector*.epf No suitable settings file found using Termination*32bit*_Bitvector ERROR: UNSUPPORTED PROPERTY Writing output log to file Ultimate.log Result: ERROR: ExceptionOrErrorResult: AssertionError: MapEliminator tries to combine Int and (Array Int Int) --- Real Ultimate output --- This is Ultimate 0.1.25-9a8b2e8 [2020-10-20 07:02:47,100 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-10-20 07:02:47,105 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-10-20 07:02:47,129 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-10-20 07:02:47,130 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-10-20 07:02:47,131 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-10-20 07:02:47,132 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-10-20 07:02:47,134 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-10-20 07:02:47,136 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-10-20 07:02:47,137 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-10-20 07:02:47,138 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-10-20 07:02:47,139 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-10-20 07:02:47,140 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-10-20 07:02:47,141 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-10-20 07:02:47,142 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-10-20 07:02:47,143 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-10-20 07:02:47,144 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-10-20 07:02:47,146 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-10-20 07:02:47,147 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-10-20 07:02:47,149 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-10-20 07:02:47,151 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-10-20 07:02:47,163 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-10-20 07:02:47,164 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-10-20 07:02:47,165 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-10-20 07:02:47,168 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-10-20 07:02:47,168 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-10-20 07:02:47,169 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-10-20 07:02:47,170 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-10-20 07:02:47,170 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-10-20 07:02:47,171 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-10-20 07:02:47,171 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-10-20 07:02:47,172 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-10-20 07:02:47,173 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-10-20 07:02:47,174 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-10-20 07:02:47,175 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-10-20 07:02:47,175 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-10-20 07:02:47,176 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-10-20 07:02:47,176 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-10-20 07:02:47,177 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-10-20 07:02:47,178 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-10-20 07:02:47,178 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-10-20 07:02:47,179 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-32bit-Automizer_Default.epf [2020-10-20 07:02:47,205 INFO L113 SettingsManager]: Loading preferences was successful [2020-10-20 07:02:47,205 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-10-20 07:02:47,206 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-10-20 07:02:47,207 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-10-20 07:02:47,207 INFO L138 SettingsManager]: * Use SBE=true [2020-10-20 07:02:47,207 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2020-10-20 07:02:47,208 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2020-10-20 07:02:47,208 INFO L138 SettingsManager]: * Use old map elimination=false [2020-10-20 07:02:47,208 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2020-10-20 07:02:47,208 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2020-10-20 07:02:47,209 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2020-10-20 07:02:47,209 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-10-20 07:02:47,209 INFO L138 SettingsManager]: * sizeof long=4 [2020-10-20 07:02:47,209 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2020-10-20 07:02:47,210 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-10-20 07:02:47,210 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-10-20 07:02:47,210 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-10-20 07:02:47,210 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2020-10-20 07:02:47,211 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2020-10-20 07:02:47,211 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2020-10-20 07:02:47,211 INFO L138 SettingsManager]: * sizeof long double=12 [2020-10-20 07:02:47,211 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-10-20 07:02:47,212 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2020-10-20 07:02:47,212 INFO L138 SettingsManager]: * Use constant arrays=true [2020-10-20 07:02:47,212 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2020-10-20 07:02:47,212 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-10-20 07:02:47,213 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-10-20 07:02:47,213 INFO L138 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2020-10-20 07:02:47,213 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-10-20 07:02:47,213 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-10-20 07:02:47,214 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-10-20 07:02:47,214 INFO L138 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2020-10-20 07:02:47,215 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2020-10-20 07:02:47,215 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 -> 8f053c4de2291716f40c056dd251ccd74d5a7493 [2020-10-20 07:02:47,425 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-10-20 07:02:47,438 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-10-20 07:02:47,441 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-10-20 07:02:47,443 INFO L271 PluginConnector]: Initializing CDTParser... [2020-10-20 07:02:47,443 INFO L275 PluginConnector]: CDTParser initialized [2020-10-20 07:02:47,444 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/list-ext-properties/test-0232_1-2.i [2020-10-20 07:02:47,524 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7091115bb/ff95287bbf2c4e74bcf1e6b26db44569/FLAGfa3478cf7 [2020-10-20 07:02:48,023 INFO L306 CDTParser]: Found 1 translation units. [2020-10-20 07:02:48,023 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/list-ext-properties/test-0232_1-2.i [2020-10-20 07:02:48,038 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7091115bb/ff95287bbf2c4e74bcf1e6b26db44569/FLAGfa3478cf7 [2020-10-20 07:02:48,366 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7091115bb/ff95287bbf2c4e74bcf1e6b26db44569 [2020-10-20 07:02:48,370 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-10-20 07:02:48,377 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2020-10-20 07:02:48,378 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-10-20 07:02:48,378 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-10-20 07:02:48,385 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-10-20 07:02:48,386 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.10 07:02:48" (1/1) ... [2020-10-20 07:02:48,390 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@68503c48 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.10 07:02:48, skipping insertion in model container [2020-10-20 07:02:48,390 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.10 07:02:48" (1/1) ... [2020-10-20 07:02:48,403 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-10-20 07:02:48,468 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-10-20 07:02:48,857 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-10-20 07:02:48,869 INFO L203 MainTranslator]: Completed pre-run [2020-10-20 07:02:48,943 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-10-20 07:02:49,033 INFO L208 MainTranslator]: Completed translation [2020-10-20 07:02:49,034 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.10 07:02:49 WrapperNode [2020-10-20 07:02:49,036 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-10-20 07:02:49,037 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-10-20 07:02:49,037 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-10-20 07:02:49,037 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-10-20 07:02:49,047 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.10 07:02:49" (1/1) ... [2020-10-20 07:02:49,077 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.10 07:02:49" (1/1) ... [2020-10-20 07:02:49,104 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-10-20 07:02:49,105 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-10-20 07:02:49,105 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-10-20 07:02:49,105 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-10-20 07:02:49,114 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.10 07:02:49" (1/1) ... [2020-10-20 07:02:49,114 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.10 07:02:49" (1/1) ... [2020-10-20 07:02:49,117 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.10 07:02:49" (1/1) ... [2020-10-20 07:02:49,118 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.10 07:02:49" (1/1) ... [2020-10-20 07:02:49,126 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.10 07:02:49" (1/1) ... [2020-10-20 07:02:49,131 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.10 07:02:49" (1/1) ... [2020-10-20 07:02:49,133 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.10 07:02:49" (1/1) ... [2020-10-20 07:02:49,137 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-10-20 07:02:49,137 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-10-20 07:02:49,137 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-10-20 07:02:49,138 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-10-20 07:02:49,139 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.10 07:02:49" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 07:02:49,225 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2020-10-20 07:02:49,225 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2020-10-20 07:02:49,225 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-10-20 07:02:49,225 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2020-10-20 07:02:49,226 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-10-20 07:02:49,226 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2020-10-20 07:02:49,226 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2020-10-20 07:02:49,226 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-10-20 07:02:49,226 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-10-20 07:02:49,643 INFO L293 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-10-20 07:02:49,643 INFO L298 CfgBuilder]: Removed 8 assume(true) statements. [2020-10-20 07:02:49,645 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.10 07:02:49 BoogieIcfgContainer [2020-10-20 07:02:49,646 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-10-20 07:02:49,646 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2020-10-20 07:02:49,647 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2020-10-20 07:02:49,651 INFO L275 PluginConnector]: BuchiAutomizer initialized [2020-10-20 07:02:49,652 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-10-20 07:02:49,652 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 20.10 07:02:48" (1/3) ... [2020-10-20 07:02:49,654 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@728c058 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 20.10 07:02:49, skipping insertion in model container [2020-10-20 07:02:49,654 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-10-20 07:02:49,654 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.10 07:02:49" (2/3) ... [2020-10-20 07:02:49,655 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@728c058 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 20.10 07:02:49, skipping insertion in model container [2020-10-20 07:02:49,655 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-10-20 07:02:49,655 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.10 07:02:49" (3/3) ... [2020-10-20 07:02:49,657 INFO L373 chiAutomizerObserver]: Analyzing ICFG test-0232_1-2.i [2020-10-20 07:02:49,713 INFO L359 BuchiCegarLoop]: Interprodecural is true [2020-10-20 07:02:49,713 INFO L360 BuchiCegarLoop]: Hoare is false [2020-10-20 07:02:49,713 INFO L361 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2020-10-20 07:02:49,713 INFO L362 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2020-10-20 07:02:49,714 INFO L363 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-10-20 07:02:49,714 INFO L364 BuchiCegarLoop]: Difference is false [2020-10-20 07:02:49,714 INFO L365 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-10-20 07:02:49,714 INFO L368 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2020-10-20 07:02:49,732 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 13 states. [2020-10-20 07:02:49,762 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 6 [2020-10-20 07:02:49,762 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-10-20 07:02:49,762 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-10-20 07:02:49,772 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2020-10-20 07:02:49,772 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2020-10-20 07:02:49,772 INFO L427 BuchiCegarLoop]: ======== Iteration 1============ [2020-10-20 07:02:49,772 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 13 states. [2020-10-20 07:02:49,775 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 6 [2020-10-20 07:02:49,775 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-10-20 07:02:49,775 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-10-20 07:02:49,776 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2020-10-20 07:02:49,776 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2020-10-20 07:02:49,787 INFO L794 eck$LassoCheckResult]: Stem: 8#ULTIMATE.startENTRYtrue #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call #t~string0.base, #t~string0.offset := #Ultimate.allocOnStack(2);call write~init~int(48, #t~string0.base, #t~string0.offset, 1);call write~init~int(0, #t~string0.base, 1 + #t~string0.offset, 1);call #t~string1.base, #t~string1.offset := #Ultimate.allocOnStack(16);~c~0 := 0; 4#L-1true havoc main_#res;havoc main_#t~post14, main_#t~nondet13, main_#t~mem15.base, main_#t~mem15.offset, main_#t~mem16.base, main_#t~mem16.offset, main_#t~mem17.base, main_#t~mem17.offset, main_#t~mem18.base, main_#t~mem18.offset, main_#t~mem19.base, main_#t~mem19.offset, main_#t~post20, main_~next~0.base, main_~next~0.offset, main_#t~mem21.base, main_#t~mem21.offset, main_#t~mem22.base, main_#t~mem22.offset, main_#t~mem23.base, main_#t~mem23.offset, main_#t~post24, main_~next~1.base, main_~next~1.offset, main_~#list~0.base, main_~#list~0.offset, main_~length~0;call main_~#list~0.base, main_~#list~0.offset := #Ultimate.allocOnStack(4);call write~init~$Pointer$(0, 0, main_~#list~0.base, main_~#list~0.offset, 4);main_~length~0 := 0; 10#L543-3true [2020-10-20 07:02:49,788 INFO L796 eck$LassoCheckResult]: Loop: 10#L543-3true append_#in~plist.base, append_#in~plist.offset := main_~#list~0.base, main_~#list~0.offset;havoc append_#t~post5, append_#t~malloc6.base, append_#t~malloc6.offset, append_#t~mem7.base, append_#t~mem7.offset, append_#t~mem8.base, append_#t~mem8.offset, append_#t~ite12.base, append_#t~ite12.offset, append_#t~mem9.base, append_#t~mem9.offset, append_#t~mem10.base, append_#t~mem10.offset, append_#t~malloc11.base, append_#t~malloc11.offset, append_~plist.base, append_~plist.offset, append_~item~0.base, append_~item~0.offset;append_~plist.base, append_~plist.offset := append_#in~plist.base, append_#in~plist.offset;append_#t~post5 := ~c~0;~c~0 := 1 + append_#t~post5;havoc append_#t~post5;call append_#t~malloc6.base, append_#t~malloc6.offset := #Ultimate.allocOnHeap(8);append_~item~0.base, append_~item~0.offset := append_#t~malloc6.base, append_#t~malloc6.offset;call append_#t~mem7.base, append_#t~mem7.offset := read~$Pointer$(append_~plist.base, append_~plist.offset, 4);call write~$Pointer$(append_#t~mem7.base, append_#t~mem7.offset, append_~item~0.base, append_~item~0.offset, 4);havoc append_#t~mem7.base, append_#t~mem7.offset;call append_#t~mem8.base, append_#t~mem8.offset := read~$Pointer$(append_~item~0.base, append_~item~0.offset, 4); 3#L534true assume append_#t~mem8.base != 0 || append_#t~mem8.offset != 0;call append_#t~mem9.base, append_#t~mem9.offset := read~$Pointer$(append_~item~0.base, append_~item~0.offset, 4);call append_#t~mem10.base, append_#t~mem10.offset := read~$Pointer$(append_#t~mem9.base, 4 + append_#t~mem9.offset, 4);append_#t~ite12.base, append_#t~ite12.offset := append_#t~mem10.base, append_#t~mem10.offset; 5#L534-2true call write~$Pointer$(append_#t~ite12.base, append_#t~ite12.offset, append_~item~0.base, 4 + append_~item~0.offset, 4);havoc append_#t~ite12.base, append_#t~ite12.offset;havoc append_#t~mem9.base, append_#t~mem9.offset;havoc append_#t~mem10.base, append_#t~mem10.offset;havoc append_#t~mem8.base, append_#t~mem8.offset;call write~$Pointer$(append_~item~0.base, append_~item~0.offset, append_~plist.base, append_~plist.offset, 4); 12#L529true main_#t~post14 := main_~length~0;main_~length~0 := 1 + main_#t~post14;havoc main_#t~post14; 7#L543-1true assume !!(0 != main_#t~nondet13 && ~c~0 < 20);havoc main_#t~nondet13; 10#L543-3true [2020-10-20 07:02:49,795 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 07:02:49,796 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 1 times [2020-10-20 07:02:49,823 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 07:02:49,823 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [315259444] [2020-10-20 07:02:49,823 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 07:02:49,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 07:02:49,950 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 07:02:49,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 07:02:49,967 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 07:02:49,990 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-20 07:02:49,991 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 07:02:49,992 INFO L82 PathProgramCache]: Analyzing trace with hash 34451375, now seen corresponding path program 1 times [2020-10-20 07:02:49,992 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 07:02:49,992 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [7620471] [2020-10-20 07:02:49,993 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 07:02:50,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 07:02:50,033 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 07:02:50,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 07:02:50,062 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 07:02:50,072 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-20 07:02:50,074 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 07:02:50,074 INFO L82 PathProgramCache]: Analyzing trace with hash 1805890861, now seen corresponding path program 1 times [2020-10-20 07:02:50,074 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 07:02:50,075 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1339007840] [2020-10-20 07:02:50,075 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 07:02:50,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 07:02:50,225 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-20 07:02:50,225 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1339007840] [2020-10-20 07:02:50,226 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-20 07:02:50,227 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-10-20 07:02:50,227 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1388440345] [2020-10-20 07:02:51,714 WARN L193 SmtUtils]: Spent 1.48 s on a formula simplification. DAG size of input: 151 DAG size of output: 146 [2020-10-20 07:02:51,809 INFO L545 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-10-20 07:02:51,823 INFO L545 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-10-20 07:02:52,849 WARN L193 SmtUtils]: Spent 1.03 s on a formula simplification that was a NOOP. DAG size: 124 [2020-10-20 07:02:52,851 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-20 07:02:52,864 INFO L545 ElimStorePlain]: Start of recursive call 4: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-10-20 07:02:52,893 INFO L545 ElimStorePlain]: Start of recursive call 5: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-10-20 07:02:53,781 WARN L193 SmtUtils]: Spent 887.00 ms on a formula simplification that was a NOOP. DAG size: 125 [2020-10-20 07:02:53,782 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-20 07:02:53,786 INFO L545 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: 4 dim-0 vars, and 2 xjuncts. [2020-10-20 07:02:53,786 INFO L244 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:739, output treesize:723 [2020-10-20 07:02:54,575 WARN L193 SmtUtils]: Spent 785.00 ms on a formula simplification that was a NOOP. DAG size: 125 [2020-10-20 07:02:54,577 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-20 07:02:54,594 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-20 07:02:54,595 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-10-20 07:02:54,597 INFO L87 Difference]: Start difference. First operand 13 states. Second operand 4 states. [2020-10-20 07:02:54,674 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 07:02:54,675 INFO L93 Difference]: Finished difference Result 17 states and 20 transitions. [2020-10-20 07:02:54,676 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-10-20 07:02:54,678 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 17 states and 20 transitions. [2020-10-20 07:02:54,681 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 7 [2020-10-20 07:02:54,687 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 17 states to 13 states and 16 transitions. [2020-10-20 07:02:54,688 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 13 [2020-10-20 07:02:54,689 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 13 [2020-10-20 07:02:54,690 INFO L73 IsDeterministic]: Start isDeterministic. Operand 13 states and 16 transitions. [2020-10-20 07:02:54,692 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-20 07:02:54,692 INFO L691 BuchiCegarLoop]: Abstraction has 13 states and 16 transitions. [2020-10-20 07:02:54,713 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states and 16 transitions. [2020-10-20 07:02:54,724 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 11. [2020-10-20 07:02:54,725 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2020-10-20 07:02:54,726 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 14 transitions. [2020-10-20 07:02:54,727 INFO L714 BuchiCegarLoop]: Abstraction has 11 states and 14 transitions. [2020-10-20 07:02:54,728 INFO L594 BuchiCegarLoop]: Abstraction has 11 states and 14 transitions. [2020-10-20 07:02:54,728 INFO L427 BuchiCegarLoop]: ======== Iteration 2============ [2020-10-20 07:02:54,729 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 11 states and 14 transitions. [2020-10-20 07:02:54,731 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 6 [2020-10-20 07:02:54,732 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-10-20 07:02:54,733 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-10-20 07:02:54,733 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2020-10-20 07:02:54,734 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2020-10-20 07:02:54,735 INFO L794 eck$LassoCheckResult]: Stem: 52#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call #t~string0.base, #t~string0.offset := #Ultimate.allocOnStack(2);call write~init~int(48, #t~string0.base, #t~string0.offset, 1);call write~init~int(0, #t~string0.base, 1 + #t~string0.offset, 1);call #t~string1.base, #t~string1.offset := #Ultimate.allocOnStack(16);~c~0 := 0; 46#L-1 havoc main_#res;havoc main_#t~post14, main_#t~nondet13, main_#t~mem15.base, main_#t~mem15.offset, main_#t~mem16.base, main_#t~mem16.offset, main_#t~mem17.base, main_#t~mem17.offset, main_#t~mem18.base, main_#t~mem18.offset, main_#t~mem19.base, main_#t~mem19.offset, main_#t~post20, main_~next~0.base, main_~next~0.offset, main_#t~mem21.base, main_#t~mem21.offset, main_#t~mem22.base, main_#t~mem22.offset, main_#t~mem23.base, main_#t~mem23.offset, main_#t~post24, main_~next~1.base, main_~next~1.offset, main_~#list~0.base, main_~#list~0.offset, main_~length~0;call main_~#list~0.base, main_~#list~0.offset := #Ultimate.allocOnStack(4);call write~init~$Pointer$(0, 0, main_~#list~0.base, main_~#list~0.offset, 4);main_~length~0 := 0; 47#L543-3 append_#in~plist.base, append_#in~plist.offset := main_~#list~0.base, main_~#list~0.offset;havoc append_#t~post5, append_#t~malloc6.base, append_#t~malloc6.offset, append_#t~mem7.base, append_#t~mem7.offset, append_#t~mem8.base, append_#t~mem8.offset, append_#t~ite12.base, append_#t~ite12.offset, append_#t~mem9.base, append_#t~mem9.offset, append_#t~mem10.base, append_#t~mem10.offset, append_#t~malloc11.base, append_#t~malloc11.offset, append_~plist.base, append_~plist.offset, append_~item~0.base, append_~item~0.offset;append_~plist.base, append_~plist.offset := append_#in~plist.base, append_#in~plist.offset;append_#t~post5 := ~c~0;~c~0 := 1 + append_#t~post5;havoc append_#t~post5;call append_#t~malloc6.base, append_#t~malloc6.offset := #Ultimate.allocOnHeap(8);append_~item~0.base, append_~item~0.offset := append_#t~malloc6.base, append_#t~malloc6.offset;call append_#t~mem7.base, append_#t~mem7.offset := read~$Pointer$(append_~plist.base, append_~plist.offset, 4);call write~$Pointer$(append_#t~mem7.base, append_#t~mem7.offset, append_~item~0.base, append_~item~0.offset, 4);havoc append_#t~mem7.base, append_#t~mem7.offset;call append_#t~mem8.base, append_#t~mem8.offset := read~$Pointer$(append_~item~0.base, append_~item~0.offset, 4); 54#L534 assume !(append_#t~mem8.base != 0 || append_#t~mem8.offset != 0);call append_#t~malloc11.base, append_#t~malloc11.offset := #Ultimate.allocOnHeap(8);append_#t~ite12.base, append_#t~ite12.offset := append_#t~malloc11.base, append_#t~malloc11.offset; 44#L534-2 [2020-10-20 07:02:54,736 INFO L796 eck$LassoCheckResult]: Loop: 44#L534-2 call write~$Pointer$(append_#t~ite12.base, append_#t~ite12.offset, append_~item~0.base, 4 + append_~item~0.offset, 4);havoc append_#t~ite12.base, append_#t~ite12.offset;havoc append_#t~mem9.base, append_#t~mem9.offset;havoc append_#t~mem10.base, append_#t~mem10.offset;havoc append_#t~mem8.base, append_#t~mem8.offset;call write~$Pointer$(append_~item~0.base, append_~item~0.offset, append_~plist.base, append_~plist.offset, 4); 45#L529 main_#t~post14 := main_~length~0;main_~length~0 := 1 + main_#t~post14;havoc main_#t~post14; 49#L543-1 assume !!(0 != main_#t~nondet13 && ~c~0 < 20);havoc main_#t~nondet13; 51#L543-3 append_#in~plist.base, append_#in~plist.offset := main_~#list~0.base, main_~#list~0.offset;havoc append_#t~post5, append_#t~malloc6.base, append_#t~malloc6.offset, append_#t~mem7.base, append_#t~mem7.offset, append_#t~mem8.base, append_#t~mem8.offset, append_#t~ite12.base, append_#t~ite12.offset, append_#t~mem9.base, append_#t~mem9.offset, append_#t~mem10.base, append_#t~mem10.offset, append_#t~malloc11.base, append_#t~malloc11.offset, append_~plist.base, append_~plist.offset, append_~item~0.base, append_~item~0.offset;append_~plist.base, append_~plist.offset := append_#in~plist.base, append_#in~plist.offset;append_#t~post5 := ~c~0;~c~0 := 1 + append_#t~post5;havoc append_#t~post5;call append_#t~malloc6.base, append_#t~malloc6.offset := #Ultimate.allocOnHeap(8);append_~item~0.base, append_~item~0.offset := append_#t~malloc6.base, append_#t~malloc6.offset;call append_#t~mem7.base, append_#t~mem7.offset := read~$Pointer$(append_~plist.base, append_~plist.offset, 4);call write~$Pointer$(append_#t~mem7.base, append_#t~mem7.offset, append_~item~0.base, append_~item~0.offset, 4);havoc append_#t~mem7.base, append_#t~mem7.offset;call append_#t~mem8.base, append_#t~mem8.offset := read~$Pointer$(append_~item~0.base, append_~item~0.offset, 4); 53#L534 assume append_#t~mem8.base != 0 || append_#t~mem8.offset != 0;call append_#t~mem9.base, append_#t~mem9.offset := read~$Pointer$(append_~item~0.base, append_~item~0.offset, 4);call append_#t~mem10.base, append_#t~mem10.offset := read~$Pointer$(append_#t~mem9.base, 4 + append_#t~mem9.offset, 4);append_#t~ite12.base, append_#t~ite12.offset := append_#t~mem10.base, append_#t~mem10.offset; 44#L534-2 [2020-10-20 07:02:54,739 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 07:02:54,740 INFO L82 PathProgramCache]: Analyzing trace with hash 925640, now seen corresponding path program 1 times [2020-10-20 07:02:54,740 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 07:02:54,741 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [355004649] [2020-10-20 07:02:54,742 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 07:02:54,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 07:02:54,806 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 07:02:54,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 07:02:54,849 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 07:02:54,864 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-20 07:02:54,864 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 07:02:54,864 INFO L82 PathProgramCache]: Analyzing trace with hash 41102165, now seen corresponding path program 2 times [2020-10-20 07:02:54,865 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 07:02:54,865 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [207622124] [2020-10-20 07:02:54,865 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 07:02:54,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 07:02:54,883 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 07:02:54,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 07:02:54,899 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 07:02:54,905 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-20 07:02:54,906 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 07:02:54,906 INFO L82 PathProgramCache]: Analyzing trace with hash 351588334, now seen corresponding path program 1 times [2020-10-20 07:02:54,906 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 07:02:54,906 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1700515882] [2020-10-20 07:02:54,906 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 07:02:54,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 07:02:54,970 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 07:02:55,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 07:02:55,037 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 07:02:55,061 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-20 07:02:56,099 WARN L193 SmtUtils]: Spent 1.03 s on a formula simplification. DAG size of input: 170 DAG size of output: 164 [2020-10-20 07:02:56,145 INFO L545 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-10-20 07:02:56,179 INFO L545 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-10-20 07:02:57,349 WARN L193 SmtUtils]: Spent 1.17 s on a formula simplification that was a NOOP. DAG size: 165 [2020-10-20 07:02:57,351 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-20 07:02:57,362 INFO L545 ElimStorePlain]: Start of recursive call 4: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-10-20 07:02:57,376 INFO L545 ElimStorePlain]: Start of recursive call 5: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-10-20 07:02:58,736 WARN L193 SmtUtils]: Spent 1.36 s on a formula simplification that was a NOOP. DAG size: 166 [2020-10-20 07:02:58,740 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-20 07:02:58,744 INFO L545 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: 4 dim-0 vars, and 2 xjuncts. [2020-10-20 07:02:58,745 INFO L244 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:861, output treesize:905 [2020-10-20 07:03:00,218 WARN L193 SmtUtils]: Spent 1.46 s on a formula simplification that was a NOOP. DAG size: 166 [2020-10-20 07:03:01,067 WARN L193 SmtUtils]: Spent 843.00 ms on a formula simplification. DAG size of input: 164 DAG size of output: 140 [2020-10-20 07:03:01,352 WARN L193 SmtUtils]: Spent 280.00 ms on a formula simplification that was a NOOP. DAG size: 125 [2020-10-20 07:03:01,372 INFO L210 LassoAnalysis]: Preferences: [2020-10-20 07:03:01,373 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2020-10-20 07:03:01,373 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-10-20 07:03:01,382 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2020-10-20 07:03:01,382 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2020-10-20 07:03:01,382 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 07:03:01,383 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2020-10-20 07:03:01,383 INFO L132 ssoRankerPreferences]: Path of dumped script: [2020-10-20 07:03:01,383 INFO L133 ssoRankerPreferences]: Filename of dumped script: test-0232_1-2.i_Iteration2_Lasso [2020-10-20 07:03:01,383 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2020-10-20 07:03:01,383 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2020-10-20 07:03:01,443 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 07:03:01,447 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 07:03:01,454 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 07:03:01,457 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 07:03:01,461 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 07:03:01,463 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 07:03:01,467 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 07:03:01,471 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 07:03:01,473 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 07:03:01,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-10-20 07:03:02,485 WARN L193 SmtUtils]: Spent 305.00 ms on a formula simplification. DAG size of input: 98 DAG size of output: 88 [2020-10-20 07:03:04,271 WARN L193 SmtUtils]: Spent 1.27 s on a formula simplification. DAG size of input: 139 DAG size of output: 122 [2020-10-20 07:03:04,274 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 07:03:04,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-10-20 07:03:04,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-10-20 07:03:04,287 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 07:03:04,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-10-20 07:03:04,298 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 07:03:04,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-10-20 07:03:04,303 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 07:03:04,309 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 07:03:04,312 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 07:03:04,315 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 07:03:04,318 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 07:03:04,320 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 07:03:04,328 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 07:03:04,330 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 07:03:04,333 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 07:03:04,336 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 07:03:04,340 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 07:03:04,343 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 07:03:04,348 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 07:03:04,350 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 07:03:04,352 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 07:03:04,354 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 07:03:04,356 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 07:03:04,359 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 07:03:04,363 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 07:03:04,365 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 07:03:04,698 WARN L193 SmtUtils]: Spent 174.00 ms on a formula simplification that was a NOOP. DAG size: 82 [2020-10-20 07:03:05,081 WARN L193 SmtUtils]: Spent 382.00 ms on a formula simplification that was a NOOP. DAG size: 134 [2020-10-20 07:03:06,828 WARN L193 SmtUtils]: Spent 1.53 s on a formula simplification. DAG size of input: 86 DAG size of output: 86 [2020-10-20 07:03:12,267 WARN L193 SmtUtils]: Spent 5.44 s on a formula simplification. DAG size of input: 136 DAG size of output: 136 [2020-10-20 07:03:12,381 INFO L292 LassoAnalysis]: Preprocessing complete. [2020-10-20 07:03:12,386 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-10-20 07:03:12,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-10-20 07:03:12,394 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 07:03:12,394 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-20 07:03:12,395 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 07:03:12,395 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 07:03:12,395 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 07:03:12,397 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-20 07:03:12,398 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-20 07:03:12,400 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-10-20 07:03:12,439 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-10-20 07:03:12,442 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 07:03:12,442 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 07:03:12,442 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 07:03:12,443 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 07:03:12,448 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-20 07:03:12,448 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-10-20 07:03:12,459 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) Waiting until toolchain timeout for monitored process 4 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 07:03:12,489 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-10-20 07:03:12,491 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 07:03:12,491 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-20 07:03:12,491 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 07:03:12,491 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 07:03:12,492 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 07:03:12,493 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-20 07:03:12,493 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-20 07:03:12,509 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) Waiting until toolchain timeout for monitored process 5 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 07:03:12,537 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-10-20 07:03:12,538 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 07:03:12,538 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 07:03:12,539 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 07:03:12,539 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 07:03:12,541 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-20 07:03:12,541 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-10-20 07:03:12,544 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 07:03:12,571 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-10-20 07:03:12,572 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 07:03:12,572 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-20 07:03:12,573 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 07:03:12,573 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 07:03:12,573 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 07:03:12,574 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-20 07:03:12,574 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-20 07:03:12,582 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 07:03:12,606 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-10-20 07:03:12,608 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 07:03:12,608 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-20 07:03:12,608 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 07:03:12,608 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 07:03:12,608 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 07:03:12,611 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-20 07:03:12,611 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-20 07:03:12,617 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 07:03:12,641 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-10-20 07:03:12,643 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 07:03:12,643 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-20 07:03:12,643 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 07:03:12,643 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 07:03:12,643 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 07:03:12,644 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-20 07:03:12,644 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-20 07:03:12,645 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 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 9 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 07:03:12,670 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-10-20 07:03:12,671 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 07:03:12,671 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-20 07:03:12,671 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 07:03:12,672 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 07:03:12,672 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 07:03:12,672 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-20 07:03:12,672 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-20 07:03:12,674 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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-10-20 07:03:12,697 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-10-20 07:03:12,699 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 07:03:12,699 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-20 07:03:12,699 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 07:03:12,699 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 07:03:12,699 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 07:03:12,700 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-20 07:03:12,700 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-20 07:03:12,701 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 11 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 07:03:12,725 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-10-20 07:03:12,727 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 07:03:12,727 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 07:03:12,727 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 07:03:12,727 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 07:03:12,733 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-20 07:03:12,733 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-10-20 07:03:12,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 12 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-10-20 07:03:12,765 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 12 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 07:03:12,766 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 07:03:12,766 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 07:03:12,767 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 07:03:12,767 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 07:03:12,768 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-20 07:03:12,768 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-10-20 07:03:12,772 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 13 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 07:03:12,797 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-10-20 07:03:12,799 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 07:03:12,799 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 07:03:12,799 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 07:03:12,799 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 07:03:12,801 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-20 07:03:12,801 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-10-20 07:03:12,804 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-10-20 07:03:12,828 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-10-20 07:03:12,829 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 07:03:12,830 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 07:03:12,830 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 07:03:12,830 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 07:03:12,832 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-20 07:03:12,832 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-10-20 07:03:12,836 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) [2020-10-20 07:03:12,882 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-10-20 07:03:12,884 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 07:03:12,884 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 07:03:12,885 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 07:03:12,885 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 07:03:12,887 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-20 07:03:12,887 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. Waiting until toolchain timeout for monitored process 15 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 07:03:12,891 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 16 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 07:03:12,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-10-20 07:03:12,933 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 07:03:12,933 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 07:03:12,933 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 07:03:12,933 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 07:03:12,936 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-20 07:03:12,936 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-10-20 07:03:12,940 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 17 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 17 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 07:03:12,962 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-10-20 07:03:12,964 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 07:03:12,964 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-20 07:03:12,965 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 07:03:12,965 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 07:03:12,965 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 07:03:12,965 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-20 07:03:12,966 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-20 07:03:12,968 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 18 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 18 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 07:03:12,992 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-10-20 07:03:12,993 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 07:03:12,993 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-20 07:03:12,994 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 07:03:12,994 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 07:03:12,994 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 07:03:12,994 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-20 07:03:12,994 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-20 07:03:12,996 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-10-20 07:03:13,020 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-10-20 07:03:13,022 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 07:03:13,022 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-20 07:03:13,022 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 07:03:13,022 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 07:03:13,022 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 07:03:13,023 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-20 07:03:13,023 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-20 07:03:13,024 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 20 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 20 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 07:03:13,047 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-10-20 07:03:13,049 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 07:03:13,049 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-20 07:03:13,049 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 07:03:13,049 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 07:03:13,049 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 07:03:13,049 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-20 07:03:13,050 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-20 07:03:13,051 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 21 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 21 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 07:03:13,077 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-10-20 07:03:13,079 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 07:03:13,079 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 07:03:13,080 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 07:03:13,080 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 07:03:13,086 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-20 07:03:13,087 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-10-20 07:03:13,095 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 22 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 22 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 07:03:13,118 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-10-20 07:03:13,119 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 07:03:13,119 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 07:03:13,119 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 07:03:13,119 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 07:03:13,121 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-20 07:03:13,121 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-10-20 07:03:13,125 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) Waiting until toolchain timeout for monitored process 23 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 07:03:13,148 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-10-20 07:03:13,150 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 07:03:13,150 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 07:03:13,150 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 07:03:13,150 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 07:03:13,154 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-20 07:03:13,154 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-10-20 07:03:13,166 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 24 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 24 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 07:03:13,192 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-10-20 07:03:13,194 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 07:03:13,194 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 07:03:13,194 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 07:03:13,195 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 07:03:13,202 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-20 07:03:13,202 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-10-20 07:03:13,206 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) [2020-10-20 07:03:13,239 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 25 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 07:03:13,240 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 07:03:13,240 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-20 07:03:13,241 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 07:03:13,241 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 07:03:13,241 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 07:03:13,241 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-20 07:03:13,241 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-20 07:03:13,242 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 26 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 26 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 07:03:13,266 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-10-20 07:03:13,267 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 07:03:13,268 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-20 07:03:13,268 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 07:03:13,268 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 07:03:13,268 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 07:03:13,268 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-20 07:03:13,269 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-20 07:03:13,270 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 27 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 27 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 07:03:13,294 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-10-20 07:03:13,295 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 07:03:13,295 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-20 07:03:13,295 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 07:03:13,295 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 07:03:13,295 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 07:03:13,296 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-20 07:03:13,296 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-20 07:03:13,297 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) [2020-10-20 07:03:13,322 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 28 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 07:03:13,325 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 07:03:13,326 INFO L203 nArgumentSynthesizer]: 4 stem disjuncts [2020-10-20 07:03:13,326 INFO L204 nArgumentSynthesizer]: 8 loop disjuncts [2020-10-20 07:03:13,326 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 07:03:14,451 INFO L401 nArgumentSynthesizer]: We have 208 Motzkin's Theorem applications. [2020-10-20 07:03:14,451 INFO L402 nArgumentSynthesizer]: A total of 16 supporting invariants were added. [2020-10-20 07:03:17,325 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 29 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 29 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 07:03:17,368 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-10-20 07:03:17,369 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 07:03:17,370 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-20 07:03:17,370 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 07:03:17,370 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 07:03:17,370 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 07:03:17,371 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-20 07:03:17,371 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-20 07:03:17,372 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) [2020-10-20 07:03:17,396 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 30 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 07:03:17,397 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 07:03:17,398 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-20 07:03:17,398 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 07:03:17,398 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 07:03:17,398 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 07:03:17,398 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-20 07:03:17,398 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-20 07:03:17,400 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-10-20 07:03:17,429 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-10-20 07:03:17,430 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 07:03:17,430 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-20 07:03:17,430 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 07:03:17,430 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 07:03:17,430 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 07:03:17,431 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-20 07:03:17,431 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-20 07:03:17,432 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-10-20 07:03:17,455 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-10-20 07:03:17,457 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 07:03:17,457 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 07:03:17,457 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 07:03:17,457 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 07:03:17,458 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-20 07:03:17,458 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-10-20 07:03:17,462 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-10-20 07:03:17,486 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-10-20 07:03:17,487 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 07:03:17,487 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-20 07:03:17,487 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 07:03:17,488 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 07:03:17,488 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 07:03:17,488 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-20 07:03:17,488 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-20 07:03:17,490 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) [2020-10-20 07:03:17,513 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false Waiting until toolchain timeout for monitored process 34 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 07:03:17,515 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 07:03:17,515 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-20 07:03:17,515 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 07:03:17,515 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 07:03:17,516 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 07:03:17,516 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-20 07:03:17,516 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-20 07:03:17,517 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 35 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 35 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 07:03:17,540 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-10-20 07:03:17,541 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 07:03:17,541 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-20 07:03:17,542 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 07:03:17,542 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 07:03:17,542 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 07:03:17,547 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-20 07:03:17,547 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-20 07:03:17,550 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 36 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 36 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 07:03:17,577 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-10-20 07:03:17,578 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 07:03:17,578 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 07:03:17,578 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 07:03:17,579 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 07:03:17,580 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-20 07:03:17,580 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-10-20 07:03:17,584 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2020-10-20 07:03:17,644 INFO L443 ModelExtractionUtils]: Simplification made 7 calls to the SMT solver. [2020-10-20 07:03:17,645 INFO L444 ModelExtractionUtils]: 0 out of 7 variables were initially zero. Simplification set additionally 4 variables to zero. 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) [2020-10-20 07:03:17,711 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... Waiting until toolchain timeout for monitored process 37 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 07:03:17,745 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2020-10-20 07:03:17,745 INFO L510 LassoAnalysis]: Proved termination. [2020-10-20 07:03:17,746 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(~c~0) = -2*~c~0 + 39 Supporting invariants [] [2020-10-20 07:03:17,874 INFO L297 tatePredicateManager]: 13 out of 13 supporting invariants were superfluous and have been removed [2020-10-20 07:03:17,897 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 07:03:17,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 07:03:17,926 INFO L263 TraceCheckSpWp]: Trace formula consists of 94 conjuncts, 2 conjunts are in the unsatisfiable core [2020-10-20 07:03:17,928 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-20 07:03:17,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 07:03:17,958 INFO L263 TraceCheckSpWp]: Trace formula consists of 76 conjuncts, 4 conjunts are in the unsatisfiable core [2020-10-20 07:03:17,959 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-20 07:03:18,005 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-20 07:03:18,008 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 3 loop predicates [2020-10-20 07:03:18,009 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 11 states and 14 transitions. cyclomatic complexity: 5 Second operand 5 states. [2020-10-20 07:03:18,051 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 11 states and 14 transitions. cyclomatic complexity: 5. Second operand 5 states. Result 19 states and 26 transitions. Complement of second has 6 states. [2020-10-20 07:03:18,052 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2020-10-20 07:03:18,053 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-10-20 07:03:18,053 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 15 transitions. [2020-10-20 07:03:18,055 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 15 transitions. Stem has 4 letters. Loop has 5 letters. [2020-10-20 07:03:18,056 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-10-20 07:03:18,056 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 15 transitions. Stem has 9 letters. Loop has 5 letters. [2020-10-20 07:03:18,056 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-10-20 07:03:18,056 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 15 transitions. Stem has 4 letters. Loop has 10 letters. [2020-10-20 07:03:18,057 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-10-20 07:03:18,057 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 19 states and 26 transitions. [2020-10-20 07:03:18,060 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 1 [2020-10-20 07:03:18,061 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 19 states to 16 states and 21 transitions. [2020-10-20 07:03:18,061 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 9 [2020-10-20 07:03:18,062 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 11 [2020-10-20 07:03:18,062 INFO L73 IsDeterministic]: Start isDeterministic. Operand 16 states and 21 transitions. [2020-10-20 07:03:18,062 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-10-20 07:03:18,062 INFO L691 BuchiCegarLoop]: Abstraction has 16 states and 21 transitions. [2020-10-20 07:03:18,062 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states and 21 transitions. [2020-10-20 07:03:18,063 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 15. [2020-10-20 07:03:18,063 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2020-10-20 07:03:18,064 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 20 transitions. [2020-10-20 07:03:18,064 INFO L714 BuchiCegarLoop]: Abstraction has 15 states and 20 transitions. [2020-10-20 07:03:18,064 INFO L594 BuchiCegarLoop]: Abstraction has 15 states and 20 transitions. [2020-10-20 07:03:18,064 INFO L427 BuchiCegarLoop]: ======== Iteration 3============ [2020-10-20 07:03:18,065 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 15 states and 20 transitions. [2020-10-20 07:03:18,065 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 1 [2020-10-20 07:03:18,065 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-10-20 07:03:18,066 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-10-20 07:03:18,066 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1] [2020-10-20 07:03:18,066 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1] [2020-10-20 07:03:18,066 INFO L794 eck$LassoCheckResult]: Stem: 188#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call #t~string0.base, #t~string0.offset := #Ultimate.allocOnStack(2);call write~init~int(48, #t~string0.base, #t~string0.offset, 1);call write~init~int(0, #t~string0.base, 1 + #t~string0.offset, 1);call #t~string1.base, #t~string1.offset := #Ultimate.allocOnStack(16);~c~0 := 0; 181#L-1 havoc main_#res;havoc main_#t~post14, main_#t~nondet13, main_#t~mem15.base, main_#t~mem15.offset, main_#t~mem16.base, main_#t~mem16.offset, main_#t~mem17.base, main_#t~mem17.offset, main_#t~mem18.base, main_#t~mem18.offset, main_#t~mem19.base, main_#t~mem19.offset, main_#t~post20, main_~next~0.base, main_~next~0.offset, main_#t~mem21.base, main_#t~mem21.offset, main_#t~mem22.base, main_#t~mem22.offset, main_#t~mem23.base, main_#t~mem23.offset, main_#t~post24, main_~next~1.base, main_~next~1.offset, main_~#list~0.base, main_~#list~0.offset, main_~length~0;call main_~#list~0.base, main_~#list~0.offset := #Ultimate.allocOnStack(4);call write~init~$Pointer$(0, 0, main_~#list~0.base, main_~#list~0.offset, 4);main_~length~0 := 0; 182#L543-3 append_#in~plist.base, append_#in~plist.offset := main_~#list~0.base, main_~#list~0.offset;havoc append_#t~post5, append_#t~malloc6.base, append_#t~malloc6.offset, append_#t~mem7.base, append_#t~mem7.offset, append_#t~mem8.base, append_#t~mem8.offset, append_#t~ite12.base, append_#t~ite12.offset, append_#t~mem9.base, append_#t~mem9.offset, append_#t~mem10.base, append_#t~mem10.offset, append_#t~malloc11.base, append_#t~malloc11.offset, append_~plist.base, append_~plist.offset, append_~item~0.base, append_~item~0.offset;append_~plist.base, append_~plist.offset := append_#in~plist.base, append_#in~plist.offset;append_#t~post5 := ~c~0;~c~0 := 1 + append_#t~post5;havoc append_#t~post5;call append_#t~malloc6.base, append_#t~malloc6.offset := #Ultimate.allocOnHeap(8);append_~item~0.base, append_~item~0.offset := append_#t~malloc6.base, append_#t~malloc6.offset;call append_#t~mem7.base, append_#t~mem7.offset := read~$Pointer$(append_~plist.base, append_~plist.offset, 4);call write~$Pointer$(append_#t~mem7.base, append_#t~mem7.offset, append_~item~0.base, append_~item~0.offset, 4);havoc append_#t~mem7.base, append_#t~mem7.offset;call append_#t~mem8.base, append_#t~mem8.offset := read~$Pointer$(append_~item~0.base, append_~item~0.offset, 4); 189#L534 assume !(append_#t~mem8.base != 0 || append_#t~mem8.offset != 0);call append_#t~malloc11.base, append_#t~malloc11.offset := #Ultimate.allocOnHeap(8);append_#t~ite12.base, append_#t~ite12.offset := append_#t~malloc11.base, append_#t~malloc11.offset; 191#L534-2 call write~$Pointer$(append_#t~ite12.base, append_#t~ite12.offset, append_~item~0.base, 4 + append_~item~0.offset, 4);havoc append_#t~ite12.base, append_#t~ite12.offset;havoc append_#t~mem9.base, append_#t~mem9.offset;havoc append_#t~mem10.base, append_#t~mem10.offset;havoc append_#t~mem8.base, append_#t~mem8.offset;call write~$Pointer$(append_~item~0.base, append_~item~0.offset, append_~plist.base, append_~plist.offset, 4); 178#L529 main_#t~post14 := main_~length~0;main_~length~0 := 1 + main_#t~post14;havoc main_#t~post14; 184#L543-1 assume !(0 != main_#t~nondet13 && ~c~0 < 20);havoc main_#t~nondet13; 185#L543-4 assume !(main_~length~0 > 0); 183#L554-1 [2020-10-20 07:03:18,067 INFO L796 eck$LassoCheckResult]: Loop: 183#L554-1 assume !!(main_~length~0 > 0);call main_#t~mem21.base, main_#t~mem21.offset := read~$Pointer$(main_~#list~0.base, main_~#list~0.offset, 4);call main_#t~mem22.base, main_#t~mem22.offset := read~$Pointer$(main_#t~mem21.base, main_#t~mem21.offset, 4);main_~next~1.base, main_~next~1.offset := main_#t~mem22.base, main_#t~mem22.offset;havoc main_#t~mem21.base, main_#t~mem21.offset;havoc main_#t~mem22.base, main_#t~mem22.offset;call main_#t~mem23.base, main_#t~mem23.offset := read~$Pointer$(main_~#list~0.base, main_~#list~0.offset, 4);call ULTIMATE.dealloc(main_#t~mem23.base, main_#t~mem23.offset);havoc main_#t~mem23.base, main_#t~mem23.offset;call write~$Pointer$(main_~next~1.base, main_~next~1.offset, main_~#list~0.base, main_~#list~0.offset, 4);main_#t~post24 := main_~length~0;main_~length~0 := main_#t~post24 - 1;havoc main_#t~post24; 183#L554-1 [2020-10-20 07:03:18,067 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 07:03:18,067 INFO L82 PathProgramCache]: Analyzing trace with hash 149888852, now seen corresponding path program 1 times [2020-10-20 07:03:18,067 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 07:03:18,067 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2014663077] [2020-10-20 07:03:18,068 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 07:03:18,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 07:03:18,106 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-20 07:03:18,106 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2014663077] [2020-10-20 07:03:18,107 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-20 07:03:18,107 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-20 07:03:18,107 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [364260438] [2020-10-20 07:03:18,107 INFO L799 eck$LassoCheckResult]: stem already infeasible [2020-10-20 07:03:18,107 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 07:03:18,108 INFO L82 PathProgramCache]: Analyzing trace with hash 69, now seen corresponding path program 1 times [2020-10-20 07:03:18,108 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 07:03:18,108 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1130381732] [2020-10-20 07:03:18,108 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 07:03:18,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 07:03:18,113 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 07:03:18,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 07:03:18,117 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 07:03:18,120 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-20 07:03:18,257 WARN L193 SmtUtils]: Spent 135.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 58 [2020-10-20 07:03:18,297 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-20 07:03:18,297 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-20 07:03:18,298 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-10-20 07:03:18,298 INFO L87 Difference]: Start difference. First operand 15 states and 20 transitions. cyclomatic complexity: 7 Second operand 4 states. [2020-10-20 07:03:18,319 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 07:03:18,319 INFO L93 Difference]: Finished difference Result 17 states and 21 transitions. [2020-10-20 07:03:18,320 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-10-20 07:03:18,320 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 17 states and 21 transitions. [2020-10-20 07:03:18,321 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 1 [2020-10-20 07:03:18,322 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 17 states to 17 states and 21 transitions. [2020-10-20 07:03:18,322 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 11 [2020-10-20 07:03:18,322 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 11 [2020-10-20 07:03:18,322 INFO L73 IsDeterministic]: Start isDeterministic. Operand 17 states and 21 transitions. [2020-10-20 07:03:18,323 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-10-20 07:03:18,323 INFO L691 BuchiCegarLoop]: Abstraction has 17 states and 21 transitions. [2020-10-20 07:03:18,323 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states and 21 transitions. [2020-10-20 07:03:18,326 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 15. [2020-10-20 07:03:18,327 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2020-10-20 07:03:18,327 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 19 transitions. [2020-10-20 07:03:18,328 INFO L714 BuchiCegarLoop]: Abstraction has 15 states and 19 transitions. [2020-10-20 07:03:18,328 INFO L594 BuchiCegarLoop]: Abstraction has 15 states and 19 transitions. [2020-10-20 07:03:18,329 INFO L427 BuchiCegarLoop]: ======== Iteration 4============ [2020-10-20 07:03:18,329 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 15 states and 19 transitions. [2020-10-20 07:03:18,330 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 1 [2020-10-20 07:03:18,331 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-10-20 07:03:18,331 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-10-20 07:03:18,331 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1] [2020-10-20 07:03:18,332 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1] [2020-10-20 07:03:18,332 INFO L794 eck$LassoCheckResult]: Stem: 227#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call #t~string0.base, #t~string0.offset := #Ultimate.allocOnStack(2);call write~init~int(48, #t~string0.base, #t~string0.offset, 1);call write~init~int(0, #t~string0.base, 1 + #t~string0.offset, 1);call #t~string1.base, #t~string1.offset := #Ultimate.allocOnStack(16);~c~0 := 0; 216#L-1 havoc main_#res;havoc main_#t~post14, main_#t~nondet13, main_#t~mem15.base, main_#t~mem15.offset, main_#t~mem16.base, main_#t~mem16.offset, main_#t~mem17.base, main_#t~mem17.offset, main_#t~mem18.base, main_#t~mem18.offset, main_#t~mem19.base, main_#t~mem19.offset, main_#t~post20, main_~next~0.base, main_~next~0.offset, main_#t~mem21.base, main_#t~mem21.offset, main_#t~mem22.base, main_#t~mem22.offset, main_#t~mem23.base, main_#t~mem23.offset, main_#t~post24, main_~next~1.base, main_~next~1.offset, main_~#list~0.base, main_~#list~0.offset, main_~length~0;call main_~#list~0.base, main_~#list~0.offset := #Ultimate.allocOnStack(4);call write~init~$Pointer$(0, 0, main_~#list~0.base, main_~#list~0.offset, 4);main_~length~0 := 0; 217#L543-3 append_#in~plist.base, append_#in~plist.offset := main_~#list~0.base, main_~#list~0.offset;havoc append_#t~post5, append_#t~malloc6.base, append_#t~malloc6.offset, append_#t~mem7.base, append_#t~mem7.offset, append_#t~mem8.base, append_#t~mem8.offset, append_#t~ite12.base, append_#t~ite12.offset, append_#t~mem9.base, append_#t~mem9.offset, append_#t~mem10.base, append_#t~mem10.offset, append_#t~malloc11.base, append_#t~malloc11.offset, append_~plist.base, append_~plist.offset, append_~item~0.base, append_~item~0.offset;append_~plist.base, append_~plist.offset := append_#in~plist.base, append_#in~plist.offset;append_#t~post5 := ~c~0;~c~0 := 1 + append_#t~post5;havoc append_#t~post5;call append_#t~malloc6.base, append_#t~malloc6.offset := #Ultimate.allocOnHeap(8);append_~item~0.base, append_~item~0.offset := append_#t~malloc6.base, append_#t~malloc6.offset;call append_#t~mem7.base, append_#t~mem7.offset := read~$Pointer$(append_~plist.base, append_~plist.offset, 4);call write~$Pointer$(append_#t~mem7.base, append_#t~mem7.offset, append_~item~0.base, append_~item~0.offset, 4);havoc append_#t~mem7.base, append_#t~mem7.offset;call append_#t~mem8.base, append_#t~mem8.offset := read~$Pointer$(append_~item~0.base, append_~item~0.offset, 4); 228#L534 assume !(append_#t~mem8.base != 0 || append_#t~mem8.offset != 0);call append_#t~malloc11.base, append_#t~malloc11.offset := #Ultimate.allocOnHeap(8);append_#t~ite12.base, append_#t~ite12.offset := append_#t~malloc11.base, append_#t~malloc11.offset; 230#L534-2 call write~$Pointer$(append_#t~ite12.base, append_#t~ite12.offset, append_~item~0.base, 4 + append_~item~0.offset, 4);havoc append_#t~ite12.base, append_#t~ite12.offset;havoc append_#t~mem9.base, append_#t~mem9.offset;havoc append_#t~mem10.base, append_#t~mem10.offset;havoc append_#t~mem8.base, append_#t~mem8.offset;call write~$Pointer$(append_~item~0.base, append_~item~0.offset, append_~plist.base, append_~plist.offset, 4); 219#L529 main_#t~post14 := main_~length~0;main_~length~0 := 1 + main_#t~post14;havoc main_#t~post14; 223#L543-1 assume !(0 != main_#t~nondet13 && ~c~0 < 20);havoc main_#t~nondet13; 224#L543-4 assume main_~length~0 > 0;call main_#t~mem15.base, main_#t~mem15.offset := read~$Pointer$(main_~#list~0.base, main_~#list~0.offset, 4);call main_#t~mem16.base, main_#t~mem16.offset := read~$Pointer$(main_#t~mem15.base, main_#t~mem15.offset, 4);main_~next~0.base, main_~next~0.offset := main_#t~mem16.base, main_#t~mem16.offset;havoc main_#t~mem15.base, main_#t~mem15.offset;havoc main_#t~mem16.base, main_#t~mem16.offset;call main_#t~mem17.base, main_#t~mem17.offset := read~$Pointer$(main_~#list~0.base, main_~#list~0.offset, 4);call main_#t~mem18.base, main_#t~mem18.offset := read~$Pointer$(main_#t~mem17.base, 4 + main_#t~mem17.offset, 4);call ULTIMATE.dealloc(main_#t~mem18.base, main_#t~mem18.offset);havoc main_#t~mem18.base, main_#t~mem18.offset;havoc main_#t~mem17.base, main_#t~mem17.offset;call main_#t~mem19.base, main_#t~mem19.offset := read~$Pointer$(main_~#list~0.base, main_~#list~0.offset, 4);call ULTIMATE.dealloc(main_#t~mem19.base, main_#t~mem19.offset);havoc main_#t~mem19.base, main_#t~mem19.offset;call write~$Pointer$(main_~next~0.base, main_~next~0.offset, main_~#list~0.base, main_~#list~0.offset, 4);main_#t~post20 := main_~length~0;main_~length~0 := main_#t~post20 - 1;havoc main_#t~post20; 222#L554-1 [2020-10-20 07:03:18,333 INFO L796 eck$LassoCheckResult]: Loop: 222#L554-1 assume !!(main_~length~0 > 0);call main_#t~mem21.base, main_#t~mem21.offset := read~$Pointer$(main_~#list~0.base, main_~#list~0.offset, 4);call main_#t~mem22.base, main_#t~mem22.offset := read~$Pointer$(main_#t~mem21.base, main_#t~mem21.offset, 4);main_~next~1.base, main_~next~1.offset := main_#t~mem22.base, main_#t~mem22.offset;havoc main_#t~mem21.base, main_#t~mem21.offset;havoc main_#t~mem22.base, main_#t~mem22.offset;call main_#t~mem23.base, main_#t~mem23.offset := read~$Pointer$(main_~#list~0.base, main_~#list~0.offset, 4);call ULTIMATE.dealloc(main_#t~mem23.base, main_#t~mem23.offset);havoc main_#t~mem23.base, main_#t~mem23.offset;call write~$Pointer$(main_~next~1.base, main_~next~1.offset, main_~#list~0.base, main_~#list~0.offset, 4);main_#t~post24 := main_~length~0;main_~length~0 := main_#t~post24 - 1;havoc main_#t~post24; 222#L554-1 [2020-10-20 07:03:18,333 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 07:03:18,333 INFO L82 PathProgramCache]: Analyzing trace with hash 149888850, now seen corresponding path program 1 times [2020-10-20 07:03:18,333 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 07:03:18,336 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2087318062] [2020-10-20 07:03:18,339 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 07:03:18,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 07:03:18,400 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 07:03:18,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 07:03:18,444 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 07:03:18,459 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-20 07:03:18,459 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 07:03:18,459 INFO L82 PathProgramCache]: Analyzing trace with hash 69, now seen corresponding path program 2 times [2020-10-20 07:03:18,460 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 07:03:18,460 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [739578650] [2020-10-20 07:03:18,460 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 07:03:18,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 07:03:18,467 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 07:03:18,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 07:03:18,475 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 07:03:18,484 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-20 07:03:18,486 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 07:03:18,486 INFO L82 PathProgramCache]: Analyzing trace with hash 351587092, now seen corresponding path program 1 times [2020-10-20 07:03:18,487 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 07:03:18,487 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [113426465] [2020-10-20 07:03:18,487 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 07:03:18,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 07:03:18,578 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-20 07:03:18,578 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [113426465] [2020-10-20 07:03:18,579 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-20 07:03:18,579 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-10-20 07:03:18,579 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1554140917] [2020-10-20 07:03:18,717 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-20 07:03:18,718 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-10-20 07:03:18,718 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2020-10-20 07:03:18,718 INFO L87 Difference]: Start difference. First operand 15 states and 19 transitions. cyclomatic complexity: 6 Second operand 5 states. [2020-10-20 07:03:18,743 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 07:03:18,743 INFO L93 Difference]: Finished difference Result 27 states and 33 transitions. [2020-10-20 07:03:18,746 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-10-20 07:03:18,746 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 27 states and 33 transitions. [2020-10-20 07:03:18,748 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 1 [2020-10-20 07:03:18,751 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 27 states to 23 states and 29 transitions. [2020-10-20 07:03:18,751 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 12 [2020-10-20 07:03:18,751 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 12 [2020-10-20 07:03:18,752 INFO L73 IsDeterministic]: Start isDeterministic. Operand 23 states and 29 transitions. [2020-10-20 07:03:18,752 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-10-20 07:03:18,752 INFO L691 BuchiCegarLoop]: Abstraction has 23 states and 29 transitions. [2020-10-20 07:03:18,752 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states and 29 transitions. [2020-10-20 07:03:18,755 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 15. [2020-10-20 07:03:18,757 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2020-10-20 07:03:18,758 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 18 transitions. [2020-10-20 07:03:18,758 INFO L714 BuchiCegarLoop]: Abstraction has 15 states and 18 transitions. [2020-10-20 07:03:18,759 INFO L594 BuchiCegarLoop]: Abstraction has 15 states and 18 transitions. [2020-10-20 07:03:18,759 INFO L427 BuchiCegarLoop]: ======== Iteration 5============ [2020-10-20 07:03:18,759 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 15 states and 18 transitions. [2020-10-20 07:03:18,760 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 1 [2020-10-20 07:03:18,762 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-10-20 07:03:18,763 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-10-20 07:03:18,763 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 2, 2, 1, 1, 1, 1, 1] [2020-10-20 07:03:18,764 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1] [2020-10-20 07:03:18,765 INFO L794 eck$LassoCheckResult]: Stem: 278#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call #t~string0.base, #t~string0.offset := #Ultimate.allocOnStack(2);call write~init~int(48, #t~string0.base, #t~string0.offset, 1);call write~init~int(0, #t~string0.base, 1 + #t~string0.offset, 1);call #t~string1.base, #t~string1.offset := #Ultimate.allocOnStack(16);~c~0 := 0; 271#L-1 havoc main_#res;havoc main_#t~post14, main_#t~nondet13, main_#t~mem15.base, main_#t~mem15.offset, main_#t~mem16.base, main_#t~mem16.offset, main_#t~mem17.base, main_#t~mem17.offset, main_#t~mem18.base, main_#t~mem18.offset, main_#t~mem19.base, main_#t~mem19.offset, main_#t~post20, main_~next~0.base, main_~next~0.offset, main_#t~mem21.base, main_#t~mem21.offset, main_#t~mem22.base, main_#t~mem22.offset, main_#t~mem23.base, main_#t~mem23.offset, main_#t~post24, main_~next~1.base, main_~next~1.offset, main_~#list~0.base, main_~#list~0.offset, main_~length~0;call main_~#list~0.base, main_~#list~0.offset := #Ultimate.allocOnStack(4);call write~init~$Pointer$(0, 0, main_~#list~0.base, main_~#list~0.offset, 4);main_~length~0 := 0; 272#L543-3 append_#in~plist.base, append_#in~plist.offset := main_~#list~0.base, main_~#list~0.offset;havoc append_#t~post5, append_#t~malloc6.base, append_#t~malloc6.offset, append_#t~mem7.base, append_#t~mem7.offset, append_#t~mem8.base, append_#t~mem8.offset, append_#t~ite12.base, append_#t~ite12.offset, append_#t~mem9.base, append_#t~mem9.offset, append_#t~mem10.base, append_#t~mem10.offset, append_#t~malloc11.base, append_#t~malloc11.offset, append_~plist.base, append_~plist.offset, append_~item~0.base, append_~item~0.offset;append_~plist.base, append_~plist.offset := append_#in~plist.base, append_#in~plist.offset;append_#t~post5 := ~c~0;~c~0 := 1 + append_#t~post5;havoc append_#t~post5;call append_#t~malloc6.base, append_#t~malloc6.offset := #Ultimate.allocOnHeap(8);append_~item~0.base, append_~item~0.offset := append_#t~malloc6.base, append_#t~malloc6.offset;call append_#t~mem7.base, append_#t~mem7.offset := read~$Pointer$(append_~plist.base, append_~plist.offset, 4);call write~$Pointer$(append_#t~mem7.base, append_#t~mem7.offset, append_~item~0.base, append_~item~0.offset, 4);havoc append_#t~mem7.base, append_#t~mem7.offset;call append_#t~mem8.base, append_#t~mem8.offset := read~$Pointer$(append_~item~0.base, append_~item~0.offset, 4); 279#L534 assume !(append_#t~mem8.base != 0 || append_#t~mem8.offset != 0);call append_#t~malloc11.base, append_#t~malloc11.offset := #Ultimate.allocOnHeap(8);append_#t~ite12.base, append_#t~ite12.offset := append_#t~malloc11.base, append_#t~malloc11.offset; 268#L534-2 call write~$Pointer$(append_#t~ite12.base, append_#t~ite12.offset, append_~item~0.base, 4 + append_~item~0.offset, 4);havoc append_#t~ite12.base, append_#t~ite12.offset;havoc append_#t~mem9.base, append_#t~mem9.offset;havoc append_#t~mem10.base, append_#t~mem10.offset;havoc append_#t~mem8.base, append_#t~mem8.offset;call write~$Pointer$(append_~item~0.base, append_~item~0.offset, append_~plist.base, append_~plist.offset, 4); 269#L529 main_#t~post14 := main_~length~0;main_~length~0 := 1 + main_#t~post14;havoc main_#t~post14; 276#L543-1 assume !!(0 != main_#t~nondet13 && ~c~0 < 20);havoc main_#t~nondet13; 277#L543-3 append_#in~plist.base, append_#in~plist.offset := main_~#list~0.base, main_~#list~0.offset;havoc append_#t~post5, append_#t~malloc6.base, append_#t~malloc6.offset, append_#t~mem7.base, append_#t~mem7.offset, append_#t~mem8.base, append_#t~mem8.offset, append_#t~ite12.base, append_#t~ite12.offset, append_#t~mem9.base, append_#t~mem9.offset, append_#t~mem10.base, append_#t~mem10.offset, append_#t~malloc11.base, append_#t~malloc11.offset, append_~plist.base, append_~plist.offset, append_~item~0.base, append_~item~0.offset;append_~plist.base, append_~plist.offset := append_#in~plist.base, append_#in~plist.offset;append_#t~post5 := ~c~0;~c~0 := 1 + append_#t~post5;havoc append_#t~post5;call append_#t~malloc6.base, append_#t~malloc6.offset := #Ultimate.allocOnHeap(8);append_~item~0.base, append_~item~0.offset := append_#t~malloc6.base, append_#t~malloc6.offset;call append_#t~mem7.base, append_#t~mem7.offset := read~$Pointer$(append_~plist.base, append_~plist.offset, 4);call write~$Pointer$(append_#t~mem7.base, append_#t~mem7.offset, append_~item~0.base, append_~item~0.offset, 4);havoc append_#t~mem7.base, append_#t~mem7.offset;call append_#t~mem8.base, append_#t~mem8.offset := read~$Pointer$(append_~item~0.base, append_~item~0.offset, 4); 280#L534 assume !(append_#t~mem8.base != 0 || append_#t~mem8.offset != 0);call append_#t~malloc11.base, append_#t~malloc11.offset := #Ultimate.allocOnHeap(8);append_#t~ite12.base, append_#t~ite12.offset := append_#t~malloc11.base, append_#t~malloc11.offset; 282#L534-2 call write~$Pointer$(append_#t~ite12.base, append_#t~ite12.offset, append_~item~0.base, 4 + append_~item~0.offset, 4);havoc append_#t~ite12.base, append_#t~ite12.offset;havoc append_#t~mem9.base, append_#t~mem9.offset;havoc append_#t~mem10.base, append_#t~mem10.offset;havoc append_#t~mem8.base, append_#t~mem8.offset;call write~$Pointer$(append_~item~0.base, append_~item~0.offset, append_~plist.base, append_~plist.offset, 4); 281#L529 main_#t~post14 := main_~length~0;main_~length~0 := 1 + main_#t~post14;havoc main_#t~post14; 274#L543-1 assume !(0 != main_#t~nondet13 && ~c~0 < 20);havoc main_#t~nondet13; 275#L543-4 assume main_~length~0 > 0;call main_#t~mem15.base, main_#t~mem15.offset := read~$Pointer$(main_~#list~0.base, main_~#list~0.offset, 4);call main_#t~mem16.base, main_#t~mem16.offset := read~$Pointer$(main_#t~mem15.base, main_#t~mem15.offset, 4);main_~next~0.base, main_~next~0.offset := main_#t~mem16.base, main_#t~mem16.offset;havoc main_#t~mem15.base, main_#t~mem15.offset;havoc main_#t~mem16.base, main_#t~mem16.offset;call main_#t~mem17.base, main_#t~mem17.offset := read~$Pointer$(main_~#list~0.base, main_~#list~0.offset, 4);call main_#t~mem18.base, main_#t~mem18.offset := read~$Pointer$(main_#t~mem17.base, 4 + main_#t~mem17.offset, 4);call ULTIMATE.dealloc(main_#t~mem18.base, main_#t~mem18.offset);havoc main_#t~mem18.base, main_#t~mem18.offset;havoc main_#t~mem17.base, main_#t~mem17.offset;call main_#t~mem19.base, main_#t~mem19.offset := read~$Pointer$(main_~#list~0.base, main_~#list~0.offset, 4);call ULTIMATE.dealloc(main_#t~mem19.base, main_#t~mem19.offset);havoc main_#t~mem19.base, main_#t~mem19.offset;call write~$Pointer$(main_~next~0.base, main_~next~0.offset, main_~#list~0.base, main_~#list~0.offset, 4);main_#t~post20 := main_~length~0;main_~length~0 := main_#t~post20 - 1;havoc main_#t~post20; 273#L554-1 [2020-10-20 07:03:18,765 INFO L796 eck$LassoCheckResult]: Loop: 273#L554-1 assume !!(main_~length~0 > 0);call main_#t~mem21.base, main_#t~mem21.offset := read~$Pointer$(main_~#list~0.base, main_~#list~0.offset, 4);call main_#t~mem22.base, main_#t~mem22.offset := read~$Pointer$(main_#t~mem21.base, main_#t~mem21.offset, 4);main_~next~1.base, main_~next~1.offset := main_#t~mem22.base, main_#t~mem22.offset;havoc main_#t~mem21.base, main_#t~mem21.offset;havoc main_#t~mem22.base, main_#t~mem22.offset;call main_#t~mem23.base, main_#t~mem23.offset := read~$Pointer$(main_~#list~0.base, main_~#list~0.offset, 4);call ULTIMATE.dealloc(main_#t~mem23.base, main_#t~mem23.offset);havoc main_#t~mem23.base, main_#t~mem23.offset;call write~$Pointer$(main_~next~1.base, main_~next~1.offset, main_~#list~0.base, main_~#list~0.offset, 4);main_#t~post24 := main_~length~0;main_~length~0 := main_#t~post24 - 1;havoc main_#t~post24; 273#L554-1 [2020-10-20 07:03:18,765 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 07:03:18,766 INFO L82 PathProgramCache]: Analyzing trace with hash -315524230, now seen corresponding path program 1 times [2020-10-20 07:03:18,766 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 07:03:18,766 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1908043279] [2020-10-20 07:03:18,766 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 07:03:18,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 07:03:18,852 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-20 07:03:18,854 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1908043279] [2020-10-20 07:03:18,854 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1021051832] [2020-10-20 07:03:18,855 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 38 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 38 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-10-20 07:03:18,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 07:03:18,933 INFO L263 TraceCheckSpWp]: Trace formula consists of 203 conjuncts, 24 conjunts are in the unsatisfiable core [2020-10-20 07:03:18,935 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-20 07:03:19,039 INFO L350 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-10-20 07:03:19,039 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 31 treesize of output 47 [2020-10-20 07:03:19,040 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-10-20 07:03:19,089 INFO L625 ElimStorePlain]: treesize reduction 20, result has 66.7 percent of original size [2020-10-20 07:03:19,101 INFO L545 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-10-20 07:03:19,101 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:45, output treesize:18 [2020-10-20 07:03:19,183 INFO L173 IndexEqualityManager]: detected equality via solver [2020-10-20 07:03:19,186 INFO L350 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-10-20 07:03:19,187 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 16 treesize of output 11 [2020-10-20 07:03:19,188 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-10-20 07:03:19,198 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-20 07:03:19,202 INFO L545 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-10-20 07:03:19,202 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:28, output treesize:4 [2020-10-20 07:03:19,204 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-20 07:03:19,205 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-10-20 07:03:19,205 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 6] total 8 [2020-10-20 07:03:19,205 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [412623737] [2020-10-20 07:03:19,206 INFO L799 eck$LassoCheckResult]: stem already infeasible [2020-10-20 07:03:19,206 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 07:03:19,206 INFO L82 PathProgramCache]: Analyzing trace with hash 69, now seen corresponding path program 3 times [2020-10-20 07:03:19,206 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 07:03:19,206 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1694849808] [2020-10-20 07:03:19,207 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 07:03:19,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 07:03:19,212 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 07:03:19,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 07:03:19,216 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 07:03:19,218 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-20 07:03:19,406 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-20 07:03:19,406 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-10-20 07:03:19,406 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2020-10-20 07:03:19,406 INFO L87 Difference]: Start difference. First operand 15 states and 18 transitions. cyclomatic complexity: 5 Second operand 8 states. [2020-10-20 07:03:19,513 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 07:03:19,513 INFO L93 Difference]: Finished difference Result 15 states and 16 transitions. [2020-10-20 07:03:19,514 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-10-20 07:03:19,514 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 15 states and 16 transitions. [2020-10-20 07:03:19,515 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 1 [2020-10-20 07:03:19,516 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 15 states to 15 states and 16 transitions. [2020-10-20 07:03:19,516 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 10 [2020-10-20 07:03:19,516 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 10 [2020-10-20 07:03:19,516 INFO L73 IsDeterministic]: Start isDeterministic. Operand 15 states and 16 transitions. [2020-10-20 07:03:19,516 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-10-20 07:03:19,516 INFO L691 BuchiCegarLoop]: Abstraction has 15 states and 16 transitions. [2020-10-20 07:03:19,516 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states and 16 transitions. [2020-10-20 07:03:19,517 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 15. [2020-10-20 07:03:19,518 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2020-10-20 07:03:19,518 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 16 transitions. [2020-10-20 07:03:19,518 INFO L714 BuchiCegarLoop]: Abstraction has 15 states and 16 transitions. [2020-10-20 07:03:19,519 INFO L594 BuchiCegarLoop]: Abstraction has 15 states and 16 transitions. [2020-10-20 07:03:19,519 INFO L427 BuchiCegarLoop]: ======== Iteration 6============ [2020-10-20 07:03:19,519 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 15 states and 16 transitions. [2020-10-20 07:03:19,519 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 1 [2020-10-20 07:03:19,519 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-10-20 07:03:19,519 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-10-20 07:03:19,520 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2020-10-20 07:03:19,520 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1] [2020-10-20 07:03:19,521 INFO L794 eck$LassoCheckResult]: Stem: 360#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call #t~string0.base, #t~string0.offset := #Ultimate.allocOnStack(2);call write~init~int(48, #t~string0.base, #t~string0.offset, 1);call write~init~int(0, #t~string0.base, 1 + #t~string0.offset, 1);call #t~string1.base, #t~string1.offset := #Ultimate.allocOnStack(16);~c~0 := 0; 349#L-1 havoc main_#res;havoc main_#t~post14, main_#t~nondet13, main_#t~mem15.base, main_#t~mem15.offset, main_#t~mem16.base, main_#t~mem16.offset, main_#t~mem17.base, main_#t~mem17.offset, main_#t~mem18.base, main_#t~mem18.offset, main_#t~mem19.base, main_#t~mem19.offset, main_#t~post20, main_~next~0.base, main_~next~0.offset, main_#t~mem21.base, main_#t~mem21.offset, main_#t~mem22.base, main_#t~mem22.offset, main_#t~mem23.base, main_#t~mem23.offset, main_#t~post24, main_~next~1.base, main_~next~1.offset, main_~#list~0.base, main_~#list~0.offset, main_~length~0;call main_~#list~0.base, main_~#list~0.offset := #Ultimate.allocOnStack(4);call write~init~$Pointer$(0, 0, main_~#list~0.base, main_~#list~0.offset, 4);main_~length~0 := 0; 350#L543-3 append_#in~plist.base, append_#in~plist.offset := main_~#list~0.base, main_~#list~0.offset;havoc append_#t~post5, append_#t~malloc6.base, append_#t~malloc6.offset, append_#t~mem7.base, append_#t~mem7.offset, append_#t~mem8.base, append_#t~mem8.offset, append_#t~ite12.base, append_#t~ite12.offset, append_#t~mem9.base, append_#t~mem9.offset, append_#t~mem10.base, append_#t~mem10.offset, append_#t~malloc11.base, append_#t~malloc11.offset, append_~plist.base, append_~plist.offset, append_~item~0.base, append_~item~0.offset;append_~plist.base, append_~plist.offset := append_#in~plist.base, append_#in~plist.offset;append_#t~post5 := ~c~0;~c~0 := 1 + append_#t~post5;havoc append_#t~post5;call append_#t~malloc6.base, append_#t~malloc6.offset := #Ultimate.allocOnHeap(8);append_~item~0.base, append_~item~0.offset := append_#t~malloc6.base, append_#t~malloc6.offset;call append_#t~mem7.base, append_#t~mem7.offset := read~$Pointer$(append_~plist.base, append_~plist.offset, 4);call write~$Pointer$(append_#t~mem7.base, append_#t~mem7.offset, append_~item~0.base, append_~item~0.offset, 4);havoc append_#t~mem7.base, append_#t~mem7.offset;call append_#t~mem8.base, append_#t~mem8.offset := read~$Pointer$(append_~item~0.base, append_~item~0.offset, 4); 361#L534 assume !(append_#t~mem8.base != 0 || append_#t~mem8.offset != 0);call append_#t~malloc11.base, append_#t~malloc11.offset := #Ultimate.allocOnHeap(8);append_#t~ite12.base, append_#t~ite12.offset := append_#t~malloc11.base, append_#t~malloc11.offset; 363#L534-2 call write~$Pointer$(append_#t~ite12.base, append_#t~ite12.offset, append_~item~0.base, 4 + append_~item~0.offset, 4);havoc append_#t~ite12.base, append_#t~ite12.offset;havoc append_#t~mem9.base, append_#t~mem9.offset;havoc append_#t~mem10.base, append_#t~mem10.offset;havoc append_#t~mem8.base, append_#t~mem8.offset;call write~$Pointer$(append_~item~0.base, append_~item~0.offset, append_~plist.base, append_~plist.offset, 4); 354#L529 main_#t~post14 := main_~length~0;main_~length~0 := 1 + main_#t~post14;havoc main_#t~post14; 358#L543-1 assume !!(0 != main_#t~nondet13 && ~c~0 < 20);havoc main_#t~nondet13; 359#L543-3 append_#in~plist.base, append_#in~plist.offset := main_~#list~0.base, main_~#list~0.offset;havoc append_#t~post5, append_#t~malloc6.base, append_#t~malloc6.offset, append_#t~mem7.base, append_#t~mem7.offset, append_#t~mem8.base, append_#t~mem8.offset, append_#t~ite12.base, append_#t~ite12.offset, append_#t~mem9.base, append_#t~mem9.offset, append_#t~mem10.base, append_#t~mem10.offset, append_#t~malloc11.base, append_#t~malloc11.offset, append_~plist.base, append_~plist.offset, append_~item~0.base, append_~item~0.offset;append_~plist.base, append_~plist.offset := append_#in~plist.base, append_#in~plist.offset;append_#t~post5 := ~c~0;~c~0 := 1 + append_#t~post5;havoc append_#t~post5;call append_#t~malloc6.base, append_#t~malloc6.offset := #Ultimate.allocOnHeap(8);append_~item~0.base, append_~item~0.offset := append_#t~malloc6.base, append_#t~malloc6.offset;call append_#t~mem7.base, append_#t~mem7.offset := read~$Pointer$(append_~plist.base, append_~plist.offset, 4);call write~$Pointer$(append_#t~mem7.base, append_#t~mem7.offset, append_~item~0.base, append_~item~0.offset, 4);havoc append_#t~mem7.base, append_#t~mem7.offset;call append_#t~mem8.base, append_#t~mem8.offset := read~$Pointer$(append_~item~0.base, append_~item~0.offset, 4); 362#L534 assume append_#t~mem8.base != 0 || append_#t~mem8.offset != 0;call append_#t~mem9.base, append_#t~mem9.offset := read~$Pointer$(append_~item~0.base, append_~item~0.offset, 4);call append_#t~mem10.base, append_#t~mem10.offset := read~$Pointer$(append_#t~mem9.base, 4 + append_#t~mem9.offset, 4);append_#t~ite12.base, append_#t~ite12.offset := append_#t~mem10.base, append_#t~mem10.offset; 351#L534-2 call write~$Pointer$(append_#t~ite12.base, append_#t~ite12.offset, append_~item~0.base, 4 + append_~item~0.offset, 4);havoc append_#t~ite12.base, append_#t~ite12.offset;havoc append_#t~mem9.base, append_#t~mem9.offset;havoc append_#t~mem10.base, append_#t~mem10.offset;havoc append_#t~mem8.base, append_#t~mem8.offset;call write~$Pointer$(append_~item~0.base, append_~item~0.offset, append_~plist.base, append_~plist.offset, 4); 352#L529 main_#t~post14 := main_~length~0;main_~length~0 := 1 + main_#t~post14;havoc main_#t~post14; 356#L543-1 assume !(0 != main_#t~nondet13 && ~c~0 < 20);havoc main_#t~nondet13; 357#L543-4 assume main_~length~0 > 0;call main_#t~mem15.base, main_#t~mem15.offset := read~$Pointer$(main_~#list~0.base, main_~#list~0.offset, 4);call main_#t~mem16.base, main_#t~mem16.offset := read~$Pointer$(main_#t~mem15.base, main_#t~mem15.offset, 4);main_~next~0.base, main_~next~0.offset := main_#t~mem16.base, main_#t~mem16.offset;havoc main_#t~mem15.base, main_#t~mem15.offset;havoc main_#t~mem16.base, main_#t~mem16.offset;call main_#t~mem17.base, main_#t~mem17.offset := read~$Pointer$(main_~#list~0.base, main_~#list~0.offset, 4);call main_#t~mem18.base, main_#t~mem18.offset := read~$Pointer$(main_#t~mem17.base, 4 + main_#t~mem17.offset, 4);call ULTIMATE.dealloc(main_#t~mem18.base, main_#t~mem18.offset);havoc main_#t~mem18.base, main_#t~mem18.offset;havoc main_#t~mem17.base, main_#t~mem17.offset;call main_#t~mem19.base, main_#t~mem19.offset := read~$Pointer$(main_~#list~0.base, main_~#list~0.offset, 4);call ULTIMATE.dealloc(main_#t~mem19.base, main_#t~mem19.offset);havoc main_#t~mem19.base, main_#t~mem19.offset;call write~$Pointer$(main_~next~0.base, main_~next~0.offset, main_~#list~0.base, main_~#list~0.offset, 4);main_#t~post20 := main_~length~0;main_~length~0 := main_#t~post20 - 1;havoc main_#t~post20; 355#L554-1 [2020-10-20 07:03:19,521 INFO L796 eck$LassoCheckResult]: Loop: 355#L554-1 assume !!(main_~length~0 > 0);call main_#t~mem21.base, main_#t~mem21.offset := read~$Pointer$(main_~#list~0.base, main_~#list~0.offset, 4);call main_#t~mem22.base, main_#t~mem22.offset := read~$Pointer$(main_#t~mem21.base, main_#t~mem21.offset, 4);main_~next~1.base, main_~next~1.offset := main_#t~mem22.base, main_#t~mem22.offset;havoc main_#t~mem21.base, main_#t~mem21.offset;havoc main_#t~mem22.base, main_#t~mem22.offset;call main_#t~mem23.base, main_#t~mem23.offset := read~$Pointer$(main_~#list~0.base, main_~#list~0.offset, 4);call ULTIMATE.dealloc(main_#t~mem23.base, main_#t~mem23.offset);havoc main_#t~mem23.base, main_#t~mem23.offset;call write~$Pointer$(main_~next~1.base, main_~next~1.offset, main_~#list~0.base, main_~#list~0.offset, 4);main_#t~post24 := main_~length~0;main_~length~0 := main_#t~post24 - 1;havoc main_#t~post24; 355#L554-1 [2020-10-20 07:03:19,521 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 07:03:19,522 INFO L82 PathProgramCache]: Analyzing trace with hash -317371272, now seen corresponding path program 1 times [2020-10-20 07:03:19,522 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 07:03:19,522 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2044696257] [2020-10-20 07:03:19,522 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 07:03:19,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 07:03:19,557 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 07:03:19,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 07:03:19,594 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 07:03:19,601 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-20 07:03:19,602 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 07:03:19,602 INFO L82 PathProgramCache]: Analyzing trace with hash 69, now seen corresponding path program 4 times [2020-10-20 07:03:19,602 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 07:03:19,602 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [754723152] [2020-10-20 07:03:19,603 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 07:03:19,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 07:03:19,607 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 07:03:19,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 07:03:19,609 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 07:03:19,611 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-20 07:03:19,612 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 07:03:19,612 INFO L82 PathProgramCache]: Analyzing trace with hash -1248574802, now seen corresponding path program 1 times [2020-10-20 07:03:19,612 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 07:03:19,613 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [426823433] [2020-10-20 07:03:19,613 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 07:03:19,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 07:03:19,657 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 07:03:19,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 07:03:19,701 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 07:03:19,709 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-20 07:03:50,918 WARN L193 SmtUtils]: Spent 31.08 s on a formula simplification. DAG size of input: 400 DAG size of output: 324 [2020-10-20 07:03:51,245 INFO L545 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-10-20 07:03:56,557 WARN L193 SmtUtils]: Spent 5.31 s on a formula simplification that was a NOOP. DAG size: 227 [2020-10-20 07:03:56,557 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-20 07:03:56,599 INFO L545 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-10-20 07:04:01,463 WARN L193 SmtUtils]: Spent 4.86 s on a formula simplification that was a NOOP. DAG size: 223 [2020-10-20 07:04:01,464 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-20 07:04:01,494 INFO L545 ElimStorePlain]: Start of recursive call 4: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-10-20 07:04:06,615 WARN L193 SmtUtils]: Spent 5.12 s on a formula simplification that was a NOOP. DAG size: 220 [2020-10-20 07:04:06,615 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-20 07:04:06,651 INFO L545 ElimStorePlain]: Start of recursive call 5: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-10-20 07:04:10,794 WARN L193 SmtUtils]: Spent 4.14 s on a formula simplification that was a NOOP. DAG size: 217 [2020-10-20 07:04:10,795 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-20 07:04:10,835 INFO L545 ElimStorePlain]: Start of recursive call 6: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-10-20 07:04:14,595 WARN L193 SmtUtils]: Spent 3.76 s on a formula simplification that was a NOOP. DAG size: 213 [2020-10-20 07:04:14,595 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-20 07:04:14,622 INFO L545 ElimStorePlain]: Start of recursive call 7: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-10-20 07:04:18,224 WARN L193 SmtUtils]: Spent 3.60 s on a formula simplification that was a NOOP. DAG size: 210 [2020-10-20 07:04:18,224 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-20 07:04:18,269 INFO L545 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 6 dim-2 vars, End of recursive call: 11 dim-0 vars, and 1 xjuncts. [2020-10-20 07:04:18,270 INFO L244 ElimStorePlain]: Needed 7 recursive calls to eliminate 11 variables, input treesize:12084, output treesize:12326 [2020-10-20 07:04:22,182 WARN L193 SmtUtils]: Spent 3.88 s on a formula simplification that was a NOOP. DAG size: 210 [2020-10-20 07:04:22,187 INFO L210 LassoAnalysis]: Preferences: [2020-10-20 07:04:22,187 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2020-10-20 07:04:22,187 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-10-20 07:04:22,187 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2020-10-20 07:04:22,187 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2020-10-20 07:04:22,187 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 07:04:22,187 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2020-10-20 07:04:22,188 INFO L132 ssoRankerPreferences]: Path of dumped script: [2020-10-20 07:04:22,188 INFO L133 ssoRankerPreferences]: Filename of dumped script: test-0232_1-2.i_Iteration6_Lasso [2020-10-20 07:04:22,188 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2020-10-20 07:04:22,188 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2020-10-20 07:04:22,196 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 07:04:22,207 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 07:04:22,210 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 07:04:22,213 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 07:04:22,216 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 07:04:22,219 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 07:04:22,225 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 07:04:22,229 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 07:04:22,232 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 07:04:22,235 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 07:04:22,239 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 07:04:22,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-10-20 07:04:22,245 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 07:04:22,248 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 07:04:22,252 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 07:04:22,255 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 07:04:22,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-10-20 07:04:22,273 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 07:04:22,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-10-20 07:04:22,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-10-20 07:04:22,283 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 07:04:22,287 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 07:04:22,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-10-20 07:04:22,305 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 07:04:22,308 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 07:04:24,017 FATAL L? ?]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer has thrown an exception: java.lang.AssertionError: MapEliminator tries to combine Int and (Array Int Int) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.mapelimination.MapEliminator.indexEqualityInequalityImpliesValueEquality(MapEliminator.java:850) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.mapelimination.MapEliminator.replaceSelectStoreTerm(MapEliminator.java:592) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.mapelimination.MapEliminator.replaceStoreTerms(MapEliminator.java:542) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.mapelimination.MapEliminator.getRewrittenTransFormula(MapEliminator.java:330) at de.uni_freiburg.informatik.ultimate.lassoranker.preprocessors.MapEliminationLassoPreprocessor.process(MapEliminationLassoPreprocessor.java:109) at de.uni_freiburg.informatik.ultimate.lassoranker.variables.LassoBuilder.applyPreprocessor(LassoBuilder.java:154) at de.uni_freiburg.informatik.ultimate.lassoranker.variables.LassoBuilder.preprocess(LassoBuilder.java:262) at de.uni_freiburg.informatik.ultimate.lassoranker.LassoAnalysis.preprocess(LassoAnalysis.java:278) at de.uni_freiburg.informatik.ultimate.lassoranker.LassoAnalysis.(LassoAnalysis.java:229) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.LassoCheck.synthesize(LassoCheck.java:612) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.LassoCheck.access$16(LassoCheck.java:539) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.LassoCheck$LassoCheckResult.checkLassoTermination(LassoCheck.java:957) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.LassoCheck$LassoCheckResult.(LassoCheck.java:865) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.LassoCheck.(LassoCheck.java:251) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiCegarLoop.iterate(BuchiCegarLoop.java:461) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver.doTerminationAnalysis(BuchiAutomizerObserver.java:141) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver.finish(BuchiAutomizerObserver.java:382) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:55) [2020-10-20 07:04:24,022 INFO L168 Benchmark]: Toolchain (without parser) took 95650.42 ms. Allocated memory was 37.2 MB in the beginning and 212.3 MB in the end (delta: 175.1 MB). Free memory was 16.2 MB in the beginning and 27.8 MB in the end (delta: -11.6 MB). Peak memory consumption was 179.1 MB. Max. memory is 14.3 GB. [2020-10-20 07:04:24,024 INFO L168 Benchmark]: CDTParser took 0.30 ms. Allocated memory is still 34.6 MB. Free memory was 10.6 MB in the beginning and 10.5 MB in the end (delta: 65.5 kB). Peak memory consumption was 65.5 kB. Max. memory is 14.3 GB. [2020-10-20 07:04:24,025 INFO L168 Benchmark]: CACSL2BoogieTranslator took 658.60 ms. Allocated memory was 37.2 MB in the beginning and 46.7 MB in the end (delta: 9.4 MB). Free memory was 15.3 MB in the beginning and 27.6 MB in the end (delta: -12.3 MB). Peak memory consumption was 14.3 MB. Max. memory is 14.3 GB. [2020-10-20 07:04:24,027 INFO L168 Benchmark]: Boogie Procedure Inliner took 67.70 ms. Allocated memory is still 46.7 MB. Free memory was 27.3 MB in the beginning and 25.4 MB in the end (delta: 1.9 MB). Peak memory consumption was 1.9 MB. Max. memory is 14.3 GB. [2020-10-20 07:04:24,028 INFO L168 Benchmark]: Boogie Preprocessor took 31.93 ms. Allocated memory is still 46.7 MB. Free memory was 25.2 MB in the beginning and 23.6 MB in the end (delta: 1.6 MB). Peak memory consumption was 1.6 MB. Max. memory is 14.3 GB. [2020-10-20 07:04:24,029 INFO L168 Benchmark]: RCFGBuilder took 508.46 ms. Allocated memory is still 46.7 MB. Free memory was 23.6 MB in the beginning and 17.7 MB in the end (delta: 5.9 MB). Peak memory consumption was 13.9 MB. Max. memory is 14.3 GB. [2020-10-20 07:04:24,030 INFO L168 Benchmark]: BuchiAutomizer took 94373.70 ms. Allocated memory was 46.7 MB in the beginning and 212.3 MB in the end (delta: 165.7 MB). Free memory was 17.7 MB in the beginning and 27.8 MB in the end (delta: -10.1 MB). Peak memory consumption was 171.2 MB. Max. memory is 14.3 GB. [2020-10-20 07:04:24,039 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.30 ms. Allocated memory is still 34.6 MB. Free memory was 10.6 MB in the beginning and 10.5 MB in the end (delta: 65.5 kB). Peak memory consumption was 65.5 kB. Max. memory is 14.3 GB. * CACSL2BoogieTranslator took 658.60 ms. Allocated memory was 37.2 MB in the beginning and 46.7 MB in the end (delta: 9.4 MB). Free memory was 15.3 MB in the beginning and 27.6 MB in the end (delta: -12.3 MB). Peak memory consumption was 14.3 MB. Max. memory is 14.3 GB. * Boogie Procedure Inliner took 67.70 ms. Allocated memory is still 46.7 MB. Free memory was 27.3 MB in the beginning and 25.4 MB in the end (delta: 1.9 MB). Peak memory consumption was 1.9 MB. Max. memory is 14.3 GB. * Boogie Preprocessor took 31.93 ms. Allocated memory is still 46.7 MB. Free memory was 25.2 MB in the beginning and 23.6 MB in the end (delta: 1.6 MB). Peak memory consumption was 1.6 MB. Max. memory is 14.3 GB. * RCFGBuilder took 508.46 ms. Allocated memory is still 46.7 MB. Free memory was 23.6 MB in the beginning and 17.7 MB in the end (delta: 5.9 MB). Peak memory consumption was 13.9 MB. Max. memory is 14.3 GB. * BuchiAutomizer took 94373.70 ms. Allocated memory was 46.7 MB in the beginning and 212.3 MB in the end (delta: 165.7 MB). Free memory was 17.7 MB in the beginning and 27.8 MB in the end (delta: -10.1 MB). Peak memory consumption was 171.2 MB. Max. memory is 14.3 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer: - ExceptionOrErrorResult: AssertionError: MapEliminator tries to combine Int and (Array Int Int) de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer: AssertionError: MapEliminator tries to combine Int and (Array Int Int): de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.mapelimination.MapEliminator.indexEqualityInequalityImpliesValueEquality(MapEliminator.java:850) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request...