./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/termination.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/array-memsafety/openbsd_cstrstr-alloca-2.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 61a67961 Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerTermination.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/array-memsafety/openbsd_cstrstr-alloca-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 --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 991fb09b573d5827d0db553f1ea89a581f5a664ba8b68d6f14a043df738f2f6d --- Real Ultimate output --- This is Ultimate 0.2.5-wip.fs.cvc5-61a6796-m [2024-10-15 00:22:13,961 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-15 00:22:14,032 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-32bit-Automizer_Default.epf [2024-10-15 00:22:14,037 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-15 00:22:14,038 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-15 00:22:14,072 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-15 00:22:14,075 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-15 00:22:14,076 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-15 00:22:14,078 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-15 00:22:14,078 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-15 00:22:14,079 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-15 00:22:14,079 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-15 00:22:14,080 INFO L153 SettingsManager]: * Use SBE=true [2024-10-15 00:22:14,080 INFO L151 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2024-10-15 00:22:14,080 INFO L153 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2024-10-15 00:22:14,081 INFO L153 SettingsManager]: * Use old map elimination=false [2024-10-15 00:22:14,081 INFO L153 SettingsManager]: * Use external solver (rank synthesis)=false [2024-10-15 00:22:14,085 INFO L153 SettingsManager]: * Use only trivial implications for array writes=true [2024-10-15 00:22:14,085 INFO L153 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2024-10-15 00:22:14,086 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-15 00:22:14,086 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2024-10-15 00:22:14,090 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-15 00:22:14,091 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-15 00:22:14,091 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-15 00:22:14,091 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-15 00:22:14,091 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2024-10-15 00:22:14,092 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2024-10-15 00:22:14,092 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2024-10-15 00:22:14,092 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-15 00:22:14,093 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-10-15 00:22:14,093 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-15 00:22:14,093 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-15 00:22:14,095 INFO L153 SettingsManager]: * Assume nondeterminstic values are in range=false [2024-10-15 00:22:14,096 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-15 00:22:14,096 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-15 00:22:14,096 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-15 00:22:14,096 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-15 00:22:14,097 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-15 00:22:14,097 INFO L151 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2024-10-15 00:22:14,098 INFO L153 SettingsManager]: * TransformationType=MODULO_NEIGHBOR WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release 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 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 -> 991fb09b573d5827d0db553f1ea89a581f5a664ba8b68d6f14a043df738f2f6d [2024-10-15 00:22:14,380 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-15 00:22:14,413 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-15 00:22:14,417 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-15 00:22:14,419 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-15 00:22:14,419 INFO L274 PluginConnector]: CDTParser initialized [2024-10-15 00:22:14,421 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/array-memsafety/openbsd_cstrstr-alloca-2.i [2024-10-15 00:22:16,013 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-15 00:22:16,244 INFO L384 CDTParser]: Found 1 translation units. [2024-10-15 00:22:16,248 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/array-memsafety/openbsd_cstrstr-alloca-2.i [2024-10-15 00:22:16,268 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/746b9478c/353fef9b656c4e8bbc61dc2e7f804330/FLAGdca3c90b2 [2024-10-15 00:22:16,284 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/746b9478c/353fef9b656c4e8bbc61dc2e7f804330 [2024-10-15 00:22:16,287 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-15 00:22:16,289 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-15 00:22:16,290 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-15 00:22:16,291 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-15 00:22:16,297 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-15 00:22:16,298 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.10 12:22:16" (1/1) ... [2024-10-15 00:22:16,299 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7adad34e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 12:22:16, skipping insertion in model container [2024-10-15 00:22:16,299 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.10 12:22:16" (1/1) ... [2024-10-15 00:22:16,345 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-15 00:22:16,734 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-15 00:22:16,748 INFO L200 MainTranslator]: Completed pre-run [2024-10-15 00:22:16,815 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-15 00:22:16,852 INFO L204 MainTranslator]: Completed translation [2024-10-15 00:22:16,852 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 12:22:16 WrapperNode [2024-10-15 00:22:16,853 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-15 00:22:16,854 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-15 00:22:16,854 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-15 00:22:16,854 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-15 00:22:16,861 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 12:22:16" (1/1) ... [2024-10-15 00:22:16,881 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 12:22:16" (1/1) ... [2024-10-15 00:22:16,911 INFO L138 Inliner]: procedures = 119, calls = 23, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 162 [2024-10-15 00:22:16,912 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-15 00:22:16,913 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-15 00:22:16,913 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-15 00:22:16,913 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-15 00:22:16,925 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 12:22:16" (1/1) ... [2024-10-15 00:22:16,925 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 12:22:16" (1/1) ... [2024-10-15 00:22:16,928 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 12:22:16" (1/1) ... [2024-10-15 00:22:16,963 INFO L175 MemorySlicer]: Split 12 memory accesses to 2 slices as follows [6, 6]. 50 percent of accesses are in the largest equivalence class. The 0 initializations are split as follows [0, 0]. The 4 writes are split as follows [2, 2]. [2024-10-15 00:22:16,965 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 12:22:16" (1/1) ... [2024-10-15 00:22:16,965 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 12:22:16" (1/1) ... [2024-10-15 00:22:16,975 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 12:22:16" (1/1) ... [2024-10-15 00:22:16,979 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 12:22:16" (1/1) ... [2024-10-15 00:22:16,984 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 12:22:16" (1/1) ... [2024-10-15 00:22:16,986 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 12:22:16" (1/1) ... [2024-10-15 00:22:16,992 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-15 00:22:16,997 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-15 00:22:16,997 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-15 00:22:16,997 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-15 00:22:16,999 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 12:22:16" (1/1) ... [2024-10-15 00:22:17,005 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-15 00:22:17,020 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-15 00:22:17,035 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-15 00:22:17,038 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Waiting until timeout for monitored process [2024-10-15 00:22:17,086 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-10-15 00:22:17,086 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-10-15 00:22:17,086 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-10-15 00:22:17,086 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-10-15 00:22:17,086 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-10-15 00:22:17,087 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-10-15 00:22:17,087 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-15 00:22:17,087 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-15 00:22:17,209 INFO L238 CfgBuilder]: Building ICFG [2024-10-15 00:22:17,212 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-15 00:22:17,477 INFO L? ?]: Removed 52 outVars from TransFormulas that were not future-live. [2024-10-15 00:22:17,478 INFO L287 CfgBuilder]: Performing block encoding [2024-10-15 00:22:17,492 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-15 00:22:17,493 INFO L314 CfgBuilder]: Removed 6 assume(true) statements. [2024-10-15 00:22:17,493 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.10 12:22:17 BoogieIcfgContainer [2024-10-15 00:22:17,494 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-15 00:22:17,495 INFO L112 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2024-10-15 00:22:17,495 INFO L270 PluginConnector]: Initializing BuchiAutomizer... [2024-10-15 00:22:17,499 INFO L274 PluginConnector]: BuchiAutomizer initialized [2024-10-15 00:22:17,500 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2024-10-15 00:22:17,500 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 15.10 12:22:16" (1/3) ... [2024-10-15 00:22:17,501 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@f7044e0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 15.10 12:22:17, skipping insertion in model container [2024-10-15 00:22:17,501 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2024-10-15 00:22:17,502 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 12:22:16" (2/3) ... [2024-10-15 00:22:17,503 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@f7044e0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 15.10 12:22:17, skipping insertion in model container [2024-10-15 00:22:17,503 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2024-10-15 00:22:17,504 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.10 12:22:17" (3/3) ... [2024-10-15 00:22:17,506 INFO L332 chiAutomizerObserver]: Analyzing ICFG openbsd_cstrstr-alloca-2.i [2024-10-15 00:22:17,565 INFO L300 stractBuchiCegarLoop]: Interprodecural is true [2024-10-15 00:22:17,566 INFO L301 stractBuchiCegarLoop]: Hoare is None [2024-10-15 00:22:17,566 INFO L302 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2024-10-15 00:22:17,566 INFO L303 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2024-10-15 00:22:17,566 INFO L304 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2024-10-15 00:22:17,566 INFO L305 stractBuchiCegarLoop]: Difference is false [2024-10-15 00:22:17,567 INFO L306 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2024-10-15 00:22:17,567 INFO L310 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiAutomatonCegarLoop ======== [2024-10-15 00:22:17,573 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 37 states, 36 states have (on average 1.5277777777777777) internal successors, (55), 36 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-15 00:22:17,592 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 21 [2024-10-15 00:22:17,592 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-10-15 00:22:17,592 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-10-15 00:22:17,597 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2024-10-15 00:22:17,598 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2024-10-15 00:22:17,598 INFO L332 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2024-10-15 00:22:17,598 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 37 states, 36 states have (on average 1.5277777777777777) internal successors, (55), 36 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-15 00:22:17,602 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 21 [2024-10-15 00:22:17,603 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-10-15 00:22:17,603 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-10-15 00:22:17,604 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2024-10-15 00:22:17,604 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2024-10-15 00:22:17,613 INFO L745 eck$LassoCheckResult]: Stem: 33#$Ultimate##0true assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 10#L-1true assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet20#1, main_#t~nondet21#1, main_#t~malloc22#1.base, main_#t~malloc22#1.offset, main_#t~malloc23#1.base, main_#t~malloc23#1.offset, main_#t~nondet24#1, main_#t~post25#1, main_~i~0#1, main_#t~nondet26#1, main_#t~post27#1, main_~i~1#1, main_#t~ret28#1.base, main_#t~ret28#1.offset, main_~length1~0#1, main_~length2~0#1, main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset, main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset;havoc main_#t~nondet20#1;main_~length1~0#1 := main_#t~nondet20#1;havoc main_#t~nondet20#1;havoc main_#t~nondet21#1;main_~length2~0#1 := main_#t~nondet21#1;havoc main_#t~nondet21#1; 30#L555true assume !(main_~length1~0#1 < 1); 28#L555-2true assume !(main_~length2~0#1 < 1); 7#L558-1true call main_#t~malloc22#1.base, main_#t~malloc22#1.offset := #Ultimate.allocOnStack(main_~length1~0#1 % 4294967296);main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset := main_#t~malloc22#1.base, main_#t~malloc22#1.offset;call main_#t~malloc23#1.base, main_#t~malloc23#1.offset := #Ultimate.allocOnStack(main_~length2~0#1 % 4294967296);main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset := main_#t~malloc23#1.base, main_#t~malloc23#1.offset;main_~i~0#1 := 0; 36#L564-3true [2024-10-15 00:22:17,614 INFO L747 eck$LassoCheckResult]: Loop: 36#L564-3true assume !!(main_~i~0#1 < main_~length1~0#1);havoc main_#t~nondet24#1;call write~int#1(main_#t~nondet24#1, main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset + main_~i~0#1, 1);havoc main_#t~nondet24#1; 23#L564-2true main_#t~post25#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post25#1;havoc main_#t~post25#1; 36#L564-3true [2024-10-15 00:22:17,624 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 00:22:17,625 INFO L85 PathProgramCache]: Analyzing trace with hash 28695878, now seen corresponding path program 1 times [2024-10-15 00:22:17,634 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-15 00:22:17,634 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1857991748] [2024-10-15 00:22:17,635 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-15 00:22:17,635 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-15 00:22:17,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-15 00:22:17,778 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-15 00:22:17,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-15 00:22:17,823 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-15 00:22:17,826 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 00:22:17,828 INFO L85 PathProgramCache]: Analyzing trace with hash 1699, now seen corresponding path program 1 times [2024-10-15 00:22:17,829 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-15 00:22:17,829 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [505435456] [2024-10-15 00:22:17,829 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-15 00:22:17,829 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-15 00:22:17,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-15 00:22:17,842 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-15 00:22:17,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-15 00:22:17,851 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-15 00:22:17,853 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 00:22:17,853 INFO L85 PathProgramCache]: Analyzing trace with hash 1806935720, now seen corresponding path program 1 times [2024-10-15 00:22:17,854 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-15 00:22:17,854 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2059605890] [2024-10-15 00:22:17,855 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-15 00:22:17,855 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-15 00:22:17,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-15 00:22:17,892 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-15 00:22:17,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-15 00:22:17,922 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-15 00:22:18,384 INFO L204 LassoAnalysis]: Preferences: [2024-10-15 00:22:18,385 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2024-10-15 00:22:18,385 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-10-15 00:22:18,385 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2024-10-15 00:22:18,386 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2024-10-15 00:22:18,386 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-15 00:22:18,386 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2024-10-15 00:22:18,386 INFO L131 ssoRankerPreferences]: Path of dumped script: [2024-10-15 00:22:18,386 INFO L132 ssoRankerPreferences]: Filename of dumped script: openbsd_cstrstr-alloca-2.i_Iteration1_Lasso [2024-10-15 00:22:18,386 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2024-10-15 00:22:18,387 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2024-10-15 00:22:18,411 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-15 00:22:18,424 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-15 00:22:18,657 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-15 00:22:18,660 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-15 00:22:18,663 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-15 00:22:18,666 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-15 00:22:18,670 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-15 00:22:18,674 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-15 00:22:18,677 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-15 00:22:18,680 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-15 00:22:18,683 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-15 00:22:18,687 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-15 00:22:18,690 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-15 00:22:18,694 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-15 00:22:18,697 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-15 00:22:18,699 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-15 00:22:18,703 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-15 00:22:19,038 INFO L259 LassoAnalysis]: Preprocessing complete. [2024-10-15 00:22:19,043 INFO L451 LassoAnalysis]: Using template 'affine'. [2024-10-15 00:22:19,045 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-15 00:22:19,045 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-15 00:22:19,047 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-15 00:22:19,049 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Waiting until timeout for monitored process [2024-10-15 00:22:19,051 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-10-15 00:22:19,066 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-15 00:22:19,067 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-15 00:22:19,067 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-15 00:22:19,067 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-15 00:22:19,067 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-15 00:22:19,070 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-15 00:22:19,070 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-15 00:22:19,073 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-15 00:22:19,090 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Forceful destruction successful, exit code 0 [2024-10-15 00:22:19,090 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-15 00:22:19,091 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-15 00:22:19,094 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-15 00:22:19,096 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Waiting until timeout for monitored process [2024-10-15 00:22:19,097 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-10-15 00:22:19,109 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-15 00:22:19,109 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-15 00:22:19,109 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-15 00:22:19,110 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-15 00:22:19,110 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-15 00:22:19,111 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-15 00:22:19,111 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-15 00:22:19,116 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-15 00:22:19,134 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Ended with exit code 0 [2024-10-15 00:22:19,135 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-15 00:22:19,135 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-15 00:22:19,137 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-15 00:22:19,138 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Waiting until timeout for monitored process [2024-10-15 00:22:19,140 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-10-15 00:22:19,154 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-15 00:22:19,154 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-15 00:22:19,154 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-15 00:22:19,155 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-15 00:22:19,162 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-10-15 00:22:19,163 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-10-15 00:22:19,170 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-15 00:22:19,188 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Forceful destruction successful, exit code 0 [2024-10-15 00:22:19,189 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-15 00:22:19,189 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-15 00:22:19,191 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-15 00:22:19,192 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Waiting until timeout for monitored process [2024-10-15 00:22:19,194 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-10-15 00:22:19,208 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-15 00:22:19,208 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-15 00:22:19,208 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-15 00:22:19,209 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-15 00:22:19,215 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-10-15 00:22:19,215 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-10-15 00:22:19,223 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-15 00:22:19,240 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Ended with exit code 0 [2024-10-15 00:22:19,240 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-15 00:22:19,241 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-15 00:22:19,242 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-15 00:22:19,245 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Waiting until timeout for monitored process [2024-10-15 00:22:19,246 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-10-15 00:22:19,260 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-15 00:22:19,261 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-15 00:22:19,261 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-15 00:22:19,261 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-15 00:22:19,266 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-10-15 00:22:19,266 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-10-15 00:22:19,273 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-15 00:22:19,291 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Forceful destruction successful, exit code 0 [2024-10-15 00:22:19,292 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-15 00:22:19,292 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-15 00:22:19,294 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-15 00:22:19,296 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Waiting until timeout for monitored process [2024-10-15 00:22:19,297 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-10-15 00:22:19,311 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-15 00:22:19,312 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-15 00:22:19,312 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-15 00:22:19,312 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-15 00:22:19,315 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-10-15 00:22:19,315 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-10-15 00:22:19,319 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-15 00:22:19,335 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Forceful destruction successful, exit code 0 [2024-10-15 00:22:19,336 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-15 00:22:19,336 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-15 00:22:19,338 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-15 00:22:19,340 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Waiting until timeout for monitored process [2024-10-15 00:22:19,341 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-10-15 00:22:19,356 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-15 00:22:19,357 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-15 00:22:19,358 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-15 00:22:19,358 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-15 00:22:19,366 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-10-15 00:22:19,366 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-10-15 00:22:19,377 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2024-10-15 00:22:19,403 INFO L443 ModelExtractionUtils]: Simplification made 8 calls to the SMT solver. [2024-10-15 00:22:19,403 INFO L444 ModelExtractionUtils]: 2 out of 19 variables were initially zero. Simplification set additionally 14 variables to zero. [2024-10-15 00:22:19,405 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-15 00:22:19,405 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-15 00:22:19,434 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-15 00:22:19,437 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Waiting until timeout for monitored process [2024-10-15 00:22:19,438 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2024-10-15 00:22:19,453 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2024-10-15 00:22:19,453 INFO L474 LassoAnalysis]: Proved termination. [2024-10-15 00:22:19,454 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~i~0#1, ULTIMATE.start_main_~length1~0#1) = -1*ULTIMATE.start_main_~i~0#1 + 1*ULTIMATE.start_main_~length1~0#1 Supporting invariants [] [2024-10-15 00:22:19,471 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Ended with exit code 0 [2024-10-15 00:22:19,491 INFO L156 tatePredicateManager]: 6 out of 6 supporting invariants were superfluous and have been removed [2024-10-15 00:22:19,562 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 00:22:19,579 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Forceful destruction successful, exit code 0 [2024-10-15 00:22:19,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 00:22:19,591 INFO L255 TraceCheckSpWp]: Trace formula consists of 40 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-15 00:22:19,593 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-15 00:22:19,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 00:22:19,619 INFO L255 TraceCheckSpWp]: Trace formula consists of 13 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-10-15 00:22:19,620 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-15 00:22:19,636 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-15 00:22:19,671 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2024-10-15 00:22:19,673 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand has 37 states, 36 states have (on average 1.5277777777777777) internal successors, (55), 36 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-15 00:22:19,737 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand has 37 states, 36 states have (on average 1.5277777777777777) internal successors, (55), 36 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0). Second operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 69 states and 104 transitions. Complement of second has 6 states. [2024-10-15 00:22:19,741 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2024-10-15 00:22:19,748 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-15 00:22:19,749 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 54 transitions. [2024-10-15 00:22:19,751 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 54 transitions. Stem has 5 letters. Loop has 2 letters. [2024-10-15 00:22:19,752 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-10-15 00:22:19,752 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 54 transitions. Stem has 7 letters. Loop has 2 letters. [2024-10-15 00:22:19,753 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-10-15 00:22:19,753 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 54 transitions. Stem has 5 letters. Loop has 4 letters. [2024-10-15 00:22:19,753 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-10-15 00:22:19,754 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 69 states and 104 transitions. [2024-10-15 00:22:19,758 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 19 [2024-10-15 00:22:19,763 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 69 states to 32 states and 47 transitions. [2024-10-15 00:22:19,764 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 29 [2024-10-15 00:22:19,766 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 30 [2024-10-15 00:22:19,767 INFO L73 IsDeterministic]: Start isDeterministic. Operand 32 states and 47 transitions. [2024-10-15 00:22:19,768 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2024-10-15 00:22:19,768 INFO L218 hiAutomatonCegarLoop]: Abstraction has 32 states and 47 transitions. [2024-10-15 00:22:19,787 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states and 47 transitions. [2024-10-15 00:22:19,796 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 32. [2024-10-15 00:22:19,799 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 32 states have (on average 1.46875) internal successors, (47), 31 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-15 00:22:19,801 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 47 transitions. [2024-10-15 00:22:19,804 INFO L240 hiAutomatonCegarLoop]: Abstraction has 32 states and 47 transitions. [2024-10-15 00:22:19,805 INFO L425 stractBuchiCegarLoop]: Abstraction has 32 states and 47 transitions. [2024-10-15 00:22:19,805 INFO L332 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2024-10-15 00:22:19,805 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 32 states and 47 transitions. [2024-10-15 00:22:19,806 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 19 [2024-10-15 00:22:19,806 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-10-15 00:22:19,807 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-10-15 00:22:19,807 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2024-10-15 00:22:19,809 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2024-10-15 00:22:19,809 INFO L745 eck$LassoCheckResult]: Stem: 206#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 189#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet20#1, main_#t~nondet21#1, main_#t~malloc22#1.base, main_#t~malloc22#1.offset, main_#t~malloc23#1.base, main_#t~malloc23#1.offset, main_#t~nondet24#1, main_#t~post25#1, main_~i~0#1, main_#t~nondet26#1, main_#t~post27#1, main_~i~1#1, main_#t~ret28#1.base, main_#t~ret28#1.offset, main_~length1~0#1, main_~length2~0#1, main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset, main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset;havoc main_#t~nondet20#1;main_~length1~0#1 := main_#t~nondet20#1;havoc main_#t~nondet20#1;havoc main_#t~nondet21#1;main_~length2~0#1 := main_#t~nondet21#1;havoc main_#t~nondet21#1; 190#L555 assume !(main_~length1~0#1 < 1); 204#L555-2 assume !(main_~length2~0#1 < 1); 184#L558-1 call main_#t~malloc22#1.base, main_#t~malloc22#1.offset := #Ultimate.allocOnStack(main_~length1~0#1 % 4294967296);main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset := main_#t~malloc22#1.base, main_#t~malloc22#1.offset;call main_#t~malloc23#1.base, main_#t~malloc23#1.offset := #Ultimate.allocOnStack(main_~length2~0#1 % 4294967296);main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset := main_#t~malloc23#1.base, main_#t~malloc23#1.offset;main_~i~0#1 := 0; 185#L564-3 assume !(main_~i~0#1 < main_~length1~0#1); 203#L564-4 havoc main_~i~0#1;main_~i~1#1 := 0; 196#L568-3 [2024-10-15 00:22:19,810 INFO L747 eck$LassoCheckResult]: Loop: 196#L568-3 assume !!(main_~i~1#1 < main_~length2~0#1);havoc main_#t~nondet26#1;call write~int#0(main_#t~nondet26#1, main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset + main_~i~1#1, 1);havoc main_#t~nondet26#1; 198#L568-2 main_#t~post27#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post27#1;havoc main_#t~post27#1; 196#L568-3 [2024-10-15 00:22:19,810 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 00:22:19,810 INFO L85 PathProgramCache]: Analyzing trace with hash 1806935662, now seen corresponding path program 1 times [2024-10-15 00:22:19,811 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-15 00:22:19,811 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [644097354] [2024-10-15 00:22:19,811 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-15 00:22:19,811 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-15 00:22:19,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 00:22:19,952 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-15 00:22:19,952 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-15 00:22:19,953 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [644097354] [2024-10-15 00:22:19,954 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [644097354] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-15 00:22:19,954 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-15 00:22:19,954 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-15 00:22:19,955 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [664212977] [2024-10-15 00:22:19,956 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-15 00:22:19,958 INFO L750 eck$LassoCheckResult]: stem already infeasible [2024-10-15 00:22:19,958 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 00:22:19,958 INFO L85 PathProgramCache]: Analyzing trace with hash 2147, now seen corresponding path program 1 times [2024-10-15 00:22:19,959 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-15 00:22:19,959 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [469427148] [2024-10-15 00:22:19,959 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-15 00:22:19,960 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-15 00:22:19,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-15 00:22:19,974 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-15 00:22:19,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-15 00:22:19,985 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-15 00:22:20,053 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-15 00:22:20,055 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-15 00:22:20,056 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-15 00:22:20,058 INFO L87 Difference]: Start difference. First operand 32 states and 47 transitions. cyclomatic complexity: 19 Second operand has 4 states, 4 states have (on average 1.75) internal successors, (7), 4 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-15 00:22:20,084 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-15 00:22:20,085 INFO L93 Difference]: Finished difference Result 33 states and 43 transitions. [2024-10-15 00:22:20,085 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 33 states and 43 transitions. [2024-10-15 00:22:20,086 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 19 [2024-10-15 00:22:20,087 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 33 states to 33 states and 43 transitions. [2024-10-15 00:22:20,087 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 30 [2024-10-15 00:22:20,088 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 30 [2024-10-15 00:22:20,088 INFO L73 IsDeterministic]: Start isDeterministic. Operand 33 states and 43 transitions. [2024-10-15 00:22:20,088 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2024-10-15 00:22:20,088 INFO L218 hiAutomatonCegarLoop]: Abstraction has 33 states and 43 transitions. [2024-10-15 00:22:20,089 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states and 43 transitions. [2024-10-15 00:22:20,091 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 32. [2024-10-15 00:22:20,091 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 32 states have (on average 1.3125) internal successors, (42), 31 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-15 00:22:20,092 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 42 transitions. [2024-10-15 00:22:20,092 INFO L240 hiAutomatonCegarLoop]: Abstraction has 32 states and 42 transitions. [2024-10-15 00:22:20,094 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-15 00:22:20,095 INFO L425 stractBuchiCegarLoop]: Abstraction has 32 states and 42 transitions. [2024-10-15 00:22:20,095 INFO L332 stractBuchiCegarLoop]: ======== Iteration 3 ============ [2024-10-15 00:22:20,095 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 32 states and 42 transitions. [2024-10-15 00:22:20,096 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 19 [2024-10-15 00:22:20,096 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-10-15 00:22:20,096 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-10-15 00:22:20,097 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-15 00:22:20,097 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2024-10-15 00:22:20,097 INFO L745 eck$LassoCheckResult]: Stem: 277#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 260#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet20#1, main_#t~nondet21#1, main_#t~malloc22#1.base, main_#t~malloc22#1.offset, main_#t~malloc23#1.base, main_#t~malloc23#1.offset, main_#t~nondet24#1, main_#t~post25#1, main_~i~0#1, main_#t~nondet26#1, main_#t~post27#1, main_~i~1#1, main_#t~ret28#1.base, main_#t~ret28#1.offset, main_~length1~0#1, main_~length2~0#1, main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset, main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset;havoc main_#t~nondet20#1;main_~length1~0#1 := main_#t~nondet20#1;havoc main_#t~nondet20#1;havoc main_#t~nondet21#1;main_~length2~0#1 := main_#t~nondet21#1;havoc main_#t~nondet21#1; 261#L555 assume !(main_~length1~0#1 < 1); 276#L555-2 assume !(main_~length2~0#1 < 1); 255#L558-1 call main_#t~malloc22#1.base, main_#t~malloc22#1.offset := #Ultimate.allocOnStack(main_~length1~0#1 % 4294967296);main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset := main_#t~malloc22#1.base, main_#t~malloc22#1.offset;call main_#t~malloc23#1.base, main_#t~malloc23#1.offset := #Ultimate.allocOnStack(main_~length2~0#1 % 4294967296);main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset := main_#t~malloc23#1.base, main_#t~malloc23#1.offset;main_~i~0#1 := 0; 256#L564-3 assume !!(main_~i~0#1 < main_~length1~0#1);havoc main_#t~nondet24#1;call write~int#1(main_#t~nondet24#1, main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset + main_~i~0#1, 1);havoc main_#t~nondet24#1; 272#L564-2 main_#t~post25#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post25#1;havoc main_#t~post25#1; 273#L564-3 assume !(main_~i~0#1 < main_~length1~0#1); 275#L564-4 havoc main_~i~0#1;main_~i~1#1 := 0; 267#L568-3 [2024-10-15 00:22:20,100 INFO L747 eck$LassoCheckResult]: Loop: 267#L568-3 assume !!(main_~i~1#1 < main_~length2~0#1);havoc main_#t~nondet26#1;call write~int#0(main_#t~nondet26#1, main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset + main_~i~1#1, 1);havoc main_#t~nondet26#1; 269#L568-2 main_#t~post27#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post27#1;havoc main_#t~post27#1; 267#L568-3 [2024-10-15 00:22:20,100 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 00:22:20,101 INFO L85 PathProgramCache]: Analyzing trace with hash 1298440016, now seen corresponding path program 1 times [2024-10-15 00:22:20,101 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-15 00:22:20,101 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [157853210] [2024-10-15 00:22:20,101 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-15 00:22:20,102 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-15 00:22:20,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-15 00:22:20,139 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-15 00:22:20,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-15 00:22:20,165 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-15 00:22:20,169 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 00:22:20,169 INFO L85 PathProgramCache]: Analyzing trace with hash 2147, now seen corresponding path program 2 times [2024-10-15 00:22:20,170 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-15 00:22:20,170 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [127480404] [2024-10-15 00:22:20,170 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-15 00:22:20,170 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-15 00:22:20,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-15 00:22:20,181 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-15 00:22:20,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-15 00:22:20,188 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-15 00:22:20,188 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 00:22:20,188 INFO L85 PathProgramCache]: Analyzing trace with hash -2034626574, now seen corresponding path program 1 times [2024-10-15 00:22:20,189 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-15 00:22:20,189 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [682545550] [2024-10-15 00:22:20,189 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-15 00:22:20,190 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-15 00:22:20,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-15 00:22:20,218 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-15 00:22:20,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-15 00:22:20,234 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-15 00:22:20,616 INFO L204 LassoAnalysis]: Preferences: [2024-10-15 00:22:20,616 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2024-10-15 00:22:20,616 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-10-15 00:22:20,616 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2024-10-15 00:22:20,616 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2024-10-15 00:22:20,616 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-15 00:22:20,616 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2024-10-15 00:22:20,617 INFO L131 ssoRankerPreferences]: Path of dumped script: [2024-10-15 00:22:20,617 INFO L132 ssoRankerPreferences]: Filename of dumped script: openbsd_cstrstr-alloca-2.i_Iteration3_Lasso [2024-10-15 00:22:20,617 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2024-10-15 00:22:20,617 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2024-10-15 00:22:20,620 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-15 00:22:20,625 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-15 00:22:20,628 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-15 00:22:20,630 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-15 00:22:20,846 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-15 00:22:20,849 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-15 00:22:20,851 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-15 00:22:20,855 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-15 00:22:20,859 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-15 00:22:20,862 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-15 00:22:20,865 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-15 00:22:20,868 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-15 00:22:20,870 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-15 00:22:20,873 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-15 00:22:20,875 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-15 00:22:20,878 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-15 00:22:20,884 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-15 00:22:21,204 INFO L259 LassoAnalysis]: Preprocessing complete. [2024-10-15 00:22:21,204 INFO L451 LassoAnalysis]: Using template 'affine'. [2024-10-15 00:22:21,204 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-15 00:22:21,205 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-15 00:22:21,210 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-15 00:22:21,212 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Waiting until timeout for monitored process [2024-10-15 00:22:21,213 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-10-15 00:22:21,226 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-15 00:22:21,226 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-15 00:22:21,227 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-15 00:22:21,227 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-15 00:22:21,227 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-15 00:22:21,227 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-15 00:22:21,228 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-15 00:22:21,229 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-15 00:22:21,245 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Forceful destruction successful, exit code 0 [2024-10-15 00:22:21,245 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-15 00:22:21,246 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-15 00:22:21,248 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-15 00:22:21,250 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (11)] Waiting until timeout for monitored process [2024-10-15 00:22:21,252 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-10-15 00:22:21,264 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-15 00:22:21,265 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-15 00:22:21,265 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-15 00:22:21,265 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-15 00:22:21,265 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-15 00:22:21,266 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-15 00:22:21,266 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-15 00:22:21,270 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-15 00:22:21,285 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (11)] Forceful destruction successful, exit code 0 [2024-10-15 00:22:21,285 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-15 00:22:21,286 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-15 00:22:21,288 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-15 00:22:21,289 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (12)] Waiting until timeout for monitored process [2024-10-15 00:22:21,290 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-10-15 00:22:21,301 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-15 00:22:21,301 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-15 00:22:21,302 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-15 00:22:21,302 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-15 00:22:21,302 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-15 00:22:21,302 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-15 00:22:21,302 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-15 00:22:21,304 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-15 00:22:21,314 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (12)] Forceful destruction successful, exit code 0 [2024-10-15 00:22:21,315 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-15 00:22:21,315 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-15 00:22:21,317 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-15 00:22:21,319 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (13)] Waiting until timeout for monitored process [2024-10-15 00:22:21,320 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-10-15 00:22:21,330 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-15 00:22:21,330 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-15 00:22:21,330 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-15 00:22:21,330 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-15 00:22:21,333 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-10-15 00:22:21,333 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-10-15 00:22:21,339 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-15 00:22:21,355 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (13)] Ended with exit code 0 [2024-10-15 00:22:21,355 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-15 00:22:21,355 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-15 00:22:21,357 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-15 00:22:21,359 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (14)] Waiting until timeout for monitored process [2024-10-15 00:22:21,360 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-10-15 00:22:21,373 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-15 00:22:21,373 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-15 00:22:21,373 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-15 00:22:21,373 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-15 00:22:21,376 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-10-15 00:22:21,376 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-10-15 00:22:21,382 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-15 00:22:21,400 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (14)] Ended with exit code 0 [2024-10-15 00:22:21,400 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-15 00:22:21,401 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-15 00:22:21,402 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-15 00:22:21,404 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (15)] Waiting until timeout for monitored process [2024-10-15 00:22:21,404 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-10-15 00:22:21,417 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-15 00:22:21,417 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-15 00:22:21,417 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-15 00:22:21,417 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-15 00:22:21,423 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-10-15 00:22:21,423 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-10-15 00:22:21,433 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2024-10-15 00:22:21,469 INFO L443 ModelExtractionUtils]: Simplification made 14 calls to the SMT solver. [2024-10-15 00:22:21,469 INFO L444 ModelExtractionUtils]: 1 out of 19 variables were initially zero. Simplification set additionally 15 variables to zero. [2024-10-15 00:22:21,470 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-15 00:22:21,470 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-15 00:22:21,472 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-15 00:22:21,474 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (16)] Waiting until timeout for monitored process [2024-10-15 00:22:21,475 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2024-10-15 00:22:21,491 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2024-10-15 00:22:21,491 INFO L474 LassoAnalysis]: Proved termination. [2024-10-15 00:22:21,492 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~i~1#1, ULTIMATE.start_main_~length2~0#1) = -1*ULTIMATE.start_main_~i~1#1 + 1*ULTIMATE.start_main_~length2~0#1 Supporting invariants [] [2024-10-15 00:22:21,508 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (15)] Ended with exit code 0 [2024-10-15 00:22:21,536 INFO L156 tatePredicateManager]: 9 out of 9 supporting invariants were superfluous and have been removed [2024-10-15 00:22:21,548 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 00:22:21,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 00:22:21,567 INFO L255 TraceCheckSpWp]: Trace formula consists of 54 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-15 00:22:21,568 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-15 00:22:21,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 00:22:21,593 INFO L255 TraceCheckSpWp]: Trace formula consists of 13 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-10-15 00:22:21,593 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-15 00:22:21,606 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-15 00:22:21,607 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2024-10-15 00:22:21,607 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 32 states and 42 transitions. cyclomatic complexity: 14 Second operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-15 00:22:21,624 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 32 states and 42 transitions. cyclomatic complexity: 14. Second operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 34 states and 46 transitions. Complement of second has 5 states. [2024-10-15 00:22:21,624 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2024-10-15 00:22:21,625 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-15 00:22:21,625 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 13 transitions. [2024-10-15 00:22:21,625 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 13 transitions. Stem has 9 letters. Loop has 2 letters. [2024-10-15 00:22:21,625 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-10-15 00:22:21,625 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 13 transitions. Stem has 11 letters. Loop has 2 letters. [2024-10-15 00:22:21,625 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-10-15 00:22:21,626 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 13 transitions. Stem has 9 letters. Loop has 4 letters. [2024-10-15 00:22:21,626 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-10-15 00:22:21,626 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 34 states and 46 transitions. [2024-10-15 00:22:21,627 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 17 [2024-10-15 00:22:21,627 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 34 states to 33 states and 44 transitions. [2024-10-15 00:22:21,627 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 28 [2024-10-15 00:22:21,627 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 29 [2024-10-15 00:22:21,627 INFO L73 IsDeterministic]: Start isDeterministic. Operand 33 states and 44 transitions. [2024-10-15 00:22:21,628 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2024-10-15 00:22:21,628 INFO L218 hiAutomatonCegarLoop]: Abstraction has 33 states and 44 transitions. [2024-10-15 00:22:21,628 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states and 44 transitions. [2024-10-15 00:22:21,629 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 33. [2024-10-15 00:22:21,629 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33 states, 33 states have (on average 1.3333333333333333) internal successors, (44), 32 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-15 00:22:21,630 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 44 transitions. [2024-10-15 00:22:21,630 INFO L240 hiAutomatonCegarLoop]: Abstraction has 33 states and 44 transitions. [2024-10-15 00:22:21,630 INFO L425 stractBuchiCegarLoop]: Abstraction has 33 states and 44 transitions. [2024-10-15 00:22:21,630 INFO L332 stractBuchiCegarLoop]: ======== Iteration 4 ============ [2024-10-15 00:22:21,630 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 33 states and 44 transitions. [2024-10-15 00:22:21,631 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 17 [2024-10-15 00:22:21,631 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-10-15 00:22:21,631 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-10-15 00:22:21,631 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-15 00:22:21,631 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2024-10-15 00:22:21,632 INFO L745 eck$LassoCheckResult]: Stem: 434#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 416#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet20#1, main_#t~nondet21#1, main_#t~malloc22#1.base, main_#t~malloc22#1.offset, main_#t~malloc23#1.base, main_#t~malloc23#1.offset, main_#t~nondet24#1, main_#t~post25#1, main_~i~0#1, main_#t~nondet26#1, main_#t~post27#1, main_~i~1#1, main_#t~ret28#1.base, main_#t~ret28#1.offset, main_~length1~0#1, main_~length2~0#1, main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset, main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset;havoc main_#t~nondet20#1;main_~length1~0#1 := main_#t~nondet20#1;havoc main_#t~nondet20#1;havoc main_#t~nondet21#1;main_~length2~0#1 := main_#t~nondet21#1;havoc main_#t~nondet21#1; 417#L555 assume !(main_~length1~0#1 < 1); 432#L555-2 assume !(main_~length2~0#1 < 1); 411#L558-1 call main_#t~malloc22#1.base, main_#t~malloc22#1.offset := #Ultimate.allocOnStack(main_~length1~0#1 % 4294967296);main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset := main_#t~malloc22#1.base, main_#t~malloc22#1.offset;call main_#t~malloc23#1.base, main_#t~malloc23#1.offset := #Ultimate.allocOnStack(main_~length2~0#1 % 4294967296);main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset := main_#t~malloc23#1.base, main_#t~malloc23#1.offset;main_~i~0#1 := 0; 412#L564-3 assume !!(main_~i~0#1 < main_~length1~0#1);havoc main_#t~nondet24#1;call write~int#1(main_#t~nondet24#1, main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset + main_~i~0#1, 1);havoc main_#t~nondet24#1; 428#L564-2 main_#t~post25#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post25#1;havoc main_#t~post25#1; 429#L564-3 assume !(main_~i~0#1 < main_~length1~0#1); 431#L564-4 havoc main_~i~0#1;main_~i~1#1 := 0; 423#L568-3 assume !(main_~i~1#1 < main_~length2~0#1); 424#L568-4 havoc main_~i~1#1;call write~int#1(0, main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset + (main_~length1~0#1 - 1), 1);call write~int#0(0, main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset + (main_~length2~0#1 - 1), 1);assume { :begin_inline_cstrstr } true;cstrstr_#in~s#1.base, cstrstr_#in~s#1.offset, cstrstr_#in~find#1.base, cstrstr_#in~find#1.offset := main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset, main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset;havoc cstrstr_#res#1.base, cstrstr_#res#1.offset;havoc cstrstr_#t~post13#1.base, cstrstr_#t~post13#1.offset, cstrstr_#t~mem14#1, cstrstr_#t~ret15#1, cstrstr_#t~post16#1.base, cstrstr_#t~post16#1.offset, cstrstr_#t~mem17#1, cstrstr_#t~ret18#1, cstrstr_#t~post19#1.base, cstrstr_#t~post19#1.offset, cstrstr_~s#1.base, cstrstr_~s#1.offset, cstrstr_~find#1.base, cstrstr_~find#1.offset, cstrstr_~c~0#1, cstrstr_~sc~0#1, cstrstr_~len~0#1;cstrstr_~s#1.base, cstrstr_~s#1.offset := cstrstr_#in~s#1.base, cstrstr_#in~s#1.offset;cstrstr_~find#1.base, cstrstr_~find#1.offset := cstrstr_#in~find#1.base, cstrstr_#in~find#1.offset;havoc cstrstr_~c~0#1;havoc cstrstr_~sc~0#1;havoc cstrstr_~len~0#1;cstrstr_#t~post13#1.base, cstrstr_#t~post13#1.offset := cstrstr_~find#1.base, cstrstr_~find#1.offset;cstrstr_~find#1.base, cstrstr_~find#1.offset := cstrstr_#t~post13#1.base, 1 + cstrstr_#t~post13#1.offset;call cstrstr_#t~mem14#1 := read~int#0(cstrstr_#t~post13#1.base, cstrstr_#t~post13#1.offset, 1);cstrstr_~c~0#1 := cstrstr_#t~mem14#1; 430#L540 assume 0 != cstrstr_~c~0#1;havoc cstrstr_#t~post13#1.base, cstrstr_#t~post13#1.offset;havoc cstrstr_#t~mem14#1;assume { :begin_inline_cstrlen } true;cstrlen_#in~str#1.base, cstrlen_#in~str#1.offset := cstrstr_~find#1.base, cstrstr_~find#1.offset;havoc cstrlen_#res#1;havoc cstrlen_#t~mem2#1, cstrlen_#t~pre3#1.base, cstrlen_#t~pre3#1.offset, cstrlen_~str#1.base, cstrlen_~str#1.offset, cstrlen_~s~0#1.base, cstrlen_~s~0#1.offset;cstrlen_~str#1.base, cstrlen_~str#1.offset := cstrlen_#in~str#1.base, cstrlen_#in~str#1.offset;havoc cstrlen_~s~0#1.base, cstrlen_~s~0#1.offset;cstrlen_~s~0#1.base, cstrlen_~s~0#1.offset := cstrlen_~str#1.base, cstrlen_~str#1.offset; 420#L518-4 [2024-10-15 00:22:21,632 INFO L747 eck$LassoCheckResult]: Loop: 420#L518-4 call cstrlen_#t~mem2#1 := read~int#0(cstrlen_~s~0#1.base, cstrlen_~s~0#1.offset, 1); 421#L518-1 assume !!(0 != cstrlen_#t~mem2#1);havoc cstrlen_#t~mem2#1; 433#L518-3 cstrlen_#t~pre3#1.base, cstrlen_#t~pre3#1.offset := cstrlen_~s~0#1.base, 1 + cstrlen_~s~0#1.offset;cstrlen_~s~0#1.base, cstrlen_~s~0#1.offset := cstrlen_~s~0#1.base, 1 + cstrlen_~s~0#1.offset;havoc cstrlen_#t~pre3#1.base, cstrlen_#t~pre3#1.offset; 420#L518-4 [2024-10-15 00:22:21,632 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 00:22:21,633 INFO L85 PathProgramCache]: Analyzing trace with hash 1351083894, now seen corresponding path program 1 times [2024-10-15 00:22:21,633 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-15 00:22:21,633 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1380634488] [2024-10-15 00:22:21,633 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-15 00:22:21,633 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-15 00:22:21,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 00:22:21,743 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-10-15 00:22:21,743 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-15 00:22:21,743 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1380634488] [2024-10-15 00:22:21,744 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1380634488] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-15 00:22:21,744 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-15 00:22:21,744 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-15 00:22:21,744 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1073145337] [2024-10-15 00:22:21,744 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-15 00:22:21,744 INFO L750 eck$LassoCheckResult]: stem already infeasible [2024-10-15 00:22:21,745 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 00:22:21,745 INFO L85 PathProgramCache]: Analyzing trace with hash 79603, now seen corresponding path program 1 times [2024-10-15 00:22:21,745 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-15 00:22:21,745 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [276198042] [2024-10-15 00:22:21,745 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-15 00:22:21,746 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-15 00:22:21,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-15 00:22:21,750 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-15 00:22:21,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-15 00:22:21,753 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-15 00:22:21,794 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-15 00:22:21,795 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-15 00:22:21,795 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-15 00:22:21,795 INFO L87 Difference]: Start difference. First operand 33 states and 44 transitions. cyclomatic complexity: 15 Second operand has 4 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-15 00:22:21,814 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-15 00:22:21,814 INFO L93 Difference]: Finished difference Result 34 states and 44 transitions. [2024-10-15 00:22:21,815 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 34 states and 44 transitions. [2024-10-15 00:22:21,816 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 17 [2024-10-15 00:22:21,816 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 34 states to 34 states and 44 transitions. [2024-10-15 00:22:21,816 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 29 [2024-10-15 00:22:21,817 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 29 [2024-10-15 00:22:21,817 INFO L73 IsDeterministic]: Start isDeterministic. Operand 34 states and 44 transitions. [2024-10-15 00:22:21,817 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2024-10-15 00:22:21,817 INFO L218 hiAutomatonCegarLoop]: Abstraction has 34 states and 44 transitions. [2024-10-15 00:22:21,817 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states and 44 transitions. [2024-10-15 00:22:21,820 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 33. [2024-10-15 00:22:21,820 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33 states, 33 states have (on average 1.303030303030303) internal successors, (43), 32 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-15 00:22:21,821 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 43 transitions. [2024-10-15 00:22:21,822 INFO L240 hiAutomatonCegarLoop]: Abstraction has 33 states and 43 transitions. [2024-10-15 00:22:21,822 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-15 00:22:21,824 INFO L425 stractBuchiCegarLoop]: Abstraction has 33 states and 43 transitions. [2024-10-15 00:22:21,824 INFO L332 stractBuchiCegarLoop]: ======== Iteration 5 ============ [2024-10-15 00:22:21,824 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 33 states and 43 transitions. [2024-10-15 00:22:21,825 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 17 [2024-10-15 00:22:21,825 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-10-15 00:22:21,825 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-10-15 00:22:21,825 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-15 00:22:21,825 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2024-10-15 00:22:21,825 INFO L745 eck$LassoCheckResult]: Stem: 508#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 490#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet20#1, main_#t~nondet21#1, main_#t~malloc22#1.base, main_#t~malloc22#1.offset, main_#t~malloc23#1.base, main_#t~malloc23#1.offset, main_#t~nondet24#1, main_#t~post25#1, main_~i~0#1, main_#t~nondet26#1, main_#t~post27#1, main_~i~1#1, main_#t~ret28#1.base, main_#t~ret28#1.offset, main_~length1~0#1, main_~length2~0#1, main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset, main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset;havoc main_#t~nondet20#1;main_~length1~0#1 := main_#t~nondet20#1;havoc main_#t~nondet20#1;havoc main_#t~nondet21#1;main_~length2~0#1 := main_#t~nondet21#1;havoc main_#t~nondet21#1; 491#L555 assume !(main_~length1~0#1 < 1); 506#L555-2 assume !(main_~length2~0#1 < 1); 485#L558-1 call main_#t~malloc22#1.base, main_#t~malloc22#1.offset := #Ultimate.allocOnStack(main_~length1~0#1 % 4294967296);main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset := main_#t~malloc22#1.base, main_#t~malloc22#1.offset;call main_#t~malloc23#1.base, main_#t~malloc23#1.offset := #Ultimate.allocOnStack(main_~length2~0#1 % 4294967296);main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset := main_#t~malloc23#1.base, main_#t~malloc23#1.offset;main_~i~0#1 := 0; 486#L564-3 assume !!(main_~i~0#1 < main_~length1~0#1);havoc main_#t~nondet24#1;call write~int#1(main_#t~nondet24#1, main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset + main_~i~0#1, 1);havoc main_#t~nondet24#1; 502#L564-2 main_#t~post25#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post25#1;havoc main_#t~post25#1; 503#L564-3 assume !(main_~i~0#1 < main_~length1~0#1); 505#L564-4 havoc main_~i~0#1;main_~i~1#1 := 0; 496#L568-3 assume !!(main_~i~1#1 < main_~length2~0#1);havoc main_#t~nondet26#1;call write~int#0(main_#t~nondet26#1, main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset + main_~i~1#1, 1);havoc main_#t~nondet26#1; 497#L568-2 main_#t~post27#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post27#1;havoc main_#t~post27#1; 498#L568-3 assume !(main_~i~1#1 < main_~length2~0#1); 499#L568-4 havoc main_~i~1#1;call write~int#1(0, main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset + (main_~length1~0#1 - 1), 1);call write~int#0(0, main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset + (main_~length2~0#1 - 1), 1);assume { :begin_inline_cstrstr } true;cstrstr_#in~s#1.base, cstrstr_#in~s#1.offset, cstrstr_#in~find#1.base, cstrstr_#in~find#1.offset := main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset, main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset;havoc cstrstr_#res#1.base, cstrstr_#res#1.offset;havoc cstrstr_#t~post13#1.base, cstrstr_#t~post13#1.offset, cstrstr_#t~mem14#1, cstrstr_#t~ret15#1, cstrstr_#t~post16#1.base, cstrstr_#t~post16#1.offset, cstrstr_#t~mem17#1, cstrstr_#t~ret18#1, cstrstr_#t~post19#1.base, cstrstr_#t~post19#1.offset, cstrstr_~s#1.base, cstrstr_~s#1.offset, cstrstr_~find#1.base, cstrstr_~find#1.offset, cstrstr_~c~0#1, cstrstr_~sc~0#1, cstrstr_~len~0#1;cstrstr_~s#1.base, cstrstr_~s#1.offset := cstrstr_#in~s#1.base, cstrstr_#in~s#1.offset;cstrstr_~find#1.base, cstrstr_~find#1.offset := cstrstr_#in~find#1.base, cstrstr_#in~find#1.offset;havoc cstrstr_~c~0#1;havoc cstrstr_~sc~0#1;havoc cstrstr_~len~0#1;cstrstr_#t~post13#1.base, cstrstr_#t~post13#1.offset := cstrstr_~find#1.base, cstrstr_~find#1.offset;cstrstr_~find#1.base, cstrstr_~find#1.offset := cstrstr_#t~post13#1.base, 1 + cstrstr_#t~post13#1.offset;call cstrstr_#t~mem14#1 := read~int#0(cstrstr_#t~post13#1.base, cstrstr_#t~post13#1.offset, 1);cstrstr_~c~0#1 := cstrstr_#t~mem14#1; 504#L540 assume 0 != cstrstr_~c~0#1;havoc cstrstr_#t~post13#1.base, cstrstr_#t~post13#1.offset;havoc cstrstr_#t~mem14#1;assume { :begin_inline_cstrlen } true;cstrlen_#in~str#1.base, cstrlen_#in~str#1.offset := cstrstr_~find#1.base, cstrstr_~find#1.offset;havoc cstrlen_#res#1;havoc cstrlen_#t~mem2#1, cstrlen_#t~pre3#1.base, cstrlen_#t~pre3#1.offset, cstrlen_~str#1.base, cstrlen_~str#1.offset, cstrlen_~s~0#1.base, cstrlen_~s~0#1.offset;cstrlen_~str#1.base, cstrlen_~str#1.offset := cstrlen_#in~str#1.base, cstrlen_#in~str#1.offset;havoc cstrlen_~s~0#1.base, cstrlen_~s~0#1.offset;cstrlen_~s~0#1.base, cstrlen_~s~0#1.offset := cstrlen_~str#1.base, cstrlen_~str#1.offset; 494#L518-4 [2024-10-15 00:22:21,825 INFO L747 eck$LassoCheckResult]: Loop: 494#L518-4 call cstrlen_#t~mem2#1 := read~int#0(cstrlen_~s~0#1.base, cstrlen_~s~0#1.offset, 1); 495#L518-1 assume !!(0 != cstrlen_#t~mem2#1);havoc cstrlen_#t~mem2#1; 507#L518-3 cstrlen_#t~pre3#1.base, cstrlen_#t~pre3#1.offset := cstrlen_~s~0#1.base, 1 + cstrlen_~s~0#1.offset;cstrlen_~s~0#1.base, cstrlen_~s~0#1.offset := cstrlen_~s~0#1.base, 1 + cstrlen_~s~0#1.offset;havoc cstrlen_#t~pre3#1.base, cstrlen_#t~pre3#1.offset; 494#L518-4 [2024-10-15 00:22:21,826 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 00:22:21,826 INFO L85 PathProgramCache]: Analyzing trace with hash 1313217428, now seen corresponding path program 1 times [2024-10-15 00:22:21,826 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-15 00:22:21,826 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1691615259] [2024-10-15 00:22:21,826 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-15 00:22:21,826 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-15 00:22:21,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 00:22:22,188 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-10-15 00:22:22,189 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-15 00:22:22,189 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1691615259] [2024-10-15 00:22:22,189 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1691615259] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-15 00:22:22,189 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1821767274] [2024-10-15 00:22:22,189 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-15 00:22:22,189 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-15 00:22:22,189 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-15 00:22:22,195 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-15 00:22:22,196 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2024-10-15 00:22:22,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 00:22:22,276 INFO L255 TraceCheckSpWp]: Trace formula consists of 123 conjuncts, 22 conjuncts are in the unsatisfiable core [2024-10-15 00:22:22,280 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-15 00:22:22,347 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-10-15 00:22:22,347 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-15 00:22:22,377 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 11 [2024-10-15 00:22:22,384 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 12 [2024-10-15 00:22:22,432 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-10-15 00:22:22,432 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1821767274] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-15 00:22:22,432 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-15 00:22:22,433 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6, 6] total 13 [2024-10-15 00:22:22,433 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [836939400] [2024-10-15 00:22:22,433 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-15 00:22:22,433 INFO L750 eck$LassoCheckResult]: stem already infeasible [2024-10-15 00:22:22,434 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 00:22:22,434 INFO L85 PathProgramCache]: Analyzing trace with hash 79603, now seen corresponding path program 2 times [2024-10-15 00:22:22,434 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-15 00:22:22,434 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1422826072] [2024-10-15 00:22:22,434 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-15 00:22:22,434 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-15 00:22:22,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-15 00:22:22,439 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-15 00:22:22,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-15 00:22:22,442 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-15 00:22:22,485 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-15 00:22:22,486 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-10-15 00:22:22,486 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=130, Unknown=0, NotChecked=0, Total=182 [2024-10-15 00:22:22,486 INFO L87 Difference]: Start difference. First operand 33 states and 43 transitions. cyclomatic complexity: 14 Second operand has 14 states, 13 states have (on average 2.076923076923077) internal successors, (27), 14 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-15 00:22:22,565 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (16)] Forceful destruction successful, exit code 0 [2024-10-15 00:22:22,650 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-15 00:22:22,651 INFO L93 Difference]: Finished difference Result 46 states and 58 transitions. [2024-10-15 00:22:22,651 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 46 states and 58 transitions. [2024-10-15 00:22:22,656 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 17 [2024-10-15 00:22:22,656 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 46 states to 36 states and 45 transitions. [2024-10-15 00:22:22,656 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 29 [2024-10-15 00:22:22,657 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 29 [2024-10-15 00:22:22,657 INFO L73 IsDeterministic]: Start isDeterministic. Operand 36 states and 45 transitions. [2024-10-15 00:22:22,657 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2024-10-15 00:22:22,657 INFO L218 hiAutomatonCegarLoop]: Abstraction has 36 states and 45 transitions. [2024-10-15 00:22:22,657 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states and 45 transitions. [2024-10-15 00:22:22,658 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 35. [2024-10-15 00:22:22,659 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35 states, 35 states have (on average 1.2571428571428571) internal successors, (44), 34 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-15 00:22:22,659 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 44 transitions. [2024-10-15 00:22:22,659 INFO L240 hiAutomatonCegarLoop]: Abstraction has 35 states and 44 transitions. [2024-10-15 00:22:22,662 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-10-15 00:22:22,663 INFO L425 stractBuchiCegarLoop]: Abstraction has 35 states and 44 transitions. [2024-10-15 00:22:22,663 INFO L332 stractBuchiCegarLoop]: ======== Iteration 6 ============ [2024-10-15 00:22:22,663 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 35 states and 44 transitions. [2024-10-15 00:22:22,663 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 17 [2024-10-15 00:22:22,663 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-10-15 00:22:22,663 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-10-15 00:22:22,664 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-15 00:22:22,664 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2024-10-15 00:22:22,664 INFO L745 eck$LassoCheckResult]: Stem: 693#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 674#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet20#1, main_#t~nondet21#1, main_#t~malloc22#1.base, main_#t~malloc22#1.offset, main_#t~malloc23#1.base, main_#t~malloc23#1.offset, main_#t~nondet24#1, main_#t~post25#1, main_~i~0#1, main_#t~nondet26#1, main_#t~post27#1, main_~i~1#1, main_#t~ret28#1.base, main_#t~ret28#1.offset, main_~length1~0#1, main_~length2~0#1, main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset, main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset;havoc main_#t~nondet20#1;main_~length1~0#1 := main_#t~nondet20#1;havoc main_#t~nondet20#1;havoc main_#t~nondet21#1;main_~length2~0#1 := main_#t~nondet21#1;havoc main_#t~nondet21#1; 675#L555 assume !(main_~length1~0#1 < 1); 691#L555-2 assume !(main_~length2~0#1 < 1); 669#L558-1 call main_#t~malloc22#1.base, main_#t~malloc22#1.offset := #Ultimate.allocOnStack(main_~length1~0#1 % 4294967296);main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset := main_#t~malloc22#1.base, main_#t~malloc22#1.offset;call main_#t~malloc23#1.base, main_#t~malloc23#1.offset := #Ultimate.allocOnStack(main_~length2~0#1 % 4294967296);main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset := main_#t~malloc23#1.base, main_#t~malloc23#1.offset;main_~i~0#1 := 0; 670#L564-3 assume !!(main_~i~0#1 < main_~length1~0#1);havoc main_#t~nondet24#1;call write~int#1(main_#t~nondet24#1, main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset + main_~i~0#1, 1);havoc main_#t~nondet24#1; 686#L564-2 main_#t~post25#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post25#1;havoc main_#t~post25#1; 687#L564-3 assume !(main_~i~0#1 < main_~length1~0#1); 690#L564-4 havoc main_~i~0#1;main_~i~1#1 := 0; 681#L568-3 assume !!(main_~i~1#1 < main_~length2~0#1);havoc main_#t~nondet26#1;call write~int#0(main_#t~nondet26#1, main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset + main_~i~1#1, 1);havoc main_#t~nondet26#1; 682#L568-2 main_#t~post27#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post27#1;havoc main_#t~post27#1; 683#L568-3 assume !!(main_~i~1#1 < main_~length2~0#1);havoc main_#t~nondet26#1;call write~int#0(main_#t~nondet26#1, main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset + main_~i~1#1, 1);havoc main_#t~nondet26#1; 684#L568-2 main_#t~post27#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post27#1;havoc main_#t~post27#1; 694#L568-3 assume !(main_~i~1#1 < main_~length2~0#1); 688#L568-4 havoc main_~i~1#1;call write~int#1(0, main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset + (main_~length1~0#1 - 1), 1);call write~int#0(0, main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset + (main_~length2~0#1 - 1), 1);assume { :begin_inline_cstrstr } true;cstrstr_#in~s#1.base, cstrstr_#in~s#1.offset, cstrstr_#in~find#1.base, cstrstr_#in~find#1.offset := main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset, main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset;havoc cstrstr_#res#1.base, cstrstr_#res#1.offset;havoc cstrstr_#t~post13#1.base, cstrstr_#t~post13#1.offset, cstrstr_#t~mem14#1, cstrstr_#t~ret15#1, cstrstr_#t~post16#1.base, cstrstr_#t~post16#1.offset, cstrstr_#t~mem17#1, cstrstr_#t~ret18#1, cstrstr_#t~post19#1.base, cstrstr_#t~post19#1.offset, cstrstr_~s#1.base, cstrstr_~s#1.offset, cstrstr_~find#1.base, cstrstr_~find#1.offset, cstrstr_~c~0#1, cstrstr_~sc~0#1, cstrstr_~len~0#1;cstrstr_~s#1.base, cstrstr_~s#1.offset := cstrstr_#in~s#1.base, cstrstr_#in~s#1.offset;cstrstr_~find#1.base, cstrstr_~find#1.offset := cstrstr_#in~find#1.base, cstrstr_#in~find#1.offset;havoc cstrstr_~c~0#1;havoc cstrstr_~sc~0#1;havoc cstrstr_~len~0#1;cstrstr_#t~post13#1.base, cstrstr_#t~post13#1.offset := cstrstr_~find#1.base, cstrstr_~find#1.offset;cstrstr_~find#1.base, cstrstr_~find#1.offset := cstrstr_#t~post13#1.base, 1 + cstrstr_#t~post13#1.offset;call cstrstr_#t~mem14#1 := read~int#0(cstrstr_#t~post13#1.base, cstrstr_#t~post13#1.offset, 1);cstrstr_~c~0#1 := cstrstr_#t~mem14#1; 689#L540 assume 0 != cstrstr_~c~0#1;havoc cstrstr_#t~post13#1.base, cstrstr_#t~post13#1.offset;havoc cstrstr_#t~mem14#1;assume { :begin_inline_cstrlen } true;cstrlen_#in~str#1.base, cstrlen_#in~str#1.offset := cstrstr_~find#1.base, cstrstr_~find#1.offset;havoc cstrlen_#res#1;havoc cstrlen_#t~mem2#1, cstrlen_#t~pre3#1.base, cstrlen_#t~pre3#1.offset, cstrlen_~str#1.base, cstrlen_~str#1.offset, cstrlen_~s~0#1.base, cstrlen_~s~0#1.offset;cstrlen_~str#1.base, cstrlen_~str#1.offset := cstrlen_#in~str#1.base, cstrlen_#in~str#1.offset;havoc cstrlen_~s~0#1.base, cstrlen_~s~0#1.offset;cstrlen_~s~0#1.base, cstrlen_~s~0#1.offset := cstrlen_~str#1.base, cstrlen_~str#1.offset; 678#L518-4 [2024-10-15 00:22:22,664 INFO L747 eck$LassoCheckResult]: Loop: 678#L518-4 call cstrlen_#t~mem2#1 := read~int#0(cstrlen_~s~0#1.base, cstrlen_~s~0#1.offset, 1); 679#L518-1 assume !!(0 != cstrlen_#t~mem2#1);havoc cstrlen_#t~mem2#1; 692#L518-3 cstrlen_#t~pre3#1.base, cstrlen_#t~pre3#1.offset := cstrlen_~s~0#1.base, 1 + cstrlen_~s~0#1.offset;cstrlen_~s~0#1.base, cstrlen_~s~0#1.offset := cstrlen_~s~0#1.base, 1 + cstrlen_~s~0#1.offset;havoc cstrlen_#t~pre3#1.base, cstrlen_#t~pre3#1.offset; 678#L518-4 [2024-10-15 00:22:22,667 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 00:22:22,667 INFO L85 PathProgramCache]: Analyzing trace with hash -716718030, now seen corresponding path program 2 times [2024-10-15 00:22:22,667 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-15 00:22:22,667 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [702785807] [2024-10-15 00:22:22,667 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-15 00:22:22,668 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-15 00:22:22,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-15 00:22:22,695 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-15 00:22:22,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-15 00:22:22,715 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-15 00:22:22,716 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 00:22:22,716 INFO L85 PathProgramCache]: Analyzing trace with hash 79603, now seen corresponding path program 3 times [2024-10-15 00:22:22,716 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-15 00:22:22,716 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [128190131] [2024-10-15 00:22:22,716 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-15 00:22:22,716 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-15 00:22:22,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-15 00:22:22,720 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-15 00:22:22,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-15 00:22:22,726 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-15 00:22:22,726 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 00:22:22,726 INFO L85 PathProgramCache]: Analyzing trace with hash -1464353502, now seen corresponding path program 1 times [2024-10-15 00:22:22,727 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-15 00:22:22,727 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [853469139] [2024-10-15 00:22:22,727 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-15 00:22:22,727 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-15 00:22:22,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 00:22:23,203 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-10-15 00:22:23,203 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-15 00:22:23,203 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [853469139] [2024-10-15 00:22:23,204 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [853469139] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-15 00:22:23,204 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [659219538] [2024-10-15 00:22:23,204 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-15 00:22:23,204 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-15 00:22:23,204 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-15 00:22:23,206 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-15 00:22:23,211 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Waiting until timeout for monitored process [2024-10-15 00:22:23,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 00:22:23,293 INFO L255 TraceCheckSpWp]: Trace formula consists of 145 conjuncts, 38 conjuncts are in the unsatisfiable core [2024-10-15 00:22:23,296 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-15 00:22:23,370 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-10-15 00:22:23,419 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-10-15 00:22:23,419 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-15 00:22:23,434 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 13 [2024-10-15 00:22:23,437 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2024-10-15 00:22:23,492 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-10-15 00:22:23,493 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [659219538] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-15 00:22:23,493 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-15 00:22:23,493 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10, 10] total 21 [2024-10-15 00:22:23,493 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1453238432] [2024-10-15 00:22:23,493 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-15 00:22:23,569 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-15 00:22:23,570 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2024-10-15 00:22:23,570 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=353, Unknown=0, NotChecked=0, Total=420 [2024-10-15 00:22:23,570 INFO L87 Difference]: Start difference. First operand 35 states and 44 transitions. cyclomatic complexity: 13 Second operand has 21 states, 21 states have (on average 1.7142857142857142) internal successors, (36), 21 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-15 00:22:23,800 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-15 00:22:23,800 INFO L93 Difference]: Finished difference Result 58 states and 73 transitions. [2024-10-15 00:22:23,801 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 58 states and 73 transitions. [2024-10-15 00:22:23,801 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 31 [2024-10-15 00:22:23,802 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 58 states to 58 states and 73 transitions. [2024-10-15 00:22:23,802 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 49 [2024-10-15 00:22:23,802 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 49 [2024-10-15 00:22:23,802 INFO L73 IsDeterministic]: Start isDeterministic. Operand 58 states and 73 transitions. [2024-10-15 00:22:23,802 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2024-10-15 00:22:23,802 INFO L218 hiAutomatonCegarLoop]: Abstraction has 58 states and 73 transitions. [2024-10-15 00:22:23,802 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states and 73 transitions. [2024-10-15 00:22:23,804 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 41. [2024-10-15 00:22:23,804 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 41 states, 41 states have (on average 1.2439024390243902) internal successors, (51), 40 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-15 00:22:23,805 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 51 transitions. [2024-10-15 00:22:23,805 INFO L240 hiAutomatonCegarLoop]: Abstraction has 41 states and 51 transitions. [2024-10-15 00:22:23,805 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-10-15 00:22:23,806 INFO L425 stractBuchiCegarLoop]: Abstraction has 41 states and 51 transitions. [2024-10-15 00:22:23,806 INFO L332 stractBuchiCegarLoop]: ======== Iteration 7 ============ [2024-10-15 00:22:23,806 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 41 states and 51 transitions. [2024-10-15 00:22:23,807 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 17 [2024-10-15 00:22:23,807 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-10-15 00:22:23,807 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-10-15 00:22:23,807 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-15 00:22:23,807 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2024-10-15 00:22:23,808 INFO L745 eck$LassoCheckResult]: Stem: 933#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 914#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet20#1, main_#t~nondet21#1, main_#t~malloc22#1.base, main_#t~malloc22#1.offset, main_#t~malloc23#1.base, main_#t~malloc23#1.offset, main_#t~nondet24#1, main_#t~post25#1, main_~i~0#1, main_#t~nondet26#1, main_#t~post27#1, main_~i~1#1, main_#t~ret28#1.base, main_#t~ret28#1.offset, main_~length1~0#1, main_~length2~0#1, main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset, main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset;havoc main_#t~nondet20#1;main_~length1~0#1 := main_#t~nondet20#1;havoc main_#t~nondet20#1;havoc main_#t~nondet21#1;main_~length2~0#1 := main_#t~nondet21#1;havoc main_#t~nondet21#1; 915#L555 assume !(main_~length1~0#1 < 1); 932#L555-2 assume !(main_~length2~0#1 < 1); 909#L558-1 call main_#t~malloc22#1.base, main_#t~malloc22#1.offset := #Ultimate.allocOnStack(main_~length1~0#1 % 4294967296);main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset := main_#t~malloc22#1.base, main_#t~malloc22#1.offset;call main_#t~malloc23#1.base, main_#t~malloc23#1.offset := #Ultimate.allocOnStack(main_~length2~0#1 % 4294967296);main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset := main_#t~malloc23#1.base, main_#t~malloc23#1.offset;main_~i~0#1 := 0; 910#L564-3 assume !!(main_~i~0#1 < main_~length1~0#1);havoc main_#t~nondet24#1;call write~int#1(main_#t~nondet24#1, main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset + main_~i~0#1, 1);havoc main_#t~nondet24#1; 928#L564-2 main_#t~post25#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post25#1;havoc main_#t~post25#1; 929#L564-3 assume !(main_~i~0#1 < main_~length1~0#1); 931#L564-4 havoc main_~i~0#1;main_~i~1#1 := 0; 921#L568-3 assume !!(main_~i~1#1 < main_~length2~0#1);havoc main_#t~nondet26#1;call write~int#0(main_#t~nondet26#1, main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset + main_~i~1#1, 1);havoc main_#t~nondet26#1; 922#L568-2 main_#t~post27#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post27#1;havoc main_#t~post27#1; 941#L568-3 assume !!(main_~i~1#1 < main_~length2~0#1);havoc main_#t~nondet26#1;call write~int#0(main_#t~nondet26#1, main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset + main_~i~1#1, 1);havoc main_#t~nondet26#1; 940#L568-2 main_#t~post27#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post27#1;havoc main_#t~post27#1; 939#L568-3 assume !!(main_~i~1#1 < main_~length2~0#1);havoc main_#t~nondet26#1;call write~int#0(main_#t~nondet26#1, main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset + main_~i~1#1, 1);havoc main_#t~nondet26#1; 925#L568-2 main_#t~post27#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post27#1;havoc main_#t~post27#1; 923#L568-3 assume !(main_~i~1#1 < main_~length2~0#1); 924#L568-4 havoc main_~i~1#1;call write~int#1(0, main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset + (main_~length1~0#1 - 1), 1);call write~int#0(0, main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset + (main_~length2~0#1 - 1), 1);assume { :begin_inline_cstrstr } true;cstrstr_#in~s#1.base, cstrstr_#in~s#1.offset, cstrstr_#in~find#1.base, cstrstr_#in~find#1.offset := main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset, main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset;havoc cstrstr_#res#1.base, cstrstr_#res#1.offset;havoc cstrstr_#t~post13#1.base, cstrstr_#t~post13#1.offset, cstrstr_#t~mem14#1, cstrstr_#t~ret15#1, cstrstr_#t~post16#1.base, cstrstr_#t~post16#1.offset, cstrstr_#t~mem17#1, cstrstr_#t~ret18#1, cstrstr_#t~post19#1.base, cstrstr_#t~post19#1.offset, cstrstr_~s#1.base, cstrstr_~s#1.offset, cstrstr_~find#1.base, cstrstr_~find#1.offset, cstrstr_~c~0#1, cstrstr_~sc~0#1, cstrstr_~len~0#1;cstrstr_~s#1.base, cstrstr_~s#1.offset := cstrstr_#in~s#1.base, cstrstr_#in~s#1.offset;cstrstr_~find#1.base, cstrstr_~find#1.offset := cstrstr_#in~find#1.base, cstrstr_#in~find#1.offset;havoc cstrstr_~c~0#1;havoc cstrstr_~sc~0#1;havoc cstrstr_~len~0#1;cstrstr_#t~post13#1.base, cstrstr_#t~post13#1.offset := cstrstr_~find#1.base, cstrstr_~find#1.offset;cstrstr_~find#1.base, cstrstr_~find#1.offset := cstrstr_#t~post13#1.base, 1 + cstrstr_#t~post13#1.offset;call cstrstr_#t~mem14#1 := read~int#0(cstrstr_#t~post13#1.base, cstrstr_#t~post13#1.offset, 1);cstrstr_~c~0#1 := cstrstr_#t~mem14#1; 930#L540 assume 0 != cstrstr_~c~0#1;havoc cstrstr_#t~post13#1.base, cstrstr_#t~post13#1.offset;havoc cstrstr_#t~mem14#1;assume { :begin_inline_cstrlen } true;cstrlen_#in~str#1.base, cstrlen_#in~str#1.offset := cstrstr_~find#1.base, cstrstr_~find#1.offset;havoc cstrlen_#res#1;havoc cstrlen_#t~mem2#1, cstrlen_#t~pre3#1.base, cstrlen_#t~pre3#1.offset, cstrlen_~str#1.base, cstrlen_~str#1.offset, cstrlen_~s~0#1.base, cstrlen_~s~0#1.offset;cstrlen_~str#1.base, cstrlen_~str#1.offset := cstrlen_#in~str#1.base, cstrlen_#in~str#1.offset;havoc cstrlen_~s~0#1.base, cstrlen_~s~0#1.offset;cstrlen_~s~0#1.base, cstrlen_~s~0#1.offset := cstrlen_~str#1.base, cstrlen_~str#1.offset; 919#L518-4 [2024-10-15 00:22:23,808 INFO L747 eck$LassoCheckResult]: Loop: 919#L518-4 call cstrlen_#t~mem2#1 := read~int#0(cstrlen_~s~0#1.base, cstrlen_~s~0#1.offset, 1); 920#L518-1 assume !!(0 != cstrlen_#t~mem2#1);havoc cstrlen_#t~mem2#1; 934#L518-3 cstrlen_#t~pre3#1.base, cstrlen_#t~pre3#1.offset := cstrlen_~s~0#1.base, 1 + cstrlen_~s~0#1.offset;cstrlen_~s~0#1.base, cstrlen_~s~0#1.offset := cstrlen_~s~0#1.base, 1 + cstrlen_~s~0#1.offset;havoc cstrlen_#t~pre3#1.base, cstrlen_#t~pre3#1.offset; 919#L518-4 [2024-10-15 00:22:23,808 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 00:22:23,808 INFO L85 PathProgramCache]: Analyzing trace with hash -1569540784, now seen corresponding path program 3 times [2024-10-15 00:22:23,808 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-15 00:22:23,808 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1045892582] [2024-10-15 00:22:23,808 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-15 00:22:23,809 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-15 00:22:23,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-15 00:22:23,827 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-15 00:22:23,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-15 00:22:23,840 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-15 00:22:23,841 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 00:22:23,841 INFO L85 PathProgramCache]: Analyzing trace with hash 79603, now seen corresponding path program 4 times [2024-10-15 00:22:23,841 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-15 00:22:23,841 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [705086077] [2024-10-15 00:22:23,842 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-15 00:22:23,842 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-15 00:22:23,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-15 00:22:23,845 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-15 00:22:23,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-15 00:22:23,848 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-15 00:22:23,849 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 00:22:23,849 INFO L85 PathProgramCache]: Analyzing trace with hash 1119505220, now seen corresponding path program 2 times [2024-10-15 00:22:23,849 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-15 00:22:23,849 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2054497523] [2024-10-15 00:22:23,849 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-15 00:22:23,849 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-15 00:22:23,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-15 00:22:23,866 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-15 00:22:23,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-15 00:22:23,880 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-15 00:22:25,886 INFO L204 LassoAnalysis]: Preferences: [2024-10-15 00:22:25,887 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2024-10-15 00:22:25,887 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-10-15 00:22:25,887 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2024-10-15 00:22:25,887 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2024-10-15 00:22:25,887 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-15 00:22:25,887 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2024-10-15 00:22:25,887 INFO L131 ssoRankerPreferences]: Path of dumped script: [2024-10-15 00:22:25,887 INFO L132 ssoRankerPreferences]: Filename of dumped script: openbsd_cstrstr-alloca-2.i_Iteration7_Lasso [2024-10-15 00:22:25,888 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2024-10-15 00:22:25,888 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2024-10-15 00:22:25,891 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-15 00:22:25,893 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-15 00:22:25,896 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-15 00:22:25,898 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-15 00:22:25,901 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-15 00:22:25,903 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-15 00:22:25,905 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-15 00:22:25,908 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-15 00:22:25,910 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-15 00:22:25,913 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-15 00:22:25,915 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-15 00:22:25,918 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-15 00:22:25,920 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-15 00:22:25,922 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-15 00:22:25,924 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-15 00:22:26,224 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-15 00:22:26,226 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-15 00:22:26,228 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-15 00:22:26,231 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-15 00:22:26,233 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-15 00:22:26,235 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-15 00:22:26,237 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-15 00:22:26,239 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-15 00:22:26,242 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-15 00:22:26,244 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-15 00:22:26,246 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-15 00:22:26,248 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-15 00:22:26,250 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-15 00:22:26,252 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-15 00:22:26,254 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-15 00:22:26,257 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-15 00:22:26,259 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-15 00:22:26,261 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-15 00:22:26,263 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-15 00:22:26,265 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-15 00:22:26,267 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-15 00:22:26,269 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-15 00:22:26,271 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-15 00:22:26,273 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-15 00:22:26,275 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-15 00:22:26,277 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-15 00:22:26,616 INFO L259 LassoAnalysis]: Preprocessing complete. [2024-10-15 00:22:26,619 INFO L451 LassoAnalysis]: Using template 'affine'. [2024-10-15 00:22:26,620 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-15 00:22:26,620 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-15 00:22:26,622 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-15 00:22:26,624 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (19)] Waiting until timeout for monitored process [2024-10-15 00:22:26,626 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-10-15 00:22:26,639 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-15 00:22:26,640 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-15 00:22:26,640 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-15 00:22:26,640 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-15 00:22:26,640 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-15 00:22:26,641 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-15 00:22:26,641 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-15 00:22:26,642 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-15 00:22:26,659 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (19)] Forceful destruction successful, exit code 0 [2024-10-15 00:22:26,660 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-15 00:22:26,660 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-15 00:22:26,662 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-15 00:22:26,664 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (20)] Waiting until timeout for monitored process [2024-10-15 00:22:26,665 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-10-15 00:22:26,679 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-15 00:22:26,679 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-15 00:22:26,680 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-15 00:22:26,680 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-15 00:22:26,680 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-15 00:22:26,681 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-15 00:22:26,681 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-15 00:22:26,683 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-15 00:22:26,700 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (20)] Ended with exit code 0 [2024-10-15 00:22:26,700 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-15 00:22:26,700 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-15 00:22:26,702 INFO L229 MonitoredProcess]: Starting monitored process 21 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-15 00:22:26,704 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (21)] Waiting until timeout for monitored process [2024-10-15 00:22:26,706 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-10-15 00:22:26,718 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-15 00:22:26,719 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-15 00:22:26,719 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-15 00:22:26,719 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-15 00:22:26,719 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-15 00:22:26,720 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-15 00:22:26,720 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-15 00:22:26,724 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-15 00:22:26,740 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (21)] Ended with exit code 0 [2024-10-15 00:22:26,741 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-15 00:22:26,741 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-15 00:22:26,743 INFO L229 MonitoredProcess]: Starting monitored process 22 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-15 00:22:26,746 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (22)] Waiting until timeout for monitored process [2024-10-15 00:22:26,747 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-10-15 00:22:26,760 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-15 00:22:26,760 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-15 00:22:26,760 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-15 00:22:26,760 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-15 00:22:26,760 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-15 00:22:26,761 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-15 00:22:26,761 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-15 00:22:26,762 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-15 00:22:26,778 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (22)] Ended with exit code 0 [2024-10-15 00:22:26,779 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-15 00:22:26,779 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-15 00:22:26,781 INFO L229 MonitoredProcess]: Starting monitored process 23 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-15 00:22:26,782 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (23)] Waiting until timeout for monitored process [2024-10-15 00:22:26,783 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-10-15 00:22:26,796 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-15 00:22:26,796 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-15 00:22:26,796 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-15 00:22:26,796 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-15 00:22:26,797 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-15 00:22:26,797 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-15 00:22:26,797 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-15 00:22:26,799 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-15 00:22:26,810 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (23)] Forceful destruction successful, exit code 0 [2024-10-15 00:22:26,811 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-15 00:22:26,811 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-15 00:22:26,812 INFO L229 MonitoredProcess]: Starting monitored process 24 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-15 00:22:26,813 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (24)] Waiting until timeout for monitored process [2024-10-15 00:22:26,815 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-10-15 00:22:26,825 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-15 00:22:26,825 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-15 00:22:26,825 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-15 00:22:26,825 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-15 00:22:26,825 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-15 00:22:26,826 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-15 00:22:26,826 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-15 00:22:26,827 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-15 00:22:26,838 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (24)] Forceful destruction successful, exit code 0 [2024-10-15 00:22:26,838 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-15 00:22:26,838 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-15 00:22:26,840 INFO L229 MonitoredProcess]: Starting monitored process 25 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-15 00:22:26,840 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (25)] Waiting until timeout for monitored process [2024-10-15 00:22:26,841 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-10-15 00:22:26,851 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-15 00:22:26,851 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-15 00:22:26,851 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-15 00:22:26,851 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-15 00:22:26,851 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-15 00:22:26,852 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-15 00:22:26,852 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-15 00:22:26,853 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-15 00:22:26,863 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (25)] Ended with exit code 0 [2024-10-15 00:22:26,864 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-15 00:22:26,864 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-15 00:22:26,865 INFO L229 MonitoredProcess]: Starting monitored process 26 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-15 00:22:26,866 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (26)] Waiting until timeout for monitored process [2024-10-15 00:22:26,867 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-10-15 00:22:26,877 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-15 00:22:26,877 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-15 00:22:26,877 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-15 00:22:26,877 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-15 00:22:26,877 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-15 00:22:26,878 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-15 00:22:26,878 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-15 00:22:26,879 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-15 00:22:26,890 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (26)] Ended with exit code 0 [2024-10-15 00:22:26,890 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-15 00:22:26,890 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-15 00:22:26,891 INFO L229 MonitoredProcess]: Starting monitored process 27 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-15 00:22:26,892 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (27)] Waiting until timeout for monitored process [2024-10-15 00:22:26,893 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-10-15 00:22:26,904 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-15 00:22:26,904 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-15 00:22:26,904 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-15 00:22:26,904 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-15 00:22:26,906 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-10-15 00:22:26,906 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-10-15 00:22:26,911 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-15 00:22:26,922 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (27)] Ended with exit code 0 [2024-10-15 00:22:26,922 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-15 00:22:26,923 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-15 00:22:26,924 INFO L229 MonitoredProcess]: Starting monitored process 28 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-15 00:22:26,926 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (28)] Waiting until timeout for monitored process [2024-10-15 00:22:26,928 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-10-15 00:22:26,941 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-15 00:22:26,941 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-15 00:22:26,941 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-15 00:22:26,941 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-15 00:22:26,941 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-15 00:22:26,942 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-15 00:22:26,942 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-15 00:22:26,946 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-15 00:22:26,962 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (28)] Ended with exit code 0 [2024-10-15 00:22:26,962 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-15 00:22:26,962 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-15 00:22:26,964 INFO L229 MonitoredProcess]: Starting monitored process 29 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-15 00:22:26,966 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (29)] Waiting until timeout for monitored process [2024-10-15 00:22:26,968 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-10-15 00:22:26,981 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-15 00:22:26,981 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-15 00:22:26,981 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-15 00:22:26,981 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-15 00:22:26,981 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-15 00:22:26,982 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-15 00:22:26,982 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-15 00:22:26,984 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-15 00:22:26,999 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (29)] Forceful destruction successful, exit code 0 [2024-10-15 00:22:26,999 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-15 00:22:27,000 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-15 00:22:27,001 INFO L229 MonitoredProcess]: Starting monitored process 30 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-15 00:22:27,003 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (30)] Waiting until timeout for monitored process [2024-10-15 00:22:27,003 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-10-15 00:22:27,016 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-15 00:22:27,018 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-15 00:22:27,018 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-15 00:22:27,018 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-15 00:22:27,018 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-15 00:22:27,018 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-15 00:22:27,021 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-15 00:22:27,023 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-15 00:22:27,049 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (30)] Ended with exit code 0 [2024-10-15 00:22:27,050 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-15 00:22:27,050 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-15 00:22:27,052 INFO L229 MonitoredProcess]: Starting monitored process 31 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-15 00:22:27,054 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (31)] Waiting until timeout for monitored process [2024-10-15 00:22:27,055 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-10-15 00:22:27,068 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-15 00:22:27,068 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-15 00:22:27,068 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-15 00:22:27,068 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-15 00:22:27,068 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-15 00:22:27,069 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-15 00:22:27,069 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-15 00:22:27,071 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-15 00:22:27,086 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (31)] Ended with exit code 0 [2024-10-15 00:22:27,087 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-15 00:22:27,087 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-15 00:22:27,089 INFO L229 MonitoredProcess]: Starting monitored process 32 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-15 00:22:27,090 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (32)] Waiting until timeout for monitored process [2024-10-15 00:22:27,091 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-10-15 00:22:27,101 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-15 00:22:27,101 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-15 00:22:27,101 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-15 00:22:27,101 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-15 00:22:27,101 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-15 00:22:27,101 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-15 00:22:27,101 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-15 00:22:27,105 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-15 00:22:27,116 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (32)] Forceful destruction successful, exit code 0 [2024-10-15 00:22:27,116 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-15 00:22:27,116 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-15 00:22:27,118 INFO L229 MonitoredProcess]: Starting monitored process 33 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-15 00:22:27,118 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (33)] Waiting until timeout for monitored process [2024-10-15 00:22:27,119 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-10-15 00:22:27,129 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-15 00:22:27,129 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-15 00:22:27,129 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-15 00:22:27,129 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-15 00:22:27,131 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-10-15 00:22:27,131 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-10-15 00:22:27,135 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-15 00:22:27,148 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (33)] Ended with exit code 0 [2024-10-15 00:22:27,148 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-15 00:22:27,149 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-15 00:22:27,150 INFO L229 MonitoredProcess]: Starting monitored process 34 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-15 00:22:27,150 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (34)] Waiting until timeout for monitored process [2024-10-15 00:22:27,151 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-10-15 00:22:27,161 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-15 00:22:27,161 INFO L203 nArgumentSynthesizer]: 2 stem disjuncts [2024-10-15 00:22:27,161 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-15 00:22:27,162 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-15 00:22:27,164 INFO L401 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2024-10-15 00:22:27,164 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-10-15 00:22:27,170 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-15 00:22:27,185 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (34)] Ended with exit code 0 [2024-10-15 00:22:27,185 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-15 00:22:27,185 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-15 00:22:27,186 INFO L229 MonitoredProcess]: Starting monitored process 35 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-15 00:22:27,187 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (35)] Waiting until timeout for monitored process [2024-10-15 00:22:27,188 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-10-15 00:22:27,198 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-15 00:22:27,198 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-15 00:22:27,198 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-15 00:22:27,198 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-15 00:22:27,205 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-10-15 00:22:27,205 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-10-15 00:22:27,213 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2024-10-15 00:22:27,226 INFO L443 ModelExtractionUtils]: Simplification made 10 calls to the SMT solver. [2024-10-15 00:22:27,227 INFO L444 ModelExtractionUtils]: 1 out of 13 variables were initially zero. Simplification set additionally 9 variables to zero. [2024-10-15 00:22:27,227 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-15 00:22:27,227 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-15 00:22:27,228 INFO L229 MonitoredProcess]: Starting monitored process 36 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-15 00:22:27,229 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (36)] Waiting until timeout for monitored process [2024-10-15 00:22:27,230 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2024-10-15 00:22:27,241 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2024-10-15 00:22:27,241 INFO L474 LassoAnalysis]: Proved termination. [2024-10-15 00:22:27,241 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select #length ULTIMATE.start_main_#t~malloc23#1.base)_3, ULTIMATE.start_cstrlen_~s~0#1.offset) = 1*v_rep(select #length ULTIMATE.start_main_#t~malloc23#1.base)_3 - 1*ULTIMATE.start_cstrlen_~s~0#1.offset Supporting invariants [] [2024-10-15 00:22:27,253 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (35)] Forceful destruction successful, exit code 0 [2024-10-15 00:22:27,272 INFO L156 tatePredicateManager]: 8 out of 9 supporting invariants were superfluous and have been removed [2024-10-15 00:22:27,275 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~s~0!offset [2024-10-15 00:22:27,276 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #length [2024-10-15 00:22:27,276 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#length,GLOBAL] [2024-10-15 00:22:27,298 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 00:22:27,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 00:22:27,336 INFO L255 TraceCheckSpWp]: Trace formula consists of 145 conjuncts, 16 conjuncts are in the unsatisfiable core [2024-10-15 00:22:27,338 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-15 00:22:27,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 00:22:27,415 WARN L253 TraceCheckSpWp]: Trace formula consists of 15 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-10-15 00:22:27,415 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-15 00:22:27,441 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-15 00:22:27,441 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.3 stem predicates 2 loop predicates [2024-10-15 00:22:27,442 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 41 states and 51 transitions. cyclomatic complexity: 14 Second operand has 5 states, 5 states have (on average 3.4) internal successors, (17), 5 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-15 00:22:27,489 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 41 states and 51 transitions. cyclomatic complexity: 14. Second operand has 5 states, 5 states have (on average 3.4) internal successors, (17), 5 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 46 states and 58 transitions. Complement of second has 7 states. [2024-10-15 00:22:27,489 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 3 stem states 1 non-accepting loop states 1 accepting loop states [2024-10-15 00:22:27,490 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 3.4) internal successors, (17), 5 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-15 00:22:27,490 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 19 transitions. [2024-10-15 00:22:27,490 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 19 transitions. Stem has 18 letters. Loop has 3 letters. [2024-10-15 00:22:27,490 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-10-15 00:22:27,490 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 19 transitions. Stem has 21 letters. Loop has 3 letters. [2024-10-15 00:22:27,491 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-10-15 00:22:27,491 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 19 transitions. Stem has 18 letters. Loop has 6 letters. [2024-10-15 00:22:27,491 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-10-15 00:22:27,491 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 46 states and 58 transitions. [2024-10-15 00:22:27,491 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 14 [2024-10-15 00:22:27,492 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 46 states to 43 states and 54 transitions. [2024-10-15 00:22:27,492 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 30 [2024-10-15 00:22:27,492 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 32 [2024-10-15 00:22:27,492 INFO L73 IsDeterministic]: Start isDeterministic. Operand 43 states and 54 transitions. [2024-10-15 00:22:27,493 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-10-15 00:22:27,493 INFO L218 hiAutomatonCegarLoop]: Abstraction has 43 states and 54 transitions. [2024-10-15 00:22:27,493 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states and 54 transitions. [2024-10-15 00:22:27,494 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 42. [2024-10-15 00:22:27,494 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 42 states, 42 states have (on average 1.2619047619047619) internal successors, (53), 41 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-15 00:22:27,495 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 53 transitions. [2024-10-15 00:22:27,495 INFO L240 hiAutomatonCegarLoop]: Abstraction has 42 states and 53 transitions. [2024-10-15 00:22:27,495 INFO L425 stractBuchiCegarLoop]: Abstraction has 42 states and 53 transitions. [2024-10-15 00:22:27,495 INFO L332 stractBuchiCegarLoop]: ======== Iteration 8 ============ [2024-10-15 00:22:27,495 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 42 states and 53 transitions. [2024-10-15 00:22:27,496 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 14 [2024-10-15 00:22:27,496 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-10-15 00:22:27,496 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-10-15 00:22:27,496 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-15 00:22:27,496 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1] [2024-10-15 00:22:27,497 INFO L745 eck$LassoCheckResult]: Stem: 1153#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 1132#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet20#1, main_#t~nondet21#1, main_#t~malloc22#1.base, main_#t~malloc22#1.offset, main_#t~malloc23#1.base, main_#t~malloc23#1.offset, main_#t~nondet24#1, main_#t~post25#1, main_~i~0#1, main_#t~nondet26#1, main_#t~post27#1, main_~i~1#1, main_#t~ret28#1.base, main_#t~ret28#1.offset, main_~length1~0#1, main_~length2~0#1, main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset, main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset;havoc main_#t~nondet20#1;main_~length1~0#1 := main_#t~nondet20#1;havoc main_#t~nondet20#1;havoc main_#t~nondet21#1;main_~length2~0#1 := main_#t~nondet21#1;havoc main_#t~nondet21#1; 1133#L555 assume !(main_~length1~0#1 < 1); 1151#L555-2 assume !(main_~length2~0#1 < 1); 1127#L558-1 call main_#t~malloc22#1.base, main_#t~malloc22#1.offset := #Ultimate.allocOnStack(main_~length1~0#1 % 4294967296);main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset := main_#t~malloc22#1.base, main_#t~malloc22#1.offset;call main_#t~malloc23#1.base, main_#t~malloc23#1.offset := #Ultimate.allocOnStack(main_~length2~0#1 % 4294967296);main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset := main_#t~malloc23#1.base, main_#t~malloc23#1.offset;main_~i~0#1 := 0; 1128#L564-3 assume !!(main_~i~0#1 < main_~length1~0#1);havoc main_#t~nondet24#1;call write~int#1(main_#t~nondet24#1, main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset + main_~i~0#1, 1);havoc main_#t~nondet24#1; 1146#L564-2 main_#t~post25#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post25#1;havoc main_#t~post25#1; 1147#L564-3 assume !(main_~i~0#1 < main_~length1~0#1); 1150#L564-4 havoc main_~i~0#1;main_~i~1#1 := 0; 1141#L568-3 assume !!(main_~i~1#1 < main_~length2~0#1);havoc main_#t~nondet26#1;call write~int#0(main_#t~nondet26#1, main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset + main_~i~1#1, 1);havoc main_#t~nondet26#1; 1142#L568-2 main_#t~post27#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post27#1;havoc main_#t~post27#1; 1143#L568-3 assume !!(main_~i~1#1 < main_~length2~0#1);havoc main_#t~nondet26#1;call write~int#0(main_#t~nondet26#1, main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset + main_~i~1#1, 1);havoc main_#t~nondet26#1; 1144#L568-2 main_#t~post27#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post27#1;havoc main_#t~post27#1; 1159#L568-3 assume !(main_~i~1#1 < main_~length2~0#1); 1148#L568-4 havoc main_~i~1#1;call write~int#1(0, main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset + (main_~length1~0#1 - 1), 1);call write~int#0(0, main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset + (main_~length2~0#1 - 1), 1);assume { :begin_inline_cstrstr } true;cstrstr_#in~s#1.base, cstrstr_#in~s#1.offset, cstrstr_#in~find#1.base, cstrstr_#in~find#1.offset := main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset, main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset;havoc cstrstr_#res#1.base, cstrstr_#res#1.offset;havoc cstrstr_#t~post13#1.base, cstrstr_#t~post13#1.offset, cstrstr_#t~mem14#1, cstrstr_#t~ret15#1, cstrstr_#t~post16#1.base, cstrstr_#t~post16#1.offset, cstrstr_#t~mem17#1, cstrstr_#t~ret18#1, cstrstr_#t~post19#1.base, cstrstr_#t~post19#1.offset, cstrstr_~s#1.base, cstrstr_~s#1.offset, cstrstr_~find#1.base, cstrstr_~find#1.offset, cstrstr_~c~0#1, cstrstr_~sc~0#1, cstrstr_~len~0#1;cstrstr_~s#1.base, cstrstr_~s#1.offset := cstrstr_#in~s#1.base, cstrstr_#in~s#1.offset;cstrstr_~find#1.base, cstrstr_~find#1.offset := cstrstr_#in~find#1.base, cstrstr_#in~find#1.offset;havoc cstrstr_~c~0#1;havoc cstrstr_~sc~0#1;havoc cstrstr_~len~0#1;cstrstr_#t~post13#1.base, cstrstr_#t~post13#1.offset := cstrstr_~find#1.base, cstrstr_~find#1.offset;cstrstr_~find#1.base, cstrstr_~find#1.offset := cstrstr_#t~post13#1.base, 1 + cstrstr_#t~post13#1.offset;call cstrstr_#t~mem14#1 := read~int#0(cstrstr_#t~post13#1.base, cstrstr_#t~post13#1.offset, 1);cstrstr_~c~0#1 := cstrstr_#t~mem14#1; 1149#L540 assume 0 != cstrstr_~c~0#1;havoc cstrstr_#t~post13#1.base, cstrstr_#t~post13#1.offset;havoc cstrstr_#t~mem14#1;assume { :begin_inline_cstrlen } true;cstrlen_#in~str#1.base, cstrlen_#in~str#1.offset := cstrstr_~find#1.base, cstrstr_~find#1.offset;havoc cstrlen_#res#1;havoc cstrlen_#t~mem2#1, cstrlen_#t~pre3#1.base, cstrlen_#t~pre3#1.offset, cstrlen_~str#1.base, cstrlen_~str#1.offset, cstrlen_~s~0#1.base, cstrlen_~s~0#1.offset;cstrlen_~str#1.base, cstrlen_~str#1.offset := cstrlen_#in~str#1.base, cstrlen_#in~str#1.offset;havoc cstrlen_~s~0#1.base, cstrlen_~s~0#1.offset;cstrlen_~s~0#1.base, cstrlen_~s~0#1.offset := cstrlen_~str#1.base, cstrlen_~str#1.offset; 1136#L518-4 call cstrlen_#t~mem2#1 := read~int#0(cstrlen_~s~0#1.base, cstrlen_~s~0#1.offset, 1); 1137#L518-1 assume !(0 != cstrlen_#t~mem2#1);havoc cstrlen_#t~mem2#1; 1126#L518-5 assume cstrlen_~s~0#1.base == cstrlen_~str#1.base;cstrlen_#res#1 := cstrlen_~s~0#1.offset - cstrlen_~str#1.offset; 1118#cstrlen_returnLabel#1 cstrstr_#t~ret15#1 := cstrlen_#res#1;havoc cstrlen_#t~mem2#1, cstrlen_#t~pre3#1.base, cstrlen_#t~pre3#1.offset, cstrlen_~str#1.base, cstrlen_~str#1.offset, cstrlen_~s~0#1.base, cstrlen_~s~0#1.offset;havoc cstrlen_#in~str#1.base, cstrlen_#in~str#1.offset;assume { :end_inline_cstrlen } true;cstrstr_~len~0#1 := cstrstr_#t~ret15#1;havoc cstrstr_#t~ret15#1; 1119#L542-4 [2024-10-15 00:22:27,497 INFO L747 eck$LassoCheckResult]: Loop: 1119#L542-4 goto; 1140#L543-2 cstrstr_#t~post16#1.base, cstrstr_#t~post16#1.offset := cstrstr_~s#1.base, cstrstr_~s#1.offset;cstrstr_~s#1.base, cstrstr_~s#1.offset := cstrstr_#t~post16#1.base, 1 + cstrstr_#t~post16#1.offset;call cstrstr_#t~mem17#1 := read~int#1(cstrstr_#t~post16#1.base, cstrstr_#t~post16#1.offset, 1);cstrstr_~sc~0#1 := cstrstr_#t~mem17#1; 1129#L544 assume !(0 == cstrstr_~sc~0#1);havoc cstrstr_#t~post16#1.base, cstrstr_#t~post16#1.offset;havoc cstrstr_#t~mem17#1; 1130#L543 assume !(cstrstr_~sc~0#1 != cstrstr_~c~0#1); 1145#L542-1 assume { :begin_inline_cstrncmp } true;cstrncmp_#in~s1#1.base, cstrncmp_#in~s1#1.offset, cstrncmp_#in~s2#1.base, cstrncmp_#in~s2#1.offset, cstrncmp_#in~n#1 := cstrstr_~s#1.base, cstrstr_~s#1.offset, cstrstr_~find#1.base, cstrstr_~find#1.offset, cstrstr_~len~0#1;havoc cstrncmp_#res#1;havoc cstrncmp_#t~mem5#1, cstrncmp_#t~post4#1.base, cstrncmp_#t~post4#1.offset, cstrncmp_#t~mem6#1, cstrncmp_#t~mem8#1, cstrncmp_#t~pre7#1.base, cstrncmp_#t~pre7#1.offset, cstrncmp_#t~mem9#1, cstrncmp_#t~post10#1.base, cstrncmp_#t~post10#1.offset, cstrncmp_#t~mem11#1, cstrncmp_#t~pre12#1, cstrncmp_~s1#1.base, cstrncmp_~s1#1.offset, cstrncmp_~s2#1.base, cstrncmp_~s2#1.offset, cstrncmp_~n#1;cstrncmp_~s1#1.base, cstrncmp_~s1#1.offset := cstrncmp_#in~s1#1.base, cstrncmp_#in~s1#1.offset;cstrncmp_~s2#1.base, cstrncmp_~s2#1.offset := cstrncmp_#in~s2#1.base, cstrncmp_#in~s2#1.offset;cstrncmp_~n#1 := cstrncmp_#in~n#1; 1120#L525 assume 0 == cstrncmp_~n#1 % 4294967296;cstrncmp_#res#1 := 0; 1121#cstrncmp_returnLabel#1 cstrstr_#t~ret18#1 := cstrncmp_#res#1;havoc cstrncmp_#t~mem5#1, cstrncmp_#t~post4#1.base, cstrncmp_#t~post4#1.offset, cstrncmp_#t~mem6#1, cstrncmp_#t~mem8#1, cstrncmp_#t~pre7#1.base, cstrncmp_#t~pre7#1.offset, cstrncmp_#t~mem9#1, cstrncmp_#t~post10#1.base, cstrncmp_#t~post10#1.offset, cstrncmp_#t~mem11#1, cstrncmp_#t~pre12#1, cstrncmp_~s1#1.base, cstrncmp_~s1#1.offset, cstrncmp_~s2#1.base, cstrncmp_~s2#1.offset, cstrncmp_~n#1;havoc cstrncmp_#in~s1#1.base, cstrncmp_#in~s1#1.offset, cstrncmp_#in~s2#1.base, cstrncmp_#in~s2#1.offset, cstrncmp_#in~n#1;assume { :end_inline_cstrncmp } true; 1131#L542-2 assume !!(0 != cstrstr_#t~ret18#1);havoc cstrstr_#t~ret18#1; 1119#L542-4 [2024-10-15 00:22:27,497 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 00:22:27,498 INFO L85 PathProgramCache]: Analyzing trace with hash 1849679959, now seen corresponding path program 1 times [2024-10-15 00:22:27,498 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-15 00:22:27,498 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1139452316] [2024-10-15 00:22:27,498 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-15 00:22:27,498 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-15 00:22:27,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-15 00:22:27,515 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-15 00:22:27,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-15 00:22:27,533 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-15 00:22:27,558 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 00:22:27,558 INFO L85 PathProgramCache]: Analyzing trace with hash -1079765744, now seen corresponding path program 1 times [2024-10-15 00:22:27,558 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-15 00:22:27,559 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1232689374] [2024-10-15 00:22:27,559 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-15 00:22:27,559 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-15 00:22:27,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 00:22:27,591 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (36)] Ended with exit code 0 [2024-10-15 00:22:27,600 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-15 00:22:27,601 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-15 00:22:27,601 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1232689374] [2024-10-15 00:22:27,601 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1232689374] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-15 00:22:27,601 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-15 00:22:27,601 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-15 00:22:27,602 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1292327368] [2024-10-15 00:22:27,602 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-15 00:22:27,602 INFO L762 eck$LassoCheckResult]: loop already infeasible [2024-10-15 00:22:27,602 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-15 00:22:27,602 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-15 00:22:27,603 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-15 00:22:27,603 INFO L87 Difference]: Start difference. First operand 42 states and 53 transitions. cyclomatic complexity: 15 Second operand has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 4 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-15 00:22:27,615 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-15 00:22:27,615 INFO L93 Difference]: Finished difference Result 44 states and 54 transitions. [2024-10-15 00:22:27,616 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 44 states and 54 transitions. [2024-10-15 00:22:27,616 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 13 [2024-10-15 00:22:27,616 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 44 states to 41 states and 49 transitions. [2024-10-15 00:22:27,617 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 30 [2024-10-15 00:22:27,617 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 30 [2024-10-15 00:22:27,617 INFO L73 IsDeterministic]: Start isDeterministic. Operand 41 states and 49 transitions. [2024-10-15 00:22:27,617 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-10-15 00:22:27,617 INFO L218 hiAutomatonCegarLoop]: Abstraction has 41 states and 49 transitions. [2024-10-15 00:22:27,617 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states and 49 transitions. [2024-10-15 00:22:27,619 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 41. [2024-10-15 00:22:27,619 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 41 states, 41 states have (on average 1.1951219512195121) internal successors, (49), 40 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-15 00:22:27,620 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 49 transitions. [2024-10-15 00:22:27,620 INFO L240 hiAutomatonCegarLoop]: Abstraction has 41 states and 49 transitions. [2024-10-15 00:22:27,620 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-15 00:22:27,621 INFO L425 stractBuchiCegarLoop]: Abstraction has 41 states and 49 transitions. [2024-10-15 00:22:27,621 INFO L332 stractBuchiCegarLoop]: ======== Iteration 9 ============ [2024-10-15 00:22:27,621 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 41 states and 49 transitions. [2024-10-15 00:22:27,622 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 13 [2024-10-15 00:22:27,622 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-10-15 00:22:27,622 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-10-15 00:22:27,622 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-15 00:22:27,623 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-15 00:22:27,623 INFO L745 eck$LassoCheckResult]: Stem: 1244#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 1222#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet20#1, main_#t~nondet21#1, main_#t~malloc22#1.base, main_#t~malloc22#1.offset, main_#t~malloc23#1.base, main_#t~malloc23#1.offset, main_#t~nondet24#1, main_#t~post25#1, main_~i~0#1, main_#t~nondet26#1, main_#t~post27#1, main_~i~1#1, main_#t~ret28#1.base, main_#t~ret28#1.offset, main_~length1~0#1, main_~length2~0#1, main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset, main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset;havoc main_#t~nondet20#1;main_~length1~0#1 := main_#t~nondet20#1;havoc main_#t~nondet20#1;havoc main_#t~nondet21#1;main_~length2~0#1 := main_#t~nondet21#1;havoc main_#t~nondet21#1; 1223#L555 assume !(main_~length1~0#1 < 1); 1243#L555-2 assume !(main_~length2~0#1 < 1); 1217#L558-1 call main_#t~malloc22#1.base, main_#t~malloc22#1.offset := #Ultimate.allocOnStack(main_~length1~0#1 % 4294967296);main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset := main_#t~malloc22#1.base, main_#t~malloc22#1.offset;call main_#t~malloc23#1.base, main_#t~malloc23#1.offset := #Ultimate.allocOnStack(main_~length2~0#1 % 4294967296);main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset := main_#t~malloc23#1.base, main_#t~malloc23#1.offset;main_~i~0#1 := 0; 1218#L564-3 assume !!(main_~i~0#1 < main_~length1~0#1);havoc main_#t~nondet24#1;call write~int#1(main_#t~nondet24#1, main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset + main_~i~0#1, 1);havoc main_#t~nondet24#1; 1238#L564-2 main_#t~post25#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post25#1;havoc main_#t~post25#1; 1239#L564-3 assume !(main_~i~0#1 < main_~length1~0#1); 1242#L564-4 havoc main_~i~0#1;main_~i~1#1 := 0; 1232#L568-3 assume !!(main_~i~1#1 < main_~length2~0#1);havoc main_#t~nondet26#1;call write~int#0(main_#t~nondet26#1, main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset + main_~i~1#1, 1);havoc main_#t~nondet26#1; 1233#L568-2 main_#t~post27#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post27#1;havoc main_#t~post27#1; 1234#L568-3 assume !!(main_~i~1#1 < main_~length2~0#1);havoc main_#t~nondet26#1;call write~int#0(main_#t~nondet26#1, main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset + main_~i~1#1, 1);havoc main_#t~nondet26#1; 1235#L568-2 main_#t~post27#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post27#1;havoc main_#t~post27#1; 1251#L568-3 assume !(main_~i~1#1 < main_~length2~0#1); 1240#L568-4 havoc main_~i~1#1;call write~int#1(0, main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset + (main_~length1~0#1 - 1), 1);call write~int#0(0, main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset + (main_~length2~0#1 - 1), 1);assume { :begin_inline_cstrstr } true;cstrstr_#in~s#1.base, cstrstr_#in~s#1.offset, cstrstr_#in~find#1.base, cstrstr_#in~find#1.offset := main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset, main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset;havoc cstrstr_#res#1.base, cstrstr_#res#1.offset;havoc cstrstr_#t~post13#1.base, cstrstr_#t~post13#1.offset, cstrstr_#t~mem14#1, cstrstr_#t~ret15#1, cstrstr_#t~post16#1.base, cstrstr_#t~post16#1.offset, cstrstr_#t~mem17#1, cstrstr_#t~ret18#1, cstrstr_#t~post19#1.base, cstrstr_#t~post19#1.offset, cstrstr_~s#1.base, cstrstr_~s#1.offset, cstrstr_~find#1.base, cstrstr_~find#1.offset, cstrstr_~c~0#1, cstrstr_~sc~0#1, cstrstr_~len~0#1;cstrstr_~s#1.base, cstrstr_~s#1.offset := cstrstr_#in~s#1.base, cstrstr_#in~s#1.offset;cstrstr_~find#1.base, cstrstr_~find#1.offset := cstrstr_#in~find#1.base, cstrstr_#in~find#1.offset;havoc cstrstr_~c~0#1;havoc cstrstr_~sc~0#1;havoc cstrstr_~len~0#1;cstrstr_#t~post13#1.base, cstrstr_#t~post13#1.offset := cstrstr_~find#1.base, cstrstr_~find#1.offset;cstrstr_~find#1.base, cstrstr_~find#1.offset := cstrstr_#t~post13#1.base, 1 + cstrstr_#t~post13#1.offset;call cstrstr_#t~mem14#1 := read~int#0(cstrstr_#t~post13#1.base, cstrstr_#t~post13#1.offset, 1);cstrstr_~c~0#1 := cstrstr_#t~mem14#1; 1241#L540 assume 0 != cstrstr_~c~0#1;havoc cstrstr_#t~post13#1.base, cstrstr_#t~post13#1.offset;havoc cstrstr_#t~mem14#1;assume { :begin_inline_cstrlen } true;cstrlen_#in~str#1.base, cstrlen_#in~str#1.offset := cstrstr_~find#1.base, cstrstr_~find#1.offset;havoc cstrlen_#res#1;havoc cstrlen_#t~mem2#1, cstrlen_#t~pre3#1.base, cstrlen_#t~pre3#1.offset, cstrlen_~str#1.base, cstrlen_~str#1.offset, cstrlen_~s~0#1.base, cstrlen_~s~0#1.offset;cstrlen_~str#1.base, cstrlen_~str#1.offset := cstrlen_#in~str#1.base, cstrlen_#in~str#1.offset;havoc cstrlen_~s~0#1.base, cstrlen_~s~0#1.offset;cstrlen_~s~0#1.base, cstrlen_~s~0#1.offset := cstrlen_~str#1.base, cstrlen_~str#1.offset; 1228#L518-4 call cstrlen_#t~mem2#1 := read~int#0(cstrlen_~s~0#1.base, cstrlen_~s~0#1.offset, 1); 1229#L518-1 assume !(0 != cstrlen_#t~mem2#1);havoc cstrlen_#t~mem2#1; 1219#L518-5 assume cstrlen_~s~0#1.base == cstrlen_~str#1.base;cstrlen_#res#1 := cstrlen_~s~0#1.offset - cstrlen_~str#1.offset; 1211#cstrlen_returnLabel#1 cstrstr_#t~ret15#1 := cstrlen_#res#1;havoc cstrlen_#t~mem2#1, cstrlen_#t~pre3#1.base, cstrlen_#t~pre3#1.offset, cstrlen_~str#1.base, cstrlen_~str#1.offset, cstrlen_~s~0#1.base, cstrlen_~s~0#1.offset;havoc cstrlen_#in~str#1.base, cstrlen_#in~str#1.offset;assume { :end_inline_cstrlen } true;cstrstr_~len~0#1 := cstrstr_#t~ret15#1;havoc cstrstr_#t~ret15#1; 1212#L542-4 [2024-10-15 00:22:27,623 INFO L747 eck$LassoCheckResult]: Loop: 1212#L542-4 goto; 1236#L543-2 cstrstr_#t~post16#1.base, cstrstr_#t~post16#1.offset := cstrstr_~s#1.base, cstrstr_~s#1.offset;cstrstr_~s#1.base, cstrstr_~s#1.offset := cstrstr_#t~post16#1.base, 1 + cstrstr_#t~post16#1.offset;call cstrstr_#t~mem17#1 := read~int#1(cstrstr_#t~post16#1.base, cstrstr_#t~post16#1.offset, 1);cstrstr_~sc~0#1 := cstrstr_#t~mem17#1; 1220#L544 assume !(0 == cstrstr_~sc~0#1);havoc cstrstr_#t~post16#1.base, cstrstr_#t~post16#1.offset;havoc cstrstr_#t~mem17#1; 1221#L543 assume !(cstrstr_~sc~0#1 != cstrstr_~c~0#1); 1237#L542-1 assume { :begin_inline_cstrncmp } true;cstrncmp_#in~s1#1.base, cstrncmp_#in~s1#1.offset, cstrncmp_#in~s2#1.base, cstrncmp_#in~s2#1.offset, cstrncmp_#in~n#1 := cstrstr_~s#1.base, cstrstr_~s#1.offset, cstrstr_~find#1.base, cstrstr_~find#1.offset, cstrstr_~len~0#1;havoc cstrncmp_#res#1;havoc cstrncmp_#t~mem5#1, cstrncmp_#t~post4#1.base, cstrncmp_#t~post4#1.offset, cstrncmp_#t~mem6#1, cstrncmp_#t~mem8#1, cstrncmp_#t~pre7#1.base, cstrncmp_#t~pre7#1.offset, cstrncmp_#t~mem9#1, cstrncmp_#t~post10#1.base, cstrncmp_#t~post10#1.offset, cstrncmp_#t~mem11#1, cstrncmp_#t~pre12#1, cstrncmp_~s1#1.base, cstrncmp_~s1#1.offset, cstrncmp_~s2#1.base, cstrncmp_~s2#1.offset, cstrncmp_~n#1;cstrncmp_~s1#1.base, cstrncmp_~s1#1.offset := cstrncmp_#in~s1#1.base, cstrncmp_#in~s1#1.offset;cstrncmp_~s2#1.base, cstrncmp_~s2#1.offset := cstrncmp_#in~s2#1.base, cstrncmp_#in~s2#1.offset;cstrncmp_~n#1 := cstrncmp_#in~n#1; 1213#L525 assume !(0 == cstrncmp_~n#1 % 4294967296); 1214#L527-4 call cstrncmp_#t~mem5#1 := read~int#1(cstrncmp_~s1#1.base, cstrncmp_~s1#1.offset, 1);cstrncmp_#t~post4#1.base, cstrncmp_#t~post4#1.offset := cstrncmp_~s2#1.base, cstrncmp_~s2#1.offset;cstrncmp_~s2#1.base, cstrncmp_~s2#1.offset := cstrncmp_#t~post4#1.base, 1 + cstrncmp_#t~post4#1.offset;call cstrncmp_#t~mem6#1 := read~int#0(cstrncmp_#t~post4#1.base, cstrncmp_#t~post4#1.offset, 1); 1227#L528 assume cstrncmp_#t~mem5#1 != cstrncmp_#t~mem6#1;havoc cstrncmp_#t~mem5#1;havoc cstrncmp_#t~post4#1.base, cstrncmp_#t~post4#1.offset;havoc cstrncmp_#t~mem6#1;call cstrncmp_#t~mem8#1 := read~int#1(cstrncmp_~s1#1.base, cstrncmp_~s1#1.offset, 1);cstrncmp_#t~pre7#1.base, cstrncmp_#t~pre7#1.offset := cstrncmp_~s2#1.base, cstrncmp_~s2#1.offset - 1;cstrncmp_~s2#1.base, cstrncmp_~s2#1.offset := cstrncmp_~s2#1.base, cstrncmp_~s2#1.offset - 1;call cstrncmp_#t~mem9#1 := read~int#0(cstrncmp_#t~pre7#1.base, cstrncmp_#t~pre7#1.offset, 1);cstrncmp_#res#1 := (if cstrncmp_#t~mem8#1 % 256 % 4294967296 <= 2147483647 then cstrncmp_#t~mem8#1 % 256 % 4294967296 else cstrncmp_#t~mem8#1 % 256 % 4294967296 - 4294967296) - (if cstrncmp_#t~mem9#1 % 256 % 4294967296 <= 2147483647 then cstrncmp_#t~mem9#1 % 256 % 4294967296 else cstrncmp_#t~mem9#1 % 256 % 4294967296 - 4294967296);havoc cstrncmp_#t~mem8#1;havoc cstrncmp_#t~pre7#1.base, cstrncmp_#t~pre7#1.offset;havoc cstrncmp_#t~mem9#1; 1224#cstrncmp_returnLabel#1 cstrstr_#t~ret18#1 := cstrncmp_#res#1;havoc cstrncmp_#t~mem5#1, cstrncmp_#t~post4#1.base, cstrncmp_#t~post4#1.offset, cstrncmp_#t~mem6#1, cstrncmp_#t~mem8#1, cstrncmp_#t~pre7#1.base, cstrncmp_#t~pre7#1.offset, cstrncmp_#t~mem9#1, cstrncmp_#t~post10#1.base, cstrncmp_#t~post10#1.offset, cstrncmp_#t~mem11#1, cstrncmp_#t~pre12#1, cstrncmp_~s1#1.base, cstrncmp_~s1#1.offset, cstrncmp_~s2#1.base, cstrncmp_~s2#1.offset, cstrncmp_~n#1;havoc cstrncmp_#in~s1#1.base, cstrncmp_#in~s1#1.offset, cstrncmp_#in~s2#1.base, cstrncmp_#in~s2#1.offset, cstrncmp_#in~n#1;assume { :end_inline_cstrncmp } true; 1225#L542-2 assume !!(0 != cstrstr_#t~ret18#1);havoc cstrstr_#t~ret18#1; 1212#L542-4 [2024-10-15 00:22:27,624 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 00:22:27,624 INFO L85 PathProgramCache]: Analyzing trace with hash 1849679959, now seen corresponding path program 2 times [2024-10-15 00:22:27,624 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-15 00:22:27,624 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1266149864] [2024-10-15 00:22:27,624 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-15 00:22:27,624 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-15 00:22:27,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-15 00:22:27,639 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-15 00:22:27,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-15 00:22:27,652 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-15 00:22:27,653 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 00:22:27,653 INFO L85 PathProgramCache]: Analyzing trace with hash 1728347221, now seen corresponding path program 1 times [2024-10-15 00:22:27,653 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-15 00:22:27,654 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1193410661] [2024-10-15 00:22:27,654 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-15 00:22:27,654 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-15 00:22:27,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-15 00:22:27,664 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-15 00:22:27,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-15 00:22:27,673 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-15 00:22:27,673 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 00:22:27,673 INFO L85 PathProgramCache]: Analyzing trace with hash 1941989675, now seen corresponding path program 1 times [2024-10-15 00:22:27,674 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-15 00:22:27,674 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1125756849] [2024-10-15 00:22:27,674 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-15 00:22:27,674 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-15 00:22:27,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 00:22:27,807 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2024-10-15 00:22:27,808 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-15 00:22:27,808 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1125756849] [2024-10-15 00:22:27,808 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1125756849] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-15 00:22:27,808 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-15 00:22:27,808 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-15 00:22:27,809 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2010197371] [2024-10-15 00:22:27,809 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-15 00:22:28,111 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-15 00:22:28,112 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-15 00:22:28,112 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-15 00:22:28,114 INFO L87 Difference]: Start difference. First operand 41 states and 49 transitions. cyclomatic complexity: 12 Second operand has 6 states, 6 states have (on average 4.666666666666667) internal successors, (28), 6 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-15 00:22:28,152 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-15 00:22:28,152 INFO L93 Difference]: Finished difference Result 52 states and 60 transitions. [2024-10-15 00:22:28,152 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 52 states and 60 transitions. [2024-10-15 00:22:28,153 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 16 [2024-10-15 00:22:28,153 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 52 states to 50 states and 58 transitions. [2024-10-15 00:22:28,153 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 37 [2024-10-15 00:22:28,154 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 37 [2024-10-15 00:22:28,154 INFO L73 IsDeterministic]: Start isDeterministic. Operand 50 states and 58 transitions. [2024-10-15 00:22:28,154 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-10-15 00:22:28,154 INFO L218 hiAutomatonCegarLoop]: Abstraction has 50 states and 58 transitions. [2024-10-15 00:22:28,154 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states and 58 transitions. [2024-10-15 00:22:28,157 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 48. [2024-10-15 00:22:28,157 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 48 states, 48 states have (on average 1.1666666666666667) internal successors, (56), 47 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-15 00:22:28,158 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 56 transitions. [2024-10-15 00:22:28,158 INFO L240 hiAutomatonCegarLoop]: Abstraction has 48 states and 56 transitions. [2024-10-15 00:22:28,159 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-15 00:22:28,159 INFO L425 stractBuchiCegarLoop]: Abstraction has 48 states and 56 transitions. [2024-10-15 00:22:28,160 INFO L332 stractBuchiCegarLoop]: ======== Iteration 10 ============ [2024-10-15 00:22:28,160 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 48 states and 56 transitions. [2024-10-15 00:22:28,160 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 16 [2024-10-15 00:22:28,160 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-10-15 00:22:28,160 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-10-15 00:22:28,161 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-15 00:22:28,161 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2024-10-15 00:22:28,161 INFO L745 eck$LassoCheckResult]: Stem: 1355#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 1330#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet20#1, main_#t~nondet21#1, main_#t~malloc22#1.base, main_#t~malloc22#1.offset, main_#t~malloc23#1.base, main_#t~malloc23#1.offset, main_#t~nondet24#1, main_#t~post25#1, main_~i~0#1, main_#t~nondet26#1, main_#t~post27#1, main_~i~1#1, main_#t~ret28#1.base, main_#t~ret28#1.offset, main_~length1~0#1, main_~length2~0#1, main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset, main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset;havoc main_#t~nondet20#1;main_~length1~0#1 := main_#t~nondet20#1;havoc main_#t~nondet20#1;havoc main_#t~nondet21#1;main_~length2~0#1 := main_#t~nondet21#1;havoc main_#t~nondet21#1; 1331#L555 assume !(main_~length1~0#1 < 1); 1351#L555-2 assume !(main_~length2~0#1 < 1); 1324#L558-1 call main_#t~malloc22#1.base, main_#t~malloc22#1.offset := #Ultimate.allocOnStack(main_~length1~0#1 % 4294967296);main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset := main_#t~malloc22#1.base, main_#t~malloc22#1.offset;call main_#t~malloc23#1.base, main_#t~malloc23#1.offset := #Ultimate.allocOnStack(main_~length2~0#1 % 4294967296);main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset := main_#t~malloc23#1.base, main_#t~malloc23#1.offset;main_~i~0#1 := 0; 1325#L564-3 assume !!(main_~i~0#1 < main_~length1~0#1);havoc main_#t~nondet24#1;call write~int#1(main_#t~nondet24#1, main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset + main_~i~0#1, 1);havoc main_#t~nondet24#1; 1345#L564-2 main_#t~post25#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post25#1;havoc main_#t~post25#1; 1346#L564-3 assume !(main_~i~0#1 < main_~length1~0#1); 1349#L564-4 havoc main_~i~0#1;main_~i~1#1 := 0; 1340#L568-3 assume !!(main_~i~1#1 < main_~length2~0#1);havoc main_#t~nondet26#1;call write~int#0(main_#t~nondet26#1, main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset + main_~i~1#1, 1);havoc main_#t~nondet26#1; 1341#L568-2 main_#t~post27#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post27#1;havoc main_#t~post27#1; 1342#L568-3 assume !!(main_~i~1#1 < main_~length2~0#1);havoc main_#t~nondet26#1;call write~int#0(main_#t~nondet26#1, main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset + main_~i~1#1, 1);havoc main_#t~nondet26#1; 1343#L568-2 main_#t~post27#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post27#1;havoc main_#t~post27#1; 1364#L568-3 assume !(main_~i~1#1 < main_~length2~0#1); 1347#L568-4 havoc main_~i~1#1;call write~int#1(0, main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset + (main_~length1~0#1 - 1), 1);call write~int#0(0, main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset + (main_~length2~0#1 - 1), 1);assume { :begin_inline_cstrstr } true;cstrstr_#in~s#1.base, cstrstr_#in~s#1.offset, cstrstr_#in~find#1.base, cstrstr_#in~find#1.offset := main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset, main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset;havoc cstrstr_#res#1.base, cstrstr_#res#1.offset;havoc cstrstr_#t~post13#1.base, cstrstr_#t~post13#1.offset, cstrstr_#t~mem14#1, cstrstr_#t~ret15#1, cstrstr_#t~post16#1.base, cstrstr_#t~post16#1.offset, cstrstr_#t~mem17#1, cstrstr_#t~ret18#1, cstrstr_#t~post19#1.base, cstrstr_#t~post19#1.offset, cstrstr_~s#1.base, cstrstr_~s#1.offset, cstrstr_~find#1.base, cstrstr_~find#1.offset, cstrstr_~c~0#1, cstrstr_~sc~0#1, cstrstr_~len~0#1;cstrstr_~s#1.base, cstrstr_~s#1.offset := cstrstr_#in~s#1.base, cstrstr_#in~s#1.offset;cstrstr_~find#1.base, cstrstr_~find#1.offset := cstrstr_#in~find#1.base, cstrstr_#in~find#1.offset;havoc cstrstr_~c~0#1;havoc cstrstr_~sc~0#1;havoc cstrstr_~len~0#1;cstrstr_#t~post13#1.base, cstrstr_#t~post13#1.offset := cstrstr_~find#1.base, cstrstr_~find#1.offset;cstrstr_~find#1.base, cstrstr_~find#1.offset := cstrstr_#t~post13#1.base, 1 + cstrstr_#t~post13#1.offset;call cstrstr_#t~mem14#1 := read~int#0(cstrstr_#t~post13#1.base, cstrstr_#t~post13#1.offset, 1);cstrstr_~c~0#1 := cstrstr_#t~mem14#1; 1348#L540 assume 0 != cstrstr_~c~0#1;havoc cstrstr_#t~post13#1.base, cstrstr_#t~post13#1.offset;havoc cstrstr_#t~mem14#1;assume { :begin_inline_cstrlen } true;cstrlen_#in~str#1.base, cstrlen_#in~str#1.offset := cstrstr_~find#1.base, cstrstr_~find#1.offset;havoc cstrlen_#res#1;havoc cstrlen_#t~mem2#1, cstrlen_#t~pre3#1.base, cstrlen_#t~pre3#1.offset, cstrlen_~str#1.base, cstrlen_~str#1.offset, cstrlen_~s~0#1.base, cstrlen_~s~0#1.offset;cstrlen_~str#1.base, cstrlen_~str#1.offset := cstrlen_#in~str#1.base, cstrlen_#in~str#1.offset;havoc cstrlen_~s~0#1.base, cstrlen_~s~0#1.offset;cstrlen_~s~0#1.base, cstrlen_~s~0#1.offset := cstrlen_~str#1.base, cstrlen_~str#1.offset; 1335#L518-4 call cstrlen_#t~mem2#1 := read~int#0(cstrlen_~s~0#1.base, cstrlen_~s~0#1.offset, 1); 1336#L518-1 assume !(0 != cstrlen_#t~mem2#1);havoc cstrlen_#t~mem2#1; 1323#L518-5 assume cstrlen_~s~0#1.base == cstrlen_~str#1.base;cstrlen_#res#1 := cstrlen_~s~0#1.offset - cstrlen_~str#1.offset; 1317#cstrlen_returnLabel#1 cstrstr_#t~ret15#1 := cstrlen_#res#1;havoc cstrlen_#t~mem2#1, cstrlen_#t~pre3#1.base, cstrlen_#t~pre3#1.offset, cstrlen_~str#1.base, cstrlen_~str#1.offset, cstrlen_~s~0#1.base, cstrlen_~s~0#1.offset;havoc cstrlen_#in~str#1.base, cstrlen_#in~str#1.offset;assume { :end_inline_cstrlen } true;cstrstr_~len~0#1 := cstrstr_#t~ret15#1;havoc cstrstr_#t~ret15#1; 1318#L542-4 goto; 1344#L543-2 [2024-10-15 00:22:28,161 INFO L747 eck$LassoCheckResult]: Loop: 1344#L543-2 cstrstr_#t~post16#1.base, cstrstr_#t~post16#1.offset := cstrstr_~s#1.base, cstrstr_~s#1.offset;cstrstr_~s#1.base, cstrstr_~s#1.offset := cstrstr_#t~post16#1.base, 1 + cstrstr_#t~post16#1.offset;call cstrstr_#t~mem17#1 := read~int#1(cstrstr_#t~post16#1.base, cstrstr_#t~post16#1.offset, 1);cstrstr_~sc~0#1 := cstrstr_#t~mem17#1; 1326#L544 assume !(0 == cstrstr_~sc~0#1);havoc cstrstr_#t~post16#1.base, cstrstr_#t~post16#1.offset;havoc cstrstr_#t~mem17#1; 1327#L543 assume !!(cstrstr_~sc~0#1 != cstrstr_~c~0#1); 1344#L543-2 [2024-10-15 00:22:28,163 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 00:22:28,163 INFO L85 PathProgramCache]: Analyzing trace with hash 1505503948, now seen corresponding path program 1 times [2024-10-15 00:22:28,163 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-15 00:22:28,164 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1723401359] [2024-10-15 00:22:28,164 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-15 00:22:28,164 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-15 00:22:28,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-15 00:22:28,182 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-15 00:22:28,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-15 00:22:28,204 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-15 00:22:28,207 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 00:22:28,207 INFO L85 PathProgramCache]: Analyzing trace with hash 99467, now seen corresponding path program 1 times [2024-10-15 00:22:28,208 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-15 00:22:28,208 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [355777920] [2024-10-15 00:22:28,208 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-15 00:22:28,208 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-15 00:22:28,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-15 00:22:28,213 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-15 00:22:28,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-15 00:22:28,219 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-15 00:22:28,220 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 00:22:28,220 INFO L85 PathProgramCache]: Analyzing trace with hash -1875287584, now seen corresponding path program 1 times [2024-10-15 00:22:28,220 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-15 00:22:28,220 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [833121245] [2024-10-15 00:22:28,220 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-15 00:22:28,221 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-15 00:22:28,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 00:22:28,565 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-10-15 00:22:28,566 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-15 00:22:28,566 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [833121245] [2024-10-15 00:22:28,566 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [833121245] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-15 00:22:28,566 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1735138583] [2024-10-15 00:22:28,566 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-15 00:22:28,567 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-15 00:22:28,567 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-15 00:22:28,568 INFO L229 MonitoredProcess]: Starting monitored process 37 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-15 00:22:28,570 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (37)] Waiting until timeout for monitored process [2024-10-15 00:22:28,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 00:22:28,671 INFO L255 TraceCheckSpWp]: Trace formula consists of 167 conjuncts, 25 conjuncts are in the unsatisfiable core [2024-10-15 00:22:28,673 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-15 00:22:28,727 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-10-15 00:22:28,744 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-10-15 00:22:28,745 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-15 00:22:28,761 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 11 [2024-10-15 00:22:28,764 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 12 [2024-10-15 00:22:28,815 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-10-15 00:22:28,815 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1735138583] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-15 00:22:28,815 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-15 00:22:28,815 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 13 [2024-10-15 00:22:28,815 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1186711004] [2024-10-15 00:22:28,815 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-15 00:22:28,864 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-15 00:22:28,865 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-10-15 00:22:28,865 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=110, Unknown=0, NotChecked=0, Total=156 [2024-10-15 00:22:28,865 INFO L87 Difference]: Start difference. First operand 48 states and 56 transitions. cyclomatic complexity: 13 Second operand has 13 states, 13 states have (on average 2.6923076923076925) internal successors, (35), 13 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-15 00:22:28,980 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-15 00:22:28,981 INFO L93 Difference]: Finished difference Result 85 states and 97 transitions. [2024-10-15 00:22:28,981 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 85 states and 97 transitions. [2024-10-15 00:22:28,982 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 16 [2024-10-15 00:22:28,982 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 85 states to 51 states and 58 transitions. [2024-10-15 00:22:28,982 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 37 [2024-10-15 00:22:28,982 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 37 [2024-10-15 00:22:28,982 INFO L73 IsDeterministic]: Start isDeterministic. Operand 51 states and 58 transitions. [2024-10-15 00:22:28,983 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-10-15 00:22:28,983 INFO L218 hiAutomatonCegarLoop]: Abstraction has 51 states and 58 transitions. [2024-10-15 00:22:28,983 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states and 58 transitions. [2024-10-15 00:22:28,984 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 50. [2024-10-15 00:22:28,985 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 50 states, 50 states have (on average 1.14) internal successors, (57), 49 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-15 00:22:28,985 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 57 transitions. [2024-10-15 00:22:28,985 INFO L240 hiAutomatonCegarLoop]: Abstraction has 50 states and 57 transitions. [2024-10-15 00:22:28,986 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-10-15 00:22:28,986 INFO L425 stractBuchiCegarLoop]: Abstraction has 50 states and 57 transitions. [2024-10-15 00:22:28,986 INFO L332 stractBuchiCegarLoop]: ======== Iteration 11 ============ [2024-10-15 00:22:28,987 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 50 states and 57 transitions. [2024-10-15 00:22:28,987 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 16 [2024-10-15 00:22:28,987 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-10-15 00:22:28,987 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-10-15 00:22:28,988 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-15 00:22:28,988 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2024-10-15 00:22:28,988 INFO L745 eck$LassoCheckResult]: Stem: 1651#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 1627#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet20#1, main_#t~nondet21#1, main_#t~malloc22#1.base, main_#t~malloc22#1.offset, main_#t~malloc23#1.base, main_#t~malloc23#1.offset, main_#t~nondet24#1, main_#t~post25#1, main_~i~0#1, main_#t~nondet26#1, main_#t~post27#1, main_~i~1#1, main_#t~ret28#1.base, main_#t~ret28#1.offset, main_~length1~0#1, main_~length2~0#1, main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset, main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset;havoc main_#t~nondet20#1;main_~length1~0#1 := main_#t~nondet20#1;havoc main_#t~nondet20#1;havoc main_#t~nondet21#1;main_~length2~0#1 := main_#t~nondet21#1;havoc main_#t~nondet21#1; 1628#L555 assume !(main_~length1~0#1 < 1); 1648#L555-2 assume !(main_~length2~0#1 < 1); 1621#L558-1 call main_#t~malloc22#1.base, main_#t~malloc22#1.offset := #Ultimate.allocOnStack(main_~length1~0#1 % 4294967296);main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset := main_#t~malloc22#1.base, main_#t~malloc22#1.offset;call main_#t~malloc23#1.base, main_#t~malloc23#1.offset := #Ultimate.allocOnStack(main_~length2~0#1 % 4294967296);main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset := main_#t~malloc23#1.base, main_#t~malloc23#1.offset;main_~i~0#1 := 0; 1622#L564-3 assume !!(main_~i~0#1 < main_~length1~0#1);havoc main_#t~nondet24#1;call write~int#1(main_#t~nondet24#1, main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset + main_~i~0#1, 1);havoc main_#t~nondet24#1; 1642#L564-2 main_#t~post25#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post25#1;havoc main_#t~post25#1; 1643#L564-3 assume !!(main_~i~0#1 < main_~length1~0#1);havoc main_#t~nondet24#1;call write~int#1(main_#t~nondet24#1, main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset + main_~i~0#1, 1);havoc main_#t~nondet24#1; 1652#L564-2 main_#t~post25#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post25#1;havoc main_#t~post25#1; 1659#L564-3 assume !(main_~i~0#1 < main_~length1~0#1); 1646#L564-4 havoc main_~i~0#1;main_~i~1#1 := 0; 1636#L568-3 assume !!(main_~i~1#1 < main_~length2~0#1);havoc main_#t~nondet26#1;call write~int#0(main_#t~nondet26#1, main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset + main_~i~1#1, 1);havoc main_#t~nondet26#1; 1637#L568-2 main_#t~post27#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post27#1;havoc main_#t~post27#1; 1638#L568-3 assume !!(main_~i~1#1 < main_~length2~0#1);havoc main_#t~nondet26#1;call write~int#0(main_#t~nondet26#1, main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset + main_~i~1#1, 1);havoc main_#t~nondet26#1; 1639#L568-2 main_#t~post27#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post27#1;havoc main_#t~post27#1; 1658#L568-3 assume !(main_~i~1#1 < main_~length2~0#1); 1644#L568-4 havoc main_~i~1#1;call write~int#1(0, main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset + (main_~length1~0#1 - 1), 1);call write~int#0(0, main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset + (main_~length2~0#1 - 1), 1);assume { :begin_inline_cstrstr } true;cstrstr_#in~s#1.base, cstrstr_#in~s#1.offset, cstrstr_#in~find#1.base, cstrstr_#in~find#1.offset := main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset, main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset;havoc cstrstr_#res#1.base, cstrstr_#res#1.offset;havoc cstrstr_#t~post13#1.base, cstrstr_#t~post13#1.offset, cstrstr_#t~mem14#1, cstrstr_#t~ret15#1, cstrstr_#t~post16#1.base, cstrstr_#t~post16#1.offset, cstrstr_#t~mem17#1, cstrstr_#t~ret18#1, cstrstr_#t~post19#1.base, cstrstr_#t~post19#1.offset, cstrstr_~s#1.base, cstrstr_~s#1.offset, cstrstr_~find#1.base, cstrstr_~find#1.offset, cstrstr_~c~0#1, cstrstr_~sc~0#1, cstrstr_~len~0#1;cstrstr_~s#1.base, cstrstr_~s#1.offset := cstrstr_#in~s#1.base, cstrstr_#in~s#1.offset;cstrstr_~find#1.base, cstrstr_~find#1.offset := cstrstr_#in~find#1.base, cstrstr_#in~find#1.offset;havoc cstrstr_~c~0#1;havoc cstrstr_~sc~0#1;havoc cstrstr_~len~0#1;cstrstr_#t~post13#1.base, cstrstr_#t~post13#1.offset := cstrstr_~find#1.base, cstrstr_~find#1.offset;cstrstr_~find#1.base, cstrstr_~find#1.offset := cstrstr_#t~post13#1.base, 1 + cstrstr_#t~post13#1.offset;call cstrstr_#t~mem14#1 := read~int#0(cstrstr_#t~post13#1.base, cstrstr_#t~post13#1.offset, 1);cstrstr_~c~0#1 := cstrstr_#t~mem14#1; 1645#L540 assume 0 != cstrstr_~c~0#1;havoc cstrstr_#t~post13#1.base, cstrstr_#t~post13#1.offset;havoc cstrstr_#t~mem14#1;assume { :begin_inline_cstrlen } true;cstrlen_#in~str#1.base, cstrlen_#in~str#1.offset := cstrstr_~find#1.base, cstrstr_~find#1.offset;havoc cstrlen_#res#1;havoc cstrlen_#t~mem2#1, cstrlen_#t~pre3#1.base, cstrlen_#t~pre3#1.offset, cstrlen_~str#1.base, cstrlen_~str#1.offset, cstrlen_~s~0#1.base, cstrlen_~s~0#1.offset;cstrlen_~str#1.base, cstrlen_~str#1.offset := cstrlen_#in~str#1.base, cstrlen_#in~str#1.offset;havoc cstrlen_~s~0#1.base, cstrlen_~s~0#1.offset;cstrlen_~s~0#1.base, cstrlen_~s~0#1.offset := cstrlen_~str#1.base, cstrlen_~str#1.offset; 1631#L518-4 call cstrlen_#t~mem2#1 := read~int#0(cstrlen_~s~0#1.base, cstrlen_~s~0#1.offset, 1); 1632#L518-1 assume !(0 != cstrlen_#t~mem2#1);havoc cstrlen_#t~mem2#1; 1663#L518-5 assume cstrlen_~s~0#1.base == cstrlen_~str#1.base;cstrlen_#res#1 := cstrlen_~s~0#1.offset - cstrlen_~str#1.offset; 1662#cstrlen_returnLabel#1 cstrstr_#t~ret15#1 := cstrlen_#res#1;havoc cstrlen_#t~mem2#1, cstrlen_#t~pre3#1.base, cstrlen_#t~pre3#1.offset, cstrlen_~str#1.base, cstrlen_~str#1.offset, cstrlen_~s~0#1.base, cstrlen_~s~0#1.offset;havoc cstrlen_#in~str#1.base, cstrlen_#in~str#1.offset;assume { :end_inline_cstrlen } true;cstrstr_~len~0#1 := cstrstr_#t~ret15#1;havoc cstrstr_#t~ret15#1; 1661#L542-4 goto; 1641#L543-2 [2024-10-15 00:22:28,988 INFO L747 eck$LassoCheckResult]: Loop: 1641#L543-2 cstrstr_#t~post16#1.base, cstrstr_#t~post16#1.offset := cstrstr_~s#1.base, cstrstr_~s#1.offset;cstrstr_~s#1.base, cstrstr_~s#1.offset := cstrstr_#t~post16#1.base, 1 + cstrstr_#t~post16#1.offset;call cstrstr_#t~mem17#1 := read~int#1(cstrstr_#t~post16#1.base, cstrstr_#t~post16#1.offset, 1);cstrstr_~sc~0#1 := cstrstr_#t~mem17#1; 1623#L544 assume !(0 == cstrstr_~sc~0#1);havoc cstrstr_#t~post16#1.base, cstrstr_#t~post16#1.offset;havoc cstrstr_#t~mem17#1; 1624#L543 assume !!(cstrstr_~sc~0#1 != cstrstr_~c~0#1); 1641#L543-2 [2024-10-15 00:22:28,989 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 00:22:28,989 INFO L85 PathProgramCache]: Analyzing trace with hash 1779363886, now seen corresponding path program 2 times [2024-10-15 00:22:28,989 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-15 00:22:28,989 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [284204608] [2024-10-15 00:22:28,989 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-15 00:22:28,990 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-15 00:22:29,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-15 00:22:29,005 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-15 00:22:29,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-15 00:22:29,019 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-15 00:22:29,020 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 00:22:29,020 INFO L85 PathProgramCache]: Analyzing trace with hash 99467, now seen corresponding path program 2 times [2024-10-15 00:22:29,021 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-15 00:22:29,021 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1351417360] [2024-10-15 00:22:29,021 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-15 00:22:29,021 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-15 00:22:29,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-15 00:22:29,026 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-15 00:22:29,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-15 00:22:29,029 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-15 00:22:29,029 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 00:22:29,029 INFO L85 PathProgramCache]: Analyzing trace with hash 543230270, now seen corresponding path program 2 times [2024-10-15 00:22:29,030 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-15 00:22:29,030 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1230083962] [2024-10-15 00:22:29,030 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-15 00:22:29,030 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-15 00:22:29,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-15 00:22:29,049 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-15 00:22:29,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-15 00:22:29,063 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-15 00:22:31,578 INFO L204 LassoAnalysis]: Preferences: [2024-10-15 00:22:31,578 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2024-10-15 00:22:31,578 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-10-15 00:22:31,578 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2024-10-15 00:22:31,578 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2024-10-15 00:22:31,578 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-15 00:22:31,578 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2024-10-15 00:22:31,578 INFO L131 ssoRankerPreferences]: Path of dumped script: [2024-10-15 00:22:31,579 INFO L132 ssoRankerPreferences]: Filename of dumped script: openbsd_cstrstr-alloca-2.i_Iteration11_Lasso [2024-10-15 00:22:31,579 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2024-10-15 00:22:31,579 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2024-10-15 00:22:31,581 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-15 00:22:31,585 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-15 00:22:31,587 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-15 00:22:31,589 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-15 00:22:31,592 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-15 00:22:31,594 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-15 00:22:31,596 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-15 00:22:31,597 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-15 00:22:31,599 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-15 00:22:31,601 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-15 00:22:31,603 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-15 00:22:31,607 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-15 00:22:31,609 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-15 00:22:31,611 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-15 00:22:31,613 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-15 00:22:31,614 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-15 00:22:31,617 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-15 00:22:31,619 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-15 00:22:31,621 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-15 00:22:31,624 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-15 00:22:31,626 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-15 00:22:31,630 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-15 00:22:31,632 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-15 00:22:31,634 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-15 00:22:31,635 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-15 00:22:31,637 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-15 00:22:31,639 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-15 00:22:31,641 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-15 00:22:31,643 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-15 00:22:31,645 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-15 00:22:31,647 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-15 00:22:31,650 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-15 00:22:31,652 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-15 00:22:31,654 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-15 00:22:31,656 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-15 00:22:31,658 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-15 00:22:31,660 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-15 00:22:31,662 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-15 00:22:31,664 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-15 00:22:31,666 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-15 00:22:31,668 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-15 00:22:31,670 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-15 00:22:31,937 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-15 00:22:31,940 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-15 00:22:31,942 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-15 00:22:31,943 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-15 00:22:31,946 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-15 00:22:32,299 INFO L259 LassoAnalysis]: Preprocessing complete. [2024-10-15 00:22:32,299 INFO L451 LassoAnalysis]: Using template 'affine'. [2024-10-15 00:22:32,299 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-15 00:22:32,299 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-15 00:22:32,301 INFO L229 MonitoredProcess]: Starting monitored process 38 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-15 00:22:32,305 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (38)] Waiting until timeout for monitored process [2024-10-15 00:22:32,306 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-10-15 00:22:32,320 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-15 00:22:32,320 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-15 00:22:32,320 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-15 00:22:32,320 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-15 00:22:32,320 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-15 00:22:32,321 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-15 00:22:32,321 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-15 00:22:32,324 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-15 00:22:32,340 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (38)] Forceful destruction successful, exit code 0 [2024-10-15 00:22:32,340 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-15 00:22:32,341 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-15 00:22:32,342 INFO L229 MonitoredProcess]: Starting monitored process 39 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-15 00:22:32,344 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (39)] Waiting until timeout for monitored process [2024-10-15 00:22:32,344 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-10-15 00:22:32,357 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-15 00:22:32,358 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-15 00:22:32,358 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-15 00:22:32,358 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-15 00:22:32,358 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-15 00:22:32,359 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-15 00:22:32,359 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-15 00:22:32,362 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-15 00:22:32,377 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (39)] Ended with exit code 0 [2024-10-15 00:22:32,378 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-15 00:22:32,378 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-15 00:22:32,379 INFO L229 MonitoredProcess]: Starting monitored process 40 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-15 00:22:32,380 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (40)] Waiting until timeout for monitored process [2024-10-15 00:22:32,381 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-10-15 00:22:32,392 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-15 00:22:32,393 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-15 00:22:32,393 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-15 00:22:32,393 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-15 00:22:32,393 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-15 00:22:32,393 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-15 00:22:32,394 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-15 00:22:32,395 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-15 00:22:32,408 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (40)] Forceful destruction successful, exit code 0 [2024-10-15 00:22:32,408 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-15 00:22:32,408 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-15 00:22:32,409 INFO L229 MonitoredProcess]: Starting monitored process 41 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-15 00:22:32,410 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (41)] Waiting until timeout for monitored process [2024-10-15 00:22:32,411 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-10-15 00:22:32,421 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-15 00:22:32,422 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-15 00:22:32,422 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-15 00:22:32,422 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-15 00:22:32,422 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-15 00:22:32,422 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-15 00:22:32,422 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-15 00:22:32,424 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-15 00:22:32,436 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (41)] Ended with exit code 0 [2024-10-15 00:22:32,436 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-15 00:22:32,436 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-15 00:22:32,437 INFO L229 MonitoredProcess]: Starting monitored process 42 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-15 00:22:32,439 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (42)] Waiting until timeout for monitored process [2024-10-15 00:22:32,439 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-10-15 00:22:32,449 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-15 00:22:32,450 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-15 00:22:32,450 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-15 00:22:32,450 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-15 00:22:32,450 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-15 00:22:32,450 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-15 00:22:32,450 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-15 00:22:32,452 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-15 00:22:32,463 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (42)] Ended with exit code 0 [2024-10-15 00:22:32,464 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-15 00:22:32,464 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-15 00:22:32,465 INFO L229 MonitoredProcess]: Starting monitored process 43 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-15 00:22:32,466 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (43)] Waiting until timeout for monitored process [2024-10-15 00:22:32,466 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-10-15 00:22:32,476 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-15 00:22:32,477 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-15 00:22:32,477 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-15 00:22:32,477 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-15 00:22:32,477 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-15 00:22:32,477 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-15 00:22:32,477 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-15 00:22:32,479 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-15 00:22:32,491 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (43)] Forceful destruction successful, exit code 0 [2024-10-15 00:22:32,492 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-15 00:22:32,492 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-15 00:22:32,493 INFO L229 MonitoredProcess]: Starting monitored process 44 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-15 00:22:32,496 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (44)] Waiting until timeout for monitored process [2024-10-15 00:22:32,496 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-10-15 00:22:32,506 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-15 00:22:32,507 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-15 00:22:32,507 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-15 00:22:32,507 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-15 00:22:32,507 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-15 00:22:32,507 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-15 00:22:32,507 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-15 00:22:32,508 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-15 00:22:32,522 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (44)] Ended with exit code 0 [2024-10-15 00:22:32,523 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-15 00:22:32,523 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-15 00:22:32,524 INFO L229 MonitoredProcess]: Starting monitored process 45 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-15 00:22:32,525 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (45)] Waiting until timeout for monitored process [2024-10-15 00:22:32,526 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-10-15 00:22:32,536 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-15 00:22:32,536 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-15 00:22:32,536 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-15 00:22:32,536 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-15 00:22:32,537 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-15 00:22:32,537 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-15 00:22:32,537 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-15 00:22:32,538 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-15 00:22:32,548 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (45)] Ended with exit code 0 [2024-10-15 00:22:32,549 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-15 00:22:32,549 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-15 00:22:32,550 INFO L229 MonitoredProcess]: Starting monitored process 46 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-15 00:22:32,551 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (46)] Waiting until timeout for monitored process [2024-10-15 00:22:32,552 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-10-15 00:22:32,563 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-15 00:22:32,563 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-15 00:22:32,563 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-15 00:22:32,563 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-15 00:22:32,563 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-15 00:22:32,564 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-15 00:22:32,564 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-15 00:22:32,565 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-15 00:22:32,575 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (46)] Ended with exit code 0 [2024-10-15 00:22:32,576 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-15 00:22:32,576 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-15 00:22:32,577 INFO L229 MonitoredProcess]: Starting monitored process 47 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-15 00:22:32,578 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (47)] Waiting until timeout for monitored process [2024-10-15 00:22:32,579 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-10-15 00:22:32,590 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-15 00:22:32,590 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-15 00:22:32,590 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-15 00:22:32,590 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-15 00:22:32,590 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-15 00:22:32,590 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-15 00:22:32,590 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-15 00:22:32,591 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-15 00:22:32,602 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (47)] Ended with exit code 0 [2024-10-15 00:22:32,602 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-15 00:22:32,602 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-15 00:22:32,604 INFO L229 MonitoredProcess]: Starting monitored process 48 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-15 00:22:32,604 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (48)] Waiting until timeout for monitored process [2024-10-15 00:22:32,605 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-10-15 00:22:32,616 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-15 00:22:32,616 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-15 00:22:32,616 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-15 00:22:32,616 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-15 00:22:32,616 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-15 00:22:32,616 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-15 00:22:32,616 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-15 00:22:32,617 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-15 00:22:32,628 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (48)] Ended with exit code 0 [2024-10-15 00:22:32,628 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-15 00:22:32,628 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-15 00:22:32,629 INFO L229 MonitoredProcess]: Starting monitored process 49 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-15 00:22:32,631 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (49)] Waiting until timeout for monitored process [2024-10-15 00:22:32,631 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-10-15 00:22:32,642 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-15 00:22:32,642 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-15 00:22:32,642 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-15 00:22:32,642 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-15 00:22:32,642 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-15 00:22:32,643 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-15 00:22:32,643 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-15 00:22:32,644 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-15 00:22:32,654 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (49)] Ended with exit code 0 [2024-10-15 00:22:32,655 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-15 00:22:32,655 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-15 00:22:32,656 INFO L229 MonitoredProcess]: Starting monitored process 50 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-15 00:22:32,657 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (50)] Waiting until timeout for monitored process [2024-10-15 00:22:32,659 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-10-15 00:22:32,670 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-15 00:22:32,671 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-15 00:22:32,671 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-15 00:22:32,671 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-15 00:22:32,671 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-15 00:22:32,671 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-15 00:22:32,671 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-15 00:22:32,672 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-15 00:22:32,683 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (50)] Ended with exit code 0 [2024-10-15 00:22:32,683 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-15 00:22:32,683 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-15 00:22:32,684 INFO L229 MonitoredProcess]: Starting monitored process 51 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-15 00:22:32,686 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (51)] Waiting until timeout for monitored process [2024-10-15 00:22:32,686 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-10-15 00:22:32,696 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-15 00:22:32,696 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-15 00:22:32,696 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-15 00:22:32,696 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-15 00:22:32,696 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-15 00:22:32,697 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-15 00:22:32,697 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-15 00:22:32,700 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-15 00:22:32,714 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (51)] Ended with exit code 0 [2024-10-15 00:22:32,715 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-15 00:22:32,715 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-15 00:22:32,716 INFO L229 MonitoredProcess]: Starting monitored process 52 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-15 00:22:32,717 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (52)] Waiting until timeout for monitored process [2024-10-15 00:22:32,717 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-10-15 00:22:32,727 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-15 00:22:32,728 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-15 00:22:32,728 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-15 00:22:32,728 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-15 00:22:32,728 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-15 00:22:32,728 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-15 00:22:32,728 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-15 00:22:32,729 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-15 00:22:32,744 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (52)] Ended with exit code 0 [2024-10-15 00:22:32,745 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-15 00:22:32,745 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-15 00:22:32,747 INFO L229 MonitoredProcess]: Starting monitored process 53 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-15 00:22:32,748 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (53)] Waiting until timeout for monitored process [2024-10-15 00:22:32,749 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-10-15 00:22:32,762 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-15 00:22:32,762 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-15 00:22:32,762 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-15 00:22:32,763 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-15 00:22:32,763 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-15 00:22:32,763 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-15 00:22:32,763 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-15 00:22:32,766 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-15 00:22:32,779 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (53)] Forceful destruction successful, exit code 0 [2024-10-15 00:22:32,779 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-15 00:22:32,779 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-15 00:22:32,780 INFO L229 MonitoredProcess]: Starting monitored process 54 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-15 00:22:32,781 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (54)] Waiting until timeout for monitored process [2024-10-15 00:22:32,782 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-10-15 00:22:32,792 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-15 00:22:32,792 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-15 00:22:32,792 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-15 00:22:32,792 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-15 00:22:32,793 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-10-15 00:22:32,793 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-10-15 00:22:32,795 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-15 00:22:32,806 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (54)] Forceful destruction successful, exit code 0 [2024-10-15 00:22:32,807 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-15 00:22:32,807 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-15 00:22:32,809 INFO L229 MonitoredProcess]: Starting monitored process 55 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-15 00:22:32,810 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (55)] Waiting until timeout for monitored process [2024-10-15 00:22:32,810 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-10-15 00:22:32,820 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-15 00:22:32,820 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-15 00:22:32,820 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-15 00:22:32,820 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-15 00:22:32,820 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-15 00:22:32,821 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-15 00:22:32,821 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-15 00:22:32,822 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-15 00:22:32,833 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (55)] Ended with exit code 0 [2024-10-15 00:22:32,833 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-15 00:22:32,833 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-15 00:22:32,834 INFO L229 MonitoredProcess]: Starting monitored process 56 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-15 00:22:32,835 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (56)] Waiting until timeout for monitored process [2024-10-15 00:22:32,835 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-10-15 00:22:32,845 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-15 00:22:32,846 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-15 00:22:32,846 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-15 00:22:32,846 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-15 00:22:32,847 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-10-15 00:22:32,847 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-10-15 00:22:32,850 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-15 00:22:32,862 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (56)] Ended with exit code 0 [2024-10-15 00:22:32,863 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-15 00:22:32,863 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-15 00:22:32,864 INFO L229 MonitoredProcess]: Starting monitored process 57 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-15 00:22:32,865 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (57)] Waiting until timeout for monitored process [2024-10-15 00:22:32,865 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-10-15 00:22:32,875 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-15 00:22:32,875 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-15 00:22:32,876 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-15 00:22:32,876 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-15 00:22:32,876 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-15 00:22:32,876 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-15 00:22:32,876 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-15 00:22:32,892 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-15 00:22:32,905 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (57)] Ended with exit code 0 [2024-10-15 00:22:32,905 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-15 00:22:32,905 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-15 00:22:32,907 INFO L229 MonitoredProcess]: Starting monitored process 58 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-15 00:22:32,908 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (58)] Waiting until timeout for monitored process [2024-10-15 00:22:32,908 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-10-15 00:22:32,918 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-15 00:22:32,919 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-15 00:22:32,919 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-15 00:22:32,919 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-15 00:22:32,919 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-15 00:22:32,919 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-15 00:22:32,919 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-15 00:22:32,920 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-15 00:22:32,931 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (58)] Ended with exit code 0 [2024-10-15 00:22:32,931 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-15 00:22:32,931 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-15 00:22:32,932 INFO L229 MonitoredProcess]: Starting monitored process 59 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-15 00:22:32,933 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (59)] Waiting until timeout for monitored process [2024-10-15 00:22:32,934 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-10-15 00:22:32,944 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-15 00:22:32,944 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-15 00:22:32,944 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-15 00:22:32,944 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-15 00:22:32,944 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-15 00:22:32,945 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-15 00:22:32,945 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-15 00:22:32,946 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-15 00:22:32,957 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (59)] Forceful destruction successful, exit code 0 [2024-10-15 00:22:32,957 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-15 00:22:32,957 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-15 00:22:32,958 INFO L229 MonitoredProcess]: Starting monitored process 60 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-15 00:22:32,959 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (60)] Waiting until timeout for monitored process [2024-10-15 00:22:32,960 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-10-15 00:22:32,970 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-15 00:22:32,970 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-15 00:22:32,970 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-15 00:22:32,970 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-15 00:22:32,970 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-15 00:22:32,971 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-15 00:22:32,971 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-15 00:22:32,973 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-15 00:22:32,984 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (60)] Ended with exit code 0 [2024-10-15 00:22:32,984 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-15 00:22:32,985 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-15 00:22:32,986 INFO L229 MonitoredProcess]: Starting monitored process 61 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-15 00:22:32,986 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (61)] Waiting until timeout for monitored process [2024-10-15 00:22:32,987 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-10-15 00:22:32,997 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-15 00:22:32,998 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-15 00:22:32,998 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-15 00:22:32,998 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-15 00:22:32,998 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-15 00:22:32,998 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-15 00:22:32,998 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-15 00:22:32,999 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-15 00:22:33,013 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (61)] Forceful destruction successful, exit code 0 [2024-10-15 00:22:33,013 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-15 00:22:33,014 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-15 00:22:33,015 INFO L229 MonitoredProcess]: Starting monitored process 62 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-15 00:22:33,015 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (62)] Waiting until timeout for monitored process [2024-10-15 00:22:33,016 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-10-15 00:22:33,026 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-15 00:22:33,026 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-15 00:22:33,026 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-15 00:22:33,026 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-15 00:22:33,026 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-15 00:22:33,027 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-15 00:22:33,027 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-15 00:22:33,028 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-15 00:22:33,039 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (62)] Ended with exit code 0 [2024-10-15 00:22:33,039 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-15 00:22:33,039 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-15 00:22:33,040 INFO L229 MonitoredProcess]: Starting monitored process 63 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-15 00:22:33,042 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (63)] Waiting until timeout for monitored process [2024-10-15 00:22:33,043 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-10-15 00:22:33,053 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-15 00:22:33,053 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-15 00:22:33,053 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-15 00:22:33,053 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-15 00:22:33,053 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-15 00:22:33,053 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-15 00:22:33,054 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-15 00:22:33,055 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-15 00:22:33,065 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (63)] Ended with exit code 0 [2024-10-15 00:22:33,065 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-15 00:22:33,066 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-15 00:22:33,067 INFO L229 MonitoredProcess]: Starting monitored process 64 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-15 00:22:33,067 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (64)] Waiting until timeout for monitored process [2024-10-15 00:22:33,068 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-10-15 00:22:33,081 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-15 00:22:33,081 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-15 00:22:33,081 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-15 00:22:33,081 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-15 00:22:33,081 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-15 00:22:33,082 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-15 00:22:33,082 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-15 00:22:33,083 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-15 00:22:33,093 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (64)] Ended with exit code 0 [2024-10-15 00:22:33,094 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-15 00:22:33,094 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-15 00:22:33,095 INFO L229 MonitoredProcess]: Starting monitored process 65 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-15 00:22:33,096 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (65)] Waiting until timeout for monitored process [2024-10-15 00:22:33,096 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-10-15 00:22:33,106 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-15 00:22:33,106 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-15 00:22:33,106 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-15 00:22:33,106 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-15 00:22:33,107 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-15 00:22:33,107 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-15 00:22:33,107 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-15 00:22:33,108 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-15 00:22:33,118 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (65)] Ended with exit code 0 [2024-10-15 00:22:33,119 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-15 00:22:33,119 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-15 00:22:33,120 INFO L229 MonitoredProcess]: Starting monitored process 66 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-15 00:22:33,121 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (66)] Waiting until timeout for monitored process [2024-10-15 00:22:33,122 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-10-15 00:22:33,132 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-15 00:22:33,132 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-15 00:22:33,132 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-15 00:22:33,132 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-15 00:22:33,132 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-15 00:22:33,133 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-15 00:22:33,133 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-15 00:22:33,134 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-15 00:22:33,144 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (66)] Ended with exit code 0 [2024-10-15 00:22:33,144 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-15 00:22:33,144 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-15 00:22:33,145 INFO L229 MonitoredProcess]: Starting monitored process 67 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-15 00:22:33,146 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (67)] Waiting until timeout for monitored process [2024-10-15 00:22:33,147 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-10-15 00:22:33,157 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-15 00:22:33,157 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-15 00:22:33,157 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-15 00:22:33,157 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-15 00:22:33,157 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-15 00:22:33,157 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-15 00:22:33,158 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-15 00:22:33,159 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-15 00:22:33,169 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (67)] Ended with exit code 0 [2024-10-15 00:22:33,169 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-15 00:22:33,169 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-15 00:22:33,170 INFO L229 MonitoredProcess]: Starting monitored process 68 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-15 00:22:33,188 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (68)] Waiting until timeout for monitored process [2024-10-15 00:22:33,189 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-10-15 00:22:33,199 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-15 00:22:33,199 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-15 00:22:33,199 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-15 00:22:33,199 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-15 00:22:33,199 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-15 00:22:33,200 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-15 00:22:33,200 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-15 00:22:33,201 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-15 00:22:33,211 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (68)] Ended with exit code 0 [2024-10-15 00:22:33,212 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-15 00:22:33,212 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-15 00:22:33,213 INFO L229 MonitoredProcess]: Starting monitored process 69 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-15 00:22:33,214 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (69)] Waiting until timeout for monitored process [2024-10-15 00:22:33,215 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-10-15 00:22:33,225 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-15 00:22:33,225 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-15 00:22:33,225 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-15 00:22:33,225 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-15 00:22:33,227 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-10-15 00:22:33,227 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-10-15 00:22:33,230 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-15 00:22:33,246 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (69)] Ended with exit code 0 [2024-10-15 00:22:33,246 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-15 00:22:33,246 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-15 00:22:33,248 INFO L229 MonitoredProcess]: Starting monitored process 70 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-15 00:22:33,249 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (70)] Waiting until timeout for monitored process [2024-10-15 00:22:33,251 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-10-15 00:22:33,264 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-15 00:22:33,265 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-15 00:22:33,265 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-15 00:22:33,265 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-15 00:22:33,265 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-15 00:22:33,266 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-15 00:22:33,266 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-15 00:22:33,267 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-15 00:22:33,277 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (70)] Ended with exit code 0 [2024-10-15 00:22:33,278 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-15 00:22:33,278 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-15 00:22:33,279 INFO L229 MonitoredProcess]: Starting monitored process 71 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-15 00:22:33,280 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (71)] Waiting until timeout for monitored process [2024-10-15 00:22:33,281 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-10-15 00:22:33,291 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-15 00:22:33,292 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-15 00:22:33,292 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-15 00:22:33,292 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-15 00:22:33,292 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-15 00:22:33,292 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-15 00:22:33,292 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-15 00:22:33,294 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-15 00:22:33,305 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (71)] Forceful destruction successful, exit code 0 [2024-10-15 00:22:33,305 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-15 00:22:33,305 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-15 00:22:33,306 INFO L229 MonitoredProcess]: Starting monitored process 72 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-15 00:22:33,307 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (72)] Waiting until timeout for monitored process [2024-10-15 00:22:33,308 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-10-15 00:22:33,318 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-15 00:22:33,318 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-15 00:22:33,318 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-15 00:22:33,318 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-15 00:22:33,318 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-15 00:22:33,319 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-15 00:22:33,319 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-15 00:22:33,320 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-15 00:22:33,331 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (72)] Ended with exit code 0 [2024-10-15 00:22:33,331 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-15 00:22:33,331 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-15 00:22:33,332 INFO L229 MonitoredProcess]: Starting monitored process 73 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-15 00:22:33,333 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (73)] Waiting until timeout for monitored process [2024-10-15 00:22:33,334 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-10-15 00:22:33,344 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-15 00:22:33,344 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-15 00:22:33,344 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-15 00:22:33,344 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-15 00:22:33,344 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-15 00:22:33,345 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-15 00:22:33,345 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-15 00:22:33,346 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-15 00:22:33,357 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (73)] Ended with exit code 0 [2024-10-15 00:22:33,358 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-15 00:22:33,358 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-15 00:22:33,359 INFO L229 MonitoredProcess]: Starting monitored process 74 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-15 00:22:33,360 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (74)] Waiting until timeout for monitored process [2024-10-15 00:22:33,360 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-10-15 00:22:33,371 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-15 00:22:33,372 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-15 00:22:33,372 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-15 00:22:33,372 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-15 00:22:33,372 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-15 00:22:33,372 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-15 00:22:33,372 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-15 00:22:33,373 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-15 00:22:33,385 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (74)] Ended with exit code 0 [2024-10-15 00:22:33,386 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-15 00:22:33,386 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-15 00:22:33,387 INFO L229 MonitoredProcess]: Starting monitored process 75 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-15 00:22:33,388 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (75)] Waiting until timeout for monitored process [2024-10-15 00:22:33,389 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-10-15 00:22:33,399 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-15 00:22:33,399 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-15 00:22:33,399 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-15 00:22:33,399 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-15 00:22:33,399 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-15 00:22:33,400 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-15 00:22:33,400 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-15 00:22:33,401 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-15 00:22:33,412 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (75)] Ended with exit code 0 [2024-10-15 00:22:33,413 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-15 00:22:33,413 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-15 00:22:33,414 INFO L229 MonitoredProcess]: Starting monitored process 76 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-15 00:22:33,415 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (76)] Waiting until timeout for monitored process [2024-10-15 00:22:33,415 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-10-15 00:22:33,425 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-15 00:22:33,426 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-15 00:22:33,426 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-15 00:22:33,426 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-15 00:22:33,426 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-15 00:22:33,426 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-15 00:22:33,426 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-15 00:22:33,427 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-15 00:22:33,438 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (76)] Ended with exit code 0 [2024-10-15 00:22:33,438 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-15 00:22:33,438 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-15 00:22:33,440 INFO L229 MonitoredProcess]: Starting monitored process 77 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-15 00:22:33,440 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (77)] Waiting until timeout for monitored process [2024-10-15 00:22:33,441 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-10-15 00:22:33,451 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-15 00:22:33,451 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-15 00:22:33,451 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-15 00:22:33,452 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-15 00:22:33,452 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-15 00:22:33,452 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-15 00:22:33,452 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-15 00:22:33,453 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-15 00:22:33,464 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (77)] Ended with exit code 0 [2024-10-15 00:22:33,465 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-15 00:22:33,465 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-15 00:22:33,466 INFO L229 MonitoredProcess]: Starting monitored process 78 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-15 00:22:33,467 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (78)] Waiting until timeout for monitored process [2024-10-15 00:22:33,468 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-10-15 00:22:33,478 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-15 00:22:33,478 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-15 00:22:33,478 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-15 00:22:33,478 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-15 00:22:33,478 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-15 00:22:33,479 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-15 00:22:33,479 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-15 00:22:33,480 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-15 00:22:33,490 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (78)] Ended with exit code 0 [2024-10-15 00:22:33,491 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-15 00:22:33,491 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-15 00:22:33,492 INFO L229 MonitoredProcess]: Starting monitored process 79 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-15 00:22:33,493 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (79)] Waiting until timeout for monitored process [2024-10-15 00:22:33,493 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-10-15 00:22:33,504 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-15 00:22:33,504 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-15 00:22:33,504 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-15 00:22:33,504 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-15 00:22:33,506 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-10-15 00:22:33,506 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-10-15 00:22:33,512 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-15 00:22:33,528 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (79)] Ended with exit code 0 [2024-10-15 00:22:33,529 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-15 00:22:33,529 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-15 00:22:33,531 INFO L229 MonitoredProcess]: Starting monitored process 80 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-15 00:22:33,532 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (80)] Waiting until timeout for monitored process [2024-10-15 00:22:33,534 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-10-15 00:22:33,547 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-15 00:22:33,548 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-15 00:22:33,548 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-15 00:22:33,548 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-15 00:22:33,552 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-10-15 00:22:33,552 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-10-15 00:22:33,560 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2024-10-15 00:22:33,583 INFO L443 ModelExtractionUtils]: Simplification made 12 calls to the SMT solver. [2024-10-15 00:22:33,584 INFO L444 ModelExtractionUtils]: 4 out of 13 variables were initially zero. Simplification set additionally 6 variables to zero. [2024-10-15 00:22:33,584 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-15 00:22:33,584 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-15 00:22:33,586 INFO L229 MonitoredProcess]: Starting monitored process 81 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-15 00:22:33,588 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (81)] Waiting until timeout for monitored process [2024-10-15 00:22:33,588 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2024-10-15 00:22:33,602 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2024-10-15 00:22:33,602 INFO L474 LassoAnalysis]: Proved termination. [2024-10-15 00:22:33,602 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_cstrstr_~s#1.offset, v_rep(select #length ULTIMATE.start_main_#t~malloc22#1.base)_4) = -1*ULTIMATE.start_cstrstr_~s#1.offset + 1*v_rep(select #length ULTIMATE.start_main_#t~malloc22#1.base)_4 Supporting invariants [] [2024-10-15 00:22:33,618 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (80)] Forceful destruction successful, exit code 0 [2024-10-15 00:22:33,648 INFO L156 tatePredicateManager]: 9 out of 10 supporting invariants were superfluous and have been removed [2024-10-15 00:22:33,650 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~s!offset [2024-10-15 00:22:33,650 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #length [2024-10-15 00:22:33,651 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#length,GLOBAL] [2024-10-15 00:22:33,670 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 00:22:33,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 00:22:33,708 INFO L255 TraceCheckSpWp]: Trace formula consists of 160 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-10-15 00:22:33,709 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-15 00:22:33,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 00:22:33,792 WARN L253 TraceCheckSpWp]: Trace formula consists of 22 conjuncts, 11 conjuncts are in the unsatisfiable core [2024-10-15 00:22:33,793 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-15 00:22:33,826 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-15 00:22:33,827 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.3 stem predicates 2 loop predicates [2024-10-15 00:22:33,827 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 50 states and 57 transitions. cyclomatic complexity: 12 Second operand has 5 states, 5 states have (on average 4.4) internal successors, (22), 5 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-15 00:22:33,869 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 50 states and 57 transitions. cyclomatic complexity: 12. Second operand has 5 states, 5 states have (on average 4.4) internal successors, (22), 5 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 67 states and 76 transitions. Complement of second has 6 states. [2024-10-15 00:22:33,869 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 3 stem states 1 non-accepting loop states 1 accepting loop states [2024-10-15 00:22:33,870 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 4.4) internal successors, (22), 5 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-15 00:22:33,870 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 37 transitions. [2024-10-15 00:22:33,870 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 37 transitions. Stem has 23 letters. Loop has 3 letters. [2024-10-15 00:22:33,871 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-10-15 00:22:33,871 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 37 transitions. Stem has 26 letters. Loop has 3 letters. [2024-10-15 00:22:33,871 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-10-15 00:22:33,871 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 37 transitions. Stem has 23 letters. Loop has 6 letters. [2024-10-15 00:22:33,871 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-10-15 00:22:33,872 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 67 states and 76 transitions. [2024-10-15 00:22:33,872 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2024-10-15 00:22:33,873 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 67 states to 50 states and 56 transitions. [2024-10-15 00:22:33,873 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 23 [2024-10-15 00:22:33,873 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 24 [2024-10-15 00:22:33,873 INFO L73 IsDeterministic]: Start isDeterministic. Operand 50 states and 56 transitions. [2024-10-15 00:22:33,873 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-10-15 00:22:33,874 INFO L218 hiAutomatonCegarLoop]: Abstraction has 50 states and 56 transitions. [2024-10-15 00:22:33,874 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states and 56 transitions. [2024-10-15 00:22:33,875 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 50. [2024-10-15 00:22:33,875 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 50 states, 50 states have (on average 1.12) internal successors, (56), 49 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-15 00:22:33,876 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 56 transitions. [2024-10-15 00:22:33,876 INFO L240 hiAutomatonCegarLoop]: Abstraction has 50 states and 56 transitions. [2024-10-15 00:22:33,876 INFO L425 stractBuchiCegarLoop]: Abstraction has 50 states and 56 transitions. [2024-10-15 00:22:33,876 INFO L332 stractBuchiCegarLoop]: ======== Iteration 12 ============ [2024-10-15 00:22:33,876 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 50 states and 56 transitions. [2024-10-15 00:22:33,877 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2024-10-15 00:22:33,877 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-10-15 00:22:33,877 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-10-15 00:22:33,878 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-15 00:22:33,878 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2024-10-15 00:22:33,878 INFO L745 eck$LassoCheckResult]: Stem: 1921#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 1894#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet20#1, main_#t~nondet21#1, main_#t~malloc22#1.base, main_#t~malloc22#1.offset, main_#t~malloc23#1.base, main_#t~malloc23#1.offset, main_#t~nondet24#1, main_#t~post25#1, main_~i~0#1, main_#t~nondet26#1, main_#t~post27#1, main_~i~1#1, main_#t~ret28#1.base, main_#t~ret28#1.offset, main_~length1~0#1, main_~length2~0#1, main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset, main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset;havoc main_#t~nondet20#1;main_~length1~0#1 := main_#t~nondet20#1;havoc main_#t~nondet20#1;havoc main_#t~nondet21#1;main_~length2~0#1 := main_#t~nondet21#1;havoc main_#t~nondet21#1; 1895#L555 assume !(main_~length1~0#1 < 1); 1920#L555-2 assume !(main_~length2~0#1 < 1); 1888#L558-1 call main_#t~malloc22#1.base, main_#t~malloc22#1.offset := #Ultimate.allocOnStack(main_~length1~0#1 % 4294967296);main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset := main_#t~malloc22#1.base, main_#t~malloc22#1.offset;call main_#t~malloc23#1.base, main_#t~malloc23#1.offset := #Ultimate.allocOnStack(main_~length2~0#1 % 4294967296);main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset := main_#t~malloc23#1.base, main_#t~malloc23#1.offset;main_~i~0#1 := 0; 1889#L564-3 assume !!(main_~i~0#1 < main_~length1~0#1);havoc main_#t~nondet24#1;call write~int#1(main_#t~nondet24#1, main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset + main_~i~0#1, 1);havoc main_#t~nondet24#1; 1915#L564-2 main_#t~post25#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post25#1;havoc main_#t~post25#1; 1916#L564-3 assume !!(main_~i~0#1 < main_~length1~0#1);havoc main_#t~nondet24#1;call write~int#1(main_#t~nondet24#1, main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset + main_~i~0#1, 1);havoc main_#t~nondet24#1; 1923#L564-2 main_#t~post25#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post25#1;havoc main_#t~post25#1; 1924#L564-3 assume !(main_~i~0#1 < main_~length1~0#1); 1919#L564-4 havoc main_~i~0#1;main_~i~1#1 := 0; 1907#L568-3 assume !!(main_~i~1#1 < main_~length2~0#1);havoc main_#t~nondet26#1;call write~int#0(main_#t~nondet26#1, main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset + main_~i~1#1, 1);havoc main_#t~nondet26#1; 1908#L568-2 main_#t~post27#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post27#1;havoc main_#t~post27#1; 1909#L568-3 assume !!(main_~i~1#1 < main_~length2~0#1);havoc main_#t~nondet26#1;call write~int#0(main_#t~nondet26#1, main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset + main_~i~1#1, 1);havoc main_#t~nondet26#1; 1910#L568-2 main_#t~post27#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post27#1;havoc main_#t~post27#1; 1927#L568-3 assume !!(main_~i~1#1 < main_~length2~0#1);havoc main_#t~nondet26#1;call write~int#0(main_#t~nondet26#1, main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset + main_~i~1#1, 1);havoc main_#t~nondet26#1; 1926#L568-2 main_#t~post27#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post27#1;havoc main_#t~post27#1; 1925#L568-3 assume !(main_~i~1#1 < main_~length2~0#1); 1917#L568-4 havoc main_~i~1#1;call write~int#1(0, main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset + (main_~length1~0#1 - 1), 1);call write~int#0(0, main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset + (main_~length2~0#1 - 1), 1);assume { :begin_inline_cstrstr } true;cstrstr_#in~s#1.base, cstrstr_#in~s#1.offset, cstrstr_#in~find#1.base, cstrstr_#in~find#1.offset := main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset, main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset;havoc cstrstr_#res#1.base, cstrstr_#res#1.offset;havoc cstrstr_#t~post13#1.base, cstrstr_#t~post13#1.offset, cstrstr_#t~mem14#1, cstrstr_#t~ret15#1, cstrstr_#t~post16#1.base, cstrstr_#t~post16#1.offset, cstrstr_#t~mem17#1, cstrstr_#t~ret18#1, cstrstr_#t~post19#1.base, cstrstr_#t~post19#1.offset, cstrstr_~s#1.base, cstrstr_~s#1.offset, cstrstr_~find#1.base, cstrstr_~find#1.offset, cstrstr_~c~0#1, cstrstr_~sc~0#1, cstrstr_~len~0#1;cstrstr_~s#1.base, cstrstr_~s#1.offset := cstrstr_#in~s#1.base, cstrstr_#in~s#1.offset;cstrstr_~find#1.base, cstrstr_~find#1.offset := cstrstr_#in~find#1.base, cstrstr_#in~find#1.offset;havoc cstrstr_~c~0#1;havoc cstrstr_~sc~0#1;havoc cstrstr_~len~0#1;cstrstr_#t~post13#1.base, cstrstr_#t~post13#1.offset := cstrstr_~find#1.base, cstrstr_~find#1.offset;cstrstr_~find#1.base, cstrstr_~find#1.offset := cstrstr_#t~post13#1.base, 1 + cstrstr_#t~post13#1.offset;call cstrstr_#t~mem14#1 := read~int#0(cstrstr_#t~post13#1.base, cstrstr_#t~post13#1.offset, 1);cstrstr_~c~0#1 := cstrstr_#t~mem14#1; 1918#L540 assume 0 != cstrstr_~c~0#1;havoc cstrstr_#t~post13#1.base, cstrstr_#t~post13#1.offset;havoc cstrstr_#t~mem14#1;assume { :begin_inline_cstrlen } true;cstrlen_#in~str#1.base, cstrlen_#in~str#1.offset := cstrstr_~find#1.base, cstrstr_~find#1.offset;havoc cstrlen_#res#1;havoc cstrlen_#t~mem2#1, cstrlen_#t~pre3#1.base, cstrlen_#t~pre3#1.offset, cstrlen_~str#1.base, cstrlen_~str#1.offset, cstrlen_~s~0#1.base, cstrlen_~s~0#1.offset;cstrlen_~str#1.base, cstrlen_~str#1.offset := cstrlen_#in~str#1.base, cstrlen_#in~str#1.offset;havoc cstrlen_~s~0#1.base, cstrlen_~s~0#1.offset;cstrlen_~s~0#1.base, cstrlen_~s~0#1.offset := cstrlen_~str#1.base, cstrlen_~str#1.offset; 1903#L518-4 call cstrlen_#t~mem2#1 := read~int#0(cstrlen_~s~0#1.base, cstrlen_~s~0#1.offset, 1); 1904#L518-1 assume !!(0 != cstrlen_#t~mem2#1);havoc cstrlen_#t~mem2#1; 1922#L518-3 cstrlen_#t~pre3#1.base, cstrlen_#t~pre3#1.offset := cstrlen_~s~0#1.base, 1 + cstrlen_~s~0#1.offset;cstrlen_~s~0#1.base, cstrlen_~s~0#1.offset := cstrlen_~s~0#1.base, 1 + cstrlen_~s~0#1.offset;havoc cstrlen_#t~pre3#1.base, cstrlen_#t~pre3#1.offset; 1905#L518-4 call cstrlen_#t~mem2#1 := read~int#0(cstrlen_~s~0#1.base, cstrlen_~s~0#1.offset, 1); 1906#L518-1 assume !(0 != cstrlen_#t~mem2#1);havoc cstrlen_#t~mem2#1; 1890#L518-5 assume cstrlen_~s~0#1.base == cstrlen_~str#1.base;cstrlen_#res#1 := cstrlen_~s~0#1.offset - cstrlen_~str#1.offset; 1878#cstrlen_returnLabel#1 cstrstr_#t~ret15#1 := cstrlen_#res#1;havoc cstrlen_#t~mem2#1, cstrlen_#t~pre3#1.base, cstrlen_#t~pre3#1.offset, cstrlen_~str#1.base, cstrlen_~str#1.offset, cstrlen_~s~0#1.base, cstrlen_~s~0#1.offset;havoc cstrlen_#in~str#1.base, cstrlen_#in~str#1.offset;assume { :end_inline_cstrlen } true;cstrstr_~len~0#1 := cstrstr_#t~ret15#1;havoc cstrstr_#t~ret15#1; 1879#L542-4 goto; 1911#L543-2 cstrstr_#t~post16#1.base, cstrstr_#t~post16#1.offset := cstrstr_~s#1.base, cstrstr_~s#1.offset;cstrstr_~s#1.base, cstrstr_~s#1.offset := cstrstr_#t~post16#1.base, 1 + cstrstr_#t~post16#1.offset;call cstrstr_#t~mem17#1 := read~int#1(cstrstr_#t~post16#1.base, cstrstr_#t~post16#1.offset, 1);cstrstr_~sc~0#1 := cstrstr_#t~mem17#1; 1891#L544 assume !(0 == cstrstr_~sc~0#1);havoc cstrstr_#t~post16#1.base, cstrstr_#t~post16#1.offset;havoc cstrstr_#t~mem17#1; 1893#L543 assume !(cstrstr_~sc~0#1 != cstrstr_~c~0#1); 1913#L542-1 assume { :begin_inline_cstrncmp } true;cstrncmp_#in~s1#1.base, cstrncmp_#in~s1#1.offset, cstrncmp_#in~s2#1.base, cstrncmp_#in~s2#1.offset, cstrncmp_#in~n#1 := cstrstr_~s#1.base, cstrstr_~s#1.offset, cstrstr_~find#1.base, cstrstr_~find#1.offset, cstrstr_~len~0#1;havoc cstrncmp_#res#1;havoc cstrncmp_#t~mem5#1, cstrncmp_#t~post4#1.base, cstrncmp_#t~post4#1.offset, cstrncmp_#t~mem6#1, cstrncmp_#t~mem8#1, cstrncmp_#t~pre7#1.base, cstrncmp_#t~pre7#1.offset, cstrncmp_#t~mem9#1, cstrncmp_#t~post10#1.base, cstrncmp_#t~post10#1.offset, cstrncmp_#t~mem11#1, cstrncmp_#t~pre12#1, cstrncmp_~s1#1.base, cstrncmp_~s1#1.offset, cstrncmp_~s2#1.base, cstrncmp_~s2#1.offset, cstrncmp_~n#1;cstrncmp_~s1#1.base, cstrncmp_~s1#1.offset := cstrncmp_#in~s1#1.base, cstrncmp_#in~s1#1.offset;cstrncmp_~s2#1.base, cstrncmp_~s2#1.offset := cstrncmp_#in~s2#1.base, cstrncmp_#in~s2#1.offset;cstrncmp_~n#1 := cstrncmp_#in~n#1; 1880#L525 assume !(0 == cstrncmp_~n#1 % 4294967296); 1881#L527-4 [2024-10-15 00:22:33,879 INFO L747 eck$LassoCheckResult]: Loop: 1881#L527-4 call cstrncmp_#t~mem5#1 := read~int#1(cstrncmp_~s1#1.base, cstrncmp_~s1#1.offset, 1);cstrncmp_#t~post4#1.base, cstrncmp_#t~post4#1.offset := cstrncmp_~s2#1.base, cstrncmp_~s2#1.offset;cstrncmp_~s2#1.base, cstrncmp_~s2#1.offset := cstrncmp_#t~post4#1.base, 1 + cstrncmp_#t~post4#1.offset;call cstrncmp_#t~mem6#1 := read~int#0(cstrncmp_#t~post4#1.base, cstrncmp_#t~post4#1.offset, 1); 1901#L528 assume !(cstrncmp_#t~mem5#1 != cstrncmp_#t~mem6#1);havoc cstrncmp_#t~mem5#1;havoc cstrncmp_#t~post4#1.base, cstrncmp_#t~post4#1.offset;havoc cstrncmp_#t~mem6#1;cstrncmp_#t~post10#1.base, cstrncmp_#t~post10#1.offset := cstrncmp_~s1#1.base, cstrncmp_~s1#1.offset;cstrncmp_~s1#1.base, cstrncmp_~s1#1.offset := cstrncmp_#t~post10#1.base, 1 + cstrncmp_#t~post10#1.offset;call cstrncmp_#t~mem11#1 := read~int#1(cstrncmp_#t~post10#1.base, cstrncmp_#t~post10#1.offset, 1); 1898#L530 assume !(0 == cstrncmp_#t~mem11#1);havoc cstrncmp_#t~post10#1.base, cstrncmp_#t~post10#1.offset;havoc cstrncmp_#t~mem11#1; 1884#L527-1 cstrncmp_#t~pre12#1 := cstrncmp_~n#1 - 1;cstrncmp_~n#1 := cstrncmp_~n#1 - 1; 1885#L527-2 assume !!(0 != cstrncmp_#t~pre12#1 % 4294967296);havoc cstrncmp_#t~pre12#1; 1881#L527-4 [2024-10-15 00:22:33,879 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 00:22:33,879 INFO L85 PathProgramCache]: Analyzing trace with hash 577420407, now seen corresponding path program 1 times [2024-10-15 00:22:33,880 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-15 00:22:33,880 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1944136182] [2024-10-15 00:22:33,880 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-15 00:22:33,880 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-15 00:22:33,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-15 00:22:33,915 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-15 00:22:33,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-15 00:22:33,942 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-15 00:22:33,944 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 00:22:33,944 INFO L85 PathProgramCache]: Analyzing trace with hash 118492775, now seen corresponding path program 1 times [2024-10-15 00:22:33,945 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-15 00:22:33,945 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1978013691] [2024-10-15 00:22:33,945 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-15 00:22:33,945 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-15 00:22:33,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-15 00:22:33,952 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-15 00:22:33,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-15 00:22:33,958 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-15 00:22:33,959 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 00:22:33,959 INFO L85 PathProgramCache]: Analyzing trace with hash 1867951025, now seen corresponding path program 1 times [2024-10-15 00:22:33,959 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-15 00:22:33,959 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [572919059] [2024-10-15 00:22:33,960 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-15 00:22:33,960 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-15 00:22:33,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 00:22:34,165 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2024-10-15 00:22:34,165 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-15 00:22:34,166 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [572919059] [2024-10-15 00:22:34,166 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [572919059] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-15 00:22:34,166 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [527791799] [2024-10-15 00:22:34,166 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-15 00:22:34,166 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-15 00:22:34,166 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-15 00:22:34,168 INFO L229 MonitoredProcess]: Starting monitored process 82 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-15 00:22:34,170 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (82)] Waiting until timeout for monitored process [2024-10-15 00:22:34,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 00:22:34,297 INFO L255 TraceCheckSpWp]: Trace formula consists of 264 conjuncts, 85 conjuncts are in the unsatisfiable core [2024-10-15 00:22:34,302 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-15 00:22:34,394 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2024-10-15 00:22:34,397 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2024-10-15 00:22:34,590 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 8 [2024-10-15 00:22:34,622 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2024-10-15 00:22:34,622 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-15 00:22:34,833 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 18 [2024-10-15 00:22:34,838 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 26 [2024-10-15 00:22:34,953 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (81)] Ended with exit code 0 [2024-10-15 00:22:34,989 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2024-10-15 00:22:34,989 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [527791799] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-15 00:22:34,990 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-15 00:22:34,990 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 14, 14] total 29 [2024-10-15 00:22:34,990 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1938946778] [2024-10-15 00:22:34,990 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-15 00:22:35,191 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-15 00:22:35,191 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2024-10-15 00:22:35,192 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=81, Invalid=731, Unknown=0, NotChecked=0, Total=812 [2024-10-15 00:22:35,192 INFO L87 Difference]: Start difference. First operand 50 states and 56 transitions. cyclomatic complexity: 11 Second operand has 29 states, 29 states have (on average 2.8275862068965516) internal successors, (82), 29 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-15 00:22:35,812 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-15 00:22:35,812 INFO L93 Difference]: Finished difference Result 143 states and 157 transitions. [2024-10-15 00:22:35,812 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 143 states and 157 transitions. [2024-10-15 00:22:35,815 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2024-10-15 00:22:35,816 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 143 states to 92 states and 102 transitions. [2024-10-15 00:22:35,816 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 34 [2024-10-15 00:22:35,816 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 34 [2024-10-15 00:22:35,816 INFO L73 IsDeterministic]: Start isDeterministic. Operand 92 states and 102 transitions. [2024-10-15 00:22:35,817 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-10-15 00:22:35,817 INFO L218 hiAutomatonCegarLoop]: Abstraction has 92 states and 102 transitions. [2024-10-15 00:22:35,817 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states and 102 transitions. [2024-10-15 00:22:35,820 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 83. [2024-10-15 00:22:35,820 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 83 states, 83 states have (on average 1.1204819277108433) internal successors, (93), 82 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-15 00:22:35,821 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 93 transitions. [2024-10-15 00:22:35,821 INFO L240 hiAutomatonCegarLoop]: Abstraction has 83 states and 93 transitions. [2024-10-15 00:22:35,822 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2024-10-15 00:22:35,822 INFO L425 stractBuchiCegarLoop]: Abstraction has 83 states and 93 transitions. [2024-10-15 00:22:35,822 INFO L332 stractBuchiCegarLoop]: ======== Iteration 13 ============ [2024-10-15 00:22:35,823 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 83 states and 93 transitions. [2024-10-15 00:22:35,823 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2024-10-15 00:22:35,823 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-10-15 00:22:35,823 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-10-15 00:22:35,824 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-15 00:22:35,824 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2024-10-15 00:22:35,825 INFO L745 eck$LassoCheckResult]: Stem: 2403#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 2372#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet20#1, main_#t~nondet21#1, main_#t~malloc22#1.base, main_#t~malloc22#1.offset, main_#t~malloc23#1.base, main_#t~malloc23#1.offset, main_#t~nondet24#1, main_#t~post25#1, main_~i~0#1, main_#t~nondet26#1, main_#t~post27#1, main_~i~1#1, main_#t~ret28#1.base, main_#t~ret28#1.offset, main_~length1~0#1, main_~length2~0#1, main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset, main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset;havoc main_#t~nondet20#1;main_~length1~0#1 := main_#t~nondet20#1;havoc main_#t~nondet20#1;havoc main_#t~nondet21#1;main_~length2~0#1 := main_#t~nondet21#1;havoc main_#t~nondet21#1; 2373#L555 assume !(main_~length1~0#1 < 1); 2400#L555-2 assume !(main_~length2~0#1 < 1); 2367#L558-1 call main_#t~malloc22#1.base, main_#t~malloc22#1.offset := #Ultimate.allocOnStack(main_~length1~0#1 % 4294967296);main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset := main_#t~malloc22#1.base, main_#t~malloc22#1.offset;call main_#t~malloc23#1.base, main_#t~malloc23#1.offset := #Ultimate.allocOnStack(main_~length2~0#1 % 4294967296);main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset := main_#t~malloc23#1.base, main_#t~malloc23#1.offset;main_~i~0#1 := 0; 2368#L564-3 assume !!(main_~i~0#1 < main_~length1~0#1);havoc main_#t~nondet24#1;call write~int#1(main_#t~nondet24#1, main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset + main_~i~0#1, 1);havoc main_#t~nondet24#1; 2395#L564-2 main_#t~post25#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post25#1;havoc main_#t~post25#1; 2396#L564-3 assume !!(main_~i~0#1 < main_~length1~0#1);havoc main_#t~nondet24#1;call write~int#1(main_#t~nondet24#1, main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset + main_~i~0#1, 1);havoc main_#t~nondet24#1; 2405#L564-2 main_#t~post25#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post25#1;havoc main_#t~post25#1; 2439#L564-3 assume !!(main_~i~0#1 < main_~length1~0#1);havoc main_#t~nondet24#1;call write~int#1(main_#t~nondet24#1, main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset + main_~i~0#1, 1);havoc main_#t~nondet24#1; 2438#L564-2 main_#t~post25#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post25#1;havoc main_#t~post25#1; 2437#L564-3 assume !(main_~i~0#1 < main_~length1~0#1); 2436#L564-4 havoc main_~i~0#1;main_~i~1#1 := 0; 2435#L568-3 assume !!(main_~i~1#1 < main_~length2~0#1);havoc main_#t~nondet26#1;call write~int#0(main_#t~nondet26#1, main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset + main_~i~1#1, 1);havoc main_#t~nondet26#1; 2434#L568-2 main_#t~post27#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post27#1;havoc main_#t~post27#1; 2433#L568-3 assume !!(main_~i~1#1 < main_~length2~0#1);havoc main_#t~nondet26#1;call write~int#0(main_#t~nondet26#1, main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset + main_~i~1#1, 1);havoc main_#t~nondet26#1; 2432#L568-2 main_#t~post27#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post27#1;havoc main_#t~post27#1; 2430#L568-3 assume !!(main_~i~1#1 < main_~length2~0#1);havoc main_#t~nondet26#1;call write~int#0(main_#t~nondet26#1, main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset + main_~i~1#1, 1);havoc main_#t~nondet26#1; 2422#L568-2 main_#t~post27#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post27#1;havoc main_#t~post27#1; 2421#L568-3 assume !(main_~i~1#1 < main_~length2~0#1); 2397#L568-4 havoc main_~i~1#1;call write~int#1(0, main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset + (main_~length1~0#1 - 1), 1);call write~int#0(0, main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset + (main_~length2~0#1 - 1), 1);assume { :begin_inline_cstrstr } true;cstrstr_#in~s#1.base, cstrstr_#in~s#1.offset, cstrstr_#in~find#1.base, cstrstr_#in~find#1.offset := main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset, main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset;havoc cstrstr_#res#1.base, cstrstr_#res#1.offset;havoc cstrstr_#t~post13#1.base, cstrstr_#t~post13#1.offset, cstrstr_#t~mem14#1, cstrstr_#t~ret15#1, cstrstr_#t~post16#1.base, cstrstr_#t~post16#1.offset, cstrstr_#t~mem17#1, cstrstr_#t~ret18#1, cstrstr_#t~post19#1.base, cstrstr_#t~post19#1.offset, cstrstr_~s#1.base, cstrstr_~s#1.offset, cstrstr_~find#1.base, cstrstr_~find#1.offset, cstrstr_~c~0#1, cstrstr_~sc~0#1, cstrstr_~len~0#1;cstrstr_~s#1.base, cstrstr_~s#1.offset := cstrstr_#in~s#1.base, cstrstr_#in~s#1.offset;cstrstr_~find#1.base, cstrstr_~find#1.offset := cstrstr_#in~find#1.base, cstrstr_#in~find#1.offset;havoc cstrstr_~c~0#1;havoc cstrstr_~sc~0#1;havoc cstrstr_~len~0#1;cstrstr_#t~post13#1.base, cstrstr_#t~post13#1.offset := cstrstr_~find#1.base, cstrstr_~find#1.offset;cstrstr_~find#1.base, cstrstr_~find#1.offset := cstrstr_#t~post13#1.base, 1 + cstrstr_#t~post13#1.offset;call cstrstr_#t~mem14#1 := read~int#0(cstrstr_#t~post13#1.base, cstrstr_#t~post13#1.offset, 1);cstrstr_~c~0#1 := cstrstr_#t~mem14#1; 2398#L540 assume 0 != cstrstr_~c~0#1;havoc cstrstr_#t~post13#1.base, cstrstr_#t~post13#1.offset;havoc cstrstr_#t~mem14#1;assume { :begin_inline_cstrlen } true;cstrlen_#in~str#1.base, cstrlen_#in~str#1.offset := cstrstr_~find#1.base, cstrstr_~find#1.offset;havoc cstrlen_#res#1;havoc cstrlen_#t~mem2#1, cstrlen_#t~pre3#1.base, cstrlen_#t~pre3#1.offset, cstrlen_~str#1.base, cstrlen_~str#1.offset, cstrlen_~s~0#1.base, cstrlen_~s~0#1.offset;cstrlen_~str#1.base, cstrlen_~str#1.offset := cstrlen_#in~str#1.base, cstrlen_#in~str#1.offset;havoc cstrlen_~s~0#1.base, cstrlen_~s~0#1.offset;cstrlen_~s~0#1.base, cstrlen_~s~0#1.offset := cstrlen_~str#1.base, cstrlen_~str#1.offset; 2426#L518-4 call cstrlen_#t~mem2#1 := read~int#0(cstrlen_~s~0#1.base, cstrlen_~s~0#1.offset, 1); 2425#L518-1 assume !!(0 != cstrlen_#t~mem2#1);havoc cstrlen_#t~mem2#1; 2424#L518-3 cstrlen_#t~pre3#1.base, cstrlen_#t~pre3#1.offset := cstrlen_~s~0#1.base, 1 + cstrlen_~s~0#1.offset;cstrlen_~s~0#1.base, cstrlen_~s~0#1.offset := cstrlen_~s~0#1.base, 1 + cstrlen_~s~0#1.offset;havoc cstrlen_#t~pre3#1.base, cstrlen_#t~pre3#1.offset; 2423#L518-4 call cstrlen_#t~mem2#1 := read~int#0(cstrlen_~s~0#1.base, cstrlen_~s~0#1.offset, 1); 2418#L518-1 assume !!(0 != cstrlen_#t~mem2#1);havoc cstrlen_#t~mem2#1; 2419#L518-3 cstrlen_#t~pre3#1.base, cstrlen_#t~pre3#1.offset := cstrlen_~s~0#1.base, 1 + cstrlen_~s~0#1.offset;cstrlen_~s~0#1.base, cstrlen_~s~0#1.offset := cstrlen_~s~0#1.base, 1 + cstrlen_~s~0#1.offset;havoc cstrlen_#t~pre3#1.base, cstrlen_#t~pre3#1.offset; 2417#L518-4 call cstrlen_#t~mem2#1 := read~int#0(cstrlen_~s~0#1.base, cstrlen_~s~0#1.offset, 1); 2416#L518-1 assume !(0 != cstrlen_#t~mem2#1);havoc cstrlen_#t~mem2#1; 2415#L518-5 assume cstrlen_~s~0#1.base == cstrlen_~str#1.base;cstrlen_#res#1 := cstrlen_~s~0#1.offset - cstrlen_~str#1.offset; 2414#cstrlen_returnLabel#1 cstrstr_#t~ret15#1 := cstrlen_#res#1;havoc cstrlen_#t~mem2#1, cstrlen_#t~pre3#1.base, cstrlen_#t~pre3#1.offset, cstrlen_~str#1.base, cstrlen_~str#1.offset, cstrlen_~s~0#1.base, cstrlen_~s~0#1.offset;havoc cstrlen_#in~str#1.base, cstrlen_#in~str#1.offset;assume { :end_inline_cstrlen } true;cstrstr_~len~0#1 := cstrstr_#t~ret15#1;havoc cstrstr_#t~ret15#1; 2412#L542-4 goto; 2410#L543-2 cstrstr_#t~post16#1.base, cstrstr_#t~post16#1.offset := cstrstr_~s#1.base, cstrstr_~s#1.offset;cstrstr_~s#1.base, cstrstr_~s#1.offset := cstrstr_#t~post16#1.base, 1 + cstrstr_#t~post16#1.offset;call cstrstr_#t~mem17#1 := read~int#1(cstrstr_#t~post16#1.base, cstrstr_#t~post16#1.offset, 1);cstrstr_~sc~0#1 := cstrstr_#t~mem17#1; 2402#L544 assume !(0 == cstrstr_~sc~0#1);havoc cstrstr_#t~post16#1.base, cstrstr_#t~post16#1.offset;havoc cstrstr_#t~mem17#1; 2392#L543 assume !(cstrstr_~sc~0#1 != cstrstr_~c~0#1); 2393#L542-1 assume { :begin_inline_cstrncmp } true;cstrncmp_#in~s1#1.base, cstrncmp_#in~s1#1.offset, cstrncmp_#in~s2#1.base, cstrncmp_#in~s2#1.offset, cstrncmp_#in~n#1 := cstrstr_~s#1.base, cstrstr_~s#1.offset, cstrstr_~find#1.base, cstrstr_~find#1.offset, cstrstr_~len~0#1;havoc cstrncmp_#res#1;havoc cstrncmp_#t~mem5#1, cstrncmp_#t~post4#1.base, cstrncmp_#t~post4#1.offset, cstrncmp_#t~mem6#1, cstrncmp_#t~mem8#1, cstrncmp_#t~pre7#1.base, cstrncmp_#t~pre7#1.offset, cstrncmp_#t~mem9#1, cstrncmp_#t~post10#1.base, cstrncmp_#t~post10#1.offset, cstrncmp_#t~mem11#1, cstrncmp_#t~pre12#1, cstrncmp_~s1#1.base, cstrncmp_~s1#1.offset, cstrncmp_~s2#1.base, cstrncmp_~s2#1.offset, cstrncmp_~n#1;cstrncmp_~s1#1.base, cstrncmp_~s1#1.offset := cstrncmp_#in~s1#1.base, cstrncmp_#in~s1#1.offset;cstrncmp_~s2#1.base, cstrncmp_~s2#1.offset := cstrncmp_#in~s2#1.base, cstrncmp_#in~s2#1.offset;cstrncmp_~n#1 := cstrncmp_#in~n#1; 2357#L525 assume !(0 == cstrncmp_~n#1 % 4294967296); 2358#L527-4 [2024-10-15 00:22:35,825 INFO L747 eck$LassoCheckResult]: Loop: 2358#L527-4 call cstrncmp_#t~mem5#1 := read~int#1(cstrncmp_~s1#1.base, cstrncmp_~s1#1.offset, 1);cstrncmp_#t~post4#1.base, cstrncmp_#t~post4#1.offset := cstrncmp_~s2#1.base, cstrncmp_~s2#1.offset;cstrncmp_~s2#1.base, cstrncmp_~s2#1.offset := cstrncmp_#t~post4#1.base, 1 + cstrncmp_#t~post4#1.offset;call cstrncmp_#t~mem6#1 := read~int#0(cstrncmp_#t~post4#1.base, cstrncmp_#t~post4#1.offset, 1); 2379#L528 assume !(cstrncmp_#t~mem5#1 != cstrncmp_#t~mem6#1);havoc cstrncmp_#t~mem5#1;havoc cstrncmp_#t~post4#1.base, cstrncmp_#t~post4#1.offset;havoc cstrncmp_#t~mem6#1;cstrncmp_#t~post10#1.base, cstrncmp_#t~post10#1.offset := cstrncmp_~s1#1.base, cstrncmp_~s1#1.offset;cstrncmp_~s1#1.base, cstrncmp_~s1#1.offset := cstrncmp_#t~post10#1.base, 1 + cstrncmp_#t~post10#1.offset;call cstrncmp_#t~mem11#1 := read~int#1(cstrncmp_#t~post10#1.base, cstrncmp_#t~post10#1.offset, 1); 2376#L530 assume !(0 == cstrncmp_#t~mem11#1);havoc cstrncmp_#t~post10#1.base, cstrncmp_#t~post10#1.offset;havoc cstrncmp_#t~mem11#1; 2363#L527-1 cstrncmp_#t~pre12#1 := cstrncmp_~n#1 - 1;cstrncmp_~n#1 := cstrncmp_~n#1 - 1; 2364#L527-2 assume !!(0 != cstrncmp_#t~pre12#1 % 4294967296);havoc cstrncmp_#t~pre12#1; 2358#L527-4 [2024-10-15 00:22:35,825 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 00:22:35,826 INFO L85 PathProgramCache]: Analyzing trace with hash -1085107107, now seen corresponding path program 2 times [2024-10-15 00:22:35,826 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-15 00:22:35,826 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1572635908] [2024-10-15 00:22:35,826 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-15 00:22:35,826 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-15 00:22:35,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 00:22:36,413 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 7 proven. 9 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2024-10-15 00:22:36,413 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-15 00:22:36,414 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1572635908] [2024-10-15 00:22:36,414 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1572635908] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-15 00:22:36,414 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1954532382] [2024-10-15 00:22:36,414 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-10-15 00:22:36,414 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-15 00:22:36,414 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-15 00:22:36,416 INFO L229 MonitoredProcess]: Starting monitored process 83 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-15 00:22:36,417 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (83)] Waiting until timeout for monitored process [2024-10-15 00:22:36,551 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-10-15 00:22:36,552 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-15 00:22:36,555 INFO L255 TraceCheckSpWp]: Trace formula consists of 244 conjuncts, 44 conjuncts are in the unsatisfiable core [2024-10-15 00:22:36,557 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-15 00:22:36,669 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2024-10-15 00:22:36,759 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 5 proven. 11 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2024-10-15 00:22:36,759 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-15 00:22:36,778 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 13 [2024-10-15 00:22:36,780 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2024-10-15 00:22:36,850 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 5 proven. 11 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2024-10-15 00:22:36,851 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1954532382] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-15 00:22:36,851 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-15 00:22:36,851 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 12, 12] total 25 [2024-10-15 00:22:36,851 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1955498944] [2024-10-15 00:22:36,851 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-15 00:22:36,851 INFO L750 eck$LassoCheckResult]: stem already infeasible [2024-10-15 00:22:36,852 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 00:22:36,852 INFO L85 PathProgramCache]: Analyzing trace with hash 118492775, now seen corresponding path program 2 times [2024-10-15 00:22:36,852 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-15 00:22:36,852 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [708852209] [2024-10-15 00:22:36,852 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-15 00:22:36,852 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-15 00:22:36,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-15 00:22:36,862 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-15 00:22:36,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-15 00:22:36,870 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-15 00:22:37,054 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-15 00:22:37,055 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2024-10-15 00:22:37,056 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=538, Unknown=0, NotChecked=0, Total=600 [2024-10-15 00:22:37,056 INFO L87 Difference]: Start difference. First operand 83 states and 93 transitions. cyclomatic complexity: 17 Second operand has 25 states, 25 states have (on average 2.32) internal successors, (58), 25 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-15 00:22:37,549 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-15 00:22:37,549 INFO L93 Difference]: Finished difference Result 103 states and 113 transitions. [2024-10-15 00:22:37,549 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 103 states and 113 transitions. [2024-10-15 00:22:37,550 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2024-10-15 00:22:37,550 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 103 states to 89 states and 99 transitions. [2024-10-15 00:22:37,550 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 34 [2024-10-15 00:22:37,551 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 34 [2024-10-15 00:22:37,551 INFO L73 IsDeterministic]: Start isDeterministic. Operand 89 states and 99 transitions. [2024-10-15 00:22:37,551 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-10-15 00:22:37,551 INFO L218 hiAutomatonCegarLoop]: Abstraction has 89 states and 99 transitions. [2024-10-15 00:22:37,551 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states and 99 transitions. [2024-10-15 00:22:37,556 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 87. [2024-10-15 00:22:37,556 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 87 states, 87 states have (on average 1.1149425287356323) internal successors, (97), 86 states have internal predecessors, (97), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-15 00:22:37,557 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 97 transitions. [2024-10-15 00:22:37,557 INFO L240 hiAutomatonCegarLoop]: Abstraction has 87 states and 97 transitions. [2024-10-15 00:22:37,561 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-10-15 00:22:37,562 INFO L425 stractBuchiCegarLoop]: Abstraction has 87 states and 97 transitions. [2024-10-15 00:22:37,562 INFO L332 stractBuchiCegarLoop]: ======== Iteration 14 ============ [2024-10-15 00:22:37,562 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 87 states and 97 transitions. [2024-10-15 00:22:37,562 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2024-10-15 00:22:37,562 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-10-15 00:22:37,563 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-10-15 00:22:37,563 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [4, 4, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-15 00:22:37,563 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2024-10-15 00:22:37,564 INFO L745 eck$LassoCheckResult]: Stem: 2865#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 2832#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet20#1, main_#t~nondet21#1, main_#t~malloc22#1.base, main_#t~malloc22#1.offset, main_#t~malloc23#1.base, main_#t~malloc23#1.offset, main_#t~nondet24#1, main_#t~post25#1, main_~i~0#1, main_#t~nondet26#1, main_#t~post27#1, main_~i~1#1, main_#t~ret28#1.base, main_#t~ret28#1.offset, main_~length1~0#1, main_~length2~0#1, main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset, main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset;havoc main_#t~nondet20#1;main_~length1~0#1 := main_#t~nondet20#1;havoc main_#t~nondet20#1;havoc main_#t~nondet21#1;main_~length2~0#1 := main_#t~nondet21#1;havoc main_#t~nondet21#1; 2833#L555 assume !(main_~length1~0#1 < 1); 2862#L555-2 assume !(main_~length2~0#1 < 1); 2827#L558-1 call main_#t~malloc22#1.base, main_#t~malloc22#1.offset := #Ultimate.allocOnStack(main_~length1~0#1 % 4294967296);main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset := main_#t~malloc22#1.base, main_#t~malloc22#1.offset;call main_#t~malloc23#1.base, main_#t~malloc23#1.offset := #Ultimate.allocOnStack(main_~length2~0#1 % 4294967296);main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset := main_#t~malloc23#1.base, main_#t~malloc23#1.offset;main_~i~0#1 := 0; 2828#L564-3 assume !!(main_~i~0#1 < main_~length1~0#1);havoc main_#t~nondet24#1;call write~int#1(main_#t~nondet24#1, main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset + main_~i~0#1, 1);havoc main_#t~nondet24#1; 2856#L564-2 main_#t~post25#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post25#1;havoc main_#t~post25#1; 2857#L564-3 assume !!(main_~i~0#1 < main_~length1~0#1);havoc main_#t~nondet24#1;call write~int#1(main_#t~nondet24#1, main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset + main_~i~0#1, 1);havoc main_#t~nondet24#1; 2867#L564-2 main_#t~post25#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post25#1;havoc main_#t~post25#1; 2898#L564-3 assume !!(main_~i~0#1 < main_~length1~0#1);havoc main_#t~nondet24#1;call write~int#1(main_#t~nondet24#1, main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset + main_~i~0#1, 1);havoc main_#t~nondet24#1; 2899#L564-2 main_#t~post25#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post25#1;havoc main_#t~post25#1; 2900#L564-3 assume !(main_~i~0#1 < main_~length1~0#1); 2897#L564-4 havoc main_~i~0#1;main_~i~1#1 := 0; 2845#L568-3 assume !!(main_~i~1#1 < main_~length2~0#1);havoc main_#t~nondet26#1;call write~int#0(main_#t~nondet26#1, main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset + main_~i~1#1, 1);havoc main_#t~nondet26#1; 2846#L568-2 main_#t~post27#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post27#1;havoc main_#t~post27#1; 2847#L568-3 assume !!(main_~i~1#1 < main_~length2~0#1);havoc main_#t~nondet26#1;call write~int#0(main_#t~nondet26#1, main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset + main_~i~1#1, 1);havoc main_#t~nondet26#1; 2848#L568-2 main_#t~post27#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post27#1;havoc main_#t~post27#1; 2903#L568-3 assume !!(main_~i~1#1 < main_~length2~0#1);havoc main_#t~nondet26#1;call write~int#0(main_#t~nondet26#1, main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset + main_~i~1#1, 1);havoc main_#t~nondet26#1; 2902#L568-2 main_#t~post27#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post27#1;havoc main_#t~post27#1; 2901#L568-3 assume !!(main_~i~1#1 < main_~length2~0#1);havoc main_#t~nondet26#1;call write~int#0(main_#t~nondet26#1, main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset + main_~i~1#1, 1);havoc main_#t~nondet26#1; 2890#L568-2 main_#t~post27#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post27#1;havoc main_#t~post27#1; 2889#L568-3 assume !(main_~i~1#1 < main_~length2~0#1); 2858#L568-4 havoc main_~i~1#1;call write~int#1(0, main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset + (main_~length1~0#1 - 1), 1);call write~int#0(0, main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset + (main_~length2~0#1 - 1), 1);assume { :begin_inline_cstrstr } true;cstrstr_#in~s#1.base, cstrstr_#in~s#1.offset, cstrstr_#in~find#1.base, cstrstr_#in~find#1.offset := main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset, main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset;havoc cstrstr_#res#1.base, cstrstr_#res#1.offset;havoc cstrstr_#t~post13#1.base, cstrstr_#t~post13#1.offset, cstrstr_#t~mem14#1, cstrstr_#t~ret15#1, cstrstr_#t~post16#1.base, cstrstr_#t~post16#1.offset, cstrstr_#t~mem17#1, cstrstr_#t~ret18#1, cstrstr_#t~post19#1.base, cstrstr_#t~post19#1.offset, cstrstr_~s#1.base, cstrstr_~s#1.offset, cstrstr_~find#1.base, cstrstr_~find#1.offset, cstrstr_~c~0#1, cstrstr_~sc~0#1, cstrstr_~len~0#1;cstrstr_~s#1.base, cstrstr_~s#1.offset := cstrstr_#in~s#1.base, cstrstr_#in~s#1.offset;cstrstr_~find#1.base, cstrstr_~find#1.offset := cstrstr_#in~find#1.base, cstrstr_#in~find#1.offset;havoc cstrstr_~c~0#1;havoc cstrstr_~sc~0#1;havoc cstrstr_~len~0#1;cstrstr_#t~post13#1.base, cstrstr_#t~post13#1.offset := cstrstr_~find#1.base, cstrstr_~find#1.offset;cstrstr_~find#1.base, cstrstr_~find#1.offset := cstrstr_#t~post13#1.base, 1 + cstrstr_#t~post13#1.offset;call cstrstr_#t~mem14#1 := read~int#0(cstrstr_#t~post13#1.base, cstrstr_#t~post13#1.offset, 1);cstrstr_~c~0#1 := cstrstr_#t~mem14#1; 2859#L540 assume 0 != cstrstr_~c~0#1;havoc cstrstr_#t~post13#1.base, cstrstr_#t~post13#1.offset;havoc cstrstr_#t~mem14#1;assume { :begin_inline_cstrlen } true;cstrlen_#in~str#1.base, cstrlen_#in~str#1.offset := cstrstr_~find#1.base, cstrstr_~find#1.offset;havoc cstrlen_#res#1;havoc cstrlen_#t~mem2#1, cstrlen_#t~pre3#1.base, cstrlen_#t~pre3#1.offset, cstrlen_~str#1.base, cstrlen_~str#1.offset, cstrlen_~s~0#1.base, cstrlen_~s~0#1.offset;cstrlen_~str#1.base, cstrlen_~str#1.offset := cstrlen_#in~str#1.base, cstrlen_#in~str#1.offset;havoc cstrlen_~s~0#1.base, cstrlen_~s~0#1.offset;cstrlen_~s~0#1.base, cstrlen_~s~0#1.offset := cstrlen_~str#1.base, cstrlen_~str#1.offset; 2885#L518-4 call cstrlen_#t~mem2#1 := read~int#0(cstrlen_~s~0#1.base, cstrlen_~s~0#1.offset, 1); 2884#L518-1 assume !!(0 != cstrlen_#t~mem2#1);havoc cstrlen_#t~mem2#1; 2883#L518-3 cstrlen_#t~pre3#1.base, cstrlen_#t~pre3#1.offset := cstrlen_~s~0#1.base, 1 + cstrlen_~s~0#1.offset;cstrlen_~s~0#1.base, cstrlen_~s~0#1.offset := cstrlen_~s~0#1.base, 1 + cstrlen_~s~0#1.offset;havoc cstrlen_#t~pre3#1.base, cstrlen_#t~pre3#1.offset; 2882#L518-4 call cstrlen_#t~mem2#1 := read~int#0(cstrlen_~s~0#1.base, cstrlen_~s~0#1.offset, 1); 2878#L518-1 assume !!(0 != cstrlen_#t~mem2#1);havoc cstrlen_#t~mem2#1; 2879#L518-3 cstrlen_#t~pre3#1.base, cstrlen_#t~pre3#1.offset := cstrlen_~s~0#1.base, 1 + cstrlen_~s~0#1.offset;cstrlen_~s~0#1.base, cstrlen_~s~0#1.offset := cstrlen_~s~0#1.base, 1 + cstrlen_~s~0#1.offset;havoc cstrlen_#t~pre3#1.base, cstrlen_#t~pre3#1.offset; 2877#L518-4 call cstrlen_#t~mem2#1 := read~int#0(cstrlen_~s~0#1.base, cstrlen_~s~0#1.offset, 1); 2876#L518-1 assume !(0 != cstrlen_#t~mem2#1);havoc cstrlen_#t~mem2#1; 2874#L518-5 assume cstrlen_~s~0#1.base == cstrlen_~str#1.base;cstrlen_#res#1 := cstrlen_~s~0#1.offset - cstrlen_~str#1.offset; 2872#cstrlen_returnLabel#1 cstrstr_#t~ret15#1 := cstrlen_#res#1;havoc cstrlen_#t~mem2#1, cstrlen_#t~pre3#1.base, cstrlen_#t~pre3#1.offset, cstrlen_~str#1.base, cstrlen_~str#1.offset, cstrlen_~s~0#1.base, cstrlen_~s~0#1.offset;havoc cstrlen_#in~str#1.base, cstrlen_#in~str#1.offset;assume { :end_inline_cstrlen } true;cstrstr_~len~0#1 := cstrstr_#t~ret15#1;havoc cstrstr_#t~ret15#1; 2870#L542-4 goto; 2869#L543-2 cstrstr_#t~post16#1.base, cstrstr_#t~post16#1.offset := cstrstr_~s#1.base, cstrstr_~s#1.offset;cstrstr_~s#1.base, cstrstr_~s#1.offset := cstrstr_#t~post16#1.base, 1 + cstrstr_#t~post16#1.offset;call cstrstr_#t~mem17#1 := read~int#1(cstrstr_#t~post16#1.base, cstrstr_#t~post16#1.offset, 1);cstrstr_~sc~0#1 := cstrstr_#t~mem17#1; 2864#L544 assume !(0 == cstrstr_~sc~0#1);havoc cstrstr_#t~post16#1.base, cstrstr_#t~post16#1.offset;havoc cstrstr_#t~mem17#1; 2851#L543 assume !(cstrstr_~sc~0#1 != cstrstr_~c~0#1); 2852#L542-1 assume { :begin_inline_cstrncmp } true;cstrncmp_#in~s1#1.base, cstrncmp_#in~s1#1.offset, cstrncmp_#in~s2#1.base, cstrncmp_#in~s2#1.offset, cstrncmp_#in~n#1 := cstrstr_~s#1.base, cstrstr_~s#1.offset, cstrstr_~find#1.base, cstrstr_~find#1.offset, cstrstr_~len~0#1;havoc cstrncmp_#res#1;havoc cstrncmp_#t~mem5#1, cstrncmp_#t~post4#1.base, cstrncmp_#t~post4#1.offset, cstrncmp_#t~mem6#1, cstrncmp_#t~mem8#1, cstrncmp_#t~pre7#1.base, cstrncmp_#t~pre7#1.offset, cstrncmp_#t~mem9#1, cstrncmp_#t~post10#1.base, cstrncmp_#t~post10#1.offset, cstrncmp_#t~mem11#1, cstrncmp_#t~pre12#1, cstrncmp_~s1#1.base, cstrncmp_~s1#1.offset, cstrncmp_~s2#1.base, cstrncmp_~s2#1.offset, cstrncmp_~n#1;cstrncmp_~s1#1.base, cstrncmp_~s1#1.offset := cstrncmp_#in~s1#1.base, cstrncmp_#in~s1#1.offset;cstrncmp_~s2#1.base, cstrncmp_~s2#1.offset := cstrncmp_#in~s2#1.base, cstrncmp_#in~s2#1.offset;cstrncmp_~n#1 := cstrncmp_#in~n#1; 2819#L525 assume !(0 == cstrncmp_~n#1 % 4294967296); 2820#L527-4 [2024-10-15 00:22:37,564 INFO L747 eck$LassoCheckResult]: Loop: 2820#L527-4 call cstrncmp_#t~mem5#1 := read~int#1(cstrncmp_~s1#1.base, cstrncmp_~s1#1.offset, 1);cstrncmp_#t~post4#1.base, cstrncmp_#t~post4#1.offset := cstrncmp_~s2#1.base, cstrncmp_~s2#1.offset;cstrncmp_~s2#1.base, cstrncmp_~s2#1.offset := cstrncmp_#t~post4#1.base, 1 + cstrncmp_#t~post4#1.offset;call cstrncmp_#t~mem6#1 := read~int#0(cstrncmp_#t~post4#1.base, cstrncmp_#t~post4#1.offset, 1); 2839#L528 assume !(cstrncmp_#t~mem5#1 != cstrncmp_#t~mem6#1);havoc cstrncmp_#t~mem5#1;havoc cstrncmp_#t~post4#1.base, cstrncmp_#t~post4#1.offset;havoc cstrncmp_#t~mem6#1;cstrncmp_#t~post10#1.base, cstrncmp_#t~post10#1.offset := cstrncmp_~s1#1.base, cstrncmp_~s1#1.offset;cstrncmp_~s1#1.base, cstrncmp_~s1#1.offset := cstrncmp_#t~post10#1.base, 1 + cstrncmp_#t~post10#1.offset;call cstrncmp_#t~mem11#1 := read~int#1(cstrncmp_#t~post10#1.base, cstrncmp_#t~post10#1.offset, 1); 2836#L530 assume !(0 == cstrncmp_#t~mem11#1);havoc cstrncmp_#t~post10#1.base, cstrncmp_#t~post10#1.offset;havoc cstrncmp_#t~mem11#1; 2823#L527-1 cstrncmp_#t~pre12#1 := cstrncmp_~n#1 - 1;cstrncmp_~n#1 := cstrncmp_~n#1 - 1; 2824#L527-2 assume !!(0 != cstrncmp_#t~pre12#1 % 4294967296);havoc cstrncmp_#t~pre12#1; 2820#L527-4 [2024-10-15 00:22:37,564 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 00:22:37,564 INFO L85 PathProgramCache]: Analyzing trace with hash -1202872581, now seen corresponding path program 3 times [2024-10-15 00:22:37,564 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-15 00:22:37,565 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1378295213] [2024-10-15 00:22:37,565 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-15 00:22:37,565 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-15 00:22:37,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-15 00:22:37,591 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-15 00:22:37,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-15 00:22:37,615 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-15 00:22:37,615 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 00:22:37,616 INFO L85 PathProgramCache]: Analyzing trace with hash 118492775, now seen corresponding path program 3 times [2024-10-15 00:22:37,616 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-15 00:22:37,616 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [673265171] [2024-10-15 00:22:37,616 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-15 00:22:37,616 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-15 00:22:37,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-15 00:22:37,623 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-15 00:22:37,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-15 00:22:37,627 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-15 00:22:37,628 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 00:22:37,628 INFO L85 PathProgramCache]: Analyzing trace with hash -1087325267, now seen corresponding path program 2 times [2024-10-15 00:22:37,628 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-15 00:22:37,629 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1735736681] [2024-10-15 00:22:37,629 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-15 00:22:37,629 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-15 00:22:37,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-15 00:22:37,658 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-15 00:22:37,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-15 00:22:37,682 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-15 00:22:43,254 WARN L286 SmtUtils]: Spent 5.39s on a formula simplification. DAG size of input: 320 DAG size of output: 249 (called from [L 275] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.TransFormulaUtils.sequentialComposition) [2024-10-15 00:22:43,658 INFO L204 LassoAnalysis]: Preferences: [2024-10-15 00:22:43,658 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2024-10-15 00:22:43,658 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-10-15 00:22:43,658 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2024-10-15 00:22:43,658 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2024-10-15 00:22:43,658 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-15 00:22:43,658 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2024-10-15 00:22:43,658 INFO L131 ssoRankerPreferences]: Path of dumped script: [2024-10-15 00:22:43,658 INFO L132 ssoRankerPreferences]: Filename of dumped script: openbsd_cstrstr-alloca-2.i_Iteration14_Lasso [2024-10-15 00:22:43,658 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2024-10-15 00:22:43,658 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2024-10-15 00:22:43,664 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-15 00:22:44,215 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-15 00:22:44,217 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-15 00:22:44,218 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-15 00:22:44,221 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-15 00:22:44,222 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-15 00:22:44,233 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-15 00:22:44,235 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-15 00:22:44,238 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-15 00:22:44,239 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-15 00:22:44,241 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-15 00:22:44,242 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-15 00:22:44,244 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-15 00:22:44,245 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-15 00:22:44,247 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-15 00:22:44,248 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-15 00:22:44,250 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-15 00:22:44,251 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-15 00:22:44,252 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-15 00:22:44,259 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-15 00:22:44,261 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-15 00:22:44,263 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-15 00:22:44,265 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-15 00:22:44,266 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-15 00:22:44,268 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-15 00:22:44,270 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-15 00:22:44,271 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-15 00:22:44,274 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-15 00:22:44,276 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-15 00:22:44,277 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-15 00:22:44,279 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-15 00:22:44,284 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-15 00:22:44,286 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-15 00:22:44,287 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-15 00:22:44,289 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-15 00:22:44,290 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-15 00:22:44,291 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-15 00:22:44,293 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-15 00:22:44,294 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-15 00:22:44,297 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-15 00:22:44,299 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-15 00:22:44,301 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-15 00:22:44,303 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-15 00:22:44,305 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-15 00:22:44,307 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-15 00:22:44,309 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-15 00:22:44,311 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-15 00:22:44,313 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-15 00:22:44,315 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-15 00:22:44,317 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-15 00:22:44,318 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-15 00:22:44,321 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-15 00:22:44,323 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-15 00:22:44,324 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-15 00:22:44,325 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-15 00:22:44,327 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-15 00:22:44,329 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-15 00:22:44,330 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-15 00:22:44,332 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-15 00:22:44,334 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-15 00:22:44,336 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-15 00:22:44,338 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-15 00:22:44,854 INFO L259 LassoAnalysis]: Preprocessing complete. [2024-10-15 00:22:44,854 INFO L451 LassoAnalysis]: Using template 'affine'. [2024-10-15 00:22:44,855 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-15 00:22:44,855 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-15 00:22:44,860 INFO L229 MonitoredProcess]: Starting monitored process 84 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-15 00:22:44,861 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (84)] Waiting until timeout for monitored process [2024-10-15 00:22:44,862 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-10-15 00:22:44,873 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-15 00:22:44,874 INFO L203 nArgumentSynthesizer]: 2 stem disjuncts [2024-10-15 00:22:44,874 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-15 00:22:44,874 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-15 00:22:44,875 INFO L401 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2024-10-15 00:22:44,875 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-10-15 00:22:44,879 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-15 00:22:44,889 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (84)] Forceful destruction successful, exit code 0 [2024-10-15 00:22:44,890 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-15 00:22:44,890 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-15 00:22:44,891 INFO L229 MonitoredProcess]: Starting monitored process 85 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-15 00:22:44,892 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (85)] Waiting until timeout for monitored process [2024-10-15 00:22:44,893 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-10-15 00:22:44,903 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-15 00:22:44,903 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-15 00:22:44,903 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-15 00:22:44,903 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-15 00:22:44,908 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-10-15 00:22:44,908 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-10-15 00:22:44,916 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-15 00:22:44,927 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (85)] Ended with exit code 0 [2024-10-15 00:22:44,927 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-15 00:22:44,927 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-15 00:22:44,928 INFO L229 MonitoredProcess]: Starting monitored process 86 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-15 00:22:44,930 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (86)] Waiting until timeout for monitored process [2024-10-15 00:22:44,930 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-10-15 00:22:44,941 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-15 00:22:44,941 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-15 00:22:44,942 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-15 00:22:44,942 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-15 00:22:44,943 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-10-15 00:22:44,943 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-10-15 00:22:44,946 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-15 00:22:44,957 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (86)] Ended with exit code 0 [2024-10-15 00:22:44,957 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-15 00:22:44,957 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-15 00:22:44,958 INFO L229 MonitoredProcess]: Starting monitored process 87 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-15 00:22:44,959 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (87)] Waiting until timeout for monitored process [2024-10-15 00:22:44,960 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-10-15 00:22:44,971 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-15 00:22:44,971 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-15 00:22:44,971 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-15 00:22:44,971 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-15 00:22:44,974 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-10-15 00:22:44,974 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-10-15 00:22:44,981 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2024-10-15 00:22:44,991 INFO L443 ModelExtractionUtils]: Simplification made 8 calls to the SMT solver. [2024-10-15 00:22:44,991 INFO L444 ModelExtractionUtils]: 4 out of 13 variables were initially zero. Simplification set additionally 6 variables to zero. [2024-10-15 00:22:44,992 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-15 00:22:44,992 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-15 00:22:44,993 INFO L229 MonitoredProcess]: Starting monitored process 88 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-15 00:22:44,994 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (88)] Waiting until timeout for monitored process [2024-10-15 00:22:44,994 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2024-10-15 00:22:45,005 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2024-10-15 00:22:45,006 INFO L474 LassoAnalysis]: Proved termination. [2024-10-15 00:22:45,006 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_cstrncmp_~s1#1.offset, v_rep(select #length ULTIMATE.start_main_#t~malloc22#1.base)_5) = -1*ULTIMATE.start_cstrncmp_~s1#1.offset + 1*v_rep(select #length ULTIMATE.start_main_#t~malloc22#1.base)_5 Supporting invariants [] [2024-10-15 00:22:45,017 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (87)] Ended with exit code 0 [2024-10-15 00:22:45,056 INFO L156 tatePredicateManager]: 15 out of 16 supporting invariants were superfluous and have been removed [2024-10-15 00:22:45,059 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~s1!offset [2024-10-15 00:22:45,059 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #length [2024-10-15 00:22:45,059 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#length,GLOBAL] [2024-10-15 00:22:45,085 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 00:22:45,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 00:22:45,142 INFO L255 TraceCheckSpWp]: Trace formula consists of 255 conjuncts, 16 conjuncts are in the unsatisfiable core [2024-10-15 00:22:45,145 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-15 00:22:45,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 00:22:45,297 INFO L255 TraceCheckSpWp]: Trace formula consists of 46 conjuncts, 11 conjuncts are in the unsatisfiable core [2024-10-15 00:22:45,298 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-15 00:22:45,342 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-15 00:22:45,343 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.4 stem predicates 2 loop predicates [2024-10-15 00:22:45,343 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 87 states and 97 transitions. cyclomatic complexity: 17 Second operand has 7 states, 7 states have (on average 4.428571428571429) internal successors, (31), 7 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-15 00:22:45,407 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 87 states and 97 transitions. cyclomatic complexity: 17. Second operand has 7 states, 7 states have (on average 4.428571428571429) internal successors, (31), 7 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 117 states and 131 transitions. Complement of second has 8 states. [2024-10-15 00:22:45,410 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 6 states 4 stem states 1 non-accepting loop states 1 accepting loop states [2024-10-15 00:22:45,411 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 4.428571428571429) internal successors, (31), 7 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-15 00:22:45,411 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 33 transitions. [2024-10-15 00:22:45,411 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 33 transitions. Stem has 40 letters. Loop has 5 letters. [2024-10-15 00:22:45,411 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-10-15 00:22:45,411 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 33 transitions. Stem has 45 letters. Loop has 5 letters. [2024-10-15 00:22:45,412 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-10-15 00:22:45,412 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 33 transitions. Stem has 40 letters. Loop has 10 letters. [2024-10-15 00:22:45,412 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-10-15 00:22:45,412 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 117 states and 131 transitions. [2024-10-15 00:22:45,413 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2024-10-15 00:22:45,416 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 117 states to 102 states and 115 transitions. [2024-10-15 00:22:45,417 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 34 [2024-10-15 00:22:45,417 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 34 [2024-10-15 00:22:45,417 INFO L73 IsDeterministic]: Start isDeterministic. Operand 102 states and 115 transitions. [2024-10-15 00:22:45,417 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-10-15 00:22:45,417 INFO L218 hiAutomatonCegarLoop]: Abstraction has 102 states and 115 transitions. [2024-10-15 00:22:45,418 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states and 115 transitions. [2024-10-15 00:22:45,420 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 100. [2024-10-15 00:22:45,423 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 100 states, 100 states have (on average 1.13) internal successors, (113), 99 states have internal predecessors, (113), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-15 00:22:45,424 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 113 transitions. [2024-10-15 00:22:45,424 INFO L240 hiAutomatonCegarLoop]: Abstraction has 100 states and 113 transitions. [2024-10-15 00:22:45,424 INFO L425 stractBuchiCegarLoop]: Abstraction has 100 states and 113 transitions. [2024-10-15 00:22:45,424 INFO L332 stractBuchiCegarLoop]: ======== Iteration 15 ============ [2024-10-15 00:22:45,424 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 100 states and 113 transitions. [2024-10-15 00:22:45,424 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2024-10-15 00:22:45,424 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-10-15 00:22:45,424 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-10-15 00:22:45,425 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [4, 4, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-15 00:22:45,425 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2024-10-15 00:22:45,425 INFO L745 eck$LassoCheckResult]: Stem: 3308#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 3270#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet20#1, main_#t~nondet21#1, main_#t~malloc22#1.base, main_#t~malloc22#1.offset, main_#t~malloc23#1.base, main_#t~malloc23#1.offset, main_#t~nondet24#1, main_#t~post25#1, main_~i~0#1, main_#t~nondet26#1, main_#t~post27#1, main_~i~1#1, main_#t~ret28#1.base, main_#t~ret28#1.offset, main_~length1~0#1, main_~length2~0#1, main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset, main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset;havoc main_#t~nondet20#1;main_~length1~0#1 := main_#t~nondet20#1;havoc main_#t~nondet20#1;havoc main_#t~nondet21#1;main_~length2~0#1 := main_#t~nondet21#1;havoc main_#t~nondet21#1; 3271#L555 assume !(main_~length1~0#1 < 1); 3303#L555-2 assume !(main_~length2~0#1 < 1); 3264#L558-1 call main_#t~malloc22#1.base, main_#t~malloc22#1.offset := #Ultimate.allocOnStack(main_~length1~0#1 % 4294967296);main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset := main_#t~malloc22#1.base, main_#t~malloc22#1.offset;call main_#t~malloc23#1.base, main_#t~malloc23#1.offset := #Ultimate.allocOnStack(main_~length2~0#1 % 4294967296);main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset := main_#t~malloc23#1.base, main_#t~malloc23#1.offset;main_~i~0#1 := 0; 3265#L564-3 assume !!(main_~i~0#1 < main_~length1~0#1);havoc main_#t~nondet24#1;call write~int#1(main_#t~nondet24#1, main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset + main_~i~0#1, 1);havoc main_#t~nondet24#1; 3298#L564-2 main_#t~post25#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post25#1;havoc main_#t~post25#1; 3299#L564-3 assume !!(main_~i~0#1 < main_~length1~0#1);havoc main_#t~nondet24#1;call write~int#1(main_#t~nondet24#1, main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset + main_~i~0#1, 1);havoc main_#t~nondet24#1; 3311#L564-2 main_#t~post25#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post25#1;havoc main_#t~post25#1; 3349#L564-3 assume !(main_~i~0#1 < main_~length1~0#1); 3302#L564-4 havoc main_~i~0#1;main_~i~1#1 := 0; 3285#L568-3 assume !!(main_~i~1#1 < main_~length2~0#1);havoc main_#t~nondet26#1;call write~int#0(main_#t~nondet26#1, main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset + main_~i~1#1, 1);havoc main_#t~nondet26#1; 3286#L568-2 main_#t~post27#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post27#1;havoc main_#t~post27#1; 3287#L568-3 assume !!(main_~i~1#1 < main_~length2~0#1);havoc main_#t~nondet26#1;call write~int#0(main_#t~nondet26#1, main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset + main_~i~1#1, 1);havoc main_#t~nondet26#1; 3288#L568-2 main_#t~post27#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post27#1;havoc main_#t~post27#1; 3342#L568-3 assume !!(main_~i~1#1 < main_~length2~0#1);havoc main_#t~nondet26#1;call write~int#0(main_#t~nondet26#1, main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset + main_~i~1#1, 1);havoc main_#t~nondet26#1; 3328#L568-2 main_#t~post27#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post27#1;havoc main_#t~post27#1; 3329#L568-3 assume !!(main_~i~1#1 < main_~length2~0#1);havoc main_#t~nondet26#1;call write~int#0(main_#t~nondet26#1, main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset + main_~i~1#1, 1);havoc main_#t~nondet26#1; 3325#L568-2 main_#t~post27#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post27#1;havoc main_#t~post27#1; 3326#L568-3 assume !(main_~i~1#1 < main_~length2~0#1); 3300#L568-4 havoc main_~i~1#1;call write~int#1(0, main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset + (main_~length1~0#1 - 1), 1);call write~int#0(0, main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset + (main_~length2~0#1 - 1), 1);assume { :begin_inline_cstrstr } true;cstrstr_#in~s#1.base, cstrstr_#in~s#1.offset, cstrstr_#in~find#1.base, cstrstr_#in~find#1.offset := main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset, main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset;havoc cstrstr_#res#1.base, cstrstr_#res#1.offset;havoc cstrstr_#t~post13#1.base, cstrstr_#t~post13#1.offset, cstrstr_#t~mem14#1, cstrstr_#t~ret15#1, cstrstr_#t~post16#1.base, cstrstr_#t~post16#1.offset, cstrstr_#t~mem17#1, cstrstr_#t~ret18#1, cstrstr_#t~post19#1.base, cstrstr_#t~post19#1.offset, cstrstr_~s#1.base, cstrstr_~s#1.offset, cstrstr_~find#1.base, cstrstr_~find#1.offset, cstrstr_~c~0#1, cstrstr_~sc~0#1, cstrstr_~len~0#1;cstrstr_~s#1.base, cstrstr_~s#1.offset := cstrstr_#in~s#1.base, cstrstr_#in~s#1.offset;cstrstr_~find#1.base, cstrstr_~find#1.offset := cstrstr_#in~find#1.base, cstrstr_#in~find#1.offset;havoc cstrstr_~c~0#1;havoc cstrstr_~sc~0#1;havoc cstrstr_~len~0#1;cstrstr_#t~post13#1.base, cstrstr_#t~post13#1.offset := cstrstr_~find#1.base, cstrstr_~find#1.offset;cstrstr_~find#1.base, cstrstr_~find#1.offset := cstrstr_#t~post13#1.base, 1 + cstrstr_#t~post13#1.offset;call cstrstr_#t~mem14#1 := read~int#0(cstrstr_#t~post13#1.base, cstrstr_#t~post13#1.offset, 1);cstrstr_~c~0#1 := cstrstr_#t~mem14#1; 3301#L540 assume 0 != cstrstr_~c~0#1;havoc cstrstr_#t~post13#1.base, cstrstr_#t~post13#1.offset;havoc cstrstr_#t~mem14#1;assume { :begin_inline_cstrlen } true;cstrlen_#in~str#1.base, cstrlen_#in~str#1.offset := cstrstr_~find#1.base, cstrstr_~find#1.offset;havoc cstrlen_#res#1;havoc cstrlen_#t~mem2#1, cstrlen_#t~pre3#1.base, cstrlen_#t~pre3#1.offset, cstrlen_~str#1.base, cstrlen_~str#1.offset, cstrlen_~s~0#1.base, cstrlen_~s~0#1.offset;cstrlen_~str#1.base, cstrlen_~str#1.offset := cstrlen_#in~str#1.base, cstrlen_#in~str#1.offset;havoc cstrlen_~s~0#1.base, cstrlen_~s~0#1.offset;cstrlen_~s~0#1.base, cstrlen_~s~0#1.offset := cstrlen_~str#1.base, cstrlen_~str#1.offset; 3281#L518-4 call cstrlen_#t~mem2#1 := read~int#0(cstrlen_~s~0#1.base, cstrlen_~s~0#1.offset, 1); 3282#L518-1 assume !!(0 != cstrlen_#t~mem2#1);havoc cstrlen_#t~mem2#1; 3309#L518-3 cstrlen_#t~pre3#1.base, cstrlen_#t~pre3#1.offset := cstrlen_~s~0#1.base, 1 + cstrlen_~s~0#1.offset;cstrlen_~s~0#1.base, cstrlen_~s~0#1.offset := cstrlen_~s~0#1.base, 1 + cstrlen_~s~0#1.offset;havoc cstrlen_#t~pre3#1.base, cstrlen_#t~pre3#1.offset; 3310#L518-4 call cstrlen_#t~mem2#1 := read~int#0(cstrlen_~s~0#1.base, cstrlen_~s~0#1.offset, 1); 3323#L518-1 assume !!(0 != cstrlen_#t~mem2#1);havoc cstrlen_#t~mem2#1; 3336#L518-3 cstrlen_#t~pre3#1.base, cstrlen_#t~pre3#1.offset := cstrlen_~s~0#1.base, 1 + cstrlen_~s~0#1.offset;cstrlen_~s~0#1.base, cstrlen_~s~0#1.offset := cstrlen_~s~0#1.base, 1 + cstrlen_~s~0#1.offset;havoc cstrlen_#t~pre3#1.base, cstrlen_#t~pre3#1.offset; 3321#L518-4 call cstrlen_#t~mem2#1 := read~int#0(cstrlen_~s~0#1.base, cstrlen_~s~0#1.offset, 1); 3322#L518-1 assume !(0 != cstrlen_#t~mem2#1);havoc cstrlen_#t~mem2#1; 3335#L518-5 assume cstrlen_~s~0#1.base == cstrlen_~str#1.base;cstrlen_#res#1 := cstrlen_~s~0#1.offset - cstrlen_~str#1.offset; 3254#cstrlen_returnLabel#1 cstrstr_#t~ret15#1 := cstrlen_#res#1;havoc cstrlen_#t~mem2#1, cstrlen_#t~pre3#1.base, cstrlen_#t~pre3#1.offset, cstrlen_~str#1.base, cstrlen_~str#1.offset, cstrlen_~s~0#1.base, cstrlen_~s~0#1.offset;havoc cstrlen_#in~str#1.base, cstrlen_#in~str#1.offset;assume { :end_inline_cstrlen } true;cstrstr_~len~0#1 := cstrstr_#t~ret15#1;havoc cstrstr_#t~ret15#1; 3255#L542-4 goto; 3306#L543-2 cstrstr_#t~post16#1.base, cstrstr_#t~post16#1.offset := cstrstr_~s#1.base, cstrstr_~s#1.offset;cstrstr_~s#1.base, cstrstr_~s#1.offset := cstrstr_#t~post16#1.base, 1 + cstrstr_#t~post16#1.offset;call cstrstr_#t~mem17#1 := read~int#1(cstrstr_#t~post16#1.base, cstrstr_#t~post16#1.offset, 1);cstrstr_~sc~0#1 := cstrstr_#t~mem17#1; 3307#L544 assume !(0 == cstrstr_~sc~0#1);havoc cstrstr_#t~post16#1.base, cstrstr_#t~post16#1.offset;havoc cstrstr_#t~mem17#1; 3294#L543 assume !(cstrstr_~sc~0#1 != cstrstr_~c~0#1); 3296#L542-1 assume { :begin_inline_cstrncmp } true;cstrncmp_#in~s1#1.base, cstrncmp_#in~s1#1.offset, cstrncmp_#in~s2#1.base, cstrncmp_#in~s2#1.offset, cstrncmp_#in~n#1 := cstrstr_~s#1.base, cstrstr_~s#1.offset, cstrstr_~find#1.base, cstrstr_~find#1.offset, cstrstr_~len~0#1;havoc cstrncmp_#res#1;havoc cstrncmp_#t~mem5#1, cstrncmp_#t~post4#1.base, cstrncmp_#t~post4#1.offset, cstrncmp_#t~mem6#1, cstrncmp_#t~mem8#1, cstrncmp_#t~pre7#1.base, cstrncmp_#t~pre7#1.offset, cstrncmp_#t~mem9#1, cstrncmp_#t~post10#1.base, cstrncmp_#t~post10#1.offset, cstrncmp_#t~mem11#1, cstrncmp_#t~pre12#1, cstrncmp_~s1#1.base, cstrncmp_~s1#1.offset, cstrncmp_~s2#1.base, cstrncmp_~s2#1.offset, cstrncmp_~n#1;cstrncmp_~s1#1.base, cstrncmp_~s1#1.offset := cstrncmp_#in~s1#1.base, cstrncmp_#in~s1#1.offset;cstrncmp_~s2#1.base, cstrncmp_~s2#1.offset := cstrncmp_#in~s2#1.base, cstrncmp_#in~s2#1.offset;cstrncmp_~n#1 := cstrncmp_#in~n#1; 3258#L525 assume !(0 == cstrncmp_~n#1 % 4294967296); 3259#L527-4 call cstrncmp_#t~mem5#1 := read~int#1(cstrncmp_~s1#1.base, cstrncmp_~s1#1.offset, 1);cstrncmp_#t~post4#1.base, cstrncmp_#t~post4#1.offset := cstrncmp_~s2#1.base, cstrncmp_~s2#1.offset;cstrncmp_~s2#1.base, cstrncmp_~s2#1.offset := cstrncmp_#t~post4#1.base, 1 + cstrncmp_#t~post4#1.offset;call cstrncmp_#t~mem6#1 := read~int#0(cstrncmp_#t~post4#1.base, cstrncmp_#t~post4#1.offset, 1); 3297#L528 assume cstrncmp_#t~mem5#1 != cstrncmp_#t~mem6#1;havoc cstrncmp_#t~mem5#1;havoc cstrncmp_#t~post4#1.base, cstrncmp_#t~post4#1.offset;havoc cstrncmp_#t~mem6#1;call cstrncmp_#t~mem8#1 := read~int#1(cstrncmp_~s1#1.base, cstrncmp_~s1#1.offset, 1);cstrncmp_#t~pre7#1.base, cstrncmp_#t~pre7#1.offset := cstrncmp_~s2#1.base, cstrncmp_~s2#1.offset - 1;cstrncmp_~s2#1.base, cstrncmp_~s2#1.offset := cstrncmp_~s2#1.base, cstrncmp_~s2#1.offset - 1;call cstrncmp_#t~mem9#1 := read~int#0(cstrncmp_#t~pre7#1.base, cstrncmp_#t~pre7#1.offset, 1);cstrncmp_#res#1 := (if cstrncmp_#t~mem8#1 % 256 % 4294967296 <= 2147483647 then cstrncmp_#t~mem8#1 % 256 % 4294967296 else cstrncmp_#t~mem8#1 % 256 % 4294967296 - 4294967296) - (if cstrncmp_#t~mem9#1 % 256 % 4294967296 <= 2147483647 then cstrncmp_#t~mem9#1 % 256 % 4294967296 else cstrncmp_#t~mem9#1 % 256 % 4294967296 - 4294967296);havoc cstrncmp_#t~mem8#1;havoc cstrncmp_#t~pre7#1.base, cstrncmp_#t~pre7#1.offset;havoc cstrncmp_#t~mem9#1; 3272#cstrncmp_returnLabel#1 cstrstr_#t~ret18#1 := cstrncmp_#res#1;havoc cstrncmp_#t~mem5#1, cstrncmp_#t~post4#1.base, cstrncmp_#t~post4#1.offset, cstrncmp_#t~mem6#1, cstrncmp_#t~mem8#1, cstrncmp_#t~pre7#1.base, cstrncmp_#t~pre7#1.offset, cstrncmp_#t~mem9#1, cstrncmp_#t~post10#1.base, cstrncmp_#t~post10#1.offset, cstrncmp_#t~mem11#1, cstrncmp_#t~pre12#1, cstrncmp_~s1#1.base, cstrncmp_~s1#1.offset, cstrncmp_~s2#1.base, cstrncmp_~s2#1.offset, cstrncmp_~n#1;havoc cstrncmp_#in~s1#1.base, cstrncmp_#in~s1#1.offset, cstrncmp_#in~s2#1.base, cstrncmp_#in~s2#1.offset, cstrncmp_#in~n#1;assume { :end_inline_cstrncmp } true; 3273#L542-2 assume !!(0 != cstrstr_#t~ret18#1);havoc cstrstr_#t~ret18#1; 3277#L542-4 goto; 3291#L543-2 cstrstr_#t~post16#1.base, cstrstr_#t~post16#1.offset := cstrstr_~s#1.base, cstrstr_~s#1.offset;cstrstr_~s#1.base, cstrstr_~s#1.offset := cstrstr_#t~post16#1.base, 1 + cstrstr_#t~post16#1.offset;call cstrstr_#t~mem17#1 := read~int#1(cstrstr_#t~post16#1.base, cstrstr_#t~post16#1.offset, 1);cstrstr_~sc~0#1 := cstrstr_#t~mem17#1; 3314#L544 assume !(0 == cstrstr_~sc~0#1);havoc cstrstr_#t~post16#1.base, cstrstr_#t~post16#1.offset;havoc cstrstr_#t~mem17#1; 3292#L543 assume !(cstrstr_~sc~0#1 != cstrstr_~c~0#1); 3293#L542-1 assume { :begin_inline_cstrncmp } true;cstrncmp_#in~s1#1.base, cstrncmp_#in~s1#1.offset, cstrncmp_#in~s2#1.base, cstrncmp_#in~s2#1.offset, cstrncmp_#in~n#1 := cstrstr_~s#1.base, cstrstr_~s#1.offset, cstrstr_~find#1.base, cstrstr_~find#1.offset, cstrstr_~len~0#1;havoc cstrncmp_#res#1;havoc cstrncmp_#t~mem5#1, cstrncmp_#t~post4#1.base, cstrncmp_#t~post4#1.offset, cstrncmp_#t~mem6#1, cstrncmp_#t~mem8#1, cstrncmp_#t~pre7#1.base, cstrncmp_#t~pre7#1.offset, cstrncmp_#t~mem9#1, cstrncmp_#t~post10#1.base, cstrncmp_#t~post10#1.offset, cstrncmp_#t~mem11#1, cstrncmp_#t~pre12#1, cstrncmp_~s1#1.base, cstrncmp_~s1#1.offset, cstrncmp_~s2#1.base, cstrncmp_~s2#1.offset, cstrncmp_~n#1;cstrncmp_~s1#1.base, cstrncmp_~s1#1.offset := cstrncmp_#in~s1#1.base, cstrncmp_#in~s1#1.offset;cstrncmp_~s2#1.base, cstrncmp_~s2#1.offset := cstrncmp_#in~s2#1.base, cstrncmp_#in~s2#1.offset;cstrncmp_~n#1 := cstrncmp_#in~n#1; 3256#L525 assume !(0 == cstrncmp_~n#1 % 4294967296); 3257#L527-4 [2024-10-15 00:22:45,428 INFO L747 eck$LassoCheckResult]: Loop: 3257#L527-4 call cstrncmp_#t~mem5#1 := read~int#1(cstrncmp_~s1#1.base, cstrncmp_~s1#1.offset, 1);cstrncmp_#t~post4#1.base, cstrncmp_#t~post4#1.offset := cstrncmp_~s2#1.base, cstrncmp_~s2#1.offset;cstrncmp_~s2#1.base, cstrncmp_~s2#1.offset := cstrncmp_#t~post4#1.base, 1 + cstrncmp_#t~post4#1.offset;call cstrncmp_#t~mem6#1 := read~int#0(cstrncmp_#t~post4#1.base, cstrncmp_#t~post4#1.offset, 1); 3278#L528 assume !(cstrncmp_#t~mem5#1 != cstrncmp_#t~mem6#1);havoc cstrncmp_#t~mem5#1;havoc cstrncmp_#t~post4#1.base, cstrncmp_#t~post4#1.offset;havoc cstrncmp_#t~mem6#1;cstrncmp_#t~post10#1.base, cstrncmp_#t~post10#1.offset := cstrncmp_~s1#1.base, cstrncmp_~s1#1.offset;cstrncmp_~s1#1.base, cstrncmp_~s1#1.offset := cstrncmp_#t~post10#1.base, 1 + cstrncmp_#t~post10#1.offset;call cstrncmp_#t~mem11#1 := read~int#1(cstrncmp_#t~post10#1.base, cstrncmp_#t~post10#1.offset, 1); 3274#L530 assume !(0 == cstrncmp_#t~mem11#1);havoc cstrncmp_#t~post10#1.base, cstrncmp_#t~post10#1.offset;havoc cstrncmp_#t~mem11#1; 3260#L527-1 cstrncmp_#t~pre12#1 := cstrncmp_~n#1 - 1;cstrncmp_~n#1 := cstrncmp_~n#1 - 1; 3261#L527-2 assume !!(0 != cstrncmp_#t~pre12#1 % 4294967296);havoc cstrncmp_#t~pre12#1; 3257#L527-4 [2024-10-15 00:22:45,428 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 00:22:45,428 INFO L85 PathProgramCache]: Analyzing trace with hash 1314272625, now seen corresponding path program 1 times [2024-10-15 00:22:45,428 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-15 00:22:45,429 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [900506329] [2024-10-15 00:22:45,429 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-15 00:22:45,429 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-15 00:22:45,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 00:22:46,027 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (88)] Forceful destruction successful, exit code 0 [2024-10-15 00:22:46,182 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 2 proven. 8 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2024-10-15 00:22:46,182 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-15 00:22:46,183 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [900506329] [2024-10-15 00:22:46,183 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [900506329] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-15 00:22:46,183 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [180322155] [2024-10-15 00:22:46,183 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-15 00:22:46,183 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-15 00:22:46,184 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-15 00:22:46,185 INFO L229 MonitoredProcess]: Starting monitored process 89 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-15 00:22:46,187 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (89)] Waiting until timeout for monitored process [2024-10-15 00:22:46,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 00:22:46,335 INFO L255 TraceCheckSpWp]: Trace formula consists of 323 conjuncts, 46 conjuncts are in the unsatisfiable core [2024-10-15 00:22:46,340 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-15 00:22:46,431 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2024-10-15 00:22:46,560 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 2 proven. 8 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2024-10-15 00:22:46,561 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-15 00:22:46,630 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 13 [2024-10-15 00:22:46,633 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2024-10-15 00:22:46,699 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 2 proven. 8 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2024-10-15 00:22:46,700 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [180322155] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-15 00:22:46,700 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-15 00:22:46,700 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 11, 11] total 24 [2024-10-15 00:22:46,700 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1053310485] [2024-10-15 00:22:46,700 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-15 00:22:46,701 INFO L750 eck$LassoCheckResult]: stem already infeasible [2024-10-15 00:22:46,701 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 00:22:46,701 INFO L85 PathProgramCache]: Analyzing trace with hash 118492775, now seen corresponding path program 4 times [2024-10-15 00:22:46,701 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-15 00:22:46,701 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2034869271] [2024-10-15 00:22:46,701 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-15 00:22:46,701 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-15 00:22:46,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-15 00:22:46,709 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-15 00:22:46,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-15 00:22:46,719 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-15 00:22:46,894 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-15 00:22:46,895 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2024-10-15 00:22:46,895 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=481, Unknown=0, NotChecked=0, Total=552 [2024-10-15 00:22:46,895 INFO L87 Difference]: Start difference. First operand 100 states and 113 transitions. cyclomatic complexity: 22 Second operand has 24 states, 24 states have (on average 3.5) internal successors, (84), 24 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-15 00:22:47,147 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-15 00:22:47,147 INFO L93 Difference]: Finished difference Result 110 states and 121 transitions. [2024-10-15 00:22:47,148 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 110 states and 121 transitions. [2024-10-15 00:22:47,148 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2024-10-15 00:22:47,149 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 110 states to 73 states and 82 transitions. [2024-10-15 00:22:47,149 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 24 [2024-10-15 00:22:47,149 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 24 [2024-10-15 00:22:47,149 INFO L73 IsDeterministic]: Start isDeterministic. Operand 73 states and 82 transitions. [2024-10-15 00:22:47,150 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-10-15 00:22:47,150 INFO L218 hiAutomatonCegarLoop]: Abstraction has 73 states and 82 transitions. [2024-10-15 00:22:47,150 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states and 82 transitions. [2024-10-15 00:22:47,153 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 72. [2024-10-15 00:22:47,153 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 72 states, 72 states have (on average 1.125) internal successors, (81), 71 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-15 00:22:47,153 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 81 transitions. [2024-10-15 00:22:47,153 INFO L240 hiAutomatonCegarLoop]: Abstraction has 72 states and 81 transitions. [2024-10-15 00:22:47,155 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-10-15 00:22:47,155 INFO L425 stractBuchiCegarLoop]: Abstraction has 72 states and 81 transitions. [2024-10-15 00:22:47,155 INFO L332 stractBuchiCegarLoop]: ======== Iteration 16 ============ [2024-10-15 00:22:47,155 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 72 states and 81 transitions. [2024-10-15 00:22:47,159 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2024-10-15 00:22:47,159 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-10-15 00:22:47,159 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-10-15 00:22:47,160 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [4, 4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-15 00:22:47,160 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2024-10-15 00:22:47,160 INFO L745 eck$LassoCheckResult]: Stem: 3839#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 3804#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet20#1, main_#t~nondet21#1, main_#t~malloc22#1.base, main_#t~malloc22#1.offset, main_#t~malloc23#1.base, main_#t~malloc23#1.offset, main_#t~nondet24#1, main_#t~post25#1, main_~i~0#1, main_#t~nondet26#1, main_#t~post27#1, main_~i~1#1, main_#t~ret28#1.base, main_#t~ret28#1.offset, main_~length1~0#1, main_~length2~0#1, main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset, main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset;havoc main_#t~nondet20#1;main_~length1~0#1 := main_#t~nondet20#1;havoc main_#t~nondet20#1;havoc main_#t~nondet21#1;main_~length2~0#1 := main_#t~nondet21#1;havoc main_#t~nondet21#1; 3805#L555 assume !(main_~length1~0#1 < 1); 3836#L555-2 assume !(main_~length2~0#1 < 1); 3798#L558-1 call main_#t~malloc22#1.base, main_#t~malloc22#1.offset := #Ultimate.allocOnStack(main_~length1~0#1 % 4294967296);main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset := main_#t~malloc22#1.base, main_#t~malloc22#1.offset;call main_#t~malloc23#1.base, main_#t~malloc23#1.offset := #Ultimate.allocOnStack(main_~length2~0#1 % 4294967296);main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset := main_#t~malloc23#1.base, main_#t~malloc23#1.offset;main_~i~0#1 := 0; 3799#L564-3 assume !!(main_~i~0#1 < main_~length1~0#1);havoc main_#t~nondet24#1;call write~int#1(main_#t~nondet24#1, main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset + main_~i~0#1, 1);havoc main_#t~nondet24#1; 3840#L564-2 main_#t~post25#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post25#1;havoc main_#t~post25#1; 3856#L564-3 assume !!(main_~i~0#1 < main_~length1~0#1);havoc main_#t~nondet24#1;call write~int#1(main_#t~nondet24#1, main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset + main_~i~0#1, 1);havoc main_#t~nondet24#1; 3830#L564-2 main_#t~post25#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post25#1;havoc main_#t~post25#1; 3831#L564-3 assume !!(main_~i~0#1 < main_~length1~0#1);havoc main_#t~nondet24#1;call write~int#1(main_#t~nondet24#1, main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset + main_~i~0#1, 1);havoc main_#t~nondet24#1; 3841#L564-2 main_#t~post25#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post25#1;havoc main_#t~post25#1; 3850#L564-3 assume !(main_~i~0#1 < main_~length1~0#1); 3834#L564-4 havoc main_~i~0#1;main_~i~1#1 := 0; 3818#L568-3 assume !!(main_~i~1#1 < main_~length2~0#1);havoc main_#t~nondet26#1;call write~int#0(main_#t~nondet26#1, main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset + main_~i~1#1, 1);havoc main_#t~nondet26#1; 3819#L568-2 main_#t~post27#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post27#1;havoc main_#t~post27#1; 3820#L568-3 assume !!(main_~i~1#1 < main_~length2~0#1);havoc main_#t~nondet26#1;call write~int#0(main_#t~nondet26#1, main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset + main_~i~1#1, 1);havoc main_#t~nondet26#1; 3821#L568-2 main_#t~post27#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post27#1;havoc main_#t~post27#1; 3849#L568-3 assume !!(main_~i~1#1 < main_~length2~0#1);havoc main_#t~nondet26#1;call write~int#0(main_#t~nondet26#1, main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset + main_~i~1#1, 1);havoc main_#t~nondet26#1; 3848#L568-2 main_#t~post27#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post27#1;havoc main_#t~post27#1; 3847#L568-3 assume !!(main_~i~1#1 < main_~length2~0#1);havoc main_#t~nondet26#1;call write~int#0(main_#t~nondet26#1, main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset + main_~i~1#1, 1);havoc main_#t~nondet26#1; 3844#L568-2 main_#t~post27#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post27#1;havoc main_#t~post27#1; 3843#L568-3 assume !(main_~i~1#1 < main_~length2~0#1); 3832#L568-4 havoc main_~i~1#1;call write~int#1(0, main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset + (main_~length1~0#1 - 1), 1);call write~int#0(0, main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset + (main_~length2~0#1 - 1), 1);assume { :begin_inline_cstrstr } true;cstrstr_#in~s#1.base, cstrstr_#in~s#1.offset, cstrstr_#in~find#1.base, cstrstr_#in~find#1.offset := main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset, main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset;havoc cstrstr_#res#1.base, cstrstr_#res#1.offset;havoc cstrstr_#t~post13#1.base, cstrstr_#t~post13#1.offset, cstrstr_#t~mem14#1, cstrstr_#t~ret15#1, cstrstr_#t~post16#1.base, cstrstr_#t~post16#1.offset, cstrstr_#t~mem17#1, cstrstr_#t~ret18#1, cstrstr_#t~post19#1.base, cstrstr_#t~post19#1.offset, cstrstr_~s#1.base, cstrstr_~s#1.offset, cstrstr_~find#1.base, cstrstr_~find#1.offset, cstrstr_~c~0#1, cstrstr_~sc~0#1, cstrstr_~len~0#1;cstrstr_~s#1.base, cstrstr_~s#1.offset := cstrstr_#in~s#1.base, cstrstr_#in~s#1.offset;cstrstr_~find#1.base, cstrstr_~find#1.offset := cstrstr_#in~find#1.base, cstrstr_#in~find#1.offset;havoc cstrstr_~c~0#1;havoc cstrstr_~sc~0#1;havoc cstrstr_~len~0#1;cstrstr_#t~post13#1.base, cstrstr_#t~post13#1.offset := cstrstr_~find#1.base, cstrstr_~find#1.offset;cstrstr_~find#1.base, cstrstr_~find#1.offset := cstrstr_#t~post13#1.base, 1 + cstrstr_#t~post13#1.offset;call cstrstr_#t~mem14#1 := read~int#0(cstrstr_#t~post13#1.base, cstrstr_#t~post13#1.offset, 1);cstrstr_~c~0#1 := cstrstr_#t~mem14#1; 3833#L540 assume 0 != cstrstr_~c~0#1;havoc cstrstr_#t~post13#1.base, cstrstr_#t~post13#1.offset;havoc cstrstr_#t~mem14#1;assume { :begin_inline_cstrlen } true;cstrlen_#in~str#1.base, cstrlen_#in~str#1.offset := cstrstr_~find#1.base, cstrstr_~find#1.offset;havoc cstrlen_#res#1;havoc cstrlen_#t~mem2#1, cstrlen_#t~pre3#1.base, cstrlen_#t~pre3#1.offset, cstrlen_~str#1.base, cstrlen_~str#1.offset, cstrlen_~s~0#1.base, cstrlen_~s~0#1.offset;cstrlen_~str#1.base, cstrlen_~str#1.offset := cstrlen_#in~str#1.base, cstrlen_#in~str#1.offset;havoc cstrlen_~s~0#1.base, cstrlen_~s~0#1.offset;cstrlen_~s~0#1.base, cstrlen_~s~0#1.offset := cstrlen_~str#1.base, cstrlen_~str#1.offset; 3812#L518-4 call cstrlen_#t~mem2#1 := read~int#0(cstrlen_~s~0#1.base, cstrlen_~s~0#1.offset, 1); 3813#L518-1 assume !!(0 != cstrlen_#t~mem2#1);havoc cstrlen_#t~mem2#1; 3838#L518-3 cstrlen_#t~pre3#1.base, cstrlen_#t~pre3#1.offset := cstrlen_~s~0#1.base, 1 + cstrlen_~s~0#1.offset;cstrlen_~s~0#1.base, cstrlen_~s~0#1.offset := cstrlen_~s~0#1.base, 1 + cstrlen_~s~0#1.offset;havoc cstrlen_#t~pre3#1.base, cstrlen_#t~pre3#1.offset; 3814#L518-4 call cstrlen_#t~mem2#1 := read~int#0(cstrlen_~s~0#1.base, cstrlen_~s~0#1.offset, 1); 3815#L518-1 assume !!(0 != cstrlen_#t~mem2#1);havoc cstrlen_#t~mem2#1; 3846#L518-3 cstrlen_#t~pre3#1.base, cstrlen_#t~pre3#1.offset := cstrlen_~s~0#1.base, 1 + cstrlen_~s~0#1.offset;cstrlen_~s~0#1.base, cstrlen_~s~0#1.offset := cstrlen_~s~0#1.base, 1 + cstrlen_~s~0#1.offset;havoc cstrlen_#t~pre3#1.base, cstrlen_#t~pre3#1.offset; 3845#L518-4 call cstrlen_#t~mem2#1 := read~int#0(cstrlen_~s~0#1.base, cstrlen_~s~0#1.offset, 1); 3842#L518-1 assume !(0 != cstrlen_#t~mem2#1);havoc cstrlen_#t~mem2#1; 3797#L518-5 assume cstrlen_~s~0#1.base == cstrlen_~str#1.base;cstrlen_#res#1 := cstrlen_~s~0#1.offset - cstrlen_~str#1.offset; 3787#cstrlen_returnLabel#1 cstrstr_#t~ret15#1 := cstrlen_#res#1;havoc cstrlen_#t~mem2#1, cstrlen_#t~pre3#1.base, cstrlen_#t~pre3#1.offset, cstrlen_~str#1.base, cstrlen_~str#1.offset, cstrlen_~s~0#1.base, cstrlen_~s~0#1.offset;havoc cstrlen_#in~str#1.base, cstrlen_#in~str#1.offset;assume { :end_inline_cstrlen } true;cstrstr_~len~0#1 := cstrstr_#t~ret15#1;havoc cstrstr_#t~ret15#1; 3788#L542-4 goto; 3816#L543-2 cstrstr_#t~post16#1.base, cstrstr_#t~post16#1.offset := cstrstr_~s#1.base, cstrstr_~s#1.offset;cstrstr_~s#1.base, cstrstr_~s#1.offset := cstrstr_#t~post16#1.base, 1 + cstrstr_#t~post16#1.offset;call cstrstr_#t~mem17#1 := read~int#1(cstrstr_#t~post16#1.base, cstrstr_#t~post16#1.offset, 1);cstrstr_~sc~0#1 := cstrstr_#t~mem17#1; 3800#L544 assume !(0 == cstrstr_~sc~0#1);havoc cstrstr_#t~post16#1.base, cstrstr_#t~post16#1.offset;havoc cstrstr_#t~mem17#1; 3801#L543 assume !(cstrstr_~sc~0#1 != cstrstr_~c~0#1); 3835#L542-1 assume { :begin_inline_cstrncmp } true;cstrncmp_#in~s1#1.base, cstrncmp_#in~s1#1.offset, cstrncmp_#in~s2#1.base, cstrncmp_#in~s2#1.offset, cstrncmp_#in~n#1 := cstrstr_~s#1.base, cstrstr_~s#1.offset, cstrstr_~find#1.base, cstrstr_~find#1.offset, cstrstr_~len~0#1;havoc cstrncmp_#res#1;havoc cstrncmp_#t~mem5#1, cstrncmp_#t~post4#1.base, cstrncmp_#t~post4#1.offset, cstrncmp_#t~mem6#1, cstrncmp_#t~mem8#1, cstrncmp_#t~pre7#1.base, cstrncmp_#t~pre7#1.offset, cstrncmp_#t~mem9#1, cstrncmp_#t~post10#1.base, cstrncmp_#t~post10#1.offset, cstrncmp_#t~mem11#1, cstrncmp_#t~pre12#1, cstrncmp_~s1#1.base, cstrncmp_~s1#1.offset, cstrncmp_~s2#1.base, cstrncmp_~s2#1.offset, cstrncmp_~n#1;cstrncmp_~s1#1.base, cstrncmp_~s1#1.offset := cstrncmp_#in~s1#1.base, cstrncmp_#in~s1#1.offset;cstrncmp_~s2#1.base, cstrncmp_~s2#1.offset := cstrncmp_#in~s2#1.base, cstrncmp_#in~s2#1.offset;cstrncmp_~n#1 := cstrncmp_#in~n#1; 3791#L525 assume !(0 == cstrncmp_~n#1 % 4294967296); 3792#L527-4 call cstrncmp_#t~mem5#1 := read~int#1(cstrncmp_~s1#1.base, cstrncmp_~s1#1.offset, 1);cstrncmp_#t~post4#1.base, cstrncmp_#t~post4#1.offset := cstrncmp_~s2#1.base, cstrncmp_~s2#1.offset;cstrncmp_~s2#1.base, cstrncmp_~s2#1.offset := cstrncmp_#t~post4#1.base, 1 + cstrncmp_#t~post4#1.offset;call cstrncmp_#t~mem6#1 := read~int#0(cstrncmp_#t~post4#1.base, cstrncmp_#t~post4#1.offset, 1); 3829#L528 assume cstrncmp_#t~mem5#1 != cstrncmp_#t~mem6#1;havoc cstrncmp_#t~mem5#1;havoc cstrncmp_#t~post4#1.base, cstrncmp_#t~post4#1.offset;havoc cstrncmp_#t~mem6#1;call cstrncmp_#t~mem8#1 := read~int#1(cstrncmp_~s1#1.base, cstrncmp_~s1#1.offset, 1);cstrncmp_#t~pre7#1.base, cstrncmp_#t~pre7#1.offset := cstrncmp_~s2#1.base, cstrncmp_~s2#1.offset - 1;cstrncmp_~s2#1.base, cstrncmp_~s2#1.offset := cstrncmp_~s2#1.base, cstrncmp_~s2#1.offset - 1;call cstrncmp_#t~mem9#1 := read~int#0(cstrncmp_#t~pre7#1.base, cstrncmp_#t~pre7#1.offset, 1);cstrncmp_#res#1 := (if cstrncmp_#t~mem8#1 % 256 % 4294967296 <= 2147483647 then cstrncmp_#t~mem8#1 % 256 % 4294967296 else cstrncmp_#t~mem8#1 % 256 % 4294967296 - 4294967296) - (if cstrncmp_#t~mem9#1 % 256 % 4294967296 <= 2147483647 then cstrncmp_#t~mem9#1 % 256 % 4294967296 else cstrncmp_#t~mem9#1 % 256 % 4294967296 - 4294967296);havoc cstrncmp_#t~mem8#1;havoc cstrncmp_#t~pre7#1.base, cstrncmp_#t~pre7#1.offset;havoc cstrncmp_#t~mem9#1; 3802#cstrncmp_returnLabel#1 cstrstr_#t~ret18#1 := cstrncmp_#res#1;havoc cstrncmp_#t~mem5#1, cstrncmp_#t~post4#1.base, cstrncmp_#t~post4#1.offset, cstrncmp_#t~mem6#1, cstrncmp_#t~mem8#1, cstrncmp_#t~pre7#1.base, cstrncmp_#t~pre7#1.offset, cstrncmp_#t~mem9#1, cstrncmp_#t~post10#1.base, cstrncmp_#t~post10#1.offset, cstrncmp_#t~mem11#1, cstrncmp_#t~pre12#1, cstrncmp_~s1#1.base, cstrncmp_~s1#1.offset, cstrncmp_~s2#1.base, cstrncmp_~s2#1.offset, cstrncmp_~n#1;havoc cstrncmp_#in~s1#1.base, cstrncmp_#in~s1#1.offset, cstrncmp_#in~s2#1.base, cstrncmp_#in~s2#1.offset, cstrncmp_#in~n#1;assume { :end_inline_cstrncmp } true; 3803#L542-2 assume !!(0 != cstrstr_#t~ret18#1);havoc cstrstr_#t~ret18#1; 3808#L542-4 goto; 3817#L543-2 cstrstr_#t~post16#1.base, cstrstr_#t~post16#1.offset := cstrstr_~s#1.base, cstrstr_~s#1.offset;cstrstr_~s#1.base, cstrstr_~s#1.offset := cstrstr_#t~post16#1.base, 1 + cstrstr_#t~post16#1.offset;call cstrstr_#t~mem17#1 := read~int#1(cstrstr_#t~post16#1.base, cstrstr_#t~post16#1.offset, 1);cstrstr_~sc~0#1 := cstrstr_#t~mem17#1; 3837#L544 assume !(0 == cstrstr_~sc~0#1);havoc cstrstr_#t~post16#1.base, cstrstr_#t~post16#1.offset;havoc cstrstr_#t~mem17#1; 3824#L543 assume !(cstrstr_~sc~0#1 != cstrstr_~c~0#1); 3825#L542-1 assume { :begin_inline_cstrncmp } true;cstrncmp_#in~s1#1.base, cstrncmp_#in~s1#1.offset, cstrncmp_#in~s2#1.base, cstrncmp_#in~s2#1.offset, cstrncmp_#in~n#1 := cstrstr_~s#1.base, cstrstr_~s#1.offset, cstrstr_~find#1.base, cstrstr_~find#1.offset, cstrstr_~len~0#1;havoc cstrncmp_#res#1;havoc cstrncmp_#t~mem5#1, cstrncmp_#t~post4#1.base, cstrncmp_#t~post4#1.offset, cstrncmp_#t~mem6#1, cstrncmp_#t~mem8#1, cstrncmp_#t~pre7#1.base, cstrncmp_#t~pre7#1.offset, cstrncmp_#t~mem9#1, cstrncmp_#t~post10#1.base, cstrncmp_#t~post10#1.offset, cstrncmp_#t~mem11#1, cstrncmp_#t~pre12#1, cstrncmp_~s1#1.base, cstrncmp_~s1#1.offset, cstrncmp_~s2#1.base, cstrncmp_~s2#1.offset, cstrncmp_~n#1;cstrncmp_~s1#1.base, cstrncmp_~s1#1.offset := cstrncmp_#in~s1#1.base, cstrncmp_#in~s1#1.offset;cstrncmp_~s2#1.base, cstrncmp_~s2#1.offset := cstrncmp_#in~s2#1.base, cstrncmp_#in~s2#1.offset;cstrncmp_~n#1 := cstrncmp_#in~n#1; 3789#L525 assume !(0 == cstrncmp_~n#1 % 4294967296); 3790#L527-4 [2024-10-15 00:22:47,160 INFO L747 eck$LassoCheckResult]: Loop: 3790#L527-4 call cstrncmp_#t~mem5#1 := read~int#1(cstrncmp_~s1#1.base, cstrncmp_~s1#1.offset, 1);cstrncmp_#t~post4#1.base, cstrncmp_#t~post4#1.offset := cstrncmp_~s2#1.base, cstrncmp_~s2#1.offset;cstrncmp_~s2#1.base, cstrncmp_~s2#1.offset := cstrncmp_#t~post4#1.base, 1 + cstrncmp_#t~post4#1.offset;call cstrncmp_#t~mem6#1 := read~int#0(cstrncmp_#t~post4#1.base, cstrncmp_#t~post4#1.offset, 1); 3809#L528 assume !(cstrncmp_#t~mem5#1 != cstrncmp_#t~mem6#1);havoc cstrncmp_#t~mem5#1;havoc cstrncmp_#t~post4#1.base, cstrncmp_#t~post4#1.offset;havoc cstrncmp_#t~mem6#1;cstrncmp_#t~post10#1.base, cstrncmp_#t~post10#1.offset := cstrncmp_~s1#1.base, cstrncmp_~s1#1.offset;cstrncmp_~s1#1.base, cstrncmp_~s1#1.offset := cstrncmp_#t~post10#1.base, 1 + cstrncmp_#t~post10#1.offset;call cstrncmp_#t~mem11#1 := read~int#1(cstrncmp_#t~post10#1.base, cstrncmp_#t~post10#1.offset, 1); 3806#L530 assume !(0 == cstrncmp_#t~mem11#1);havoc cstrncmp_#t~post10#1.base, cstrncmp_#t~post10#1.offset;havoc cstrncmp_#t~mem11#1; 3793#L527-1 cstrncmp_#t~pre12#1 := cstrncmp_~n#1 - 1;cstrncmp_~n#1 := cstrncmp_~n#1 - 1; 3794#L527-2 assume !!(0 != cstrncmp_#t~pre12#1 % 4294967296);havoc cstrncmp_#t~pre12#1; 3790#L527-4 [2024-10-15 00:22:47,161 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 00:22:47,161 INFO L85 PathProgramCache]: Analyzing trace with hash -1519050033, now seen corresponding path program 2 times [2024-10-15 00:22:47,161 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-15 00:22:47,161 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [555960130] [2024-10-15 00:22:47,161 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-15 00:22:47,161 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-15 00:22:47,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-15 00:22:47,202 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-15 00:22:47,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-15 00:22:47,240 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-15 00:22:47,241 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 00:22:47,241 INFO L85 PathProgramCache]: Analyzing trace with hash 118492775, now seen corresponding path program 5 times [2024-10-15 00:22:47,242 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-15 00:22:47,242 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [595809553] [2024-10-15 00:22:47,242 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-15 00:22:47,242 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-15 00:22:47,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-15 00:22:47,249 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-15 00:22:47,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-15 00:22:47,255 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-15 00:22:47,256 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 00:22:47,256 INFO L85 PathProgramCache]: Analyzing trace with hash -419005351, now seen corresponding path program 1 times [2024-10-15 00:22:47,256 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-15 00:22:47,256 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [815357230] [2024-10-15 00:22:47,256 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-15 00:22:47,256 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-15 00:22:47,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 00:22:47,987 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 17 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2024-10-15 00:22:47,987 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-15 00:22:47,987 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [815357230] [2024-10-15 00:22:47,987 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [815357230] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-15 00:22:47,987 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [122502659] [2024-10-15 00:22:47,988 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-15 00:22:47,988 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-15 00:22:47,988 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-15 00:22:47,989 INFO L229 MonitoredProcess]: Starting monitored process 90 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-15 00:22:47,990 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (90)] Waiting until timeout for monitored process [2024-10-15 00:22:48,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 00:22:48,143 INFO L255 TraceCheckSpWp]: Trace formula consists of 376 conjuncts, 69 conjuncts are in the unsatisfiable core [2024-10-15 00:22:48,146 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-15 00:22:48,243 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2024-10-15 00:22:48,423 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 17 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2024-10-15 00:22:48,423 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-15 00:22:48,651 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 27 [2024-10-15 00:22:48,655 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-15 00:22:48,656 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 31 treesize of output 23 [2024-10-15 00:22:48,832 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 17 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2024-10-15 00:22:48,833 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [122502659] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-15 00:22:48,833 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-15 00:22:48,833 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 16, 16] total 36 [2024-10-15 00:22:48,833 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1677427978] [2024-10-15 00:22:48,833 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-15 00:22:49,010 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-15 00:22:49,011 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2024-10-15 00:22:49,011 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=130, Invalid=1130, Unknown=0, NotChecked=0, Total=1260 [2024-10-15 00:22:49,011 INFO L87 Difference]: Start difference. First operand 72 states and 81 transitions. cyclomatic complexity: 16 Second operand has 36 states, 36 states have (on average 3.25) internal successors, (117), 36 states have internal predecessors, (117), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-15 00:22:49,770 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-15 00:22:49,770 INFO L93 Difference]: Finished difference Result 165 states and 183 transitions. [2024-10-15 00:22:49,770 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 165 states and 183 transitions. [2024-10-15 00:22:49,771 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2024-10-15 00:22:49,772 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 165 states to 149 states and 167 transitions. [2024-10-15 00:22:49,773 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 34 [2024-10-15 00:22:49,773 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 34 [2024-10-15 00:22:49,773 INFO L73 IsDeterministic]: Start isDeterministic. Operand 149 states and 167 transitions. [2024-10-15 00:22:49,773 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-10-15 00:22:49,773 INFO L218 hiAutomatonCegarLoop]: Abstraction has 149 states and 167 transitions. [2024-10-15 00:22:49,774 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 149 states and 167 transitions. [2024-10-15 00:22:49,776 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 149 to 133. [2024-10-15 00:22:49,776 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 133 states, 133 states have (on average 1.1353383458646618) internal successors, (151), 132 states have internal predecessors, (151), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-15 00:22:49,777 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133 states to 133 states and 151 transitions. [2024-10-15 00:22:49,777 INFO L240 hiAutomatonCegarLoop]: Abstraction has 133 states and 151 transitions. [2024-10-15 00:22:49,778 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2024-10-15 00:22:49,778 INFO L425 stractBuchiCegarLoop]: Abstraction has 133 states and 151 transitions. [2024-10-15 00:22:49,779 INFO L332 stractBuchiCegarLoop]: ======== Iteration 17 ============ [2024-10-15 00:22:49,779 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 133 states and 151 transitions. [2024-10-15 00:22:49,780 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2024-10-15 00:22:49,780 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-10-15 00:22:49,780 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-10-15 00:22:49,781 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [4, 4, 4, 4, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-15 00:22:49,781 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2024-10-15 00:22:49,781 INFO L745 eck$LassoCheckResult]: Stem: 4470#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 4436#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet20#1, main_#t~nondet21#1, main_#t~malloc22#1.base, main_#t~malloc22#1.offset, main_#t~malloc23#1.base, main_#t~malloc23#1.offset, main_#t~nondet24#1, main_#t~post25#1, main_~i~0#1, main_#t~nondet26#1, main_#t~post27#1, main_~i~1#1, main_#t~ret28#1.base, main_#t~ret28#1.offset, main_~length1~0#1, main_~length2~0#1, main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset, main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset;havoc main_#t~nondet20#1;main_~length1~0#1 := main_#t~nondet20#1;havoc main_#t~nondet20#1;havoc main_#t~nondet21#1;main_~length2~0#1 := main_#t~nondet21#1;havoc main_#t~nondet21#1; 4437#L555 assume !(main_~length1~0#1 < 1); 4467#L555-2 assume !(main_~length2~0#1 < 1); 4429#L558-1 call main_#t~malloc22#1.base, main_#t~malloc22#1.offset := #Ultimate.allocOnStack(main_~length1~0#1 % 4294967296);main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset := main_#t~malloc22#1.base, main_#t~malloc22#1.offset;call main_#t~malloc23#1.base, main_#t~malloc23#1.offset := #Ultimate.allocOnStack(main_~length2~0#1 % 4294967296);main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset := main_#t~malloc23#1.base, main_#t~malloc23#1.offset;main_~i~0#1 := 0; 4430#L564-3 assume !!(main_~i~0#1 < main_~length1~0#1);havoc main_#t~nondet24#1;call write~int#1(main_#t~nondet24#1, main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset + main_~i~0#1, 1);havoc main_#t~nondet24#1; 4460#L564-2 main_#t~post25#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post25#1;havoc main_#t~post25#1; 4461#L564-3 assume !!(main_~i~0#1 < main_~length1~0#1);havoc main_#t~nondet24#1;call write~int#1(main_#t~nondet24#1, main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset + main_~i~0#1, 1);havoc main_#t~nondet24#1; 4472#L564-2 main_#t~post25#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post25#1;havoc main_#t~post25#1; 4507#L564-3 assume !!(main_~i~0#1 < main_~length1~0#1);havoc main_#t~nondet24#1;call write~int#1(main_#t~nondet24#1, main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset + main_~i~0#1, 1);havoc main_#t~nondet24#1; 4503#L564-2 main_#t~post25#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post25#1;havoc main_#t~post25#1; 4504#L564-3 assume !!(main_~i~0#1 < main_~length1~0#1);havoc main_#t~nondet24#1;call write~int#1(main_#t~nondet24#1, main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset + main_~i~0#1, 1);havoc main_#t~nondet24#1; 4501#L564-2 main_#t~post25#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post25#1;havoc main_#t~post25#1; 4499#L564-3 assume !(main_~i~0#1 < main_~length1~0#1); 4500#L564-4 havoc main_~i~0#1;main_~i~1#1 := 0; 4450#L568-3 assume !!(main_~i~1#1 < main_~length2~0#1);havoc main_#t~nondet26#1;call write~int#0(main_#t~nondet26#1, main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset + main_~i~1#1, 1);havoc main_#t~nondet26#1; 4451#L568-2 main_#t~post27#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post27#1;havoc main_#t~post27#1; 4452#L568-3 assume !!(main_~i~1#1 < main_~length2~0#1);havoc main_#t~nondet26#1;call write~int#0(main_#t~nondet26#1, main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset + main_~i~1#1, 1);havoc main_#t~nondet26#1; 4453#L568-2 main_#t~post27#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post27#1;havoc main_#t~post27#1; 4538#L568-3 assume !!(main_~i~1#1 < main_~length2~0#1);havoc main_#t~nondet26#1;call write~int#0(main_#t~nondet26#1, main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset + main_~i~1#1, 1);havoc main_#t~nondet26#1; 4505#L568-2 main_#t~post27#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post27#1;havoc main_#t~post27#1; 4506#L568-3 assume !!(main_~i~1#1 < main_~length2~0#1);havoc main_#t~nondet26#1;call write~int#0(main_#t~nondet26#1, main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset + main_~i~1#1, 1);havoc main_#t~nondet26#1; 4497#L568-2 main_#t~post27#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post27#1;havoc main_#t~post27#1; 4498#L568-3 assume !(main_~i~1#1 < main_~length2~0#1); 4462#L568-4 havoc main_~i~1#1;call write~int#1(0, main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset + (main_~length1~0#1 - 1), 1);call write~int#0(0, main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset + (main_~length2~0#1 - 1), 1);assume { :begin_inline_cstrstr } true;cstrstr_#in~s#1.base, cstrstr_#in~s#1.offset, cstrstr_#in~find#1.base, cstrstr_#in~find#1.offset := main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset, main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset;havoc cstrstr_#res#1.base, cstrstr_#res#1.offset;havoc cstrstr_#t~post13#1.base, cstrstr_#t~post13#1.offset, cstrstr_#t~mem14#1, cstrstr_#t~ret15#1, cstrstr_#t~post16#1.base, cstrstr_#t~post16#1.offset, cstrstr_#t~mem17#1, cstrstr_#t~ret18#1, cstrstr_#t~post19#1.base, cstrstr_#t~post19#1.offset, cstrstr_~s#1.base, cstrstr_~s#1.offset, cstrstr_~find#1.base, cstrstr_~find#1.offset, cstrstr_~c~0#1, cstrstr_~sc~0#1, cstrstr_~len~0#1;cstrstr_~s#1.base, cstrstr_~s#1.offset := cstrstr_#in~s#1.base, cstrstr_#in~s#1.offset;cstrstr_~find#1.base, cstrstr_~find#1.offset := cstrstr_#in~find#1.base, cstrstr_#in~find#1.offset;havoc cstrstr_~c~0#1;havoc cstrstr_~sc~0#1;havoc cstrstr_~len~0#1;cstrstr_#t~post13#1.base, cstrstr_#t~post13#1.offset := cstrstr_~find#1.base, cstrstr_~find#1.offset;cstrstr_~find#1.base, cstrstr_~find#1.offset := cstrstr_#t~post13#1.base, 1 + cstrstr_#t~post13#1.offset;call cstrstr_#t~mem14#1 := read~int#0(cstrstr_#t~post13#1.base, cstrstr_#t~post13#1.offset, 1);cstrstr_~c~0#1 := cstrstr_#t~mem14#1; 4463#L540 assume 0 != cstrstr_~c~0#1;havoc cstrstr_#t~post13#1.base, cstrstr_#t~post13#1.offset;havoc cstrstr_#t~mem14#1;assume { :begin_inline_cstrlen } true;cstrlen_#in~str#1.base, cstrlen_#in~str#1.offset := cstrstr_~find#1.base, cstrstr_~find#1.offset;havoc cstrlen_#res#1;havoc cstrlen_#t~mem2#1, cstrlen_#t~pre3#1.base, cstrlen_#t~pre3#1.offset, cstrlen_~str#1.base, cstrlen_~str#1.offset, cstrlen_~s~0#1.base, cstrlen_~s~0#1.offset;cstrlen_~str#1.base, cstrlen_~str#1.offset := cstrlen_#in~str#1.base, cstrlen_#in~str#1.offset;havoc cstrlen_~s~0#1.base, cstrlen_~s~0#1.offset;cstrlen_~s~0#1.base, cstrlen_~s~0#1.offset := cstrlen_~str#1.base, cstrlen_~str#1.offset; 4444#L518-4 call cstrlen_#t~mem2#1 := read~int#0(cstrlen_~s~0#1.base, cstrlen_~s~0#1.offset, 1); 4445#L518-1 assume !!(0 != cstrlen_#t~mem2#1);havoc cstrlen_#t~mem2#1; 4471#L518-3 cstrlen_#t~pre3#1.base, cstrlen_#t~pre3#1.offset := cstrlen_~s~0#1.base, 1 + cstrlen_~s~0#1.offset;cstrlen_~s~0#1.base, cstrlen_~s~0#1.offset := cstrlen_~s~0#1.base, 1 + cstrlen_~s~0#1.offset;havoc cstrlen_#t~pre3#1.base, cstrlen_#t~pre3#1.offset; 4446#L518-4 call cstrlen_#t~mem2#1 := read~int#0(cstrlen_~s~0#1.base, cstrlen_~s~0#1.offset, 1); 4447#L518-1 assume !!(0 != cstrlen_#t~mem2#1);havoc cstrlen_#t~mem2#1; 4492#L518-3 cstrlen_#t~pre3#1.base, cstrlen_#t~pre3#1.offset := cstrlen_~s~0#1.base, 1 + cstrlen_~s~0#1.offset;cstrlen_~s~0#1.base, cstrlen_~s~0#1.offset := cstrlen_~s~0#1.base, 1 + cstrlen_~s~0#1.offset;havoc cstrlen_#t~pre3#1.base, cstrlen_#t~pre3#1.offset; 4490#L518-4 call cstrlen_#t~mem2#1 := read~int#0(cstrlen_~s~0#1.base, cstrlen_~s~0#1.offset, 1); 4473#L518-1 assume !(0 != cstrlen_#t~mem2#1);havoc cstrlen_#t~mem2#1; 4431#L518-5 assume cstrlen_~s~0#1.base == cstrlen_~str#1.base;cstrlen_#res#1 := cstrlen_~s~0#1.offset - cstrlen_~str#1.offset; 4423#cstrlen_returnLabel#1 cstrstr_#t~ret15#1 := cstrlen_#res#1;havoc cstrlen_#t~mem2#1, cstrlen_#t~pre3#1.base, cstrlen_#t~pre3#1.offset, cstrlen_~str#1.base, cstrlen_~str#1.offset, cstrlen_~s~0#1.base, cstrlen_~s~0#1.offset;havoc cstrlen_#in~str#1.base, cstrlen_#in~str#1.offset;assume { :end_inline_cstrlen } true;cstrstr_~len~0#1 := cstrstr_#t~ret15#1;havoc cstrstr_#t~ret15#1; 4424#L542-4 goto; 4448#L543-2 cstrstr_#t~post16#1.base, cstrstr_#t~post16#1.offset := cstrstr_~s#1.base, cstrstr_~s#1.offset;cstrstr_~s#1.base, cstrstr_~s#1.offset := cstrstr_#t~post16#1.base, 1 + cstrstr_#t~post16#1.offset;call cstrstr_#t~mem17#1 := read~int#1(cstrstr_#t~post16#1.base, cstrstr_#t~post16#1.offset, 1);cstrstr_~sc~0#1 := cstrstr_#t~mem17#1; 4432#L544 assume !(0 == cstrstr_~sc~0#1);havoc cstrstr_#t~post16#1.base, cstrstr_#t~post16#1.offset;havoc cstrstr_#t~mem17#1; 4433#L543 assume !(cstrstr_~sc~0#1 != cstrstr_~c~0#1); 4458#L542-1 assume { :begin_inline_cstrncmp } true;cstrncmp_#in~s1#1.base, cstrncmp_#in~s1#1.offset, cstrncmp_#in~s2#1.base, cstrncmp_#in~s2#1.offset, cstrncmp_#in~n#1 := cstrstr_~s#1.base, cstrstr_~s#1.offset, cstrstr_~find#1.base, cstrstr_~find#1.offset, cstrstr_~len~0#1;havoc cstrncmp_#res#1;havoc cstrncmp_#t~mem5#1, cstrncmp_#t~post4#1.base, cstrncmp_#t~post4#1.offset, cstrncmp_#t~mem6#1, cstrncmp_#t~mem8#1, cstrncmp_#t~pre7#1.base, cstrncmp_#t~pre7#1.offset, cstrncmp_#t~mem9#1, cstrncmp_#t~post10#1.base, cstrncmp_#t~post10#1.offset, cstrncmp_#t~mem11#1, cstrncmp_#t~pre12#1, cstrncmp_~s1#1.base, cstrncmp_~s1#1.offset, cstrncmp_~s2#1.base, cstrncmp_~s2#1.offset, cstrncmp_~n#1;cstrncmp_~s1#1.base, cstrncmp_~s1#1.offset := cstrncmp_#in~s1#1.base, cstrncmp_#in~s1#1.offset;cstrncmp_~s2#1.base, cstrncmp_~s2#1.offset := cstrncmp_#in~s2#1.base, cstrncmp_#in~s2#1.offset;cstrncmp_~n#1 := cstrncmp_#in~n#1; 4543#L525 assume !(0 == cstrncmp_~n#1 % 4294967296); 4544#L527-4 call cstrncmp_#t~mem5#1 := read~int#1(cstrncmp_~s1#1.base, cstrncmp_~s1#1.offset, 1);cstrncmp_#t~post4#1.base, cstrncmp_#t~post4#1.offset := cstrncmp_~s2#1.base, cstrncmp_~s2#1.offset;cstrncmp_~s2#1.base, cstrncmp_~s2#1.offset := cstrncmp_#t~post4#1.base, 1 + cstrncmp_#t~post4#1.offset;call cstrncmp_#t~mem6#1 := read~int#0(cstrncmp_#t~post4#1.base, cstrncmp_#t~post4#1.offset, 1); 4459#L528 assume cstrncmp_#t~mem5#1 != cstrncmp_#t~mem6#1;havoc cstrncmp_#t~mem5#1;havoc cstrncmp_#t~post4#1.base, cstrncmp_#t~post4#1.offset;havoc cstrncmp_#t~mem6#1;call cstrncmp_#t~mem8#1 := read~int#1(cstrncmp_~s1#1.base, cstrncmp_~s1#1.offset, 1);cstrncmp_#t~pre7#1.base, cstrncmp_#t~pre7#1.offset := cstrncmp_~s2#1.base, cstrncmp_~s2#1.offset - 1;cstrncmp_~s2#1.base, cstrncmp_~s2#1.offset := cstrncmp_~s2#1.base, cstrncmp_~s2#1.offset - 1;call cstrncmp_#t~mem9#1 := read~int#0(cstrncmp_#t~pre7#1.base, cstrncmp_#t~pre7#1.offset, 1);cstrncmp_#res#1 := (if cstrncmp_#t~mem8#1 % 256 % 4294967296 <= 2147483647 then cstrncmp_#t~mem8#1 % 256 % 4294967296 else cstrncmp_#t~mem8#1 % 256 % 4294967296 - 4294967296) - (if cstrncmp_#t~mem9#1 % 256 % 4294967296 <= 2147483647 then cstrncmp_#t~mem9#1 % 256 % 4294967296 else cstrncmp_#t~mem9#1 % 256 % 4294967296 - 4294967296);havoc cstrncmp_#t~mem8#1;havoc cstrncmp_#t~pre7#1.base, cstrncmp_#t~pre7#1.offset;havoc cstrncmp_#t~mem9#1; 4489#cstrncmp_returnLabel#1 cstrstr_#t~ret18#1 := cstrncmp_#res#1;havoc cstrncmp_#t~mem5#1, cstrncmp_#t~post4#1.base, cstrncmp_#t~post4#1.offset, cstrncmp_#t~mem6#1, cstrncmp_#t~mem8#1, cstrncmp_#t~pre7#1.base, cstrncmp_#t~pre7#1.offset, cstrncmp_#t~mem9#1, cstrncmp_#t~post10#1.base, cstrncmp_#t~post10#1.offset, cstrncmp_#t~mem11#1, cstrncmp_#t~pre12#1, cstrncmp_~s1#1.base, cstrncmp_~s1#1.offset, cstrncmp_~s2#1.base, cstrncmp_~s2#1.offset, cstrncmp_~n#1;havoc cstrncmp_#in~s1#1.base, cstrncmp_#in~s1#1.offset, cstrncmp_#in~s2#1.base, cstrncmp_#in~s2#1.offset, cstrncmp_#in~n#1;assume { :end_inline_cstrncmp } true; 4479#L542-2 assume !!(0 != cstrstr_#t~ret18#1);havoc cstrstr_#t~ret18#1; 4478#L542-4 goto; 4476#L543-2 cstrstr_#t~post16#1.base, cstrstr_#t~post16#1.offset := cstrstr_~s#1.base, cstrstr_~s#1.offset;cstrstr_~s#1.base, cstrstr_~s#1.offset := cstrstr_#t~post16#1.base, 1 + cstrstr_#t~post16#1.offset;call cstrstr_#t~mem17#1 := read~int#1(cstrstr_#t~post16#1.base, cstrstr_#t~post16#1.offset, 1);cstrstr_~sc~0#1 := cstrstr_#t~mem17#1; 4474#L544 assume !(0 == cstrstr_~sc~0#1);havoc cstrstr_#t~post16#1.base, cstrstr_#t~post16#1.offset;havoc cstrstr_#t~mem17#1; 4455#L543 assume !(cstrstr_~sc~0#1 != cstrstr_~c~0#1); 4456#L542-1 assume { :begin_inline_cstrncmp } true;cstrncmp_#in~s1#1.base, cstrncmp_#in~s1#1.offset, cstrncmp_#in~s2#1.base, cstrncmp_#in~s2#1.offset, cstrncmp_#in~n#1 := cstrstr_~s#1.base, cstrstr_~s#1.offset, cstrstr_~find#1.base, cstrstr_~find#1.offset, cstrstr_~len~0#1;havoc cstrncmp_#res#1;havoc cstrncmp_#t~mem5#1, cstrncmp_#t~post4#1.base, cstrncmp_#t~post4#1.offset, cstrncmp_#t~mem6#1, cstrncmp_#t~mem8#1, cstrncmp_#t~pre7#1.base, cstrncmp_#t~pre7#1.offset, cstrncmp_#t~mem9#1, cstrncmp_#t~post10#1.base, cstrncmp_#t~post10#1.offset, cstrncmp_#t~mem11#1, cstrncmp_#t~pre12#1, cstrncmp_~s1#1.base, cstrncmp_~s1#1.offset, cstrncmp_~s2#1.base, cstrncmp_~s2#1.offset, cstrncmp_~n#1;cstrncmp_~s1#1.base, cstrncmp_~s1#1.offset := cstrncmp_#in~s1#1.base, cstrncmp_#in~s1#1.offset;cstrncmp_~s2#1.base, cstrncmp_~s2#1.offset := cstrncmp_#in~s2#1.base, cstrncmp_#in~s2#1.offset;cstrncmp_~n#1 := cstrncmp_#in~n#1; 4419#L525 assume !(0 == cstrncmp_~n#1 % 4294967296); 4420#L527-4 [2024-10-15 00:22:49,781 INFO L747 eck$LassoCheckResult]: Loop: 4420#L527-4 call cstrncmp_#t~mem5#1 := read~int#1(cstrncmp_~s1#1.base, cstrncmp_~s1#1.offset, 1);cstrncmp_#t~post4#1.base, cstrncmp_#t~post4#1.offset := cstrncmp_~s2#1.base, cstrncmp_~s2#1.offset;cstrncmp_~s2#1.base, cstrncmp_~s2#1.offset := cstrncmp_#t~post4#1.base, 1 + cstrncmp_#t~post4#1.offset;call cstrncmp_#t~mem6#1 := read~int#0(cstrncmp_#t~post4#1.base, cstrncmp_#t~post4#1.offset, 1); 4441#L528 assume !(cstrncmp_#t~mem5#1 != cstrncmp_#t~mem6#1);havoc cstrncmp_#t~mem5#1;havoc cstrncmp_#t~post4#1.base, cstrncmp_#t~post4#1.offset;havoc cstrncmp_#t~mem6#1;cstrncmp_#t~post10#1.base, cstrncmp_#t~post10#1.offset := cstrncmp_~s1#1.base, cstrncmp_~s1#1.offset;cstrncmp_~s1#1.base, cstrncmp_~s1#1.offset := cstrncmp_#t~post10#1.base, 1 + cstrncmp_#t~post10#1.offset;call cstrncmp_#t~mem11#1 := read~int#1(cstrncmp_#t~post10#1.base, cstrncmp_#t~post10#1.offset, 1); 4438#L530 assume !(0 == cstrncmp_#t~mem11#1);havoc cstrncmp_#t~post10#1.base, cstrncmp_#t~post10#1.offset;havoc cstrncmp_#t~mem11#1; 4425#L527-1 cstrncmp_#t~pre12#1 := cstrncmp_~n#1 - 1;cstrncmp_~n#1 := cstrncmp_~n#1 - 1; 4426#L527-2 assume !!(0 != cstrncmp_#t~pre12#1 % 4294967296);havoc cstrncmp_#t~pre12#1; 4420#L527-4 [2024-10-15 00:22:49,782 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 00:22:49,782 INFO L85 PathProgramCache]: Analyzing trace with hash -1332858707, now seen corresponding path program 3 times [2024-10-15 00:22:49,782 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-15 00:22:49,782 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1937331533] [2024-10-15 00:22:49,782 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-15 00:22:49,783 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-15 00:22:49,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-15 00:22:49,820 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-15 00:22:49,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-15 00:22:49,855 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-15 00:22:49,856 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 00:22:49,856 INFO L85 PathProgramCache]: Analyzing trace with hash 118492775, now seen corresponding path program 6 times [2024-10-15 00:22:49,856 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-15 00:22:49,856 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2045550896] [2024-10-15 00:22:49,856 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-15 00:22:49,856 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-15 00:22:49,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-15 00:22:49,864 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-15 00:22:49,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-15 00:22:49,869 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-15 00:22:49,870 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 00:22:49,870 INFO L85 PathProgramCache]: Analyzing trace with hash -1922995909, now seen corresponding path program 2 times [2024-10-15 00:22:49,870 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-15 00:22:49,871 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1054144169] [2024-10-15 00:22:49,871 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-15 00:22:49,871 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-15 00:22:49,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-15 00:22:49,922 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-15 00:22:49,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-15 00:22:49,979 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-15 00:23:02,433 WARN L286 SmtUtils]: Spent 12.27s on a formula simplification. DAG size of input: 433 DAG size of output: 329 (called from [L 275] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.TransFormulaUtils.sequentialComposition) [2024-10-15 00:23:03,700 INFO L204 LassoAnalysis]: Preferences: [2024-10-15 00:23:03,700 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2024-10-15 00:23:03,700 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-10-15 00:23:03,701 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2024-10-15 00:23:03,701 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2024-10-15 00:23:03,701 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-15 00:23:03,701 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2024-10-15 00:23:03,701 INFO L131 ssoRankerPreferences]: Path of dumped script: [2024-10-15 00:23:03,701 INFO L132 ssoRankerPreferences]: Filename of dumped script: openbsd_cstrstr-alloca-2.i_Iteration17_Lasso [2024-10-15 00:23:03,701 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2024-10-15 00:23:03,701 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2024-10-15 00:23:03,707 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-15 00:23:03,710 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-15 00:23:03,711 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-15 00:23:03,713 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-15 00:23:03,715 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-15 00:23:03,717 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-15 00:23:03,720 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-15 00:23:03,722 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-15 00:23:03,729 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-15 00:23:03,733 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-15 00:23:03,737 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-15 00:23:03,740 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-15 00:23:03,745 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-15 00:23:03,748 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-15 00:23:03,750 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-15 00:23:04,392 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-15 00:23:04,394 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-15 00:23:04,396 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-15 00:23:04,397 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-15 00:23:04,399 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-15 00:23:04,401 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-15 00:23:04,403 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-15 00:23:04,405 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-15 00:23:04,407 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-15 00:23:04,409 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-15 00:23:04,410 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-15 00:23:04,412 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-15 00:23:04,414 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-15 00:23:04,415 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-15 00:23:04,417 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-15 00:23:04,419 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-15 00:23:04,421 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-15 00:23:04,423 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-15 00:23:04,425 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-15 00:23:04,427 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-15 00:23:04,433 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-15 00:23:04,436 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-15 00:23:04,437 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-15 00:23:04,439 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-15 00:23:04,441 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-15 00:23:04,443 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-15 00:23:04,445 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-15 00:23:04,446 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-15 00:23:04,447 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-15 00:23:04,449 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-15 00:23:04,450 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-15 00:23:04,451 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-15 00:23:04,453 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-15 00:23:04,454 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-15 00:23:04,456 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-15 00:23:04,457 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-15 00:23:04,458 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-15 00:23:04,460 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-15 00:23:04,461 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-15 00:23:04,463 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-15 00:23:04,464 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-15 00:23:04,465 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-15 00:23:04,467 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-15 00:23:04,468 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-15 00:23:04,470 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-15 00:23:04,471 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-15 00:23:04,472 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-15 00:23:04,474 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-15 00:23:04,475 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-15 00:23:04,477 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-15 00:23:04,478 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-15 00:23:05,517 INFO L259 LassoAnalysis]: Preprocessing complete. [2024-10-15 00:23:05,517 INFO L451 LassoAnalysis]: Using template 'affine'. [2024-10-15 00:23:05,517 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-15 00:23:05,517 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-15 00:23:05,520 INFO L229 MonitoredProcess]: Starting monitored process 91 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-15 00:23:05,522 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (91)] Waiting until timeout for monitored process [2024-10-15 00:23:05,524 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-10-15 00:23:05,535 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-15 00:23:05,535 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-15 00:23:05,535 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-15 00:23:05,535 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-15 00:23:05,535 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-15 00:23:05,536 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-15 00:23:05,536 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-15 00:23:05,537 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-15 00:23:05,548 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (91)] Forceful destruction successful, exit code 0 [2024-10-15 00:23:05,548 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-15 00:23:05,548 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-15 00:23:05,550 INFO L229 MonitoredProcess]: Starting monitored process 92 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-15 00:23:05,550 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (92)] Waiting until timeout for monitored process [2024-10-15 00:23:05,551 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-10-15 00:23:05,561 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-15 00:23:05,562 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-15 00:23:05,562 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-15 00:23:05,562 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-15 00:23:05,562 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-15 00:23:05,562 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-15 00:23:05,562 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-15 00:23:05,563 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-15 00:23:05,574 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (92)] Ended with exit code 0 [2024-10-15 00:23:05,574 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-15 00:23:05,574 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-15 00:23:05,576 INFO L229 MonitoredProcess]: Starting monitored process 93 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-15 00:23:05,576 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (93)] Waiting until timeout for monitored process [2024-10-15 00:23:05,577 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-10-15 00:23:05,587 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-15 00:23:05,588 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-15 00:23:05,588 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-15 00:23:05,588 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-15 00:23:05,588 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-15 00:23:05,588 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-15 00:23:05,588 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-15 00:23:05,589 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-15 00:23:05,600 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (93)] Ended with exit code 0 [2024-10-15 00:23:05,601 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-15 00:23:05,601 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-15 00:23:05,602 INFO L229 MonitoredProcess]: Starting monitored process 94 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-15 00:23:05,604 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (94)] Waiting until timeout for monitored process [2024-10-15 00:23:05,604 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-10-15 00:23:05,615 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-15 00:23:05,615 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-15 00:23:05,615 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-15 00:23:05,615 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-15 00:23:05,615 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-15 00:23:05,615 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-15 00:23:05,615 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-15 00:23:05,617 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-15 00:23:05,627 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (94)] Forceful destruction successful, exit code 0 [2024-10-15 00:23:05,628 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-15 00:23:05,628 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-15 00:23:05,630 INFO L229 MonitoredProcess]: Starting monitored process 95 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-15 00:23:05,630 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (95)] Waiting until timeout for monitored process [2024-10-15 00:23:05,631 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-10-15 00:23:05,641 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-15 00:23:05,641 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-15 00:23:05,641 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-15 00:23:05,641 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-15 00:23:05,641 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-15 00:23:05,642 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-15 00:23:05,642 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-15 00:23:05,643 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-15 00:23:05,654 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (95)] Ended with exit code 0 [2024-10-15 00:23:05,654 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-15 00:23:05,654 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-15 00:23:05,655 INFO L229 MonitoredProcess]: Starting monitored process 96 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-15 00:23:05,656 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (96)] Waiting until timeout for monitored process [2024-10-15 00:23:05,657 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-10-15 00:23:05,667 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-15 00:23:05,667 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-15 00:23:05,667 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-15 00:23:05,667 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-15 00:23:05,667 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-15 00:23:05,667 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-15 00:23:05,667 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-15 00:23:05,669 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-15 00:23:05,679 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (96)] Ended with exit code 0 [2024-10-15 00:23:05,680 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-15 00:23:05,680 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-15 00:23:05,681 INFO L229 MonitoredProcess]: Starting monitored process 97 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-15 00:23:05,682 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (97)] Waiting until timeout for monitored process [2024-10-15 00:23:05,683 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-10-15 00:23:05,693 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-15 00:23:05,693 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-15 00:23:05,693 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-15 00:23:05,693 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-15 00:23:05,694 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-10-15 00:23:05,694 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-10-15 00:23:05,697 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-15 00:23:05,708 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (97)] Ended with exit code 0 [2024-10-15 00:23:05,708 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-15 00:23:05,708 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-15 00:23:05,709 INFO L229 MonitoredProcess]: Starting monitored process 98 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-15 00:23:05,710 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (98)] Waiting until timeout for monitored process [2024-10-15 00:23:05,711 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-10-15 00:23:05,721 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-15 00:23:05,721 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-15 00:23:05,721 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-15 00:23:05,721 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-15 00:23:05,722 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-15 00:23:05,722 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-15 00:23:05,722 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-15 00:23:05,723 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-15 00:23:05,734 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (98)] Ended with exit code 0 [2024-10-15 00:23:05,734 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-15 00:23:05,735 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-15 00:23:05,736 INFO L229 MonitoredProcess]: Starting monitored process 99 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-15 00:23:05,737 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (99)] Waiting until timeout for monitored process [2024-10-15 00:23:05,738 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-10-15 00:23:05,749 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-15 00:23:05,749 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-15 00:23:05,749 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-15 00:23:05,749 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-15 00:23:05,749 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-15 00:23:05,749 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-15 00:23:05,749 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-15 00:23:05,751 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-15 00:23:05,762 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (99)] Ended with exit code 0 [2024-10-15 00:23:05,763 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-15 00:23:05,763 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-15 00:23:05,764 INFO L229 MonitoredProcess]: Starting monitored process 100 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-15 00:23:05,765 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (100)] Waiting until timeout for monitored process [2024-10-15 00:23:05,766 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-10-15 00:23:05,776 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-15 00:23:05,776 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-15 00:23:05,776 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-15 00:23:05,776 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-15 00:23:05,776 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-15 00:23:05,777 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-15 00:23:05,777 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-15 00:23:05,778 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-15 00:23:05,789 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (100)] Ended with exit code 0 [2024-10-15 00:23:05,789 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-15 00:23:05,790 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-15 00:23:05,791 INFO L229 MonitoredProcess]: Starting monitored process 101 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-15 00:23:05,792 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (101)] Waiting until timeout for monitored process [2024-10-15 00:23:05,792 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-10-15 00:23:05,803 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-15 00:23:05,803 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-15 00:23:05,803 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-15 00:23:05,803 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-15 00:23:05,803 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-15 00:23:05,804 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-15 00:23:05,804 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-15 00:23:05,805 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-15 00:23:05,816 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (101)] Ended with exit code 0 [2024-10-15 00:23:05,816 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-15 00:23:05,816 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-15 00:23:05,817 INFO L229 MonitoredProcess]: Starting monitored process 102 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-15 00:23:05,818 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (102)] Waiting until timeout for monitored process [2024-10-15 00:23:05,819 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-10-15 00:23:05,829 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-15 00:23:05,829 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-15 00:23:05,830 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-15 00:23:05,830 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-15 00:23:05,830 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-15 00:23:05,830 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-15 00:23:05,830 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-15 00:23:05,831 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-15 00:23:05,842 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (102)] Ended with exit code 0 [2024-10-15 00:23:05,842 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-15 00:23:05,842 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-15 00:23:05,843 INFO L229 MonitoredProcess]: Starting monitored process 103 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-15 00:23:05,844 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (103)] Waiting until timeout for monitored process [2024-10-15 00:23:05,845 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-10-15 00:23:05,854 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-15 00:23:05,855 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-15 00:23:05,855 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-15 00:23:05,855 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-15 00:23:05,855 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-15 00:23:05,855 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-15 00:23:05,855 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-15 00:23:05,856 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-15 00:23:05,867 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (103)] Ended with exit code 0 [2024-10-15 00:23:05,868 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-15 00:23:05,868 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-15 00:23:05,869 INFO L229 MonitoredProcess]: Starting monitored process 104 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-15 00:23:05,869 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (104)] Waiting until timeout for monitored process [2024-10-15 00:23:05,870 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-10-15 00:23:05,880 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-15 00:23:05,880 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-15 00:23:05,880 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-15 00:23:05,880 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-15 00:23:05,880 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-15 00:23:05,881 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-15 00:23:05,881 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-15 00:23:05,882 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-15 00:23:05,892 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (104)] Ended with exit code 0 [2024-10-15 00:23:05,892 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-15 00:23:05,893 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-15 00:23:05,894 INFO L229 MonitoredProcess]: Starting monitored process 105 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-15 00:23:05,895 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (105)] Waiting until timeout for monitored process [2024-10-15 00:23:05,895 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-10-15 00:23:05,905 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-15 00:23:05,905 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-15 00:23:05,906 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-15 00:23:05,906 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-15 00:23:05,907 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-10-15 00:23:05,907 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-10-15 00:23:05,911 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-15 00:23:05,926 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (105)] Ended with exit code 0 [2024-10-15 00:23:05,927 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-15 00:23:05,927 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-15 00:23:05,928 INFO L229 MonitoredProcess]: Starting monitored process 106 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-15 00:23:05,929 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (106)] Waiting until timeout for monitored process [2024-10-15 00:23:05,929 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-10-15 00:23:05,940 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-15 00:23:05,940 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-15 00:23:05,940 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-15 00:23:05,940 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-15 00:23:05,941 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-10-15 00:23:05,941 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-10-15 00:23:05,943 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-15 00:23:05,954 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (106)] Ended with exit code 0 [2024-10-15 00:23:05,954 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-15 00:23:05,955 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-15 00:23:05,956 INFO L229 MonitoredProcess]: Starting monitored process 107 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-15 00:23:05,957 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (107)] Waiting until timeout for monitored process [2024-10-15 00:23:05,957 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-10-15 00:23:05,967 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-15 00:23:05,968 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-15 00:23:05,968 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-15 00:23:05,968 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-15 00:23:05,969 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-10-15 00:23:05,969 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-10-15 00:23:05,971 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-15 00:23:05,983 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (107)] Ended with exit code 0 [2024-10-15 00:23:05,983 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-15 00:23:05,983 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-15 00:23:05,984 INFO L229 MonitoredProcess]: Starting monitored process 108 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-15 00:23:05,985 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (108)] Waiting until timeout for monitored process [2024-10-15 00:23:05,986 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-10-15 00:23:05,996 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-15 00:23:05,996 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-15 00:23:05,996 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-15 00:23:05,996 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-15 00:23:05,997 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-10-15 00:23:05,997 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-10-15 00:23:06,000 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-15 00:23:06,011 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (108)] Ended with exit code 0 [2024-10-15 00:23:06,011 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-15 00:23:06,011 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-15 00:23:06,012 INFO L229 MonitoredProcess]: Starting monitored process 109 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-15 00:23:06,013 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (109)] Waiting until timeout for monitored process [2024-10-15 00:23:06,014 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-10-15 00:23:06,024 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-15 00:23:06,024 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-15 00:23:06,024 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-15 00:23:06,024 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-15 00:23:06,025 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-10-15 00:23:06,025 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-10-15 00:23:06,028 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-15 00:23:06,039 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (109)] Ended with exit code 0 [2024-10-15 00:23:06,040 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-15 00:23:06,040 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-15 00:23:06,041 INFO L229 MonitoredProcess]: Starting monitored process 110 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-15 00:23:06,042 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (110)] Waiting until timeout for monitored process [2024-10-15 00:23:06,043 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-10-15 00:23:06,053 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-15 00:23:06,054 INFO L203 nArgumentSynthesizer]: 4 stem disjuncts [2024-10-15 00:23:06,054 INFO L204 nArgumentSynthesizer]: 2 loop disjuncts [2024-10-15 00:23:06,054 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-15 00:23:06,078 INFO L401 nArgumentSynthesizer]: We have 28 Motzkin's Theorem applications. [2024-10-15 00:23:06,079 INFO L402 nArgumentSynthesizer]: A total of 4 supporting invariants were added. [2024-10-15 00:23:06,112 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-15 00:23:06,124 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (110)] Ended with exit code 0 [2024-10-15 00:23:06,124 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-15 00:23:06,125 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-15 00:23:06,126 INFO L229 MonitoredProcess]: Starting monitored process 111 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-15 00:23:06,127 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (111)] Waiting until timeout for monitored process [2024-10-15 00:23:06,128 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-10-15 00:23:06,139 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-15 00:23:06,140 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-15 00:23:06,140 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-15 00:23:06,140 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-15 00:23:06,145 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-10-15 00:23:06,145 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-10-15 00:23:06,154 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-15 00:23:06,165 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (111)] Ended with exit code 0 [2024-10-15 00:23:06,165 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-15 00:23:06,165 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-15 00:23:06,166 INFO L229 MonitoredProcess]: Starting monitored process 112 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-15 00:23:06,167 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (112)] Waiting until timeout for monitored process [2024-10-15 00:23:06,168 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-10-15 00:23:06,177 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-15 00:23:06,178 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-15 00:23:06,178 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-15 00:23:06,178 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-15 00:23:06,179 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-10-15 00:23:06,179 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-10-15 00:23:06,183 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-15 00:23:06,193 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (112)] Ended with exit code 0 [2024-10-15 00:23:06,193 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-15 00:23:06,194 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-15 00:23:06,195 INFO L229 MonitoredProcess]: Starting monitored process 113 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-15 00:23:06,196 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (113)] Waiting until timeout for monitored process [2024-10-15 00:23:06,196 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-10-15 00:23:06,206 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-15 00:23:06,206 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-15 00:23:06,206 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-15 00:23:06,206 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-15 00:23:06,209 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-10-15 00:23:06,209 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-10-15 00:23:06,215 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2024-10-15 00:23:06,224 INFO L443 ModelExtractionUtils]: Simplification made 8 calls to the SMT solver. [2024-10-15 00:23:06,224 INFO L444 ModelExtractionUtils]: 1 out of 13 variables were initially zero. Simplification set additionally 9 variables to zero. [2024-10-15 00:23:06,224 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-15 00:23:06,224 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-15 00:23:06,226 INFO L229 MonitoredProcess]: Starting monitored process 114 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-15 00:23:06,227 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (114)] Waiting until timeout for monitored process [2024-10-15 00:23:06,227 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2024-10-15 00:23:06,238 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2024-10-15 00:23:06,238 INFO L474 LassoAnalysis]: Proved termination. [2024-10-15 00:23:06,238 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_cstrncmp_~s1#1.offset, v_rep(select #length ULTIMATE.start_cstrncmp_~s1#1.base)_2) = -1*ULTIMATE.start_cstrncmp_~s1#1.offset + 1*v_rep(select #length ULTIMATE.start_cstrncmp_~s1#1.base)_2 Supporting invariants [] [2024-10-15 00:23:06,249 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (113)] Ended with exit code 0 [2024-10-15 00:23:06,283 INFO L156 tatePredicateManager]: 17 out of 17 supporting invariants were superfluous and have been removed [2024-10-15 00:23:06,284 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~s1!offset [2024-10-15 00:23:06,284 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #length [2024-10-15 00:23:06,284 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#length,GLOBAL] [2024-10-15 00:23:06,293 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 00:23:06,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 00:23:06,352 INFO L255 TraceCheckSpWp]: Trace formula consists of 345 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-15 00:23:06,353 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-15 00:23:06,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 00:23:06,416 INFO L255 TraceCheckSpWp]: Trace formula consists of 44 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-10-15 00:23:06,416 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-15 00:23:06,442 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-15 00:23:06,443 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 3 loop predicates [2024-10-15 00:23:06,443 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 133 states and 151 transitions. cyclomatic complexity: 28 Second operand has 4 states, 4 states have (on average 9.0) internal successors, (36), 4 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-15 00:23:06,466 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 133 states and 151 transitions. cyclomatic complexity: 28. Second operand has 4 states, 4 states have (on average 9.0) internal successors, (36), 4 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 156 states and 178 transitions. Complement of second has 7 states. [2024-10-15 00:23:06,467 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 [2024-10-15 00:23:06,467 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 9.0) internal successors, (36), 4 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-15 00:23:06,467 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 33 transitions. [2024-10-15 00:23:06,468 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 33 transitions. Stem has 52 letters. Loop has 5 letters. [2024-10-15 00:23:06,468 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-10-15 00:23:06,468 INFO L682 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2024-10-15 00:23:06,478 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 00:23:06,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 00:23:06,537 INFO L255 TraceCheckSpWp]: Trace formula consists of 345 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-15 00:23:06,538 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-15 00:23:06,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 00:23:06,614 INFO L255 TraceCheckSpWp]: Trace formula consists of 44 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-10-15 00:23:06,614 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-15 00:23:06,648 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-15 00:23:06,649 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.1 stem predicates 3 loop predicates [2024-10-15 00:23:06,649 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 133 states and 151 transitions. cyclomatic complexity: 28 Second operand has 4 states, 4 states have (on average 9.0) internal successors, (36), 4 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-15 00:23:06,678 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 133 states and 151 transitions. cyclomatic complexity: 28. Second operand has 4 states, 4 states have (on average 9.0) internal successors, (36), 4 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 154 states and 176 transitions. Complement of second has 7 states. [2024-10-15 00:23:06,678 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 [2024-10-15 00:23:06,679 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 9.0) internal successors, (36), 4 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-15 00:23:06,679 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 32 transitions. [2024-10-15 00:23:06,679 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 32 transitions. Stem has 52 letters. Loop has 5 letters. [2024-10-15 00:23:06,679 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-10-15 00:23:06,679 INFO L682 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2024-10-15 00:23:06,695 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 00:23:06,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 00:23:06,767 INFO L255 TraceCheckSpWp]: Trace formula consists of 345 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-15 00:23:06,769 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-15 00:23:06,843 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (114)] Forceful destruction successful, exit code 0 [2024-10-15 00:23:06,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 00:23:06,872 INFO L255 TraceCheckSpWp]: Trace formula consists of 44 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-10-15 00:23:06,873 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-15 00:23:06,905 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-15 00:23:06,905 INFO L141 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.1 stem predicates 3 loop predicates [2024-10-15 00:23:06,906 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 133 states and 151 transitions. cyclomatic complexity: 28 Second operand has 4 states, 4 states have (on average 9.0) internal successors, (36), 4 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-15 00:23:06,927 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 133 states and 151 transitions. cyclomatic complexity: 28. Second operand has 4 states, 4 states have (on average 9.0) internal successors, (36), 4 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 162 states and 186 transitions. Complement of second has 6 states. [2024-10-15 00:23:06,928 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 [2024-10-15 00:23:06,929 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 9.0) internal successors, (36), 4 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-15 00:23:06,929 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 42 transitions. [2024-10-15 00:23:06,929 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 42 transitions. Stem has 52 letters. Loop has 5 letters. [2024-10-15 00:23:06,929 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-10-15 00:23:06,929 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 42 transitions. Stem has 57 letters. Loop has 5 letters. [2024-10-15 00:23:06,930 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-10-15 00:23:06,930 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 42 transitions. Stem has 52 letters. Loop has 10 letters. [2024-10-15 00:23:06,930 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-10-15 00:23:06,930 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 162 states and 186 transitions. [2024-10-15 00:23:06,933 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2024-10-15 00:23:06,934 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 162 states to 0 states and 0 transitions. [2024-10-15 00:23:06,934 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2024-10-15 00:23:06,934 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2024-10-15 00:23:06,934 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2024-10-15 00:23:06,934 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2024-10-15 00:23:06,934 INFO L218 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-10-15 00:23:06,934 INFO L240 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-10-15 00:23:06,934 INFO L425 stractBuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-10-15 00:23:06,934 INFO L332 stractBuchiCegarLoop]: ======== Iteration 18 ============ [2024-10-15 00:23:06,934 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2024-10-15 00:23:06,935 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2024-10-15 00:23:06,935 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2024-10-15 00:23:06,940 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 15.10 12:23:06 BoogieIcfgContainer [2024-10-15 00:23:06,940 INFO L131 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2024-10-15 00:23:06,941 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-15 00:23:06,941 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-15 00:23:06,941 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-15 00:23:06,941 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.10 12:22:17" (3/4) ... [2024-10-15 00:23:06,943 INFO L142 WitnessPrinter]: No result that supports witness generation found [2024-10-15 00:23:06,944 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-15 00:23:06,944 INFO L158 Benchmark]: Toolchain (without parser) took 50655.70ms. Allocated memory was 161.5MB in the beginning and 520.1MB in the end (delta: 358.6MB). Free memory was 101.4MB in the beginning and 451.2MB in the end (delta: -349.8MB). Peak memory consumption was 8.9MB. Max. memory is 16.1GB. [2024-10-15 00:23:06,944 INFO L158 Benchmark]: CDTParser took 0.24ms. Allocated memory is still 92.3MB. Free memory is still 45.4MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-15 00:23:06,944 INFO L158 Benchmark]: CACSL2BoogieTranslator took 563.07ms. Allocated memory is still 161.5MB. Free memory was 101.1MB in the beginning and 124.3MB in the end (delta: -23.3MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2024-10-15 00:23:06,945 INFO L158 Benchmark]: Boogie Procedure Inliner took 58.56ms. Allocated memory is still 161.5MB. Free memory was 124.3MB in the beginning and 121.6MB in the end (delta: 2.7MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-10-15 00:23:06,945 INFO L158 Benchmark]: Boogie Preprocessor took 83.21ms. Allocated memory is still 161.5MB. Free memory was 121.6MB in the beginning and 118.9MB in the end (delta: 2.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-15 00:23:06,945 INFO L158 Benchmark]: RCFGBuilder took 496.71ms. Allocated memory is still 161.5MB. Free memory was 118.9MB in the beginning and 100.6MB in the end (delta: 18.2MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. [2024-10-15 00:23:06,945 INFO L158 Benchmark]: BuchiAutomizer took 49445.54ms. Allocated memory was 161.5MB in the beginning and 520.1MB in the end (delta: 358.6MB). Free memory was 100.6MB in the beginning and 451.2MB in the end (delta: -350.5MB). Peak memory consumption was 8.7MB. Max. memory is 16.1GB. [2024-10-15 00:23:06,945 INFO L158 Benchmark]: Witness Printer took 2.91ms. Allocated memory is still 520.1MB. Free memory is still 451.2MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-15 00:23:06,947 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.24ms. Allocated memory is still 92.3MB. Free memory is still 45.4MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 563.07ms. Allocated memory is still 161.5MB. Free memory was 101.1MB in the beginning and 124.3MB in the end (delta: -23.3MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 58.56ms. Allocated memory is still 161.5MB. Free memory was 124.3MB in the beginning and 121.6MB in the end (delta: 2.7MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 83.21ms. Allocated memory is still 161.5MB. Free memory was 121.6MB in the beginning and 118.9MB in the end (delta: 2.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 496.71ms. Allocated memory is still 161.5MB. Free memory was 118.9MB in the beginning and 100.6MB in the end (delta: 18.2MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. * BuchiAutomizer took 49445.54ms. Allocated memory was 161.5MB in the beginning and 520.1MB in the end (delta: 358.6MB). Free memory was 100.6MB in the beginning and 451.2MB in the end (delta: -350.5MB). Peak memory consumption was 8.7MB. Max. memory is 16.1GB. * Witness Printer took 2.91ms. Allocated memory is still 520.1MB. Free memory is still 451.2MB. There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~s~0!offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #length - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#length,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~s!offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #length - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#length,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~s1!offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #length - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#length,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~s1!offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #length - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#length,GLOBAL] * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 17 terminating modules (11 trivial, 5 deterministic, 1 nondeterministic). One deterministic module has affine ranking function (length1 + ((long long) -1 * i)) and consists of 4 locations. One deterministic module has affine ranking function (length2 + ((long long) -1 * i)) and consists of 3 locations. One deterministic module has affine ranking function null and consists of 5 locations. One deterministic module has affine ranking function null and consists of 5 locations. One deterministic module has affine ranking function null and consists of 6 locations. One nondeterministic module has affine ranking function null and consists of 4 locations. 11 modules have a trivial ranking function, the largest among these consists of 36 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 49.3s and 18 iterations. TraceHistogramMax:4. Analysis of lassos took 44.5s. Construction of modules took 1.3s. Büchi inclusion checks took 3.3s. Highest rank in rank-based complementation 3. Minimization of det autom 7. Minimization of nondet autom 10. Automata minimization 0.1s AutomataMinimizationTime, 16 MinimizatonAttempts, 54 StatesRemovedByMinimization, 12 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had -1 states and ocurred in iteration -1. Nontrivial modules had stage [5, 0, 1, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 628 SdHoareTripleChecker+Valid, 1.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 623 mSDsluCounter, 3249 SdHoareTripleChecker+Invalid, 1.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 2718 mSDsCounter, 125 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2223 IncrementalHoareTripleChecker+Invalid, 2348 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 125 mSolverCounterUnsat, 531 mSDtfsCounter, 2223 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown LassoAnalysisResults: nont0 unkn0 SFLI1 SFLT0 conc5 concLT0 SILN0 SILU5 SILI0 SILT0 lasso6 LassoPreprocessingBenchmarks: Lassos: inital210 mio100 ax109 hnf100 lsp88 ukn69 mio100 lsp31 div159 bol100 ite100 ukn100 eq166 hnf92 smp81 dnf194 smp91 tf100 neg100 sie106 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 72ms VariablesStem: 13 VariablesLoop: 6 DisjunctsStem: 4 DisjunctsLoop: 2 SupportingInvariants: 4 MotzkinApplications: 28 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 0 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 0 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.0s InitialAbstractionConstructionTime: 0.0s - TerminationAnalysisResult: Termination proven Buchi Automizer proved that your program is terminating RESULT: Ultimate proved your program to be correct! [2024-10-15 00:23:06,971 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (90)] Ended with exit code 0 [2024-10-15 00:23:07,172 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (89)] Ended with exit code 0 [2024-10-15 00:23:07,371 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (83)] Ended with exit code 0 [2024-10-15 00:23:07,575 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (82)] Ended with exit code 0 [2024-10-15 00:23:07,779 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (37)] Forceful destruction successful, exit code 0 [2024-10-15 00:23:07,981 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Ended with exit code 0 [2024-10-15 00:23:08,181 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Ended with exit code 0 [2024-10-15 00:23:08,384 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE