./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 906a4fb5 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx12G -Xms1G -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerTermination.xml -i ../sv-benchmarks/c/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-906a4fb [2020-10-19 19:09:35,118 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-10-19 19:09:35,121 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-10-19 19:09:35,151 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-10-19 19:09:35,151 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-10-19 19:09:35,153 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-10-19 19:09:35,154 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-10-19 19:09:35,156 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-10-19 19:09:35,158 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-10-19 19:09:35,159 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-10-19 19:09:35,160 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-10-19 19:09:35,162 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-10-19 19:09:35,162 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-10-19 19:09:35,163 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-10-19 19:09:35,164 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-10-19 19:09:35,166 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-10-19 19:09:35,167 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-10-19 19:09:35,168 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-10-19 19:09:35,170 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-10-19 19:09:35,172 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-10-19 19:09:35,174 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-10-19 19:09:35,175 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-10-19 19:09:35,177 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-10-19 19:09:35,178 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-10-19 19:09:35,181 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-10-19 19:09:35,182 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-10-19 19:09:35,182 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-10-19 19:09:35,183 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-10-19 19:09:35,184 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-10-19 19:09:35,185 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-10-19 19:09:35,185 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-10-19 19:09:35,190 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-10-19 19:09:35,191 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-10-19 19:09:35,191 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-10-19 19:09:35,194 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-10-19 19:09:35,194 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-10-19 19:09:35,195 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-10-19 19:09:35,196 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-10-19 19:09:35,196 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-10-19 19:09:35,197 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-10-19 19:09:35,198 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-10-19 19:09:35,200 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-32bit-Automizer_Default.epf [2020-10-19 19:09:35,246 INFO L113 SettingsManager]: Loading preferences was successful [2020-10-19 19:09:35,247 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-10-19 19:09:35,248 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-10-19 19:09:35,249 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-10-19 19:09:35,249 INFO L138 SettingsManager]: * Use SBE=true [2020-10-19 19:09:35,249 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2020-10-19 19:09:35,249 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2020-10-19 19:09:35,250 INFO L138 SettingsManager]: * Use old map elimination=false [2020-10-19 19:09:35,250 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2020-10-19 19:09:35,250 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2020-10-19 19:09:35,251 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2020-10-19 19:09:35,252 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-10-19 19:09:35,252 INFO L138 SettingsManager]: * sizeof long=4 [2020-10-19 19:09:35,252 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2020-10-19 19:09:35,253 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-10-19 19:09:35,253 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-10-19 19:09:35,253 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-10-19 19:09:35,254 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2020-10-19 19:09:35,254 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2020-10-19 19:09:35,254 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2020-10-19 19:09:35,255 INFO L138 SettingsManager]: * sizeof long double=12 [2020-10-19 19:09:35,255 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-10-19 19:09:35,255 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2020-10-19 19:09:35,255 INFO L138 SettingsManager]: * Use constant arrays=true [2020-10-19 19:09:35,256 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2020-10-19 19:09:35,256 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-10-19 19:09:35,256 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-10-19 19:09:35,256 INFO L138 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2020-10-19 19:09:35,257 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-10-19 19:09:35,257 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-10-19 19:09:35,257 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-10-19 19:09:35,258 INFO L138 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2020-10-19 19:09:35,259 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2020-10-19 19:09:35,259 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-19 19:09:35,553 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-10-19 19:09:35,572 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-10-19 19:09:35,576 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-10-19 19:09:35,578 INFO L271 PluginConnector]: Initializing CDTParser... [2020-10-19 19:09:35,579 INFO L275 PluginConnector]: CDTParser initialized [2020-10-19 19:09:35,580 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-19 19:09:35,653 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/74f0f566d/d290bdace87a4f39bd7e455ad61474e2/FLAGb60abf578 [2020-10-19 19:09:36,250 INFO L306 CDTParser]: Found 1 translation units. [2020-10-19 19:09:36,251 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/list-ext-properties/test-0232_1-2.i [2020-10-19 19:09:36,267 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/74f0f566d/d290bdace87a4f39bd7e455ad61474e2/FLAGb60abf578 [2020-10-19 19:09:36,583 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/74f0f566d/d290bdace87a4f39bd7e455ad61474e2 [2020-10-19 19:09:36,587 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-10-19 19:09:36,594 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2020-10-19 19:09:36,595 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-10-19 19:09:36,595 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-10-19 19:09:36,598 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-10-19 19:09:36,599 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.10 07:09:36" (1/1) ... [2020-10-19 19:09:36,602 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@26ec7849 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.10 07:09:36, skipping insertion in model container [2020-10-19 19:09:36,602 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.10 07:09:36" (1/1) ... [2020-10-19 19:09:36,611 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-10-19 19:09:36,672 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-10-19 19:09:37,083 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-10-19 19:09:37,093 INFO L203 MainTranslator]: Completed pre-run [2020-10-19 19:09:37,132 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-10-19 19:09:37,190 INFO L208 MainTranslator]: Completed translation [2020-10-19 19:09:37,191 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.10 07:09:37 WrapperNode [2020-10-19 19:09:37,191 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-10-19 19:09:37,192 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-10-19 19:09:37,192 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-10-19 19:09:37,192 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-10-19 19:09:37,200 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.10 07:09:37" (1/1) ... [2020-10-19 19:09:37,214 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.10 07:09:37" (1/1) ... [2020-10-19 19:09:37,240 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-10-19 19:09:37,240 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-10-19 19:09:37,240 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-10-19 19:09:37,240 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-10-19 19:09:37,247 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.10 07:09:37" (1/1) ... [2020-10-19 19:09:37,247 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.10 07:09:37" (1/1) ... [2020-10-19 19:09:37,251 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.10 07:09:37" (1/1) ... [2020-10-19 19:09:37,251 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.10 07:09:37" (1/1) ... [2020-10-19 19:09:37,259 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.10 07:09:37" (1/1) ... [2020-10-19 19:09:37,263 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.10 07:09:37" (1/1) ... [2020-10-19 19:09:37,265 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.10 07:09:37" (1/1) ... [2020-10-19 19:09:37,268 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-10-19 19:09:37,269 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-10-19 19:09:37,269 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-10-19 19:09:37,269 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-10-19 19:09:37,270 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.10 07:09:37" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-19 19:09:37,335 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2020-10-19 19:09:37,335 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2020-10-19 19:09:37,335 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-10-19 19:09:37,335 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2020-10-19 19:09:37,335 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-10-19 19:09:37,336 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2020-10-19 19:09:37,336 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2020-10-19 19:09:37,336 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-10-19 19:09:37,336 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-10-19 19:09:37,724 INFO L293 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-10-19 19:09:37,724 INFO L298 CfgBuilder]: Removed 8 assume(true) statements. [2020-10-19 19:09:37,726 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.10 07:09:37 BoogieIcfgContainer [2020-10-19 19:09:37,726 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-10-19 19:09:37,727 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2020-10-19 19:09:37,727 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2020-10-19 19:09:37,731 INFO L275 PluginConnector]: BuchiAutomizer initialized [2020-10-19 19:09:37,732 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-10-19 19:09:37,732 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 19.10 07:09:36" (1/3) ... [2020-10-19 19:09:37,733 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@650f0c0a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 19.10 07:09:37, skipping insertion in model container [2020-10-19 19:09:37,733 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-10-19 19:09:37,733 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.10 07:09:37" (2/3) ... [2020-10-19 19:09:37,734 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@650f0c0a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 19.10 07:09:37, skipping insertion in model container [2020-10-19 19:09:37,734 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-10-19 19:09:37,734 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.10 07:09:37" (3/3) ... [2020-10-19 19:09:37,736 INFO L373 chiAutomizerObserver]: Analyzing ICFG test-0232_1-2.i [2020-10-19 19:09:37,785 INFO L359 BuchiCegarLoop]: Interprodecural is true [2020-10-19 19:09:37,785 INFO L360 BuchiCegarLoop]: Hoare is false [2020-10-19 19:09:37,785 INFO L361 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2020-10-19 19:09:37,785 INFO L362 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2020-10-19 19:09:37,786 INFO L363 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-10-19 19:09:37,786 INFO L364 BuchiCegarLoop]: Difference is false [2020-10-19 19:09:37,786 INFO L365 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-10-19 19:09:37,786 INFO L368 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2020-10-19 19:09:37,802 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 13 states. [2020-10-19 19:09:37,822 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 6 [2020-10-19 19:09:37,822 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-10-19 19:09:37,822 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-10-19 19:09:37,829 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2020-10-19 19:09:37,829 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2020-10-19 19:09:37,829 INFO L427 BuchiCegarLoop]: ======== Iteration 1============ [2020-10-19 19:09:37,829 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 13 states. [2020-10-19 19:09:37,830 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 6 [2020-10-19 19:09:37,831 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-10-19 19:09:37,831 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-10-19 19:09:37,831 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2020-10-19 19:09:37,831 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2020-10-19 19:09:37,838 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-19 19:09:37,838 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~mem10.base, append_#t~mem10.offset;havoc append_#t~mem9.base, append_#t~mem9.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-19 19:09:37,844 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-19 19:09:37,844 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 1 times [2020-10-19 19:09:37,852 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-19 19:09:37,852 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1047538430] [2020-10-19 19:09:37,852 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-19 19:09:37,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-19 19:09:37,967 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-19 19:09:37,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-19 19:09:37,990 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-19 19:09:38,013 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-19 19:09:38,014 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-19 19:09:38,015 INFO L82 PathProgramCache]: Analyzing trace with hash 34451375, now seen corresponding path program 1 times [2020-10-19 19:09:38,015 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-19 19:09:38,015 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [598475776] [2020-10-19 19:09:38,016 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-19 19:09:38,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-19 19:09:38,053 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-19 19:09:38,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-19 19:09:38,078 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-19 19:09:38,087 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-19 19:09:38,088 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-19 19:09:38,089 INFO L82 PathProgramCache]: Analyzing trace with hash 1805890861, now seen corresponding path program 1 times [2020-10-19 19:09:38,089 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-19 19:09:38,089 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [866941258] [2020-10-19 19:09:38,090 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-19 19:09:38,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-19 19:09:38,237 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-19 19:09:38,237 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [866941258] [2020-10-19 19:09:38,238 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-19 19:09:38,239 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-10-19 19:09:38,239 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2065718347] [2020-10-19 19:09:39,707 WARN L193 SmtUtils]: Spent 1.46 s on a formula simplification. DAG size of input: 151 DAG size of output: 146 [2020-10-19 19:09:39,839 INFO L545 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-10-19 19:09:39,853 INFO L545 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-10-19 19:09:40,925 WARN L193 SmtUtils]: Spent 1.07 s on a formula simplification that was a NOOP. DAG size: 124 [2020-10-19 19:09:40,927 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-19 19:09:40,946 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-19 19:09:40,961 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-19 19:09:41,717 WARN L193 SmtUtils]: Spent 755.00 ms on a formula simplification that was a NOOP. DAG size: 125 [2020-10-19 19:09:41,718 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-19 19:09:41,723 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-19 19:09:41,724 INFO L244 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:739, output treesize:723 [2020-10-19 19:09:42,510 WARN L193 SmtUtils]: Spent 782.00 ms on a formula simplification that was a NOOP. DAG size: 125 [2020-10-19 19:09:42,513 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-19 19:09:42,526 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-19 19:09:42,527 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-10-19 19:09:42,528 INFO L87 Difference]: Start difference. First operand 13 states. Second operand 4 states. [2020-10-19 19:09:42,598 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-19 19:09:42,598 INFO L93 Difference]: Finished difference Result 17 states and 20 transitions. [2020-10-19 19:09:42,598 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-10-19 19:09:42,600 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 17 states and 20 transitions. [2020-10-19 19:09:42,602 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 7 [2020-10-19 19:09:42,606 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 17 states to 13 states and 16 transitions. [2020-10-19 19:09:42,607 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 13 [2020-10-19 19:09:42,607 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 13 [2020-10-19 19:09:42,608 INFO L73 IsDeterministic]: Start isDeterministic. Operand 13 states and 16 transitions. [2020-10-19 19:09:42,608 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-19 19:09:42,608 INFO L691 BuchiCegarLoop]: Abstraction has 13 states and 16 transitions. [2020-10-19 19:09:42,627 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states and 16 transitions. [2020-10-19 19:09:42,637 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 11. [2020-10-19 19:09:42,638 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2020-10-19 19:09:42,639 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 14 transitions. [2020-10-19 19:09:42,640 INFO L714 BuchiCegarLoop]: Abstraction has 11 states and 14 transitions. [2020-10-19 19:09:42,640 INFO L594 BuchiCegarLoop]: Abstraction has 11 states and 14 transitions. [2020-10-19 19:09:42,640 INFO L427 BuchiCegarLoop]: ======== Iteration 2============ [2020-10-19 19:09:42,640 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 11 states and 14 transitions. [2020-10-19 19:09:42,641 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 6 [2020-10-19 19:09:42,641 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-10-19 19:09:42,641 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-10-19 19:09:42,642 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2020-10-19 19:09:42,642 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2020-10-19 19:09:42,642 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-19 19:09:42,643 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~mem10.base, append_#t~mem10.offset;havoc append_#t~mem9.base, append_#t~mem9.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-19 19:09:42,643 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-19 19:09:42,643 INFO L82 PathProgramCache]: Analyzing trace with hash 925640, now seen corresponding path program 1 times [2020-10-19 19:09:42,644 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-19 19:09:42,644 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [946698866] [2020-10-19 19:09:42,644 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-19 19:09:42,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-19 19:09:42,669 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-19 19:09:42,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-19 19:09:42,715 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-19 19:09:42,733 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-19 19:09:42,733 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-19 19:09:42,734 INFO L82 PathProgramCache]: Analyzing trace with hash 41102165, now seen corresponding path program 2 times [2020-10-19 19:09:42,736 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-19 19:09:42,736 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [655729214] [2020-10-19 19:09:42,736 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-19 19:09:42,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-19 19:09:42,779 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-19 19:09:42,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-19 19:09:42,812 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-19 19:09:42,826 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-19 19:09:42,828 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-19 19:09:42,830 INFO L82 PathProgramCache]: Analyzing trace with hash 351588334, now seen corresponding path program 1 times [2020-10-19 19:09:42,830 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-19 19:09:42,832 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1723193375] [2020-10-19 19:09:42,832 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-19 19:09:42,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-19 19:09:42,917 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-19 19:09:42,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-19 19:09:42,991 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-19 19:09:43,020 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-19 19:09:44,109 WARN L193 SmtUtils]: Spent 1.08 s on a formula simplification. DAG size of input: 170 DAG size of output: 164 [2020-10-19 19:09:44,139 INFO L545 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-10-19 19:09:44,178 INFO L545 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-10-19 19:09:45,299 WARN L193 SmtUtils]: Spent 1.12 s on a formula simplification that was a NOOP. DAG size: 165 [2020-10-19 19:09:45,301 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-19 19:09:45,316 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-19 19:09:45,328 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-19 19:09:46,574 WARN L193 SmtUtils]: Spent 1.24 s on a formula simplification that was a NOOP. DAG size: 166 [2020-10-19 19:09:46,581 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-19 19:09:46,585 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-19 19:09:46,586 INFO L244 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:861, output treesize:905 [2020-10-19 19:09:47,993 WARN L193 SmtUtils]: Spent 1.40 s on a formula simplification that was a NOOP. DAG size: 166 [2020-10-19 19:09:48,846 WARN L193 SmtUtils]: Spent 849.00 ms on a formula simplification. DAG size of input: 164 DAG size of output: 140 [2020-10-19 19:09:49,110 WARN L193 SmtUtils]: Spent 259.00 ms on a formula simplification that was a NOOP. DAG size: 125 [2020-10-19 19:09:49,128 INFO L210 LassoAnalysis]: Preferences: [2020-10-19 19:09:49,132 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2020-10-19 19:09:49,133 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-10-19 19:09:49,133 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2020-10-19 19:09:49,133 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2020-10-19 19:09:49,133 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-19 19:09:49,133 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2020-10-19 19:09:49,133 INFO L132 ssoRankerPreferences]: Path of dumped script: [2020-10-19 19:09:49,133 INFO L133 ssoRankerPreferences]: Filename of dumped script: test-0232_1-2.i_Iteration2_Lasso [2020-10-19 19:09:49,134 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2020-10-19 19:09:49,134 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2020-10-19 19:09:49,167 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-19 19:09:49,173 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-19 19:09:49,176 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-19 19:09:49,179 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-19 19:09:49,182 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-19 19:09:49,184 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-19 19:09:49,186 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-19 19:09:49,189 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-19 19:09:49,191 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-19 19:09:49,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-19 19:09:50,183 WARN L193 SmtUtils]: Spent 297.00 ms on a formula simplification. DAG size of input: 98 DAG size of output: 88 [2020-10-19 19:09:51,906 WARN L193 SmtUtils]: Spent 1.23 s on a formula simplification. DAG size of input: 139 DAG size of output: 122 [2020-10-19 19:09:51,907 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-19 19:09:51,915 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-19 19:09:51,917 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-19 19:09:51,919 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-19 19:09:51,923 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-19 19:09:51,925 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-19 19:09:51,927 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-19 19:09:51,930 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-19 19:09:51,939 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-19 19:09:51,942 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-19 19:09:51,945 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-19 19:09:51,947 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-19 19:09:51,949 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-19 19:09:51,952 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-19 19:09:51,961 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-19 19:09:51,964 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-19 19:09:51,967 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-19 19:09:51,969 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-19 19:09:51,971 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-19 19:09:51,974 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-19 19:09:51,977 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-19 19:09:51,979 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-19 19:09:51,980 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-19 19:09:51,982 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-19 19:09:51,984 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-19 19:09:51,987 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-19 19:09:51,990 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-19 19:09:52,315 WARN L193 SmtUtils]: Spent 170.00 ms on a formula simplification that was a NOOP. DAG size: 82 [2020-10-19 19:09:52,669 WARN L193 SmtUtils]: Spent 353.00 ms on a formula simplification that was a NOOP. DAG size: 134 [2020-10-19 19:09:54,339 WARN L193 SmtUtils]: Spent 1.46 s on a formula simplification. DAG size of input: 86 DAG size of output: 86 [2020-10-19 19:09:59,646 WARN L193 SmtUtils]: Spent 5.30 s on a formula simplification. DAG size of input: 136 DAG size of output: 136 [2020-10-19 19:09:59,761 INFO L292 LassoAnalysis]: Preprocessing complete. [2020-10-19 19:09:59,766 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-19 19:09:59,771 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-10-19 19:09:59,774 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-19 19:09:59,774 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-19 19:09:59,774 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-19 19:09:59,775 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-19 19:09:59,775 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-19 19:09:59,778 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-19 19:09:59,778 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-19 19:09:59,782 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-19 19:09:59,805 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-10-19 19:09:59,807 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-19 19:09:59,807 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-19 19:09:59,807 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-19 19:09:59,807 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-19 19:09:59,812 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-19 19:09:59,812 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-10-19 19:09:59,821 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-19 19:09:59,860 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-10-19 19:09:59,862 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-19 19:09:59,862 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-19 19:09:59,862 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-19 19:09:59,863 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-19 19:09:59,863 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-19 19:09:59,863 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-19 19:09:59,864 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-19 19:09:59,865 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-19 19:09:59,897 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-10-19 19:09:59,898 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-19 19:09:59,898 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-19 19:09:59,899 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-19 19:09:59,899 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-19 19:09:59,904 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-19 19:09:59,904 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-10-19 19:09:59,907 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-19 19:09:59,933 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-10-19 19:09:59,934 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-19 19:09:59,934 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-19 19:09:59,935 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-19 19:09:59,935 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-19 19:09:59,935 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-19 19:09:59,943 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-19 19:09:59,944 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-19 19:09:59,947 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-19 19:09:59,981 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-10-19 19:09:59,982 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-19 19:09:59,983 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-19 19:09:59,983 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-19 19:09:59,983 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-19 19:09:59,983 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-19 19:09:59,987 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-19 19:09:59,987 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-19 19:09:59,988 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-19 19:10:00,015 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-10-19 19:10:00,017 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-19 19:10:00,017 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-19 19:10:00,017 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-19 19:10:00,017 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-19 19:10:00,017 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-19 19:10:00,018 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-19 19:10:00,018 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-19 19:10:00,026 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-19 19:10:00,053 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-10-19 19:10:00,055 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-19 19:10:00,055 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-19 19:10:00,055 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-19 19:10:00,055 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-19 19:10:00,056 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-19 19:10:00,056 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-19 19:10:00,056 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-19 19:10:00,060 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-19 19:10:00,086 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-10-19 19:10:00,087 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-19 19:10:00,087 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-19 19:10:00,087 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-19 19:10:00,088 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-19 19:10:00,088 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-19 19:10:00,088 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-19 19:10:00,088 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-19 19:10:00,089 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 11 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-19 19:10:00,113 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-10-19 19:10:00,114 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-19 19:10:00,114 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-19 19:10:00,114 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-19 19:10:00,114 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-19 19:10:00,121 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-19 19:10:00,121 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-10-19 19:10:00,127 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 12 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-19 19:10:00,152 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-10-19 19:10:00,153 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-19 19:10:00,153 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-19 19:10:00,154 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-19 19:10:00,154 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-19 19:10:00,155 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-19 19:10:00,156 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-10-19 19:10:00,160 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 13 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-19 19:10:00,204 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-10-19 19:10:00,205 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-19 19:10:00,205 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-19 19:10:00,206 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-19 19:10:00,206 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-19 19:10:00,208 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-19 19:10:00,208 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-10-19 19:10:00,212 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 14 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-19 19:10:00,254 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-10-19 19:10:00,255 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-19 19:10:00,256 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-19 19:10:00,256 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-19 19:10:00,256 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-19 19:10:00,258 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-19 19:10:00,258 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-10-19 19:10:00,261 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 15 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-19 19:10:00,282 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-10-19 19:10:00,284 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-19 19:10:00,285 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-19 19:10:00,285 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-19 19:10:00,285 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-19 19:10:00,290 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-19 19:10:00,290 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-10-19 19:10:00,295 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 16 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-19 19:10:00,324 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-10-19 19:10:00,325 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-19 19:10:00,325 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-19 19:10:00,325 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-19 19:10:00,325 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-19 19:10:00,327 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-19 19:10:00,327 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-10-19 19:10:00,330 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 17 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 17 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-19 19:10:00,353 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-10-19 19:10:00,355 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-19 19:10:00,355 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-19 19:10:00,355 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-19 19:10:00,355 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-19 19:10:00,356 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-19 19:10:00,362 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-19 19:10:00,362 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-19 19:10:00,368 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 18 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-10-19 19:10:00,411 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-10-19 19:10:00,413 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-19 19:10:00,413 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-19 19:10:00,413 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-19 19:10:00,413 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-19 19:10:00,413 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-19 19:10:00,414 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-19 19:10:00,414 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 18 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-19 19:10:00,417 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-19 19:10:00,451 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-10-19 19:10:00,453 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-19 19:10:00,453 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-19 19:10:00,453 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-19 19:10:00,453 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-19 19:10:00,453 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-19 19:10:00,454 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-19 19:10:00,454 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-19 19:10:00,455 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) [2020-10-19 19:10:00,479 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 20 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-19 19:10:00,480 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-19 19:10:00,480 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-19 19:10:00,481 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-19 19:10:00,481 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-19 19:10:00,481 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-19 19:10:00,481 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-19 19:10:00,481 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-19 19:10:00,483 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 21 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 21 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-19 19:10:00,514 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-10-19 19:10:00,515 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-19 19:10:00,515 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-19 19:10:00,515 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-19 19:10:00,516 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-19 19:10:00,521 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-19 19:10:00,521 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-10-19 19:10:00,529 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 22 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 22 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-19 19:10:00,549 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-10-19 19:10:00,551 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-19 19:10:00,551 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-19 19:10:00,551 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-19 19:10:00,551 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-19 19:10:00,553 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-19 19:10:00,553 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-10-19 19:10:00,558 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-19 19:10:00,580 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-10-19 19:10:00,581 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-19 19:10:00,582 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-19 19:10:00,582 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-19 19:10:00,582 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-19 19:10:00,589 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-19 19:10:00,589 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-10-19 19:10:00,604 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 24 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 24 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-19 19:10:00,628 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-10-19 19:10:00,630 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-19 19:10:00,630 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-19 19:10:00,630 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-19 19:10:00,631 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-19 19:10:00,632 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-19 19:10:00,633 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-10-19 19:10:00,638 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 25 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 25 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-19 19:10:00,660 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-10-19 19:10:00,661 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-19 19:10:00,661 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-19 19:10:00,661 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-19 19:10:00,661 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-19 19:10:00,661 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-19 19:10:00,662 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-19 19:10:00,662 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-19 19:10:00,663 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 26 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 26 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-19 19:10:00,705 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-10-19 19:10:00,709 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-19 19:10:00,709 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-19 19:10:00,709 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-19 19:10:00,709 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-19 19:10:00,709 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-19 19:10:00,710 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-19 19:10:00,710 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-19 19:10:00,712 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 27 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-10-19 19:10:00,735 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 27 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-19 19:10:00,737 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-19 19:10:00,737 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-19 19:10:00,737 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-19 19:10:00,737 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-19 19:10:00,738 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-19 19:10:00,738 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-19 19:10:00,738 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-19 19:10:00,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 28 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 28 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-19 19:10:00,781 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-10-19 19:10:00,783 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-19 19:10:00,784 INFO L203 nArgumentSynthesizer]: 4 stem disjuncts [2020-10-19 19:10:00,784 INFO L204 nArgumentSynthesizer]: 8 loop disjuncts [2020-10-19 19:10:00,784 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-19 19:10:01,837 INFO L401 nArgumentSynthesizer]: We have 208 Motzkin's Theorem applications. [2020-10-19 19:10:01,838 INFO L402 nArgumentSynthesizer]: A total of 16 supporting invariants were added. [2020-10-19 19:10:04,482 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 29 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 29 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-19 19:10:04,522 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-10-19 19:10:04,524 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-19 19:10:04,524 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-19 19:10:04,524 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-19 19:10:04,524 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-19 19:10:04,524 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-19 19:10:04,525 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-19 19:10:04,525 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-19 19:10:04,526 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 30 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 30 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-19 19:10:04,551 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-10-19 19:10:04,552 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-19 19:10:04,552 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-19 19:10:04,552 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-19 19:10:04,553 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-19 19:10:04,553 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-19 19:10:04,553 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-19 19:10:04,553 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-19 19:10:04,554 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-19 19:10:04,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-19 19:10:04,578 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-19 19:10:04,578 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-19 19:10:04,578 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-19 19:10:04,578 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-19 19:10:04,578 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-19 19:10:04,579 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-19 19:10:04,579 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-19 19:10:04,580 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-19 19:10:04,603 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-10-19 19:10:04,604 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-19 19:10:04,604 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-19 19:10:04,605 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-19 19:10:04,605 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-19 19:10:04,606 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-19 19:10:04,606 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-10-19 19:10:04,609 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-19 19:10:04,631 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-10-19 19:10:04,633 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-19 19:10:04,633 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-19 19:10:04,633 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-19 19:10:04,633 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-19 19:10:04,634 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-19 19:10:04,634 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-19 19:10:04,634 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-19 19:10:04,636 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 34 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 34 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-19 19:10:04,659 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-10-19 19:10:04,661 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-19 19:10:04,661 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-19 19:10:04,661 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-19 19:10:04,661 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-19 19:10:04,661 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-19 19:10:04,661 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-19 19:10:04,661 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-19 19:10:04,665 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) [2020-10-19 19:10:04,687 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 35 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-19 19:10:04,688 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-19 19:10:04,688 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-19 19:10:04,688 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-19 19:10:04,689 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-19 19:10:04,689 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-19 19:10:04,689 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-19 19:10:04,689 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-19 19:10:04,697 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) [2020-10-19 19:10:04,730 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-10-19 19:10:04,732 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-19 19:10:04,732 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-19 19:10:04,732 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-19 19:10:04,732 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-19 19:10:04,734 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-19 19:10:04,734 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. Waiting until toolchain timeout for monitored process 36 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-19 19:10:04,739 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2020-10-19 19:10:04,767 INFO L443 ModelExtractionUtils]: Simplification made 7 calls to the SMT solver. [2020-10-19 19:10:04,767 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-19 19:10:04,772 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-19 19:10:04,776 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2020-10-19 19:10:04,777 INFO L510 LassoAnalysis]: Proved termination. [2020-10-19 19:10:04,777 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(~c~0) = -2*~c~0 + 39 Supporting invariants [] [2020-10-19 19:10:05,073 INFO L297 tatePredicateManager]: 13 out of 13 supporting invariants were superfluous and have been removed [2020-10-19 19:10:05,102 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-19 19:10:05,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-19 19:10:05,138 INFO L263 TraceCheckSpWp]: Trace formula consists of 94 conjuncts, 2 conjunts are in the unsatisfiable core [2020-10-19 19:10:05,141 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-19 19:10:05,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-19 19:10:05,174 INFO L263 TraceCheckSpWp]: Trace formula consists of 76 conjuncts, 4 conjunts are in the unsatisfiable core [2020-10-19 19:10:05,175 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-19 19:10:05,232 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-19 19:10:05,236 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-19 19:10:05,237 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 11 states and 14 transitions. cyclomatic complexity: 5 Second operand 5 states. [2020-10-19 19:10:05,283 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-19 19:10:05,285 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2020-10-19 19:10:05,286 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-10-19 19:10:05,286 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 15 transitions. [2020-10-19 19:10:05,288 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 15 transitions. Stem has 4 letters. Loop has 5 letters. [2020-10-19 19:10:05,290 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-10-19 19:10:05,290 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 15 transitions. Stem has 9 letters. Loop has 5 letters. [2020-10-19 19:10:05,291 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-10-19 19:10:05,291 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 15 transitions. Stem has 4 letters. Loop has 10 letters. [2020-10-19 19:10:05,292 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-10-19 19:10:05,293 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 19 states and 26 transitions. [2020-10-19 19:10:05,297 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 1 [2020-10-19 19:10:05,299 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 19 states to 16 states and 21 transitions. [2020-10-19 19:10:05,299 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 9 [2020-10-19 19:10:05,299 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 11 [2020-10-19 19:10:05,300 INFO L73 IsDeterministic]: Start isDeterministic. Operand 16 states and 21 transitions. [2020-10-19 19:10:05,300 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-10-19 19:10:05,300 INFO L691 BuchiCegarLoop]: Abstraction has 16 states and 21 transitions. [2020-10-19 19:10:05,300 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states and 21 transitions. [2020-10-19 19:10:05,304 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 15. [2020-10-19 19:10:05,304 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2020-10-19 19:10:05,305 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 20 transitions. [2020-10-19 19:10:05,305 INFO L714 BuchiCegarLoop]: Abstraction has 15 states and 20 transitions. [2020-10-19 19:10:05,305 INFO L594 BuchiCegarLoop]: Abstraction has 15 states and 20 transitions. [2020-10-19 19:10:05,306 INFO L427 BuchiCegarLoop]: ======== Iteration 3============ [2020-10-19 19:10:05,306 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 15 states and 20 transitions. [2020-10-19 19:10:05,309 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 1 [2020-10-19 19:10:05,309 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-10-19 19:10:05,310 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-10-19 19:10:05,310 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1] [2020-10-19 19:10:05,310 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1] [2020-10-19 19:10:05,311 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~mem10.base, append_#t~mem10.offset;havoc append_#t~mem9.base, append_#t~mem9.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-19 19:10:05,311 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~mem22.base, main_#t~mem22.offset;havoc main_#t~mem21.base, main_#t~mem21.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-19 19:10:05,311 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-19 19:10:05,312 INFO L82 PathProgramCache]: Analyzing trace with hash 149888852, now seen corresponding path program 1 times [2020-10-19 19:10:05,312 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-19 19:10:05,312 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [599792738] [2020-10-19 19:10:05,312 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-19 19:10:05,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-19 19:10:05,367 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-19 19:10:05,367 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [599792738] [2020-10-19 19:10:05,367 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-19 19:10:05,367 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-19 19:10:05,368 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [379599600] [2020-10-19 19:10:05,368 INFO L799 eck$LassoCheckResult]: stem already infeasible [2020-10-19 19:10:05,368 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-19 19:10:05,368 INFO L82 PathProgramCache]: Analyzing trace with hash 69, now seen corresponding path program 1 times [2020-10-19 19:10:05,368 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-19 19:10:05,369 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [858645723] [2020-10-19 19:10:05,369 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-19 19:10:05,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-19 19:10:05,375 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-19 19:10:05,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-19 19:10:05,381 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-19 19:10:05,387 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-19 19:10:05,518 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-19 19:10:05,518 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-19 19:10:05,519 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-10-19 19:10:05,519 INFO L87 Difference]: Start difference. First operand 15 states and 20 transitions. cyclomatic complexity: 7 Second operand 4 states. [2020-10-19 19:10:05,540 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-19 19:10:05,540 INFO L93 Difference]: Finished difference Result 17 states and 21 transitions. [2020-10-19 19:10:05,541 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-10-19 19:10:05,542 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 17 states and 21 transitions. [2020-10-19 19:10:05,543 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 1 [2020-10-19 19:10:05,544 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 17 states to 17 states and 21 transitions. [2020-10-19 19:10:05,544 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 11 [2020-10-19 19:10:05,544 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 11 [2020-10-19 19:10:05,545 INFO L73 IsDeterministic]: Start isDeterministic. Operand 17 states and 21 transitions. [2020-10-19 19:10:05,545 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-10-19 19:10:05,545 INFO L691 BuchiCegarLoop]: Abstraction has 17 states and 21 transitions. [2020-10-19 19:10:05,546 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states and 21 transitions. [2020-10-19 19:10:05,547 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 15. [2020-10-19 19:10:05,548 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2020-10-19 19:10:05,548 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 19 transitions. [2020-10-19 19:10:05,549 INFO L714 BuchiCegarLoop]: Abstraction has 15 states and 19 transitions. [2020-10-19 19:10:05,549 INFO L594 BuchiCegarLoop]: Abstraction has 15 states and 19 transitions. [2020-10-19 19:10:05,549 INFO L427 BuchiCegarLoop]: ======== Iteration 4============ [2020-10-19 19:10:05,550 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 15 states and 19 transitions. [2020-10-19 19:10:05,551 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 1 [2020-10-19 19:10:05,551 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-10-19 19:10:05,551 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-10-19 19:10:05,552 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1] [2020-10-19 19:10:05,552 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1] [2020-10-19 19:10:05,553 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~mem10.base, append_#t~mem10.offset;havoc append_#t~mem9.base, append_#t~mem9.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~mem17.base, main_#t~mem17.offset;havoc main_#t~mem18.base, main_#t~mem18.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-19 19:10:05,553 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~mem22.base, main_#t~mem22.offset;havoc main_#t~mem21.base, main_#t~mem21.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-19 19:10:05,553 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-19 19:10:05,554 INFO L82 PathProgramCache]: Analyzing trace with hash 149888850, now seen corresponding path program 1 times [2020-10-19 19:10:05,554 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-19 19:10:05,554 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [427641159] [2020-10-19 19:10:05,554 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-19 19:10:05,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-19 19:10:05,590 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-19 19:10:05,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-19 19:10:05,610 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-19 19:10:05,616 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-19 19:10:05,617 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-19 19:10:05,617 INFO L82 PathProgramCache]: Analyzing trace with hash 69, now seen corresponding path program 2 times [2020-10-19 19:10:05,617 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-19 19:10:05,618 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [637643918] [2020-10-19 19:10:05,618 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-19 19:10:05,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-19 19:10:05,622 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-19 19:10:05,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-19 19:10:05,625 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-19 19:10:05,627 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-19 19:10:05,628 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-19 19:10:05,628 INFO L82 PathProgramCache]: Analyzing trace with hash 351587092, now seen corresponding path program 1 times [2020-10-19 19:10:05,628 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-19 19:10:05,628 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1331928035] [2020-10-19 19:10:05,629 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-19 19:10:05,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-19 19:10:05,663 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-19 19:10:05,664 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1331928035] [2020-10-19 19:10:05,664 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-19 19:10:05,664 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-10-19 19:10:05,665 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2107454111] [2020-10-19 19:10:05,813 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-19 19:10:05,813 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-10-19 19:10:05,813 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2020-10-19 19:10:05,814 INFO L87 Difference]: Start difference. First operand 15 states and 19 transitions. cyclomatic complexity: 6 Second operand 5 states. [2020-10-19 19:10:05,836 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-19 19:10:05,836 INFO L93 Difference]: Finished difference Result 27 states and 33 transitions. [2020-10-19 19:10:05,837 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-10-19 19:10:05,837 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 27 states and 33 transitions. [2020-10-19 19:10:05,839 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 1 [2020-10-19 19:10:05,839 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 27 states to 23 states and 29 transitions. [2020-10-19 19:10:05,840 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 12 [2020-10-19 19:10:05,840 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 12 [2020-10-19 19:10:05,840 INFO L73 IsDeterministic]: Start isDeterministic. Operand 23 states and 29 transitions. [2020-10-19 19:10:05,840 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-10-19 19:10:05,840 INFO L691 BuchiCegarLoop]: Abstraction has 23 states and 29 transitions. [2020-10-19 19:10:05,840 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states and 29 transitions. [2020-10-19 19:10:05,842 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 15. [2020-10-19 19:10:05,842 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2020-10-19 19:10:05,843 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 18 transitions. [2020-10-19 19:10:05,843 INFO L714 BuchiCegarLoop]: Abstraction has 15 states and 18 transitions. [2020-10-19 19:10:05,843 INFO L594 BuchiCegarLoop]: Abstraction has 15 states and 18 transitions. [2020-10-19 19:10:05,844 INFO L427 BuchiCegarLoop]: ======== Iteration 5============ [2020-10-19 19:10:05,844 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 15 states and 18 transitions. [2020-10-19 19:10:05,845 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 1 [2020-10-19 19:10:05,845 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-10-19 19:10:05,845 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-10-19 19:10:05,846 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 2, 2, 1, 1, 1, 1, 1] [2020-10-19 19:10:05,846 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1] [2020-10-19 19:10:05,846 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~mem10.base, append_#t~mem10.offset;havoc append_#t~mem9.base, append_#t~mem9.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~mem10.base, append_#t~mem10.offset;havoc append_#t~mem9.base, append_#t~mem9.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~mem17.base, main_#t~mem17.offset;havoc main_#t~mem18.base, main_#t~mem18.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-19 19:10:05,847 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~mem22.base, main_#t~mem22.offset;havoc main_#t~mem21.base, main_#t~mem21.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-19 19:10:05,847 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-19 19:10:05,847 INFO L82 PathProgramCache]: Analyzing trace with hash -315524230, now seen corresponding path program 1 times [2020-10-19 19:10:05,847 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-19 19:10:05,848 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1714902834] [2020-10-19 19:10:05,848 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-19 19:10:05,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-19 19:10:05,896 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-19 19:10:05,896 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1714902834] [2020-10-19 19:10:05,897 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1124258691] [2020-10-19 19:10:05,897 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-19 19:10:05,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-19 19:10:05,977 INFO L263 TraceCheckSpWp]: Trace formula consists of 203 conjuncts, 24 conjunts are in the unsatisfiable core [2020-10-19 19:10:05,979 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-19 19:10:06,061 INFO L350 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-10-19 19:10:06,062 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-19 19:10:06,062 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-10-19 19:10:06,107 INFO L625 ElimStorePlain]: treesize reduction 20, result has 66.7 percent of original size [2020-10-19 19:10:06,117 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-19 19:10:06,118 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:45, output treesize:18 [2020-10-19 19:10:06,182 INFO L173 IndexEqualityManager]: detected equality via solver [2020-10-19 19:10:06,184 INFO L350 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-10-19 19:10:06,185 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-19 19:10:06,186 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-10-19 19:10:06,194 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-19 19:10:06,198 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-19 19:10:06,198 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:28, output treesize:4 [2020-10-19 19:10:06,200 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-19 19:10:06,200 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-10-19 19:10:06,200 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 6] total 8 [2020-10-19 19:10:06,200 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [423579307] [2020-10-19 19:10:06,201 INFO L799 eck$LassoCheckResult]: stem already infeasible [2020-10-19 19:10:06,201 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-19 19:10:06,202 INFO L82 PathProgramCache]: Analyzing trace with hash 69, now seen corresponding path program 3 times [2020-10-19 19:10:06,202 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-19 19:10:06,202 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1091955760] [2020-10-19 19:10:06,202 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-19 19:10:06,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-19 19:10:06,207 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-19 19:10:06,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-19 19:10:06,209 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-19 19:10:06,211 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-19 19:10:06,346 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-19 19:10:06,347 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-10-19 19:10:06,347 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2020-10-19 19:10:06,347 INFO L87 Difference]: Start difference. First operand 15 states and 18 transitions. cyclomatic complexity: 5 Second operand 8 states. [2020-10-19 19:10:06,453 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-19 19:10:06,453 INFO L93 Difference]: Finished difference Result 15 states and 16 transitions. [2020-10-19 19:10:06,453 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-10-19 19:10:06,454 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 15 states and 16 transitions. [2020-10-19 19:10:06,454 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 1 [2020-10-19 19:10:06,455 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 15 states to 15 states and 16 transitions. [2020-10-19 19:10:06,455 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 10 [2020-10-19 19:10:06,455 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 10 [2020-10-19 19:10:06,455 INFO L73 IsDeterministic]: Start isDeterministic. Operand 15 states and 16 transitions. [2020-10-19 19:10:06,456 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-10-19 19:10:06,456 INFO L691 BuchiCegarLoop]: Abstraction has 15 states and 16 transitions. [2020-10-19 19:10:06,456 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states and 16 transitions. [2020-10-19 19:10:06,457 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 15. [2020-10-19 19:10:06,457 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2020-10-19 19:10:06,457 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 16 transitions. [2020-10-19 19:10:06,458 INFO L714 BuchiCegarLoop]: Abstraction has 15 states and 16 transitions. [2020-10-19 19:10:06,458 INFO L594 BuchiCegarLoop]: Abstraction has 15 states and 16 transitions. [2020-10-19 19:10:06,458 INFO L427 BuchiCegarLoop]: ======== Iteration 6============ [2020-10-19 19:10:06,458 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 15 states and 16 transitions. [2020-10-19 19:10:06,459 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 1 [2020-10-19 19:10:06,459 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-10-19 19:10:06,459 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-10-19 19:10:06,460 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2020-10-19 19:10:06,460 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1] [2020-10-19 19:10:06,460 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~mem10.base, append_#t~mem10.offset;havoc append_#t~mem9.base, append_#t~mem9.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~mem10.base, append_#t~mem10.offset;havoc append_#t~mem9.base, append_#t~mem9.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~mem17.base, main_#t~mem17.offset;havoc main_#t~mem18.base, main_#t~mem18.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-19 19:10:06,461 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~mem22.base, main_#t~mem22.offset;havoc main_#t~mem21.base, main_#t~mem21.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-19 19:10:06,461 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-19 19:10:06,461 INFO L82 PathProgramCache]: Analyzing trace with hash -317371272, now seen corresponding path program 1 times [2020-10-19 19:10:06,461 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-19 19:10:06,462 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1423025126] [2020-10-19 19:10:06,462 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-19 19:10:06,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-19 19:10:06,495 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-19 19:10:06,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-19 19:10:06,528 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-19 19:10:06,535 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-19 19:10:06,536 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-19 19:10:06,536 INFO L82 PathProgramCache]: Analyzing trace with hash 69, now seen corresponding path program 4 times [2020-10-19 19:10:06,536 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-19 19:10:06,536 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1289278709] [2020-10-19 19:10:06,537 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-19 19:10:06,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-19 19:10:06,541 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-19 19:10:06,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-19 19:10:06,544 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-19 19:10:06,546 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-19 19:10:06,546 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-19 19:10:06,546 INFO L82 PathProgramCache]: Analyzing trace with hash -1248574802, now seen corresponding path program 1 times [2020-10-19 19:10:06,547 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-19 19:10:06,547 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [140439573] [2020-10-19 19:10:06,547 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-19 19:10:06,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-19 19:10:06,590 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-19 19:10:06,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-19 19:10:06,635 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-19 19:10:06,643 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-19 19:10:37,502 WARN L193 SmtUtils]: Spent 30.71 s on a formula simplification. DAG size of input: 400 DAG size of output: 324 [2020-10-19 19:10:37,877 INFO L545 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-10-19 19:10:44,250 WARN L193 SmtUtils]: Spent 6.37 s on a formula simplification that was a NOOP. DAG size: 227 [2020-10-19 19:10:44,251 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-19 19:10:44,321 INFO L545 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-10-19 19:10:49,057 WARN L193 SmtUtils]: Spent 4.74 s on a formula simplification that was a NOOP. DAG size: 223 [2020-10-19 19:10:49,058 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-19 19:10:49,092 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-19 19:10:53,880 WARN L193 SmtUtils]: Spent 4.79 s on a formula simplification that was a NOOP. DAG size: 220 [2020-10-19 19:10:53,881 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-19 19:10:53,911 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-19 19:10:57,878 WARN L193 SmtUtils]: Spent 3.97 s on a formula simplification that was a NOOP. DAG size: 217 [2020-10-19 19:10:57,879 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-19 19:10:57,909 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-19 19:11:01,254 WARN L193 SmtUtils]: Spent 3.34 s on a formula simplification that was a NOOP. DAG size: 213 [2020-10-19 19:11:01,255 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-19 19:11:01,280 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-19 19:11:04,640 WARN L193 SmtUtils]: Spent 3.36 s on a formula simplification that was a NOOP. DAG size: 210 [2020-10-19 19:11:04,641 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-19 19:11:04,683 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-19 19:11:04,683 INFO L244 ElimStorePlain]: Needed 7 recursive calls to eliminate 11 variables, input treesize:12084, output treesize:12326 [2020-10-19 19:11:08,353 WARN L193 SmtUtils]: Spent 3.63 s on a formula simplification that was a NOOP. DAG size: 210 [2020-10-19 19:11:08,357 INFO L210 LassoAnalysis]: Preferences: [2020-10-19 19:11:08,358 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2020-10-19 19:11:08,358 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-10-19 19:11:08,358 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2020-10-19 19:11:08,358 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2020-10-19 19:11:08,358 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-19 19:11:08,358 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2020-10-19 19:11:08,358 INFO L132 ssoRankerPreferences]: Path of dumped script: [2020-10-19 19:11:08,358 INFO L133 ssoRankerPreferences]: Filename of dumped script: test-0232_1-2.i_Iteration6_Lasso [2020-10-19 19:11:08,358 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2020-10-19 19:11:08,358 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2020-10-19 19:11:08,364 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-19 19:11:08,368 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-19 19:11:08,371 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-19 19:11:08,373 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-19 19:11:08,376 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-19 19:11:08,379 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-19 19:11:08,384 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-19 19:11:08,387 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-19 19:11:08,389 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-19 19:11:08,392 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-19 19:11:08,394 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-19 19:11:08,397 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-19 19:11:08,399 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-19 19:11:08,402 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-19 19:11:08,405 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-19 19:11:08,409 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-19 19:11:08,412 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-19 19:11:08,414 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-19 19:11:08,417 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-19 19:11:08,419 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-19 19:11:08,422 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-19 19:11:08,424 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-19 19:11:08,437 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-19 19:11:08,441 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-19 19:11:08,443 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-19 19:11:09,955 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-19 19:11:09,960 INFO L168 Benchmark]: Toolchain (without parser) took 93372.57 ms. Allocated memory was 1.0 GB in the beginning and 1.6 GB in the end (delta: 577.2 MB). Free memory was 958.6 MB in the beginning and 1.5 GB in the end (delta: -499.3 MB). Peak memory consumption was 646.6 MB. Max. memory is 11.5 GB. [2020-10-19 19:11:09,961 INFO L168 Benchmark]: CDTParser took 0.27 ms. Allocated memory is still 1.0 GB. Free memory is still 985.5 MB. There was no memory consumed. Max. memory is 11.5 GB. [2020-10-19 19:11:09,962 INFO L168 Benchmark]: CACSL2BoogieTranslator took 597.10 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 144.2 MB). Free memory was 953.2 MB in the beginning and 1.1 GB in the end (delta: -165.9 MB). Peak memory consumption was 16.5 MB. Max. memory is 11.5 GB. [2020-10-19 19:11:09,962 INFO L168 Benchmark]: Boogie Procedure Inliner took 47.47 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2020-10-19 19:11:09,963 INFO L168 Benchmark]: Boogie Preprocessor took 28.47 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2020-10-19 19:11:09,963 INFO L168 Benchmark]: RCFGBuilder took 457.63 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 24.0 MB). Peak memory consumption was 24.0 MB. Max. memory is 11.5 GB. [2020-10-19 19:11:09,964 INFO L168 Benchmark]: BuchiAutomizer took 92230.86 ms. Allocated memory was 1.2 GB in the beginning and 1.6 GB in the end (delta: 433.1 MB). Free memory was 1.1 GB in the beginning and 1.5 GB in the end (delta: -362.8 MB). Peak memory consumption was 638.9 MB. Max. memory is 11.5 GB. [2020-10-19 19:11:09,967 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.27 ms. Allocated memory is still 1.0 GB. Free memory is still 985.5 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 597.10 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 144.2 MB). Free memory was 953.2 MB in the beginning and 1.1 GB in the end (delta: -165.9 MB). Peak memory consumption was 16.5 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 47.47 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 28.47 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 457.63 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 24.0 MB). Peak memory consumption was 24.0 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 92230.86 ms. Allocated memory was 1.2 GB in the beginning and 1.6 GB in the end (delta: 433.1 MB). Free memory was 1.1 GB in the beginning and 1.5 GB in the end (delta: -362.8 MB). Peak memory consumption was 638.9 MB. Max. memory is 11.5 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...