./Ultimate.py --spec ../sv-benchmarks/c/properties/termination.prp --file ../sv-benchmarks/c/termination-dietlibc/basename-3.i --full-output --architecture 64bit


--------------------------------------------------------------------------------


Checking for termination
Using default analysis
Version 3061b6dc
Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/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 ../sv-benchmarks/c/termination-dietlibc/basename-3.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-64bit-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 64bit --witnessprinter.graph.data.programhash 2e90cfbacdda20e6be76d151b413bd2dd94f7cfd4eb0e599012526f6643aab85
--- Real Ultimate output ---
This is Ultimate 0.2.5-tmp.dk.eval-assert-order-craig-3061b6d-m
[2024-11-19 14:17:49,913 INFO  L188        SettingsManager]: Resetting all preferences to default values...
[2024-11-19 14:17:49,991 INFO  L114        SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-64bit-Automizer_Default.epf
[2024-11-19 14:17:50,004 WARN  L101        SettingsManager]: Preference file contains the following unknown settings:
[2024-11-19 14:17:50,005 WARN  L103        SettingsManager]:   * de.uni_freiburg.informatik.ultimate.core.Log level for class
[2024-11-19 14:17:50,026 INFO  L130        SettingsManager]: Preferences different from defaults after loading the file:
[2024-11-19 14:17:50,027 INFO  L151        SettingsManager]: Preferences of UltimateCore differ from their defaults:
[2024-11-19 14:17:50,027 INFO  L153        SettingsManager]:  * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR;
[2024-11-19 14:17:50,028 INFO  L151        SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults:
[2024-11-19 14:17:50,028 INFO  L153        SettingsManager]:  * Use memory slicer=true
[2024-11-19 14:17:50,029 INFO  L151        SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults:
[2024-11-19 14:17:50,029 INFO  L153        SettingsManager]:  * Create parallel compositions if possible=false
[2024-11-19 14:17:50,030 INFO  L153        SettingsManager]:  * Use SBE=true
[2024-11-19 14:17:50,030 INFO  L151        SettingsManager]: Preferences of BuchiAutomizer differ from their defaults:
[2024-11-19 14:17:50,031 INFO  L153        SettingsManager]:  * NCSB implementation=INTSET_LAZY3
[2024-11-19 14:17:50,031 INFO  L153        SettingsManager]:  * Use old map elimination=false
[2024-11-19 14:17:50,031 INFO  L153        SettingsManager]:  * Use external solver (rank synthesis)=false
[2024-11-19 14:17:50,032 INFO  L153        SettingsManager]:  * Use only trivial implications for array writes=true
[2024-11-19 14:17:50,032 INFO  L153        SettingsManager]:  * Rank analysis=LINEAR_WITH_GUESSES
[2024-11-19 14:17:50,033 INFO  L151        SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults:
[2024-11-19 14:17:50,033 INFO  L153        SettingsManager]:  * Pointer base address is valid at dereference=ASSUME
[2024-11-19 14:17:50,033 INFO  L153        SettingsManager]:  * Overapproximate operations on floating types=true
[2024-11-19 14:17:50,034 INFO  L153        SettingsManager]:  * Check division by zero=IGNORE
[2024-11-19 14:17:50,034 INFO  L153        SettingsManager]:  * Pointer to allocated memory at dereference=ASSUME
[2024-11-19 14:17:50,034 INFO  L153        SettingsManager]:  * If two pointers are subtracted or compared they have the same base address=ASSUME
[2024-11-19 14:17:50,035 INFO  L153        SettingsManager]:  * Check array bounds for arrays that are off heap=ASSUME
[2024-11-19 14:17:50,035 INFO  L153        SettingsManager]:  * Allow undefined functions=false
[2024-11-19 14:17:50,035 INFO  L153        SettingsManager]:  * Check unreachability of reach_error function=false
[2024-11-19 14:17:50,036 INFO  L153        SettingsManager]:  * Check if freed pointer was valid=false
[2024-11-19 14:17:50,036 INFO  L153        SettingsManager]:  * Assume nondeterminstic values are in range=false
[2024-11-19 14:17:50,036 INFO  L153        SettingsManager]:  * Use constant arrays=true
[2024-11-19 14:17:50,037 INFO  L151        SettingsManager]: Preferences of RCFGBuilder differ from their defaults:
[2024-11-19 14:17:50,037 INFO  L153        SettingsManager]:  * Size of a code block=SequenceOfStatements
[2024-11-19 14:17:50,037 INFO  L151        SettingsManager]: Preferences of TraceAbstraction differ from their defaults:
[2024-11-19 14:17:50,038 INFO  L153        SettingsManager]:  * Trace refinement strategy=CAMEL
[2024-11-19 14:17:50,038 INFO  L151        SettingsManager]: Preferences of IcfgTransformer differ from their defaults:
[2024-11-19 14:17:50,038 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 -> 64bit
Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 2e90cfbacdda20e6be76d151b413bd2dd94f7cfd4eb0e599012526f6643aab85
[2024-11-19 14:17:50,296 INFO  L75    nceAwareModelManager]: Repository-Root is: /tmp
[2024-11-19 14:17:50,320 INFO  L261   ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized
[2024-11-19 14:17:50,323 INFO  L217   ainManager$Toolchain]: [Toolchain 1]: Toolchain selected.
[2024-11-19 14:17:50,324 INFO  L270        PluginConnector]: Initializing CDTParser...
[2024-11-19 14:17:50,325 INFO  L274        PluginConnector]: CDTParser initialized
[2024-11-19 14:17:50,327 INFO  L431   ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/termination-dietlibc/basename-3.i
[2024-11-19 14:17:51,778 INFO  L533              CDTParser]: Created temporary CDT project at NULL
[2024-11-19 14:17:51,995 INFO  L384              CDTParser]: Found 1 translation units.
[2024-11-19 14:17:51,997 INFO  L180              CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/termination-dietlibc/basename-3.i
[2024-11-19 14:17:52,011 INFO  L427              CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cbec6aedb/065aff320f234e0584590dfacc5c8dc1/FLAG4ce8b09b4
[2024-11-19 14:17:52,023 INFO  L435              CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cbec6aedb/065aff320f234e0584590dfacc5c8dc1
[2024-11-19 14:17:52,025 INFO  L299   ainManager$Toolchain]: ####################### [Toolchain 1] #######################
[2024-11-19 14:17:52,026 INFO  L133        ToolchainWalker]: Walking toolchain with 6 elements.
[2024-11-19 14:17:52,027 INFO  L112        PluginConnector]: ------------------------CACSL2BoogieTranslator----------------------------
[2024-11-19 14:17:52,028 INFO  L270        PluginConnector]: Initializing CACSL2BoogieTranslator...
[2024-11-19 14:17:52,034 INFO  L274        PluginConnector]: CACSL2BoogieTranslator initialized
[2024-11-19 14:17:52,035 INFO  L184        PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 02:17:52" (1/1) ...
[2024-11-19 14:17:52,036 INFO  L204        PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@51b18eb4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 02:17:52, skipping insertion in model container
[2024-11-19 14:17:52,036 INFO  L184        PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 02:17:52" (1/1) ...
[2024-11-19 14:17:52,078 INFO  L175         MainTranslator]: Built tables and reachable declarations
[2024-11-19 14:17:52,411 INFO  L210          PostProcessor]: Analyzing one entry point: main
[2024-11-19 14:17:52,424 INFO  L200         MainTranslator]: Completed pre-run
[2024-11-19 14:17:52,467 INFO  L210          PostProcessor]: Analyzing one entry point: main
[2024-11-19 14:17:52,497 INFO  L204         MainTranslator]: Completed translation
[2024-11-19 14:17:52,498 INFO  L201        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 02:17:52 WrapperNode
[2024-11-19 14:17:52,498 INFO  L131        PluginConnector]: ------------------------ END CACSL2BoogieTranslator----------------------------
[2024-11-19 14:17:52,499 INFO  L112        PluginConnector]: ------------------------Boogie Procedure Inliner----------------------------
[2024-11-19 14:17:52,499 INFO  L270        PluginConnector]: Initializing Boogie Procedure Inliner...
[2024-11-19 14:17:52,499 INFO  L274        PluginConnector]: Boogie Procedure Inliner initialized
[2024-11-19 14:17:52,505 INFO  L184        PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 02:17:52" (1/1) ...
[2024-11-19 14:17:52,517 INFO  L184        PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 02:17:52" (1/1) ...
[2024-11-19 14:17:52,540 INFO  L138                Inliner]: procedures = 114, calls = 12, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 66
[2024-11-19 14:17:52,541 INFO  L131        PluginConnector]: ------------------------ END Boogie Procedure Inliner----------------------------
[2024-11-19 14:17:52,541 INFO  L112        PluginConnector]: ------------------------Boogie Preprocessor----------------------------
[2024-11-19 14:17:52,541 INFO  L270        PluginConnector]: Initializing Boogie Preprocessor...
[2024-11-19 14:17:52,542 INFO  L274        PluginConnector]: Boogie Preprocessor initialized
[2024-11-19 14:17:52,551 INFO  L184        PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 02:17:52" (1/1) ...
[2024-11-19 14:17:52,551 INFO  L184        PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 02:17:52" (1/1) ...
[2024-11-19 14:17:52,554 INFO  L184        PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 02:17:52" (1/1) ...
[2024-11-19 14:17:52,572 INFO  L175           MemorySlicer]: Split 5 memory accesses to 1 slices as follows [5]. 100 percent of accesses are in the largest equivalence class. The 0 initializations are split as follows [0]. The 2 writes are split as follows [2].
[2024-11-19 14:17:52,572 INFO  L184        PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 02:17:52" (1/1) ...
[2024-11-19 14:17:52,572 INFO  L184        PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 02:17:52" (1/1) ...
[2024-11-19 14:17:52,582 INFO  L184        PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 02:17:52" (1/1) ...
[2024-11-19 14:17:52,589 INFO  L184        PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 02:17:52" (1/1) ...
[2024-11-19 14:17:52,592 INFO  L184        PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 02:17:52" (1/1) ...
[2024-11-19 14:17:52,593 INFO  L184        PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 02:17:52" (1/1) ...
[2024-11-19 14:17:52,595 INFO  L131        PluginConnector]: ------------------------ END Boogie Preprocessor----------------------------
[2024-11-19 14:17:52,599 INFO  L112        PluginConnector]: ------------------------RCFGBuilder----------------------------
[2024-11-19 14:17:52,599 INFO  L270        PluginConnector]: Initializing RCFGBuilder...
[2024-11-19 14:17:52,599 INFO  L274        PluginConnector]: RCFGBuilder initialized
[2024-11-19 14:17:52,600 INFO  L184        PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 02:17:52" (1/1) ...
[2024-11-19 14:17:52,609 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000
[2024-11-19 14:17:52,622 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3
[2024-11-19 14:17:52,638 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-11-19 14:17:52,642 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-11-19 14:17:52,690 INFO  L130     BoogieDeclarations]: Found specification of procedure read~int#0
[2024-11-19 14:17:52,690 INFO  L130     BoogieDeclarations]: Found specification of procedure write~int#0
[2024-11-19 14:17:52,690 INFO  L130     BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack
[2024-11-19 14:17:52,690 INFO  L130     BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc
[2024-11-19 14:17:52,691 INFO  L130     BoogieDeclarations]: Found specification of procedure ULTIMATE.start
[2024-11-19 14:17:52,691 INFO  L138     BoogieDeclarations]: Found implementation of procedure ULTIMATE.start
[2024-11-19 14:17:52,765 INFO  L238             CfgBuilder]: Building ICFG
[2024-11-19 14:17:52,766 INFO  L264             CfgBuilder]: Building CFG for each procedure with an implementation
[2024-11-19 14:17:52,932 INFO  L?                        ?]: Removed 33 outVars from TransFormulas that were not future-live.
[2024-11-19 14:17:52,932 INFO  L287             CfgBuilder]: Performing block encoding
[2024-11-19 14:17:52,946 INFO  L311             CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start)
[2024-11-19 14:17:52,947 INFO  L316             CfgBuilder]: Removed 1 assume(true) statements.
[2024-11-19 14:17:52,947 INFO  L201        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 02:17:52 BoogieIcfgContainer
[2024-11-19 14:17:52,947 INFO  L131        PluginConnector]: ------------------------ END RCFGBuilder----------------------------
[2024-11-19 14:17:52,948 INFO  L112        PluginConnector]: ------------------------BuchiAutomizer----------------------------
[2024-11-19 14:17:52,948 INFO  L270        PluginConnector]: Initializing BuchiAutomizer...
[2024-11-19 14:17:52,952 INFO  L274        PluginConnector]: BuchiAutomizer initialized
[2024-11-19 14:17:52,953 INFO  L99          BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis
[2024-11-19 14:17:52,953 INFO  L184        PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 19.11 02:17:52" (1/3) ...
[2024-11-19 14:17:52,954 INFO  L204        PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@de9fd29 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 19.11 02:17:52, skipping insertion in model container
[2024-11-19 14:17:52,954 INFO  L99          BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis
[2024-11-19 14:17:52,954 INFO  L184        PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 02:17:52" (2/3) ...
[2024-11-19 14:17:52,955 INFO  L204        PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@de9fd29 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 19.11 02:17:52, skipping insertion in model container
[2024-11-19 14:17:52,955 INFO  L99          BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis
[2024-11-19 14:17:52,955 INFO  L184        PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 02:17:52" (3/3) ...
[2024-11-19 14:17:52,956 INFO  L332   chiAutomizerObserver]: Analyzing ICFG basename-3.i
[2024-11-19 14:17:53,000 INFO  L300   stractBuchiCegarLoop]: Interprodecural is true
[2024-11-19 14:17:53,001 INFO  L301   stractBuchiCegarLoop]: Hoare is None
[2024-11-19 14:17:53,001 INFO  L302   stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates
[2024-11-19 14:17:53,001 INFO  L303   stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE
[2024-11-19 14:17:53,001 INFO  L304   stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION
[2024-11-19 14:17:53,001 INFO  L305   stractBuchiCegarLoop]: Difference is false
[2024-11-19 14:17:53,001 INFO  L306   stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA
[2024-11-19 14:17:53,001 INFO  L310   stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiAutomatonCegarLoop ========
[2024-11-19 14:17:53,004 INFO  L72            BuchiIsEmpty]: Start buchiIsEmpty. Operand  has 16 states, 15 states have (on average 1.4666666666666666) internal successors, (22), 15 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-11-19 14:17:53,018 INFO  L131   ngComponentsAnalysis]: Automaton has 1 accepting balls. 9
[2024-11-19 14:17:53,018 INFO  L87            BuchiIsEmpty]: Finished buchiIsEmpty Result is false
[2024-11-19 14:17:53,019 INFO  L119           BuchiIsEmpty]: Starting construction of run
[2024-11-19 14:17:53,024 INFO  L148   hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1]
[2024-11-19 14:17:53,024 INFO  L149   hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1]
[2024-11-19 14:17:53,024 INFO  L332   stractBuchiCegarLoop]: ======== Iteration 1 ============
[2024-11-19 14:17:53,025 INFO  L72            BuchiIsEmpty]: Start buchiIsEmpty. Operand  has 16 states, 15 states have (on average 1.4666666666666666) internal successors, (22), 15 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-11-19 14:17:53,026 INFO  L131   ngComponentsAnalysis]: Automaton has 1 accepting balls. 9
[2024-11-19 14:17:53,026 INFO  L87            BuchiIsEmpty]: Finished buchiIsEmpty Result is false
[2024-11-19 14:17:53,026 INFO  L119           BuchiIsEmpty]: Starting construction of run
[2024-11-19 14:17:53,027 INFO  L148   hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1]
[2024-11-19 14:17:53,027 INFO  L149   hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1]
[2024-11-19 14:17:53,032 INFO  L745   eck$LassoCheckResult]: Stem: 13#$Ultimate##0true assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 5#L-1true assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet7#1, main_#t~malloc8#1.base, main_#t~malloc8#1.offset, main_#t~ret9#1.base, main_#t~ret9#1.offset, main_~in_len~0#1, main_~in~0#1.base, main_~in~0#1.offset;havoc main_#t~nondet7#1;main_~in_len~0#1 := main_#t~nondet7#1;havoc main_#t~nondet7#1; 6#L531true assume !(main_~in_len~0#1 < 1);call main_#t~malloc8#1.base, main_#t~malloc8#1.offset := #Ultimate.allocOnStack(main_~in_len~0#1 % 18446744073709551616);main_~in~0#1.base, main_~in~0#1.offset := main_#t~malloc8#1.base, main_#t~malloc8#1.offset;call write~int#0(0, main_~in~0#1.base, main_~in~0#1.offset + (main_~in_len~0#1 - 1), 1);assume { :begin_inline_basename } true;basename_#in~path#1.base, basename_#in~path#1.offset := main_~in~0#1.base, main_~in~0#1.offset;havoc basename_#res#1.base, basename_#res#1.offset;havoc basename_#t~ret5#1.base, basename_#t~ret5#1.offset, basename_#t~mem6#1, basename_~path#1.base, basename_~path#1.offset, basename_~c~0#1.base, basename_~c~0#1.offset;basename_~path#1.base, basename_~path#1.offset := basename_#in~path#1.base, basename_#in~path#1.offset;havoc basename_~c~0#1.base, basename_~c~0#1.offset; 14#L517true 
[2024-11-19 14:17:53,033 INFO  L747   eck$LassoCheckResult]: Loop: 14#L517true assume { :begin_inline_strrchr } true;strrchr_#in~t#1.base, strrchr_#in~t#1.offset, strrchr_#in~c#1 := basename_~path#1.base, basename_~path#1.offset, 47;havoc strrchr_#res#1.base, strrchr_#res#1.offset;havoc strrchr_#t~mem2#1, strrchr_#t~mem3#1, strrchr_#t~pre4#1.base, strrchr_#t~pre4#1.offset, strrchr_~t#1.base, strrchr_~t#1.offset, strrchr_~c#1, strrchr_~ch~0#1, strrchr_~l~0#1.base, strrchr_~l~0#1.offset;strrchr_~t#1.base, strrchr_~t#1.offset := strrchr_#in~t#1.base, strrchr_#in~t#1.offset;strrchr_~c#1 := strrchr_#in~c#1;havoc strrchr_~ch~0#1;strrchr_~l~0#1.base, strrchr_~l~0#1.offset := 0, 0;strrchr_~ch~0#1 := (if strrchr_~c#1 % 256 <= 127 then strrchr_~c#1 % 256 else strrchr_~c#1 % 256 - 256); 12#L510-1true assume !true;strrchr_#res#1.base, strrchr_#res#1.offset := strrchr_~l~0#1.base, strrchr_~l~0#1.offset; 16#strrchr_returnLabel#1true basename_#t~ret5#1.base, basename_#t~ret5#1.offset := strrchr_#res#1.base, strrchr_#res#1.offset;havoc strrchr_#t~mem2#1, strrchr_#t~mem3#1, strrchr_#t~pre4#1.base, strrchr_#t~pre4#1.offset, strrchr_~t#1.base, strrchr_~t#1.offset, strrchr_~c#1, strrchr_~ch~0#1, strrchr_~l~0#1.base, strrchr_~l~0#1.offset;havoc strrchr_#in~t#1.base, strrchr_#in~t#1.offset, strrchr_#in~c#1;assume { :end_inline_strrchr } true;basename_~c~0#1.base, basename_~c~0#1.offset := basename_#t~ret5#1.base, basename_#t~ret5#1.offset; 7#L518true assume !(basename_~c~0#1.base == 0 && basename_~c~0#1.offset == 0);havoc basename_#t~ret5#1.base, basename_#t~ret5#1.offset;call basename_#t~mem6#1 := read~int#0(basename_~c~0#1.base, 1 + basename_~c~0#1.offset, 1); 17#L519true assume 0 == basename_#t~mem6#1;havoc basename_#t~mem6#1; 8#L520true assume !(basename_~c~0#1.base == basename_~path#1.base && basename_~c~0#1.offset == basename_~path#1.offset);call write~int#0(0, basename_~c~0#1.base, basename_~c~0#1.offset, 1); 14#L517true 
[2024-11-19 14:17:53,037 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2024-11-19 14:17:53,038 INFO  L85        PathProgramCache]: Analyzing trace with hash 29860, now seen corresponding path program 1 times
[2024-11-19 14:17:53,045 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-19 14:17:53,045 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2116292686]
[2024-11-19 14:17:53,045 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-19 14:17:53,046 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-19 14:17:53,156 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is sat
[2024-11-19 14:17:53,156 INFO  L356             TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders.
[2024-11-19 14:17:53,171 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is sat
[2024-11-19 14:17:53,186 INFO  L130   FreeRefinementEngine]: Strategy CAMEL found a feasible trace
[2024-11-19 14:17:53,188 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2024-11-19 14:17:53,188 INFO  L85        PathProgramCache]: Analyzing trace with hash 1171953214, now seen corresponding path program 1 times
[2024-11-19 14:17:53,188 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-19 14:17:53,188 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [489804791]
[2024-11-19 14:17:53,188 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-19 14:17:53,189 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-19 14:17:53,205 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-19 14:17:53,246 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-11-19 14:17:53,247 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-11-19 14:17:53,247 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [489804791]
[2024-11-19 14:17:53,247 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [489804791] provided 1 perfect and 0 imperfect interpolant sequences
[2024-11-19 14:17:53,248 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-11-19 14:17:53,248 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2024-11-19 14:17:53,248 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2109420619]
[2024-11-19 14:17:53,250 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-11-19 14:17:53,254 INFO  L762   eck$LassoCheckResult]: loop already infeasible
[2024-11-19 14:17:53,255 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-11-19 14:17:53,281 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants.
[2024-11-19 14:17:53,282 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2
[2024-11-19 14:17:53,284 INFO  L87              Difference]: Start difference. First operand  has 16 states, 15 states have (on average 1.4666666666666666) internal successors, (22), 15 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) Second operand  has 2 states, 2 states have (on average 3.0) internal successors, (6), 2 states have internal predecessors, (6), 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-11-19 14:17:53,288 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2024-11-19 14:17:53,288 INFO  L93              Difference]: Finished difference Result 16 states and 21 transitions.
[2024-11-19 14:17:53,289 INFO  L82        GeneralOperation]: Start removeNonLiveStates. Operand 16 states and 21 transitions.
[2024-11-19 14:17:53,290 INFO  L131   ngComponentsAnalysis]: Automaton has 1 accepting balls. 9
[2024-11-19 14:17:53,293 INFO  L88        GeneralOperation]: Finished removeNonLiveStates. Reduced from 16 states to 12 states and 14 transitions.
[2024-11-19 14:17:53,293 INFO  L87         BuchiClosureNwa]: Accepting states before buchiClosure: 12
[2024-11-19 14:17:53,293 INFO  L106        BuchiClosureNwa]: Accepting states after buchiClosure: 12
[2024-11-19 14:17:53,294 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 12 states and 14 transitions.
[2024-11-19 14:17:53,294 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2024-11-19 14:17:53,294 INFO  L218   hiAutomatonCegarLoop]: Abstraction has 12 states and 14 transitions.
[2024-11-19 14:17:53,310 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 12 states and 14 transitions.
[2024-11-19 14:17:53,318 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 12 to 12.
[2024-11-19 14:17:53,319 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 12 states, 12 states have (on average 1.1666666666666667) internal successors, (14), 11 states have internal predecessors, (14), 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-11-19 14:17:53,320 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 14 transitions.
[2024-11-19 14:17:53,321 INFO  L240   hiAutomatonCegarLoop]: Abstraction has 12 states and 14 transitions.
[2024-11-19 14:17:53,323 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. 
[2024-11-19 14:17:53,329 INFO  L425   stractBuchiCegarLoop]: Abstraction has 12 states and 14 transitions.
[2024-11-19 14:17:53,331 INFO  L332   stractBuchiCegarLoop]: ======== Iteration 2 ============
[2024-11-19 14:17:53,331 INFO  L72            BuchiIsEmpty]: Start buchiIsEmpty. Operand 12 states and 14 transitions.
[2024-11-19 14:17:53,332 INFO  L131   ngComponentsAnalysis]: Automaton has 1 accepting balls. 9
[2024-11-19 14:17:53,332 INFO  L87            BuchiIsEmpty]: Finished buchiIsEmpty Result is false
[2024-11-19 14:17:53,332 INFO  L119           BuchiIsEmpty]: Starting construction of run
[2024-11-19 14:17:53,332 INFO  L148   hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1]
[2024-11-19 14:17:53,334 INFO  L149   hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-11-19 14:17:53,334 INFO  L745   eck$LassoCheckResult]: Stem: 44#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 45#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet7#1, main_#t~malloc8#1.base, main_#t~malloc8#1.offset, main_#t~ret9#1.base, main_#t~ret9#1.offset, main_~in_len~0#1, main_~in~0#1.base, main_~in~0#1.offset;havoc main_#t~nondet7#1;main_~in_len~0#1 := main_#t~nondet7#1;havoc main_#t~nondet7#1; 46#L531 assume !(main_~in_len~0#1 < 1);call main_#t~malloc8#1.base, main_#t~malloc8#1.offset := #Ultimate.allocOnStack(main_~in_len~0#1 % 18446744073709551616);main_~in~0#1.base, main_~in~0#1.offset := main_#t~malloc8#1.base, main_#t~malloc8#1.offset;call write~int#0(0, main_~in~0#1.base, main_~in~0#1.offset + (main_~in_len~0#1 - 1), 1);assume { :begin_inline_basename } true;basename_#in~path#1.base, basename_#in~path#1.offset := main_~in~0#1.base, main_~in~0#1.offset;havoc basename_#res#1.base, basename_#res#1.offset;havoc basename_#t~ret5#1.base, basename_#t~ret5#1.offset, basename_#t~mem6#1, basename_~path#1.base, basename_~path#1.offset, basename_~c~0#1.base, basename_~c~0#1.offset;basename_~path#1.base, basename_~path#1.offset := basename_#in~path#1.base, basename_#in~path#1.offset;havoc basename_~c~0#1.base, basename_~c~0#1.offset; 47#L517 
[2024-11-19 14:17:53,334 INFO  L747   eck$LassoCheckResult]: Loop: 47#L517 assume { :begin_inline_strrchr } true;strrchr_#in~t#1.base, strrchr_#in~t#1.offset, strrchr_#in~c#1 := basename_~path#1.base, basename_~path#1.offset, 47;havoc strrchr_#res#1.base, strrchr_#res#1.offset;havoc strrchr_#t~mem2#1, strrchr_#t~mem3#1, strrchr_#t~pre4#1.base, strrchr_#t~pre4#1.offset, strrchr_~t#1.base, strrchr_~t#1.offset, strrchr_~c#1, strrchr_~ch~0#1, strrchr_~l~0#1.base, strrchr_~l~0#1.offset;strrchr_~t#1.base, strrchr_~t#1.offset := strrchr_#in~t#1.base, strrchr_#in~t#1.offset;strrchr_~c#1 := strrchr_#in~c#1;havoc strrchr_~ch~0#1;strrchr_~l~0#1.base, strrchr_~l~0#1.offset := 0, 0;strrchr_~ch~0#1 := (if strrchr_~c#1 % 256 <= 127 then strrchr_~c#1 % 256 else strrchr_~c#1 % 256 - 256); 43#L510-1 call strrchr_#t~mem2#1 := read~int#0(strrchr_~t#1.base, strrchr_~t#1.offset, 1); 40#L511 assume strrchr_#t~mem2#1 == strrchr_~ch~0#1;havoc strrchr_#t~mem2#1;strrchr_~l~0#1.base, strrchr_~l~0#1.offset := strrchr_~t#1.base, strrchr_~t#1.offset; 41#L511-2 call strrchr_#t~mem3#1 := read~int#0(strrchr_~t#1.base, strrchr_~t#1.offset, 1); 42#L511-3 assume 0 == strrchr_#t~mem3#1;havoc strrchr_#t~mem3#1;strrchr_#res#1.base, strrchr_#res#1.offset := strrchr_~l~0#1.base, strrchr_~l~0#1.offset; 51#strrchr_returnLabel#1 basename_#t~ret5#1.base, basename_#t~ret5#1.offset := strrchr_#res#1.base, strrchr_#res#1.offset;havoc strrchr_#t~mem2#1, strrchr_#t~mem3#1, strrchr_#t~pre4#1.base, strrchr_#t~pre4#1.offset, strrchr_~t#1.base, strrchr_~t#1.offset, strrchr_~c#1, strrchr_~ch~0#1, strrchr_~l~0#1.base, strrchr_~l~0#1.offset;havoc strrchr_#in~t#1.base, strrchr_#in~t#1.offset, strrchr_#in~c#1;assume { :end_inline_strrchr } true;basename_~c~0#1.base, basename_~c~0#1.offset := basename_#t~ret5#1.base, basename_#t~ret5#1.offset; 48#L518 assume !(basename_~c~0#1.base == 0 && basename_~c~0#1.offset == 0);havoc basename_#t~ret5#1.base, basename_#t~ret5#1.offset;call basename_#t~mem6#1 := read~int#0(basename_~c~0#1.base, 1 + basename_~c~0#1.offset, 1); 49#L519 assume 0 == basename_#t~mem6#1;havoc basename_#t~mem6#1; 50#L520 assume !(basename_~c~0#1.base == basename_~path#1.base && basename_~c~0#1.offset == basename_~path#1.offset);call write~int#0(0, basename_~c~0#1.base, basename_~c~0#1.offset, 1); 47#L517 
[2024-11-19 14:17:53,335 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2024-11-19 14:17:53,336 INFO  L85        PathProgramCache]: Analyzing trace with hash 29860, now seen corresponding path program 2 times
[2024-11-19 14:17:53,336 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-19 14:17:53,336 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1734380293]
[2024-11-19 14:17:53,337 INFO  L93    rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1
[2024-11-19 14:17:53,337 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-19 14:17:53,371 INFO  L227   tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s)
[2024-11-19 14:17:53,371 INFO  L228   tOrderPrioritization]: Conjunction of SSA is sat
[2024-11-19 14:17:53,371 INFO  L356             TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders.
[2024-11-19 14:17:53,385 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is sat
[2024-11-19 14:17:53,393 INFO  L130   FreeRefinementEngine]: Strategy CAMEL found a feasible trace
[2024-11-19 14:17:53,394 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2024-11-19 14:17:53,395 INFO  L85        PathProgramCache]: Analyzing trace with hash -487094312, now seen corresponding path program 1 times
[2024-11-19 14:17:53,395 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-19 14:17:53,395 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [355221703]
[2024-11-19 14:17:53,396 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-19 14:17:53,396 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-19 14:17:53,430 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-19 14:17:53,781 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-11-19 14:17:53,785 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-11-19 14:17:53,785 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [355221703]
[2024-11-19 14:17:53,786 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [355221703] provided 1 perfect and 0 imperfect interpolant sequences
[2024-11-19 14:17:53,786 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-11-19 14:17:53,786 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2024-11-19 14:17:53,786 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1989557925]
[2024-11-19 14:17:53,786 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-11-19 14:17:53,787 INFO  L762   eck$LassoCheckResult]: loop already infeasible
[2024-11-19 14:17:53,787 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-11-19 14:17:53,787 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2024-11-19 14:17:53,787 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30
[2024-11-19 14:17:53,788 INFO  L87              Difference]: Start difference. First operand 12 states and 14 transitions. cyclomatic complexity: 3 Second operand  has 6 states, 5 states have (on average 1.8) internal successors, (9), 5 states have internal predecessors, (9), 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-11-19 14:17:53,895 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2024-11-19 14:17:53,897 INFO  L93              Difference]: Finished difference Result 28 states and 34 transitions.
[2024-11-19 14:17:53,898 INFO  L82        GeneralOperation]: Start removeNonLiveStates. Operand 28 states and 34 transitions.
[2024-11-19 14:17:53,899 INFO  L131   ngComponentsAnalysis]: Automaton has 1 accepting balls. 20
[2024-11-19 14:17:53,900 INFO  L88        GeneralOperation]: Finished removeNonLiveStates. Reduced from 28 states to 23 states and 28 transitions.
[2024-11-19 14:17:53,901 INFO  L87         BuchiClosureNwa]: Accepting states before buchiClosure: 23
[2024-11-19 14:17:53,901 INFO  L106        BuchiClosureNwa]: Accepting states after buchiClosure: 23
[2024-11-19 14:17:53,901 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 23 states and 28 transitions.
[2024-11-19 14:17:53,902 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2024-11-19 14:17:53,903 INFO  L218   hiAutomatonCegarLoop]: Abstraction has 23 states and 28 transitions.
[2024-11-19 14:17:53,903 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 23 states and 28 transitions.
[2024-11-19 14:17:53,905 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 18.
[2024-11-19 14:17:53,905 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 18 states, 18 states have (on average 1.2222222222222223) internal successors, (22), 17 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-11-19 14:17:53,906 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 22 transitions.
[2024-11-19 14:17:53,907 INFO  L240   hiAutomatonCegarLoop]: Abstraction has 18 states and 22 transitions.
[2024-11-19 14:17:53,907 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. 
[2024-11-19 14:17:53,908 INFO  L425   stractBuchiCegarLoop]: Abstraction has 18 states and 22 transitions.
[2024-11-19 14:17:53,908 INFO  L332   stractBuchiCegarLoop]: ======== Iteration 3 ============
[2024-11-19 14:17:53,909 INFO  L72            BuchiIsEmpty]: Start buchiIsEmpty. Operand 18 states and 22 transitions.
[2024-11-19 14:17:53,910 INFO  L131   ngComponentsAnalysis]: Automaton has 1 accepting balls. 15
[2024-11-19 14:17:53,910 INFO  L87            BuchiIsEmpty]: Finished buchiIsEmpty Result is false
[2024-11-19 14:17:53,911 INFO  L119           BuchiIsEmpty]: Starting construction of run
[2024-11-19 14:17:53,913 INFO  L148   hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1]
[2024-11-19 14:17:53,913 INFO  L149   hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-11-19 14:17:53,913 INFO  L745   eck$LassoCheckResult]: Stem: 99#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 100#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet7#1, main_#t~malloc8#1.base, main_#t~malloc8#1.offset, main_#t~ret9#1.base, main_#t~ret9#1.offset, main_~in_len~0#1, main_~in~0#1.base, main_~in~0#1.offset;havoc main_#t~nondet7#1;main_~in_len~0#1 := main_#t~nondet7#1;havoc main_#t~nondet7#1; 101#L531 assume !(main_~in_len~0#1 < 1);call main_#t~malloc8#1.base, main_#t~malloc8#1.offset := #Ultimate.allocOnStack(main_~in_len~0#1 % 18446744073709551616);main_~in~0#1.base, main_~in~0#1.offset := main_#t~malloc8#1.base, main_#t~malloc8#1.offset;call write~int#0(0, main_~in~0#1.base, main_~in~0#1.offset + (main_~in_len~0#1 - 1), 1);assume { :begin_inline_basename } true;basename_#in~path#1.base, basename_#in~path#1.offset := main_~in~0#1.base, main_~in~0#1.offset;havoc basename_#res#1.base, basename_#res#1.offset;havoc basename_#t~ret5#1.base, basename_#t~ret5#1.offset, basename_#t~mem6#1, basename_~path#1.base, basename_~path#1.offset, basename_~c~0#1.base, basename_~c~0#1.offset;basename_~path#1.base, basename_~path#1.offset := basename_#in~path#1.base, basename_#in~path#1.offset;havoc basename_~c~0#1.base, basename_~c~0#1.offset; 102#L517 
[2024-11-19 14:17:53,913 INFO  L747   eck$LassoCheckResult]: Loop: 102#L517 assume { :begin_inline_strrchr } true;strrchr_#in~t#1.base, strrchr_#in~t#1.offset, strrchr_#in~c#1 := basename_~path#1.base, basename_~path#1.offset, 47;havoc strrchr_#res#1.base, strrchr_#res#1.offset;havoc strrchr_#t~mem2#1, strrchr_#t~mem3#1, strrchr_#t~pre4#1.base, strrchr_#t~pre4#1.offset, strrchr_~t#1.base, strrchr_~t#1.offset, strrchr_~c#1, strrchr_~ch~0#1, strrchr_~l~0#1.base, strrchr_~l~0#1.offset;strrchr_~t#1.base, strrchr_~t#1.offset := strrchr_#in~t#1.base, strrchr_#in~t#1.offset;strrchr_~c#1 := strrchr_#in~c#1;havoc strrchr_~ch~0#1;strrchr_~l~0#1.base, strrchr_~l~0#1.offset := 0, 0;strrchr_~ch~0#1 := (if strrchr_~c#1 % 256 <= 127 then strrchr_~c#1 % 256 else strrchr_~c#1 % 256 - 256); 106#L510-1 call strrchr_#t~mem2#1 := read~int#0(strrchr_~t#1.base, strrchr_~t#1.offset, 1); 93#L511 assume !(strrchr_#t~mem2#1 == strrchr_~ch~0#1);havoc strrchr_#t~mem2#1; 95#L511-2 call strrchr_#t~mem3#1 := read~int#0(strrchr_~t#1.base, strrchr_~t#1.offset, 1); 108#L511-3 assume 0 == strrchr_#t~mem3#1;havoc strrchr_#t~mem3#1;strrchr_#res#1.base, strrchr_#res#1.offset := strrchr_~l~0#1.base, strrchr_~l~0#1.offset; 107#strrchr_returnLabel#1 basename_#t~ret5#1.base, basename_#t~ret5#1.offset := strrchr_#res#1.base, strrchr_#res#1.offset;havoc strrchr_#t~mem2#1, strrchr_#t~mem3#1, strrchr_#t~pre4#1.base, strrchr_#t~pre4#1.offset, strrchr_~t#1.base, strrchr_~t#1.offset, strrchr_~c#1, strrchr_~ch~0#1, strrchr_~l~0#1.base, strrchr_~l~0#1.offset;havoc strrchr_#in~t#1.base, strrchr_#in~t#1.offset, strrchr_#in~c#1;assume { :end_inline_strrchr } true;basename_~c~0#1.base, basename_~c~0#1.offset := basename_#t~ret5#1.base, basename_#t~ret5#1.offset; 103#L518 assume !(basename_~c~0#1.base == 0 && basename_~c~0#1.offset == 0);havoc basename_#t~ret5#1.base, basename_#t~ret5#1.offset;call basename_#t~mem6#1 := read~int#0(basename_~c~0#1.base, 1 + basename_~c~0#1.offset, 1); 104#L519 assume 0 == basename_#t~mem6#1;havoc basename_#t~mem6#1; 105#L520 assume !(basename_~c~0#1.base == basename_~path#1.base && basename_~c~0#1.offset == basename_~path#1.offset);call write~int#0(0, basename_~c~0#1.base, basename_~c~0#1.offset, 1); 102#L517 
[2024-11-19 14:17:53,914 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2024-11-19 14:17:53,914 INFO  L85        PathProgramCache]: Analyzing trace with hash 29860, now seen corresponding path program 3 times
[2024-11-19 14:17:53,914 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-19 14:17:53,915 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1019069659]
[2024-11-19 14:17:53,915 INFO  L93    rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2
[2024-11-19 14:17:53,915 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-19 14:17:53,928 INFO  L227   tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s)
[2024-11-19 14:17:53,929 INFO  L228   tOrderPrioritization]: Conjunction of SSA is sat
[2024-11-19 14:17:53,929 INFO  L356             TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders.
[2024-11-19 14:17:53,936 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is sat
[2024-11-19 14:17:53,940 INFO  L130   FreeRefinementEngine]: Strategy CAMEL found a feasible trace
[2024-11-19 14:17:53,941 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2024-11-19 14:17:53,941 INFO  L85        PathProgramCache]: Analyzing trace with hash 1287913050, now seen corresponding path program 1 times
[2024-11-19 14:17:53,941 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-19 14:17:53,941 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [965319088]
[2024-11-19 14:17:53,941 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-19 14:17:53,942 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-19 14:17:53,972 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-19 14:17:54,146 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-11-19 14:17:54,147 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-11-19 14:17:54,147 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [965319088]
[2024-11-19 14:17:54,147 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [965319088] provided 1 perfect and 0 imperfect interpolant sequences
[2024-11-19 14:17:54,147 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-11-19 14:17:54,147 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2024-11-19 14:17:54,147 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1655215329]
[2024-11-19 14:17:54,148 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-11-19 14:17:54,148 INFO  L762   eck$LassoCheckResult]: loop already infeasible
[2024-11-19 14:17:54,148 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-11-19 14:17:54,149 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2024-11-19 14:17:54,149 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30
[2024-11-19 14:17:54,149 INFO  L87              Difference]: Start difference. First operand 18 states and 22 transitions. cyclomatic complexity: 5 Second operand  has 6 states, 5 states have (on average 1.8) internal successors, (9), 5 states have internal predecessors, (9), 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-11-19 14:17:54,190 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2024-11-19 14:17:54,190 INFO  L93              Difference]: Finished difference Result 26 states and 31 transitions.
[2024-11-19 14:17:54,191 INFO  L82        GeneralOperation]: Start removeNonLiveStates. Operand 26 states and 31 transitions.
[2024-11-19 14:17:54,192 INFO  L131   ngComponentsAnalysis]: Automaton has 1 accepting balls. 19
[2024-11-19 14:17:54,193 INFO  L88        GeneralOperation]: Finished removeNonLiveStates. Reduced from 26 states to 22 states and 27 transitions.
[2024-11-19 14:17:54,193 INFO  L87         BuchiClosureNwa]: Accepting states before buchiClosure: 22
[2024-11-19 14:17:54,193 INFO  L106        BuchiClosureNwa]: Accepting states after buchiClosure: 22
[2024-11-19 14:17:54,193 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 22 states and 27 transitions.
[2024-11-19 14:17:54,193 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2024-11-19 14:17:54,194 INFO  L218   hiAutomatonCegarLoop]: Abstraction has 22 states and 27 transitions.
[2024-11-19 14:17:54,194 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 22 states and 27 transitions.
[2024-11-19 14:17:54,195 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 18.
[2024-11-19 14:17:54,196 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 18 states, 18 states have (on average 1.2222222222222223) internal successors, (22), 17 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-11-19 14:17:54,196 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 22 transitions.
[2024-11-19 14:17:54,196 INFO  L240   hiAutomatonCegarLoop]: Abstraction has 18 states and 22 transitions.
[2024-11-19 14:17:54,197 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2024-11-19 14:17:54,197 INFO  L425   stractBuchiCegarLoop]: Abstraction has 18 states and 22 transitions.
[2024-11-19 14:17:54,198 INFO  L332   stractBuchiCegarLoop]: ======== Iteration 4 ============
[2024-11-19 14:17:54,198 INFO  L72            BuchiIsEmpty]: Start buchiIsEmpty. Operand 18 states and 22 transitions.
[2024-11-19 14:17:54,198 INFO  L131   ngComponentsAnalysis]: Automaton has 1 accepting balls. 15
[2024-11-19 14:17:54,198 INFO  L87            BuchiIsEmpty]: Finished buchiIsEmpty Result is false
[2024-11-19 14:17:54,199 INFO  L119           BuchiIsEmpty]: Starting construction of run
[2024-11-19 14:17:54,199 INFO  L148   hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1]
[2024-11-19 14:17:54,199 INFO  L149   hiAutomatonCegarLoop]: Counterexample loop histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1]
[2024-11-19 14:17:54,199 INFO  L745   eck$LassoCheckResult]: Stem: 153#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 154#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet7#1, main_#t~malloc8#1.base, main_#t~malloc8#1.offset, main_#t~ret9#1.base, main_#t~ret9#1.offset, main_~in_len~0#1, main_~in~0#1.base, main_~in~0#1.offset;havoc main_#t~nondet7#1;main_~in_len~0#1 := main_#t~nondet7#1;havoc main_#t~nondet7#1; 155#L531 assume !(main_~in_len~0#1 < 1);call main_#t~malloc8#1.base, main_#t~malloc8#1.offset := #Ultimate.allocOnStack(main_~in_len~0#1 % 18446744073709551616);main_~in~0#1.base, main_~in~0#1.offset := main_#t~malloc8#1.base, main_#t~malloc8#1.offset;call write~int#0(0, main_~in~0#1.base, main_~in~0#1.offset + (main_~in_len~0#1 - 1), 1);assume { :begin_inline_basename } true;basename_#in~path#1.base, basename_#in~path#1.offset := main_~in~0#1.base, main_~in~0#1.offset;havoc basename_#res#1.base, basename_#res#1.offset;havoc basename_#t~ret5#1.base, basename_#t~ret5#1.offset, basename_#t~mem6#1, basename_~path#1.base, basename_~path#1.offset, basename_~c~0#1.base, basename_~c~0#1.offset;basename_~path#1.base, basename_~path#1.offset := basename_#in~path#1.base, basename_#in~path#1.offset;havoc basename_~c~0#1.base, basename_~c~0#1.offset; 156#L517 
[2024-11-19 14:17:54,200 INFO  L747   eck$LassoCheckResult]: Loop: 156#L517 assume { :begin_inline_strrchr } true;strrchr_#in~t#1.base, strrchr_#in~t#1.offset, strrchr_#in~c#1 := basename_~path#1.base, basename_~path#1.offset, 47;havoc strrchr_#res#1.base, strrchr_#res#1.offset;havoc strrchr_#t~mem2#1, strrchr_#t~mem3#1, strrchr_#t~pre4#1.base, strrchr_#t~pre4#1.offset, strrchr_~t#1.base, strrchr_~t#1.offset, strrchr_~c#1, strrchr_~ch~0#1, strrchr_~l~0#1.base, strrchr_~l~0#1.offset;strrchr_~t#1.base, strrchr_~t#1.offset := strrchr_#in~t#1.base, strrchr_#in~t#1.offset;strrchr_~c#1 := strrchr_#in~c#1;havoc strrchr_~ch~0#1;strrchr_~l~0#1.base, strrchr_~l~0#1.offset := 0, 0;strrchr_~ch~0#1 := (if strrchr_~c#1 % 256 <= 127 then strrchr_~c#1 % 256 else strrchr_~c#1 % 256 - 256); 160#L510-1 call strrchr_#t~mem2#1 := read~int#0(strrchr_~t#1.base, strrchr_~t#1.offset, 1); 148#L511 assume strrchr_#t~mem2#1 == strrchr_~ch~0#1;havoc strrchr_#t~mem2#1;strrchr_~l~0#1.base, strrchr_~l~0#1.offset := strrchr_~t#1.base, strrchr_~t#1.offset; 149#L511-2 call strrchr_#t~mem3#1 := read~int#0(strrchr_~t#1.base, strrchr_~t#1.offset, 1); 150#L511-3 assume !(0 == strrchr_#t~mem3#1);havoc strrchr_#t~mem3#1;strrchr_#t~pre4#1.base, strrchr_#t~pre4#1.offset := strrchr_~t#1.base, 1 + strrchr_~t#1.offset;strrchr_~t#1.base, strrchr_~t#1.offset := strrchr_~t#1.base, 1 + strrchr_~t#1.offset;havoc strrchr_#t~pre4#1.base, strrchr_#t~pre4#1.offset; 151#L510-1 call strrchr_#t~mem2#1 := read~int#0(strrchr_~t#1.base, strrchr_~t#1.offset, 1); 152#L511 assume strrchr_#t~mem2#1 == strrchr_~ch~0#1;havoc strrchr_#t~mem2#1;strrchr_~l~0#1.base, strrchr_~l~0#1.offset := strrchr_~t#1.base, strrchr_~t#1.offset; 164#L511-2 call strrchr_#t~mem3#1 := read~int#0(strrchr_~t#1.base, strrchr_~t#1.offset, 1); 162#L511-3 assume 0 == strrchr_#t~mem3#1;havoc strrchr_#t~mem3#1;strrchr_#res#1.base, strrchr_#res#1.offset := strrchr_~l~0#1.base, strrchr_~l~0#1.offset; 161#strrchr_returnLabel#1 basename_#t~ret5#1.base, basename_#t~ret5#1.offset := strrchr_#res#1.base, strrchr_#res#1.offset;havoc strrchr_#t~mem2#1, strrchr_#t~mem3#1, strrchr_#t~pre4#1.base, strrchr_#t~pre4#1.offset, strrchr_~t#1.base, strrchr_~t#1.offset, strrchr_~c#1, strrchr_~ch~0#1, strrchr_~l~0#1.base, strrchr_~l~0#1.offset;havoc strrchr_#in~t#1.base, strrchr_#in~t#1.offset, strrchr_#in~c#1;assume { :end_inline_strrchr } true;basename_~c~0#1.base, basename_~c~0#1.offset := basename_#t~ret5#1.base, basename_#t~ret5#1.offset; 157#L518 assume !(basename_~c~0#1.base == 0 && basename_~c~0#1.offset == 0);havoc basename_#t~ret5#1.base, basename_#t~ret5#1.offset;call basename_#t~mem6#1 := read~int#0(basename_~c~0#1.base, 1 + basename_~c~0#1.offset, 1); 158#L519 assume 0 == basename_#t~mem6#1;havoc basename_#t~mem6#1; 159#L520 assume !(basename_~c~0#1.base == basename_~path#1.base && basename_~c~0#1.offset == basename_~path#1.offset);call write~int#0(0, basename_~c~0#1.base, basename_~c~0#1.offset, 1); 156#L517 
[2024-11-19 14:17:54,200 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2024-11-19 14:17:54,200 INFO  L85        PathProgramCache]: Analyzing trace with hash 29860, now seen corresponding path program 4 times
[2024-11-19 14:17:54,200 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-19 14:17:54,201 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [582536461]
[2024-11-19 14:17:54,201 INFO  L93    rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST
[2024-11-19 14:17:54,201 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-19 14:17:54,215 INFO  L227   tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s)
[2024-11-19 14:17:54,215 INFO  L228   tOrderPrioritization]: Conjunction of SSA is sat
[2024-11-19 14:17:54,215 INFO  L356             TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders.
[2024-11-19 14:17:54,228 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is sat
[2024-11-19 14:17:54,232 INFO  L130   FreeRefinementEngine]: Strategy CAMEL found a feasible trace
[2024-11-19 14:17:54,232 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2024-11-19 14:17:54,233 INFO  L85        PathProgramCache]: Analyzing trace with hash 1065055040, now seen corresponding path program 1 times
[2024-11-19 14:17:54,233 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-19 14:17:54,233 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2108084276]
[2024-11-19 14:17:54,233 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-19 14:17:54,233 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-19 14:17:54,247 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-19 14:17:54,367 INFO  L134       CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-11-19 14:17:54,368 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-11-19 14:17:54,368 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2108084276]
[2024-11-19 14:17:54,368 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2108084276] provided 0 perfect and 1 imperfect interpolant sequences
[2024-11-19 14:17:54,368 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [103447584]
[2024-11-19 14:17:54,369 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-19 14:17:54,369 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2024-11-19 14:17:54,369 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3
[2024-11-19 14:17:54,372 INFO  L229       MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2024-11-19 14:17:54,373 INFO  L327       MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process
[2024-11-19 14:17:54,450 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-19 14:17:54,456 INFO  L255         TraceCheckSpWp]: Trace formula consists of 93 conjuncts, 15 conjuncts are in the unsatisfiable core
[2024-11-19 14:17:54,462 INFO  L278         TraceCheckSpWp]: Computing forward predicates...
[2024-11-19 14:17:54,676 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-11-19 14:17:54,682 INFO  L134       CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-11-19 14:17:54,682 INFO  L311         TraceCheckSpWp]: Computing backward predicates...
[2024-11-19 14:17:54,889 INFO  L134       CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-11-19 14:17:54,890 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleZ3 [103447584] provided 0 perfect and 2 imperfect interpolant sequences
[2024-11-19 14:17:54,890 INFO  L185   FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences.
[2024-11-19 14:17:54,890 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 17
[2024-11-19 14:17:54,890 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [154479533]
[2024-11-19 14:17:54,891 INFO  L85    oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton
[2024-11-19 14:17:54,891 INFO  L762   eck$LassoCheckResult]: loop already infeasible
[2024-11-19 14:17:54,891 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-11-19 14:17:54,892 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants.
[2024-11-19 14:17:54,893 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=210, Unknown=0, NotChecked=0, Total=272
[2024-11-19 14:17:54,894 INFO  L87              Difference]: Start difference. First operand 18 states and 22 transitions. cyclomatic complexity: 5 Second operand  has 17 states, 17 states have (on average 1.3529411764705883) internal successors, (23), 17 states have internal predecessors, (23), 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-11-19 14:17:55,047 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2024-11-19 14:17:55,047 INFO  L93              Difference]: Finished difference Result 26 states and 31 transitions.
[2024-11-19 14:17:55,048 INFO  L82        GeneralOperation]: Start removeNonLiveStates. Operand 26 states and 31 transitions.
[2024-11-19 14:17:55,048 INFO  L131   ngComponentsAnalysis]: Automaton has 1 accepting balls. 23
[2024-11-19 14:17:55,049 INFO  L88        GeneralOperation]: Finished removeNonLiveStates. Reduced from 26 states to 26 states and 31 transitions.
[2024-11-19 14:17:55,049 INFO  L87         BuchiClosureNwa]: Accepting states before buchiClosure: 26
[2024-11-19 14:17:55,049 INFO  L106        BuchiClosureNwa]: Accepting states after buchiClosure: 26
[2024-11-19 14:17:55,049 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 26 states and 31 transitions.
[2024-11-19 14:17:55,049 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2024-11-19 14:17:55,049 INFO  L218   hiAutomatonCegarLoop]: Abstraction has 26 states and 31 transitions.
[2024-11-19 14:17:55,050 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 26 states and 31 transitions.
[2024-11-19 14:17:55,051 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 20.
[2024-11-19 14:17:55,051 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 20 states, 20 states have (on average 1.2) internal successors, (24), 19 states have internal predecessors, (24), 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-11-19 14:17:55,054 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 24 transitions.
[2024-11-19 14:17:55,054 INFO  L240   hiAutomatonCegarLoop]: Abstraction has 20 states and 24 transitions.
[2024-11-19 14:17:55,055 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. 
[2024-11-19 14:17:55,057 INFO  L425   stractBuchiCegarLoop]: Abstraction has 20 states and 24 transitions.
[2024-11-19 14:17:55,057 INFO  L332   stractBuchiCegarLoop]: ======== Iteration 5 ============
[2024-11-19 14:17:55,057 INFO  L72            BuchiIsEmpty]: Start buchiIsEmpty. Operand 20 states and 24 transitions.
[2024-11-19 14:17:55,058 INFO  L131   ngComponentsAnalysis]: Automaton has 1 accepting balls. 17
[2024-11-19 14:17:55,059 INFO  L87            BuchiIsEmpty]: Finished buchiIsEmpty Result is false
[2024-11-19 14:17:55,060 INFO  L119           BuchiIsEmpty]: Starting construction of run
[2024-11-19 14:17:55,061 INFO  L148   hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1]
[2024-11-19 14:17:55,061 INFO  L149   hiAutomatonCegarLoop]: Counterexample loop histogram [3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1]
[2024-11-19 14:17:55,061 INFO  L745   eck$LassoCheckResult]: Stem: 293#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 294#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet7#1, main_#t~malloc8#1.base, main_#t~malloc8#1.offset, main_#t~ret9#1.base, main_#t~ret9#1.offset, main_~in_len~0#1, main_~in~0#1.base, main_~in~0#1.offset;havoc main_#t~nondet7#1;main_~in_len~0#1 := main_#t~nondet7#1;havoc main_#t~nondet7#1; 295#L531 assume !(main_~in_len~0#1 < 1);call main_#t~malloc8#1.base, main_#t~malloc8#1.offset := #Ultimate.allocOnStack(main_~in_len~0#1 % 18446744073709551616);main_~in~0#1.base, main_~in~0#1.offset := main_#t~malloc8#1.base, main_#t~malloc8#1.offset;call write~int#0(0, main_~in~0#1.base, main_~in~0#1.offset + (main_~in_len~0#1 - 1), 1);assume { :begin_inline_basename } true;basename_#in~path#1.base, basename_#in~path#1.offset := main_~in~0#1.base, main_~in~0#1.offset;havoc basename_#res#1.base, basename_#res#1.offset;havoc basename_#t~ret5#1.base, basename_#t~ret5#1.offset, basename_#t~mem6#1, basename_~path#1.base, basename_~path#1.offset, basename_~c~0#1.base, basename_~c~0#1.offset;basename_~path#1.base, basename_~path#1.offset := basename_#in~path#1.base, basename_#in~path#1.offset;havoc basename_~c~0#1.base, basename_~c~0#1.offset; 296#L517 
[2024-11-19 14:17:55,061 INFO  L747   eck$LassoCheckResult]: Loop: 296#L517 assume { :begin_inline_strrchr } true;strrchr_#in~t#1.base, strrchr_#in~t#1.offset, strrchr_#in~c#1 := basename_~path#1.base, basename_~path#1.offset, 47;havoc strrchr_#res#1.base, strrchr_#res#1.offset;havoc strrchr_#t~mem2#1, strrchr_#t~mem3#1, strrchr_#t~pre4#1.base, strrchr_#t~pre4#1.offset, strrchr_~t#1.base, strrchr_~t#1.offset, strrchr_~c#1, strrchr_~ch~0#1, strrchr_~l~0#1.base, strrchr_~l~0#1.offset;strrchr_~t#1.base, strrchr_~t#1.offset := strrchr_#in~t#1.base, strrchr_#in~t#1.offset;strrchr_~c#1 := strrchr_#in~c#1;havoc strrchr_~ch~0#1;strrchr_~l~0#1.base, strrchr_~l~0#1.offset := 0, 0;strrchr_~ch~0#1 := (if strrchr_~c#1 % 256 <= 127 then strrchr_~c#1 % 256 else strrchr_~c#1 % 256 - 256); 300#L510-1 call strrchr_#t~mem2#1 := read~int#0(strrchr_~t#1.base, strrchr_~t#1.offset, 1); 288#L511 assume strrchr_#t~mem2#1 == strrchr_~ch~0#1;havoc strrchr_#t~mem2#1;strrchr_~l~0#1.base, strrchr_~l~0#1.offset := strrchr_~t#1.base, strrchr_~t#1.offset; 289#L511-2 call strrchr_#t~mem3#1 := read~int#0(strrchr_~t#1.base, strrchr_~t#1.offset, 1); 290#L511-3 assume !(0 == strrchr_#t~mem3#1);havoc strrchr_#t~mem3#1;strrchr_#t~pre4#1.base, strrchr_#t~pre4#1.offset := strrchr_~t#1.base, 1 + strrchr_~t#1.offset;strrchr_~t#1.base, strrchr_~t#1.offset := strrchr_~t#1.base, 1 + strrchr_~t#1.offset;havoc strrchr_#t~pre4#1.base, strrchr_#t~pre4#1.offset; 291#L510-1 call strrchr_#t~mem2#1 := read~int#0(strrchr_~t#1.base, strrchr_~t#1.offset, 1); 292#L511 assume strrchr_#t~mem2#1 == strrchr_~ch~0#1;havoc strrchr_#t~mem2#1;strrchr_~l~0#1.base, strrchr_~l~0#1.offset := strrchr_~t#1.base, strrchr_~t#1.offset; 306#L511-2 call strrchr_#t~mem3#1 := read~int#0(strrchr_~t#1.base, strrchr_~t#1.offset, 1); 307#L511-3 assume !(0 == strrchr_#t~mem3#1);havoc strrchr_#t~mem3#1;strrchr_#t~pre4#1.base, strrchr_#t~pre4#1.offset := strrchr_~t#1.base, 1 + strrchr_~t#1.offset;strrchr_~t#1.base, strrchr_~t#1.offset := strrchr_~t#1.base, 1 + strrchr_~t#1.offset;havoc strrchr_#t~pre4#1.base, strrchr_#t~pre4#1.offset; 303#L510-1 call strrchr_#t~mem2#1 := read~int#0(strrchr_~t#1.base, strrchr_~t#1.offset, 1); 305#L511 assume !(strrchr_#t~mem2#1 == strrchr_~ch~0#1);havoc strrchr_#t~mem2#1; 304#L511-2 call strrchr_#t~mem3#1 := read~int#0(strrchr_~t#1.base, strrchr_~t#1.offset, 1); 302#L511-3 assume 0 == strrchr_#t~mem3#1;havoc strrchr_#t~mem3#1;strrchr_#res#1.base, strrchr_#res#1.offset := strrchr_~l~0#1.base, strrchr_~l~0#1.offset; 301#strrchr_returnLabel#1 basename_#t~ret5#1.base, basename_#t~ret5#1.offset := strrchr_#res#1.base, strrchr_#res#1.offset;havoc strrchr_#t~mem2#1, strrchr_#t~mem3#1, strrchr_#t~pre4#1.base, strrchr_#t~pre4#1.offset, strrchr_~t#1.base, strrchr_~t#1.offset, strrchr_~c#1, strrchr_~ch~0#1, strrchr_~l~0#1.base, strrchr_~l~0#1.offset;havoc strrchr_#in~t#1.base, strrchr_#in~t#1.offset, strrchr_#in~c#1;assume { :end_inline_strrchr } true;basename_~c~0#1.base, basename_~c~0#1.offset := basename_#t~ret5#1.base, basename_#t~ret5#1.offset; 297#L518 assume !(basename_~c~0#1.base == 0 && basename_~c~0#1.offset == 0);havoc basename_#t~ret5#1.base, basename_#t~ret5#1.offset;call basename_#t~mem6#1 := read~int#0(basename_~c~0#1.base, 1 + basename_~c~0#1.offset, 1); 298#L519 assume 0 == basename_#t~mem6#1;havoc basename_#t~mem6#1; 299#L520 assume !(basename_~c~0#1.base == basename_~path#1.base && basename_~c~0#1.offset == basename_~path#1.offset);call write~int#0(0, basename_~c~0#1.base, basename_~c~0#1.offset, 1); 296#L517 
[2024-11-19 14:17:55,062 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2024-11-19 14:17:55,062 INFO  L85        PathProgramCache]: Analyzing trace with hash 29860, now seen corresponding path program 5 times
[2024-11-19 14:17:55,062 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-19 14:17:55,062 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [563686340]
[2024-11-19 14:17:55,063 INFO  L93    rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1
[2024-11-19 14:17:55,063 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-19 14:17:55,071 INFO  L227   tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s)
[2024-11-19 14:17:55,072 INFO  L228   tOrderPrioritization]: Conjunction of SSA is sat
[2024-11-19 14:17:55,072 INFO  L356             TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders.
[2024-11-19 14:17:55,076 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is sat
[2024-11-19 14:17:55,077 INFO  L130   FreeRefinementEngine]: Strategy CAMEL found a feasible trace
[2024-11-19 14:17:55,078 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2024-11-19 14:17:55,078 INFO  L85        PathProgramCache]: Analyzing trace with hash 26730794, now seen corresponding path program 1 times
[2024-11-19 14:17:55,078 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-19 14:17:55,079 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1283650924]
[2024-11-19 14:17:55,079 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-19 14:17:55,079 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-19 14:17:55,097 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is sat
[2024-11-19 14:17:55,097 INFO  L356             TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders.
[2024-11-19 14:17:55,105 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is sat
[2024-11-19 14:17:55,109 INFO  L130   FreeRefinementEngine]: Strategy CAMEL found a feasible trace
[2024-11-19 14:17:55,110 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2024-11-19 14:17:55,110 INFO  L85        PathProgramCache]: Analyzing trace with hash 1156638439, now seen corresponding path program 1 times
[2024-11-19 14:17:55,110 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-19 14:17:55,110 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1884534129]
[2024-11-19 14:17:55,110 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-19 14:17:55,111 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-19 14:17:55,132 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is sat
[2024-11-19 14:17:55,132 INFO  L356             TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders.
[2024-11-19 14:17:55,149 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is sat
[2024-11-19 14:17:55,154 INFO  L130   FreeRefinementEngine]: Strategy CAMEL found a feasible trace
[2024-11-19 14:17:55,820 INFO  L204          LassoAnalysis]: Preferences:
[2024-11-19 14:17:55,821 INFO  L125   ssoRankerPreferences]: Compute integeral hull: false
[2024-11-19 14:17:55,821 INFO  L126   ssoRankerPreferences]: Enable LassoPartitioneer: true
[2024-11-19 14:17:55,821 INFO  L127   ssoRankerPreferences]: Term annotations enabled: false
[2024-11-19 14:17:55,821 INFO  L128   ssoRankerPreferences]: Use exernal solver: false
[2024-11-19 14:17:55,821 INFO  L129   ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000
[2024-11-19 14:17:55,821 INFO  L130   ssoRankerPreferences]: Dump SMT script to file: false
[2024-11-19 14:17:55,821 INFO  L131   ssoRankerPreferences]: Path of dumped script: 
[2024-11-19 14:17:55,821 INFO  L132   ssoRankerPreferences]: Filename of dumped script: basename-3.i_Iteration5_Lasso
[2024-11-19 14:17:55,821 INFO  L133   ssoRankerPreferences]: MapElimAlgo: Frank
[2024-11-19 14:17:55,822 INFO  L241          LassoAnalysis]: Starting lasso preprocessing...
[2024-11-19 14:17:55,838 INFO  L118          MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true
[2024-11-19 14:17:55,844 INFO  L118          MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true
[2024-11-19 14:17:55,847 INFO  L118          MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true
[2024-11-19 14:17:55,849 INFO  L118          MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true
[2024-11-19 14:17:55,851 INFO  L118          MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true
[2024-11-19 14:17:55,853 INFO  L118          MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true
[2024-11-19 14:17:55,856 INFO  L118          MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true
[2024-11-19 14:17:55,857 INFO  L118          MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true
[2024-11-19 14:17:55,859 INFO  L118          MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true
[2024-11-19 14:17:55,863 INFO  L118          MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true
[2024-11-19 14:17:55,865 INFO  L118          MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true
[2024-11-19 14:17:55,867 INFO  L118          MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true
[2024-11-19 14:17:55,871 INFO  L118          MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true
[2024-11-19 14:17:55,874 INFO  L118          MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true
[2024-11-19 14:17:55,876 INFO  L118          MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true
[2024-11-19 14:17:55,878 INFO  L118          MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true
[2024-11-19 14:17:55,880 INFO  L118          MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true
[2024-11-19 14:17:55,882 INFO  L118          MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true
[2024-11-19 14:17:55,884 INFO  L118          MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true
[2024-11-19 14:17:56,018 INFO  L118          MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true
[2024-11-19 14:17:56,020 INFO  L118          MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true
[2024-11-19 14:17:56,023 INFO  L118          MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true
[2024-11-19 14:17:56,025 INFO  L118          MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true
[2024-11-19 14:17:56,026 INFO  L118          MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true
[2024-11-19 14:17:56,028 INFO  L118          MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true
[2024-11-19 14:17:56,030 INFO  L118          MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true
[2024-11-19 14:17:56,032 INFO  L118          MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true
[2024-11-19 14:17:56,034 INFO  L118          MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true
[2024-11-19 14:17:56,037 INFO  L118          MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true
[2024-11-19 14:17:56,039 INFO  L118          MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true
[2024-11-19 14:17:56,041 INFO  L118          MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true
[2024-11-19 14:17:56,267 INFO  L259          LassoAnalysis]: Preprocessing complete.
[2024-11-19 14:17:56,271 INFO  L451          LassoAnalysis]: Using template 'affine'.
[2024-11-19 14:17:56,273 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000
[2024-11-19 14:17:56,273 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3
[2024-11-19 14:17:56,295 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-11-19 14:17:56,297 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-11-19 14:17:56,298 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-11-19 14:17:56,311 INFO  L338   nArgumentSynthesizer]: Template has degree 0.
[2024-11-19 14:17:56,311 INFO  L351   nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation.
[2024-11-19 14:17:56,312 INFO  L203   nArgumentSynthesizer]: 1 stem disjuncts
[2024-11-19 14:17:56,312 INFO  L204   nArgumentSynthesizer]: 1 loop disjuncts
[2024-11-19 14:17:56,312 INFO  L205   nArgumentSynthesizer]: 2 template conjuncts.
[2024-11-19 14:17:56,314 INFO  L401   nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications.
[2024-11-19 14:17:56,314 INFO  L402   nArgumentSynthesizer]: A total of 0 supporting invariants were added.
[2024-11-19 14:17:56,316 INFO  L488          LassoAnalysis]: Proving termination failed for this template and these settings.
[2024-11-19 14:17:56,330 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-11-19 14:17:56,331 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000
[2024-11-19 14:17:56,331 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3
[2024-11-19 14:17:56,332 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-11-19 14:17:56,333 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-11-19 14:17:56,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-11-19 14:17:56,343 INFO  L338   nArgumentSynthesizer]: Template has degree 0.
[2024-11-19 14:17:56,344 INFO  L351   nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation.
[2024-11-19 14:17:56,344 INFO  L203   nArgumentSynthesizer]: 1 stem disjuncts
[2024-11-19 14:17:56,344 INFO  L204   nArgumentSynthesizer]: 1 loop disjuncts
[2024-11-19 14:17:56,344 INFO  L205   nArgumentSynthesizer]: 2 template conjuncts.
[2024-11-19 14:17:56,344 INFO  L401   nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications.
[2024-11-19 14:17:56,344 INFO  L402   nArgumentSynthesizer]: A total of 0 supporting invariants were added.
[2024-11-19 14:17:56,346 INFO  L488          LassoAnalysis]: Proving termination failed for this template and these settings.
[2024-11-19 14:17:56,358 INFO  L552       MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Ended with exit code 0
[2024-11-19 14:17:56,359 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000
[2024-11-19 14:17:56,359 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3
[2024-11-19 14:17:56,360 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-11-19 14:17:56,361 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-11-19 14:17:56,362 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-11-19 14:17:56,371 INFO  L338   nArgumentSynthesizer]: Template has degree 0.
[2024-11-19 14:17:56,372 INFO  L351   nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation.
[2024-11-19 14:17:56,372 INFO  L203   nArgumentSynthesizer]: 1 stem disjuncts
[2024-11-19 14:17:56,372 INFO  L204   nArgumentSynthesizer]: 1 loop disjuncts
[2024-11-19 14:17:56,372 INFO  L205   nArgumentSynthesizer]: 2 template conjuncts.
[2024-11-19 14:17:56,372 INFO  L401   nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications.
[2024-11-19 14:17:56,372 INFO  L402   nArgumentSynthesizer]: A total of 0 supporting invariants were added.
[2024-11-19 14:17:56,374 INFO  L488          LassoAnalysis]: Proving termination failed for this template and these settings.
[2024-11-19 14:17:56,384 INFO  L540       MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Forceful destruction successful, exit code 0
[2024-11-19 14:17:56,385 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000
[2024-11-19 14:17:56,385 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3
[2024-11-19 14:17:56,386 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-11-19 14:17:56,387 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-11-19 14:17:56,387 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-11-19 14:17:56,398 INFO  L338   nArgumentSynthesizer]: Template has degree 0.
[2024-11-19 14:17:56,398 INFO  L351   nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation.
[2024-11-19 14:17:56,398 INFO  L203   nArgumentSynthesizer]: 1 stem disjuncts
[2024-11-19 14:17:56,398 INFO  L204   nArgumentSynthesizer]: 1 loop disjuncts
[2024-11-19 14:17:56,398 INFO  L205   nArgumentSynthesizer]: 2 template conjuncts.
[2024-11-19 14:17:56,399 INFO  L401   nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications.
[2024-11-19 14:17:56,399 INFO  L402   nArgumentSynthesizer]: A total of 0 supporting invariants were added.
[2024-11-19 14:17:56,400 INFO  L488          LassoAnalysis]: Proving termination failed for this template and these settings.
[2024-11-19 14:17:56,415 INFO  L552       MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Ended with exit code 0
[2024-11-19 14:17:56,418 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000
[2024-11-19 14:17:56,418 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3
[2024-11-19 14:17:56,420 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-11-19 14:17:56,423 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-11-19 14:17:56,424 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-11-19 14:17:56,437 INFO  L338   nArgumentSynthesizer]: Template has degree 0.
[2024-11-19 14:17:56,437 INFO  L351   nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation.
[2024-11-19 14:17:56,438 INFO  L203   nArgumentSynthesizer]: 1 stem disjuncts
[2024-11-19 14:17:56,438 INFO  L204   nArgumentSynthesizer]: 1 loop disjuncts
[2024-11-19 14:17:56,438 INFO  L205   nArgumentSynthesizer]: 2 template conjuncts.
[2024-11-19 14:17:56,439 INFO  L401   nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications.
[2024-11-19 14:17:56,439 INFO  L402   nArgumentSynthesizer]: A total of 0 supporting invariants were added.
[2024-11-19 14:17:56,441 INFO  L488          LassoAnalysis]: Proving termination failed for this template and these settings.
[2024-11-19 14:17:56,456 INFO  L552       MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Ended with exit code 0
[2024-11-19 14:17:56,456 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000
[2024-11-19 14:17:56,456 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3
[2024-11-19 14:17:56,458 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-11-19 14:17:56,459 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-11-19 14:17:56,461 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-11-19 14:17:56,473 INFO  L338   nArgumentSynthesizer]: Template has degree 0.
[2024-11-19 14:17:56,473 INFO  L351   nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation.
[2024-11-19 14:17:56,474 INFO  L203   nArgumentSynthesizer]: 1 stem disjuncts
[2024-11-19 14:17:56,474 INFO  L204   nArgumentSynthesizer]: 1 loop disjuncts
[2024-11-19 14:17:56,474 INFO  L205   nArgumentSynthesizer]: 2 template conjuncts.
[2024-11-19 14:17:56,474 INFO  L401   nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications.
[2024-11-19 14:17:56,474 INFO  L402   nArgumentSynthesizer]: A total of 0 supporting invariants were added.
[2024-11-19 14:17:56,476 INFO  L488          LassoAnalysis]: Proving termination failed for this template and these settings.
[2024-11-19 14:17:56,491 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-11-19 14:17:56,492 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000
[2024-11-19 14:17:56,492 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3
[2024-11-19 14:17:56,494 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-11-19 14:17:56,495 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-11-19 14:17:56,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-11-19 14:17:56,508 INFO  L338   nArgumentSynthesizer]: Template has degree 0.
[2024-11-19 14:17:56,508 INFO  L351   nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation.
[2024-11-19 14:17:56,508 INFO  L203   nArgumentSynthesizer]: 1 stem disjuncts
[2024-11-19 14:17:56,508 INFO  L204   nArgumentSynthesizer]: 1 loop disjuncts
[2024-11-19 14:17:56,508 INFO  L205   nArgumentSynthesizer]: 2 template conjuncts.
[2024-11-19 14:17:56,509 INFO  L401   nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications.
[2024-11-19 14:17:56,509 INFO  L402   nArgumentSynthesizer]: A total of 0 supporting invariants were added.
[2024-11-19 14:17:56,511 INFO  L488          LassoAnalysis]: Proving termination failed for this template and these settings.
[2024-11-19 14:17:56,525 INFO  L552       MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Ended with exit code 0
[2024-11-19 14:17:56,526 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000
[2024-11-19 14:17:56,526 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3
[2024-11-19 14:17:56,528 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-11-19 14:17:56,529 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-11-19 14:17:56,530 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-11-19 14:17:56,542 INFO  L338   nArgumentSynthesizer]: Template has degree 0.
[2024-11-19 14:17:56,542 INFO  L351   nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation.
[2024-11-19 14:17:56,543 INFO  L203   nArgumentSynthesizer]: 1 stem disjuncts
[2024-11-19 14:17:56,543 INFO  L204   nArgumentSynthesizer]: 1 loop disjuncts
[2024-11-19 14:17:56,543 INFO  L205   nArgumentSynthesizer]: 2 template conjuncts.
[2024-11-19 14:17:56,544 INFO  L401   nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications.
[2024-11-19 14:17:56,544 INFO  L402   nArgumentSynthesizer]: A total of 0 supporting invariants were added.
[2024-11-19 14:17:56,547 INFO  L488          LassoAnalysis]: Proving termination failed for this template and these settings.
[2024-11-19 14:17:56,561 INFO  L552       MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Ended with exit code 0
[2024-11-19 14:17:56,562 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000
[2024-11-19 14:17:56,563 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3
[2024-11-19 14:17:56,564 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-11-19 14:17:56,565 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-11-19 14:17:56,566 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-11-19 14:17:56,578 INFO  L338   nArgumentSynthesizer]: Template has degree 0.
[2024-11-19 14:17:56,578 INFO  L351   nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation.
[2024-11-19 14:17:56,578 INFO  L203   nArgumentSynthesizer]: 1 stem disjuncts
[2024-11-19 14:17:56,578 INFO  L204   nArgumentSynthesizer]: 1 loop disjuncts
[2024-11-19 14:17:56,578 INFO  L205   nArgumentSynthesizer]: 2 template conjuncts.
[2024-11-19 14:17:56,579 INFO  L401   nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications.
[2024-11-19 14:17:56,579 INFO  L402   nArgumentSynthesizer]: A total of 0 supporting invariants were added.
[2024-11-19 14:17:56,580 INFO  L488          LassoAnalysis]: Proving termination failed for this template and these settings.
[2024-11-19 14:17:56,595 INFO  L552       MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (11)] Ended with exit code 0
[2024-11-19 14:17:56,596 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000
[2024-11-19 14:17:56,596 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3
[2024-11-19 14:17:56,597 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-11-19 14:17:56,600 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-11-19 14:17:56,601 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-11-19 14:17:56,613 INFO  L338   nArgumentSynthesizer]: Template has degree 0.
[2024-11-19 14:17:56,614 INFO  L351   nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation.
[2024-11-19 14:17:56,614 INFO  L203   nArgumentSynthesizer]: 1 stem disjuncts
[2024-11-19 14:17:56,614 INFO  L204   nArgumentSynthesizer]: 1 loop disjuncts
[2024-11-19 14:17:56,614 INFO  L205   nArgumentSynthesizer]: 2 template conjuncts.
[2024-11-19 14:17:56,614 INFO  L401   nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications.
[2024-11-19 14:17:56,614 INFO  L402   nArgumentSynthesizer]: A total of 0 supporting invariants were added.
[2024-11-19 14:17:56,618 INFO  L488          LassoAnalysis]: Proving termination failed for this template and these settings.
[2024-11-19 14:17:56,632 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-11-19 14:17:56,633 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000
[2024-11-19 14:17:56,633 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3
[2024-11-19 14:17:56,634 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-11-19 14:17:56,638 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-11-19 14:17:56,639 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-11-19 14:17:56,651 INFO  L338   nArgumentSynthesizer]: Template has degree 0.
[2024-11-19 14:17:56,652 INFO  L351   nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation.
[2024-11-19 14:17:56,652 INFO  L203   nArgumentSynthesizer]: 1 stem disjuncts
[2024-11-19 14:17:56,652 INFO  L204   nArgumentSynthesizer]: 1 loop disjuncts
[2024-11-19 14:17:56,652 INFO  L205   nArgumentSynthesizer]: 2 template conjuncts.
[2024-11-19 14:17:56,652 INFO  L401   nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications.
[2024-11-19 14:17:56,652 INFO  L402   nArgumentSynthesizer]: A total of 0 supporting invariants were added.
[2024-11-19 14:17:56,656 INFO  L488          LassoAnalysis]: Proving termination failed for this template and these settings.
[2024-11-19 14:17:56,670 INFO  L540       MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (13)] Forceful destruction successful, exit code 0
[2024-11-19 14:17:56,671 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000
[2024-11-19 14:17:56,671 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3
[2024-11-19 14:17:56,672 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-11-19 14:17:56,673 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-11-19 14:17:56,675 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-11-19 14:17:56,687 INFO  L338   nArgumentSynthesizer]: Template has degree 0.
[2024-11-19 14:17:56,687 INFO  L351   nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation.
[2024-11-19 14:17:56,687 INFO  L203   nArgumentSynthesizer]: 1 stem disjuncts
[2024-11-19 14:17:56,687 INFO  L204   nArgumentSynthesizer]: 1 loop disjuncts
[2024-11-19 14:17:56,687 INFO  L205   nArgumentSynthesizer]: 2 template conjuncts.
[2024-11-19 14:17:56,688 INFO  L401   nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications.
[2024-11-19 14:17:56,688 INFO  L402   nArgumentSynthesizer]: A total of 0 supporting invariants were added.
[2024-11-19 14:17:56,690 INFO  L488          LassoAnalysis]: Proving termination failed for this template and these settings.
[2024-11-19 14:17:56,704 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-11-19 14:17:56,704 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000
[2024-11-19 14:17:56,705 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3
[2024-11-19 14:17:56,706 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-11-19 14:17:56,707 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-11-19 14:17:56,708 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-11-19 14:17:56,721 INFO  L338   nArgumentSynthesizer]: Template has degree 0.
[2024-11-19 14:17:56,721 INFO  L351   nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation.
[2024-11-19 14:17:56,721 INFO  L203   nArgumentSynthesizer]: 1 stem disjuncts
[2024-11-19 14:17:56,722 INFO  L204   nArgumentSynthesizer]: 1 loop disjuncts
[2024-11-19 14:17:56,722 INFO  L205   nArgumentSynthesizer]: 2 template conjuncts.
[2024-11-19 14:17:56,722 INFO  L401   nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications.
[2024-11-19 14:17:56,722 INFO  L402   nArgumentSynthesizer]: A total of 0 supporting invariants were added.
[2024-11-19 14:17:56,724 INFO  L488          LassoAnalysis]: Proving termination failed for this template and these settings.
[2024-11-19 14:17:56,738 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-11-19 14:17:56,738 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000
[2024-11-19 14:17:56,739 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3
[2024-11-19 14:17:56,740 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-11-19 14:17:56,742 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-11-19 14:17:56,743 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-11-19 14:17:56,755 INFO  L338   nArgumentSynthesizer]: Template has degree 0.
[2024-11-19 14:17:56,755 INFO  L351   nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation.
[2024-11-19 14:17:56,755 INFO  L203   nArgumentSynthesizer]: 1 stem disjuncts
[2024-11-19 14:17:56,756 INFO  L204   nArgumentSynthesizer]: 1 loop disjuncts
[2024-11-19 14:17:56,756 INFO  L205   nArgumentSynthesizer]: 2 template conjuncts.
[2024-11-19 14:17:56,756 INFO  L401   nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications.
[2024-11-19 14:17:56,756 INFO  L402   nArgumentSynthesizer]: A total of 0 supporting invariants were added.
[2024-11-19 14:17:56,758 INFO  L488          LassoAnalysis]: Proving termination failed for this template and these settings.
[2024-11-19 14:17:56,773 INFO  L552       MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (16)] Ended with exit code 0
[2024-11-19 14:17:56,773 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000
[2024-11-19 14:17:56,773 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3
[2024-11-19 14:17:56,774 INFO  L229       MonitoredProcess]: Starting monitored process 17 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-11-19 14:17:56,776 INFO  L327       MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (17)] Waiting until timeout for monitored process
[2024-11-19 14:17:56,777 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-11-19 14:17:56,789 INFO  L338   nArgumentSynthesizer]: Template has degree 0.
[2024-11-19 14:17:56,790 INFO  L351   nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation.
[2024-11-19 14:17:56,790 INFO  L203   nArgumentSynthesizer]: 1 stem disjuncts
[2024-11-19 14:17:56,790 INFO  L204   nArgumentSynthesizer]: 1 loop disjuncts
[2024-11-19 14:17:56,790 INFO  L205   nArgumentSynthesizer]: 2 template conjuncts.
[2024-11-19 14:17:56,790 INFO  L401   nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications.
[2024-11-19 14:17:56,791 INFO  L402   nArgumentSynthesizer]: A total of 0 supporting invariants were added.
[2024-11-19 14:17:56,792 INFO  L488          LassoAnalysis]: Proving termination failed for this template and these settings.
[2024-11-19 14:17:56,807 INFO  L552       MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (17)] Ended with exit code 0
[2024-11-19 14:17:56,807 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000
[2024-11-19 14:17:56,807 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3
[2024-11-19 14:17:56,809 INFO  L229       MonitoredProcess]: Starting monitored process 18 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-11-19 14:17:56,810 INFO  L327       MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (18)] Waiting until timeout for monitored process
[2024-11-19 14:17:56,811 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-11-19 14:17:56,824 INFO  L338   nArgumentSynthesizer]: Template has degree 0.
[2024-11-19 14:17:56,824 INFO  L351   nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation.
[2024-11-19 14:17:56,824 INFO  L203   nArgumentSynthesizer]: 1 stem disjuncts
[2024-11-19 14:17:56,824 INFO  L204   nArgumentSynthesizer]: 1 loop disjuncts
[2024-11-19 14:17:56,824 INFO  L205   nArgumentSynthesizer]: 2 template conjuncts.
[2024-11-19 14:17:56,825 INFO  L401   nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications.
[2024-11-19 14:17:56,825 INFO  L402   nArgumentSynthesizer]: A total of 0 supporting invariants were added.
[2024-11-19 14:17:56,831 INFO  L488          LassoAnalysis]: Proving termination failed for this template and these settings.
[2024-11-19 14:17:56,846 INFO  L552       MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (18)] Ended with exit code 0
[2024-11-19 14:17:56,847 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000
[2024-11-19 14:17:56,847 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3
[2024-11-19 14:17:56,848 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-11-19 14:17:56,852 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-11-19 14:17:56,853 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-11-19 14:17:56,866 INFO  L338   nArgumentSynthesizer]: Template has degree 0.
[2024-11-19 14:17:56,866 INFO  L351   nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation.
[2024-11-19 14:17:56,866 INFO  L203   nArgumentSynthesizer]: 1 stem disjuncts
[2024-11-19 14:17:56,866 INFO  L204   nArgumentSynthesizer]: 1 loop disjuncts
[2024-11-19 14:17:56,866 INFO  L205   nArgumentSynthesizer]: 2 template conjuncts.
[2024-11-19 14:17:56,868 INFO  L401   nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications.
[2024-11-19 14:17:56,868 INFO  L402   nArgumentSynthesizer]: A total of 0 supporting invariants were added.
[2024-11-19 14:17:56,872 INFO  L488          LassoAnalysis]: Proving termination failed for this template and these settings.
[2024-11-19 14:17:56,887 INFO  L552       MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (19)] Ended with exit code 0
[2024-11-19 14:17:56,887 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000
[2024-11-19 14:17:56,887 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3
[2024-11-19 14:17:56,889 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-11-19 14:17:56,890 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-11-19 14:17:56,892 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-11-19 14:17:56,905 INFO  L338   nArgumentSynthesizer]: Template has degree 0.
[2024-11-19 14:17:56,905 INFO  L351   nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation.
[2024-11-19 14:17:56,905 INFO  L203   nArgumentSynthesizer]: 1 stem disjuncts
[2024-11-19 14:17:56,905 INFO  L204   nArgumentSynthesizer]: 1 loop disjuncts
[2024-11-19 14:17:56,905 INFO  L205   nArgumentSynthesizer]: 2 template conjuncts.
[2024-11-19 14:17:56,906 INFO  L401   nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications.
[2024-11-19 14:17:56,907 INFO  L402   nArgumentSynthesizer]: A total of 0 supporting invariants were added.
[2024-11-19 14:17:56,911 INFO  L488          LassoAnalysis]: Proving termination failed for this template and these settings.
[2024-11-19 14:17:56,922 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-11-19 14:17:56,922 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000
[2024-11-19 14:17:56,922 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3
[2024-11-19 14:17:56,924 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-11-19 14:17:56,925 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-11-19 14:17:56,926 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-11-19 14:17:56,936 INFO  L338   nArgumentSynthesizer]: Template has degree 0.
[2024-11-19 14:17:56,936 INFO  L351   nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation.
[2024-11-19 14:17:56,936 INFO  L203   nArgumentSynthesizer]: 1 stem disjuncts
[2024-11-19 14:17:56,936 INFO  L204   nArgumentSynthesizer]: 1 loop disjuncts
[2024-11-19 14:17:56,937 INFO  L205   nArgumentSynthesizer]: 2 template conjuncts.
[2024-11-19 14:17:56,938 INFO  L401   nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications.
[2024-11-19 14:17:56,938 INFO  L402   nArgumentSynthesizer]: A total of 0 supporting invariants were added.
[2024-11-19 14:17:56,940 INFO  L420   nArgumentSynthesizer]: Found a termination argument, trying to simplify.
[2024-11-19 14:17:56,944 INFO  L443   ModelExtractionUtils]: Simplification made 2 calls to the SMT solver.
[2024-11-19 14:17:56,944 INFO  L444   ModelExtractionUtils]: 1 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero.
[2024-11-19 14:17:56,945 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000
[2024-11-19 14:17:56,945 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3
[2024-11-19 14:17:56,948 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-11-19 14:17:56,949 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-11-19 14:17:56,950 INFO  L435   nArgumentSynthesizer]: Simplifying supporting invariants...
[2024-11-19 14:17:56,950 INFO  L438   nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0.
[2024-11-19 14:17:56,950 INFO  L474          LassoAnalysis]: Proved termination.
[2024-11-19 14:17:56,950 INFO  L476          LassoAnalysis]: Termination argument consisting of:
Ranking function f(v_rep(select (select #memory_int#0 ULTIMATE.start_basename_~path#1.base) (+ ULTIMATE.start_basename_~path#1.offset 1))_1) = 1*v_rep(select (select #memory_int#0 ULTIMATE.start_basename_~path#1.base) (+ ULTIMATE.start_basename_~path#1.offset 1))_1
Supporting invariants []
[2024-11-19 14:17:56,964 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-11-19 14:17:56,975 INFO  L156   tatePredicateManager]: 4 out of 4 supporting invariants were superfluous and have been removed
[2024-11-19 14:17:56,984 WARN  L976   BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#0
[2024-11-19 14:17:56,985 WARN  L976   BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#0,GLOBAL]
[2024-11-19 14:17:56,985 WARN  L976   BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#0,GLOBAL],[IdentifierExpression[~path!base,<LOCAL,basename>]]]
[2024-11-19 14:17:57,005 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2024-11-19 14:17:57,030 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-19 14:17:57,031 INFO  L255         TraceCheckSpWp]: Trace formula consists of 39 conjuncts, 2 conjuncts are in the unsatisfiable core
[2024-11-19 14:17:57,031 INFO  L278         TraceCheckSpWp]: Computing forward predicates...
[2024-11-19 14:17:57,071 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-19 14:17:57,073 INFO  L255         TraceCheckSpWp]: Trace formula consists of 111 conjuncts, 50 conjuncts are in the unsatisfiable core
[2024-11-19 14:17:57,076 INFO  L278         TraceCheckSpWp]: Computing forward predicates...
[2024-11-19 14:17:57,424 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-11-19 14:17:57,500 INFO  L134       CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked.
[2024-11-19 14:17:57,505 INFO  L141   lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 10 loop predicates 
[2024-11-19 14:17:57,506 INFO  L71    iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 20 states and 24 transitions. cyclomatic complexity: 5 Second operand  has 11 states, 11 states have (on average 1.7272727272727273) internal successors, (19), 11 states have internal predecessors, (19), 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-11-19 14:17:57,840 INFO  L75    iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 20 states and 24 transitions. cyclomatic complexity: 5. Second operand  has 11 states, 11 states have (on average 1.7272727272727273) internal successors, (19), 11 states have internal predecessors, (19), 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 90 states and 108 transitions. Complement of second has 25 states.
[2024-11-19 14:17:57,841 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 13 states 1 stem states 11 non-accepting loop states 1 accepting loop states 
[2024-11-19 14:17:57,842 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 11 states, 11 states have (on average 1.7272727272727273) internal successors, (19), 11 states have internal predecessors, (19), 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-11-19 14:17:57,843 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 37 transitions.
[2024-11-19 14:17:57,844 INFO  L84            BuchiAccepts]: Start buchiAccepts Operand 13 states and 37 transitions. Stem has 3 letters. Loop has 17 letters.
[2024-11-19 14:17:57,845 INFO  L116           BuchiAccepts]: Finished buchiAccepts.
[2024-11-19 14:17:57,845 INFO  L84            BuchiAccepts]: Start buchiAccepts Operand 13 states and 37 transitions. Stem has 20 letters. Loop has 17 letters.
[2024-11-19 14:17:57,845 INFO  L116           BuchiAccepts]: Finished buchiAccepts.
[2024-11-19 14:17:57,845 INFO  L84            BuchiAccepts]: Start buchiAccepts Operand 13 states and 37 transitions. Stem has 3 letters. Loop has 34 letters.
[2024-11-19 14:17:57,846 INFO  L116           BuchiAccepts]: Finished buchiAccepts.
[2024-11-19 14:17:57,846 INFO  L82        GeneralOperation]: Start removeNonLiveStates. Operand 90 states and 108 transitions.
[2024-11-19 14:17:57,847 INFO  L131   ngComponentsAnalysis]: Automaton has 4 accepting balls. 31
[2024-11-19 14:17:57,848 INFO  L88        GeneralOperation]: Finished removeNonLiveStates. Reduced from 90 states to 68 states and 81 transitions.
[2024-11-19 14:17:57,848 INFO  L87         BuchiClosureNwa]: Accepting states before buchiClosure: 50
[2024-11-19 14:17:57,849 INFO  L106        BuchiClosureNwa]: Accepting states after buchiClosure: 51
[2024-11-19 14:17:57,849 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 68 states and 81 transitions.
[2024-11-19 14:17:57,849 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is not deterministic.
[2024-11-19 14:17:57,849 INFO  L218   hiAutomatonCegarLoop]: Abstraction has 68 states and 81 transitions.
[2024-11-19 14:17:57,849 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 68 states and 81 transitions.
[2024-11-19 14:17:57,852 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 42.
[2024-11-19 14:17:57,852 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 42 states, 42 states have (on average 1.1904761904761905) internal successors, (50), 41 states have internal predecessors, (50), 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-11-19 14:17:57,852 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 50 transitions.
[2024-11-19 14:17:57,853 INFO  L240   hiAutomatonCegarLoop]: Abstraction has 42 states and 50 transitions.
[2024-11-19 14:17:57,853 INFO  L425   stractBuchiCegarLoop]: Abstraction has 42 states and 50 transitions.
[2024-11-19 14:17:57,853 INFO  L332   stractBuchiCegarLoop]: ======== Iteration 6 ============
[2024-11-19 14:17:57,853 INFO  L72            BuchiIsEmpty]: Start buchiIsEmpty. Operand 42 states and 50 transitions.
[2024-11-19 14:17:57,854 INFO  L131   ngComponentsAnalysis]: Automaton has 1 accepting balls. 17
[2024-11-19 14:17:57,854 INFO  L87            BuchiIsEmpty]: Finished buchiIsEmpty Result is false
[2024-11-19 14:17:57,854 INFO  L119           BuchiIsEmpty]: Starting construction of run
[2024-11-19 14:17:57,854 INFO  L148   hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1]
[2024-11-19 14:17:57,854 INFO  L149   hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1]
[2024-11-19 14:17:57,854 INFO  L745   eck$LassoCheckResult]: Stem: 541#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 542#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet7#1, main_#t~malloc8#1.base, main_#t~malloc8#1.offset, main_#t~ret9#1.base, main_#t~ret9#1.offset, main_~in_len~0#1, main_~in~0#1.base, main_~in~0#1.offset;havoc main_#t~nondet7#1;main_~in_len~0#1 := main_#t~nondet7#1;havoc main_#t~nondet7#1; 543#L531 assume !(main_~in_len~0#1 < 1);call main_#t~malloc8#1.base, main_#t~malloc8#1.offset := #Ultimate.allocOnStack(main_~in_len~0#1 % 18446744073709551616);main_~in~0#1.base, main_~in~0#1.offset := main_#t~malloc8#1.base, main_#t~malloc8#1.offset;call write~int#0(0, main_~in~0#1.base, main_~in~0#1.offset + (main_~in_len~0#1 - 1), 1);assume { :begin_inline_basename } true;basename_#in~path#1.base, basename_#in~path#1.offset := main_~in~0#1.base, main_~in~0#1.offset;havoc basename_#res#1.base, basename_#res#1.offset;havoc basename_#t~ret5#1.base, basename_#t~ret5#1.offset, basename_#t~mem6#1, basename_~path#1.base, basename_~path#1.offset, basename_~c~0#1.base, basename_~c~0#1.offset;basename_~path#1.base, basename_~path#1.offset := basename_#in~path#1.base, basename_#in~path#1.offset;havoc basename_~c~0#1.base, basename_~c~0#1.offset; 544#L517 assume { :begin_inline_strrchr } true;strrchr_#in~t#1.base, strrchr_#in~t#1.offset, strrchr_#in~c#1 := basename_~path#1.base, basename_~path#1.offset, 47;havoc strrchr_#res#1.base, strrchr_#res#1.offset;havoc strrchr_#t~mem2#1, strrchr_#t~mem3#1, strrchr_#t~pre4#1.base, strrchr_#t~pre4#1.offset, strrchr_~t#1.base, strrchr_~t#1.offset, strrchr_~c#1, strrchr_~ch~0#1, strrchr_~l~0#1.base, strrchr_~l~0#1.offset;strrchr_~t#1.base, strrchr_~t#1.offset := strrchr_#in~t#1.base, strrchr_#in~t#1.offset;strrchr_~c#1 := strrchr_#in~c#1;havoc strrchr_~ch~0#1;strrchr_~l~0#1.base, strrchr_~l~0#1.offset := 0, 0;strrchr_~ch~0#1 := (if strrchr_~c#1 % 256 <= 127 then strrchr_~c#1 % 256 else strrchr_~c#1 % 256 - 256); 553#L510-1 call strrchr_#t~mem2#1 := read~int#0(strrchr_~t#1.base, strrchr_~t#1.offset, 1); 574#L511 assume !(strrchr_#t~mem2#1 == strrchr_~ch~0#1);havoc strrchr_#t~mem2#1; 534#L511-2 
[2024-11-19 14:17:57,855 INFO  L747   eck$LassoCheckResult]: Loop: 534#L511-2 call strrchr_#t~mem3#1 := read~int#0(strrchr_~t#1.base, strrchr_~t#1.offset, 1); 537#L511-3 assume !(0 == strrchr_#t~mem3#1);havoc strrchr_#t~mem3#1;strrchr_#t~pre4#1.base, strrchr_#t~pre4#1.offset := strrchr_~t#1.base, 1 + strrchr_~t#1.offset;strrchr_~t#1.base, strrchr_~t#1.offset := strrchr_~t#1.base, 1 + strrchr_~t#1.offset;havoc strrchr_#t~pre4#1.base, strrchr_#t~pre4#1.offset; 572#L510-1 call strrchr_#t~mem2#1 := read~int#0(strrchr_~t#1.base, strrchr_~t#1.offset, 1); 571#L511 assume !(strrchr_#t~mem2#1 == strrchr_~ch~0#1);havoc strrchr_#t~mem2#1; 534#L511-2 
[2024-11-19 14:17:57,855 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2024-11-19 14:17:57,855 INFO  L85        PathProgramCache]: Analyzing trace with hash 889568330, now seen corresponding path program 1 times
[2024-11-19 14:17:57,855 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-19 14:17:57,855 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1723487188]
[2024-11-19 14:17:57,856 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-19 14:17:57,856 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-19 14:17:57,865 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is sat
[2024-11-19 14:17:57,866 INFO  L356             TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders.
[2024-11-19 14:17:57,871 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is sat
[2024-11-19 14:17:57,872 INFO  L130   FreeRefinementEngine]: Strategy CAMEL found a feasible trace
[2024-11-19 14:17:57,873 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2024-11-19 14:17:57,873 INFO  L85        PathProgramCache]: Analyzing trace with hash 1543787, now seen corresponding path program 1 times
[2024-11-19 14:17:57,873 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-19 14:17:57,873 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [336136283]
[2024-11-19 14:17:57,873 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-19 14:17:57,874 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-19 14:17:57,877 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is sat
[2024-11-19 14:17:57,877 INFO  L356             TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders.
[2024-11-19 14:17:57,878 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is sat
[2024-11-19 14:17:57,880 INFO  L130   FreeRefinementEngine]: Strategy CAMEL found a feasible trace
[2024-11-19 14:17:57,880 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2024-11-19 14:17:57,880 INFO  L85        PathProgramCache]: Analyzing trace with hash -2015101388, now seen corresponding path program 1 times
[2024-11-19 14:17:57,880 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-19 14:17:57,880 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1727462689]
[2024-11-19 14:17:57,880 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-19 14:17:57,881 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-19 14:17:57,889 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is sat
[2024-11-19 14:17:57,890 INFO  L356             TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders.
[2024-11-19 14:17:57,895 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is sat
[2024-11-19 14:17:57,898 INFO  L130   FreeRefinementEngine]: Strategy CAMEL found a feasible trace
[2024-11-19 14:17:58,271 INFO  L204          LassoAnalysis]: Preferences:
[2024-11-19 14:17:58,272 INFO  L125   ssoRankerPreferences]: Compute integeral hull: false
[2024-11-19 14:17:58,272 INFO  L126   ssoRankerPreferences]: Enable LassoPartitioneer: true
[2024-11-19 14:17:58,272 INFO  L127   ssoRankerPreferences]: Term annotations enabled: false
[2024-11-19 14:17:58,272 INFO  L128   ssoRankerPreferences]: Use exernal solver: false
[2024-11-19 14:17:58,272 INFO  L129   ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000
[2024-11-19 14:17:58,272 INFO  L130   ssoRankerPreferences]: Dump SMT script to file: false
[2024-11-19 14:17:58,272 INFO  L131   ssoRankerPreferences]: Path of dumped script: 
[2024-11-19 14:17:58,272 INFO  L132   ssoRankerPreferences]: Filename of dumped script: basename-3.i_Iteration6_Lasso
[2024-11-19 14:17:58,272 INFO  L133   ssoRankerPreferences]: MapElimAlgo: Frank
[2024-11-19 14:17:58,272 INFO  L241          LassoAnalysis]: Starting lasso preprocessing...
[2024-11-19 14:17:58,274 INFO  L118          MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true
[2024-11-19 14:17:58,276 INFO  L118          MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true
[2024-11-19 14:17:58,278 INFO  L118          MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true
[2024-11-19 14:17:58,280 INFO  L118          MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true
[2024-11-19 14:17:58,283 INFO  L118          MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true
[2024-11-19 14:17:58,412 INFO  L118          MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true
[2024-11-19 14:17:58,414 INFO  L118          MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true
[2024-11-19 14:17:58,416 INFO  L118          MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true
[2024-11-19 14:17:58,417 INFO  L118          MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true
[2024-11-19 14:17:58,419 INFO  L118          MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true
[2024-11-19 14:17:58,421 INFO  L118          MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true
[2024-11-19 14:17:58,423 INFO  L118          MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true
[2024-11-19 14:17:58,425 INFO  L118          MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true
[2024-11-19 14:17:58,427 INFO  L118          MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true
[2024-11-19 14:17:58,429 INFO  L118          MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true
[2024-11-19 14:17:58,430 INFO  L118          MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true
[2024-11-19 14:17:58,433 INFO  L118          MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true
[2024-11-19 14:17:58,435 INFO  L118          MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true
[2024-11-19 14:17:58,436 INFO  L118          MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true
[2024-11-19 14:17:58,438 INFO  L118          MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true
[2024-11-19 14:17:58,440 INFO  L118          MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true
[2024-11-19 14:17:58,442 INFO  L118          MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true
[2024-11-19 14:17:58,443 INFO  L118          MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true
[2024-11-19 14:17:58,445 INFO  L118          MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true
[2024-11-19 14:17:58,695 INFO  L259          LassoAnalysis]: Preprocessing complete.
[2024-11-19 14:17:58,696 INFO  L451          LassoAnalysis]: Using template 'affine'.
[2024-11-19 14:17:58,696 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000
[2024-11-19 14:17:58,696 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3
[2024-11-19 14:17:58,698 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-11-19 14:17:58,699 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-11-19 14:17:58,700 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-11-19 14:17:58,713 INFO  L338   nArgumentSynthesizer]: Template has degree 0.
[2024-11-19 14:17:58,713 INFO  L351   nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation.
[2024-11-19 14:17:58,714 INFO  L203   nArgumentSynthesizer]: 1 stem disjuncts
[2024-11-19 14:17:58,714 INFO  L204   nArgumentSynthesizer]: 1 loop disjuncts
[2024-11-19 14:17:58,714 INFO  L205   nArgumentSynthesizer]: 2 template conjuncts.
[2024-11-19 14:17:58,714 INFO  L401   nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications.
[2024-11-19 14:17:58,714 INFO  L402   nArgumentSynthesizer]: A total of 0 supporting invariants were added.
[2024-11-19 14:17:58,716 INFO  L488          LassoAnalysis]: Proving termination failed for this template and these settings.
[2024-11-19 14:17:58,730 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-11-19 14:17:58,730 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000
[2024-11-19 14:17:58,730 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3
[2024-11-19 14:17:58,732 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-11-19 14:17:58,733 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-11-19 14:17:58,734 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-11-19 14:17:58,745 INFO  L338   nArgumentSynthesizer]: Template has degree 0.
[2024-11-19 14:17:58,745 INFO  L351   nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation.
[2024-11-19 14:17:58,745 INFO  L203   nArgumentSynthesizer]: 1 stem disjuncts
[2024-11-19 14:17:58,745 INFO  L204   nArgumentSynthesizer]: 1 loop disjuncts
[2024-11-19 14:17:58,745 INFO  L205   nArgumentSynthesizer]: 2 template conjuncts.
[2024-11-19 14:17:58,746 INFO  L401   nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications.
[2024-11-19 14:17:58,746 INFO  L402   nArgumentSynthesizer]: A total of 0 supporting invariants were added.
[2024-11-19 14:17:58,747 INFO  L488          LassoAnalysis]: Proving termination failed for this template and these settings.
[2024-11-19 14:17:58,757 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-11-19 14:17:58,757 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000
[2024-11-19 14:17:58,757 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3
[2024-11-19 14:17:58,758 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-11-19 14:17:58,759 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-11-19 14:17:58,760 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-11-19 14:17:58,769 INFO  L338   nArgumentSynthesizer]: Template has degree 0.
[2024-11-19 14:17:58,769 INFO  L351   nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation.
[2024-11-19 14:17:58,769 INFO  L203   nArgumentSynthesizer]: 1 stem disjuncts
[2024-11-19 14:17:58,769 INFO  L204   nArgumentSynthesizer]: 1 loop disjuncts
[2024-11-19 14:17:58,769 INFO  L205   nArgumentSynthesizer]: 2 template conjuncts.
[2024-11-19 14:17:58,770 INFO  L401   nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications.
[2024-11-19 14:17:58,770 INFO  L402   nArgumentSynthesizer]: A total of 0 supporting invariants were added.
[2024-11-19 14:17:58,771 INFO  L488          LassoAnalysis]: Proving termination failed for this template and these settings.
[2024-11-19 14:17:58,781 INFO  L540       MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (25)] Forceful destruction successful, exit code 0
[2024-11-19 14:17:58,781 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000
[2024-11-19 14:17:58,781 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3
[2024-11-19 14:17:58,782 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-11-19 14:17:58,783 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-11-19 14:17:58,784 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-11-19 14:17:58,794 INFO  L338   nArgumentSynthesizer]: Template has degree 0.
[2024-11-19 14:17:58,794 INFO  L203   nArgumentSynthesizer]: 1 stem disjuncts
[2024-11-19 14:17:58,794 INFO  L204   nArgumentSynthesizer]: 1 loop disjuncts
[2024-11-19 14:17:58,794 INFO  L205   nArgumentSynthesizer]: 2 template conjuncts.
[2024-11-19 14:17:58,797 INFO  L401   nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications.
[2024-11-19 14:17:58,797 INFO  L402   nArgumentSynthesizer]: A total of 2 supporting invariants were added.
[2024-11-19 14:17:58,800 INFO  L488          LassoAnalysis]: Proving termination failed for this template and these settings.
[2024-11-19 14:17:58,814 INFO  L540       MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (26)] Forceful destruction successful, exit code 0
[2024-11-19 14:17:58,814 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000
[2024-11-19 14:17:58,815 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3
[2024-11-19 14:17:58,816 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-11-19 14:17:58,817 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-11-19 14:17:58,817 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-11-19 14:17:58,830 INFO  L338   nArgumentSynthesizer]: Template has degree 0.
[2024-11-19 14:17:58,830 INFO  L203   nArgumentSynthesizer]: 2 stem disjuncts
[2024-11-19 14:17:58,830 INFO  L204   nArgumentSynthesizer]: 4 loop disjuncts
[2024-11-19 14:17:58,830 INFO  L205   nArgumentSynthesizer]: 2 template conjuncts.
[2024-11-19 14:17:58,845 INFO  L401   nArgumentSynthesizer]: We have 56 Motzkin's Theorem applications.
[2024-11-19 14:17:58,845 INFO  L402   nArgumentSynthesizer]: A total of 8 supporting invariants were added.
[2024-11-19 14:17:58,881 INFO  L488          LassoAnalysis]: Proving termination failed for this template and these settings.
[2024-11-19 14:17:58,895 INFO  L540       MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (27)] Forceful destruction successful, exit code 0
[2024-11-19 14:17:58,895 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000
[2024-11-19 14:17:58,895 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3
[2024-11-19 14:17:58,897 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-11-19 14:17:58,898 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-11-19 14:17:58,899 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-11-19 14:17:58,911 INFO  L338   nArgumentSynthesizer]: Template has degree 0.
[2024-11-19 14:17:58,911 INFO  L203   nArgumentSynthesizer]: 1 stem disjuncts
[2024-11-19 14:17:58,911 INFO  L204   nArgumentSynthesizer]: 1 loop disjuncts
[2024-11-19 14:17:58,911 INFO  L205   nArgumentSynthesizer]: 2 template conjuncts.
[2024-11-19 14:17:58,914 INFO  L401   nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications.
[2024-11-19 14:17:58,914 INFO  L402   nArgumentSynthesizer]: A total of 2 supporting invariants were added.
[2024-11-19 14:17:58,920 INFO  L488          LassoAnalysis]: Proving termination failed for this template and these settings.
[2024-11-19 14:17:58,934 INFO  L540       MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (28)] Forceful destruction successful, exit code 0
[2024-11-19 14:17:58,935 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000
[2024-11-19 14:17:58,935 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3
[2024-11-19 14:17:58,936 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-11-19 14:17:58,937 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-11-19 14:17:58,938 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-11-19 14:17:58,951 INFO  L338   nArgumentSynthesizer]: Template has degree 0.
[2024-11-19 14:17:58,951 INFO  L203   nArgumentSynthesizer]: 1 stem disjuncts
[2024-11-19 14:17:58,951 INFO  L204   nArgumentSynthesizer]: 1 loop disjuncts
[2024-11-19 14:17:58,951 INFO  L205   nArgumentSynthesizer]: 2 template conjuncts.
[2024-11-19 14:17:58,959 INFO  L401   nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications.
[2024-11-19 14:17:58,959 INFO  L402   nArgumentSynthesizer]: A total of 2 supporting invariants were added.
[2024-11-19 14:17:58,973 INFO  L420   nArgumentSynthesizer]: Found a termination argument, trying to simplify.
[2024-11-19 14:17:59,007 INFO  L443   ModelExtractionUtils]: Simplification made 13 calls to the SMT solver.
[2024-11-19 14:17:59,007 INFO  L444   ModelExtractionUtils]: 4 out of 16 variables were initially zero. Simplification set additionally 7 variables to zero.
[2024-11-19 14:17:59,008 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000
[2024-11-19 14:17:59,008 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3
[2024-11-19 14:17:59,010 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-11-19 14:17:59,011 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-11-19 14:17:59,012 INFO  L435   nArgumentSynthesizer]: Simplifying supporting invariants...
[2024-11-19 14:17:59,027 INFO  L438   nArgumentSynthesizer]: Removed 1 redundant supporting invariants from a total of 2.
[2024-11-19 14:17:59,027 INFO  L474          LassoAnalysis]: Proved termination.
[2024-11-19 14:17:59,027 INFO  L476          LassoAnalysis]: Termination argument consisting of:
Ranking function f(ULTIMATE.start_strrchr_~t#1.offset) = -2*ULTIMATE.start_strrchr_~t#1.offset + 36893488147419103227
Supporting invariants [-1*v_rep(select #length ULTIMATE.start_strrchr_~t#1.base)_1 + 18446744073709551615 >= 0]
[2024-11-19 14:17:59,042 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-11-19 14:17:59,052 INFO  L156   tatePredicateManager]: 3 out of 4 supporting invariants were superfluous and have been removed
[2024-11-19 14:17:59,056 WARN  L976   BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~t!offset
[2024-11-19 14:17:59,078 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2024-11-19 14:17:59,095 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-19 14:17:59,096 INFO  L255         TraceCheckSpWp]: Trace formula consists of 64 conjuncts, 14 conjuncts are in the unsatisfiable core
[2024-11-19 14:17:59,097 INFO  L278         TraceCheckSpWp]: Computing forward predicates...
[2024-11-19 14:17:59,109 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 1, 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-11-19 14:17:59,145 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-19 14:17:59,146 INFO  L255         TraceCheckSpWp]: Trace formula consists of 21 conjuncts, 7 conjuncts are in the unsatisfiable core
[2024-11-19 14:17:59,146 INFO  L278         TraceCheckSpWp]: Computing forward predicates...
[2024-11-19 14:17:59,190 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-11-19 14:17:59,191 INFO  L141   lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.3 stem predicates 3 loop predicates 
[2024-11-19 14:17:59,191 INFO  L71    iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 42 states and 50 transitions. cyclomatic complexity: 10 Second operand  has 7 states, 7 states have (on average 1.4285714285714286) internal successors, (10), 7 states have internal predecessors, (10), 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-11-19 14:17:59,253 INFO  L75    iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 42 states and 50 transitions. cyclomatic complexity: 10. Second operand  has 7 states, 7 states have (on average 1.4285714285714286) internal successors, (10), 7 states have internal predecessors, (10), 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 100 states and 122 transitions. Complement of second has 9 states.
[2024-11-19 14:17:59,254 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 6 states 3 stem states 2 non-accepting loop states 1 accepting loop states 
[2024-11-19 14:17:59,254 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 7 states, 7 states have (on average 1.4285714285714286) internal successors, (10), 7 states have internal predecessors, (10), 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-11-19 14:17:59,254 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 16 transitions.
[2024-11-19 14:17:59,255 INFO  L84            BuchiAccepts]: Start buchiAccepts Operand 6 states and 16 transitions. Stem has 6 letters. Loop has 4 letters.
[2024-11-19 14:17:59,255 INFO  L116           BuchiAccepts]: Finished buchiAccepts.
[2024-11-19 14:17:59,255 INFO  L84            BuchiAccepts]: Start buchiAccepts Operand 6 states and 16 transitions. Stem has 10 letters. Loop has 4 letters.
[2024-11-19 14:17:59,255 INFO  L116           BuchiAccepts]: Finished buchiAccepts.
[2024-11-19 14:17:59,255 INFO  L84            BuchiAccepts]: Start buchiAccepts Operand 6 states and 16 transitions. Stem has 6 letters. Loop has 8 letters.
[2024-11-19 14:17:59,255 INFO  L116           BuchiAccepts]: Finished buchiAccepts.
[2024-11-19 14:17:59,255 INFO  L82        GeneralOperation]: Start removeNonLiveStates. Operand 100 states and 122 transitions.
[2024-11-19 14:17:59,257 INFO  L131   ngComponentsAnalysis]: Automaton has 2 accepting balls. 21
[2024-11-19 14:17:59,258 INFO  L88        GeneralOperation]: Finished removeNonLiveStates. Reduced from 100 states to 90 states and 108 transitions.
[2024-11-19 14:17:59,258 INFO  L87         BuchiClosureNwa]: Accepting states before buchiClosure: 43
[2024-11-19 14:17:59,258 INFO  L106        BuchiClosureNwa]: Accepting states after buchiClosure: 45
[2024-11-19 14:17:59,259 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 90 states and 108 transitions.
[2024-11-19 14:17:59,259 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is not deterministic.
[2024-11-19 14:17:59,259 INFO  L218   hiAutomatonCegarLoop]: Abstraction has 90 states and 108 transitions.
[2024-11-19 14:17:59,259 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 90 states and 108 transitions.
[2024-11-19 14:17:59,269 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 85.
[2024-11-19 14:17:59,269 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 85 states, 85 states have (on average 1.2117647058823529) internal successors, (103), 84 states have internal predecessors, (103), 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-11-19 14:17:59,270 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 103 transitions.
[2024-11-19 14:17:59,270 INFO  L240   hiAutomatonCegarLoop]: Abstraction has 85 states and 103 transitions.
[2024-11-19 14:17:59,270 INFO  L425   stractBuchiCegarLoop]: Abstraction has 85 states and 103 transitions.
[2024-11-19 14:17:59,270 INFO  L332   stractBuchiCegarLoop]: ======== Iteration 7 ============
[2024-11-19 14:17:59,270 INFO  L72            BuchiIsEmpty]: Start buchiIsEmpty. Operand 85 states and 103 transitions.
[2024-11-19 14:17:59,273 INFO  L131   ngComponentsAnalysis]: Automaton has 2 accepting balls. 21
[2024-11-19 14:17:59,274 INFO  L87            BuchiIsEmpty]: Finished buchiIsEmpty Result is false
[2024-11-19 14:17:59,274 INFO  L119           BuchiIsEmpty]: Starting construction of run
[2024-11-19 14:17:59,275 INFO  L148   hiAutomatonCegarLoop]: Counterexample stem histogram [3, 3, 2, 2, 1, 1, 1, 1]
[2024-11-19 14:17:59,275 INFO  L149   hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1]
[2024-11-19 14:17:59,275 INFO  L745   eck$LassoCheckResult]: Stem: 765#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 766#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet7#1, main_#t~malloc8#1.base, main_#t~malloc8#1.offset, main_#t~ret9#1.base, main_#t~ret9#1.offset, main_~in_len~0#1, main_~in~0#1.base, main_~in~0#1.offset;havoc main_#t~nondet7#1;main_~in_len~0#1 := main_#t~nondet7#1;havoc main_#t~nondet7#1; 767#L531 assume !(main_~in_len~0#1 < 1);call main_#t~malloc8#1.base, main_#t~malloc8#1.offset := #Ultimate.allocOnStack(main_~in_len~0#1 % 18446744073709551616);main_~in~0#1.base, main_~in~0#1.offset := main_#t~malloc8#1.base, main_#t~malloc8#1.offset;call write~int#0(0, main_~in~0#1.base, main_~in~0#1.offset + (main_~in_len~0#1 - 1), 1);assume { :begin_inline_basename } true;basename_#in~path#1.base, basename_#in~path#1.offset := main_~in~0#1.base, main_~in~0#1.offset;havoc basename_#res#1.base, basename_#res#1.offset;havoc basename_#t~ret5#1.base, basename_#t~ret5#1.offset, basename_#t~mem6#1, basename_~path#1.base, basename_~path#1.offset, basename_~c~0#1.base, basename_~c~0#1.offset;basename_~path#1.base, basename_~path#1.offset := basename_#in~path#1.base, basename_#in~path#1.offset;havoc basename_~c~0#1.base, basename_~c~0#1.offset; 768#L517 assume { :begin_inline_strrchr } true;strrchr_#in~t#1.base, strrchr_#in~t#1.offset, strrchr_#in~c#1 := basename_~path#1.base, basename_~path#1.offset, 47;havoc strrchr_#res#1.base, strrchr_#res#1.offset;havoc strrchr_#t~mem2#1, strrchr_#t~mem3#1, strrchr_#t~pre4#1.base, strrchr_#t~pre4#1.offset, strrchr_~t#1.base, strrchr_~t#1.offset, strrchr_~c#1, strrchr_~ch~0#1, strrchr_~l~0#1.base, strrchr_~l~0#1.offset;strrchr_~t#1.base, strrchr_~t#1.offset := strrchr_#in~t#1.base, strrchr_#in~t#1.offset;strrchr_~c#1 := strrchr_#in~c#1;havoc strrchr_~ch~0#1;strrchr_~l~0#1.base, strrchr_~l~0#1.offset := 0, 0;strrchr_~ch~0#1 := (if strrchr_~c#1 % 256 <= 127 then strrchr_~c#1 % 256 else strrchr_~c#1 % 256 - 256); 763#L510-1 call strrchr_#t~mem2#1 := read~int#0(strrchr_~t#1.base, strrchr_~t#1.offset, 1); 756#L511 assume strrchr_#t~mem2#1 == strrchr_~ch~0#1;havoc strrchr_#t~mem2#1;strrchr_~l~0#1.base, strrchr_~l~0#1.offset := strrchr_~t#1.base, strrchr_~t#1.offset; 757#L511-2 call strrchr_#t~mem3#1 := read~int#0(strrchr_~t#1.base, strrchr_~t#1.offset, 1); 780#L511-3 assume !(0 == strrchr_#t~mem3#1);havoc strrchr_#t~mem3#1;strrchr_#t~pre4#1.base, strrchr_#t~pre4#1.offset := strrchr_~t#1.base, 1 + strrchr_~t#1.offset;strrchr_~t#1.base, strrchr_~t#1.offset := strrchr_~t#1.base, 1 + strrchr_~t#1.offset;havoc strrchr_#t~pre4#1.base, strrchr_#t~pre4#1.offset; 781#L510-1 call strrchr_#t~mem2#1 := read~int#0(strrchr_~t#1.base, strrchr_~t#1.offset, 1); 818#L511 assume strrchr_#t~mem2#1 == strrchr_~ch~0#1;havoc strrchr_#t~mem2#1;strrchr_~l~0#1.base, strrchr_~l~0#1.offset := strrchr_~t#1.base, strrchr_~t#1.offset; 814#L511-2 call strrchr_#t~mem3#1 := read~int#0(strrchr_~t#1.base, strrchr_~t#1.offset, 1); 813#L511-3 assume !(0 == strrchr_#t~mem3#1);havoc strrchr_#t~mem3#1;strrchr_#t~pre4#1.base, strrchr_#t~pre4#1.offset := strrchr_~t#1.base, 1 + strrchr_~t#1.offset;strrchr_~t#1.base, strrchr_~t#1.offset := strrchr_~t#1.base, 1 + strrchr_~t#1.offset;havoc strrchr_#t~pre4#1.base, strrchr_#t~pre4#1.offset; 811#L510-1 call strrchr_#t~mem2#1 := read~int#0(strrchr_~t#1.base, strrchr_~t#1.offset, 1); 809#L511 assume strrchr_#t~mem2#1 == strrchr_~ch~0#1;havoc strrchr_#t~mem2#1;strrchr_~l~0#1.base, strrchr_~l~0#1.offset := strrchr_~t#1.base, strrchr_~t#1.offset; 802#L511-2 
[2024-11-19 14:17:59,275 INFO  L747   eck$LassoCheckResult]: Loop: 802#L511-2 call strrchr_#t~mem3#1 := read~int#0(strrchr_~t#1.base, strrchr_~t#1.offset, 1); 804#L511-3 assume !(0 == strrchr_#t~mem3#1);havoc strrchr_#t~mem3#1;strrchr_#t~pre4#1.base, strrchr_#t~pre4#1.offset := strrchr_~t#1.base, 1 + strrchr_~t#1.offset;strrchr_~t#1.base, strrchr_~t#1.offset := strrchr_~t#1.base, 1 + strrchr_~t#1.offset;havoc strrchr_#t~pre4#1.base, strrchr_#t~pre4#1.offset; 799#L510-1 call strrchr_#t~mem2#1 := read~int#0(strrchr_~t#1.base, strrchr_~t#1.offset, 1); 800#L511 assume strrchr_#t~mem2#1 == strrchr_~ch~0#1;havoc strrchr_#t~mem2#1;strrchr_~l~0#1.base, strrchr_~l~0#1.offset := strrchr_~t#1.base, strrchr_~t#1.offset; 802#L511-2 
[2024-11-19 14:17:59,275 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2024-11-19 14:17:59,275 INFO  L85        PathProgramCache]: Analyzing trace with hash -1275711976, now seen corresponding path program 1 times
[2024-11-19 14:17:59,276 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-19 14:17:59,276 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [778922155]
[2024-11-19 14:17:59,276 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-19 14:17:59,276 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-19 14:17:59,291 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is sat
[2024-11-19 14:17:59,292 INFO  L356             TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders.
[2024-11-19 14:17:59,306 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is sat
[2024-11-19 14:17:59,311 INFO  L130   FreeRefinementEngine]: Strategy CAMEL found a feasible trace
[2024-11-19 14:17:59,312 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2024-11-19 14:17:59,312 INFO  L85        PathProgramCache]: Analyzing trace with hash 1543785, now seen corresponding path program 1 times
[2024-11-19 14:17:59,312 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-19 14:17:59,312 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [748675983]
[2024-11-19 14:17:59,312 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-19 14:17:59,312 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-19 14:17:59,318 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is sat
[2024-11-19 14:17:59,318 INFO  L356             TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders.
[2024-11-19 14:17:59,320 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is sat
[2024-11-19 14:17:59,324 INFO  L130   FreeRefinementEngine]: Strategy CAMEL found a feasible trace
[2024-11-19 14:17:59,325 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2024-11-19 14:17:59,326 INFO  L85        PathProgramCache]: Analyzing trace with hash 1384831232, now seen corresponding path program 2 times
[2024-11-19 14:17:59,326 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-19 14:17:59,326 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [238394537]
[2024-11-19 14:17:59,326 INFO  L93    rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1
[2024-11-19 14:17:59,326 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-19 14:17:59,349 INFO  L227   tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s)
[2024-11-19 14:17:59,349 INFO  L228   tOrderPrioritization]: Conjunction of SSA is sat
[2024-11-19 14:17:59,350 INFO  L356             TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders.
[2024-11-19 14:17:59,362 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is sat
[2024-11-19 14:17:59,367 INFO  L130   FreeRefinementEngine]: Strategy CAMEL found a feasible trace
[2024-11-19 14:17:59,796 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-11-19 14:17:59,958 INFO  L204          LassoAnalysis]: Preferences:
[2024-11-19 14:17:59,958 INFO  L125   ssoRankerPreferences]: Compute integeral hull: false
[2024-11-19 14:17:59,958 INFO  L126   ssoRankerPreferences]: Enable LassoPartitioneer: true
[2024-11-19 14:17:59,958 INFO  L127   ssoRankerPreferences]: Term annotations enabled: false
[2024-11-19 14:17:59,958 INFO  L128   ssoRankerPreferences]: Use exernal solver: false
[2024-11-19 14:17:59,958 INFO  L129   ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000
[2024-11-19 14:17:59,958 INFO  L130   ssoRankerPreferences]: Dump SMT script to file: false
[2024-11-19 14:17:59,958 INFO  L131   ssoRankerPreferences]: Path of dumped script: 
[2024-11-19 14:17:59,958 INFO  L132   ssoRankerPreferences]: Filename of dumped script: basename-3.i_Iteration7_Lasso
[2024-11-19 14:17:59,958 INFO  L133   ssoRankerPreferences]: MapElimAlgo: Frank
[2024-11-19 14:17:59,958 INFO  L241          LassoAnalysis]: Starting lasso preprocessing...
[2024-11-19 14:17:59,960 INFO  L118          MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true
[2024-11-19 14:17:59,967 INFO  L118          MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true
[2024-11-19 14:17:59,969 INFO  L118          MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true
[2024-11-19 14:17:59,970 INFO  L118          MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true
[2024-11-19 14:17:59,972 INFO  L118          MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true
[2024-11-19 14:17:59,974 INFO  L118          MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true
[2024-11-19 14:17:59,977 INFO  L118          MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true
[2024-11-19 14:17:59,979 INFO  L118          MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true
[2024-11-19 14:17:59,980 INFO  L118          MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true
[2024-11-19 14:18:00,177 INFO  L118          MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true
[2024-11-19 14:18:00,179 INFO  L118          MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true
[2024-11-19 14:18:00,181 INFO  L118          MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true
[2024-11-19 14:18:00,183 INFO  L118          MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true
[2024-11-19 14:18:00,185 INFO  L118          MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true
[2024-11-19 14:18:00,186 INFO  L118          MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true
[2024-11-19 14:18:00,189 INFO  L118          MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true
[2024-11-19 14:18:00,191 INFO  L118          MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true
[2024-11-19 14:18:00,193 INFO  L118          MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true
[2024-11-19 14:18:00,196 INFO  L118          MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true
[2024-11-19 14:18:00,197 INFO  L118          MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true
[2024-11-19 14:18:00,199 INFO  L118          MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true
[2024-11-19 14:18:00,201 INFO  L118          MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true
[2024-11-19 14:18:00,203 INFO  L118          MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true
[2024-11-19 14:18:00,450 INFO  L259          LassoAnalysis]: Preprocessing complete.
[2024-11-19 14:18:00,450 INFO  L451          LassoAnalysis]: Using template 'affine'.
[2024-11-19 14:18:00,450 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000
[2024-11-19 14:18:00,450 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3
[2024-11-19 14:18:00,452 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-11-19 14:18:00,454 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-11-19 14:18:00,454 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-11-19 14:18:00,464 INFO  L338   nArgumentSynthesizer]: Template has degree 0.
[2024-11-19 14:18:00,464 INFO  L351   nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation.
[2024-11-19 14:18:00,464 INFO  L203   nArgumentSynthesizer]: 1 stem disjuncts
[2024-11-19 14:18:00,464 INFO  L204   nArgumentSynthesizer]: 1 loop disjuncts
[2024-11-19 14:18:00,464 INFO  L205   nArgumentSynthesizer]: 2 template conjuncts.
[2024-11-19 14:18:00,465 INFO  L401   nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications.
[2024-11-19 14:18:00,465 INFO  L402   nArgumentSynthesizer]: A total of 0 supporting invariants were added.
[2024-11-19 14:18:00,468 INFO  L488          LassoAnalysis]: Proving termination failed for this template and these settings.
[2024-11-19 14:18:00,482 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-11-19 14:18:00,482 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000
[2024-11-19 14:18:00,483 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3
[2024-11-19 14:18:00,484 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-11-19 14:18:00,485 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-11-19 14:18:00,487 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-11-19 14:18:00,499 INFO  L338   nArgumentSynthesizer]: Template has degree 0.
[2024-11-19 14:18:00,499 INFO  L351   nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation.
[2024-11-19 14:18:00,499 INFO  L203   nArgumentSynthesizer]: 1 stem disjuncts
[2024-11-19 14:18:00,499 INFO  L204   nArgumentSynthesizer]: 1 loop disjuncts
[2024-11-19 14:18:00,500 INFO  L205   nArgumentSynthesizer]: 2 template conjuncts.
[2024-11-19 14:18:00,500 INFO  L401   nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications.
[2024-11-19 14:18:00,500 INFO  L402   nArgumentSynthesizer]: A total of 0 supporting invariants were added.
[2024-11-19 14:18:00,502 INFO  L488          LassoAnalysis]: Proving termination failed for this template and these settings.
[2024-11-19 14:18:00,516 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-11-19 14:18:00,516 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000
[2024-11-19 14:18:00,517 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3
[2024-11-19 14:18:00,518 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-11-19 14:18:00,520 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-11-19 14:18:00,520 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-11-19 14:18:00,533 INFO  L338   nArgumentSynthesizer]: Template has degree 0.
[2024-11-19 14:18:00,533 INFO  L351   nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation.
[2024-11-19 14:18:00,533 INFO  L203   nArgumentSynthesizer]: 1 stem disjuncts
[2024-11-19 14:18:00,533 INFO  L204   nArgumentSynthesizer]: 1 loop disjuncts
[2024-11-19 14:18:00,533 INFO  L205   nArgumentSynthesizer]: 2 template conjuncts.
[2024-11-19 14:18:00,534 INFO  L401   nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications.
[2024-11-19 14:18:00,534 INFO  L402   nArgumentSynthesizer]: A total of 0 supporting invariants were added.
[2024-11-19 14:18:00,535 INFO  L488          LassoAnalysis]: Proving termination failed for this template and these settings.
[2024-11-19 14:18:00,546 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-11-19 14:18:00,546 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000
[2024-11-19 14:18:00,546 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3
[2024-11-19 14:18:00,547 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-11-19 14:18:00,549 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-11-19 14:18:00,549 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-11-19 14:18:00,560 INFO  L338   nArgumentSynthesizer]: Template has degree 0.
[2024-11-19 14:18:00,560 INFO  L351   nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation.
[2024-11-19 14:18:00,560 INFO  L203   nArgumentSynthesizer]: 1 stem disjuncts
[2024-11-19 14:18:00,560 INFO  L204   nArgumentSynthesizer]: 1 loop disjuncts
[2024-11-19 14:18:00,560 INFO  L205   nArgumentSynthesizer]: 2 template conjuncts.
[2024-11-19 14:18:00,560 INFO  L401   nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications.
[2024-11-19 14:18:00,560 INFO  L402   nArgumentSynthesizer]: A total of 0 supporting invariants were added.
[2024-11-19 14:18:00,564 INFO  L488          LassoAnalysis]: Proving termination failed for this template and these settings.
[2024-11-19 14:18:00,576 INFO  L540       MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (34)] Forceful destruction successful, exit code 0
[2024-11-19 14:18:00,576 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000
[2024-11-19 14:18:00,576 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3
[2024-11-19 14:18:00,577 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-11-19 14:18:00,579 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-11-19 14:18:00,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-11-19 14:18:00,589 INFO  L338   nArgumentSynthesizer]: Template has degree 0.
[2024-11-19 14:18:00,589 INFO  L351   nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation.
[2024-11-19 14:18:00,589 INFO  L203   nArgumentSynthesizer]: 1 stem disjuncts
[2024-11-19 14:18:00,589 INFO  L204   nArgumentSynthesizer]: 1 loop disjuncts
[2024-11-19 14:18:00,589 INFO  L205   nArgumentSynthesizer]: 2 template conjuncts.
[2024-11-19 14:18:00,589 INFO  L401   nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications.
[2024-11-19 14:18:00,589 INFO  L402   nArgumentSynthesizer]: A total of 0 supporting invariants were added.
[2024-11-19 14:18:00,591 INFO  L488          LassoAnalysis]: Proving termination failed for this template and these settings.
[2024-11-19 14:18:00,604 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-11-19 14:18:00,604 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000
[2024-11-19 14:18:00,604 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3
[2024-11-19 14:18:00,605 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-11-19 14:18:00,606 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-11-19 14:18:00,606 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-11-19 14:18:00,616 INFO  L338   nArgumentSynthesizer]: Template has degree 0.
[2024-11-19 14:18:00,616 INFO  L351   nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation.
[2024-11-19 14:18:00,616 INFO  L203   nArgumentSynthesizer]: 1 stem disjuncts
[2024-11-19 14:18:00,616 INFO  L204   nArgumentSynthesizer]: 1 loop disjuncts
[2024-11-19 14:18:00,616 INFO  L205   nArgumentSynthesizer]: 2 template conjuncts.
[2024-11-19 14:18:00,616 INFO  L401   nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications.
[2024-11-19 14:18:00,617 INFO  L402   nArgumentSynthesizer]: A total of 0 supporting invariants were added.
[2024-11-19 14:18:00,618 INFO  L488          LassoAnalysis]: Proving termination failed for this template and these settings.
[2024-11-19 14:18:00,628 INFO  L540       MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (36)] Forceful destruction successful, exit code 0
[2024-11-19 14:18:00,628 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000
[2024-11-19 14:18:00,629 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3
[2024-11-19 14:18:00,630 INFO  L229       MonitoredProcess]: Starting monitored process 37 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-11-19 14:18:00,630 INFO  L327       MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (37)] Waiting until timeout for monitored process
[2024-11-19 14:18:00,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-11-19 14:18:00,640 INFO  L338   nArgumentSynthesizer]: Template has degree 0.
[2024-11-19 14:18:00,641 INFO  L351   nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation.
[2024-11-19 14:18:00,641 INFO  L203   nArgumentSynthesizer]: 1 stem disjuncts
[2024-11-19 14:18:00,641 INFO  L204   nArgumentSynthesizer]: 1 loop disjuncts
[2024-11-19 14:18:00,641 INFO  L205   nArgumentSynthesizer]: 2 template conjuncts.
[2024-11-19 14:18:00,641 INFO  L401   nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications.
[2024-11-19 14:18:00,641 INFO  L402   nArgumentSynthesizer]: A total of 0 supporting invariants were added.
[2024-11-19 14:18:00,642 INFO  L488          LassoAnalysis]: Proving termination failed for this template and these settings.
[2024-11-19 14:18:00,652 INFO  L540       MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (37)] Forceful destruction successful, exit code 0
[2024-11-19 14:18:00,653 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000
[2024-11-19 14:18:00,653 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3
[2024-11-19 14:18:00,654 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-11-19 14:18:00,654 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-11-19 14:18:00,655 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-11-19 14:18:00,664 INFO  L338   nArgumentSynthesizer]: Template has degree 0.
[2024-11-19 14:18:00,665 INFO  L351   nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation.
[2024-11-19 14:18:00,665 INFO  L203   nArgumentSynthesizer]: 1 stem disjuncts
[2024-11-19 14:18:00,665 INFO  L204   nArgumentSynthesizer]: 1 loop disjuncts
[2024-11-19 14:18:00,665 INFO  L205   nArgumentSynthesizer]: 2 template conjuncts.
[2024-11-19 14:18:00,665 INFO  L401   nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications.
[2024-11-19 14:18:00,665 INFO  L402   nArgumentSynthesizer]: A total of 0 supporting invariants were added.
[2024-11-19 14:18:00,666 INFO  L488          LassoAnalysis]: Proving termination failed for this template and these settings.
[2024-11-19 14:18:00,676 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-11-19 14:18:00,676 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000
[2024-11-19 14:18:00,676 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3
[2024-11-19 14:18:00,677 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-11-19 14:18:00,678 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-11-19 14:18:00,679 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-11-19 14:18:00,688 INFO  L338   nArgumentSynthesizer]: Template has degree 0.
[2024-11-19 14:18:00,688 INFO  L203   nArgumentSynthesizer]: 1 stem disjuncts
[2024-11-19 14:18:00,688 INFO  L204   nArgumentSynthesizer]: 1 loop disjuncts
[2024-11-19 14:18:00,688 INFO  L205   nArgumentSynthesizer]: 2 template conjuncts.
[2024-11-19 14:18:00,690 INFO  L401   nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications.
[2024-11-19 14:18:00,690 INFO  L402   nArgumentSynthesizer]: A total of 2 supporting invariants were added.
[2024-11-19 14:18:00,693 INFO  L488          LassoAnalysis]: Proving termination failed for this template and these settings.
[2024-11-19 14:18:00,703 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-11-19 14:18:00,703 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000
[2024-11-19 14:18:00,704 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3
[2024-11-19 14:18:00,704 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-11-19 14:18:00,706 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-11-19 14:18:00,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-11-19 14:18:00,716 INFO  L338   nArgumentSynthesizer]: Template has degree 0.
[2024-11-19 14:18:00,716 INFO  L203   nArgumentSynthesizer]: 1 stem disjuncts
[2024-11-19 14:18:00,717 INFO  L204   nArgumentSynthesizer]: 1 loop disjuncts
[2024-11-19 14:18:00,717 INFO  L205   nArgumentSynthesizer]: 2 template conjuncts.
[2024-11-19 14:18:00,718 INFO  L401   nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications.
[2024-11-19 14:18:00,718 INFO  L402   nArgumentSynthesizer]: A total of 2 supporting invariants were added.
[2024-11-19 14:18:00,721 INFO  L488          LassoAnalysis]: Proving termination failed for this template and these settings.
[2024-11-19 14:18:00,731 INFO  L552       MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (40)] Ended with exit code 0
[2024-11-19 14:18:00,731 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000
[2024-11-19 14:18:00,731 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3
[2024-11-19 14:18:00,732 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-11-19 14:18:00,734 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-11-19 14:18:00,734 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-11-19 14:18:00,744 INFO  L338   nArgumentSynthesizer]: Template has degree 0.
[2024-11-19 14:18:00,744 INFO  L203   nArgumentSynthesizer]: 1 stem disjuncts
[2024-11-19 14:18:00,744 INFO  L204   nArgumentSynthesizer]: 1 loop disjuncts
[2024-11-19 14:18:00,744 INFO  L205   nArgumentSynthesizer]: 2 template conjuncts.
[2024-11-19 14:18:00,746 INFO  L401   nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications.
[2024-11-19 14:18:00,746 INFO  L402   nArgumentSynthesizer]: A total of 2 supporting invariants were added.
[2024-11-19 14:18:00,749 INFO  L488          LassoAnalysis]: Proving termination failed for this template and these settings.
[2024-11-19 14:18:00,763 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-11-19 14:18:00,764 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000
[2024-11-19 14:18:00,764 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3
[2024-11-19 14:18:00,765 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-11-19 14:18:00,767 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-11-19 14:18:00,768 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-11-19 14:18:00,779 INFO  L338   nArgumentSynthesizer]: Template has degree 0.
[2024-11-19 14:18:00,779 INFO  L203   nArgumentSynthesizer]: 1 stem disjuncts
[2024-11-19 14:18:00,779 INFO  L204   nArgumentSynthesizer]: 1 loop disjuncts
[2024-11-19 14:18:00,779 INFO  L205   nArgumentSynthesizer]: 2 template conjuncts.
[2024-11-19 14:18:00,782 INFO  L401   nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications.
[2024-11-19 14:18:00,782 INFO  L402   nArgumentSynthesizer]: A total of 2 supporting invariants were added.
[2024-11-19 14:18:00,787 INFO  L488          LassoAnalysis]: Proving termination failed for this template and these settings.
[2024-11-19 14:18:00,798 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-11-19 14:18:00,798 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000
[2024-11-19 14:18:00,798 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3
[2024-11-19 14:18:00,799 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-11-19 14:18:00,800 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-11-19 14:18:00,801 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-11-19 14:18:00,810 INFO  L338   nArgumentSynthesizer]: Template has degree 0.
[2024-11-19 14:18:00,810 INFO  L203   nArgumentSynthesizer]: 1 stem disjuncts
[2024-11-19 14:18:00,810 INFO  L204   nArgumentSynthesizer]: 2 loop disjuncts
[2024-11-19 14:18:00,810 INFO  L205   nArgumentSynthesizer]: 2 template conjuncts.
[2024-11-19 14:18:00,815 INFO  L401   nArgumentSynthesizer]: We have 16 Motzkin's Theorem applications.
[2024-11-19 14:18:00,815 INFO  L402   nArgumentSynthesizer]: A total of 4 supporting invariants were added.
[2024-11-19 14:18:00,826 INFO  L488          LassoAnalysis]: Proving termination failed for this template and these settings.
[2024-11-19 14:18:00,841 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-11-19 14:18:00,841 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000
[2024-11-19 14:18:00,841 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3
[2024-11-19 14:18:00,843 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-11-19 14:18:00,846 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-11-19 14:18:00,847 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-11-19 14:18:00,857 INFO  L338   nArgumentSynthesizer]: Template has degree 0.
[2024-11-19 14:18:00,857 INFO  L203   nArgumentSynthesizer]: 1 stem disjuncts
[2024-11-19 14:18:00,857 INFO  L204   nArgumentSynthesizer]: 1 loop disjuncts
[2024-11-19 14:18:00,857 INFO  L205   nArgumentSynthesizer]: 2 template conjuncts.
[2024-11-19 14:18:00,859 INFO  L401   nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications.
[2024-11-19 14:18:00,859 INFO  L402   nArgumentSynthesizer]: A total of 2 supporting invariants were added.
[2024-11-19 14:18:00,861 INFO  L488          LassoAnalysis]: Proving termination failed for this template and these settings.
[2024-11-19 14:18:00,871 INFO  L540       MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (44)] Forceful destruction successful, exit code 0
[2024-11-19 14:18:00,871 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000
[2024-11-19 14:18:00,871 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3
[2024-11-19 14:18:00,872 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-11-19 14:18:00,873 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-11-19 14:18:00,873 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-11-19 14:18:00,886 INFO  L338   nArgumentSynthesizer]: Template has degree 0.
[2024-11-19 14:18:00,886 INFO  L203   nArgumentSynthesizer]: 1 stem disjuncts
[2024-11-19 14:18:00,886 INFO  L204   nArgumentSynthesizer]: 1 loop disjuncts
[2024-11-19 14:18:00,886 INFO  L205   nArgumentSynthesizer]: 2 template conjuncts.
[2024-11-19 14:18:00,890 INFO  L401   nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications.
[2024-11-19 14:18:00,890 INFO  L402   nArgumentSynthesizer]: A total of 2 supporting invariants were added.
[2024-11-19 14:18:00,914 INFO  L420   nArgumentSynthesizer]: Found a termination argument, trying to simplify.
[2024-11-19 14:18:00,923 INFO  L443   ModelExtractionUtils]: Simplification made 6 calls to the SMT solver.
[2024-11-19 14:18:00,923 INFO  L444   ModelExtractionUtils]: 6 out of 16 variables were initially zero. Simplification set additionally 7 variables to zero.
[2024-11-19 14:18:00,923 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000
[2024-11-19 14:18:00,923 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3
[2024-11-19 14:18:00,924 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-11-19 14:18:00,925 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-11-19 14:18:00,925 INFO  L435   nArgumentSynthesizer]: Simplifying supporting invariants...
[2024-11-19 14:18:00,936 INFO  L438   nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2.
[2024-11-19 14:18:00,936 INFO  L474          LassoAnalysis]: Proved termination.
[2024-11-19 14:18:00,936 INFO  L476          LassoAnalysis]: Termination argument consisting of:
Ranking function f(ULTIMATE.start_strrchr_~t#1.offset, v_rep(select #length ULTIMATE.start_main_#t~malloc8#1.base)_3) = -1*ULTIMATE.start_strrchr_~t#1.offset + 1*v_rep(select #length ULTIMATE.start_main_#t~malloc8#1.base)_3
Supporting invariants []
[2024-11-19 14:18:00,947 INFO  L540       MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (45)] Forceful destruction successful, exit code 0
[2024-11-19 14:18:00,954 INFO  L156   tatePredicateManager]: 4 out of 5 supporting invariants were superfluous and have been removed
[2024-11-19 14:18:00,955 WARN  L976   BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #length
[2024-11-19 14:18:00,955 WARN  L976   BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#length,GLOBAL]
[2024-11-19 14:18:00,956 WARN  L976   BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~t!offset
[2024-11-19 14:18:00,970 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2024-11-19 14:18:00,991 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-19 14:18:00,991 INFO  L255         TraceCheckSpWp]: Trace formula consists of 115 conjuncts, 16 conjuncts are in the unsatisfiable core
[2024-11-19 14:18:00,992 INFO  L278         TraceCheckSpWp]: Computing forward predicates...
[2024-11-19 14:18:01,049 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-19 14:18:01,050 INFO  L255         TraceCheckSpWp]: Trace formula consists of 27 conjuncts, 8 conjuncts are in the unsatisfiable core
[2024-11-19 14:18:01,050 INFO  L278         TraceCheckSpWp]: Computing forward predicates...
[2024-11-19 14:18:01,101 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-11-19 14:18:01,102 INFO  L141   lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.3 stem predicates 3 loop predicates 
[2024-11-19 14:18:01,102 INFO  L71    iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 85 states and 103 transitions. cyclomatic complexity: 24 Second operand  has 6 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 6 states have internal predecessors, (13), 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-11-19 14:18:01,172 INFO  L75    iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 85 states and 103 transitions. cyclomatic complexity: 24. Second operand  has 6 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 6 states have internal predecessors, (13), 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 130 states and 164 transitions. Complement of second has 7 states.
[2024-11-19 14:18:01,173 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-11-19 14:18:01,173 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 6 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 6 states have internal predecessors, (13), 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-11-19 14:18:01,174 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 16 transitions.
[2024-11-19 14:18:01,174 INFO  L84            BuchiAccepts]: Start buchiAccepts Operand 5 states and 16 transitions. Stem has 14 letters. Loop has 4 letters.
[2024-11-19 14:18:01,174 INFO  L116           BuchiAccepts]: Finished buchiAccepts.
[2024-11-19 14:18:01,174 INFO  L84            BuchiAccepts]: Start buchiAccepts Operand 5 states and 16 transitions. Stem has 18 letters. Loop has 4 letters.
[2024-11-19 14:18:01,174 INFO  L116           BuchiAccepts]: Finished buchiAccepts.
[2024-11-19 14:18:01,174 INFO  L84            BuchiAccepts]: Start buchiAccepts Operand 5 states and 16 transitions. Stem has 14 letters. Loop has 8 letters.
[2024-11-19 14:18:01,174 INFO  L116           BuchiAccepts]: Finished buchiAccepts.
[2024-11-19 14:18:01,174 INFO  L82        GeneralOperation]: Start removeNonLiveStates. Operand 130 states and 164 transitions.
[2024-11-19 14:18:01,175 INFO  L131   ngComponentsAnalysis]: Automaton has 1 accepting balls. 17
[2024-11-19 14:18:01,179 INFO  L88        GeneralOperation]: Finished removeNonLiveStates. Reduced from 130 states to 104 states and 125 transitions.
[2024-11-19 14:18:01,179 INFO  L87         BuchiClosureNwa]: Accepting states before buchiClosure: 33
[2024-11-19 14:18:01,179 INFO  L106        BuchiClosureNwa]: Accepting states after buchiClosure: 36
[2024-11-19 14:18:01,179 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 104 states and 125 transitions.
[2024-11-19 14:18:01,180 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is not deterministic.
[2024-11-19 14:18:01,180 INFO  L218   hiAutomatonCegarLoop]: Abstraction has 104 states and 125 transitions.
[2024-11-19 14:18:01,180 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 104 states and 125 transitions.
[2024-11-19 14:18:01,185 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 73.
[2024-11-19 14:18:01,185 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 73 states, 73 states have (on average 1.1917808219178083) internal successors, (87), 72 states have internal predecessors, (87), 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-11-19 14:18:01,186 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 87 transitions.
[2024-11-19 14:18:01,186 INFO  L240   hiAutomatonCegarLoop]: Abstraction has 73 states and 87 transitions.
[2024-11-19 14:18:01,186 INFO  L425   stractBuchiCegarLoop]: Abstraction has 73 states and 87 transitions.
[2024-11-19 14:18:01,186 INFO  L332   stractBuchiCegarLoop]: ======== Iteration 8 ============
[2024-11-19 14:18:01,186 INFO  L72            BuchiIsEmpty]: Start buchiIsEmpty. Operand 73 states and 87 transitions.
[2024-11-19 14:18:01,187 INFO  L131   ngComponentsAnalysis]: Automaton has 1 accepting balls. 17
[2024-11-19 14:18:01,187 INFO  L87            BuchiIsEmpty]: Finished buchiIsEmpty Result is false
[2024-11-19 14:18:01,187 INFO  L119           BuchiIsEmpty]: Starting construction of run
[2024-11-19 14:18:01,187 INFO  L148   hiAutomatonCegarLoop]: Counterexample stem histogram [3, 3, 2, 2, 1, 1, 1, 1, 1, 1]
[2024-11-19 14:18:01,188 INFO  L149   hiAutomatonCegarLoop]: Counterexample loop histogram [3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1]
[2024-11-19 14:18:01,188 INFO  L745   eck$LassoCheckResult]: Stem: 1088#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 1089#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet7#1, main_#t~malloc8#1.base, main_#t~malloc8#1.offset, main_#t~ret9#1.base, main_#t~ret9#1.offset, main_~in_len~0#1, main_~in~0#1.base, main_~in~0#1.offset;havoc main_#t~nondet7#1;main_~in_len~0#1 := main_#t~nondet7#1;havoc main_#t~nondet7#1; 1090#L531 assume !(main_~in_len~0#1 < 1);call main_#t~malloc8#1.base, main_#t~malloc8#1.offset := #Ultimate.allocOnStack(main_~in_len~0#1 % 18446744073709551616);main_~in~0#1.base, main_~in~0#1.offset := main_#t~malloc8#1.base, main_#t~malloc8#1.offset;call write~int#0(0, main_~in~0#1.base, main_~in~0#1.offset + (main_~in_len~0#1 - 1), 1);assume { :begin_inline_basename } true;basename_#in~path#1.base, basename_#in~path#1.offset := main_~in~0#1.base, main_~in~0#1.offset;havoc basename_#res#1.base, basename_#res#1.offset;havoc basename_#t~ret5#1.base, basename_#t~ret5#1.offset, basename_#t~mem6#1, basename_~path#1.base, basename_~path#1.offset, basename_~c~0#1.base, basename_~c~0#1.offset;basename_~path#1.base, basename_~path#1.offset := basename_#in~path#1.base, basename_#in~path#1.offset;havoc basename_~c~0#1.base, basename_~c~0#1.offset; 1091#L517 assume { :begin_inline_strrchr } true;strrchr_#in~t#1.base, strrchr_#in~t#1.offset, strrchr_#in~c#1 := basename_~path#1.base, basename_~path#1.offset, 47;havoc strrchr_#res#1.base, strrchr_#res#1.offset;havoc strrchr_#t~mem2#1, strrchr_#t~mem3#1, strrchr_#t~pre4#1.base, strrchr_#t~pre4#1.offset, strrchr_~t#1.base, strrchr_~t#1.offset, strrchr_~c#1, strrchr_~ch~0#1, strrchr_~l~0#1.base, strrchr_~l~0#1.offset;strrchr_~t#1.base, strrchr_~t#1.offset := strrchr_#in~t#1.base, strrchr_#in~t#1.offset;strrchr_~c#1 := strrchr_#in~c#1;havoc strrchr_~ch~0#1;strrchr_~l~0#1.base, strrchr_~l~0#1.offset := 0, 0;strrchr_~ch~0#1 := (if strrchr_~c#1 % 256 <= 127 then strrchr_~c#1 % 256 else strrchr_~c#1 % 256 - 256); 1124#L510-1 call strrchr_#t~mem2#1 := read~int#0(strrchr_~t#1.base, strrchr_~t#1.offset, 1); 1077#L511 assume !(strrchr_#t~mem2#1 == strrchr_~ch~0#1);havoc strrchr_#t~mem2#1; 1079#L511-2 call strrchr_#t~mem3#1 := read~int#0(strrchr_~t#1.base, strrchr_~t#1.offset, 1); 1082#L511-3 assume !(0 == strrchr_#t~mem3#1);havoc strrchr_#t~mem3#1;strrchr_#t~pre4#1.base, strrchr_#t~pre4#1.offset := strrchr_~t#1.base, 1 + strrchr_~t#1.offset;strrchr_~t#1.base, strrchr_~t#1.offset := strrchr_~t#1.base, 1 + strrchr_~t#1.offset;havoc strrchr_#t~pre4#1.base, strrchr_#t~pre4#1.offset; 1086#L510-1 call strrchr_#t~mem2#1 := read~int#0(strrchr_~t#1.base, strrchr_~t#1.offset, 1); 1087#L511 assume strrchr_#t~mem2#1 == strrchr_~ch~0#1;havoc strrchr_#t~mem2#1;strrchr_~l~0#1.base, strrchr_~l~0#1.offset := strrchr_~t#1.base, strrchr_~t#1.offset; 1081#L511-2 call strrchr_#t~mem3#1 := read~int#0(strrchr_~t#1.base, strrchr_~t#1.offset, 1); 1141#L511-3 assume !(0 == strrchr_#t~mem3#1);havoc strrchr_#t~mem3#1;strrchr_#t~pre4#1.base, strrchr_#t~pre4#1.offset := strrchr_~t#1.base, 1 + strrchr_~t#1.offset;strrchr_~t#1.base, strrchr_~t#1.offset := strrchr_~t#1.base, 1 + strrchr_~t#1.offset;havoc strrchr_#t~pre4#1.base, strrchr_#t~pre4#1.offset; 1129#L510-1 call strrchr_#t~mem2#1 := read~int#0(strrchr_~t#1.base, strrchr_~t#1.offset, 1); 1114#L511 assume !(strrchr_#t~mem2#1 == strrchr_~ch~0#1);havoc strrchr_#t~mem2#1; 1115#L511-2 call strrchr_#t~mem3#1 := read~int#0(strrchr_~t#1.base, strrchr_~t#1.offset, 1); 1105#L511-3 assume 0 == strrchr_#t~mem3#1;havoc strrchr_#t~mem3#1;strrchr_#res#1.base, strrchr_#res#1.offset := strrchr_~l~0#1.base, strrchr_~l~0#1.offset; 1103#strrchr_returnLabel#1 
[2024-11-19 14:18:01,188 INFO  L747   eck$LassoCheckResult]: Loop: 1103#strrchr_returnLabel#1 basename_#t~ret5#1.base, basename_#t~ret5#1.offset := strrchr_#res#1.base, strrchr_#res#1.offset;havoc strrchr_#t~mem2#1, strrchr_#t~mem3#1, strrchr_#t~pre4#1.base, strrchr_#t~pre4#1.offset, strrchr_~t#1.base, strrchr_~t#1.offset, strrchr_~c#1, strrchr_~ch~0#1, strrchr_~l~0#1.base, strrchr_~l~0#1.offset;havoc strrchr_#in~t#1.base, strrchr_#in~t#1.offset, strrchr_#in~c#1;assume { :end_inline_strrchr } true;basename_~c~0#1.base, basename_~c~0#1.offset := basename_#t~ret5#1.base, basename_#t~ret5#1.offset; 1092#L518 assume !(basename_~c~0#1.base == 0 && basename_~c~0#1.offset == 0);havoc basename_#t~ret5#1.base, basename_#t~ret5#1.offset;call basename_#t~mem6#1 := read~int#0(basename_~c~0#1.base, 1 + basename_~c~0#1.offset, 1); 1093#L519 assume 0 == basename_#t~mem6#1;havoc basename_#t~mem6#1; 1096#L520 assume !(basename_~c~0#1.base == basename_~path#1.base && basename_~c~0#1.offset == basename_~path#1.offset);call write~int#0(0, basename_~c~0#1.base, basename_~c~0#1.offset, 1); 1097#L517 assume { :begin_inline_strrchr } true;strrchr_#in~t#1.base, strrchr_#in~t#1.offset, strrchr_#in~c#1 := basename_~path#1.base, basename_~path#1.offset, 47;havoc strrchr_#res#1.base, strrchr_#res#1.offset;havoc strrchr_#t~mem2#1, strrchr_#t~mem3#1, strrchr_#t~pre4#1.base, strrchr_#t~pre4#1.offset, strrchr_~t#1.base, strrchr_~t#1.offset, strrchr_~c#1, strrchr_~ch~0#1, strrchr_~l~0#1.base, strrchr_~l~0#1.offset;strrchr_~t#1.base, strrchr_~t#1.offset := strrchr_#in~t#1.base, strrchr_#in~t#1.offset;strrchr_~c#1 := strrchr_#in~c#1;havoc strrchr_~ch~0#1;strrchr_~l~0#1.base, strrchr_~l~0#1.offset := 0, 0;strrchr_~ch~0#1 := (if strrchr_~c#1 % 256 <= 127 then strrchr_~c#1 % 256 else strrchr_~c#1 % 256 - 256); 1084#L510-1 call strrchr_#t~mem2#1 := read~int#0(strrchr_~t#1.base, strrchr_~t#1.offset, 1); 1085#L511 assume strrchr_#t~mem2#1 == strrchr_~ch~0#1;havoc strrchr_#t~mem2#1;strrchr_~l~0#1.base, strrchr_~l~0#1.offset := strrchr_~t#1.base, strrchr_~t#1.offset; 1119#L511-2 call strrchr_#t~mem3#1 := read~int#0(strrchr_~t#1.base, strrchr_~t#1.offset, 1); 1128#L511-3 assume !(0 == strrchr_#t~mem3#1);havoc strrchr_#t~mem3#1;strrchr_#t~pre4#1.base, strrchr_#t~pre4#1.offset := strrchr_~t#1.base, 1 + strrchr_~t#1.offset;strrchr_~t#1.base, strrchr_~t#1.offset := strrchr_~t#1.base, 1 + strrchr_~t#1.offset;havoc strrchr_#t~pre4#1.base, strrchr_#t~pre4#1.offset; 1127#L510-1 call strrchr_#t~mem2#1 := read~int#0(strrchr_~t#1.base, strrchr_~t#1.offset, 1); 1125#L511 assume strrchr_#t~mem2#1 == strrchr_~ch~0#1;havoc strrchr_#t~mem2#1;strrchr_~l~0#1.base, strrchr_~l~0#1.offset := strrchr_~t#1.base, strrchr_~t#1.offset; 1121#L511-2 call strrchr_#t~mem3#1 := read~int#0(strrchr_~t#1.base, strrchr_~t#1.offset, 1); 1123#L511-3 assume !(0 == strrchr_#t~mem3#1);havoc strrchr_#t~mem3#1;strrchr_#t~pre4#1.base, strrchr_#t~pre4#1.offset := strrchr_~t#1.base, 1 + strrchr_~t#1.offset;strrchr_~t#1.base, strrchr_~t#1.offset := strrchr_~t#1.base, 1 + strrchr_~t#1.offset;havoc strrchr_#t~pre4#1.base, strrchr_#t~pre4#1.offset; 1122#L510-1 call strrchr_#t~mem2#1 := read~int#0(strrchr_~t#1.base, strrchr_~t#1.offset, 1); 1120#L511 assume !(strrchr_#t~mem2#1 == strrchr_~ch~0#1);havoc strrchr_#t~mem2#1; 1107#L511-2 call strrchr_#t~mem3#1 := read~int#0(strrchr_~t#1.base, strrchr_~t#1.offset, 1); 1108#L511-3 assume 0 == strrchr_#t~mem3#1;havoc strrchr_#t~mem3#1;strrchr_#res#1.base, strrchr_#res#1.offset := strrchr_~l~0#1.base, strrchr_~l~0#1.offset; 1103#strrchr_returnLabel#1 
[2024-11-19 14:18:01,190 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2024-11-19 14:18:01,190 INFO  L85        PathProgramCache]: Analyzing trace with hash -1192462433, now seen corresponding path program 1 times
[2024-11-19 14:18:01,190 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-19 14:18:01,190 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1622135127]
[2024-11-19 14:18:01,190 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-19 14:18:01,190 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-19 14:18:01,208 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is sat
[2024-11-19 14:18:01,208 INFO  L356             TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders.
[2024-11-19 14:18:01,214 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is sat
[2024-11-19 14:18:01,217 INFO  L130   FreeRefinementEngine]: Strategy CAMEL found a feasible trace
[2024-11-19 14:18:01,217 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2024-11-19 14:18:01,218 INFO  L85        PathProgramCache]: Analyzing trace with hash -1276134570, now seen corresponding path program 2 times
[2024-11-19 14:18:01,218 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-19 14:18:01,218 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1329536325]
[2024-11-19 14:18:01,218 INFO  L93    rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1
[2024-11-19 14:18:01,218 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-19 14:18:01,227 INFO  L227   tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s)
[2024-11-19 14:18:01,230 INFO  L228   tOrderPrioritization]: Conjunction of SSA is sat
[2024-11-19 14:18:01,230 INFO  L356             TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders.
[2024-11-19 14:18:01,238 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is sat
[2024-11-19 14:18:01,240 INFO  L130   FreeRefinementEngine]: Strategy CAMEL found a feasible trace
[2024-11-19 14:18:01,242 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2024-11-19 14:18:01,242 INFO  L85        PathProgramCache]: Analyzing trace with hash -1834372232, now seen corresponding path program 2 times
[2024-11-19 14:18:01,242 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-19 14:18:01,242 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [861481120]
[2024-11-19 14:18:01,243 INFO  L93    rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1
[2024-11-19 14:18:01,243 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-19 14:18:01,266 INFO  L227   tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s)
[2024-11-19 14:18:01,266 INFO  L228   tOrderPrioritization]: Conjunction of SSA is unsat
[2024-11-19 14:18:01,599 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-11-19 14:18:01,949 INFO  L134       CoverageAnalysis]: Checked inductivity of 61 backedges. 1 proven. 60 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-11-19 14:18:01,949 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-11-19 14:18:01,949 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [861481120]
[2024-11-19 14:18:01,949 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [861481120] provided 0 perfect and 1 imperfect interpolant sequences
[2024-11-19 14:18:01,949 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [172642482]
[2024-11-19 14:18:01,949 INFO  L93    rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1
[2024-11-19 14:18:01,949 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2024-11-19 14:18:01,949 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3
[2024-11-19 14:18:01,951 INFO  L229       MonitoredProcess]: Starting monitored process 47 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2024-11-19 14:18:01,953 INFO  L327       MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (47)] Waiting until timeout for monitored process
[2024-11-19 14:18:02,040 INFO  L227   tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s)
[2024-11-19 14:18:02,041 INFO  L228   tOrderPrioritization]: Conjunction of SSA is unsat
[2024-11-19 14:18:02,048 INFO  L255         TraceCheckSpWp]: Trace formula consists of 226 conjuncts, 72 conjuncts are in the unsatisfiable core
[2024-11-19 14:18:02,051 INFO  L278         TraceCheckSpWp]: Computing forward predicates...
[2024-11-19 14:18:02,175 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-11-19 14:18:02,303 INFO  L134       CoverageAnalysis]: Checked inductivity of 61 backedges. 27 proven. 30 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked.
[2024-11-19 14:18:02,303 INFO  L311         TraceCheckSpWp]: Computing backward predicates...
[2024-11-19 14:18:02,590 INFO  L349             Elim1Store]: treesize reduction 10, result has 47.4 percent of original size
[2024-11-19 14:18:02,590 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 145 treesize of output 125
[2024-11-19 14:18:02,995 INFO  L134       CoverageAnalysis]: Checked inductivity of 61 backedges. 4 proven. 55 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked.
[2024-11-19 14:18:02,995 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleZ3 [172642482] provided 0 perfect and 2 imperfect interpolant sequences
[2024-11-19 14:18:02,995 INFO  L185   FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences.
[2024-11-19 14:18:02,996 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 16, 18] total 40
[2024-11-19 14:18:02,996 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1579486499]
[2024-11-19 14:18:02,996 INFO  L85    oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton
[2024-11-19 14:18:03,365 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-11-19 14:18:03,366 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants.
[2024-11-19 14:18:03,366 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=146, Invalid=1414, Unknown=0, NotChecked=0, Total=1560
[2024-11-19 14:18:03,367 INFO  L87              Difference]: Start difference. First operand 73 states and 87 transitions. cyclomatic complexity: 19 Second operand  has 40 states, 40 states have (on average 1.925) internal successors, (77), 40 states have internal predecessors, (77), 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-11-19 14:18:04,556 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2024-11-19 14:18:04,557 INFO  L93              Difference]: Finished difference Result 170 states and 200 transitions.
[2024-11-19 14:18:04,557 INFO  L82        GeneralOperation]: Start removeNonLiveStates. Operand 170 states and 200 transitions.
[2024-11-19 14:18:04,558 INFO  L131   ngComponentsAnalysis]: Automaton has 3 accepting balls. 86
[2024-11-19 14:18:04,559 INFO  L88        GeneralOperation]: Finished removeNonLiveStates. Reduced from 170 states to 164 states and 194 transitions.
[2024-11-19 14:18:04,559 INFO  L87         BuchiClosureNwa]: Accepting states before buchiClosure: 110
[2024-11-19 14:18:04,560 INFO  L106        BuchiClosureNwa]: Accepting states after buchiClosure: 118
[2024-11-19 14:18:04,560 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 164 states and 194 transitions.
[2024-11-19 14:18:04,560 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is not deterministic.
[2024-11-19 14:18:04,563 INFO  L218   hiAutomatonCegarLoop]: Abstraction has 164 states and 194 transitions.
[2024-11-19 14:18:04,564 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 164 states and 194 transitions.
[2024-11-19 14:18:04,573 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 164 to 98.
[2024-11-19 14:18:04,575 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 98 states, 98 states have (on average 1.2346938775510203) internal successors, (121), 97 states have internal predecessors, (121), 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-11-19 14:18:04,578 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 121 transitions.
[2024-11-19 14:18:04,578 INFO  L240   hiAutomatonCegarLoop]: Abstraction has 98 states and 121 transitions.
[2024-11-19 14:18:04,578 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. 
[2024-11-19 14:18:04,579 INFO  L425   stractBuchiCegarLoop]: Abstraction has 98 states and 121 transitions.
[2024-11-19 14:18:04,581 INFO  L332   stractBuchiCegarLoop]: ======== Iteration 9 ============
[2024-11-19 14:18:04,582 INFO  L72            BuchiIsEmpty]: Start buchiIsEmpty. Operand 98 states and 121 transitions.
[2024-11-19 14:18:04,582 INFO  L131   ngComponentsAnalysis]: Automaton has 3 accepting balls. 56
[2024-11-19 14:18:04,582 INFO  L87            BuchiIsEmpty]: Finished buchiIsEmpty Result is false
[2024-11-19 14:18:04,582 INFO  L119           BuchiIsEmpty]: Starting construction of run
[2024-11-19 14:18:04,583 INFO  L148   hiAutomatonCegarLoop]: Counterexample stem histogram [3, 3, 2, 2, 1, 1, 1, 1, 1, 1]
[2024-11-19 14:18:04,583 INFO  L149   hiAutomatonCegarLoop]: Counterexample loop histogram [5, 5, 4, 3, 2, 1, 1, 1, 1, 1, 1]
[2024-11-19 14:18:04,583 INFO  L745   eck$LassoCheckResult]: Stem: 1611#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 1612#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet7#1, main_#t~malloc8#1.base, main_#t~malloc8#1.offset, main_#t~ret9#1.base, main_#t~ret9#1.offset, main_~in_len~0#1, main_~in~0#1.base, main_~in~0#1.offset;havoc main_#t~nondet7#1;main_~in_len~0#1 := main_#t~nondet7#1;havoc main_#t~nondet7#1; 1613#L531 assume !(main_~in_len~0#1 < 1);call main_#t~malloc8#1.base, main_#t~malloc8#1.offset := #Ultimate.allocOnStack(main_~in_len~0#1 % 18446744073709551616);main_~in~0#1.base, main_~in~0#1.offset := main_#t~malloc8#1.base, main_#t~malloc8#1.offset;call write~int#0(0, main_~in~0#1.base, main_~in~0#1.offset + (main_~in_len~0#1 - 1), 1);assume { :begin_inline_basename } true;basename_#in~path#1.base, basename_#in~path#1.offset := main_~in~0#1.base, main_~in~0#1.offset;havoc basename_#res#1.base, basename_#res#1.offset;havoc basename_#t~ret5#1.base, basename_#t~ret5#1.offset, basename_#t~mem6#1, basename_~path#1.base, basename_~path#1.offset, basename_~c~0#1.base, basename_~c~0#1.offset;basename_~path#1.base, basename_~path#1.offset := basename_#in~path#1.base, basename_#in~path#1.offset;havoc basename_~c~0#1.base, basename_~c~0#1.offset; 1614#L517 assume { :begin_inline_strrchr } true;strrchr_#in~t#1.base, strrchr_#in~t#1.offset, strrchr_#in~c#1 := basename_~path#1.base, basename_~path#1.offset, 47;havoc strrchr_#res#1.base, strrchr_#res#1.offset;havoc strrchr_#t~mem2#1, strrchr_#t~mem3#1, strrchr_#t~pre4#1.base, strrchr_#t~pre4#1.offset, strrchr_~t#1.base, strrchr_~t#1.offset, strrchr_~c#1, strrchr_~ch~0#1, strrchr_~l~0#1.base, strrchr_~l~0#1.offset;strrchr_~t#1.base, strrchr_~t#1.offset := strrchr_#in~t#1.base, strrchr_#in~t#1.offset;strrchr_~c#1 := strrchr_#in~c#1;havoc strrchr_~ch~0#1;strrchr_~l~0#1.base, strrchr_~l~0#1.offset := 0, 0;strrchr_~ch~0#1 := (if strrchr_~c#1 % 256 <= 127 then strrchr_~c#1 % 256 else strrchr_~c#1 % 256 - 256); 1654#L510-1 call strrchr_#t~mem2#1 := read~int#0(strrchr_~t#1.base, strrchr_~t#1.offset, 1); 1653#L511 assume strrchr_#t~mem2#1 == strrchr_~ch~0#1;havoc strrchr_#t~mem2#1;strrchr_~l~0#1.base, strrchr_~l~0#1.offset := strrchr_~t#1.base, strrchr_~t#1.offset; 1652#L511-2 call strrchr_#t~mem3#1 := read~int#0(strrchr_~t#1.base, strrchr_~t#1.offset, 1); 1651#L511-3 assume !(0 == strrchr_#t~mem3#1);havoc strrchr_#t~mem3#1;strrchr_#t~pre4#1.base, strrchr_#t~pre4#1.offset := strrchr_~t#1.base, 1 + strrchr_~t#1.offset;strrchr_~t#1.base, strrchr_~t#1.offset := strrchr_~t#1.base, 1 + strrchr_~t#1.offset;havoc strrchr_#t~pre4#1.base, strrchr_#t~pre4#1.offset; 1650#L510-1 call strrchr_#t~mem2#1 := read~int#0(strrchr_~t#1.base, strrchr_~t#1.offset, 1); 1649#L511 assume strrchr_#t~mem2#1 == strrchr_~ch~0#1;havoc strrchr_#t~mem2#1;strrchr_~l~0#1.base, strrchr_~l~0#1.offset := strrchr_~t#1.base, strrchr_~t#1.offset; 1646#L511-2 call strrchr_#t~mem3#1 := read~int#0(strrchr_~t#1.base, strrchr_~t#1.offset, 1); 1648#L511-3 assume !(0 == strrchr_#t~mem3#1);havoc strrchr_#t~mem3#1;strrchr_#t~pre4#1.base, strrchr_#t~pre4#1.offset := strrchr_~t#1.base, 1 + strrchr_~t#1.offset;strrchr_~t#1.base, strrchr_~t#1.offset := strrchr_~t#1.base, 1 + strrchr_~t#1.offset;havoc strrchr_#t~pre4#1.base, strrchr_#t~pre4#1.offset; 1647#L510-1 call strrchr_#t~mem2#1 := read~int#0(strrchr_~t#1.base, strrchr_~t#1.offset, 1); 1631#L511 assume !(strrchr_#t~mem2#1 == strrchr_~ch~0#1);havoc strrchr_#t~mem2#1; 1638#L511-2 call strrchr_#t~mem3#1 := read~int#0(strrchr_~t#1.base, strrchr_~t#1.offset, 1); 1623#L511-3 assume 0 == strrchr_#t~mem3#1;havoc strrchr_#t~mem3#1;strrchr_#res#1.base, strrchr_#res#1.offset := strrchr_~l~0#1.base, strrchr_~l~0#1.offset; 1622#strrchr_returnLabel#1 
[2024-11-19 14:18:04,583 INFO  L747   eck$LassoCheckResult]: Loop: 1622#strrchr_returnLabel#1 basename_#t~ret5#1.base, basename_#t~ret5#1.offset := strrchr_#res#1.base, strrchr_#res#1.offset;havoc strrchr_#t~mem2#1, strrchr_#t~mem3#1, strrchr_#t~pre4#1.base, strrchr_#t~pre4#1.offset, strrchr_~t#1.base, strrchr_~t#1.offset, strrchr_~c#1, strrchr_~ch~0#1, strrchr_~l~0#1.base, strrchr_~l~0#1.offset;havoc strrchr_#in~t#1.base, strrchr_#in~t#1.offset, strrchr_#in~c#1;assume { :end_inline_strrchr } true;basename_~c~0#1.base, basename_~c~0#1.offset := basename_#t~ret5#1.base, basename_#t~ret5#1.offset; 1615#L518 assume !(basename_~c~0#1.base == 0 && basename_~c~0#1.offset == 0);havoc basename_#t~ret5#1.base, basename_#t~ret5#1.offset;call basename_#t~mem6#1 := read~int#0(basename_~c~0#1.base, 1 + basename_~c~0#1.offset, 1); 1616#L519 assume 0 == basename_#t~mem6#1;havoc basename_#t~mem6#1; 1617#L520 assume !(basename_~c~0#1.base == basename_~path#1.base && basename_~c~0#1.offset == basename_~path#1.offset);call write~int#0(0, basename_~c~0#1.base, basename_~c~0#1.offset, 1); 1618#L517 assume { :begin_inline_strrchr } true;strrchr_#in~t#1.base, strrchr_#in~t#1.offset, strrchr_#in~c#1 := basename_~path#1.base, basename_~path#1.offset, 47;havoc strrchr_#res#1.base, strrchr_#res#1.offset;havoc strrchr_#t~mem2#1, strrchr_#t~mem3#1, strrchr_#t~pre4#1.base, strrchr_#t~pre4#1.offset, strrchr_~t#1.base, strrchr_~t#1.offset, strrchr_~c#1, strrchr_~ch~0#1, strrchr_~l~0#1.base, strrchr_~l~0#1.offset;strrchr_~t#1.base, strrchr_~t#1.offset := strrchr_#in~t#1.base, strrchr_#in~t#1.offset;strrchr_~c#1 := strrchr_#in~c#1;havoc strrchr_~ch~0#1;strrchr_~l~0#1.base, strrchr_~l~0#1.offset := 0, 0;strrchr_~ch~0#1 := (if strrchr_~c#1 % 256 <= 127 then strrchr_~c#1 % 256 else strrchr_~c#1 % 256 - 256); 1621#L510-1 call strrchr_#t~mem2#1 := read~int#0(strrchr_~t#1.base, strrchr_~t#1.offset, 1); 1667#L511 assume strrchr_#t~mem2#1 == strrchr_~ch~0#1;havoc strrchr_#t~mem2#1;strrchr_~l~0#1.base, strrchr_~l~0#1.offset := strrchr_~t#1.base, strrchr_~t#1.offset; 1664#L511-2 call strrchr_#t~mem3#1 := read~int#0(strrchr_~t#1.base, strrchr_~t#1.offset, 1); 1619#L511-3 assume !(0 == strrchr_#t~mem3#1);havoc strrchr_#t~mem3#1;strrchr_#t~pre4#1.base, strrchr_#t~pre4#1.offset := strrchr_~t#1.base, 1 + strrchr_~t#1.offset;strrchr_~t#1.base, strrchr_~t#1.offset := strrchr_~t#1.base, 1 + strrchr_~t#1.offset;havoc strrchr_#t~pre4#1.base, strrchr_#t~pre4#1.offset; 1608#L510-1 call strrchr_#t~mem2#1 := read~int#0(strrchr_~t#1.base, strrchr_~t#1.offset, 1); 1609#L511 assume !(strrchr_#t~mem2#1 == strrchr_~ch~0#1);havoc strrchr_#t~mem2#1; 1668#L511-2 call strrchr_#t~mem3#1 := read~int#0(strrchr_~t#1.base, strrchr_~t#1.offset, 1); 1694#L511-3 assume !(0 == strrchr_#t~mem3#1);havoc strrchr_#t~mem3#1;strrchr_#t~pre4#1.base, strrchr_#t~pre4#1.offset := strrchr_~t#1.base, 1 + strrchr_~t#1.offset;strrchr_~t#1.base, strrchr_~t#1.offset := strrchr_~t#1.base, 1 + strrchr_~t#1.offset;havoc strrchr_#t~pre4#1.base, strrchr_#t~pre4#1.offset; 1669#L510-1 call strrchr_#t~mem2#1 := read~int#0(strrchr_~t#1.base, strrchr_~t#1.offset, 1); 1665#L511 assume !(strrchr_#t~mem2#1 == strrchr_~ch~0#1);havoc strrchr_#t~mem2#1; 1605#L511-2 call strrchr_#t~mem3#1 := read~int#0(strrchr_~t#1.base, strrchr_~t#1.offset, 1); 1606#L511-3 assume !(0 == strrchr_#t~mem3#1);havoc strrchr_#t~mem3#1;strrchr_#t~pre4#1.base, strrchr_#t~pre4#1.offset := strrchr_~t#1.base, 1 + strrchr_~t#1.offset;strrchr_~t#1.base, strrchr_~t#1.offset := strrchr_~t#1.base, 1 + strrchr_~t#1.offset;havoc strrchr_#t~pre4#1.base, strrchr_#t~pre4#1.offset; 1657#L510-1 call strrchr_#t~mem2#1 := read~int#0(strrchr_~t#1.base, strrchr_~t#1.offset, 1); 1658#L511 assume strrchr_#t~mem2#1 == strrchr_~ch~0#1;havoc strrchr_#t~mem2#1;strrchr_~l~0#1.base, strrchr_~l~0#1.offset := strrchr_~t#1.base, strrchr_~t#1.offset; 1627#L511-2 call strrchr_#t~mem3#1 := read~int#0(strrchr_~t#1.base, strrchr_~t#1.offset, 1); 1689#L511-3 assume !(0 == strrchr_#t~mem3#1);havoc strrchr_#t~mem3#1;strrchr_#t~pre4#1.base, strrchr_#t~pre4#1.offset := strrchr_~t#1.base, 1 + strrchr_~t#1.offset;strrchr_~t#1.base, strrchr_~t#1.offset := strrchr_~t#1.base, 1 + strrchr_~t#1.offset;havoc strrchr_#t~pre4#1.base, strrchr_#t~pre4#1.offset; 1632#L510-1 call strrchr_#t~mem2#1 := read~int#0(strrchr_~t#1.base, strrchr_~t#1.offset, 1); 1626#L511 assume !(strrchr_#t~mem2#1 == strrchr_~ch~0#1);havoc strrchr_#t~mem2#1; 1628#L511-2 call strrchr_#t~mem3#1 := read~int#0(strrchr_~t#1.base, strrchr_~t#1.offset, 1); 1690#L511-3 assume 0 == strrchr_#t~mem3#1;havoc strrchr_#t~mem3#1;strrchr_#res#1.base, strrchr_#res#1.offset := strrchr_~l~0#1.base, strrchr_~l~0#1.offset; 1622#strrchr_returnLabel#1 
[2024-11-19 14:18:04,584 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2024-11-19 14:18:04,587 INFO  L85        PathProgramCache]: Analyzing trace with hash -1893527011, now seen corresponding path program 2 times
[2024-11-19 14:18:04,588 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-19 14:18:04,588 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [539036038]
[2024-11-19 14:18:04,588 INFO  L93    rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1
[2024-11-19 14:18:04,588 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-19 14:18:04,602 INFO  L227   tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s)
[2024-11-19 14:18:04,603 INFO  L228   tOrderPrioritization]: Conjunction of SSA is sat
[2024-11-19 14:18:04,603 INFO  L356             TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders.
[2024-11-19 14:18:04,612 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is sat
[2024-11-19 14:18:04,616 INFO  L130   FreeRefinementEngine]: Strategy CAMEL found a feasible trace
[2024-11-19 14:18:04,620 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2024-11-19 14:18:04,621 INFO  L85        PathProgramCache]: Analyzing trace with hash -1248060886, now seen corresponding path program 3 times
[2024-11-19 14:18:04,621 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-19 14:18:04,621 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1994580771]
[2024-11-19 14:18:04,621 INFO  L93    rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2
[2024-11-19 14:18:04,621 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-19 14:18:04,636 INFO  L227   tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s)
[2024-11-19 14:18:04,640 INFO  L228   tOrderPrioritization]: Conjunction of SSA is sat
[2024-11-19 14:18:04,640 INFO  L356             TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders.
[2024-11-19 14:18:04,651 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is sat
[2024-11-19 14:18:04,655 INFO  L130   FreeRefinementEngine]: Strategy CAMEL found a feasible trace
[2024-11-19 14:18:04,655 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2024-11-19 14:18:04,655 INFO  L85        PathProgramCache]: Analyzing trace with hash -545890418, now seen corresponding path program 3 times
[2024-11-19 14:18:04,655 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-19 14:18:04,655 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [808334181]
[2024-11-19 14:18:04,656 INFO  L93    rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2
[2024-11-19 14:18:04,656 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-19 14:18:04,699 INFO  L227   tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s)
[2024-11-19 14:18:04,699 INFO  L228   tOrderPrioritization]: Conjunction of SSA is unsat
[2024-11-19 14:18:05,202 INFO  L134       CoverageAnalysis]: Checked inductivity of 113 backedges. 61 proven. 40 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked.
[2024-11-19 14:18:05,202 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-11-19 14:18:05,203 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [808334181]
[2024-11-19 14:18:05,203 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [808334181] provided 0 perfect and 1 imperfect interpolant sequences
[2024-11-19 14:18:05,203 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1953883754]
[2024-11-19 14:18:05,203 INFO  L93    rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2
[2024-11-19 14:18:05,203 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2024-11-19 14:18:05,204 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3
[2024-11-19 14:18:05,205 INFO  L229       MonitoredProcess]: Starting monitored process 48 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2024-11-19 14:18:05,207 INFO  L327       MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (48)] Waiting until timeout for monitored process
[2024-11-19 14:18:05,324 INFO  L227   tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s)
[2024-11-19 14:18:05,324 INFO  L228   tOrderPrioritization]: Conjunction of SSA is unsat
[2024-11-19 14:18:05,326 INFO  L255         TraceCheckSpWp]: Trace formula consists of 267 conjuncts, 63 conjuncts are in the unsatisfiable core
[2024-11-19 14:18:05,329 INFO  L278         TraceCheckSpWp]: Computing forward predicates...
[2024-11-19 14:18:05,425 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-11-19 14:18:05,488 INFO  L134       CoverageAnalysis]: Checked inductivity of 113 backedges. 61 proven. 38 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked.
[2024-11-19 14:18:05,488 INFO  L311         TraceCheckSpWp]: Computing backward predicates...
[2024-11-19 14:18:05,537 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 25
[2024-11-19 14:18:05,650 INFO  L134       CoverageAnalysis]: Checked inductivity of 113 backedges. 61 proven. 38 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked.
[2024-11-19 14:18:05,650 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleZ3 [1953883754] provided 0 perfect and 2 imperfect interpolant sequences
[2024-11-19 14:18:05,650 INFO  L185   FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences.
[2024-11-19 14:18:05,650 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 12, 11] total 22
[2024-11-19 14:18:05,651 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1367854057]
[2024-11-19 14:18:05,651 INFO  L85    oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton
[2024-11-19 14:18:06,136 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-11-19 14:18:06,137 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants.
[2024-11-19 14:18:06,137 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=403, Unknown=0, NotChecked=0, Total=462
[2024-11-19 14:18:06,137 INFO  L87              Difference]: Start difference. First operand 98 states and 121 transitions. cyclomatic complexity: 30 Second operand  has 22 states, 22 states have (on average 2.909090909090909) internal successors, (64), 22 states have internal predecessors, (64), 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-11-19 14:18:06,311 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2024-11-19 14:18:06,311 INFO  L93              Difference]: Finished difference Result 96 states and 114 transitions.
[2024-11-19 14:18:06,311 INFO  L82        GeneralOperation]: Start removeNonLiveStates. Operand 96 states and 114 transitions.
[2024-11-19 14:18:06,312 INFO  L131   ngComponentsAnalysis]: Automaton has 1 accepting balls. 29
[2024-11-19 14:18:06,313 INFO  L88        GeneralOperation]: Finished removeNonLiveStates. Reduced from 96 states to 68 states and 82 transitions.
[2024-11-19 14:18:06,313 INFO  L87         BuchiClosureNwa]: Accepting states before buchiClosure: 40
[2024-11-19 14:18:06,313 INFO  L106        BuchiClosureNwa]: Accepting states after buchiClosure: 40
[2024-11-19 14:18:06,313 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 68 states and 82 transitions.
[2024-11-19 14:18:06,313 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is not deterministic.
[2024-11-19 14:18:06,313 INFO  L218   hiAutomatonCegarLoop]: Abstraction has 68 states and 82 transitions.
[2024-11-19 14:18:06,314 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 68 states and 82 transitions.
[2024-11-19 14:18:06,315 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 42.
[2024-11-19 14:18:06,315 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 42 states, 42 states have (on average 1.2380952380952381) internal successors, (52), 41 states have internal predecessors, (52), 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-11-19 14:18:06,316 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 52 transitions.
[2024-11-19 14:18:06,316 INFO  L240   hiAutomatonCegarLoop]: Abstraction has 42 states and 52 transitions.
[2024-11-19 14:18:06,316 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. 
[2024-11-19 14:18:06,316 INFO  L425   stractBuchiCegarLoop]: Abstraction has 42 states and 52 transitions.
[2024-11-19 14:18:06,316 INFO  L332   stractBuchiCegarLoop]: ======== Iteration 10 ============
[2024-11-19 14:18:06,316 INFO  L72            BuchiIsEmpty]: Start buchiIsEmpty. Operand 42 states and 52 transitions.
[2024-11-19 14:18:06,317 INFO  L131   ngComponentsAnalysis]: Automaton has 1 accepting balls. 21
[2024-11-19 14:18:06,317 INFO  L87            BuchiIsEmpty]: Finished buchiIsEmpty Result is false
[2024-11-19 14:18:06,317 INFO  L119           BuchiIsEmpty]: Starting construction of run
[2024-11-19 14:18:06,317 INFO  L148   hiAutomatonCegarLoop]: Counterexample stem histogram [4, 4, 3, 3, 1, 1, 1, 1, 1, 1]
[2024-11-19 14:18:06,317 INFO  L149   hiAutomatonCegarLoop]: Counterexample loop histogram [4, 4, 3, 3, 1, 1, 1, 1, 1, 1, 1]
[2024-11-19 14:18:06,318 INFO  L745   eck$LassoCheckResult]: Stem: 2079#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 2080#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet7#1, main_#t~malloc8#1.base, main_#t~malloc8#1.offset, main_#t~ret9#1.base, main_#t~ret9#1.offset, main_~in_len~0#1, main_~in~0#1.base, main_~in~0#1.offset;havoc main_#t~nondet7#1;main_~in_len~0#1 := main_#t~nondet7#1;havoc main_#t~nondet7#1; 2081#L531 assume !(main_~in_len~0#1 < 1);call main_#t~malloc8#1.base, main_#t~malloc8#1.offset := #Ultimate.allocOnStack(main_~in_len~0#1 % 18446744073709551616);main_~in~0#1.base, main_~in~0#1.offset := main_#t~malloc8#1.base, main_#t~malloc8#1.offset;call write~int#0(0, main_~in~0#1.base, main_~in~0#1.offset + (main_~in_len~0#1 - 1), 1);assume { :begin_inline_basename } true;basename_#in~path#1.base, basename_#in~path#1.offset := main_~in~0#1.base, main_~in~0#1.offset;havoc basename_#res#1.base, basename_#res#1.offset;havoc basename_#t~ret5#1.base, basename_#t~ret5#1.offset, basename_#t~mem6#1, basename_~path#1.base, basename_~path#1.offset, basename_~c~0#1.base, basename_~c~0#1.offset;basename_~path#1.base, basename_~path#1.offset := basename_#in~path#1.base, basename_#in~path#1.offset;havoc basename_~c~0#1.base, basename_~c~0#1.offset; 2082#L517 assume { :begin_inline_strrchr } true;strrchr_#in~t#1.base, strrchr_#in~t#1.offset, strrchr_#in~c#1 := basename_~path#1.base, basename_~path#1.offset, 47;havoc strrchr_#res#1.base, strrchr_#res#1.offset;havoc strrchr_#t~mem2#1, strrchr_#t~mem3#1, strrchr_#t~pre4#1.base, strrchr_#t~pre4#1.offset, strrchr_~t#1.base, strrchr_~t#1.offset, strrchr_~c#1, strrchr_~ch~0#1, strrchr_~l~0#1.base, strrchr_~l~0#1.offset;strrchr_~t#1.base, strrchr_~t#1.offset := strrchr_#in~t#1.base, strrchr_#in~t#1.offset;strrchr_~c#1 := strrchr_#in~c#1;havoc strrchr_~ch~0#1;strrchr_~l~0#1.base, strrchr_~l~0#1.offset := 0, 0;strrchr_~ch~0#1 := (if strrchr_~c#1 % 256 <= 127 then strrchr_~c#1 % 256 else strrchr_~c#1 % 256 - 256); 2076#L510-1 call strrchr_#t~mem2#1 := read~int#0(strrchr_~t#1.base, strrchr_~t#1.offset, 1); 2077#L511 assume !(strrchr_#t~mem2#1 == strrchr_~ch~0#1);havoc strrchr_#t~mem2#1; 2111#L511-2 call strrchr_#t~mem3#1 := read~int#0(strrchr_~t#1.base, strrchr_~t#1.offset, 1); 2110#L511-3 assume !(0 == strrchr_#t~mem3#1);havoc strrchr_#t~mem3#1;strrchr_#t~pre4#1.base, strrchr_#t~pre4#1.offset := strrchr_~t#1.base, 1 + strrchr_~t#1.offset;strrchr_~t#1.base, strrchr_~t#1.offset := strrchr_~t#1.base, 1 + strrchr_~t#1.offset;havoc strrchr_#t~pre4#1.base, strrchr_#t~pre4#1.offset; 2078#L510-1 call strrchr_#t~mem2#1 := read~int#0(strrchr_~t#1.base, strrchr_~t#1.offset, 1); 2072#L511 assume !(strrchr_#t~mem2#1 == strrchr_~ch~0#1);havoc strrchr_#t~mem2#1; 2073#L511-2 call strrchr_#t~mem3#1 := read~int#0(strrchr_~t#1.base, strrchr_~t#1.offset, 1); 2075#L511-3 assume !(0 == strrchr_#t~mem3#1);havoc strrchr_#t~mem3#1;strrchr_#t~pre4#1.base, strrchr_#t~pre4#1.offset := strrchr_~t#1.base, 1 + strrchr_~t#1.offset;strrchr_~t#1.base, strrchr_~t#1.offset := strrchr_~t#1.base, 1 + strrchr_~t#1.offset;havoc strrchr_#t~pre4#1.base, strrchr_#t~pre4#1.offset; 2089#L510-1 call strrchr_#t~mem2#1 := read~int#0(strrchr_~t#1.base, strrchr_~t#1.offset, 1); 2105#L511 assume strrchr_#t~mem2#1 == strrchr_~ch~0#1;havoc strrchr_#t~mem2#1;strrchr_~l~0#1.base, strrchr_~l~0#1.offset := strrchr_~t#1.base, strrchr_~t#1.offset; 2103#L511-2 call strrchr_#t~mem3#1 := read~int#0(strrchr_~t#1.base, strrchr_~t#1.offset, 1); 2101#L511-3 assume !(0 == strrchr_#t~mem3#1);havoc strrchr_#t~mem3#1;strrchr_#t~pre4#1.base, strrchr_#t~pre4#1.offset := strrchr_~t#1.base, 1 + strrchr_~t#1.offset;strrchr_~t#1.base, strrchr_~t#1.offset := strrchr_~t#1.base, 1 + strrchr_~t#1.offset;havoc strrchr_#t~pre4#1.base, strrchr_#t~pre4#1.offset; 2097#L510-1 call strrchr_#t~mem2#1 := read~int#0(strrchr_~t#1.base, strrchr_~t#1.offset, 1); 2098#L511 assume !(strrchr_#t~mem2#1 == strrchr_~ch~0#1);havoc strrchr_#t~mem2#1; 2102#L511-2 call strrchr_#t~mem3#1 := read~int#0(strrchr_~t#1.base, strrchr_~t#1.offset, 1); 2091#L511-3 assume 0 == strrchr_#t~mem3#1;havoc strrchr_#t~mem3#1;strrchr_#res#1.base, strrchr_#res#1.offset := strrchr_~l~0#1.base, strrchr_~l~0#1.offset; 2090#strrchr_returnLabel#1 
[2024-11-19 14:18:06,318 INFO  L747   eck$LassoCheckResult]: Loop: 2090#strrchr_returnLabel#1 basename_#t~ret5#1.base, basename_#t~ret5#1.offset := strrchr_#res#1.base, strrchr_#res#1.offset;havoc strrchr_#t~mem2#1, strrchr_#t~mem3#1, strrchr_#t~pre4#1.base, strrchr_#t~pre4#1.offset, strrchr_~t#1.base, strrchr_~t#1.offset, strrchr_~c#1, strrchr_~ch~0#1, strrchr_~l~0#1.base, strrchr_~l~0#1.offset;havoc strrchr_#in~t#1.base, strrchr_#in~t#1.offset, strrchr_#in~c#1;assume { :end_inline_strrchr } true;basename_~c~0#1.base, basename_~c~0#1.offset := basename_#t~ret5#1.base, basename_#t~ret5#1.offset; 2083#L518 assume !(basename_~c~0#1.base == 0 && basename_~c~0#1.offset == 0);havoc basename_#t~ret5#1.base, basename_#t~ret5#1.offset;call basename_#t~mem6#1 := read~int#0(basename_~c~0#1.base, 1 + basename_~c~0#1.offset, 1); 2084#L519 assume 0 == basename_#t~mem6#1;havoc basename_#t~mem6#1; 2085#L520 assume !(basename_~c~0#1.base == basename_~path#1.base && basename_~c~0#1.offset == basename_~path#1.offset);call write~int#0(0, basename_~c~0#1.base, basename_~c~0#1.offset, 1); 2086#L517 assume { :begin_inline_strrchr } true;strrchr_#in~t#1.base, strrchr_#in~t#1.offset, strrchr_#in~c#1 := basename_~path#1.base, basename_~path#1.offset, 47;havoc strrchr_#res#1.base, strrchr_#res#1.offset;havoc strrchr_#t~mem2#1, strrchr_#t~mem3#1, strrchr_#t~pre4#1.base, strrchr_#t~pre4#1.offset, strrchr_~t#1.base, strrchr_~t#1.offset, strrchr_~c#1, strrchr_~ch~0#1, strrchr_~l~0#1.base, strrchr_~l~0#1.offset;strrchr_~t#1.base, strrchr_~t#1.offset := strrchr_#in~t#1.base, strrchr_#in~t#1.offset;strrchr_~c#1 := strrchr_#in~c#1;havoc strrchr_~ch~0#1;strrchr_~l~0#1.base, strrchr_~l~0#1.offset := 0, 0;strrchr_~ch~0#1 := (if strrchr_~c#1 % 256 <= 127 then strrchr_~c#1 % 256 else strrchr_~c#1 % 256 - 256); 2109#L510-1 call strrchr_#t~mem2#1 := read~int#0(strrchr_~t#1.base, strrchr_~t#1.offset, 1); 2108#L511 assume strrchr_#t~mem2#1 == strrchr_~ch~0#1;havoc strrchr_#t~mem2#1;strrchr_~l~0#1.base, strrchr_~l~0#1.offset := strrchr_~t#1.base, strrchr_~t#1.offset; 2107#L511-2 call strrchr_#t~mem3#1 := read~int#0(strrchr_~t#1.base, strrchr_~t#1.offset, 1); 2087#L511-3 assume !(0 == strrchr_#t~mem3#1);havoc strrchr_#t~mem3#1;strrchr_#t~pre4#1.base, strrchr_#t~pre4#1.offset := strrchr_~t#1.base, 1 + strrchr_~t#1.offset;strrchr_~t#1.base, strrchr_~t#1.offset := strrchr_~t#1.base, 1 + strrchr_~t#1.offset;havoc strrchr_#t~pre4#1.base, strrchr_#t~pre4#1.offset; 2088#L510-1 call strrchr_#t~mem2#1 := read~int#0(strrchr_~t#1.base, strrchr_~t#1.offset, 1); 2070#L511 assume strrchr_#t~mem2#1 == strrchr_~ch~0#1;havoc strrchr_#t~mem2#1;strrchr_~l~0#1.base, strrchr_~l~0#1.offset := strrchr_~t#1.base, strrchr_~t#1.offset; 2071#L511-2 call strrchr_#t~mem3#1 := read~int#0(strrchr_~t#1.base, strrchr_~t#1.offset, 1); 2074#L511-3 assume !(0 == strrchr_#t~mem3#1);havoc strrchr_#t~mem3#1;strrchr_#t~pre4#1.base, strrchr_#t~pre4#1.offset := strrchr_~t#1.base, 1 + strrchr_~t#1.offset;strrchr_~t#1.base, strrchr_~t#1.offset := strrchr_~t#1.base, 1 + strrchr_~t#1.offset;havoc strrchr_#t~pre4#1.base, strrchr_#t~pre4#1.offset; 2106#L510-1 call strrchr_#t~mem2#1 := read~int#0(strrchr_~t#1.base, strrchr_~t#1.offset, 1); 2104#L511 assume strrchr_#t~mem2#1 == strrchr_~ch~0#1;havoc strrchr_#t~mem2#1;strrchr_~l~0#1.base, strrchr_~l~0#1.offset := strrchr_~t#1.base, strrchr_~t#1.offset; 2095#L511-2 call strrchr_#t~mem3#1 := read~int#0(strrchr_~t#1.base, strrchr_~t#1.offset, 1); 2100#L511-3 assume !(0 == strrchr_#t~mem3#1);havoc strrchr_#t~mem3#1;strrchr_#t~pre4#1.base, strrchr_#t~pre4#1.offset := strrchr_~t#1.base, 1 + strrchr_~t#1.offset;strrchr_~t#1.base, strrchr_~t#1.offset := strrchr_~t#1.base, 1 + strrchr_~t#1.offset;havoc strrchr_#t~pre4#1.base, strrchr_#t~pre4#1.offset; 2096#L510-1 call strrchr_#t~mem2#1 := read~int#0(strrchr_~t#1.base, strrchr_~t#1.offset, 1); 2094#L511 assume !(strrchr_#t~mem2#1 == strrchr_~ch~0#1);havoc strrchr_#t~mem2#1; 2092#L511-2 call strrchr_#t~mem3#1 := read~int#0(strrchr_~t#1.base, strrchr_~t#1.offset, 1); 2093#L511-3 assume 0 == strrchr_#t~mem3#1;havoc strrchr_#t~mem3#1;strrchr_#res#1.base, strrchr_#res#1.offset := strrchr_~l~0#1.base, strrchr_~l~0#1.offset; 2090#strrchr_returnLabel#1 
[2024-11-19 14:18:06,319 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2024-11-19 14:18:06,319 INFO  L85        PathProgramCache]: Analyzing trace with hash -1195844343, now seen corresponding path program 3 times
[2024-11-19 14:18:06,319 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-19 14:18:06,319 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1189601077]
[2024-11-19 14:18:06,319 INFO  L93    rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2
[2024-11-19 14:18:06,319 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-19 14:18:06,349 INFO  L227   tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s)
[2024-11-19 14:18:06,349 INFO  L228   tOrderPrioritization]: Conjunction of SSA is sat
[2024-11-19 14:18:06,349 INFO  L356             TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders.
[2024-11-19 14:18:06,359 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is sat
[2024-11-19 14:18:06,362 INFO  L130   FreeRefinementEngine]: Strategy CAMEL found a feasible trace
[2024-11-19 14:18:06,362 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2024-11-19 14:18:06,362 INFO  L85        PathProgramCache]: Analyzing trace with hash 179046334, now seen corresponding path program 4 times
[2024-11-19 14:18:06,363 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-19 14:18:06,363 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1269791085]
[2024-11-19 14:18:06,363 INFO  L93    rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST
[2024-11-19 14:18:06,363 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-19 14:18:06,374 INFO  L227   tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s)
[2024-11-19 14:18:06,374 INFO  L228   tOrderPrioritization]: Conjunction of SSA is sat
[2024-11-19 14:18:06,374 INFO  L356             TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders.
[2024-11-19 14:18:06,382 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is sat
[2024-11-19 14:18:06,388 INFO  L130   FreeRefinementEngine]: Strategy CAMEL found a feasible trace
[2024-11-19 14:18:06,389 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2024-11-19 14:18:06,389 INFO  L85        PathProgramCache]: Analyzing trace with hash 456990646, now seen corresponding path program 4 times
[2024-11-19 14:18:06,389 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-19 14:18:06,389 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1238588204]
[2024-11-19 14:18:06,389 INFO  L93    rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST
[2024-11-19 14:18:06,389 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-19 14:18:06,412 INFO  L227   tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s)
[2024-11-19 14:18:06,416 INFO  L228   tOrderPrioritization]: Conjunction of SSA is unsat
[2024-11-19 14:18:07,004 INFO  L134       CoverageAnalysis]: Checked inductivity of 113 backedges. 39 proven. 72 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked.
[2024-11-19 14:18:07,004 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-11-19 14:18:07,004 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1238588204]
[2024-11-19 14:18:07,004 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1238588204] provided 0 perfect and 1 imperfect interpolant sequences
[2024-11-19 14:18:07,004 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1206773016]
[2024-11-19 14:18:07,005 INFO  L93    rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST
[2024-11-19 14:18:07,005 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2024-11-19 14:18:07,005 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3
[2024-11-19 14:18:07,008 INFO  L229       MonitoredProcess]: Starting monitored process 49 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2024-11-19 14:18:07,010 INFO  L327       MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (49)] Waiting until timeout for monitored process
[2024-11-19 14:18:07,121 INFO  L227   tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s)
[2024-11-19 14:18:07,121 INFO  L228   tOrderPrioritization]: Conjunction of SSA is unsat
[2024-11-19 14:18:07,124 INFO  L255         TraceCheckSpWp]: Trace formula consists of 267 conjuncts, 79 conjuncts are in the unsatisfiable core
[2024-11-19 14:18:07,129 INFO  L278         TraceCheckSpWp]: Computing forward predicates...
[2024-11-19 14:18:07,257 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-11-19 14:18:07,386 INFO  L134       CoverageAnalysis]: Checked inductivity of 113 backedges. 39 proven. 70 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked.
[2024-11-19 14:18:07,386 INFO  L311         TraceCheckSpWp]: Computing backward predicates...
[2024-11-19 14:18:07,738 INFO  L349             Elim1Store]: treesize reduction 10, result has 47.4 percent of original size
[2024-11-19 14:18:07,738 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 145 treesize of output 125
[2024-11-19 14:18:08,095 INFO  L134       CoverageAnalysis]: Checked inductivity of 113 backedges. 8 proven. 103 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked.
[2024-11-19 14:18:08,095 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleZ3 [1206773016] provided 0 perfect and 2 imperfect interpolant sequences
[2024-11-19 14:18:08,095 INFO  L185   FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences.
[2024-11-19 14:18:08,095 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 17, 18] total 39
[2024-11-19 14:18:08,096 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1042018791]
[2024-11-19 14:18:08,096 INFO  L85    oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton
[2024-11-19 14:18:08,545 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-11-19 14:18:08,546 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants.
[2024-11-19 14:18:08,546 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=129, Invalid=1353, Unknown=0, NotChecked=0, Total=1482
[2024-11-19 14:18:08,546 INFO  L87              Difference]: Start difference. First operand 42 states and 52 transitions. cyclomatic complexity: 13 Second operand  has 39 states, 39 states have (on average 2.2564102564102564) internal successors, (88), 39 states have internal predecessors, (88), 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-11-19 14:18:09,957 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2024-11-19 14:18:09,957 INFO  L93              Difference]: Finished difference Result 171 states and 203 transitions.
[2024-11-19 14:18:09,957 INFO  L82        GeneralOperation]: Start removeNonLiveStates. Operand 171 states and 203 transitions.
[2024-11-19 14:18:09,959 INFO  L131   ngComponentsAnalysis]: Automaton has 2 accepting balls. 117
[2024-11-19 14:18:09,960 INFO  L88        GeneralOperation]: Finished removeNonLiveStates. Reduced from 171 states to 171 states and 203 transitions.
[2024-11-19 14:18:09,960 INFO  L87         BuchiClosureNwa]: Accepting states before buchiClosure: 135
[2024-11-19 14:18:09,960 INFO  L106        BuchiClosureNwa]: Accepting states after buchiClosure: 135
[2024-11-19 14:18:09,960 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 171 states and 203 transitions.
[2024-11-19 14:18:09,961 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is not deterministic.
[2024-11-19 14:18:09,961 INFO  L218   hiAutomatonCegarLoop]: Abstraction has 171 states and 203 transitions.
[2024-11-19 14:18:09,961 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 171 states and 203 transitions.
[2024-11-19 14:18:09,967 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 171 to 100.
[2024-11-19 14:18:09,967 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 100 states, 100 states have (on average 1.22) internal successors, (122), 99 states have internal predecessors, (122), 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-11-19 14:18:09,968 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 122 transitions.
[2024-11-19 14:18:09,968 INFO  L240   hiAutomatonCegarLoop]: Abstraction has 100 states and 122 transitions.
[2024-11-19 14:18:09,969 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. 
[2024-11-19 14:18:09,969 INFO  L425   stractBuchiCegarLoop]: Abstraction has 100 states and 122 transitions.
[2024-11-19 14:18:09,969 INFO  L332   stractBuchiCegarLoop]: ======== Iteration 11 ============
[2024-11-19 14:18:09,970 INFO  L72            BuchiIsEmpty]: Start buchiIsEmpty. Operand 100 states and 122 transitions.
[2024-11-19 14:18:09,970 INFO  L131   ngComponentsAnalysis]: Automaton has 2 accepting balls. 68
[2024-11-19 14:18:09,970 INFO  L87            BuchiIsEmpty]: Finished buchiIsEmpty Result is false
[2024-11-19 14:18:09,970 INFO  L119           BuchiIsEmpty]: Starting construction of run
[2024-11-19 14:18:09,971 INFO  L148   hiAutomatonCegarLoop]: Counterexample stem histogram [4, 4, 3, 3, 1, 1, 1, 1, 1, 1]
[2024-11-19 14:18:09,971 INFO  L149   hiAutomatonCegarLoop]: Counterexample loop histogram [5, 5, 4, 3, 2, 1, 1, 1, 1, 1, 1]
[2024-11-19 14:18:09,971 INFO  L745   eck$LassoCheckResult]: Stem: 2635#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 2636#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet7#1, main_#t~malloc8#1.base, main_#t~malloc8#1.offset, main_#t~ret9#1.base, main_#t~ret9#1.offset, main_~in_len~0#1, main_~in~0#1.base, main_~in~0#1.offset;havoc main_#t~nondet7#1;main_~in_len~0#1 := main_#t~nondet7#1;havoc main_#t~nondet7#1; 2637#L531 assume !(main_~in_len~0#1 < 1);call main_#t~malloc8#1.base, main_#t~malloc8#1.offset := #Ultimate.allocOnStack(main_~in_len~0#1 % 18446744073709551616);main_~in~0#1.base, main_~in~0#1.offset := main_#t~malloc8#1.base, main_#t~malloc8#1.offset;call write~int#0(0, main_~in~0#1.base, main_~in~0#1.offset + (main_~in_len~0#1 - 1), 1);assume { :begin_inline_basename } true;basename_#in~path#1.base, basename_#in~path#1.offset := main_~in~0#1.base, main_~in~0#1.offset;havoc basename_#res#1.base, basename_#res#1.offset;havoc basename_#t~ret5#1.base, basename_#t~ret5#1.offset, basename_#t~mem6#1, basename_~path#1.base, basename_~path#1.offset, basename_~c~0#1.base, basename_~c~0#1.offset;basename_~path#1.base, basename_~path#1.offset := basename_#in~path#1.base, basename_#in~path#1.offset;havoc basename_~c~0#1.base, basename_~c~0#1.offset; 2638#L517 assume { :begin_inline_strrchr } true;strrchr_#in~t#1.base, strrchr_#in~t#1.offset, strrchr_#in~c#1 := basename_~path#1.base, basename_~path#1.offset, 47;havoc strrchr_#res#1.base, strrchr_#res#1.offset;havoc strrchr_#t~mem2#1, strrchr_#t~mem3#1, strrchr_#t~pre4#1.base, strrchr_#t~pre4#1.offset, strrchr_~t#1.base, strrchr_~t#1.offset, strrchr_~c#1, strrchr_~ch~0#1, strrchr_~l~0#1.base, strrchr_~l~0#1.offset;strrchr_~t#1.base, strrchr_~t#1.offset := strrchr_#in~t#1.base, strrchr_#in~t#1.offset;strrchr_~c#1 := strrchr_#in~c#1;havoc strrchr_~ch~0#1;strrchr_~l~0#1.base, strrchr_~l~0#1.offset := 0, 0;strrchr_~ch~0#1 := (if strrchr_~c#1 % 256 <= 127 then strrchr_~c#1 % 256 else strrchr_~c#1 % 256 - 256); 2671#L510-1 call strrchr_#t~mem2#1 := read~int#0(strrchr_~t#1.base, strrchr_~t#1.offset, 1); 2670#L511 assume !(strrchr_#t~mem2#1 == strrchr_~ch~0#1);havoc strrchr_#t~mem2#1; 2669#L511-2 call strrchr_#t~mem3#1 := read~int#0(strrchr_~t#1.base, strrchr_~t#1.offset, 1); 2668#L511-3 assume !(0 == strrchr_#t~mem3#1);havoc strrchr_#t~mem3#1;strrchr_#t~pre4#1.base, strrchr_#t~pre4#1.offset := strrchr_~t#1.base, 1 + strrchr_~t#1.offset;strrchr_~t#1.base, strrchr_~t#1.offset := strrchr_~t#1.base, 1 + strrchr_~t#1.offset;havoc strrchr_#t~pre4#1.base, strrchr_#t~pre4#1.offset; 2665#L510-1 call strrchr_#t~mem2#1 := read~int#0(strrchr_~t#1.base, strrchr_~t#1.offset, 1); 2627#L511 assume !(strrchr_#t~mem2#1 == strrchr_~ch~0#1);havoc strrchr_#t~mem2#1; 2628#L511-2 call strrchr_#t~mem3#1 := read~int#0(strrchr_~t#1.base, strrchr_~t#1.offset, 1); 2711#L511-3 assume !(0 == strrchr_#t~mem3#1);havoc strrchr_#t~mem3#1;strrchr_#t~pre4#1.base, strrchr_#t~pre4#1.offset := strrchr_~t#1.base, 1 + strrchr_~t#1.offset;strrchr_~t#1.base, strrchr_~t#1.offset := strrchr_~t#1.base, 1 + strrchr_~t#1.offset;havoc strrchr_#t~pre4#1.base, strrchr_#t~pre4#1.offset; 2710#L510-1 call strrchr_#t~mem2#1 := read~int#0(strrchr_~t#1.base, strrchr_~t#1.offset, 1); 2659#L511 assume strrchr_#t~mem2#1 == strrchr_~ch~0#1;havoc strrchr_#t~mem2#1;strrchr_~l~0#1.base, strrchr_~l~0#1.offset := strrchr_~t#1.base, strrchr_~t#1.offset; 2658#L511-2 call strrchr_#t~mem3#1 := read~int#0(strrchr_~t#1.base, strrchr_~t#1.offset, 1); 2656#L511-3 assume !(0 == strrchr_#t~mem3#1);havoc strrchr_#t~mem3#1;strrchr_#t~pre4#1.base, strrchr_#t~pre4#1.offset := strrchr_~t#1.base, 1 + strrchr_~t#1.offset;strrchr_~t#1.base, strrchr_~t#1.offset := strrchr_~t#1.base, 1 + strrchr_~t#1.offset;havoc strrchr_#t~pre4#1.base, strrchr_#t~pre4#1.offset; 2657#L510-1 call strrchr_#t~mem2#1 := read~int#0(strrchr_~t#1.base, strrchr_~t#1.offset, 1); 2701#L511 assume !(strrchr_#t~mem2#1 == strrchr_~ch~0#1);havoc strrchr_#t~mem2#1; 2700#L511-2 call strrchr_#t~mem3#1 := read~int#0(strrchr_~t#1.base, strrchr_~t#1.offset, 1); 2647#L511-3 assume 0 == strrchr_#t~mem3#1;havoc strrchr_#t~mem3#1;strrchr_#res#1.base, strrchr_#res#1.offset := strrchr_~l~0#1.base, strrchr_~l~0#1.offset; 2646#strrchr_returnLabel#1 
[2024-11-19 14:18:09,972 INFO  L747   eck$LassoCheckResult]: Loop: 2646#strrchr_returnLabel#1 basename_#t~ret5#1.base, basename_#t~ret5#1.offset := strrchr_#res#1.base, strrchr_#res#1.offset;havoc strrchr_#t~mem2#1, strrchr_#t~mem3#1, strrchr_#t~pre4#1.base, strrchr_#t~pre4#1.offset, strrchr_~t#1.base, strrchr_~t#1.offset, strrchr_~c#1, strrchr_~ch~0#1, strrchr_~l~0#1.base, strrchr_~l~0#1.offset;havoc strrchr_#in~t#1.base, strrchr_#in~t#1.offset, strrchr_#in~c#1;assume { :end_inline_strrchr } true;basename_~c~0#1.base, basename_~c~0#1.offset := basename_#t~ret5#1.base, basename_#t~ret5#1.offset; 2639#L518 assume !(basename_~c~0#1.base == 0 && basename_~c~0#1.offset == 0);havoc basename_#t~ret5#1.base, basename_#t~ret5#1.offset;call basename_#t~mem6#1 := read~int#0(basename_~c~0#1.base, 1 + basename_~c~0#1.offset, 1); 2640#L519 assume 0 == basename_#t~mem6#1;havoc basename_#t~mem6#1; 2641#L520 assume !(basename_~c~0#1.base == basename_~path#1.base && basename_~c~0#1.offset == basename_~path#1.offset);call write~int#0(0, basename_~c~0#1.base, basename_~c~0#1.offset, 1); 2642#L517 assume { :begin_inline_strrchr } true;strrchr_#in~t#1.base, strrchr_#in~t#1.offset, strrchr_#in~c#1 := basename_~path#1.base, basename_~path#1.offset, 47;havoc strrchr_#res#1.base, strrchr_#res#1.offset;havoc strrchr_#t~mem2#1, strrchr_#t~mem3#1, strrchr_#t~pre4#1.base, strrchr_#t~pre4#1.offset, strrchr_~t#1.base, strrchr_~t#1.offset, strrchr_~c#1, strrchr_~ch~0#1, strrchr_~l~0#1.base, strrchr_~l~0#1.offset;strrchr_~t#1.base, strrchr_~t#1.offset := strrchr_#in~t#1.base, strrchr_#in~t#1.offset;strrchr_~c#1 := strrchr_#in~c#1;havoc strrchr_~ch~0#1;strrchr_~l~0#1.base, strrchr_~l~0#1.offset := 0, 0;strrchr_~ch~0#1 := (if strrchr_~c#1 % 256 <= 127 then strrchr_~c#1 % 256 else strrchr_~c#1 % 256 - 256); 2693#L510-1 call strrchr_#t~mem2#1 := read~int#0(strrchr_~t#1.base, strrchr_~t#1.offset, 1); 2692#L511 assume strrchr_#t~mem2#1 == strrchr_~ch~0#1;havoc strrchr_#t~mem2#1;strrchr_~l~0#1.base, strrchr_~l~0#1.offset := strrchr_~t#1.base, strrchr_~t#1.offset; 2691#L511-2 call strrchr_#t~mem3#1 := read~int#0(strrchr_~t#1.base, strrchr_~t#1.offset, 1); 2690#L511-3 assume !(0 == strrchr_#t~mem3#1);havoc strrchr_#t~mem3#1;strrchr_#t~pre4#1.base, strrchr_#t~pre4#1.offset := strrchr_~t#1.base, 1 + strrchr_~t#1.offset;strrchr_~t#1.base, strrchr_~t#1.offset := strrchr_~t#1.base, 1 + strrchr_~t#1.offset;havoc strrchr_#t~pre4#1.base, strrchr_#t~pre4#1.offset; 2689#L510-1 call strrchr_#t~mem2#1 := read~int#0(strrchr_~t#1.base, strrchr_~t#1.offset, 1); 2688#L511 assume strrchr_#t~mem2#1 == strrchr_~ch~0#1;havoc strrchr_#t~mem2#1;strrchr_~l~0#1.base, strrchr_~l~0#1.offset := strrchr_~t#1.base, strrchr_~t#1.offset; 2687#L511-2 call strrchr_#t~mem3#1 := read~int#0(strrchr_~t#1.base, strrchr_~t#1.offset, 1); 2686#L511-3 assume !(0 == strrchr_#t~mem3#1);havoc strrchr_#t~mem3#1;strrchr_#t~pre4#1.base, strrchr_#t~pre4#1.offset := strrchr_~t#1.base, 1 + strrchr_~t#1.offset;strrchr_~t#1.base, strrchr_~t#1.offset := strrchr_~t#1.base, 1 + strrchr_~t#1.offset;havoc strrchr_#t~pre4#1.base, strrchr_#t~pre4#1.offset; 2685#L510-1 call strrchr_#t~mem2#1 := read~int#0(strrchr_~t#1.base, strrchr_~t#1.offset, 1); 2684#L511 assume !(strrchr_#t~mem2#1 == strrchr_~ch~0#1);havoc strrchr_#t~mem2#1; 2683#L511-2 call strrchr_#t~mem3#1 := read~int#0(strrchr_~t#1.base, strrchr_~t#1.offset, 1); 2682#L511-3 assume !(0 == strrchr_#t~mem3#1);havoc strrchr_#t~mem3#1;strrchr_#t~pre4#1.base, strrchr_#t~pre4#1.offset := strrchr_~t#1.base, 1 + strrchr_~t#1.offset;strrchr_~t#1.base, strrchr_~t#1.offset := strrchr_~t#1.base, 1 + strrchr_~t#1.offset;havoc strrchr_#t~pre4#1.base, strrchr_#t~pre4#1.offset; 2681#L510-1 call strrchr_#t~mem2#1 := read~int#0(strrchr_~t#1.base, strrchr_~t#1.offset, 1); 2679#L511 assume strrchr_#t~mem2#1 == strrchr_~ch~0#1;havoc strrchr_#t~mem2#1;strrchr_~l~0#1.base, strrchr_~l~0#1.offset := strrchr_~t#1.base, strrchr_~t#1.offset; 2678#L511-2 call strrchr_#t~mem3#1 := read~int#0(strrchr_~t#1.base, strrchr_~t#1.offset, 1); 2677#L511-3 assume !(0 == strrchr_#t~mem3#1);havoc strrchr_#t~mem3#1;strrchr_#t~pre4#1.base, strrchr_#t~pre4#1.offset := strrchr_~t#1.base, 1 + strrchr_~t#1.offset;strrchr_~t#1.base, strrchr_~t#1.offset := strrchr_~t#1.base, 1 + strrchr_~t#1.offset;havoc strrchr_#t~pre4#1.base, strrchr_#t~pre4#1.offset; 2676#L510-1 call strrchr_#t~mem2#1 := read~int#0(strrchr_~t#1.base, strrchr_~t#1.offset, 1); 2650#L511 assume !(strrchr_#t~mem2#1 == strrchr_~ch~0#1);havoc strrchr_#t~mem2#1; 2648#L511-2 call strrchr_#t~mem3#1 := read~int#0(strrchr_~t#1.base, strrchr_~t#1.offset, 1); 2649#L511-3 assume 0 == strrchr_#t~mem3#1;havoc strrchr_#t~mem3#1;strrchr_#res#1.base, strrchr_#res#1.offset := strrchr_~l~0#1.base, strrchr_~l~0#1.offset; 2646#strrchr_returnLabel#1 
[2024-11-19 14:18:09,972 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2024-11-19 14:18:09,972 INFO  L85        PathProgramCache]: Analyzing trace with hash -1195844343, now seen corresponding path program 4 times
[2024-11-19 14:18:09,972 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-19 14:18:09,972 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1369707805]
[2024-11-19 14:18:09,972 INFO  L93    rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST
[2024-11-19 14:18:09,972 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-19 14:18:09,981 INFO  L227   tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s)
[2024-11-19 14:18:09,982 INFO  L228   tOrderPrioritization]: Conjunction of SSA is sat
[2024-11-19 14:18:09,982 INFO  L356             TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders.
[2024-11-19 14:18:09,987 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is sat
[2024-11-19 14:18:09,989 INFO  L130   FreeRefinementEngine]: Strategy CAMEL found a feasible trace
[2024-11-19 14:18:09,990 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2024-11-19 14:18:09,990 INFO  L85        PathProgramCache]: Analyzing trace with hash 31802792, now seen corresponding path program 5 times
[2024-11-19 14:18:09,990 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-19 14:18:09,990 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [352527072]
[2024-11-19 14:18:09,990 INFO  L93    rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1
[2024-11-19 14:18:09,990 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-19 14:18:10,000 INFO  L227   tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 5 check-sat command(s)
[2024-11-19 14:18:10,004 INFO  L228   tOrderPrioritization]: Conjunction of SSA is sat
[2024-11-19 14:18:10,004 INFO  L356             TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders.
[2024-11-19 14:18:10,015 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is sat
[2024-11-19 14:18:10,021 INFO  L130   FreeRefinementEngine]: Strategy CAMEL found a feasible trace
[2024-11-19 14:18:10,022 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2024-11-19 14:18:10,022 INFO  L85        PathProgramCache]: Analyzing trace with hash -1279680096, now seen corresponding path program 5 times
[2024-11-19 14:18:10,022 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-19 14:18:10,022 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1149524276]
[2024-11-19 14:18:10,022 INFO  L93    rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1
[2024-11-19 14:18:10,022 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-19 14:18:10,041 INFO  L227   tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 5 check-sat command(s)
[2024-11-19 14:18:10,043 INFO  L228   tOrderPrioritization]: Conjunction of SSA is unsat
[2024-11-19 14:18:10,504 INFO  L134       CoverageAnalysis]: Checked inductivity of 145 backedges. 57 proven. 84 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked.
[2024-11-19 14:18:10,504 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-11-19 14:18:10,504 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1149524276]
[2024-11-19 14:18:10,504 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1149524276] provided 0 perfect and 1 imperfect interpolant sequences
[2024-11-19 14:18:10,504 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [423432024]
[2024-11-19 14:18:10,504 INFO  L93    rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1
[2024-11-19 14:18:10,504 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2024-11-19 14:18:10,505 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3
[2024-11-19 14:18:10,506 INFO  L229       MonitoredProcess]: Starting monitored process 50 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2024-11-19 14:18:10,507 INFO  L327       MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (50)] Waiting until timeout for monitored process
[2024-11-19 14:18:10,606 INFO  L227   tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 5 check-sat command(s)
[2024-11-19 14:18:10,606 INFO  L228   tOrderPrioritization]: Conjunction of SSA is unsat
[2024-11-19 14:18:10,609 INFO  L255         TraceCheckSpWp]: Trace formula consists of 285 conjuncts, 67 conjuncts are in the unsatisfiable core
[2024-11-19 14:18:10,612 INFO  L278         TraceCheckSpWp]: Computing forward predicates...
[2024-11-19 14:18:10,705 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-11-19 14:18:10,758 INFO  L134       CoverageAnalysis]: Checked inductivity of 145 backedges. 57 proven. 82 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked.
[2024-11-19 14:18:10,758 INFO  L311         TraceCheckSpWp]: Computing backward predicates...
[2024-11-19 14:18:10,793 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 25
[2024-11-19 14:18:10,930 INFO  L134       CoverageAnalysis]: Checked inductivity of 145 backedges. 57 proven. 82 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked.
[2024-11-19 14:18:10,931 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleZ3 [423432024] provided 0 perfect and 2 imperfect interpolant sequences
[2024-11-19 14:18:10,931 INFO  L185   FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences.
[2024-11-19 14:18:10,931 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 14, 13] total 25
[2024-11-19 14:18:10,931 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1385082024]
[2024-11-19 14:18:10,931 INFO  L85    oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton
[2024-11-19 14:18:11,480 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-11-19 14:18:11,480 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants.
[2024-11-19 14:18:11,481 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=533, Unknown=0, NotChecked=0, Total=600
[2024-11-19 14:18:11,481 INFO  L87              Difference]: Start difference. First operand 100 states and 122 transitions. cyclomatic complexity: 27 Second operand  has 25 states, 25 states have (on average 3.16) internal successors, (79), 25 states have internal predecessors, (79), 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-11-19 14:18:11,726 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2024-11-19 14:18:11,726 INFO  L93              Difference]: Finished difference Result 86 states and 103 transitions.
[2024-11-19 14:18:11,726 INFO  L82        GeneralOperation]: Start removeNonLiveStates. Operand 86 states and 103 transitions.
[2024-11-19 14:18:11,727 INFO  L131   ngComponentsAnalysis]: Automaton has 1 accepting balls. 33
[2024-11-19 14:18:11,727 INFO  L88        GeneralOperation]: Finished removeNonLiveStates. Reduced from 86 states to 66 states and 80 transitions.
[2024-11-19 14:18:11,727 INFO  L87         BuchiClosureNwa]: Accepting states before buchiClosure: 43
[2024-11-19 14:18:11,728 INFO  L106        BuchiClosureNwa]: Accepting states after buchiClosure: 43
[2024-11-19 14:18:11,728 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 66 states and 80 transitions.
[2024-11-19 14:18:11,728 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is not deterministic.
[2024-11-19 14:18:11,728 INFO  L218   hiAutomatonCegarLoop]: Abstraction has 66 states and 80 transitions.
[2024-11-19 14:18:11,728 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 66 states and 80 transitions.
[2024-11-19 14:18:11,730 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 50.
[2024-11-19 14:18:11,730 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 50 states, 50 states have (on average 1.24) internal successors, (62), 49 states have internal predecessors, (62), 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-11-19 14:18:11,730 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 62 transitions.
[2024-11-19 14:18:11,731 INFO  L240   hiAutomatonCegarLoop]: Abstraction has 50 states and 62 transitions.
[2024-11-19 14:18:11,731 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. 
[2024-11-19 14:18:11,731 INFO  L425   stractBuchiCegarLoop]: Abstraction has 50 states and 62 transitions.
[2024-11-19 14:18:11,731 INFO  L332   stractBuchiCegarLoop]: ======== Iteration 12 ============
[2024-11-19 14:18:11,732 INFO  L72            BuchiIsEmpty]: Start buchiIsEmpty. Operand 50 states and 62 transitions.
[2024-11-19 14:18:11,732 INFO  L131   ngComponentsAnalysis]: Automaton has 1 accepting balls. 25
[2024-11-19 14:18:11,732 INFO  L87            BuchiIsEmpty]: Finished buchiIsEmpty Result is false
[2024-11-19 14:18:11,732 INFO  L119           BuchiIsEmpty]: Starting construction of run
[2024-11-19 14:18:11,733 INFO  L148   hiAutomatonCegarLoop]: Counterexample stem histogram [5, 5, 4, 4, 1, 1, 1, 1, 1, 1]
[2024-11-19 14:18:11,733 INFO  L149   hiAutomatonCegarLoop]: Counterexample loop histogram [5, 5, 4, 4, 1, 1, 1, 1, 1, 1, 1]
[2024-11-19 14:18:11,733 INFO  L745   eck$LassoCheckResult]: Stem: 3125#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 3126#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet7#1, main_#t~malloc8#1.base, main_#t~malloc8#1.offset, main_#t~ret9#1.base, main_#t~ret9#1.offset, main_~in_len~0#1, main_~in~0#1.base, main_~in~0#1.offset;havoc main_#t~nondet7#1;main_~in_len~0#1 := main_#t~nondet7#1;havoc main_#t~nondet7#1; 3127#L531 assume !(main_~in_len~0#1 < 1);call main_#t~malloc8#1.base, main_#t~malloc8#1.offset := #Ultimate.allocOnStack(main_~in_len~0#1 % 18446744073709551616);main_~in~0#1.base, main_~in~0#1.offset := main_#t~malloc8#1.base, main_#t~malloc8#1.offset;call write~int#0(0, main_~in~0#1.base, main_~in~0#1.offset + (main_~in_len~0#1 - 1), 1);assume { :begin_inline_basename } true;basename_#in~path#1.base, basename_#in~path#1.offset := main_~in~0#1.base, main_~in~0#1.offset;havoc basename_#res#1.base, basename_#res#1.offset;havoc basename_#t~ret5#1.base, basename_#t~ret5#1.offset, basename_#t~mem6#1, basename_~path#1.base, basename_~path#1.offset, basename_~c~0#1.base, basename_~c~0#1.offset;basename_~path#1.base, basename_~path#1.offset := basename_#in~path#1.base, basename_#in~path#1.offset;havoc basename_~c~0#1.base, basename_~c~0#1.offset; 3128#L517 assume { :begin_inline_strrchr } true;strrchr_#in~t#1.base, strrchr_#in~t#1.offset, strrchr_#in~c#1 := basename_~path#1.base, basename_~path#1.offset, 47;havoc strrchr_#res#1.base, strrchr_#res#1.offset;havoc strrchr_#t~mem2#1, strrchr_#t~mem3#1, strrchr_#t~pre4#1.base, strrchr_#t~pre4#1.offset, strrchr_~t#1.base, strrchr_~t#1.offset, strrchr_~c#1, strrchr_~ch~0#1, strrchr_~l~0#1.base, strrchr_~l~0#1.offset;strrchr_~t#1.base, strrchr_~t#1.offset := strrchr_#in~t#1.base, strrchr_#in~t#1.offset;strrchr_~c#1 := strrchr_#in~c#1;havoc strrchr_~ch~0#1;strrchr_~l~0#1.base, strrchr_~l~0#1.offset := 0, 0;strrchr_~ch~0#1 := (if strrchr_~c#1 % 256 <= 127 then strrchr_~c#1 % 256 else strrchr_~c#1 % 256 - 256); 3158#L510-1 call strrchr_#t~mem2#1 := read~int#0(strrchr_~t#1.base, strrchr_~t#1.offset, 1); 3157#L511 assume !(strrchr_#t~mem2#1 == strrchr_~ch~0#1);havoc strrchr_#t~mem2#1; 3154#L511-2 call strrchr_#t~mem3#1 := read~int#0(strrchr_~t#1.base, strrchr_~t#1.offset, 1); 3135#L511-3 assume !(0 == strrchr_#t~mem3#1);havoc strrchr_#t~mem3#1;strrchr_#t~pre4#1.base, strrchr_#t~pre4#1.offset := strrchr_~t#1.base, 1 + strrchr_~t#1.offset;strrchr_~t#1.base, strrchr_~t#1.offset := strrchr_~t#1.base, 1 + strrchr_~t#1.offset;havoc strrchr_#t~pre4#1.base, strrchr_#t~pre4#1.offset; 3136#L510-1 call strrchr_#t~mem2#1 := read~int#0(strrchr_~t#1.base, strrchr_~t#1.offset, 1); 3153#L511 assume !(strrchr_#t~mem2#1 == strrchr_~ch~0#1);havoc strrchr_#t~mem2#1; 3155#L511-2 call strrchr_#t~mem3#1 := read~int#0(strrchr_~t#1.base, strrchr_~t#1.offset, 1); 3156#L511-3 assume !(0 == strrchr_#t~mem3#1);havoc strrchr_#t~mem3#1;strrchr_#t~pre4#1.base, strrchr_#t~pre4#1.offset := strrchr_~t#1.base, 1 + strrchr_~t#1.offset;strrchr_~t#1.base, strrchr_~t#1.offset := strrchr_~t#1.base, 1 + strrchr_~t#1.offset;havoc strrchr_#t~pre4#1.base, strrchr_#t~pre4#1.offset; 3159#L510-1 call strrchr_#t~mem2#1 := read~int#0(strrchr_~t#1.base, strrchr_~t#1.offset, 1); 3117#L511 assume !(strrchr_#t~mem2#1 == strrchr_~ch~0#1);havoc strrchr_#t~mem2#1; 3118#L511-2 call strrchr_#t~mem3#1 := read~int#0(strrchr_~t#1.base, strrchr_~t#1.offset, 1); 3120#L511-3 assume !(0 == strrchr_#t~mem3#1);havoc strrchr_#t~mem3#1;strrchr_#t~pre4#1.base, strrchr_#t~pre4#1.offset := strrchr_~t#1.base, 1 + strrchr_~t#1.offset;strrchr_~t#1.base, strrchr_~t#1.offset := strrchr_~t#1.base, 1 + strrchr_~t#1.offset;havoc strrchr_#t~pre4#1.base, strrchr_#t~pre4#1.offset; 3123#L510-1 call strrchr_#t~mem2#1 := read~int#0(strrchr_~t#1.base, strrchr_~t#1.offset, 1); 3124#L511 assume strrchr_#t~mem2#1 == strrchr_~ch~0#1;havoc strrchr_#t~mem2#1;strrchr_~l~0#1.base, strrchr_~l~0#1.offset := strrchr_~t#1.base, strrchr_~t#1.offset; 3151#L511-2 call strrchr_#t~mem3#1 := read~int#0(strrchr_~t#1.base, strrchr_~t#1.offset, 1); 3148#L511-3 assume !(0 == strrchr_#t~mem3#1);havoc strrchr_#t~mem3#1;strrchr_#t~pre4#1.base, strrchr_#t~pre4#1.offset := strrchr_~t#1.base, 1 + strrchr_~t#1.offset;strrchr_~t#1.base, strrchr_~t#1.offset := strrchr_~t#1.base, 1 + strrchr_~t#1.offset;havoc strrchr_#t~pre4#1.base, strrchr_#t~pre4#1.offset; 3145#L510-1 call strrchr_#t~mem2#1 := read~int#0(strrchr_~t#1.base, strrchr_~t#1.offset, 1); 3141#L511 assume !(strrchr_#t~mem2#1 == strrchr_~ch~0#1);havoc strrchr_#t~mem2#1; 3142#L511-2 call strrchr_#t~mem3#1 := read~int#0(strrchr_~t#1.base, strrchr_~t#1.offset, 1); 3138#L511-3 assume 0 == strrchr_#t~mem3#1;havoc strrchr_#t~mem3#1;strrchr_#res#1.base, strrchr_#res#1.offset := strrchr_~l~0#1.base, strrchr_~l~0#1.offset; 3137#strrchr_returnLabel#1 
[2024-11-19 14:18:11,733 INFO  L747   eck$LassoCheckResult]: Loop: 3137#strrchr_returnLabel#1 basename_#t~ret5#1.base, basename_#t~ret5#1.offset := strrchr_#res#1.base, strrchr_#res#1.offset;havoc strrchr_#t~mem2#1, strrchr_#t~mem3#1, strrchr_#t~pre4#1.base, strrchr_#t~pre4#1.offset, strrchr_~t#1.base, strrchr_~t#1.offset, strrchr_~c#1, strrchr_~ch~0#1, strrchr_~l~0#1.base, strrchr_~l~0#1.offset;havoc strrchr_#in~t#1.base, strrchr_#in~t#1.offset, strrchr_#in~c#1;assume { :end_inline_strrchr } true;basename_~c~0#1.base, basename_~c~0#1.offset := basename_#t~ret5#1.base, basename_#t~ret5#1.offset; 3129#L518 assume !(basename_~c~0#1.base == 0 && basename_~c~0#1.offset == 0);havoc basename_#t~ret5#1.base, basename_#t~ret5#1.offset;call basename_#t~mem6#1 := read~int#0(basename_~c~0#1.base, 1 + basename_~c~0#1.offset, 1); 3130#L519 assume 0 == basename_#t~mem6#1;havoc basename_#t~mem6#1; 3131#L520 assume !(basename_~c~0#1.base == basename_~path#1.base && basename_~c~0#1.offset == basename_~path#1.offset);call write~int#0(0, basename_~c~0#1.base, basename_~c~0#1.offset, 1); 3132#L517 assume { :begin_inline_strrchr } true;strrchr_#in~t#1.base, strrchr_#in~t#1.offset, strrchr_#in~c#1 := basename_~path#1.base, basename_~path#1.offset, 47;havoc strrchr_#res#1.base, strrchr_#res#1.offset;havoc strrchr_#t~mem2#1, strrchr_#t~mem3#1, strrchr_#t~pre4#1.base, strrchr_#t~pre4#1.offset, strrchr_~t#1.base, strrchr_~t#1.offset, strrchr_~c#1, strrchr_~ch~0#1, strrchr_~l~0#1.base, strrchr_~l~0#1.offset;strrchr_~t#1.base, strrchr_~t#1.offset := strrchr_#in~t#1.base, strrchr_#in~t#1.offset;strrchr_~c#1 := strrchr_#in~c#1;havoc strrchr_~ch~0#1;strrchr_~l~0#1.base, strrchr_~l~0#1.offset := 0, 0;strrchr_~ch~0#1 := (if strrchr_~c#1 % 256 <= 127 then strrchr_~c#1 % 256 else strrchr_~c#1 % 256 - 256); 3121#L510-1 call strrchr_#t~mem2#1 := read~int#0(strrchr_~t#1.base, strrchr_~t#1.offset, 1); 3122#L511 assume strrchr_#t~mem2#1 == strrchr_~ch~0#1;havoc strrchr_#t~mem2#1;strrchr_~l~0#1.base, strrchr_~l~0#1.offset := strrchr_~t#1.base, strrchr_~t#1.offset; 3162#L511-2 call strrchr_#t~mem3#1 := read~int#0(strrchr_~t#1.base, strrchr_~t#1.offset, 1); 3133#L511-3 assume !(0 == strrchr_#t~mem3#1);havoc strrchr_#t~mem3#1;strrchr_#t~pre4#1.base, strrchr_#t~pre4#1.offset := strrchr_~t#1.base, 1 + strrchr_~t#1.offset;strrchr_~t#1.base, strrchr_~t#1.offset := strrchr_~t#1.base, 1 + strrchr_~t#1.offset;havoc strrchr_#t~pre4#1.base, strrchr_#t~pre4#1.offset; 3134#L510-1 call strrchr_#t~mem2#1 := read~int#0(strrchr_~t#1.base, strrchr_~t#1.offset, 1); 3164#L511 assume strrchr_#t~mem2#1 == strrchr_~ch~0#1;havoc strrchr_#t~mem2#1;strrchr_~l~0#1.base, strrchr_~l~0#1.offset := strrchr_~t#1.base, strrchr_~t#1.offset; 3160#L511-2 call strrchr_#t~mem3#1 := read~int#0(strrchr_~t#1.base, strrchr_~t#1.offset, 1); 3161#L511-3 assume !(0 == strrchr_#t~mem3#1);havoc strrchr_#t~mem3#1;strrchr_#t~pre4#1.base, strrchr_#t~pre4#1.offset := strrchr_~t#1.base, 1 + strrchr_~t#1.offset;strrchr_~t#1.base, strrchr_~t#1.offset := strrchr_~t#1.base, 1 + strrchr_~t#1.offset;havoc strrchr_#t~pre4#1.base, strrchr_#t~pre4#1.offset; 3163#L510-1 call strrchr_#t~mem2#1 := read~int#0(strrchr_~t#1.base, strrchr_~t#1.offset, 1); 3115#L511 assume strrchr_#t~mem2#1 == strrchr_~ch~0#1;havoc strrchr_#t~mem2#1;strrchr_~l~0#1.base, strrchr_~l~0#1.offset := strrchr_~t#1.base, strrchr_~t#1.offset; 3116#L511-2 call strrchr_#t~mem3#1 := read~int#0(strrchr_~t#1.base, strrchr_~t#1.offset, 1); 3119#L511-3 assume !(0 == strrchr_#t~mem3#1);havoc strrchr_#t~mem3#1;strrchr_#t~pre4#1.base, strrchr_#t~pre4#1.offset := strrchr_~t#1.base, 1 + strrchr_~t#1.offset;strrchr_~t#1.base, strrchr_~t#1.offset := strrchr_~t#1.base, 1 + strrchr_~t#1.offset;havoc strrchr_#t~pre4#1.base, strrchr_#t~pre4#1.offset; 3152#L510-1 call strrchr_#t~mem2#1 := read~int#0(strrchr_~t#1.base, strrchr_~t#1.offset, 1); 3150#L511 assume strrchr_#t~mem2#1 == strrchr_~ch~0#1;havoc strrchr_#t~mem2#1;strrchr_~l~0#1.base, strrchr_~l~0#1.offset := strrchr_~t#1.base, strrchr_~t#1.offset; 3149#L511-2 call strrchr_#t~mem3#1 := read~int#0(strrchr_~t#1.base, strrchr_~t#1.offset, 1); 3147#L511-3 assume !(0 == strrchr_#t~mem3#1);havoc strrchr_#t~mem3#1;strrchr_#t~pre4#1.base, strrchr_#t~pre4#1.offset := strrchr_~t#1.base, 1 + strrchr_~t#1.offset;strrchr_~t#1.base, strrchr_~t#1.offset := strrchr_~t#1.base, 1 + strrchr_~t#1.offset;havoc strrchr_#t~pre4#1.base, strrchr_#t~pre4#1.offset; 3143#L510-1 call strrchr_#t~mem2#1 := read~int#0(strrchr_~t#1.base, strrchr_~t#1.offset, 1); 3144#L511 assume !(strrchr_#t~mem2#1 == strrchr_~ch~0#1);havoc strrchr_#t~mem2#1; 3139#L511-2 call strrchr_#t~mem3#1 := read~int#0(strrchr_~t#1.base, strrchr_~t#1.offset, 1); 3140#L511-3 assume 0 == strrchr_#t~mem3#1;havoc strrchr_#t~mem3#1;strrchr_#res#1.base, strrchr_#res#1.offset := strrchr_~l~0#1.base, strrchr_~l~0#1.offset; 3137#strrchr_returnLabel#1 
[2024-11-19 14:18:11,734 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2024-11-19 14:18:11,734 INFO  L85        PathProgramCache]: Analyzing trace with hash -2019525261, now seen corresponding path program 5 times
[2024-11-19 14:18:11,734 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-19 14:18:11,734 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [555952036]
[2024-11-19 14:18:11,734 INFO  L93    rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1
[2024-11-19 14:18:11,735 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-19 14:18:11,746 INFO  L227   tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 5 check-sat command(s)
[2024-11-19 14:18:11,746 INFO  L228   tOrderPrioritization]: Conjunction of SSA is sat
[2024-11-19 14:18:11,746 INFO  L356             TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders.
[2024-11-19 14:18:11,754 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is sat
[2024-11-19 14:18:11,757 INFO  L130   FreeRefinementEngine]: Strategy CAMEL found a feasible trace
[2024-11-19 14:18:11,758 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2024-11-19 14:18:11,758 INFO  L85        PathProgramCache]: Analyzing trace with hash -669261786, now seen corresponding path program 6 times
[2024-11-19 14:18:11,758 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-19 14:18:11,758 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [843532725]
[2024-11-19 14:18:11,759 INFO  L93    rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE
[2024-11-19 14:18:11,759 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-19 14:18:11,767 INFO  L227   tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 5 check-sat command(s)
[2024-11-19 14:18:11,768 INFO  L228   tOrderPrioritization]: Conjunction of SSA is sat
[2024-11-19 14:18:11,768 INFO  L356             TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders.
[2024-11-19 14:18:11,772 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is sat
[2024-11-19 14:18:11,775 INFO  L130   FreeRefinementEngine]: Strategy CAMEL found a feasible trace
[2024-11-19 14:18:11,775 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2024-11-19 14:18:11,776 INFO  L85        PathProgramCache]: Analyzing trace with hash 349767412, now seen corresponding path program 6 times
[2024-11-19 14:18:11,776 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-19 14:18:11,776 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [388814005]
[2024-11-19 14:18:11,776 INFO  L93    rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE
[2024-11-19 14:18:11,776 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-19 14:18:11,793 INFO  L227   tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 4 check-sat command(s)
[2024-11-19 14:18:11,793 INFO  L228   tOrderPrioritization]: Conjunction of SSA is unsat
[2024-11-19 14:18:12,445 INFO  L134       CoverageAnalysis]: Checked inductivity of 181 backedges. 3 proven. 158 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked.
[2024-11-19 14:18:12,446 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-11-19 14:18:12,446 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [388814005]
[2024-11-19 14:18:12,446 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [388814005] provided 0 perfect and 1 imperfect interpolant sequences
[2024-11-19 14:18:12,446 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2059402859]
[2024-11-19 14:18:12,446 INFO  L93    rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE
[2024-11-19 14:18:12,446 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2024-11-19 14:18:12,447 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3
[2024-11-19 14:18:12,448 INFO  L229       MonitoredProcess]: Starting monitored process 51 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2024-11-19 14:18:12,450 INFO  L327       MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (51)] Waiting until timeout for monitored process
[2024-11-19 14:18:12,551 INFO  L227   tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 4 check-sat command(s)
[2024-11-19 14:18:12,552 INFO  L228   tOrderPrioritization]: Conjunction of SSA is unsat
[2024-11-19 14:18:12,554 INFO  L255         TraceCheckSpWp]: Trace formula consists of 221 conjuncts, 71 conjuncts are in the unsatisfiable core
[2024-11-19 14:18:12,558 INFO  L278         TraceCheckSpWp]: Computing forward predicates...
[2024-11-19 14:18:12,564 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-11-19 14:18:12,685 INFO  L349             Elim1Store]: treesize reduction 17, result has 46.9 percent of original size
[2024-11-19 14:18:12,685 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 20 treesize of output 27
[2024-11-19 14:18:12,812 INFO  L134       CoverageAnalysis]: Checked inductivity of 181 backedges. 91 proven. 54 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked.
[2024-11-19 14:18:12,813 INFO  L311         TraceCheckSpWp]: Computing backward predicates...
[2024-11-19 14:18:13,486 INFO  L134       CoverageAnalysis]: Checked inductivity of 181 backedges. 37 proven. 116 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked.
[2024-11-19 14:18:13,486 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleZ3 [2059402859] provided 0 perfect and 2 imperfect interpolant sequences
[2024-11-19 14:18:13,486 INFO  L185   FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences.
[2024-11-19 14:18:13,486 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 11, 13] total 32
[2024-11-19 14:18:13,486 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1792241381]
[2024-11-19 14:18:13,486 INFO  L85    oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton
[2024-11-19 14:18:14,070 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-11-19 14:18:14,071 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants.
[2024-11-19 14:18:14,071 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=129, Invalid=863, Unknown=0, NotChecked=0, Total=992
[2024-11-19 14:18:14,071 INFO  L87              Difference]: Start difference. First operand 50 states and 62 transitions. cyclomatic complexity: 15 Second operand  has 32 states, 32 states have (on average 2.75) internal successors, (88), 32 states have internal predecessors, (88), 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-11-19 14:18:14,512 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2024-11-19 14:18:14,512 INFO  L93              Difference]: Finished difference Result 108 states and 133 transitions.
[2024-11-19 14:18:14,512 INFO  L82        GeneralOperation]: Start removeNonLiveStates. Operand 108 states and 133 transitions.
[2024-11-19 14:18:14,513 INFO  L131   ngComponentsAnalysis]: Automaton has 4 accepting balls. 60
[2024-11-19 14:18:14,513 INFO  L88        GeneralOperation]: Finished removeNonLiveStates. Reduced from 108 states to 108 states and 133 transitions.
[2024-11-19 14:18:14,513 INFO  L87         BuchiClosureNwa]: Accepting states before buchiClosure: 81
[2024-11-19 14:18:14,514 INFO  L106        BuchiClosureNwa]: Accepting states after buchiClosure: 81
[2024-11-19 14:18:14,514 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 108 states and 133 transitions.
[2024-11-19 14:18:14,514 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is not deterministic.
[2024-11-19 14:18:14,514 INFO  L218   hiAutomatonCegarLoop]: Abstraction has 108 states and 133 transitions.
[2024-11-19 14:18:14,514 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 108 states and 133 transitions.
[2024-11-19 14:18:14,516 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 90.
[2024-11-19 14:18:14,517 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 90 states, 90 states have (on average 1.2333333333333334) internal successors, (111), 89 states have internal predecessors, (111), 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-11-19 14:18:14,517 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 111 transitions.
[2024-11-19 14:18:14,517 INFO  L240   hiAutomatonCegarLoop]: Abstraction has 90 states and 111 transitions.
[2024-11-19 14:18:14,520 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. 
[2024-11-19 14:18:14,521 INFO  L425   stractBuchiCegarLoop]: Abstraction has 90 states and 111 transitions.
[2024-11-19 14:18:14,521 INFO  L332   stractBuchiCegarLoop]: ======== Iteration 13 ============
[2024-11-19 14:18:14,521 INFO  L72            BuchiIsEmpty]: Start buchiIsEmpty. Operand 90 states and 111 transitions.
[2024-11-19 14:18:14,522 INFO  L131   ngComponentsAnalysis]: Automaton has 2 accepting balls. 50
[2024-11-19 14:18:14,522 INFO  L87            BuchiIsEmpty]: Finished buchiIsEmpty Result is false
[2024-11-19 14:18:14,522 INFO  L119           BuchiIsEmpty]: Starting construction of run
[2024-11-19 14:18:14,523 INFO  L148   hiAutomatonCegarLoop]: Counterexample stem histogram [5, 5, 4, 3, 2, 1, 1, 1, 1, 1]
[2024-11-19 14:18:14,523 INFO  L149   hiAutomatonCegarLoop]: Counterexample loop histogram [5, 5, 4, 4, 1, 1, 1, 1, 1, 1, 1]
[2024-11-19 14:18:14,523 INFO  L745   eck$LassoCheckResult]: Stem: 3620#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 3621#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet7#1, main_#t~malloc8#1.base, main_#t~malloc8#1.offset, main_#t~ret9#1.base, main_#t~ret9#1.offset, main_~in_len~0#1, main_~in~0#1.base, main_~in~0#1.offset;havoc main_#t~nondet7#1;main_~in_len~0#1 := main_#t~nondet7#1;havoc main_#t~nondet7#1; 3622#L531 assume !(main_~in_len~0#1 < 1);call main_#t~malloc8#1.base, main_#t~malloc8#1.offset := #Ultimate.allocOnStack(main_~in_len~0#1 % 18446744073709551616);main_~in~0#1.base, main_~in~0#1.offset := main_#t~malloc8#1.base, main_#t~malloc8#1.offset;call write~int#0(0, main_~in~0#1.base, main_~in~0#1.offset + (main_~in_len~0#1 - 1), 1);assume { :begin_inline_basename } true;basename_#in~path#1.base, basename_#in~path#1.offset := main_~in~0#1.base, main_~in~0#1.offset;havoc basename_#res#1.base, basename_#res#1.offset;havoc basename_#t~ret5#1.base, basename_#t~ret5#1.offset, basename_#t~mem6#1, basename_~path#1.base, basename_~path#1.offset, basename_~c~0#1.base, basename_~c~0#1.offset;basename_~path#1.base, basename_~path#1.offset := basename_#in~path#1.base, basename_#in~path#1.offset;havoc basename_~c~0#1.base, basename_~c~0#1.offset; 3623#L517 assume { :begin_inline_strrchr } true;strrchr_#in~t#1.base, strrchr_#in~t#1.offset, strrchr_#in~c#1 := basename_~path#1.base, basename_~path#1.offset, 47;havoc strrchr_#res#1.base, strrchr_#res#1.offset;havoc strrchr_#t~mem2#1, strrchr_#t~mem3#1, strrchr_#t~pre4#1.base, strrchr_#t~pre4#1.offset, strrchr_~t#1.base, strrchr_~t#1.offset, strrchr_~c#1, strrchr_~ch~0#1, strrchr_~l~0#1.base, strrchr_~l~0#1.offset;strrchr_~t#1.base, strrchr_~t#1.offset := strrchr_#in~t#1.base, strrchr_#in~t#1.offset;strrchr_~c#1 := strrchr_#in~c#1;havoc strrchr_~ch~0#1;strrchr_~l~0#1.base, strrchr_~l~0#1.offset := 0, 0;strrchr_~ch~0#1 := (if strrchr_~c#1 % 256 <= 127 then strrchr_~c#1 % 256 else strrchr_~c#1 % 256 - 256); 3657#L510-1 call strrchr_#t~mem2#1 := read~int#0(strrchr_~t#1.base, strrchr_~t#1.offset, 1); 3656#L511 assume !(strrchr_#t~mem2#1 == strrchr_~ch~0#1);havoc strrchr_#t~mem2#1; 3655#L511-2 call strrchr_#t~mem3#1 := read~int#0(strrchr_~t#1.base, strrchr_~t#1.offset, 1); 3654#L511-3 assume !(0 == strrchr_#t~mem3#1);havoc strrchr_#t~mem3#1;strrchr_#t~pre4#1.base, strrchr_#t~pre4#1.offset := strrchr_~t#1.base, 1 + strrchr_~t#1.offset;strrchr_~t#1.base, strrchr_~t#1.offset := strrchr_~t#1.base, 1 + strrchr_~t#1.offset;havoc strrchr_#t~pre4#1.base, strrchr_#t~pre4#1.offset; 3653#L510-1 call strrchr_#t~mem2#1 := read~int#0(strrchr_~t#1.base, strrchr_~t#1.offset, 1); 3651#L511 assume strrchr_#t~mem2#1 == strrchr_~ch~0#1;havoc strrchr_#t~mem2#1;strrchr_~l~0#1.base, strrchr_~l~0#1.offset := strrchr_~t#1.base, strrchr_~t#1.offset; 3652#L511-2 call strrchr_#t~mem3#1 := read~int#0(strrchr_~t#1.base, strrchr_~t#1.offset, 1); 3692#L511-3 assume !(0 == strrchr_#t~mem3#1);havoc strrchr_#t~mem3#1;strrchr_#t~pre4#1.base, strrchr_#t~pre4#1.offset := strrchr_~t#1.base, 1 + strrchr_~t#1.offset;strrchr_~t#1.base, strrchr_~t#1.offset := strrchr_~t#1.base, 1 + strrchr_~t#1.offset;havoc strrchr_#t~pre4#1.base, strrchr_#t~pre4#1.offset; 3691#L510-1 call strrchr_#t~mem2#1 := read~int#0(strrchr_~t#1.base, strrchr_~t#1.offset, 1); 3690#L511 assume !(strrchr_#t~mem2#1 == strrchr_~ch~0#1);havoc strrchr_#t~mem2#1; 3687#L511-2 call strrchr_#t~mem3#1 := read~int#0(strrchr_~t#1.base, strrchr_~t#1.offset, 1); 3689#L511-3 assume !(0 == strrchr_#t~mem3#1);havoc strrchr_#t~mem3#1;strrchr_#t~pre4#1.base, strrchr_#t~pre4#1.offset := strrchr_~t#1.base, 1 + strrchr_~t#1.offset;strrchr_~t#1.base, strrchr_~t#1.offset := strrchr_~t#1.base, 1 + strrchr_~t#1.offset;havoc strrchr_#t~pre4#1.base, strrchr_#t~pre4#1.offset; 3688#L510-1 call strrchr_#t~mem2#1 := read~int#0(strrchr_~t#1.base, strrchr_~t#1.offset, 1); 3686#L511 assume strrchr_#t~mem2#1 == strrchr_~ch~0#1;havoc strrchr_#t~mem2#1;strrchr_~l~0#1.base, strrchr_~l~0#1.offset := strrchr_~t#1.base, strrchr_~t#1.offset; 3685#L511-2 call strrchr_#t~mem3#1 := read~int#0(strrchr_~t#1.base, strrchr_~t#1.offset, 1); 3684#L511-3 assume !(0 == strrchr_#t~mem3#1);havoc strrchr_#t~mem3#1;strrchr_#t~pre4#1.base, strrchr_#t~pre4#1.offset := strrchr_~t#1.base, 1 + strrchr_~t#1.offset;strrchr_~t#1.base, strrchr_~t#1.offset := strrchr_~t#1.base, 1 + strrchr_~t#1.offset;havoc strrchr_#t~pre4#1.base, strrchr_#t~pre4#1.offset; 3681#L510-1 call strrchr_#t~mem2#1 := read~int#0(strrchr_~t#1.base, strrchr_~t#1.offset, 1); 3644#L511 assume !(strrchr_#t~mem2#1 == strrchr_~ch~0#1);havoc strrchr_#t~mem2#1; 3645#L511-2 call strrchr_#t~mem3#1 := read~int#0(strrchr_~t#1.base, strrchr_~t#1.offset, 1); 3677#L511-3 assume 0 == strrchr_#t~mem3#1;havoc strrchr_#t~mem3#1;strrchr_#res#1.base, strrchr_#res#1.offset := strrchr_~l~0#1.base, strrchr_~l~0#1.offset; 3674#strrchr_returnLabel#1 
[2024-11-19 14:18:14,523 INFO  L747   eck$LassoCheckResult]: Loop: 3674#strrchr_returnLabel#1 basename_#t~ret5#1.base, basename_#t~ret5#1.offset := strrchr_#res#1.base, strrchr_#res#1.offset;havoc strrchr_#t~mem2#1, strrchr_#t~mem3#1, strrchr_#t~pre4#1.base, strrchr_#t~pre4#1.offset, strrchr_~t#1.base, strrchr_~t#1.offset, strrchr_~c#1, strrchr_~ch~0#1, strrchr_~l~0#1.base, strrchr_~l~0#1.offset;havoc strrchr_#in~t#1.base, strrchr_#in~t#1.offset, strrchr_#in~c#1;assume { :end_inline_strrchr } true;basename_~c~0#1.base, basename_~c~0#1.offset := basename_#t~ret5#1.base, basename_#t~ret5#1.offset; 3673#L518 assume !(basename_~c~0#1.base == 0 && basename_~c~0#1.offset == 0);havoc basename_#t~ret5#1.base, basename_#t~ret5#1.offset;call basename_#t~mem6#1 := read~int#0(basename_~c~0#1.base, 1 + basename_~c~0#1.offset, 1); 3672#L519 assume 0 == basename_#t~mem6#1;havoc basename_#t~mem6#1; 3671#L520 assume !(basename_~c~0#1.base == basename_~path#1.base && basename_~c~0#1.offset == basename_~path#1.offset);call write~int#0(0, basename_~c~0#1.base, basename_~c~0#1.offset, 1); 3670#L517 assume { :begin_inline_strrchr } true;strrchr_#in~t#1.base, strrchr_#in~t#1.offset, strrchr_#in~c#1 := basename_~path#1.base, basename_~path#1.offset, 47;havoc strrchr_#res#1.base, strrchr_#res#1.offset;havoc strrchr_#t~mem2#1, strrchr_#t~mem3#1, strrchr_#t~pre4#1.base, strrchr_#t~pre4#1.offset, strrchr_~t#1.base, strrchr_~t#1.offset, strrchr_~c#1, strrchr_~ch~0#1, strrchr_~l~0#1.base, strrchr_~l~0#1.offset;strrchr_~t#1.base, strrchr_~t#1.offset := strrchr_#in~t#1.base, strrchr_#in~t#1.offset;strrchr_~c#1 := strrchr_#in~c#1;havoc strrchr_~ch~0#1;strrchr_~l~0#1.base, strrchr_~l~0#1.offset := 0, 0;strrchr_~ch~0#1 := (if strrchr_~c#1 % 256 <= 127 then strrchr_~c#1 % 256 else strrchr_~c#1 % 256 - 256); 3669#L510-1 call strrchr_#t~mem2#1 := read~int#0(strrchr_~t#1.base, strrchr_~t#1.offset, 1); 3668#L511 assume strrchr_#t~mem2#1 == strrchr_~ch~0#1;havoc strrchr_#t~mem2#1;strrchr_~l~0#1.base, strrchr_~l~0#1.offset := strrchr_~t#1.base, strrchr_~t#1.offset; 3667#L511-2 call strrchr_#t~mem3#1 := read~int#0(strrchr_~t#1.base, strrchr_~t#1.offset, 1); 3666#L511-3 assume !(0 == strrchr_#t~mem3#1);havoc strrchr_#t~mem3#1;strrchr_#t~pre4#1.base, strrchr_#t~pre4#1.offset := strrchr_~t#1.base, 1 + strrchr_~t#1.offset;strrchr_~t#1.base, strrchr_~t#1.offset := strrchr_~t#1.base, 1 + strrchr_~t#1.offset;havoc strrchr_#t~pre4#1.base, strrchr_#t~pre4#1.offset; 3665#L510-1 call strrchr_#t~mem2#1 := read~int#0(strrchr_~t#1.base, strrchr_~t#1.offset, 1); 3663#L511 assume strrchr_#t~mem2#1 == strrchr_~ch~0#1;havoc strrchr_#t~mem2#1;strrchr_~l~0#1.base, strrchr_~l~0#1.offset := strrchr_~t#1.base, strrchr_~t#1.offset; 3664#L511-2 call strrchr_#t~mem3#1 := read~int#0(strrchr_~t#1.base, strrchr_~t#1.offset, 1); 3699#L511-3 assume !(0 == strrchr_#t~mem3#1);havoc strrchr_#t~mem3#1;strrchr_#t~pre4#1.base, strrchr_#t~pre4#1.offset := strrchr_~t#1.base, 1 + strrchr_~t#1.offset;strrchr_~t#1.base, strrchr_~t#1.offset := strrchr_~t#1.base, 1 + strrchr_~t#1.offset;havoc strrchr_#t~pre4#1.base, strrchr_#t~pre4#1.offset; 3698#L510-1 call strrchr_#t~mem2#1 := read~int#0(strrchr_~t#1.base, strrchr_~t#1.offset, 1); 3697#L511 assume strrchr_#t~mem2#1 == strrchr_~ch~0#1;havoc strrchr_#t~mem2#1;strrchr_~l~0#1.base, strrchr_~l~0#1.offset := strrchr_~t#1.base, strrchr_~t#1.offset; 3694#L511-2 call strrchr_#t~mem3#1 := read~int#0(strrchr_~t#1.base, strrchr_~t#1.offset, 1); 3696#L511-3 assume !(0 == strrchr_#t~mem3#1);havoc strrchr_#t~mem3#1;strrchr_#t~pre4#1.base, strrchr_#t~pre4#1.offset := strrchr_~t#1.base, 1 + strrchr_~t#1.offset;strrchr_~t#1.base, strrchr_~t#1.offset := strrchr_~t#1.base, 1 + strrchr_~t#1.offset;havoc strrchr_#t~pre4#1.base, strrchr_#t~pre4#1.offset; 3695#L510-1 call strrchr_#t~mem2#1 := read~int#0(strrchr_~t#1.base, strrchr_~t#1.offset, 1); 3693#L511 assume strrchr_#t~mem2#1 == strrchr_~ch~0#1;havoc strrchr_#t~mem2#1;strrchr_~l~0#1.base, strrchr_~l~0#1.offset := strrchr_~t#1.base, strrchr_~t#1.offset; 3680#L511-2 call strrchr_#t~mem3#1 := read~int#0(strrchr_~t#1.base, strrchr_~t#1.offset, 1); 3683#L511-3 assume !(0 == strrchr_#t~mem3#1);havoc strrchr_#t~mem3#1;strrchr_#t~pre4#1.base, strrchr_#t~pre4#1.offset := strrchr_~t#1.base, 1 + strrchr_~t#1.offset;strrchr_~t#1.base, strrchr_~t#1.offset := strrchr_~t#1.base, 1 + strrchr_~t#1.offset;havoc strrchr_#t~pre4#1.base, strrchr_#t~pre4#1.offset; 3676#L510-1 call strrchr_#t~mem2#1 := read~int#0(strrchr_~t#1.base, strrchr_~t#1.offset, 1); 3679#L511 assume !(strrchr_#t~mem2#1 == strrchr_~ch~0#1);havoc strrchr_#t~mem2#1; 3678#L511-2 call strrchr_#t~mem3#1 := read~int#0(strrchr_~t#1.base, strrchr_~t#1.offset, 1); 3675#L511-3 assume 0 == strrchr_#t~mem3#1;havoc strrchr_#t~mem3#1;strrchr_#res#1.base, strrchr_#res#1.offset := strrchr_~l~0#1.base, strrchr_~l~0#1.offset; 3674#strrchr_returnLabel#1 
[2024-11-19 14:18:14,524 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2024-11-19 14:18:14,524 INFO  L85        PathProgramCache]: Analyzing trace with hash -739661583, now seen corresponding path program 6 times
[2024-11-19 14:18:14,524 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-19 14:18:14,524 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [961410351]
[2024-11-19 14:18:14,524 INFO  L93    rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE
[2024-11-19 14:18:14,524 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-19 14:18:14,539 INFO  L227   tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 5 check-sat command(s)
[2024-11-19 14:18:14,539 INFO  L228   tOrderPrioritization]: Conjunction of SSA is sat
[2024-11-19 14:18:14,539 INFO  L356             TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders.
[2024-11-19 14:18:14,545 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is sat
[2024-11-19 14:18:14,549 INFO  L130   FreeRefinementEngine]: Strategy CAMEL found a feasible trace
[2024-11-19 14:18:14,550 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2024-11-19 14:18:14,550 INFO  L85        PathProgramCache]: Analyzing trace with hash -669261786, now seen corresponding path program 7 times
[2024-11-19 14:18:14,550 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-19 14:18:14,550 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1148773099]
[2024-11-19 14:18:14,550 INFO  L93    rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY
[2024-11-19 14:18:14,551 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-19 14:18:14,559 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is sat
[2024-11-19 14:18:14,559 INFO  L356             TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders.
[2024-11-19 14:18:14,564 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is sat
[2024-11-19 14:18:14,566 INFO  L130   FreeRefinementEngine]: Strategy CAMEL found a feasible trace
[2024-11-19 14:18:14,567 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2024-11-19 14:18:14,567 INFO  L85        PathProgramCache]: Analyzing trace with hash 1721574710, now seen corresponding path program 7 times
[2024-11-19 14:18:14,567 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-19 14:18:14,567 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [496968540]
[2024-11-19 14:18:14,567 INFO  L93    rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY
[2024-11-19 14:18:14,567 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-19 14:18:14,581 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-19 14:18:15,320 INFO  L134       CoverageAnalysis]: Checked inductivity of 181 backedges. 51 proven. 128 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked.
[2024-11-19 14:18:15,320 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-11-19 14:18:15,321 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [496968540]
[2024-11-19 14:18:15,321 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [496968540] provided 0 perfect and 1 imperfect interpolant sequences
[2024-11-19 14:18:15,321 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [377077831]
[2024-11-19 14:18:15,321 INFO  L93    rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY
[2024-11-19 14:18:15,321 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2024-11-19 14:18:15,321 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3
[2024-11-19 14:18:15,323 INFO  L229       MonitoredProcess]: Starting monitored process 52 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2024-11-19 14:18:15,325 INFO  L327       MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (52)] Waiting until timeout for monitored process
[2024-11-19 14:18:15,438 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-19 14:18:15,446 INFO  L255         TraceCheckSpWp]: Trace formula consists of 313 conjuncts, 77 conjuncts are in the unsatisfiable core
[2024-11-19 14:18:15,448 INFO  L278         TraceCheckSpWp]: Computing forward predicates...
[2024-11-19 14:18:15,662 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-11-19 14:18:15,931 INFO  L349             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2024-11-19 14:18:15,931 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 11
[2024-11-19 14:18:15,951 INFO  L134       CoverageAnalysis]: Checked inductivity of 181 backedges. 51 proven. 126 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked.
[2024-11-19 14:18:15,951 INFO  L311         TraceCheckSpWp]: Computing backward predicates...
[2024-11-19 14:18:16,096 INFO  L349             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2024-11-19 14:18:16,096 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 119 treesize of output 95
[2024-11-19 14:18:16,517 INFO  L134       CoverageAnalysis]: Checked inductivity of 181 backedges. 51 proven. 126 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked.
[2024-11-19 14:18:16,517 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleZ3 [377077831] provided 0 perfect and 2 imperfect interpolant sequences
[2024-11-19 14:18:16,517 INFO  L185   FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences.
[2024-11-19 14:18:16,517 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 18, 18] total 48
[2024-11-19 14:18:16,518 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1013819873]
[2024-11-19 14:18:16,518 INFO  L85    oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton
[2024-11-19 14:18:17,182 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-11-19 14:18:17,182 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants.
[2024-11-19 14:18:17,183 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=157, Invalid=2099, Unknown=0, NotChecked=0, Total=2256
[2024-11-19 14:18:17,183 INFO  L87              Difference]: Start difference. First operand 90 states and 111 transitions. cyclomatic complexity: 27 Second operand  has 48 states, 48 states have (on average 2.4375) internal successors, (117), 48 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-11-19 14:18:19,265 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2024-11-19 14:18:19,265 INFO  L93              Difference]: Finished difference Result 356 states and 424 transitions.
[2024-11-19 14:18:19,265 INFO  L82        GeneralOperation]: Start removeNonLiveStates. Operand 356 states and 424 transitions.
[2024-11-19 14:18:19,267 INFO  L131   ngComponentsAnalysis]: Automaton has 4 accepting balls. 260
[2024-11-19 14:18:19,269 INFO  L88        GeneralOperation]: Finished removeNonLiveStates. Reduced from 356 states to 356 states and 424 transitions.
[2024-11-19 14:18:19,270 INFO  L87         BuchiClosureNwa]: Accepting states before buchiClosure: 288
[2024-11-19 14:18:19,270 INFO  L106        BuchiClosureNwa]: Accepting states after buchiClosure: 288
[2024-11-19 14:18:19,270 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 356 states and 424 transitions.
[2024-11-19 14:18:19,270 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is not deterministic.
[2024-11-19 14:18:19,270 INFO  L218   hiAutomatonCegarLoop]: Abstraction has 356 states and 424 transitions.
[2024-11-19 14:18:19,270 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 356 states and 424 transitions.
[2024-11-19 14:18:19,279 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 356 to 234.
[2024-11-19 14:18:19,279 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 234 states, 234 states have (on average 1.2222222222222223) internal successors, (286), 233 states have internal predecessors, (286), 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-11-19 14:18:19,280 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 234 states to 234 states and 286 transitions.
[2024-11-19 14:18:19,280 INFO  L240   hiAutomatonCegarLoop]: Abstraction has 234 states and 286 transitions.
[2024-11-19 14:18:19,281 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. 
[2024-11-19 14:18:19,282 INFO  L425   stractBuchiCegarLoop]: Abstraction has 234 states and 286 transitions.
[2024-11-19 14:18:19,282 INFO  L332   stractBuchiCegarLoop]: ======== Iteration 14 ============
[2024-11-19 14:18:19,282 INFO  L72            BuchiIsEmpty]: Start buchiIsEmpty. Operand 234 states and 286 transitions.
[2024-11-19 14:18:19,284 INFO  L131   ngComponentsAnalysis]: Automaton has 4 accepting balls. 172
[2024-11-19 14:18:19,284 INFO  L87            BuchiIsEmpty]: Finished buchiIsEmpty Result is false
[2024-11-19 14:18:19,284 INFO  L119           BuchiIsEmpty]: Starting construction of run
[2024-11-19 14:18:19,285 INFO  L148   hiAutomatonCegarLoop]: Counterexample stem histogram [5, 5, 4, 3, 2, 1, 1, 1, 1, 1]
[2024-11-19 14:18:19,285 INFO  L149   hiAutomatonCegarLoop]: Counterexample loop histogram [6, 6, 5, 4, 2, 1, 1, 1, 1, 1, 1]
[2024-11-19 14:18:19,285 INFO  L745   eck$LassoCheckResult]: Stem: 4485#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 4486#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet7#1, main_#t~malloc8#1.base, main_#t~malloc8#1.offset, main_#t~ret9#1.base, main_#t~ret9#1.offset, main_~in_len~0#1, main_~in~0#1.base, main_~in~0#1.offset;havoc main_#t~nondet7#1;main_~in_len~0#1 := main_#t~nondet7#1;havoc main_#t~nondet7#1; 4487#L531 assume !(main_~in_len~0#1 < 1);call main_#t~malloc8#1.base, main_#t~malloc8#1.offset := #Ultimate.allocOnStack(main_~in_len~0#1 % 18446744073709551616);main_~in~0#1.base, main_~in~0#1.offset := main_#t~malloc8#1.base, main_#t~malloc8#1.offset;call write~int#0(0, main_~in~0#1.base, main_~in~0#1.offset + (main_~in_len~0#1 - 1), 1);assume { :begin_inline_basename } true;basename_#in~path#1.base, basename_#in~path#1.offset := main_~in~0#1.base, main_~in~0#1.offset;havoc basename_#res#1.base, basename_#res#1.offset;havoc basename_#t~ret5#1.base, basename_#t~ret5#1.offset, basename_#t~mem6#1, basename_~path#1.base, basename_~path#1.offset, basename_~c~0#1.base, basename_~c~0#1.offset;basename_~path#1.base, basename_~path#1.offset := basename_#in~path#1.base, basename_#in~path#1.offset;havoc basename_~c~0#1.base, basename_~c~0#1.offset; 4488#L517 assume { :begin_inline_strrchr } true;strrchr_#in~t#1.base, strrchr_#in~t#1.offset, strrchr_#in~c#1 := basename_~path#1.base, basename_~path#1.offset, 47;havoc strrchr_#res#1.base, strrchr_#res#1.offset;havoc strrchr_#t~mem2#1, strrchr_#t~mem3#1, strrchr_#t~pre4#1.base, strrchr_#t~pre4#1.offset, strrchr_~t#1.base, strrchr_~t#1.offset, strrchr_~c#1, strrchr_~ch~0#1, strrchr_~l~0#1.base, strrchr_~l~0#1.offset;strrchr_~t#1.base, strrchr_~t#1.offset := strrchr_#in~t#1.base, strrchr_#in~t#1.offset;strrchr_~c#1 := strrchr_#in~c#1;havoc strrchr_~ch~0#1;strrchr_~l~0#1.base, strrchr_~l~0#1.offset := 0, 0;strrchr_~ch~0#1 := (if strrchr_~c#1 % 256 <= 127 then strrchr_~c#1 % 256 else strrchr_~c#1 % 256 - 256); 4527#L510-1 call strrchr_#t~mem2#1 := read~int#0(strrchr_~t#1.base, strrchr_~t#1.offset, 1); 4526#L511 assume !(strrchr_#t~mem2#1 == strrchr_~ch~0#1);havoc strrchr_#t~mem2#1; 4523#L511-2 call strrchr_#t~mem3#1 := read~int#0(strrchr_~t#1.base, strrchr_~t#1.offset, 1); 4524#L511-3 assume !(0 == strrchr_#t~mem3#1);havoc strrchr_#t~mem3#1;strrchr_#t~pre4#1.base, strrchr_#t~pre4#1.offset := strrchr_~t#1.base, 1 + strrchr_~t#1.offset;strrchr_~t#1.base, strrchr_~t#1.offset := strrchr_~t#1.base, 1 + strrchr_~t#1.offset;havoc strrchr_#t~pre4#1.base, strrchr_#t~pre4#1.offset; 4530#L510-1 call strrchr_#t~mem2#1 := read~int#0(strrchr_~t#1.base, strrchr_~t#1.offset, 1); 4528#L511 assume strrchr_#t~mem2#1 == strrchr_~ch~0#1;havoc strrchr_#t~mem2#1;strrchr_~l~0#1.base, strrchr_~l~0#1.offset := strrchr_~t#1.base, strrchr_~t#1.offset; 4529#L511-2 call strrchr_#t~mem3#1 := read~int#0(strrchr_~t#1.base, strrchr_~t#1.offset, 1); 4683#L511-3 assume !(0 == strrchr_#t~mem3#1);havoc strrchr_#t~mem3#1;strrchr_#t~pre4#1.base, strrchr_#t~pre4#1.offset := strrchr_~t#1.base, 1 + strrchr_~t#1.offset;strrchr_~t#1.base, strrchr_~t#1.offset := strrchr_~t#1.base, 1 + strrchr_~t#1.offset;havoc strrchr_#t~pre4#1.base, strrchr_#t~pre4#1.offset; 4682#L510-1 call strrchr_#t~mem2#1 := read~int#0(strrchr_~t#1.base, strrchr_~t#1.offset, 1); 4681#L511 assume !(strrchr_#t~mem2#1 == strrchr_~ch~0#1);havoc strrchr_#t~mem2#1; 4680#L511-2 call strrchr_#t~mem3#1 := read~int#0(strrchr_~t#1.base, strrchr_~t#1.offset, 1); 4679#L511-3 assume !(0 == strrchr_#t~mem3#1);havoc strrchr_#t~mem3#1;strrchr_#t~pre4#1.base, strrchr_#t~pre4#1.offset := strrchr_~t#1.base, 1 + strrchr_~t#1.offset;strrchr_~t#1.base, strrchr_~t#1.offset := strrchr_~t#1.base, 1 + strrchr_~t#1.offset;havoc strrchr_#t~pre4#1.base, strrchr_#t~pre4#1.offset; 4678#L510-1 call strrchr_#t~mem2#1 := read~int#0(strrchr_~t#1.base, strrchr_~t#1.offset, 1); 4516#L511 assume strrchr_#t~mem2#1 == strrchr_~ch~0#1;havoc strrchr_#t~mem2#1;strrchr_~l~0#1.base, strrchr_~l~0#1.offset := strrchr_~t#1.base, strrchr_~t#1.offset; 4517#L511-2 call strrchr_#t~mem3#1 := read~int#0(strrchr_~t#1.base, strrchr_~t#1.offset, 1); 4512#L511-3 assume !(0 == strrchr_#t~mem3#1);havoc strrchr_#t~mem3#1;strrchr_#t~pre4#1.base, strrchr_#t~pre4#1.offset := strrchr_~t#1.base, 1 + strrchr_~t#1.offset;strrchr_~t#1.base, strrchr_~t#1.offset := strrchr_~t#1.base, 1 + strrchr_~t#1.offset;havoc strrchr_#t~pre4#1.base, strrchr_#t~pre4#1.offset; 4513#L510-1 call strrchr_#t~mem2#1 := read~int#0(strrchr_~t#1.base, strrchr_~t#1.offset, 1); 4535#L511 assume !(strrchr_#t~mem2#1 == strrchr_~ch~0#1);havoc strrchr_#t~mem2#1; 4536#L511-2 call strrchr_#t~mem3#1 := read~int#0(strrchr_~t#1.base, strrchr_~t#1.offset, 1); 4502#L511-3 assume 0 == strrchr_#t~mem3#1;havoc strrchr_#t~mem3#1;strrchr_#res#1.base, strrchr_#res#1.offset := strrchr_~l~0#1.base, strrchr_~l~0#1.offset; 4503#strrchr_returnLabel#1 
[2024-11-19 14:18:19,285 INFO  L747   eck$LassoCheckResult]: Loop: 4503#strrchr_returnLabel#1 basename_#t~ret5#1.base, basename_#t~ret5#1.offset := strrchr_#res#1.base, strrchr_#res#1.offset;havoc strrchr_#t~mem2#1, strrchr_#t~mem3#1, strrchr_#t~pre4#1.base, strrchr_#t~pre4#1.offset, strrchr_~t#1.base, strrchr_~t#1.offset, strrchr_~c#1, strrchr_~ch~0#1, strrchr_~l~0#1.base, strrchr_~l~0#1.offset;havoc strrchr_#in~t#1.base, strrchr_#in~t#1.offset, strrchr_#in~c#1;assume { :end_inline_strrchr } true;basename_~c~0#1.base, basename_~c~0#1.offset := basename_#t~ret5#1.base, basename_#t~ret5#1.offset; 4596#L518 assume !(basename_~c~0#1.base == 0 && basename_~c~0#1.offset == 0);havoc basename_#t~ret5#1.base, basename_#t~ret5#1.offset;call basename_#t~mem6#1 := read~int#0(basename_~c~0#1.base, 1 + basename_~c~0#1.offset, 1); 4594#L519 assume 0 == basename_#t~mem6#1;havoc basename_#t~mem6#1; 4589#L520 assume !(basename_~c~0#1.base == basename_~path#1.base && basename_~c~0#1.offset == basename_~path#1.offset);call write~int#0(0, basename_~c~0#1.base, basename_~c~0#1.offset, 1); 4588#L517 assume { :begin_inline_strrchr } true;strrchr_#in~t#1.base, strrchr_#in~t#1.offset, strrchr_#in~c#1 := basename_~path#1.base, basename_~path#1.offset, 47;havoc strrchr_#res#1.base, strrchr_#res#1.offset;havoc strrchr_#t~mem2#1, strrchr_#t~mem3#1, strrchr_#t~pre4#1.base, strrchr_#t~pre4#1.offset, strrchr_~t#1.base, strrchr_~t#1.offset, strrchr_~c#1, strrchr_~ch~0#1, strrchr_~l~0#1.base, strrchr_~l~0#1.offset;strrchr_~t#1.base, strrchr_~t#1.offset := strrchr_#in~t#1.base, strrchr_#in~t#1.offset;strrchr_~c#1 := strrchr_#in~c#1;havoc strrchr_~ch~0#1;strrchr_~l~0#1.base, strrchr_~l~0#1.offset := 0, 0;strrchr_~ch~0#1 := (if strrchr_~c#1 % 256 <= 127 then strrchr_~c#1 % 256 else strrchr_~c#1 % 256 - 256); 4587#L510-1 call strrchr_#t~mem2#1 := read~int#0(strrchr_~t#1.base, strrchr_~t#1.offset, 1); 4586#L511 assume strrchr_#t~mem2#1 == strrchr_~ch~0#1;havoc strrchr_#t~mem2#1;strrchr_~l~0#1.base, strrchr_~l~0#1.offset := strrchr_~t#1.base, strrchr_~t#1.offset; 4584#L511-2 call strrchr_#t~mem3#1 := read~int#0(strrchr_~t#1.base, strrchr_~t#1.offset, 1); 4582#L511-3 assume !(0 == strrchr_#t~mem3#1);havoc strrchr_#t~mem3#1;strrchr_#t~pre4#1.base, strrchr_#t~pre4#1.offset := strrchr_~t#1.base, 1 + strrchr_~t#1.offset;strrchr_~t#1.base, strrchr_~t#1.offset := strrchr_~t#1.base, 1 + strrchr_~t#1.offset;havoc strrchr_#t~pre4#1.base, strrchr_#t~pre4#1.offset; 4580#L510-1 call strrchr_#t~mem2#1 := read~int#0(strrchr_~t#1.base, strrchr_~t#1.offset, 1); 4577#L511 assume strrchr_#t~mem2#1 == strrchr_~ch~0#1;havoc strrchr_#t~mem2#1;strrchr_~l~0#1.base, strrchr_~l~0#1.offset := strrchr_~t#1.base, strrchr_~t#1.offset; 4575#L511-2 call strrchr_#t~mem3#1 := read~int#0(strrchr_~t#1.base, strrchr_~t#1.offset, 1); 4576#L511-3 assume !(0 == strrchr_#t~mem3#1);havoc strrchr_#t~mem3#1;strrchr_#t~pre4#1.base, strrchr_#t~pre4#1.offset := strrchr_~t#1.base, 1 + strrchr_~t#1.offset;strrchr_~t#1.base, strrchr_~t#1.offset := strrchr_~t#1.base, 1 + strrchr_~t#1.offset;havoc strrchr_#t~pre4#1.base, strrchr_#t~pre4#1.offset; 4571#L510-1 call strrchr_#t~mem2#1 := read~int#0(strrchr_~t#1.base, strrchr_~t#1.offset, 1); 4572#L511 assume strrchr_#t~mem2#1 == strrchr_~ch~0#1;havoc strrchr_#t~mem2#1;strrchr_~l~0#1.base, strrchr_~l~0#1.offset := strrchr_~t#1.base, strrchr_~t#1.offset; 4708#L511-2 call strrchr_#t~mem3#1 := read~int#0(strrchr_~t#1.base, strrchr_~t#1.offset, 1); 4704#L511-3 assume !(0 == strrchr_#t~mem3#1);havoc strrchr_#t~mem3#1;strrchr_#t~pre4#1.base, strrchr_#t~pre4#1.offset := strrchr_~t#1.base, 1 + strrchr_~t#1.offset;strrchr_~t#1.base, strrchr_~t#1.offset := strrchr_~t#1.base, 1 + strrchr_~t#1.offset;havoc strrchr_#t~pre4#1.base, strrchr_#t~pre4#1.offset; 4698#L510-1 call strrchr_#t~mem2#1 := read~int#0(strrchr_~t#1.base, strrchr_~t#1.offset, 1); 4697#L511 assume !(strrchr_#t~mem2#1 == strrchr_~ch~0#1);havoc strrchr_#t~mem2#1; 4696#L511-2 call strrchr_#t~mem3#1 := read~int#0(strrchr_~t#1.base, strrchr_~t#1.offset, 1); 4694#L511-3 assume !(0 == strrchr_#t~mem3#1);havoc strrchr_#t~mem3#1;strrchr_#t~pre4#1.base, strrchr_#t~pre4#1.offset := strrchr_~t#1.base, 1 + strrchr_~t#1.offset;strrchr_~t#1.base, strrchr_~t#1.offset := strrchr_~t#1.base, 1 + strrchr_~t#1.offset;havoc strrchr_#t~pre4#1.base, strrchr_#t~pre4#1.offset; 4693#L510-1 call strrchr_#t~mem2#1 := read~int#0(strrchr_~t#1.base, strrchr_~t#1.offset, 1); 4691#L511 assume strrchr_#t~mem2#1 == strrchr_~ch~0#1;havoc strrchr_#t~mem2#1;strrchr_~l~0#1.base, strrchr_~l~0#1.offset := strrchr_~t#1.base, strrchr_~t#1.offset; 4690#L511-2 call strrchr_#t~mem3#1 := read~int#0(strrchr_~t#1.base, strrchr_~t#1.offset, 1); 4689#L511-3 assume !(0 == strrchr_#t~mem3#1);havoc strrchr_#t~mem3#1;strrchr_#t~pre4#1.base, strrchr_#t~pre4#1.offset := strrchr_~t#1.base, 1 + strrchr_~t#1.offset;strrchr_~t#1.base, strrchr_~t#1.offset := strrchr_~t#1.base, 1 + strrchr_~t#1.offset;havoc strrchr_#t~pre4#1.base, strrchr_#t~pre4#1.offset; 4688#L510-1 call strrchr_#t~mem2#1 := read~int#0(strrchr_~t#1.base, strrchr_~t#1.offset, 1); 4687#L511 assume !(strrchr_#t~mem2#1 == strrchr_~ch~0#1);havoc strrchr_#t~mem2#1; 4686#L511-2 call strrchr_#t~mem3#1 := read~int#0(strrchr_~t#1.base, strrchr_~t#1.offset, 1); 4546#L511-3 assume 0 == strrchr_#t~mem3#1;havoc strrchr_#t~mem3#1;strrchr_#res#1.base, strrchr_#res#1.offset := strrchr_~l~0#1.base, strrchr_~l~0#1.offset; 4503#strrchr_returnLabel#1 
[2024-11-19 14:18:19,286 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2024-11-19 14:18:19,286 INFO  L85        PathProgramCache]: Analyzing trace with hash -739661583, now seen corresponding path program 7 times
[2024-11-19 14:18:19,286 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-19 14:18:19,286 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1965759480]
[2024-11-19 14:18:19,286 INFO  L93    rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY
[2024-11-19 14:18:19,286 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-19 14:18:19,295 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is sat
[2024-11-19 14:18:19,295 INFO  L356             TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders.
[2024-11-19 14:18:19,301 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is sat
[2024-11-19 14:18:19,303 INFO  L130   FreeRefinementEngine]: Strategy CAMEL found a feasible trace
[2024-11-19 14:18:19,304 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2024-11-19 14:18:19,304 INFO  L85        PathProgramCache]: Analyzing trace with hash 1768073744, now seen corresponding path program 8 times
[2024-11-19 14:18:19,304 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-19 14:18:19,304 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1374792074]
[2024-11-19 14:18:19,304 INFO  L93    rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1
[2024-11-19 14:18:19,304 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-19 14:18:19,313 INFO  L227   tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s)
[2024-11-19 14:18:19,313 INFO  L228   tOrderPrioritization]: Conjunction of SSA is sat
[2024-11-19 14:18:19,313 INFO  L356             TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders.
[2024-11-19 14:18:19,318 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is sat
[2024-11-19 14:18:19,320 INFO  L130   FreeRefinementEngine]: Strategy CAMEL found a feasible trace
[2024-11-19 14:18:19,321 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2024-11-19 14:18:19,321 INFO  L85        PathProgramCache]: Analyzing trace with hash -1667569888, now seen corresponding path program 8 times
[2024-11-19 14:18:19,321 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-19 14:18:19,321 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [883439682]
[2024-11-19 14:18:19,321 INFO  L93    rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1
[2024-11-19 14:18:19,321 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-19 14:18:19,337 INFO  L227   tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s)
[2024-11-19 14:18:19,337 INFO  L228   tOrderPrioritization]: Conjunction of SSA is unsat
[2024-11-19 14:18:19,811 INFO  L134       CoverageAnalysis]: Checked inductivity of 221 backedges. 73 proven. 144 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked.
[2024-11-19 14:18:19,811 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-11-19 14:18:19,811 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [883439682]
[2024-11-19 14:18:19,812 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [883439682] provided 0 perfect and 1 imperfect interpolant sequences
[2024-11-19 14:18:19,812 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1397134597]
[2024-11-19 14:18:19,812 INFO  L93    rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1
[2024-11-19 14:18:19,812 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2024-11-19 14:18:19,812 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3
[2024-11-19 14:18:19,814 INFO  L229       MonitoredProcess]: Starting monitored process 53 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2024-11-19 14:18:19,815 INFO  L327       MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (53)] Waiting until timeout for monitored process
[2024-11-19 14:18:19,912 INFO  L227   tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s)
[2024-11-19 14:18:19,912 INFO  L228   tOrderPrioritization]: Conjunction of SSA is unsat
[2024-11-19 14:18:19,913 INFO  L255         TraceCheckSpWp]: Trace formula consists of 331 conjuncts, 75 conjuncts are in the unsatisfiable core
[2024-11-19 14:18:19,915 INFO  L278         TraceCheckSpWp]: Computing forward predicates...
[2024-11-19 14:18:20,059 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-11-19 14:18:20,103 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 7 treesize of output 3
[2024-11-19 14:18:20,104 INFO  L134       CoverageAnalysis]: Checked inductivity of 221 backedges. 73 proven. 142 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked.
[2024-11-19 14:18:20,104 INFO  L311         TraceCheckSpWp]: Computing backward predicates...
[2024-11-19 14:18:20,124 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 25
[2024-11-19 14:18:20,183 INFO  L134       CoverageAnalysis]: Checked inductivity of 221 backedges. 73 proven. 142 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked.
[2024-11-19 14:18:20,183 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleZ3 [1397134597] provided 0 perfect and 2 imperfect interpolant sequences
[2024-11-19 14:18:20,183 INFO  L185   FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences.
[2024-11-19 14:18:20,183 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 15, 15] total 26
[2024-11-19 14:18:20,183 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [709064376]
[2024-11-19 14:18:20,183 INFO  L85    oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton
[2024-11-19 14:18:20,833 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-11-19 14:18:20,833 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants.
[2024-11-19 14:18:20,833 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=69, Invalid=581, Unknown=0, NotChecked=0, Total=650
[2024-11-19 14:18:20,833 INFO  L87              Difference]: Start difference. First operand 234 states and 286 transitions. cyclomatic complexity: 62 Second operand  has 26 states, 26 states have (on average 3.1153846153846154) internal successors, (81), 26 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-11-19 14:18:21,176 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2024-11-19 14:18:21,176 INFO  L93              Difference]: Finished difference Result 186 states and 222 transitions.
[2024-11-19 14:18:21,176 INFO  L82        GeneralOperation]: Start removeNonLiveStates. Operand 186 states and 222 transitions.
[2024-11-19 14:18:21,177 INFO  L131   ngComponentsAnalysis]: Automaton has 2 accepting balls. 74
[2024-11-19 14:18:21,177 INFO  L88        GeneralOperation]: Finished removeNonLiveStates. Reduced from 186 states to 138 states and 167 transitions.
[2024-11-19 14:18:21,178 INFO  L87         BuchiClosureNwa]: Accepting states before buchiClosure: 87
[2024-11-19 14:18:21,178 INFO  L106        BuchiClosureNwa]: Accepting states after buchiClosure: 87
[2024-11-19 14:18:21,178 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 138 states and 167 transitions.
[2024-11-19 14:18:21,178 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is not deterministic.
[2024-11-19 14:18:21,178 INFO  L218   hiAutomatonCegarLoop]: Abstraction has 138 states and 167 transitions.
[2024-11-19 14:18:21,179 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 138 states and 167 transitions.
[2024-11-19 14:18:21,181 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 138 to 106.
[2024-11-19 14:18:21,181 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 106 states, 106 states have (on average 1.2358490566037736) internal successors, (131), 105 states have internal predecessors, (131), 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-11-19 14:18:21,182 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 131 transitions.
[2024-11-19 14:18:21,182 INFO  L240   hiAutomatonCegarLoop]: Abstraction has 106 states and 131 transitions.
[2024-11-19 14:18:21,182 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. 
[2024-11-19 14:18:21,183 INFO  L425   stractBuchiCegarLoop]: Abstraction has 106 states and 131 transitions.
[2024-11-19 14:18:21,183 INFO  L332   stractBuchiCegarLoop]: ======== Iteration 15 ============
[2024-11-19 14:18:21,183 INFO  L72            BuchiIsEmpty]: Start buchiIsEmpty. Operand 106 states and 131 transitions.
[2024-11-19 14:18:21,183 INFO  L131   ngComponentsAnalysis]: Automaton has 2 accepting balls. 58
[2024-11-19 14:18:21,184 INFO  L87            BuchiIsEmpty]: Finished buchiIsEmpty Result is false
[2024-11-19 14:18:21,184 INFO  L119           BuchiIsEmpty]: Starting construction of run
[2024-11-19 14:18:21,185 INFO  L148   hiAutomatonCegarLoop]: Counterexample stem histogram [6, 6, 5, 4, 2, 1, 1, 1, 1, 1]
[2024-11-19 14:18:21,185 INFO  L149   hiAutomatonCegarLoop]: Counterexample loop histogram [6, 6, 5, 5, 1, 1, 1, 1, 1, 1, 1]
[2024-11-19 14:18:21,185 INFO  L745   eck$LassoCheckResult]: Stem: 5261#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 5262#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet7#1, main_#t~malloc8#1.base, main_#t~malloc8#1.offset, main_#t~ret9#1.base, main_#t~ret9#1.offset, main_~in_len~0#1, main_~in~0#1.base, main_~in~0#1.offset;havoc main_#t~nondet7#1;main_~in_len~0#1 := main_#t~nondet7#1;havoc main_#t~nondet7#1; 5263#L531 assume !(main_~in_len~0#1 < 1);call main_#t~malloc8#1.base, main_#t~malloc8#1.offset := #Ultimate.allocOnStack(main_~in_len~0#1 % 18446744073709551616);main_~in~0#1.base, main_~in~0#1.offset := main_#t~malloc8#1.base, main_#t~malloc8#1.offset;call write~int#0(0, main_~in~0#1.base, main_~in~0#1.offset + (main_~in_len~0#1 - 1), 1);assume { :begin_inline_basename } true;basename_#in~path#1.base, basename_#in~path#1.offset := main_~in~0#1.base, main_~in~0#1.offset;havoc basename_#res#1.base, basename_#res#1.offset;havoc basename_#t~ret5#1.base, basename_#t~ret5#1.offset, basename_#t~mem6#1, basename_~path#1.base, basename_~path#1.offset, basename_~c~0#1.base, basename_~c~0#1.offset;basename_~path#1.base, basename_~path#1.offset := basename_#in~path#1.base, basename_#in~path#1.offset;havoc basename_~c~0#1.base, basename_~c~0#1.offset; 5264#L517 assume { :begin_inline_strrchr } true;strrchr_#in~t#1.base, strrchr_#in~t#1.offset, strrchr_#in~c#1 := basename_~path#1.base, basename_~path#1.offset, 47;havoc strrchr_#res#1.base, strrchr_#res#1.offset;havoc strrchr_#t~mem2#1, strrchr_#t~mem3#1, strrchr_#t~pre4#1.base, strrchr_#t~pre4#1.offset, strrchr_~t#1.base, strrchr_~t#1.offset, strrchr_~c#1, strrchr_~ch~0#1, strrchr_~l~0#1.base, strrchr_~l~0#1.offset;strrchr_~t#1.base, strrchr_~t#1.offset := strrchr_#in~t#1.base, strrchr_#in~t#1.offset;strrchr_~c#1 := strrchr_#in~c#1;havoc strrchr_~ch~0#1;strrchr_~l~0#1.base, strrchr_~l~0#1.offset := 0, 0;strrchr_~ch~0#1 := (if strrchr_~c#1 % 256 <= 127 then strrchr_~c#1 % 256 else strrchr_~c#1 % 256 - 256); 5310#L510-1 call strrchr_#t~mem2#1 := read~int#0(strrchr_~t#1.base, strrchr_~t#1.offset, 1); 5309#L511 assume !(strrchr_#t~mem2#1 == strrchr_~ch~0#1);havoc strrchr_#t~mem2#1; 5305#L511-2 call strrchr_#t~mem3#1 := read~int#0(strrchr_~t#1.base, strrchr_~t#1.offset, 1); 5306#L511-3 assume !(0 == strrchr_#t~mem3#1);havoc strrchr_#t~mem3#1;strrchr_#t~pre4#1.base, strrchr_#t~pre4#1.offset := strrchr_~t#1.base, 1 + strrchr_~t#1.offset;strrchr_~t#1.base, strrchr_~t#1.offset := strrchr_~t#1.base, 1 + strrchr_~t#1.offset;havoc strrchr_#t~pre4#1.base, strrchr_#t~pre4#1.offset; 5321#L510-1 call strrchr_#t~mem2#1 := read~int#0(strrchr_~t#1.base, strrchr_~t#1.offset, 1); 5319#L511 assume strrchr_#t~mem2#1 == strrchr_~ch~0#1;havoc strrchr_#t~mem2#1;strrchr_~l~0#1.base, strrchr_~l~0#1.offset := strrchr_~t#1.base, strrchr_~t#1.offset; 5307#L511-2 call strrchr_#t~mem3#1 := read~int#0(strrchr_~t#1.base, strrchr_~t#1.offset, 1); 5308#L511-3 assume !(0 == strrchr_#t~mem3#1);havoc strrchr_#t~mem3#1;strrchr_#t~pre4#1.base, strrchr_#t~pre4#1.offset := strrchr_~t#1.base, 1 + strrchr_~t#1.offset;strrchr_~t#1.base, strrchr_~t#1.offset := strrchr_~t#1.base, 1 + strrchr_~t#1.offset;havoc strrchr_#t~pre4#1.base, strrchr_#t~pre4#1.offset; 5259#L510-1 call strrchr_#t~mem2#1 := read~int#0(strrchr_~t#1.base, strrchr_~t#1.offset, 1); 5260#L511 assume !(strrchr_#t~mem2#1 == strrchr_~ch~0#1);havoc strrchr_#t~mem2#1; 5317#L511-2 call strrchr_#t~mem3#1 := read~int#0(strrchr_~t#1.base, strrchr_~t#1.offset, 1); 5318#L511-3 assume !(0 == strrchr_#t~mem3#1);havoc strrchr_#t~mem3#1;strrchr_#t~pre4#1.base, strrchr_#t~pre4#1.offset := strrchr_~t#1.base, 1 + strrchr_~t#1.offset;strrchr_~t#1.base, strrchr_~t#1.offset := strrchr_~t#1.base, 1 + strrchr_~t#1.offset;havoc strrchr_#t~pre4#1.base, strrchr_#t~pre4#1.offset; 5313#L510-1 call strrchr_#t~mem2#1 := read~int#0(strrchr_~t#1.base, strrchr_~t#1.offset, 1); 5314#L511 assume !(strrchr_#t~mem2#1 == strrchr_~ch~0#1);havoc strrchr_#t~mem2#1; 5339#L511-2 call strrchr_#t~mem3#1 := read~int#0(strrchr_~t#1.base, strrchr_~t#1.offset, 1); 5344#L511-3 assume !(0 == strrchr_#t~mem3#1);havoc strrchr_#t~mem3#1;strrchr_#t~pre4#1.base, strrchr_#t~pre4#1.offset := strrchr_~t#1.base, 1 + strrchr_~t#1.offset;strrchr_~t#1.base, strrchr_~t#1.offset := strrchr_~t#1.base, 1 + strrchr_~t#1.offset;havoc strrchr_#t~pre4#1.base, strrchr_#t~pre4#1.offset; 5343#L510-1 call strrchr_#t~mem2#1 := read~int#0(strrchr_~t#1.base, strrchr_~t#1.offset, 1); 5338#L511 assume strrchr_#t~mem2#1 == strrchr_~ch~0#1;havoc strrchr_#t~mem2#1;strrchr_~l~0#1.base, strrchr_~l~0#1.offset := strrchr_~t#1.base, strrchr_~t#1.offset; 5337#L511-2 call strrchr_#t~mem3#1 := read~int#0(strrchr_~t#1.base, strrchr_~t#1.offset, 1); 5336#L511-3 assume !(0 == strrchr_#t~mem3#1);havoc strrchr_#t~mem3#1;strrchr_#t~pre4#1.base, strrchr_#t~pre4#1.offset := strrchr_~t#1.base, 1 + strrchr_~t#1.offset;strrchr_~t#1.base, strrchr_~t#1.offset := strrchr_~t#1.base, 1 + strrchr_~t#1.offset;havoc strrchr_#t~pre4#1.base, strrchr_#t~pre4#1.offset; 5334#L510-1 call strrchr_#t~mem2#1 := read~int#0(strrchr_~t#1.base, strrchr_~t#1.offset, 1); 5294#L511 assume !(strrchr_#t~mem2#1 == strrchr_~ch~0#1);havoc strrchr_#t~mem2#1; 5292#L511-2 call strrchr_#t~mem3#1 := read~int#0(strrchr_~t#1.base, strrchr_~t#1.offset, 1); 5293#L511-3 assume 0 == strrchr_#t~mem3#1;havoc strrchr_#t~mem3#1;strrchr_#res#1.base, strrchr_#res#1.offset := strrchr_~l~0#1.base, strrchr_~l~0#1.offset; 5274#strrchr_returnLabel#1 
[2024-11-19 14:18:21,185 INFO  L747   eck$LassoCheckResult]: Loop: 5274#strrchr_returnLabel#1 basename_#t~ret5#1.base, basename_#t~ret5#1.offset := strrchr_#res#1.base, strrchr_#res#1.offset;havoc strrchr_#t~mem2#1, strrchr_#t~mem3#1, strrchr_#t~pre4#1.base, strrchr_#t~pre4#1.offset, strrchr_~t#1.base, strrchr_~t#1.offset, strrchr_~c#1, strrchr_~ch~0#1, strrchr_~l~0#1.base, strrchr_~l~0#1.offset;havoc strrchr_#in~t#1.base, strrchr_#in~t#1.offset, strrchr_#in~c#1;assume { :end_inline_strrchr } true;basename_~c~0#1.base, basename_~c~0#1.offset := basename_#t~ret5#1.base, basename_#t~ret5#1.offset; 5275#L518 assume !(basename_~c~0#1.base == 0 && basename_~c~0#1.offset == 0);havoc basename_#t~ret5#1.base, basename_#t~ret5#1.offset;call basename_#t~mem6#1 := read~int#0(basename_~c~0#1.base, 1 + basename_~c~0#1.offset, 1); 5276#L519 assume 0 == basename_#t~mem6#1;havoc basename_#t~mem6#1; 5277#L520 assume !(basename_~c~0#1.base == basename_~path#1.base && basename_~c~0#1.offset == basename_~path#1.offset);call write~int#0(0, basename_~c~0#1.base, basename_~c~0#1.offset, 1); 5272#L517 assume { :begin_inline_strrchr } true;strrchr_#in~t#1.base, strrchr_#in~t#1.offset, strrchr_#in~c#1 := basename_~path#1.base, basename_~path#1.offset, 47;havoc strrchr_#res#1.base, strrchr_#res#1.offset;havoc strrchr_#t~mem2#1, strrchr_#t~mem3#1, strrchr_#t~pre4#1.base, strrchr_#t~pre4#1.offset, strrchr_~t#1.base, strrchr_~t#1.offset, strrchr_~c#1, strrchr_~ch~0#1, strrchr_~l~0#1.base, strrchr_~l~0#1.offset;strrchr_~t#1.base, strrchr_~t#1.offset := strrchr_#in~t#1.base, strrchr_#in~t#1.offset;strrchr_~c#1 := strrchr_#in~c#1;havoc strrchr_~ch~0#1;strrchr_~l~0#1.base, strrchr_~l~0#1.offset := 0, 0;strrchr_~ch~0#1 := (if strrchr_~c#1 % 256 <= 127 then strrchr_~c#1 % 256 else strrchr_~c#1 % 256 - 256); 5273#L510-1 call strrchr_#t~mem2#1 := read~int#0(strrchr_~t#1.base, strrchr_~t#1.offset, 1); 5346#L511 assume strrchr_#t~mem2#1 == strrchr_~ch~0#1;havoc strrchr_#t~mem2#1;strrchr_~l~0#1.base, strrchr_~l~0#1.offset := strrchr_~t#1.base, strrchr_~t#1.offset; 5349#L511-2 call strrchr_#t~mem3#1 := read~int#0(strrchr_~t#1.base, strrchr_~t#1.offset, 1); 5347#L511-3 assume !(0 == strrchr_#t~mem3#1);havoc strrchr_#t~mem3#1;strrchr_#t~pre4#1.base, strrchr_#t~pre4#1.offset := strrchr_~t#1.base, 1 + strrchr_~t#1.offset;strrchr_~t#1.base, strrchr_~t#1.offset := strrchr_~t#1.base, 1 + strrchr_~t#1.offset;havoc strrchr_#t~pre4#1.base, strrchr_#t~pre4#1.offset; 5348#L510-1 call strrchr_#t~mem2#1 := read~int#0(strrchr_~t#1.base, strrchr_~t#1.offset, 1); 5323#L511 assume strrchr_#t~mem2#1 == strrchr_~ch~0#1;havoc strrchr_#t~mem2#1;strrchr_~l~0#1.base, strrchr_~l~0#1.offset := strrchr_~t#1.base, strrchr_~t#1.offset; 5324#L511-2 call strrchr_#t~mem3#1 := read~int#0(strrchr_~t#1.base, strrchr_~t#1.offset, 1); 5355#L511-3 assume !(0 == strrchr_#t~mem3#1);havoc strrchr_#t~mem3#1;strrchr_#t~pre4#1.base, strrchr_#t~pre4#1.offset := strrchr_~t#1.base, 1 + strrchr_~t#1.offset;strrchr_~t#1.base, strrchr_~t#1.offset := strrchr_~t#1.base, 1 + strrchr_~t#1.offset;havoc strrchr_#t~pre4#1.base, strrchr_#t~pre4#1.offset; 5354#L510-1 call strrchr_#t~mem2#1 := read~int#0(strrchr_~t#1.base, strrchr_~t#1.offset, 1); 5353#L511 assume strrchr_#t~mem2#1 == strrchr_~ch~0#1;havoc strrchr_#t~mem2#1;strrchr_~l~0#1.base, strrchr_~l~0#1.offset := strrchr_~t#1.base, strrchr_~t#1.offset; 5352#L511-2 call strrchr_#t~mem3#1 := read~int#0(strrchr_~t#1.base, strrchr_~t#1.offset, 1); 5351#L511-3 assume !(0 == strrchr_#t~mem3#1);havoc strrchr_#t~mem3#1;strrchr_#t~pre4#1.base, strrchr_#t~pre4#1.offset := strrchr_~t#1.base, 1 + strrchr_~t#1.offset;strrchr_~t#1.base, strrchr_~t#1.offset := strrchr_~t#1.base, 1 + strrchr_~t#1.offset;havoc strrchr_#t~pre4#1.base, strrchr_#t~pre4#1.offset; 5350#L510-1 call strrchr_#t~mem2#1 := read~int#0(strrchr_~t#1.base, strrchr_~t#1.offset, 1); 5250#L511 assume strrchr_#t~mem2#1 == strrchr_~ch~0#1;havoc strrchr_#t~mem2#1;strrchr_~l~0#1.base, strrchr_~l~0#1.offset := strrchr_~t#1.base, strrchr_~t#1.offset; 5251#L511-2 call strrchr_#t~mem3#1 := read~int#0(strrchr_~t#1.base, strrchr_~t#1.offset, 1); 5303#L511-3 assume !(0 == strrchr_#t~mem3#1);havoc strrchr_#t~mem3#1;strrchr_#t~pre4#1.base, strrchr_#t~pre4#1.offset := strrchr_~t#1.base, 1 + strrchr_~t#1.offset;strrchr_~t#1.base, strrchr_~t#1.offset := strrchr_~t#1.base, 1 + strrchr_~t#1.offset;havoc strrchr_#t~pre4#1.base, strrchr_#t~pre4#1.offset; 5304#L510-1 call strrchr_#t~mem2#1 := read~int#0(strrchr_~t#1.base, strrchr_~t#1.offset, 1); 5298#L511 assume strrchr_#t~mem2#1 == strrchr_~ch~0#1;havoc strrchr_#t~mem2#1;strrchr_~l~0#1.base, strrchr_~l~0#1.offset := strrchr_~t#1.base, strrchr_~t#1.offset; 5283#L511-2 call strrchr_#t~mem3#1 := read~int#0(strrchr_~t#1.base, strrchr_~t#1.offset, 1); 5290#L511-3 assume !(0 == strrchr_#t~mem3#1);havoc strrchr_#t~mem3#1;strrchr_#t~pre4#1.base, strrchr_#t~pre4#1.offset := strrchr_~t#1.base, 1 + strrchr_~t#1.offset;strrchr_~t#1.base, strrchr_~t#1.offset := strrchr_~t#1.base, 1 + strrchr_~t#1.offset;havoc strrchr_#t~pre4#1.base, strrchr_#t~pre4#1.offset; 5284#L510-1 call strrchr_#t~mem2#1 := read~int#0(strrchr_~t#1.base, strrchr_~t#1.offset, 1); 5282#L511 assume !(strrchr_#t~mem2#1 == strrchr_~ch~0#1);havoc strrchr_#t~mem2#1; 5280#L511-2 call strrchr_#t~mem3#1 := read~int#0(strrchr_~t#1.base, strrchr_~t#1.offset, 1); 5281#L511-3 assume 0 == strrchr_#t~mem3#1;havoc strrchr_#t~mem3#1;strrchr_#res#1.base, strrchr_#res#1.offset := strrchr_~l~0#1.base, strrchr_~l~0#1.offset; 5274#strrchr_returnLabel#1 
[2024-11-19 14:18:21,186 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2024-11-19 14:18:21,186 INFO  L85        PathProgramCache]: Analyzing trace with hash -1002891941, now seen corresponding path program 8 times
[2024-11-19 14:18:21,186 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-19 14:18:21,186 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [981111551]
[2024-11-19 14:18:21,186 INFO  L93    rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1
[2024-11-19 14:18:21,186 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-19 14:18:21,201 INFO  L227   tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s)
[2024-11-19 14:18:21,201 INFO  L228   tOrderPrioritization]: Conjunction of SSA is sat
[2024-11-19 14:18:21,201 INFO  L356             TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders.
[2024-11-19 14:18:21,208 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is sat
[2024-11-19 14:18:21,212 INFO  L130   FreeRefinementEngine]: Strategy CAMEL found a feasible trace
[2024-11-19 14:18:21,212 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2024-11-19 14:18:21,213 INFO  L85        PathProgramCache]: Analyzing trace with hash 1067009166, now seen corresponding path program 9 times
[2024-11-19 14:18:21,213 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-19 14:18:21,213 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1503248534]
[2024-11-19 14:18:21,213 INFO  L93    rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2
[2024-11-19 14:18:21,213 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-19 14:18:21,226 INFO  L227   tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s)
[2024-11-19 14:18:21,227 INFO  L228   tOrderPrioritization]: Conjunction of SSA is sat
[2024-11-19 14:18:21,227 INFO  L356             TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders.
[2024-11-19 14:18:21,233 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is sat
[2024-11-19 14:18:21,236 INFO  L130   FreeRefinementEngine]: Strategy CAMEL found a feasible trace
[2024-11-19 14:18:21,237 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2024-11-19 14:18:21,237 INFO  L85        PathProgramCache]: Analyzing trace with hash -1731680908, now seen corresponding path program 9 times
[2024-11-19 14:18:21,237 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-19 14:18:21,237 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1900709388]
[2024-11-19 14:18:21,237 INFO  L93    rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2
[2024-11-19 14:18:21,237 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-19 14:18:21,260 INFO  L227   tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s)
[2024-11-19 14:18:21,261 INFO  L228   tOrderPrioritization]: Conjunction of SSA is unsat
[2024-11-19 14:18:21,742 INFO  L134       CoverageAnalysis]: Checked inductivity of 265 backedges. 143 proven. 57 refuted. 0 times theorem prover too weak. 65 trivial. 0 not checked.
[2024-11-19 14:18:21,743 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-11-19 14:18:21,743 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1900709388]
[2024-11-19 14:18:21,743 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1900709388] provided 0 perfect and 1 imperfect interpolant sequences
[2024-11-19 14:18:21,743 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [166577250]
[2024-11-19 14:18:21,743 INFO  L93    rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2
[2024-11-19 14:18:21,743 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2024-11-19 14:18:21,744 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3
[2024-11-19 14:18:21,745 INFO  L229       MonitoredProcess]: Starting monitored process 54 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2024-11-19 14:18:21,747 INFO  L327       MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (54)] Waiting until timeout for monitored process
[2024-11-19 14:18:21,865 INFO  L227   tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s)
[2024-11-19 14:18:21,866 INFO  L228   tOrderPrioritization]: Conjunction of SSA is unsat
[2024-11-19 14:18:21,867 INFO  L255         TraceCheckSpWp]: Trace formula consists of 249 conjuncts, 58 conjuncts are in the unsatisfiable core
[2024-11-19 14:18:21,870 INFO  L278         TraceCheckSpWp]: Computing forward predicates...
[2024-11-19 14:18:21,874 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-11-19 14:18:22,122 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2024-11-19 14:18:22,123 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 12
[2024-11-19 14:18:22,154 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-11-19 14:18:22,176 INFO  L134       CoverageAnalysis]: Checked inductivity of 265 backedges. 172 proven. 26 refuted. 0 times theorem prover too weak. 67 trivial. 0 not checked.
[2024-11-19 14:18:22,176 INFO  L311         TraceCheckSpWp]: Computing backward predicates...
[2024-11-19 14:18:22,357 INFO  L134       CoverageAnalysis]: Checked inductivity of 265 backedges. 148 proven. 50 refuted. 0 times theorem prover too weak. 67 trivial. 0 not checked.
[2024-11-19 14:18:22,358 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleZ3 [166577250] provided 0 perfect and 2 imperfect interpolant sequences
[2024-11-19 14:18:22,358 INFO  L185   FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences.
[2024-11-19 14:18:22,358 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 13, 14] total 28
[2024-11-19 14:18:22,358 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [181443151]
[2024-11-19 14:18:22,358 INFO  L85    oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton
[2024-11-19 14:18:23,029 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-11-19 14:18:23,030 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants.
[2024-11-19 14:18:23,030 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=130, Invalid=626, Unknown=0, NotChecked=0, Total=756
[2024-11-19 14:18:23,030 INFO  L87              Difference]: Start difference. First operand 106 states and 131 transitions. cyclomatic complexity: 31 Second operand  has 28 states, 28 states have (on average 2.392857142857143) internal successors, (67), 28 states have internal predecessors, (67), 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-11-19 14:18:23,279 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2024-11-19 14:18:23,280 INFO  L93              Difference]: Finished difference Result 238 states and 289 transitions.
[2024-11-19 14:18:23,280 INFO  L82        GeneralOperation]: Start removeNonLiveStates. Operand 238 states and 289 transitions.
[2024-11-19 14:18:23,281 INFO  L131   ngComponentsAnalysis]: Automaton has 4 accepting balls. 130
[2024-11-19 14:18:23,282 INFO  L88        GeneralOperation]: Finished removeNonLiveStates. Reduced from 238 states to 238 states and 289 transitions.
[2024-11-19 14:18:23,282 INFO  L87         BuchiClosureNwa]: Accepting states before buchiClosure: 150
[2024-11-19 14:18:23,282 INFO  L106        BuchiClosureNwa]: Accepting states after buchiClosure: 150
[2024-11-19 14:18:23,283 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 238 states and 289 transitions.
[2024-11-19 14:18:23,283 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is not deterministic.
[2024-11-19 14:18:23,283 INFO  L218   hiAutomatonCegarLoop]: Abstraction has 238 states and 289 transitions.
[2024-11-19 14:18:23,283 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 238 states and 289 transitions.
[2024-11-19 14:18:23,286 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 238 to 206.
[2024-11-19 14:18:23,286 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 206 states, 206 states have (on average 1.2281553398058251) internal successors, (253), 205 states have internal predecessors, (253), 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-11-19 14:18:23,287 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 206 states to 206 states and 253 transitions.
[2024-11-19 14:18:23,288 INFO  L240   hiAutomatonCegarLoop]: Abstraction has 206 states and 253 transitions.
[2024-11-19 14:18:23,288 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. 
[2024-11-19 14:18:23,289 INFO  L425   stractBuchiCegarLoop]: Abstraction has 206 states and 253 transitions.
[2024-11-19 14:18:23,289 INFO  L332   stractBuchiCegarLoop]: ======== Iteration 16 ============
[2024-11-19 14:18:23,289 INFO  L72            BuchiIsEmpty]: Start buchiIsEmpty. Operand 206 states and 253 transitions.
[2024-11-19 14:18:23,290 INFO  L131   ngComponentsAnalysis]: Automaton has 4 accepting balls. 116
[2024-11-19 14:18:23,290 INFO  L87            BuchiIsEmpty]: Finished buchiIsEmpty Result is false
[2024-11-19 14:18:23,290 INFO  L119           BuchiIsEmpty]: Starting construction of run
[2024-11-19 14:18:23,291 INFO  L148   hiAutomatonCegarLoop]: Counterexample stem histogram [6, 6, 5, 3, 3, 1, 1, 1, 1, 1]
[2024-11-19 14:18:23,291 INFO  L149   hiAutomatonCegarLoop]: Counterexample loop histogram [6, 6, 5, 5, 1, 1, 1, 1, 1, 1, 1]
[2024-11-19 14:18:23,291 INFO  L745   eck$LassoCheckResult]: Stem: 5985#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 5986#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet7#1, main_#t~malloc8#1.base, main_#t~malloc8#1.offset, main_#t~ret9#1.base, main_#t~ret9#1.offset, main_~in_len~0#1, main_~in~0#1.base, main_~in~0#1.offset;havoc main_#t~nondet7#1;main_~in_len~0#1 := main_#t~nondet7#1;havoc main_#t~nondet7#1; 5987#L531 assume !(main_~in_len~0#1 < 1);call main_#t~malloc8#1.base, main_#t~malloc8#1.offset := #Ultimate.allocOnStack(main_~in_len~0#1 % 18446744073709551616);main_~in~0#1.base, main_~in~0#1.offset := main_#t~malloc8#1.base, main_#t~malloc8#1.offset;call write~int#0(0, main_~in~0#1.base, main_~in~0#1.offset + (main_~in_len~0#1 - 1), 1);assume { :begin_inline_basename } true;basename_#in~path#1.base, basename_#in~path#1.offset := main_~in~0#1.base, main_~in~0#1.offset;havoc basename_#res#1.base, basename_#res#1.offset;havoc basename_#t~ret5#1.base, basename_#t~ret5#1.offset, basename_#t~mem6#1, basename_~path#1.base, basename_~path#1.offset, basename_~c~0#1.base, basename_~c~0#1.offset;basename_~path#1.base, basename_~path#1.offset := basename_#in~path#1.base, basename_#in~path#1.offset;havoc basename_~c~0#1.base, basename_~c~0#1.offset; 5988#L517 assume { :begin_inline_strrchr } true;strrchr_#in~t#1.base, strrchr_#in~t#1.offset, strrchr_#in~c#1 := basename_~path#1.base, basename_~path#1.offset, 47;havoc strrchr_#res#1.base, strrchr_#res#1.offset;havoc strrchr_#t~mem2#1, strrchr_#t~mem3#1, strrchr_#t~pre4#1.base, strrchr_#t~pre4#1.offset, strrchr_~t#1.base, strrchr_~t#1.offset, strrchr_~c#1, strrchr_~ch~0#1, strrchr_~l~0#1.base, strrchr_~l~0#1.offset;strrchr_~t#1.base, strrchr_~t#1.offset := strrchr_#in~t#1.base, strrchr_#in~t#1.offset;strrchr_~c#1 := strrchr_#in~c#1;havoc strrchr_~ch~0#1;strrchr_~l~0#1.base, strrchr_~l~0#1.offset := 0, 0;strrchr_~ch~0#1 := (if strrchr_~c#1 % 256 <= 127 then strrchr_~c#1 % 256 else strrchr_~c#1 % 256 - 256); 6124#L510-1 call strrchr_#t~mem2#1 := read~int#0(strrchr_~t#1.base, strrchr_~t#1.offset, 1); 6123#L511 assume strrchr_#t~mem2#1 == strrchr_~ch~0#1;havoc strrchr_#t~mem2#1;strrchr_~l~0#1.base, strrchr_~l~0#1.offset := strrchr_~t#1.base, strrchr_~t#1.offset; 6122#L511-2 call strrchr_#t~mem3#1 := read~int#0(strrchr_~t#1.base, strrchr_~t#1.offset, 1); 6121#L511-3 assume !(0 == strrchr_#t~mem3#1);havoc strrchr_#t~mem3#1;strrchr_#t~pre4#1.base, strrchr_#t~pre4#1.offset := strrchr_~t#1.base, 1 + strrchr_~t#1.offset;strrchr_~t#1.base, strrchr_~t#1.offset := strrchr_~t#1.base, 1 + strrchr_~t#1.offset;havoc strrchr_#t~pre4#1.base, strrchr_#t~pre4#1.offset; 6119#L510-1 call strrchr_#t~mem2#1 := read~int#0(strrchr_~t#1.base, strrchr_~t#1.offset, 1); 6116#L511 assume strrchr_#t~mem2#1 == strrchr_~ch~0#1;havoc strrchr_#t~mem2#1;strrchr_~l~0#1.base, strrchr_~l~0#1.offset := strrchr_~t#1.base, strrchr_~t#1.offset; 6114#L511-2 call strrchr_#t~mem3#1 := read~int#0(strrchr_~t#1.base, strrchr_~t#1.offset, 1); 6112#L511-3 assume !(0 == strrchr_#t~mem3#1);havoc strrchr_#t~mem3#1;strrchr_#t~pre4#1.base, strrchr_#t~pre4#1.offset := strrchr_~t#1.base, 1 + strrchr_~t#1.offset;strrchr_~t#1.base, strrchr_~t#1.offset := strrchr_~t#1.base, 1 + strrchr_~t#1.offset;havoc strrchr_#t~pre4#1.base, strrchr_#t~pre4#1.offset; 6110#L510-1 call strrchr_#t~mem2#1 := read~int#0(strrchr_~t#1.base, strrchr_~t#1.offset, 1); 6108#L511 assume !(strrchr_#t~mem2#1 == strrchr_~ch~0#1);havoc strrchr_#t~mem2#1; 6106#L511-2 call strrchr_#t~mem3#1 := read~int#0(strrchr_~t#1.base, strrchr_~t#1.offset, 1); 6104#L511-3 assume !(0 == strrchr_#t~mem3#1);havoc strrchr_#t~mem3#1;strrchr_#t~pre4#1.base, strrchr_#t~pre4#1.offset := strrchr_~t#1.base, 1 + strrchr_~t#1.offset;strrchr_~t#1.base, strrchr_~t#1.offset := strrchr_~t#1.base, 1 + strrchr_~t#1.offset;havoc strrchr_#t~pre4#1.base, strrchr_#t~pre4#1.offset; 6103#L510-1 call strrchr_#t~mem2#1 := read~int#0(strrchr_~t#1.base, strrchr_~t#1.offset, 1); 6101#L511 assume !(strrchr_#t~mem2#1 == strrchr_~ch~0#1);havoc strrchr_#t~mem2#1; 6093#L511-2 call strrchr_#t~mem3#1 := read~int#0(strrchr_~t#1.base, strrchr_~t#1.offset, 1); 6098#L511-3 assume !(0 == strrchr_#t~mem3#1);havoc strrchr_#t~mem3#1;strrchr_#t~pre4#1.base, strrchr_#t~pre4#1.offset := strrchr_~t#1.base, 1 + strrchr_~t#1.offset;strrchr_~t#1.base, strrchr_~t#1.offset := strrchr_~t#1.base, 1 + strrchr_~t#1.offset;havoc strrchr_#t~pre4#1.base, strrchr_#t~pre4#1.offset; 6096#L510-1 call strrchr_#t~mem2#1 := read~int#0(strrchr_~t#1.base, strrchr_~t#1.offset, 1); 6092#L511 assume strrchr_#t~mem2#1 == strrchr_~ch~0#1;havoc strrchr_#t~mem2#1;strrchr_~l~0#1.base, strrchr_~l~0#1.offset := strrchr_~t#1.base, strrchr_~t#1.offset; 6089#L511-2 call strrchr_#t~mem3#1 := read~int#0(strrchr_~t#1.base, strrchr_~t#1.offset, 1); 6086#L511-3 assume !(0 == strrchr_#t~mem3#1);havoc strrchr_#t~mem3#1;strrchr_#t~pre4#1.base, strrchr_#t~pre4#1.offset := strrchr_~t#1.base, 1 + strrchr_~t#1.offset;strrchr_~t#1.base, strrchr_~t#1.offset := strrchr_~t#1.base, 1 + strrchr_~t#1.offset;havoc strrchr_#t~pre4#1.base, strrchr_#t~pre4#1.offset; 6081#L510-1 call strrchr_#t~mem2#1 := read~int#0(strrchr_~t#1.base, strrchr_~t#1.offset, 1); 6077#L511 assume !(strrchr_#t~mem2#1 == strrchr_~ch~0#1);havoc strrchr_#t~mem2#1; 6072#L511-2 call strrchr_#t~mem3#1 := read~int#0(strrchr_~t#1.base, strrchr_~t#1.offset, 1); 6067#L511-3 assume 0 == strrchr_#t~mem3#1;havoc strrchr_#t~mem3#1;strrchr_#res#1.base, strrchr_#res#1.offset := strrchr_~l~0#1.base, strrchr_~l~0#1.offset; 6063#strrchr_returnLabel#1 
[2024-11-19 14:18:23,291 INFO  L747   eck$LassoCheckResult]: Loop: 6063#strrchr_returnLabel#1 basename_#t~ret5#1.base, basename_#t~ret5#1.offset := strrchr_#res#1.base, strrchr_#res#1.offset;havoc strrchr_#t~mem2#1, strrchr_#t~mem3#1, strrchr_#t~pre4#1.base, strrchr_#t~pre4#1.offset, strrchr_~t#1.base, strrchr_~t#1.offset, strrchr_~c#1, strrchr_~ch~0#1, strrchr_~l~0#1.base, strrchr_~l~0#1.offset;havoc strrchr_#in~t#1.base, strrchr_#in~t#1.offset, strrchr_#in~c#1;assume { :end_inline_strrchr } true;basename_~c~0#1.base, basename_~c~0#1.offset := basename_#t~ret5#1.base, basename_#t~ret5#1.offset; 6061#L518 assume !(basename_~c~0#1.base == 0 && basename_~c~0#1.offset == 0);havoc basename_#t~ret5#1.base, basename_#t~ret5#1.offset;call basename_#t~mem6#1 := read~int#0(basename_~c~0#1.base, 1 + basename_~c~0#1.offset, 1); 6059#L519 assume 0 == basename_#t~mem6#1;havoc basename_#t~mem6#1; 6057#L520 assume !(basename_~c~0#1.base == basename_~path#1.base && basename_~c~0#1.offset == basename_~path#1.offset);call write~int#0(0, basename_~c~0#1.base, basename_~c~0#1.offset, 1); 6055#L517 assume { :begin_inline_strrchr } true;strrchr_#in~t#1.base, strrchr_#in~t#1.offset, strrchr_#in~c#1 := basename_~path#1.base, basename_~path#1.offset, 47;havoc strrchr_#res#1.base, strrchr_#res#1.offset;havoc strrchr_#t~mem2#1, strrchr_#t~mem3#1, strrchr_#t~pre4#1.base, strrchr_#t~pre4#1.offset, strrchr_~t#1.base, strrchr_~t#1.offset, strrchr_~c#1, strrchr_~ch~0#1, strrchr_~l~0#1.base, strrchr_~l~0#1.offset;strrchr_~t#1.base, strrchr_~t#1.offset := strrchr_#in~t#1.base, strrchr_#in~t#1.offset;strrchr_~c#1 := strrchr_#in~c#1;havoc strrchr_~ch~0#1;strrchr_~l~0#1.base, strrchr_~l~0#1.offset := 0, 0;strrchr_~ch~0#1 := (if strrchr_~c#1 % 256 <= 127 then strrchr_~c#1 % 256 else strrchr_~c#1 % 256 - 256); 6053#L510-1 call strrchr_#t~mem2#1 := read~int#0(strrchr_~t#1.base, strrchr_~t#1.offset, 1); 6050#L511 assume strrchr_#t~mem2#1 == strrchr_~ch~0#1;havoc strrchr_#t~mem2#1;strrchr_~l~0#1.base, strrchr_~l~0#1.offset := strrchr_~t#1.base, strrchr_~t#1.offset; 6048#L511-2 call strrchr_#t~mem3#1 := read~int#0(strrchr_~t#1.base, strrchr_~t#1.offset, 1); 6049#L511-3 assume !(0 == strrchr_#t~mem3#1);havoc strrchr_#t~mem3#1;strrchr_#t~pre4#1.base, strrchr_#t~pre4#1.offset := strrchr_~t#1.base, 1 + strrchr_~t#1.offset;strrchr_~t#1.base, strrchr_~t#1.offset := strrchr_~t#1.base, 1 + strrchr_~t#1.offset;havoc strrchr_#t~pre4#1.base, strrchr_#t~pre4#1.offset; 6042#L510-1 call strrchr_#t~mem2#1 := read~int#0(strrchr_~t#1.base, strrchr_~t#1.offset, 1); 6043#L511 assume strrchr_#t~mem2#1 == strrchr_~ch~0#1;havoc strrchr_#t~mem2#1;strrchr_~l~0#1.base, strrchr_~l~0#1.offset := strrchr_~t#1.base, strrchr_~t#1.offset; 6120#L511-2 call strrchr_#t~mem3#1 := read~int#0(strrchr_~t#1.base, strrchr_~t#1.offset, 1); 6118#L511-3 assume !(0 == strrchr_#t~mem3#1);havoc strrchr_#t~mem3#1;strrchr_#t~pre4#1.base, strrchr_#t~pre4#1.offset := strrchr_~t#1.base, 1 + strrchr_~t#1.offset;strrchr_~t#1.base, strrchr_~t#1.offset := strrchr_~t#1.base, 1 + strrchr_~t#1.offset;havoc strrchr_#t~pre4#1.base, strrchr_#t~pre4#1.offset; 6115#L510-1 call strrchr_#t~mem2#1 := read~int#0(strrchr_~t#1.base, strrchr_~t#1.offset, 1); 6113#L511 assume strrchr_#t~mem2#1 == strrchr_~ch~0#1;havoc strrchr_#t~mem2#1;strrchr_~l~0#1.base, strrchr_~l~0#1.offset := strrchr_~t#1.base, strrchr_~t#1.offset; 6111#L511-2 call strrchr_#t~mem3#1 := read~int#0(strrchr_~t#1.base, strrchr_~t#1.offset, 1); 6109#L511-3 assume !(0 == strrchr_#t~mem3#1);havoc strrchr_#t~mem3#1;strrchr_#t~pre4#1.base, strrchr_#t~pre4#1.offset := strrchr_~t#1.base, 1 + strrchr_~t#1.offset;strrchr_~t#1.base, strrchr_~t#1.offset := strrchr_~t#1.base, 1 + strrchr_~t#1.offset;havoc strrchr_#t~pre4#1.base, strrchr_#t~pre4#1.offset; 6107#L510-1 call strrchr_#t~mem2#1 := read~int#0(strrchr_~t#1.base, strrchr_~t#1.offset, 1); 6105#L511 assume strrchr_#t~mem2#1 == strrchr_~ch~0#1;havoc strrchr_#t~mem2#1;strrchr_~l~0#1.base, strrchr_~l~0#1.offset := strrchr_~t#1.base, strrchr_~t#1.offset; 6091#L511-2 call strrchr_#t~mem3#1 := read~int#0(strrchr_~t#1.base, strrchr_~t#1.offset, 1); 6102#L511-3 assume !(0 == strrchr_#t~mem3#1);havoc strrchr_#t~mem3#1;strrchr_#t~pre4#1.base, strrchr_#t~pre4#1.offset := strrchr_~t#1.base, 1 + strrchr_~t#1.offset;strrchr_~t#1.base, strrchr_~t#1.offset := strrchr_~t#1.base, 1 + strrchr_~t#1.offset;havoc strrchr_#t~pre4#1.base, strrchr_#t~pre4#1.offset; 6100#L510-1 call strrchr_#t~mem2#1 := read~int#0(strrchr_~t#1.base, strrchr_~t#1.offset, 1); 6090#L511 assume strrchr_#t~mem2#1 == strrchr_~ch~0#1;havoc strrchr_#t~mem2#1;strrchr_~l~0#1.base, strrchr_~l~0#1.offset := strrchr_~t#1.base, strrchr_~t#1.offset; 6076#L511-2 call strrchr_#t~mem3#1 := read~int#0(strrchr_~t#1.base, strrchr_~t#1.offset, 1); 6085#L511-3 assume !(0 == strrchr_#t~mem3#1);havoc strrchr_#t~mem3#1;strrchr_#t~pre4#1.base, strrchr_#t~pre4#1.offset := strrchr_~t#1.base, 1 + strrchr_~t#1.offset;strrchr_~t#1.base, strrchr_~t#1.offset := strrchr_~t#1.base, 1 + strrchr_~t#1.offset;havoc strrchr_#t~pre4#1.base, strrchr_#t~pre4#1.offset; 6066#L510-1 call strrchr_#t~mem2#1 := read~int#0(strrchr_~t#1.base, strrchr_~t#1.offset, 1); 6075#L511 assume !(strrchr_#t~mem2#1 == strrchr_~ch~0#1);havoc strrchr_#t~mem2#1; 6071#L511-2 call strrchr_#t~mem3#1 := read~int#0(strrchr_~t#1.base, strrchr_~t#1.offset, 1); 6065#L511-3 assume 0 == strrchr_#t~mem3#1;havoc strrchr_#t~mem3#1;strrchr_#res#1.base, strrchr_#res#1.offset := strrchr_~l~0#1.base, strrchr_~l~0#1.offset; 6063#strrchr_returnLabel#1 
[2024-11-19 14:18:23,292 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2024-11-19 14:18:23,292 INFO  L85        PathProgramCache]: Analyzing trace with hash 802546393, now seen corresponding path program 9 times
[2024-11-19 14:18:23,292 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-19 14:18:23,292 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [612481987]
[2024-11-19 14:18:23,292 INFO  L93    rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2
[2024-11-19 14:18:23,292 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-19 14:18:23,304 INFO  L227   tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s)
[2024-11-19 14:18:23,305 INFO  L228   tOrderPrioritization]: Conjunction of SSA is sat
[2024-11-19 14:18:23,305 INFO  L356             TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders.
[2024-11-19 14:18:23,310 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is sat
[2024-11-19 14:18:23,313 INFO  L130   FreeRefinementEngine]: Strategy CAMEL found a feasible trace
[2024-11-19 14:18:23,314 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2024-11-19 14:18:23,314 INFO  L85        PathProgramCache]: Analyzing trace with hash 1067009166, now seen corresponding path program 10 times
[2024-11-19 14:18:23,314 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-19 14:18:23,314 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [311353470]
[2024-11-19 14:18:23,314 INFO  L93    rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST
[2024-11-19 14:18:23,314 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-19 14:18:23,323 INFO  L227   tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s)
[2024-11-19 14:18:23,324 INFO  L228   tOrderPrioritization]: Conjunction of SSA is sat
[2024-11-19 14:18:23,324 INFO  L356             TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders.
[2024-11-19 14:18:23,329 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is sat
[2024-11-19 14:18:23,332 INFO  L130   FreeRefinementEngine]: Strategy CAMEL found a feasible trace
[2024-11-19 14:18:23,332 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2024-11-19 14:18:23,333 INFO  L85        PathProgramCache]: Analyzing trace with hash 1024946358, now seen corresponding path program 10 times
[2024-11-19 14:18:23,333 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-19 14:18:23,333 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [741620255]
[2024-11-19 14:18:23,333 INFO  L93    rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST
[2024-11-19 14:18:23,333 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-19 14:18:23,350 INFO  L227   tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s)
[2024-11-19 14:18:23,350 INFO  L228   tOrderPrioritization]: Conjunction of SSA is unsat
[2024-11-19 14:18:23,928 INFO  L134       CoverageAnalysis]: Checked inductivity of 265 backedges. 63 proven. 200 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked.
[2024-11-19 14:18:23,928 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-11-19 14:18:23,928 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [741620255]
[2024-11-19 14:18:23,928 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [741620255] provided 0 perfect and 1 imperfect interpolant sequences
[2024-11-19 14:18:23,929 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [217268403]
[2024-11-19 14:18:23,929 INFO  L93    rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST
[2024-11-19 14:18:23,929 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2024-11-19 14:18:23,929 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3
[2024-11-19 14:18:23,931 INFO  L229       MonitoredProcess]: Starting monitored process 55 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2024-11-19 14:18:23,932 INFO  L327       MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (55)] Waiting until timeout for monitored process
[2024-11-19 14:18:24,067 INFO  L227   tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s)
[2024-11-19 14:18:24,067 INFO  L228   tOrderPrioritization]: Conjunction of SSA is unsat
[2024-11-19 14:18:24,071 INFO  L255         TraceCheckSpWp]: Trace formula consists of 359 conjuncts, 93 conjuncts are in the unsatisfiable core
[2024-11-19 14:18:24,074 INFO  L278         TraceCheckSpWp]: Computing forward predicates...
[2024-11-19 14:18:24,422 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-11-19 14:18:24,805 INFO  L134       CoverageAnalysis]: Checked inductivity of 265 backedges. 63 proven. 198 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked.
[2024-11-19 14:18:24,805 INFO  L311         TraceCheckSpWp]: Computing backward predicates...
[2024-11-19 14:18:25,397 INFO  L349             Elim1Store]: treesize reduction 8, result has 68.0 percent of original size
[2024-11-19 14:18:25,398 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 145 treesize of output 133
[2024-11-19 14:18:25,903 INFO  L134       CoverageAnalysis]: Checked inductivity of 265 backedges. 14 proven. 249 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked.
[2024-11-19 14:18:25,903 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleZ3 [217268403] provided 0 perfect and 2 imperfect interpolant sequences
[2024-11-19 14:18:25,903 INFO  L185   FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences.
[2024-11-19 14:18:25,903 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 21, 22] total 61
[2024-11-19 14:18:25,904 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [717655318]
[2024-11-19 14:18:25,904 INFO  L85    oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton
[2024-11-19 14:18:26,543 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-11-19 14:18:26,543 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 61 interpolants.
[2024-11-19 14:18:26,544 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=218, Invalid=3442, Unknown=0, NotChecked=0, Total=3660
[2024-11-19 14:18:26,544 INFO  L87              Difference]: Start difference. First operand 206 states and 253 transitions. cyclomatic complexity: 59 Second operand  has 61 states, 61 states have (on average 2.5737704918032787) internal successors, (157), 61 states have internal predecessors, (157), 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-11-19 14:18:29,251 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2024-11-19 14:18:29,251 INFO  L93              Difference]: Finished difference Result 676 states and 814 transitions.
[2024-11-19 14:18:29,251 INFO  L82        GeneralOperation]: Start removeNonLiveStates. Operand 676 states and 814 transitions.
[2024-11-19 14:18:29,254 INFO  L131   ngComponentsAnalysis]: Automaton has 8 accepting balls. 496
[2024-11-19 14:18:29,257 INFO  L88        GeneralOperation]: Finished removeNonLiveStates. Reduced from 676 states to 676 states and 814 transitions.
[2024-11-19 14:18:29,257 INFO  L87         BuchiClosureNwa]: Accepting states before buchiClosure: 544
[2024-11-19 14:18:29,258 INFO  L106        BuchiClosureNwa]: Accepting states after buchiClosure: 544
[2024-11-19 14:18:29,258 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 676 states and 814 transitions.
[2024-11-19 14:18:29,258 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is not deterministic.
[2024-11-19 14:18:29,259 INFO  L218   hiAutomatonCegarLoop]: Abstraction has 676 states and 814 transitions.
[2024-11-19 14:18:29,259 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 676 states and 814 transitions.
[2024-11-19 14:18:29,267 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 676 to 550.
[2024-11-19 14:18:29,268 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 550 states, 550 states have (on average 1.2236363636363636) internal successors, (673), 549 states have internal predecessors, (673), 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-11-19 14:18:29,270 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 550 states to 550 states and 673 transitions.
[2024-11-19 14:18:29,270 INFO  L240   hiAutomatonCegarLoop]: Abstraction has 550 states and 673 transitions.
[2024-11-19 14:18:29,270 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 53 states. 
[2024-11-19 14:18:29,272 INFO  L425   stractBuchiCegarLoop]: Abstraction has 550 states and 673 transitions.
[2024-11-19 14:18:29,272 INFO  L332   stractBuchiCegarLoop]: ======== Iteration 17 ============
[2024-11-19 14:18:29,272 INFO  L72            BuchiIsEmpty]: Start buchiIsEmpty. Operand 550 states and 673 transitions.
[2024-11-19 14:18:29,274 INFO  L131   ngComponentsAnalysis]: Automaton has 8 accepting balls. 416
[2024-11-19 14:18:29,274 INFO  L87            BuchiIsEmpty]: Finished buchiIsEmpty Result is false
[2024-11-19 14:18:29,274 INFO  L119           BuchiIsEmpty]: Starting construction of run
[2024-11-19 14:18:29,275 INFO  L148   hiAutomatonCegarLoop]: Counterexample stem histogram [6, 6, 5, 3, 3, 1, 1, 1, 1, 1]
[2024-11-19 14:18:29,275 INFO  L149   hiAutomatonCegarLoop]: Counterexample loop histogram [7, 7, 6, 5, 2, 1, 1, 1, 1, 1, 1]
[2024-11-19 14:18:29,275 INFO  L745   eck$LassoCheckResult]: Stem: 7353#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 7354#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet7#1, main_#t~malloc8#1.base, main_#t~malloc8#1.offset, main_#t~ret9#1.base, main_#t~ret9#1.offset, main_~in_len~0#1, main_~in~0#1.base, main_~in~0#1.offset;havoc main_#t~nondet7#1;main_~in_len~0#1 := main_#t~nondet7#1;havoc main_#t~nondet7#1; 7355#L531 assume !(main_~in_len~0#1 < 1);call main_#t~malloc8#1.base, main_#t~malloc8#1.offset := #Ultimate.allocOnStack(main_~in_len~0#1 % 18446744073709551616);main_~in~0#1.base, main_~in~0#1.offset := main_#t~malloc8#1.base, main_#t~malloc8#1.offset;call write~int#0(0, main_~in~0#1.base, main_~in~0#1.offset + (main_~in_len~0#1 - 1), 1);assume { :begin_inline_basename } true;basename_#in~path#1.base, basename_#in~path#1.offset := main_~in~0#1.base, main_~in~0#1.offset;havoc basename_#res#1.base, basename_#res#1.offset;havoc basename_#t~ret5#1.base, basename_#t~ret5#1.offset, basename_#t~mem6#1, basename_~path#1.base, basename_~path#1.offset, basename_~c~0#1.base, basename_~c~0#1.offset;basename_~path#1.base, basename_~path#1.offset := basename_#in~path#1.base, basename_#in~path#1.offset;havoc basename_~c~0#1.base, basename_~c~0#1.offset; 7356#L517 assume { :begin_inline_strrchr } true;strrchr_#in~t#1.base, strrchr_#in~t#1.offset, strrchr_#in~c#1 := basename_~path#1.base, basename_~path#1.offset, 47;havoc strrchr_#res#1.base, strrchr_#res#1.offset;havoc strrchr_#t~mem2#1, strrchr_#t~mem3#1, strrchr_#t~pre4#1.base, strrchr_#t~pre4#1.offset, strrchr_~t#1.base, strrchr_~t#1.offset, strrchr_~c#1, strrchr_~ch~0#1, strrchr_~l~0#1.base, strrchr_~l~0#1.offset;strrchr_~t#1.base, strrchr_~t#1.offset := strrchr_#in~t#1.base, strrchr_#in~t#1.offset;strrchr_~c#1 := strrchr_#in~c#1;havoc strrchr_~ch~0#1;strrchr_~l~0#1.base, strrchr_~l~0#1.offset := 0, 0;strrchr_~ch~0#1 := (if strrchr_~c#1 % 256 <= 127 then strrchr_~c#1 % 256 else strrchr_~c#1 % 256 - 256); 7407#L510-1 call strrchr_#t~mem2#1 := read~int#0(strrchr_~t#1.base, strrchr_~t#1.offset, 1); 7405#L511 assume strrchr_#t~mem2#1 == strrchr_~ch~0#1;havoc strrchr_#t~mem2#1;strrchr_~l~0#1.base, strrchr_~l~0#1.offset := strrchr_~t#1.base, strrchr_~t#1.offset; 7406#L511-2 call strrchr_#t~mem3#1 := read~int#0(strrchr_~t#1.base, strrchr_~t#1.offset, 1); 7401#L511-3 assume !(0 == strrchr_#t~mem3#1);havoc strrchr_#t~mem3#1;strrchr_#t~pre4#1.base, strrchr_#t~pre4#1.offset := strrchr_~t#1.base, 1 + strrchr_~t#1.offset;strrchr_~t#1.base, strrchr_~t#1.offset := strrchr_~t#1.base, 1 + strrchr_~t#1.offset;havoc strrchr_#t~pre4#1.base, strrchr_#t~pre4#1.offset; 7402#L510-1 call strrchr_#t~mem2#1 := read~int#0(strrchr_~t#1.base, strrchr_~t#1.offset, 1); 7343#L511 assume strrchr_#t~mem2#1 == strrchr_~ch~0#1;havoc strrchr_#t~mem2#1;strrchr_~l~0#1.base, strrchr_~l~0#1.offset := strrchr_~t#1.base, strrchr_~t#1.offset; 7344#L511-2 call strrchr_#t~mem3#1 := read~int#0(strrchr_~t#1.base, strrchr_~t#1.offset, 1); 7775#L511-3 assume !(0 == strrchr_#t~mem3#1);havoc strrchr_#t~mem3#1;strrchr_#t~pre4#1.base, strrchr_#t~pre4#1.offset := strrchr_~t#1.base, 1 + strrchr_~t#1.offset;strrchr_~t#1.base, strrchr_~t#1.offset := strrchr_~t#1.base, 1 + strrchr_~t#1.offset;havoc strrchr_#t~pre4#1.base, strrchr_#t~pre4#1.offset; 7774#L510-1 call strrchr_#t~mem2#1 := read~int#0(strrchr_~t#1.base, strrchr_~t#1.offset, 1); 7773#L511 assume !(strrchr_#t~mem2#1 == strrchr_~ch~0#1);havoc strrchr_#t~mem2#1; 7772#L511-2 call strrchr_#t~mem3#1 := read~int#0(strrchr_~t#1.base, strrchr_~t#1.offset, 1); 7771#L511-3 assume !(0 == strrchr_#t~mem3#1);havoc strrchr_#t~mem3#1;strrchr_#t~pre4#1.base, strrchr_#t~pre4#1.offset := strrchr_~t#1.base, 1 + strrchr_~t#1.offset;strrchr_~t#1.base, strrchr_~t#1.offset := strrchr_~t#1.base, 1 + strrchr_~t#1.offset;havoc strrchr_#t~pre4#1.base, strrchr_#t~pre4#1.offset; 7770#L510-1 call strrchr_#t~mem2#1 := read~int#0(strrchr_~t#1.base, strrchr_~t#1.offset, 1); 7769#L511 assume !(strrchr_#t~mem2#1 == strrchr_~ch~0#1);havoc strrchr_#t~mem2#1; 7768#L511-2 call strrchr_#t~mem3#1 := read~int#0(strrchr_~t#1.base, strrchr_~t#1.offset, 1); 7767#L511-3 assume !(0 == strrchr_#t~mem3#1);havoc strrchr_#t~mem3#1;strrchr_#t~pre4#1.base, strrchr_#t~pre4#1.offset := strrchr_~t#1.base, 1 + strrchr_~t#1.offset;strrchr_~t#1.base, strrchr_~t#1.offset := strrchr_~t#1.base, 1 + strrchr_~t#1.offset;havoc strrchr_#t~pre4#1.base, strrchr_#t~pre4#1.offset; 7766#L510-1 call strrchr_#t~mem2#1 := read~int#0(strrchr_~t#1.base, strrchr_~t#1.offset, 1); 7765#L511 assume strrchr_#t~mem2#1 == strrchr_~ch~0#1;havoc strrchr_#t~mem2#1;strrchr_~l~0#1.base, strrchr_~l~0#1.offset := strrchr_~t#1.base, strrchr_~t#1.offset; 7386#L511-2 call strrchr_#t~mem3#1 := read~int#0(strrchr_~t#1.base, strrchr_~t#1.offset, 1); 7379#L511-3 assume !(0 == strrchr_#t~mem3#1);havoc strrchr_#t~mem3#1;strrchr_#t~pre4#1.base, strrchr_#t~pre4#1.offset := strrchr_~t#1.base, 1 + strrchr_~t#1.offset;strrchr_~t#1.base, strrchr_~t#1.offset := strrchr_~t#1.base, 1 + strrchr_~t#1.offset;havoc strrchr_#t~pre4#1.base, strrchr_#t~pre4#1.offset; 7380#L510-1 call strrchr_#t~mem2#1 := read~int#0(strrchr_~t#1.base, strrchr_~t#1.offset, 1); 7523#L511 assume !(strrchr_#t~mem2#1 == strrchr_~ch~0#1);havoc strrchr_#t~mem2#1; 7514#L511-2 call strrchr_#t~mem3#1 := read~int#0(strrchr_~t#1.base, strrchr_~t#1.offset, 1); 7515#L511-3 assume 0 == strrchr_#t~mem3#1;havoc strrchr_#t~mem3#1;strrchr_#res#1.base, strrchr_#res#1.offset := strrchr_~l~0#1.base, strrchr_~l~0#1.offset; 7494#strrchr_returnLabel#1 
[2024-11-19 14:18:29,275 INFO  L747   eck$LassoCheckResult]: Loop: 7494#strrchr_returnLabel#1 basename_#t~ret5#1.base, basename_#t~ret5#1.offset := strrchr_#res#1.base, strrchr_#res#1.offset;havoc strrchr_#t~mem2#1, strrchr_#t~mem3#1, strrchr_#t~pre4#1.base, strrchr_#t~pre4#1.offset, strrchr_~t#1.base, strrchr_~t#1.offset, strrchr_~c#1, strrchr_~ch~0#1, strrchr_~l~0#1.base, strrchr_~l~0#1.offset;havoc strrchr_#in~t#1.base, strrchr_#in~t#1.offset, strrchr_#in~c#1;assume { :end_inline_strrchr } true;basename_~c~0#1.base, basename_~c~0#1.offset := basename_#t~ret5#1.base, basename_#t~ret5#1.offset; 7492#L518 assume !(basename_~c~0#1.base == 0 && basename_~c~0#1.offset == 0);havoc basename_#t~ret5#1.base, basename_#t~ret5#1.offset;call basename_#t~mem6#1 := read~int#0(basename_~c~0#1.base, 1 + basename_~c~0#1.offset, 1); 7490#L519 assume 0 == basename_#t~mem6#1;havoc basename_#t~mem6#1; 7488#L520 assume !(basename_~c~0#1.base == basename_~path#1.base && basename_~c~0#1.offset == basename_~path#1.offset);call write~int#0(0, basename_~c~0#1.base, basename_~c~0#1.offset, 1); 7486#L517 assume { :begin_inline_strrchr } true;strrchr_#in~t#1.base, strrchr_#in~t#1.offset, strrchr_#in~c#1 := basename_~path#1.base, basename_~path#1.offset, 47;havoc strrchr_#res#1.base, strrchr_#res#1.offset;havoc strrchr_#t~mem2#1, strrchr_#t~mem3#1, strrchr_#t~pre4#1.base, strrchr_#t~pre4#1.offset, strrchr_~t#1.base, strrchr_~t#1.offset, strrchr_~c#1, strrchr_~ch~0#1, strrchr_~l~0#1.base, strrchr_~l~0#1.offset;strrchr_~t#1.base, strrchr_~t#1.offset := strrchr_#in~t#1.base, strrchr_#in~t#1.offset;strrchr_~c#1 := strrchr_#in~c#1;havoc strrchr_~ch~0#1;strrchr_~l~0#1.base, strrchr_~l~0#1.offset := 0, 0;strrchr_~ch~0#1 := (if strrchr_~c#1 % 256 <= 127 then strrchr_~c#1 % 256 else strrchr_~c#1 % 256 - 256); 7484#L510-1 call strrchr_#t~mem2#1 := read~int#0(strrchr_~t#1.base, strrchr_~t#1.offset, 1); 7481#L511 assume strrchr_#t~mem2#1 == strrchr_~ch~0#1;havoc strrchr_#t~mem2#1;strrchr_~l~0#1.base, strrchr_~l~0#1.offset := strrchr_~t#1.base, strrchr_~t#1.offset; 7482#L511-2 call strrchr_#t~mem3#1 := read~int#0(strrchr_~t#1.base, strrchr_~t#1.offset, 1); 7475#L511-3 assume !(0 == strrchr_#t~mem3#1);havoc strrchr_#t~mem3#1;strrchr_#t~pre4#1.base, strrchr_#t~pre4#1.offset := strrchr_~t#1.base, 1 + strrchr_~t#1.offset;strrchr_~t#1.base, strrchr_~t#1.offset := strrchr_~t#1.base, 1 + strrchr_~t#1.offset;havoc strrchr_#t~pre4#1.base, strrchr_#t~pre4#1.offset; 7476#L510-1 call strrchr_#t~mem2#1 := read~int#0(strrchr_~t#1.base, strrchr_~t#1.offset, 1); 7467#L511 assume strrchr_#t~mem2#1 == strrchr_~ch~0#1;havoc strrchr_#t~mem2#1;strrchr_~l~0#1.base, strrchr_~l~0#1.offset := strrchr_~t#1.base, strrchr_~t#1.offset; 7466#L511-2 call strrchr_#t~mem3#1 := read~int#0(strrchr_~t#1.base, strrchr_~t#1.offset, 1); 7465#L511-3 assume !(0 == strrchr_#t~mem3#1);havoc strrchr_#t~mem3#1;strrchr_#t~pre4#1.base, strrchr_#t~pre4#1.offset := strrchr_~t#1.base, 1 + strrchr_~t#1.offset;strrchr_~t#1.base, strrchr_~t#1.offset := strrchr_~t#1.base, 1 + strrchr_~t#1.offset;havoc strrchr_#t~pre4#1.base, strrchr_#t~pre4#1.offset; 7464#L510-1 call strrchr_#t~mem2#1 := read~int#0(strrchr_~t#1.base, strrchr_~t#1.offset, 1); 7463#L511 assume strrchr_#t~mem2#1 == strrchr_~ch~0#1;havoc strrchr_#t~mem2#1;strrchr_~l~0#1.base, strrchr_~l~0#1.offset := strrchr_~t#1.base, strrchr_~t#1.offset; 7462#L511-2 call strrchr_#t~mem3#1 := read~int#0(strrchr_~t#1.base, strrchr_~t#1.offset, 1); 7461#L511-3 assume !(0 == strrchr_#t~mem3#1);havoc strrchr_#t~mem3#1;strrchr_#t~pre4#1.base, strrchr_#t~pre4#1.offset := strrchr_~t#1.base, 1 + strrchr_~t#1.offset;strrchr_~t#1.base, strrchr_~t#1.offset := strrchr_~t#1.base, 1 + strrchr_~t#1.offset;havoc strrchr_#t~pre4#1.base, strrchr_#t~pre4#1.offset; 7460#L510-1 call strrchr_#t~mem2#1 := read~int#0(strrchr_~t#1.base, strrchr_~t#1.offset, 1); 7459#L511 assume strrchr_#t~mem2#1 == strrchr_~ch~0#1;havoc strrchr_#t~mem2#1;strrchr_~l~0#1.base, strrchr_~l~0#1.offset := strrchr_~t#1.base, strrchr_~t#1.offset; 7458#L511-2 call strrchr_#t~mem3#1 := read~int#0(strrchr_~t#1.base, strrchr_~t#1.offset, 1); 7457#L511-3 assume !(0 == strrchr_#t~mem3#1);havoc strrchr_#t~mem3#1;strrchr_#t~pre4#1.base, strrchr_#t~pre4#1.offset := strrchr_~t#1.base, 1 + strrchr_~t#1.offset;strrchr_~t#1.base, strrchr_~t#1.offset := strrchr_~t#1.base, 1 + strrchr_~t#1.offset;havoc strrchr_#t~pre4#1.base, strrchr_#t~pre4#1.offset; 7456#L510-1 call strrchr_#t~mem2#1 := read~int#0(strrchr_~t#1.base, strrchr_~t#1.offset, 1); 7455#L511 assume !(strrchr_#t~mem2#1 == strrchr_~ch~0#1);havoc strrchr_#t~mem2#1; 7454#L511-2 call strrchr_#t~mem3#1 := read~int#0(strrchr_~t#1.base, strrchr_~t#1.offset, 1); 7451#L511-3 assume !(0 == strrchr_#t~mem3#1);havoc strrchr_#t~mem3#1;strrchr_#t~pre4#1.base, strrchr_#t~pre4#1.offset := strrchr_~t#1.base, 1 + strrchr_~t#1.offset;strrchr_~t#1.base, strrchr_~t#1.offset := strrchr_~t#1.base, 1 + strrchr_~t#1.offset;havoc strrchr_#t~pre4#1.base, strrchr_#t~pre4#1.offset; 7447#L510-1 call strrchr_#t~mem2#1 := read~int#0(strrchr_~t#1.base, strrchr_~t#1.offset, 1); 7442#L511 assume strrchr_#t~mem2#1 == strrchr_~ch~0#1;havoc strrchr_#t~mem2#1;strrchr_~l~0#1.base, strrchr_~l~0#1.offset := strrchr_~t#1.base, strrchr_~t#1.offset; 7441#L511-2 call strrchr_#t~mem3#1 := read~int#0(strrchr_~t#1.base, strrchr_~t#1.offset, 1); 7440#L511-3 assume !(0 == strrchr_#t~mem3#1);havoc strrchr_#t~mem3#1;strrchr_#t~pre4#1.base, strrchr_#t~pre4#1.offset := strrchr_~t#1.base, 1 + strrchr_~t#1.offset;strrchr_~t#1.base, strrchr_~t#1.offset := strrchr_~t#1.base, 1 + strrchr_~t#1.offset;havoc strrchr_#t~pre4#1.base, strrchr_#t~pre4#1.offset; 7439#L510-1 call strrchr_#t~mem2#1 := read~int#0(strrchr_~t#1.base, strrchr_~t#1.offset, 1); 7437#L511 assume !(strrchr_#t~mem2#1 == strrchr_~ch~0#1);havoc strrchr_#t~mem2#1; 7438#L511-2 call strrchr_#t~mem3#1 := read~int#0(strrchr_~t#1.base, strrchr_~t#1.offset, 1); 7848#L511-3 assume 0 == strrchr_#t~mem3#1;havoc strrchr_#t~mem3#1;strrchr_#res#1.base, strrchr_#res#1.offset := strrchr_~l~0#1.base, strrchr_~l~0#1.offset; 7494#strrchr_returnLabel#1 
[2024-11-19 14:18:29,276 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2024-11-19 14:18:29,276 INFO  L85        PathProgramCache]: Analyzing trace with hash 802546393, now seen corresponding path program 10 times
[2024-11-19 14:18:29,276 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-19 14:18:29,276 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [43723851]
[2024-11-19 14:18:29,276 INFO  L93    rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST
[2024-11-19 14:18:29,276 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-19 14:18:29,288 INFO  L227   tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s)
[2024-11-19 14:18:29,289 INFO  L228   tOrderPrioritization]: Conjunction of SSA is sat
[2024-11-19 14:18:29,289 INFO  L356             TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders.
[2024-11-19 14:18:29,300 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is sat
[2024-11-19 14:18:29,303 INFO  L130   FreeRefinementEngine]: Strategy CAMEL found a feasible trace
[2024-11-19 14:18:29,304 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2024-11-19 14:18:29,304 INFO  L85        PathProgramCache]: Analyzing trace with hash 1363647096, now seen corresponding path program 11 times
[2024-11-19 14:18:29,304 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-19 14:18:29,304 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [87985862]
[2024-11-19 14:18:29,304 INFO  L93    rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1
[2024-11-19 14:18:29,305 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-19 14:18:29,317 INFO  L227   tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 7 check-sat command(s)
[2024-11-19 14:18:29,317 INFO  L228   tOrderPrioritization]: Conjunction of SSA is sat
[2024-11-19 14:18:29,317 INFO  L356             TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders.
[2024-11-19 14:18:29,324 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is sat
[2024-11-19 14:18:29,326 INFO  L130   FreeRefinementEngine]: Strategy CAMEL found a feasible trace
[2024-11-19 14:18:29,327 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2024-11-19 14:18:29,327 INFO  L85        PathProgramCache]: Analyzing trace with hash -838634848, now seen corresponding path program 11 times
[2024-11-19 14:18:29,327 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-19 14:18:29,327 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1014918754]
[2024-11-19 14:18:29,327 INFO  L93    rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1
[2024-11-19 14:18:29,327 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-19 14:18:29,349 INFO  L227   tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 7 check-sat command(s)
[2024-11-19 14:18:29,349 INFO  L228   tOrderPrioritization]: Conjunction of SSA is unsat
[2024-11-19 14:18:29,904 INFO  L134       CoverageAnalysis]: Checked inductivity of 313 backedges. 89 proven. 220 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked.
[2024-11-19 14:18:29,904 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-11-19 14:18:29,904 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1014918754]
[2024-11-19 14:18:29,905 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1014918754] provided 0 perfect and 1 imperfect interpolant sequences
[2024-11-19 14:18:29,905 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1403433347]
[2024-11-19 14:18:29,905 INFO  L93    rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1
[2024-11-19 14:18:29,905 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2024-11-19 14:18:29,906 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3
[2024-11-19 14:18:29,908 INFO  L229       MonitoredProcess]: Starting monitored process 56 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2024-11-19 14:18:29,910 INFO  L327       MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (56)] Waiting until timeout for monitored process
[2024-11-19 14:18:30,053 INFO  L227   tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 7 check-sat command(s)
[2024-11-19 14:18:30,053 INFO  L228   tOrderPrioritization]: Conjunction of SSA is unsat
[2024-11-19 14:18:30,056 INFO  L255         TraceCheckSpWp]: Trace formula consists of 377 conjuncts, 79 conjuncts are in the unsatisfiable core
[2024-11-19 14:18:30,059 INFO  L278         TraceCheckSpWp]: Computing forward predicates...
[2024-11-19 14:18:30,193 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-11-19 14:18:30,315 INFO  L134       CoverageAnalysis]: Checked inductivity of 313 backedges. 89 proven. 218 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked.
[2024-11-19 14:18:30,315 INFO  L311         TraceCheckSpWp]: Computing backward predicates...
[2024-11-19 14:18:30,369 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 25
[2024-11-19 14:18:30,570 INFO  L134       CoverageAnalysis]: Checked inductivity of 313 backedges. 89 proven. 218 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked.
[2024-11-19 14:18:30,570 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleZ3 [1403433347] provided 0 perfect and 2 imperfect interpolant sequences
[2024-11-19 14:18:30,570 INFO  L185   FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences.
[2024-11-19 14:18:30,570 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 18, 17] total 33
[2024-11-19 14:18:30,570 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [783575426]
[2024-11-19 14:18:30,570 INFO  L85    oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton
[2024-11-19 14:18:31,347 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-11-19 14:18:31,348 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants.
[2024-11-19 14:18:31,348 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=89, Invalid=967, Unknown=0, NotChecked=0, Total=1056
[2024-11-19 14:18:31,348 INFO  L87              Difference]: Start difference. First operand 550 states and 673 transitions. cyclomatic complexity: 143 Second operand  has 33 states, 33 states have (on average 3.3636363636363638) internal successors, (111), 33 states have internal predecessors, (111), 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-11-19 14:18:31,819 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2024-11-19 14:18:31,819 INFO  L93              Difference]: Finished difference Result 414 states and 493 transitions.
[2024-11-19 14:18:31,819 INFO  L82        GeneralOperation]: Start removeNonLiveStates. Operand 414 states and 493 transitions.
[2024-11-19 14:18:31,821 INFO  L131   ngComponentsAnalysis]: Automaton has 4 accepting balls. 164
[2024-11-19 14:18:31,822 INFO  L88        GeneralOperation]: Finished removeNonLiveStates. Reduced from 414 states to 302 states and 365 transitions.
[2024-11-19 14:18:31,822 INFO  L87         BuchiClosureNwa]: Accepting states before buchiClosure: 184
[2024-11-19 14:18:31,823 INFO  L106        BuchiClosureNwa]: Accepting states after buchiClosure: 184
[2024-11-19 14:18:31,823 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 302 states and 365 transitions.
[2024-11-19 14:18:31,823 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is not deterministic.
[2024-11-19 14:18:31,823 INFO  L218   hiAutomatonCegarLoop]: Abstraction has 302 states and 365 transitions.
[2024-11-19 14:18:31,823 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 302 states and 365 transitions.
[2024-11-19 14:18:31,827 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 302 to 238.
[2024-11-19 14:18:31,828 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 238 states, 238 states have (on average 1.23109243697479) internal successors, (293), 237 states have internal predecessors, (293), 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-11-19 14:18:31,828 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 238 states to 238 states and 293 transitions.
[2024-11-19 14:18:31,828 INFO  L240   hiAutomatonCegarLoop]: Abstraction has 238 states and 293 transitions.
[2024-11-19 14:18:31,829 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. 
[2024-11-19 14:18:31,829 INFO  L425   stractBuchiCegarLoop]: Abstraction has 238 states and 293 transitions.
[2024-11-19 14:18:31,829 INFO  L332   stractBuchiCegarLoop]: ======== Iteration 18 ============
[2024-11-19 14:18:31,829 INFO  L72            BuchiIsEmpty]: Start buchiIsEmpty. Operand 238 states and 293 transitions.
[2024-11-19 14:18:31,830 INFO  L131   ngComponentsAnalysis]: Automaton has 4 accepting balls. 132
[2024-11-19 14:18:31,830 INFO  L87            BuchiIsEmpty]: Finished buchiIsEmpty Result is false
[2024-11-19 14:18:31,830 INFO  L119           BuchiIsEmpty]: Starting construction of run
[2024-11-19 14:18:31,831 INFO  L148   hiAutomatonCegarLoop]: Counterexample stem histogram [7, 7, 6, 4, 3, 1, 1, 1, 1, 1]
[2024-11-19 14:18:31,831 INFO  L149   hiAutomatonCegarLoop]: Counterexample loop histogram [7, 7, 6, 6, 1, 1, 1, 1, 1, 1, 1]
[2024-11-19 14:18:31,831 INFO  L745   eck$LassoCheckResult]: Stem: 8729#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 8730#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet7#1, main_#t~malloc8#1.base, main_#t~malloc8#1.offset, main_#t~ret9#1.base, main_#t~ret9#1.offset, main_~in_len~0#1, main_~in~0#1.base, main_~in~0#1.offset;havoc main_#t~nondet7#1;main_~in_len~0#1 := main_#t~nondet7#1;havoc main_#t~nondet7#1; 8731#L531 assume !(main_~in_len~0#1 < 1);call main_#t~malloc8#1.base, main_#t~malloc8#1.offset := #Ultimate.allocOnStack(main_~in_len~0#1 % 18446744073709551616);main_~in~0#1.base, main_~in~0#1.offset := main_#t~malloc8#1.base, main_#t~malloc8#1.offset;call write~int#0(0, main_~in~0#1.base, main_~in~0#1.offset + (main_~in_len~0#1 - 1), 1);assume { :begin_inline_basename } true;basename_#in~path#1.base, basename_#in~path#1.offset := main_~in~0#1.base, main_~in~0#1.offset;havoc basename_#res#1.base, basename_#res#1.offset;havoc basename_#t~ret5#1.base, basename_#t~ret5#1.offset, basename_#t~mem6#1, basename_~path#1.base, basename_~path#1.offset, basename_~c~0#1.base, basename_~c~0#1.offset;basename_~path#1.base, basename_~path#1.offset := basename_#in~path#1.base, basename_#in~path#1.offset;havoc basename_~c~0#1.base, basename_~c~0#1.offset; 8732#L517 assume { :begin_inline_strrchr } true;strrchr_#in~t#1.base, strrchr_#in~t#1.offset, strrchr_#in~c#1 := basename_~path#1.base, basename_~path#1.offset, 47;havoc strrchr_#res#1.base, strrchr_#res#1.offset;havoc strrchr_#t~mem2#1, strrchr_#t~mem3#1, strrchr_#t~pre4#1.base, strrchr_#t~pre4#1.offset, strrchr_~t#1.base, strrchr_~t#1.offset, strrchr_~c#1, strrchr_~ch~0#1, strrchr_~l~0#1.base, strrchr_~l~0#1.offset;strrchr_~t#1.base, strrchr_~t#1.offset := strrchr_#in~t#1.base, strrchr_#in~t#1.offset;strrchr_~c#1 := strrchr_#in~c#1;havoc strrchr_~ch~0#1;strrchr_~l~0#1.base, strrchr_~l~0#1.offset := 0, 0;strrchr_~ch~0#1 := (if strrchr_~c#1 % 256 <= 127 then strrchr_~c#1 % 256 else strrchr_~c#1 % 256 - 256); 8774#L510-1 call strrchr_#t~mem2#1 := read~int#0(strrchr_~t#1.base, strrchr_~t#1.offset, 1); 8772#L511 assume strrchr_#t~mem2#1 == strrchr_~ch~0#1;havoc strrchr_#t~mem2#1;strrchr_~l~0#1.base, strrchr_~l~0#1.offset := strrchr_~t#1.base, strrchr_~t#1.offset; 8770#L511-2 call strrchr_#t~mem3#1 := read~int#0(strrchr_~t#1.base, strrchr_~t#1.offset, 1); 8771#L511-3 assume !(0 == strrchr_#t~mem3#1);havoc strrchr_#t~mem3#1;strrchr_#t~pre4#1.base, strrchr_#t~pre4#1.offset := strrchr_~t#1.base, 1 + strrchr_~t#1.offset;strrchr_~t#1.base, strrchr_~t#1.offset := strrchr_~t#1.base, 1 + strrchr_~t#1.offset;havoc strrchr_#t~pre4#1.base, strrchr_#t~pre4#1.offset; 8793#L510-1 call strrchr_#t~mem2#1 := read~int#0(strrchr_~t#1.base, strrchr_~t#1.offset, 1); 8794#L511 assume strrchr_#t~mem2#1 == strrchr_~ch~0#1;havoc strrchr_#t~mem2#1;strrchr_~l~0#1.base, strrchr_~l~0#1.offset := strrchr_~t#1.base, strrchr_~t#1.offset; 8919#L511-2 call strrchr_#t~mem3#1 := read~int#0(strrchr_~t#1.base, strrchr_~t#1.offset, 1); 8739#L511-3 assume !(0 == strrchr_#t~mem3#1);havoc strrchr_#t~mem3#1;strrchr_#t~pre4#1.base, strrchr_#t~pre4#1.offset := strrchr_~t#1.base, 1 + strrchr_~t#1.offset;strrchr_~t#1.base, strrchr_~t#1.offset := strrchr_~t#1.base, 1 + strrchr_~t#1.offset;havoc strrchr_#t~pre4#1.base, strrchr_#t~pre4#1.offset; 8740#L510-1 call strrchr_#t~mem2#1 := read~int#0(strrchr_~t#1.base, strrchr_~t#1.offset, 1); 8775#L511 assume !(strrchr_#t~mem2#1 == strrchr_~ch~0#1);havoc strrchr_#t~mem2#1; 8776#L511-2 call strrchr_#t~mem3#1 := read~int#0(strrchr_~t#1.base, strrchr_~t#1.offset, 1); 8787#L511-3 assume !(0 == strrchr_#t~mem3#1);havoc strrchr_#t~mem3#1;strrchr_#t~pre4#1.base, strrchr_#t~pre4#1.offset := strrchr_~t#1.base, 1 + strrchr_~t#1.offset;strrchr_~t#1.base, strrchr_~t#1.offset := strrchr_~t#1.base, 1 + strrchr_~t#1.offset;havoc strrchr_#t~pre4#1.base, strrchr_#t~pre4#1.offset; 8788#L510-1 call strrchr_#t~mem2#1 := read~int#0(strrchr_~t#1.base, strrchr_~t#1.offset, 1); 8783#L511 assume !(strrchr_#t~mem2#1 == strrchr_~ch~0#1);havoc strrchr_#t~mem2#1; 8784#L511-2 call strrchr_#t~mem3#1 := read~int#0(strrchr_~t#1.base, strrchr_~t#1.offset, 1); 8779#L511-3 assume !(0 == strrchr_#t~mem3#1);havoc strrchr_#t~mem3#1;strrchr_#t~pre4#1.base, strrchr_#t~pre4#1.offset := strrchr_~t#1.base, 1 + strrchr_~t#1.offset;strrchr_~t#1.base, strrchr_~t#1.offset := strrchr_~t#1.base, 1 + strrchr_~t#1.offset;havoc strrchr_#t~pre4#1.base, strrchr_#t~pre4#1.offset; 8780#L510-1 call strrchr_#t~mem2#1 := read~int#0(strrchr_~t#1.base, strrchr_~t#1.offset, 1); 8719#L511 assume !(strrchr_#t~mem2#1 == strrchr_~ch~0#1);havoc strrchr_#t~mem2#1; 8720#L511-2 call strrchr_#t~mem3#1 := read~int#0(strrchr_~t#1.base, strrchr_~t#1.offset, 1); 8900#L511-3 assume !(0 == strrchr_#t~mem3#1);havoc strrchr_#t~mem3#1;strrchr_#t~pre4#1.base, strrchr_#t~pre4#1.offset := strrchr_~t#1.base, 1 + strrchr_~t#1.offset;strrchr_~t#1.base, strrchr_~t#1.offset := strrchr_~t#1.base, 1 + strrchr_~t#1.offset;havoc strrchr_#t~pre4#1.base, strrchr_#t~pre4#1.offset; 8898#L510-1 call strrchr_#t~mem2#1 := read~int#0(strrchr_~t#1.base, strrchr_~t#1.offset, 1); 8874#L511 assume strrchr_#t~mem2#1 == strrchr_~ch~0#1;havoc strrchr_#t~mem2#1;strrchr_~l~0#1.base, strrchr_~l~0#1.offset := strrchr_~t#1.base, strrchr_~t#1.offset; 8872#L511-2 call strrchr_#t~mem3#1 := read~int#0(strrchr_~t#1.base, strrchr_~t#1.offset, 1); 8870#L511-3 assume !(0 == strrchr_#t~mem3#1);havoc strrchr_#t~mem3#1;strrchr_#t~pre4#1.base, strrchr_#t~pre4#1.offset := strrchr_~t#1.base, 1 + strrchr_~t#1.offset;strrchr_~t#1.base, strrchr_~t#1.offset := strrchr_~t#1.base, 1 + strrchr_~t#1.offset;havoc strrchr_#t~pre4#1.base, strrchr_#t~pre4#1.offset; 8865#L510-1 call strrchr_#t~mem2#1 := read~int#0(strrchr_~t#1.base, strrchr_~t#1.offset, 1); 8863#L511 assume !(strrchr_#t~mem2#1 == strrchr_~ch~0#1);havoc strrchr_#t~mem2#1; 8861#L511-2 call strrchr_#t~mem3#1 := read~int#0(strrchr_~t#1.base, strrchr_~t#1.offset, 1); 8851#L511-3 assume 0 == strrchr_#t~mem3#1;havoc strrchr_#t~mem3#1;strrchr_#res#1.base, strrchr_#res#1.offset := strrchr_~l~0#1.base, strrchr_~l~0#1.offset; 8849#strrchr_returnLabel#1 
[2024-11-19 14:18:31,832 INFO  L747   eck$LassoCheckResult]: Loop: 8849#strrchr_returnLabel#1 basename_#t~ret5#1.base, basename_#t~ret5#1.offset := strrchr_#res#1.base, strrchr_#res#1.offset;havoc strrchr_#t~mem2#1, strrchr_#t~mem3#1, strrchr_#t~pre4#1.base, strrchr_#t~pre4#1.offset, strrchr_~t#1.base, strrchr_~t#1.offset, strrchr_~c#1, strrchr_~ch~0#1, strrchr_~l~0#1.base, strrchr_~l~0#1.offset;havoc strrchr_#in~t#1.base, strrchr_#in~t#1.offset, strrchr_#in~c#1;assume { :end_inline_strrchr } true;basename_~c~0#1.base, basename_~c~0#1.offset := basename_#t~ret5#1.base, basename_#t~ret5#1.offset; 8847#L518 assume !(basename_~c~0#1.base == 0 && basename_~c~0#1.offset == 0);havoc basename_#t~ret5#1.base, basename_#t~ret5#1.offset;call basename_#t~mem6#1 := read~int#0(basename_~c~0#1.base, 1 + basename_~c~0#1.offset, 1); 8845#L519 assume 0 == basename_#t~mem6#1;havoc basename_#t~mem6#1; 8843#L520 assume !(basename_~c~0#1.base == basename_~path#1.base && basename_~c~0#1.offset == basename_~path#1.offset);call write~int#0(0, basename_~c~0#1.base, basename_~c~0#1.offset, 1); 8841#L517 assume { :begin_inline_strrchr } true;strrchr_#in~t#1.base, strrchr_#in~t#1.offset, strrchr_#in~c#1 := basename_~path#1.base, basename_~path#1.offset, 47;havoc strrchr_#res#1.base, strrchr_#res#1.offset;havoc strrchr_#t~mem2#1, strrchr_#t~mem3#1, strrchr_#t~pre4#1.base, strrchr_#t~pre4#1.offset, strrchr_~t#1.base, strrchr_~t#1.offset, strrchr_~c#1, strrchr_~ch~0#1, strrchr_~l~0#1.base, strrchr_~l~0#1.offset;strrchr_~t#1.base, strrchr_~t#1.offset := strrchr_#in~t#1.base, strrchr_#in~t#1.offset;strrchr_~c#1 := strrchr_#in~c#1;havoc strrchr_~ch~0#1;strrchr_~l~0#1.base, strrchr_~l~0#1.offset := 0, 0;strrchr_~ch~0#1 := (if strrchr_~c#1 % 256 <= 127 then strrchr_~c#1 % 256 else strrchr_~c#1 % 256 - 256); 8839#L510-1 call strrchr_#t~mem2#1 := read~int#0(strrchr_~t#1.base, strrchr_~t#1.offset, 1); 8819#L511 assume strrchr_#t~mem2#1 == strrchr_~ch~0#1;havoc strrchr_#t~mem2#1;strrchr_~l~0#1.base, strrchr_~l~0#1.offset := strrchr_~t#1.base, strrchr_~t#1.offset; 8721#L511-2 call strrchr_#t~mem3#1 := read~int#0(strrchr_~t#1.base, strrchr_~t#1.offset, 1); 8722#L511-3 assume !(0 == strrchr_#t~mem3#1);havoc strrchr_#t~mem3#1;strrchr_#t~pre4#1.base, strrchr_#t~pre4#1.offset := strrchr_~t#1.base, 1 + strrchr_~t#1.offset;strrchr_~t#1.base, strrchr_~t#1.offset := strrchr_~t#1.base, 1 + strrchr_~t#1.offset;havoc strrchr_#t~pre4#1.base, strrchr_#t~pre4#1.offset; 8822#L510-1 call strrchr_#t~mem2#1 := read~int#0(strrchr_~t#1.base, strrchr_~t#1.offset, 1); 8823#L511 assume strrchr_#t~mem2#1 == strrchr_~ch~0#1;havoc strrchr_#t~mem2#1;strrchr_~l~0#1.base, strrchr_~l~0#1.offset := strrchr_~t#1.base, strrchr_~t#1.offset; 8942#L511-2 call strrchr_#t~mem3#1 := read~int#0(strrchr_~t#1.base, strrchr_~t#1.offset, 1); 8941#L511-3 assume !(0 == strrchr_#t~mem3#1);havoc strrchr_#t~mem3#1;strrchr_#t~pre4#1.base, strrchr_#t~pre4#1.offset := strrchr_~t#1.base, 1 + strrchr_~t#1.offset;strrchr_~t#1.base, strrchr_~t#1.offset := strrchr_~t#1.base, 1 + strrchr_~t#1.offset;havoc strrchr_#t~pre4#1.base, strrchr_#t~pre4#1.offset; 8940#L510-1 call strrchr_#t~mem2#1 := read~int#0(strrchr_~t#1.base, strrchr_~t#1.offset, 1); 8939#L511 assume strrchr_#t~mem2#1 == strrchr_~ch~0#1;havoc strrchr_#t~mem2#1;strrchr_~l~0#1.base, strrchr_~l~0#1.offset := strrchr_~t#1.base, strrchr_~t#1.offset; 8938#L511-2 call strrchr_#t~mem3#1 := read~int#0(strrchr_~t#1.base, strrchr_~t#1.offset, 1); 8937#L511-3 assume !(0 == strrchr_#t~mem3#1);havoc strrchr_#t~mem3#1;strrchr_#t~pre4#1.base, strrchr_#t~pre4#1.offset := strrchr_~t#1.base, 1 + strrchr_~t#1.offset;strrchr_~t#1.base, strrchr_~t#1.offset := strrchr_~t#1.base, 1 + strrchr_~t#1.offset;havoc strrchr_#t~pre4#1.base, strrchr_#t~pre4#1.offset; 8936#L510-1 call strrchr_#t~mem2#1 := read~int#0(strrchr_~t#1.base, strrchr_~t#1.offset, 1); 8935#L511 assume strrchr_#t~mem2#1 == strrchr_~ch~0#1;havoc strrchr_#t~mem2#1;strrchr_~l~0#1.base, strrchr_~l~0#1.offset := strrchr_~t#1.base, strrchr_~t#1.offset; 8934#L511-2 call strrchr_#t~mem3#1 := read~int#0(strrchr_~t#1.base, strrchr_~t#1.offset, 1); 8933#L511-3 assume !(0 == strrchr_#t~mem3#1);havoc strrchr_#t~mem3#1;strrchr_#t~pre4#1.base, strrchr_#t~pre4#1.offset := strrchr_~t#1.base, 1 + strrchr_~t#1.offset;strrchr_~t#1.base, strrchr_~t#1.offset := strrchr_~t#1.base, 1 + strrchr_~t#1.offset;havoc strrchr_#t~pre4#1.base, strrchr_#t~pre4#1.offset; 8932#L510-1 call strrchr_#t~mem2#1 := read~int#0(strrchr_~t#1.base, strrchr_~t#1.offset, 1); 8931#L511 assume strrchr_#t~mem2#1 == strrchr_~ch~0#1;havoc strrchr_#t~mem2#1;strrchr_~l~0#1.base, strrchr_~l~0#1.offset := strrchr_~t#1.base, strrchr_~t#1.offset; 8888#L511-2 call strrchr_#t~mem3#1 := read~int#0(strrchr_~t#1.base, strrchr_~t#1.offset, 1); 8906#L511-3 assume !(0 == strrchr_#t~mem3#1);havoc strrchr_#t~mem3#1;strrchr_#t~pre4#1.base, strrchr_#t~pre4#1.offset := strrchr_~t#1.base, 1 + strrchr_~t#1.offset;strrchr_~t#1.base, strrchr_~t#1.offset := strrchr_~t#1.base, 1 + strrchr_~t#1.offset;havoc strrchr_#t~pre4#1.base, strrchr_#t~pre4#1.offset; 8905#L510-1 call strrchr_#t~mem2#1 := read~int#0(strrchr_~t#1.base, strrchr_~t#1.offset, 1); 8887#L511 assume strrchr_#t~mem2#1 == strrchr_~ch~0#1;havoc strrchr_#t~mem2#1;strrchr_~l~0#1.base, strrchr_~l~0#1.offset := strrchr_~t#1.base, strrchr_~t#1.offset; 8881#L511-2 call strrchr_#t~mem3#1 := read~int#0(strrchr_~t#1.base, strrchr_~t#1.offset, 1); 8884#L511-3 assume !(0 == strrchr_#t~mem3#1);havoc strrchr_#t~mem3#1;strrchr_#t~pre4#1.base, strrchr_#t~pre4#1.offset := strrchr_~t#1.base, 1 + strrchr_~t#1.offset;strrchr_~t#1.base, strrchr_~t#1.offset := strrchr_~t#1.base, 1 + strrchr_~t#1.offset;havoc strrchr_#t~pre4#1.base, strrchr_#t~pre4#1.offset; 8853#L510-1 call strrchr_#t~mem2#1 := read~int#0(strrchr_~t#1.base, strrchr_~t#1.offset, 1); 8880#L511 assume !(strrchr_#t~mem2#1 == strrchr_~ch~0#1);havoc strrchr_#t~mem2#1; 8857#L511-2 call strrchr_#t~mem3#1 := read~int#0(strrchr_~t#1.base, strrchr_~t#1.offset, 1); 8852#L511-3 assume 0 == strrchr_#t~mem3#1;havoc strrchr_#t~mem3#1;strrchr_#res#1.base, strrchr_#res#1.offset := strrchr_~l~0#1.base, strrchr_~l~0#1.offset; 8849#strrchr_returnLabel#1 
[2024-11-19 14:18:31,832 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2024-11-19 14:18:31,832 INFO  L85        PathProgramCache]: Analyzing trace with hash 2049317699, now seen corresponding path program 11 times
[2024-11-19 14:18:31,832 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-19 14:18:31,832 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [481296115]
[2024-11-19 14:18:31,832 INFO  L93    rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1
[2024-11-19 14:18:31,833 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-19 14:18:31,848 INFO  L227   tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 7 check-sat command(s)
[2024-11-19 14:18:31,849 INFO  L228   tOrderPrioritization]: Conjunction of SSA is sat
[2024-11-19 14:18:31,849 INFO  L356             TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders.
[2024-11-19 14:18:31,854 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is sat
[2024-11-19 14:18:31,857 INFO  L130   FreeRefinementEngine]: Strategy CAMEL found a feasible trace
[2024-11-19 14:18:31,858 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2024-11-19 14:18:31,858 INFO  L85        PathProgramCache]: Analyzing trace with hash 662582518, now seen corresponding path program 12 times
[2024-11-19 14:18:31,858 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-19 14:18:31,858 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [600868111]
[2024-11-19 14:18:31,858 INFO  L93    rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE
[2024-11-19 14:18:31,859 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-19 14:18:31,869 INFO  L227   tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 7 check-sat command(s)
[2024-11-19 14:18:31,869 INFO  L228   tOrderPrioritization]: Conjunction of SSA is sat
[2024-11-19 14:18:31,870 INFO  L356             TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders.
[2024-11-19 14:18:31,875 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is sat
[2024-11-19 14:18:31,878 INFO  L130   FreeRefinementEngine]: Strategy CAMEL found a feasible trace
[2024-11-19 14:18:31,878 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2024-11-19 14:18:31,878 INFO  L85        PathProgramCache]: Analyzing trace with hash 637012468, now seen corresponding path program 12 times
[2024-11-19 14:18:31,878 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-19 14:18:31,878 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1461828558]
[2024-11-19 14:18:31,878 INFO  L93    rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE
[2024-11-19 14:18:31,878 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-19 14:18:31,916 INFO  L227   tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 8 check-sat command(s)
[2024-11-19 14:18:31,916 INFO  L228   tOrderPrioritization]: Conjunction of SSA is unsat
[2024-11-19 14:18:32,795 INFO  L134       CoverageAnalysis]: Checked inductivity of 365 backedges. 75 proven. 288 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked.
[2024-11-19 14:18:32,795 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-11-19 14:18:32,795 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1461828558]
[2024-11-19 14:18:32,796 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1461828558] provided 0 perfect and 1 imperfect interpolant sequences
[2024-11-19 14:18:32,796 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1231839999]
[2024-11-19 14:18:32,796 INFO  L93    rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE
[2024-11-19 14:18:32,796 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2024-11-19 14:18:32,796 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3
[2024-11-19 14:18:32,797 INFO  L229       MonitoredProcess]: Starting monitored process 57 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2024-11-19 14:18:32,798 INFO  L327       MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (57)] Waiting until timeout for monitored process
[2024-11-19 14:18:32,992 INFO  L227   tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 8 check-sat command(s)
[2024-11-19 14:18:32,992 INFO  L228   tOrderPrioritization]: Conjunction of SSA is unsat
[2024-11-19 14:18:32,995 INFO  L255         TraceCheckSpWp]: Trace formula consists of 400 conjuncts, 105 conjuncts are in the unsatisfiable core
[2024-11-19 14:18:32,998 INFO  L278         TraceCheckSpWp]: Computing forward predicates...
[2024-11-19 14:18:33,263 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-11-19 14:18:33,544 INFO  L134       CoverageAnalysis]: Checked inductivity of 365 backedges. 75 proven. 286 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked.
[2024-11-19 14:18:33,545 INFO  L311         TraceCheckSpWp]: Computing backward predicates...
[2024-11-19 14:18:33,830 INFO  L349             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2024-11-19 14:18:33,830 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 133 treesize of output 103
[2024-11-19 14:18:34,333 INFO  L134       CoverageAnalysis]: Checked inductivity of 365 backedges. 75 proven. 286 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked.
[2024-11-19 14:18:34,333 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleZ3 [1231839999] provided 0 perfect and 2 imperfect interpolant sequences
[2024-11-19 14:18:34,333 INFO  L185   FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences.
[2024-11-19 14:18:34,333 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 23, 22] total 60
[2024-11-19 14:18:34,334 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [920935699]
[2024-11-19 14:18:34,334 INFO  L85    oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton
[2024-11-19 14:18:35,132 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-11-19 14:18:35,133 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 60 interpolants.
[2024-11-19 14:18:35,134 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=219, Invalid=3321, Unknown=0, NotChecked=0, Total=3540
[2024-11-19 14:18:35,134 INFO  L87              Difference]: Start difference. First operand 238 states and 293 transitions. cyclomatic complexity: 67 Second operand  has 60 states, 60 states have (on average 2.8333333333333335) internal successors, (170), 60 states have internal predecessors, (170), 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-11-19 14:18:37,009 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2024-11-19 14:18:37,010 INFO  L93              Difference]: Finished difference Result 670 states and 797 transitions.
[2024-11-19 14:18:37,010 INFO  L82        GeneralOperation]: Start removeNonLiveStates. Operand 670 states and 797 transitions.
[2024-11-19 14:18:37,013 INFO  L131   ngComponentsAnalysis]: Automaton has 8 accepting balls. 448
[2024-11-19 14:18:37,015 INFO  L88        GeneralOperation]: Finished removeNonLiveStates. Reduced from 670 states to 670 states and 797 transitions.
[2024-11-19 14:18:37,015 INFO  L87         BuchiClosureNwa]: Accepting states before buchiClosure: 496
[2024-11-19 14:18:37,016 INFO  L106        BuchiClosureNwa]: Accepting states after buchiClosure: 496
[2024-11-19 14:18:37,016 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 670 states and 797 transitions.
[2024-11-19 14:18:37,016 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is not deterministic.
[2024-11-19 14:18:37,016 INFO  L218   hiAutomatonCegarLoop]: Abstraction has 670 states and 797 transitions.
[2024-11-19 14:18:37,017 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 670 states and 797 transitions.
[2024-11-19 14:18:37,023 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 670 to 486.
[2024-11-19 14:18:37,024 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 486 states, 486 states have (on average 1.2201646090534979) internal successors, (593), 485 states have internal predecessors, (593), 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-11-19 14:18:37,025 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 486 states to 486 states and 593 transitions.
[2024-11-19 14:18:37,025 INFO  L240   hiAutomatonCegarLoop]: Abstraction has 486 states and 593 transitions.
[2024-11-19 14:18:37,026 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. 
[2024-11-19 14:18:37,027 INFO  L425   stractBuchiCegarLoop]: Abstraction has 486 states and 593 transitions.
[2024-11-19 14:18:37,027 INFO  L332   stractBuchiCegarLoop]: ======== Iteration 19 ============
[2024-11-19 14:18:37,027 INFO  L72            BuchiIsEmpty]: Start buchiIsEmpty. Operand 486 states and 593 transitions.
[2024-11-19 14:18:37,029 INFO  L131   ngComponentsAnalysis]: Automaton has 8 accepting balls. 336
[2024-11-19 14:18:37,029 INFO  L87            BuchiIsEmpty]: Finished buchiIsEmpty Result is false
[2024-11-19 14:18:37,029 INFO  L119           BuchiIsEmpty]: Starting construction of run
[2024-11-19 14:18:37,030 INFO  L148   hiAutomatonCegarLoop]: Counterexample stem histogram [7, 7, 6, 4, 3, 1, 1, 1, 1, 1]
[2024-11-19 14:18:37,030 INFO  L149   hiAutomatonCegarLoop]: Counterexample loop histogram [9, 9, 8, 6, 3, 1, 1, 1, 1, 1, 1]
[2024-11-19 14:18:37,030 INFO  L745   eck$LassoCheckResult]: Stem: 10139#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 10140#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet7#1, main_#t~malloc8#1.base, main_#t~malloc8#1.offset, main_#t~ret9#1.base, main_#t~ret9#1.offset, main_~in_len~0#1, main_~in~0#1.base, main_~in~0#1.offset;havoc main_#t~nondet7#1;main_~in_len~0#1 := main_#t~nondet7#1;havoc main_#t~nondet7#1; 10141#L531 assume !(main_~in_len~0#1 < 1);call main_#t~malloc8#1.base, main_#t~malloc8#1.offset := #Ultimate.allocOnStack(main_~in_len~0#1 % 18446744073709551616);main_~in~0#1.base, main_~in~0#1.offset := main_#t~malloc8#1.base, main_#t~malloc8#1.offset;call write~int#0(0, main_~in~0#1.base, main_~in~0#1.offset + (main_~in_len~0#1 - 1), 1);assume { :begin_inline_basename } true;basename_#in~path#1.base, basename_#in~path#1.offset := main_~in~0#1.base, main_~in~0#1.offset;havoc basename_#res#1.base, basename_#res#1.offset;havoc basename_#t~ret5#1.base, basename_#t~ret5#1.offset, basename_#t~mem6#1, basename_~path#1.base, basename_~path#1.offset, basename_~c~0#1.base, basename_~c~0#1.offset;basename_~path#1.base, basename_~path#1.offset := basename_#in~path#1.base, basename_#in~path#1.offset;havoc basename_~c~0#1.base, basename_~c~0#1.offset; 10142#L517 assume { :begin_inline_strrchr } true;strrchr_#in~t#1.base, strrchr_#in~t#1.offset, strrchr_#in~c#1 := basename_~path#1.base, basename_~path#1.offset, 47;havoc strrchr_#res#1.base, strrchr_#res#1.offset;havoc strrchr_#t~mem2#1, strrchr_#t~mem3#1, strrchr_#t~pre4#1.base, strrchr_#t~pre4#1.offset, strrchr_~t#1.base, strrchr_~t#1.offset, strrchr_~c#1, strrchr_~ch~0#1, strrchr_~l~0#1.base, strrchr_~l~0#1.offset;strrchr_~t#1.base, strrchr_~t#1.offset := strrchr_#in~t#1.base, strrchr_#in~t#1.offset;strrchr_~c#1 := strrchr_#in~c#1;havoc strrchr_~ch~0#1;strrchr_~l~0#1.base, strrchr_~l~0#1.offset := 0, 0;strrchr_~ch~0#1 := (if strrchr_~c#1 % 256 <= 127 then strrchr_~c#1 % 256 else strrchr_~c#1 % 256 - 256); 10183#L510-1 call strrchr_#t~mem2#1 := read~int#0(strrchr_~t#1.base, strrchr_~t#1.offset, 1); 10181#L511 assume strrchr_#t~mem2#1 == strrchr_~ch~0#1;havoc strrchr_#t~mem2#1;strrchr_~l~0#1.base, strrchr_~l~0#1.offset := strrchr_~t#1.base, strrchr_~t#1.offset; 10182#L511-2 call strrchr_#t~mem3#1 := read~int#0(strrchr_~t#1.base, strrchr_~t#1.offset, 1); 10196#L511-3 assume !(0 == strrchr_#t~mem3#1);havoc strrchr_#t~mem3#1;strrchr_#t~pre4#1.base, strrchr_#t~pre4#1.offset := strrchr_~t#1.base, 1 + strrchr_~t#1.offset;strrchr_~t#1.base, strrchr_~t#1.offset := strrchr_~t#1.base, 1 + strrchr_~t#1.offset;havoc strrchr_#t~pre4#1.base, strrchr_#t~pre4#1.offset; 10197#L510-1 call strrchr_#t~mem2#1 := read~int#0(strrchr_~t#1.base, strrchr_~t#1.offset, 1); 10184#L511 assume strrchr_#t~mem2#1 == strrchr_~ch~0#1;havoc strrchr_#t~mem2#1;strrchr_~l~0#1.base, strrchr_~l~0#1.offset := strrchr_~t#1.base, strrchr_~t#1.offset; 10180#L511-2 call strrchr_#t~mem3#1 := read~int#0(strrchr_~t#1.base, strrchr_~t#1.offset, 1); 10177#L511-3 assume !(0 == strrchr_#t~mem3#1);havoc strrchr_#t~mem3#1;strrchr_#t~pre4#1.base, strrchr_#t~pre4#1.offset := strrchr_~t#1.base, 1 + strrchr_~t#1.offset;strrchr_~t#1.base, strrchr_~t#1.offset := strrchr_~t#1.base, 1 + strrchr_~t#1.offset;havoc strrchr_#t~pre4#1.base, strrchr_#t~pre4#1.offset; 10175#L510-1 call strrchr_#t~mem2#1 := read~int#0(strrchr_~t#1.base, strrchr_~t#1.offset, 1); 10176#L511 assume !(strrchr_#t~mem2#1 == strrchr_~ch~0#1);havoc strrchr_#t~mem2#1; 10193#L511-2 call strrchr_#t~mem3#1 := read~int#0(strrchr_~t#1.base, strrchr_~t#1.offset, 1); 10192#L511-3 assume !(0 == strrchr_#t~mem3#1);havoc strrchr_#t~mem3#1;strrchr_#t~pre4#1.base, strrchr_#t~pre4#1.offset := strrchr_~t#1.base, 1 + strrchr_~t#1.offset;strrchr_~t#1.base, strrchr_~t#1.offset := strrchr_~t#1.base, 1 + strrchr_~t#1.offset;havoc strrchr_#t~pre4#1.base, strrchr_#t~pre4#1.offset; 10191#L510-1 call strrchr_#t~mem2#1 := read~int#0(strrchr_~t#1.base, strrchr_~t#1.offset, 1); 10190#L511 assume !(strrchr_#t~mem2#1 == strrchr_~ch~0#1);havoc strrchr_#t~mem2#1; 10189#L511-2 call strrchr_#t~mem3#1 := read~int#0(strrchr_~t#1.base, strrchr_~t#1.offset, 1); 10188#L511-3 assume !(0 == strrchr_#t~mem3#1);havoc strrchr_#t~mem3#1;strrchr_#t~pre4#1.base, strrchr_#t~pre4#1.offset := strrchr_~t#1.base, 1 + strrchr_~t#1.offset;strrchr_~t#1.base, strrchr_~t#1.offset := strrchr_~t#1.base, 1 + strrchr_~t#1.offset;havoc strrchr_#t~pre4#1.base, strrchr_#t~pre4#1.offset; 10186#L510-1 call strrchr_#t~mem2#1 := read~int#0(strrchr_~t#1.base, strrchr_~t#1.offset, 1); 10187#L511 assume !(strrchr_#t~mem2#1 == strrchr_~ch~0#1);havoc strrchr_#t~mem2#1; 10463#L511-2 call strrchr_#t~mem3#1 := read~int#0(strrchr_~t#1.base, strrchr_~t#1.offset, 1); 10462#L511-3 assume !(0 == strrchr_#t~mem3#1);havoc strrchr_#t~mem3#1;strrchr_#t~pre4#1.base, strrchr_#t~pre4#1.offset := strrchr_~t#1.base, 1 + strrchr_~t#1.offset;strrchr_~t#1.base, strrchr_~t#1.offset := strrchr_~t#1.base, 1 + strrchr_~t#1.offset;havoc strrchr_#t~pre4#1.base, strrchr_#t~pre4#1.offset; 10450#L510-1 call strrchr_#t~mem2#1 := read~int#0(strrchr_~t#1.base, strrchr_~t#1.offset, 1); 10328#L511 assume strrchr_#t~mem2#1 == strrchr_~ch~0#1;havoc strrchr_#t~mem2#1;strrchr_~l~0#1.base, strrchr_~l~0#1.offset := strrchr_~t#1.base, strrchr_~t#1.offset; 10292#L511-2 call strrchr_#t~mem3#1 := read~int#0(strrchr_~t#1.base, strrchr_~t#1.offset, 1); 10308#L511-3 assume !(0 == strrchr_#t~mem3#1);havoc strrchr_#t~mem3#1;strrchr_#t~pre4#1.base, strrchr_#t~pre4#1.offset := strrchr_~t#1.base, 1 + strrchr_~t#1.offset;strrchr_~t#1.base, strrchr_~t#1.offset := strrchr_~t#1.base, 1 + strrchr_~t#1.offset;havoc strrchr_#t~pre4#1.base, strrchr_#t~pre4#1.offset; 10307#L510-1 call strrchr_#t~mem2#1 := read~int#0(strrchr_~t#1.base, strrchr_~t#1.offset, 1); 10167#L511 assume !(strrchr_#t~mem2#1 == strrchr_~ch~0#1);havoc strrchr_#t~mem2#1; 10165#L511-2 call strrchr_#t~mem3#1 := read~int#0(strrchr_~t#1.base, strrchr_~t#1.offset, 1); 10166#L511-3 assume 0 == strrchr_#t~mem3#1;havoc strrchr_#t~mem3#1;strrchr_#res#1.base, strrchr_#res#1.offset := strrchr_~l~0#1.base, strrchr_~l~0#1.offset; 10296#strrchr_returnLabel#1 
[2024-11-19 14:18:37,030 INFO  L747   eck$LassoCheckResult]: Loop: 10296#strrchr_returnLabel#1 basename_#t~ret5#1.base, basename_#t~ret5#1.offset := strrchr_#res#1.base, strrchr_#res#1.offset;havoc strrchr_#t~mem2#1, strrchr_#t~mem3#1, strrchr_#t~pre4#1.base, strrchr_#t~pre4#1.offset, strrchr_~t#1.base, strrchr_~t#1.offset, strrchr_~c#1, strrchr_~ch~0#1, strrchr_~l~0#1.base, strrchr_~l~0#1.offset;havoc strrchr_#in~t#1.base, strrchr_#in~t#1.offset, strrchr_#in~c#1;assume { :end_inline_strrchr } true;basename_~c~0#1.base, basename_~c~0#1.offset := basename_#t~ret5#1.base, basename_#t~ret5#1.offset; 10524#L518 assume !(basename_~c~0#1.base == 0 && basename_~c~0#1.offset == 0);havoc basename_#t~ret5#1.base, basename_#t~ret5#1.offset;call basename_#t~mem6#1 := read~int#0(basename_~c~0#1.base, 1 + basename_~c~0#1.offset, 1); 10522#L519 assume 0 == basename_#t~mem6#1;havoc basename_#t~mem6#1; 10520#L520 assume !(basename_~c~0#1.base == basename_~path#1.base && basename_~c~0#1.offset == basename_~path#1.offset);call write~int#0(0, basename_~c~0#1.base, basename_~c~0#1.offset, 1); 10518#L517 assume { :begin_inline_strrchr } true;strrchr_#in~t#1.base, strrchr_#in~t#1.offset, strrchr_#in~c#1 := basename_~path#1.base, basename_~path#1.offset, 47;havoc strrchr_#res#1.base, strrchr_#res#1.offset;havoc strrchr_#t~mem2#1, strrchr_#t~mem3#1, strrchr_#t~pre4#1.base, strrchr_#t~pre4#1.offset, strrchr_~t#1.base, strrchr_~t#1.offset, strrchr_~c#1, strrchr_~ch~0#1, strrchr_~l~0#1.base, strrchr_~l~0#1.offset;strrchr_~t#1.base, strrchr_~t#1.offset := strrchr_#in~t#1.base, strrchr_#in~t#1.offset;strrchr_~c#1 := strrchr_#in~c#1;havoc strrchr_~ch~0#1;strrchr_~l~0#1.base, strrchr_~l~0#1.offset := 0, 0;strrchr_~ch~0#1 := (if strrchr_~c#1 % 256 <= 127 then strrchr_~c#1 % 256 else strrchr_~c#1 % 256 - 256); 10517#L510-1 call strrchr_#t~mem2#1 := read~int#0(strrchr_~t#1.base, strrchr_~t#1.offset, 1); 10501#L511 assume strrchr_#t~mem2#1 == strrchr_~ch~0#1;havoc strrchr_#t~mem2#1;strrchr_~l~0#1.base, strrchr_~l~0#1.offset := strrchr_~t#1.base, strrchr_~t#1.offset; 10502#L511-2 call strrchr_#t~mem3#1 := read~int#0(strrchr_~t#1.base, strrchr_~t#1.offset, 1); 10511#L511-3 assume !(0 == strrchr_#t~mem3#1);havoc strrchr_#t~mem3#1;strrchr_#t~pre4#1.base, strrchr_#t~pre4#1.offset := strrchr_~t#1.base, 1 + strrchr_~t#1.offset;strrchr_~t#1.base, strrchr_~t#1.offset := strrchr_~t#1.base, 1 + strrchr_~t#1.offset;havoc strrchr_#t~pre4#1.base, strrchr_#t~pre4#1.offset; 10512#L510-1 call strrchr_#t~mem2#1 := read~int#0(strrchr_~t#1.base, strrchr_~t#1.offset, 1); 10506#L511 assume strrchr_#t~mem2#1 == strrchr_~ch~0#1;havoc strrchr_#t~mem2#1;strrchr_~l~0#1.base, strrchr_~l~0#1.offset := strrchr_~t#1.base, strrchr_~t#1.offset; 10507#L511-2 call strrchr_#t~mem3#1 := read~int#0(strrchr_~t#1.base, strrchr_~t#1.offset, 1); 10613#L511-3 assume !(0 == strrchr_#t~mem3#1);havoc strrchr_#t~mem3#1;strrchr_#t~pre4#1.base, strrchr_#t~pre4#1.offset := strrchr_~t#1.base, 1 + strrchr_~t#1.offset;strrchr_~t#1.base, strrchr_~t#1.offset := strrchr_~t#1.base, 1 + strrchr_~t#1.offset;havoc strrchr_#t~pre4#1.base, strrchr_#t~pre4#1.offset; 10612#L510-1 call strrchr_#t~mem2#1 := read~int#0(strrchr_~t#1.base, strrchr_~t#1.offset, 1); 10611#L511 assume strrchr_#t~mem2#1 == strrchr_~ch~0#1;havoc strrchr_#t~mem2#1;strrchr_~l~0#1.base, strrchr_~l~0#1.offset := strrchr_~t#1.base, strrchr_~t#1.offset; 10610#L511-2 call strrchr_#t~mem3#1 := read~int#0(strrchr_~t#1.base, strrchr_~t#1.offset, 1); 10609#L511-3 assume !(0 == strrchr_#t~mem3#1);havoc strrchr_#t~mem3#1;strrchr_#t~pre4#1.base, strrchr_#t~pre4#1.offset := strrchr_~t#1.base, 1 + strrchr_~t#1.offset;strrchr_~t#1.base, strrchr_~t#1.offset := strrchr_~t#1.base, 1 + strrchr_~t#1.offset;havoc strrchr_#t~pre4#1.base, strrchr_#t~pre4#1.offset; 10608#L510-1 call strrchr_#t~mem2#1 := read~int#0(strrchr_~t#1.base, strrchr_~t#1.offset, 1); 10607#L511 assume strrchr_#t~mem2#1 == strrchr_~ch~0#1;havoc strrchr_#t~mem2#1;strrchr_~l~0#1.base, strrchr_~l~0#1.offset := strrchr_~t#1.base, strrchr_~t#1.offset; 10606#L511-2 call strrchr_#t~mem3#1 := read~int#0(strrchr_~t#1.base, strrchr_~t#1.offset, 1); 10605#L511-3 assume !(0 == strrchr_#t~mem3#1);havoc strrchr_#t~mem3#1;strrchr_#t~pre4#1.base, strrchr_#t~pre4#1.offset := strrchr_~t#1.base, 1 + strrchr_~t#1.offset;strrchr_~t#1.base, strrchr_~t#1.offset := strrchr_~t#1.base, 1 + strrchr_~t#1.offset;havoc strrchr_#t~pre4#1.base, strrchr_#t~pre4#1.offset; 10604#L510-1 call strrchr_#t~mem2#1 := read~int#0(strrchr_~t#1.base, strrchr_~t#1.offset, 1); 10489#L511 assume strrchr_#t~mem2#1 == strrchr_~ch~0#1;havoc strrchr_#t~mem2#1;strrchr_~l~0#1.base, strrchr_~l~0#1.offset := strrchr_~t#1.base, strrchr_~t#1.offset; 10488#L511-2 call strrchr_#t~mem3#1 := read~int#0(strrchr_~t#1.base, strrchr_~t#1.offset, 1); 10486#L511-3 assume !(0 == strrchr_#t~mem3#1);havoc strrchr_#t~mem3#1;strrchr_#t~pre4#1.base, strrchr_#t~pre4#1.offset := strrchr_~t#1.base, 1 + strrchr_~t#1.offset;strrchr_~t#1.base, strrchr_~t#1.offset := strrchr_~t#1.base, 1 + strrchr_~t#1.offset;havoc strrchr_#t~pre4#1.base, strrchr_#t~pre4#1.offset; 10487#L510-1 call strrchr_#t~mem2#1 := read~int#0(strrchr_~t#1.base, strrchr_~t#1.offset, 1); 10482#L511 assume !(strrchr_#t~mem2#1 == strrchr_~ch~0#1);havoc strrchr_#t~mem2#1; 10483#L511-2 call strrchr_#t~mem3#1 := read~int#0(strrchr_~t#1.base, strrchr_~t#1.offset, 1); 10601#L511-3 assume !(0 == strrchr_#t~mem3#1);havoc strrchr_#t~mem3#1;strrchr_#t~pre4#1.base, strrchr_#t~pre4#1.offset := strrchr_~t#1.base, 1 + strrchr_~t#1.offset;strrchr_~t#1.base, strrchr_~t#1.offset := strrchr_~t#1.base, 1 + strrchr_~t#1.offset;havoc strrchr_#t~pre4#1.base, strrchr_#t~pre4#1.offset; 10600#L510-1 call strrchr_#t~mem2#1 := read~int#0(strrchr_~t#1.base, strrchr_~t#1.offset, 1); 10204#L511 assume !(strrchr_#t~mem2#1 == strrchr_~ch~0#1);havoc strrchr_#t~mem2#1; 10170#L511-2 call strrchr_#t~mem3#1 := read~int#0(strrchr_~t#1.base, strrchr_~t#1.offset, 1); 10199#L511-3 assume !(0 == strrchr_#t~mem3#1);havoc strrchr_#t~mem3#1;strrchr_#t~pre4#1.base, strrchr_#t~pre4#1.offset := strrchr_~t#1.base, 1 + strrchr_~t#1.offset;strrchr_~t#1.base, strrchr_~t#1.offset := strrchr_~t#1.base, 1 + strrchr_~t#1.offset;havoc strrchr_#t~pre4#1.base, strrchr_#t~pre4#1.offset; 10198#L510-1 call strrchr_#t~mem2#1 := read~int#0(strrchr_~t#1.base, strrchr_~t#1.offset, 1); 10169#L511 assume strrchr_#t~mem2#1 == strrchr_~ch~0#1;havoc strrchr_#t~mem2#1;strrchr_~l~0#1.base, strrchr_~l~0#1.offset := strrchr_~t#1.base, strrchr_~t#1.offset; 10168#L511-2 call strrchr_#t~mem3#1 := read~int#0(strrchr_~t#1.base, strrchr_~t#1.offset, 1); 10163#L511-3 assume !(0 == strrchr_#t~mem3#1);havoc strrchr_#t~mem3#1;strrchr_#t~pre4#1.base, strrchr_#t~pre4#1.offset := strrchr_~t#1.base, 1 + strrchr_~t#1.offset;strrchr_~t#1.base, strrchr_~t#1.offset := strrchr_~t#1.base, 1 + strrchr_~t#1.offset;havoc strrchr_#t~pre4#1.base, strrchr_#t~pre4#1.offset; 10157#L510-1 call strrchr_#t~mem2#1 := read~int#0(strrchr_~t#1.base, strrchr_~t#1.offset, 1); 10158#L511 assume !(strrchr_#t~mem2#1 == strrchr_~ch~0#1);havoc strrchr_#t~mem2#1; 10551#L511-2 call strrchr_#t~mem3#1 := read~int#0(strrchr_~t#1.base, strrchr_~t#1.offset, 1); 10549#L511-3 assume 0 == strrchr_#t~mem3#1;havoc strrchr_#t~mem3#1;strrchr_#res#1.base, strrchr_#res#1.offset := strrchr_~l~0#1.base, strrchr_~l~0#1.offset; 10296#strrchr_returnLabel#1 
[2024-11-19 14:18:37,031 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2024-11-19 14:18:37,031 INFO  L85        PathProgramCache]: Analyzing trace with hash 2049317699, now seen corresponding path program 12 times
[2024-11-19 14:18:37,031 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-19 14:18:37,031 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [986242015]
[2024-11-19 14:18:37,031 INFO  L93    rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE
[2024-11-19 14:18:37,031 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-19 14:18:37,051 INFO  L227   tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 7 check-sat command(s)
[2024-11-19 14:18:37,052 INFO  L228   tOrderPrioritization]: Conjunction of SSA is sat
[2024-11-19 14:18:37,052 INFO  L356             TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders.
[2024-11-19 14:18:37,082 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is sat
[2024-11-19 14:18:37,087 INFO  L130   FreeRefinementEngine]: Strategy CAMEL found a feasible trace
[2024-11-19 14:18:37,087 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2024-11-19 14:18:37,088 INFO  L85        PathProgramCache]: Analyzing trace with hash -1100549174, now seen corresponding path program 13 times
[2024-11-19 14:18:37,088 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-19 14:18:37,088 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2016597268]
[2024-11-19 14:18:37,088 INFO  L93    rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY
[2024-11-19 14:18:37,088 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-19 14:18:37,100 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is sat
[2024-11-19 14:18:37,101 INFO  L356             TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders.
[2024-11-19 14:18:37,108 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is sat
[2024-11-19 14:18:37,112 INFO  L130   FreeRefinementEngine]: Strategy CAMEL found a feasible trace
[2024-11-19 14:18:37,112 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2024-11-19 14:18:37,112 INFO  L85        PathProgramCache]: Analyzing trace with hash -72160568, now seen corresponding path program 13 times
[2024-11-19 14:18:37,112 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-19 14:18:37,113 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1398272056]
[2024-11-19 14:18:37,113 INFO  L93    rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY
[2024-11-19 14:18:37,113 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-19 14:18:37,132 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-19 14:18:37,724 INFO  L134       CoverageAnalysis]: Checked inductivity of 481 backedges. 157 proven. 312 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked.
[2024-11-19 14:18:37,724 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-11-19 14:18:37,725 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1398272056]
[2024-11-19 14:18:37,725 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1398272056] provided 0 perfect and 1 imperfect interpolant sequences
[2024-11-19 14:18:37,725 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1225915279]
[2024-11-19 14:18:37,725 INFO  L93    rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY
[2024-11-19 14:18:37,725 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2024-11-19 14:18:37,725 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3
[2024-11-19 14:18:37,726 INFO  L229       MonitoredProcess]: Starting monitored process 58 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2024-11-19 14:18:37,727 INFO  L327       MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (58)] Waiting until timeout for monitored process
[2024-11-19 14:18:37,863 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-19 14:18:37,865 INFO  L255         TraceCheckSpWp]: Trace formula consists of 436 conjuncts, 85 conjuncts are in the unsatisfiable core
[2024-11-19 14:18:37,867 INFO  L278         TraceCheckSpWp]: Computing forward predicates...
[2024-11-19 14:18:38,081 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-11-19 14:18:38,142 INFO  L134       CoverageAnalysis]: Checked inductivity of 481 backedges. 157 proven. 310 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked.
[2024-11-19 14:18:38,142 INFO  L311         TraceCheckSpWp]: Computing backward predicates...
[2024-11-19 14:18:38,179 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 25
[2024-11-19 14:18:38,261 INFO  L134       CoverageAnalysis]: Checked inductivity of 481 backedges. 157 proven. 310 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked.
[2024-11-19 14:18:38,261 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleZ3 [1225915279] provided 0 perfect and 2 imperfect interpolant sequences
[2024-11-19 14:18:38,261 INFO  L185   FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences.
[2024-11-19 14:18:38,261 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 19, 19] total 32
[2024-11-19 14:18:38,262 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1637677553]
[2024-11-19 14:18:38,262 INFO  L85    oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton
[2024-11-19 14:18:39,224 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-11-19 14:18:39,225 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants.
[2024-11-19 14:18:39,225 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=85, Invalid=907, Unknown=0, NotChecked=0, Total=992
[2024-11-19 14:18:39,225 INFO  L87              Difference]: Start difference. First operand 486 states and 593 transitions. cyclomatic complexity: 127 Second operand  has 32 states, 32 states have (on average 3.28125) internal successors, (105), 32 states have internal predecessors, (105), 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-11-19 14:18:39,804 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2024-11-19 14:18:39,804 INFO  L93              Difference]: Finished difference Result 462 states and 553 transitions.
[2024-11-19 14:18:39,804 INFO  L82        GeneralOperation]: Start removeNonLiveStates. Operand 462 states and 553 transitions.
[2024-11-19 14:18:39,806 INFO  L131   ngComponentsAnalysis]: Automaton has 4 accepting balls. 180
[2024-11-19 14:18:39,807 INFO  L88        GeneralOperation]: Finished removeNonLiveStates. Reduced from 462 states to 334 states and 405 transitions.
[2024-11-19 14:18:39,807 INFO  L87         BuchiClosureNwa]: Accepting states before buchiClosure: 200
[2024-11-19 14:18:39,809 INFO  L106        BuchiClosureNwa]: Accepting states after buchiClosure: 200
[2024-11-19 14:18:39,809 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 334 states and 405 transitions.
[2024-11-19 14:18:39,809 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is not deterministic.
[2024-11-19 14:18:39,809 INFO  L218   hiAutomatonCegarLoop]: Abstraction has 334 states and 405 transitions.
[2024-11-19 14:18:39,810 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 334 states and 405 transitions.
[2024-11-19 14:18:39,814 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 334 to 270.
[2024-11-19 14:18:39,814 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 270 states, 270 states have (on average 1.2333333333333334) internal successors, (333), 269 states have internal predecessors, (333), 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-11-19 14:18:39,815 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 270 states to 270 states and 333 transitions.
[2024-11-19 14:18:39,815 INFO  L240   hiAutomatonCegarLoop]: Abstraction has 270 states and 333 transitions.
[2024-11-19 14:18:39,815 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. 
[2024-11-19 14:18:39,816 INFO  L425   stractBuchiCegarLoop]: Abstraction has 270 states and 333 transitions.
[2024-11-19 14:18:39,816 INFO  L332   stractBuchiCegarLoop]: ======== Iteration 20 ============
[2024-11-19 14:18:39,816 INFO  L72            BuchiIsEmpty]: Start buchiIsEmpty. Operand 270 states and 333 transitions.
[2024-11-19 14:18:39,817 INFO  L131   ngComponentsAnalysis]: Automaton has 4 accepting balls. 148
[2024-11-19 14:18:39,817 INFO  L87            BuchiIsEmpty]: Finished buchiIsEmpty Result is false
[2024-11-19 14:18:39,817 INFO  L119           BuchiIsEmpty]: Starting construction of run
[2024-11-19 14:18:39,818 INFO  L148   hiAutomatonCegarLoop]: Counterexample stem histogram [8, 8, 7, 5, 3, 1, 1, 1, 1, 1]
[2024-11-19 14:18:39,819 INFO  L149   hiAutomatonCegarLoop]: Counterexample loop histogram [8, 8, 7, 7, 1, 1, 1, 1, 1, 1, 1]
[2024-11-19 14:18:39,819 INFO  L745   eck$LassoCheckResult]: Stem: 11573#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 11574#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet7#1, main_#t~malloc8#1.base, main_#t~malloc8#1.offset, main_#t~ret9#1.base, main_#t~ret9#1.offset, main_~in_len~0#1, main_~in~0#1.base, main_~in~0#1.offset;havoc main_#t~nondet7#1;main_~in_len~0#1 := main_#t~nondet7#1;havoc main_#t~nondet7#1; 11575#L531 assume !(main_~in_len~0#1 < 1);call main_#t~malloc8#1.base, main_#t~malloc8#1.offset := #Ultimate.allocOnStack(main_~in_len~0#1 % 18446744073709551616);main_~in~0#1.base, main_~in~0#1.offset := main_#t~malloc8#1.base, main_#t~malloc8#1.offset;call write~int#0(0, main_~in~0#1.base, main_~in~0#1.offset + (main_~in_len~0#1 - 1), 1);assume { :begin_inline_basename } true;basename_#in~path#1.base, basename_#in~path#1.offset := main_~in~0#1.base, main_~in~0#1.offset;havoc basename_#res#1.base, basename_#res#1.offset;havoc basename_#t~ret5#1.base, basename_#t~ret5#1.offset, basename_#t~mem6#1, basename_~path#1.base, basename_~path#1.offset, basename_~c~0#1.base, basename_~c~0#1.offset;basename_~path#1.base, basename_~path#1.offset := basename_#in~path#1.base, basename_#in~path#1.offset;havoc basename_~c~0#1.base, basename_~c~0#1.offset; 11576#L517 assume { :begin_inline_strrchr } true;strrchr_#in~t#1.base, strrchr_#in~t#1.offset, strrchr_#in~c#1 := basename_~path#1.base, basename_~path#1.offset, 47;havoc strrchr_#res#1.base, strrchr_#res#1.offset;havoc strrchr_#t~mem2#1, strrchr_#t~mem3#1, strrchr_#t~pre4#1.base, strrchr_#t~pre4#1.offset, strrchr_~t#1.base, strrchr_~t#1.offset, strrchr_~c#1, strrchr_~ch~0#1, strrchr_~l~0#1.base, strrchr_~l~0#1.offset;strrchr_~t#1.base, strrchr_~t#1.offset := strrchr_#in~t#1.base, strrchr_#in~t#1.offset;strrchr_~c#1 := strrchr_#in~c#1;havoc strrchr_~ch~0#1;strrchr_~l~0#1.base, strrchr_~l~0#1.offset := 0, 0;strrchr_~ch~0#1 := (if strrchr_~c#1 % 256 <= 127 then strrchr_~c#1 % 256 else strrchr_~c#1 % 256 - 256); 11645#L510-1 call strrchr_#t~mem2#1 := read~int#0(strrchr_~t#1.base, strrchr_~t#1.offset, 1); 11643#L511 assume strrchr_#t~mem2#1 == strrchr_~ch~0#1;havoc strrchr_#t~mem2#1;strrchr_~l~0#1.base, strrchr_~l~0#1.offset := strrchr_~t#1.base, strrchr_~t#1.offset; 11644#L511-2 call strrchr_#t~mem3#1 := read~int#0(strrchr_~t#1.base, strrchr_~t#1.offset, 1); 11639#L511-3 assume !(0 == strrchr_#t~mem3#1);havoc strrchr_#t~mem3#1;strrchr_#t~pre4#1.base, strrchr_#t~pre4#1.offset := strrchr_~t#1.base, 1 + strrchr_~t#1.offset;strrchr_~t#1.base, strrchr_~t#1.offset := strrchr_~t#1.base, 1 + strrchr_~t#1.offset;havoc strrchr_#t~pre4#1.base, strrchr_#t~pre4#1.offset; 11640#L510-1 call strrchr_#t~mem2#1 := read~int#0(strrchr_~t#1.base, strrchr_~t#1.offset, 1); 11563#L511 assume strrchr_#t~mem2#1 == strrchr_~ch~0#1;havoc strrchr_#t~mem2#1;strrchr_~l~0#1.base, strrchr_~l~0#1.offset := strrchr_~t#1.base, strrchr_~t#1.offset; 11564#L511-2 call strrchr_#t~mem3#1 := read~int#0(strrchr_~t#1.base, strrchr_~t#1.offset, 1); 11568#L511-3 assume !(0 == strrchr_#t~mem3#1);havoc strrchr_#t~mem3#1;strrchr_#t~pre4#1.base, strrchr_#t~pre4#1.offset := strrchr_~t#1.base, 1 + strrchr_~t#1.offset;strrchr_~t#1.base, strrchr_~t#1.offset := strrchr_~t#1.base, 1 + strrchr_~t#1.offset;havoc strrchr_#t~pre4#1.base, strrchr_#t~pre4#1.offset; 11571#L510-1 call strrchr_#t~mem2#1 := read~int#0(strrchr_~t#1.base, strrchr_~t#1.offset, 1); 11572#L511 assume !(strrchr_#t~mem2#1 == strrchr_~ch~0#1);havoc strrchr_#t~mem2#1; 11636#L511-2 call strrchr_#t~mem3#1 := read~int#0(strrchr_~t#1.base, strrchr_~t#1.offset, 1); 11635#L511-3 assume !(0 == strrchr_#t~mem3#1);havoc strrchr_#t~mem3#1;strrchr_#t~pre4#1.base, strrchr_#t~pre4#1.offset := strrchr_~t#1.base, 1 + strrchr_~t#1.offset;strrchr_~t#1.base, strrchr_~t#1.offset := strrchr_~t#1.base, 1 + strrchr_~t#1.offset;havoc strrchr_#t~pre4#1.base, strrchr_#t~pre4#1.offset; 11634#L510-1 call strrchr_#t~mem2#1 := read~int#0(strrchr_~t#1.base, strrchr_~t#1.offset, 1); 11633#L511 assume !(strrchr_#t~mem2#1 == strrchr_~ch~0#1);havoc strrchr_#t~mem2#1; 11632#L511-2 call strrchr_#t~mem3#1 := read~int#0(strrchr_~t#1.base, strrchr_~t#1.offset, 1); 11631#L511-3 assume !(0 == strrchr_#t~mem3#1);havoc strrchr_#t~mem3#1;strrchr_#t~pre4#1.base, strrchr_#t~pre4#1.offset := strrchr_~t#1.base, 1 + strrchr_~t#1.offset;strrchr_~t#1.base, strrchr_~t#1.offset := strrchr_~t#1.base, 1 + strrchr_~t#1.offset;havoc strrchr_#t~pre4#1.base, strrchr_#t~pre4#1.offset; 11630#L510-1 call strrchr_#t~mem2#1 := read~int#0(strrchr_~t#1.base, strrchr_~t#1.offset, 1); 11629#L511 assume !(strrchr_#t~mem2#1 == strrchr_~ch~0#1);havoc strrchr_#t~mem2#1; 11628#L511-2 call strrchr_#t~mem3#1 := read~int#0(strrchr_~t#1.base, strrchr_~t#1.offset, 1); 11627#L511-3 assume !(0 == strrchr_#t~mem3#1);havoc strrchr_#t~mem3#1;strrchr_#t~pre4#1.base, strrchr_#t~pre4#1.offset := strrchr_~t#1.base, 1 + strrchr_~t#1.offset;strrchr_~t#1.base, strrchr_~t#1.offset := strrchr_~t#1.base, 1 + strrchr_~t#1.offset;havoc strrchr_#t~pre4#1.base, strrchr_#t~pre4#1.offset; 11625#L510-1 call strrchr_#t~mem2#1 := read~int#0(strrchr_~t#1.base, strrchr_~t#1.offset, 1); 11626#L511 assume !(strrchr_#t~mem2#1 == strrchr_~ch~0#1);havoc strrchr_#t~mem2#1; 11730#L511-2 call strrchr_#t~mem3#1 := read~int#0(strrchr_~t#1.base, strrchr_~t#1.offset, 1); 11753#L511-3 assume !(0 == strrchr_#t~mem3#1);havoc strrchr_#t~mem3#1;strrchr_#t~pre4#1.base, strrchr_#t~pre4#1.offset := strrchr_~t#1.base, 1 + strrchr_~t#1.offset;strrchr_~t#1.base, strrchr_~t#1.offset := strrchr_~t#1.base, 1 + strrchr_~t#1.offset;havoc strrchr_#t~pre4#1.base, strrchr_#t~pre4#1.offset; 11751#L510-1 call strrchr_#t~mem2#1 := read~int#0(strrchr_~t#1.base, strrchr_~t#1.offset, 1); 11729#L511 assume strrchr_#t~mem2#1 == strrchr_~ch~0#1;havoc strrchr_#t~mem2#1;strrchr_~l~0#1.base, strrchr_~l~0#1.offset := strrchr_~t#1.base, strrchr_~t#1.offset; 11728#L511-2 call strrchr_#t~mem3#1 := read~int#0(strrchr_~t#1.base, strrchr_~t#1.offset, 1); 11727#L511-3 assume !(0 == strrchr_#t~mem3#1);havoc strrchr_#t~mem3#1;strrchr_#t~pre4#1.base, strrchr_#t~pre4#1.offset := strrchr_~t#1.base, 1 + strrchr_~t#1.offset;strrchr_~t#1.base, strrchr_~t#1.offset := strrchr_~t#1.base, 1 + strrchr_~t#1.offset;havoc strrchr_#t~pre4#1.base, strrchr_#t~pre4#1.offset; 11725#L510-1 call strrchr_#t~mem2#1 := read~int#0(strrchr_~t#1.base, strrchr_~t#1.offset, 1); 11724#L511 assume !(strrchr_#t~mem2#1 == strrchr_~ch~0#1);havoc strrchr_#t~mem2#1; 11723#L511-2 call strrchr_#t~mem3#1 := read~int#0(strrchr_~t#1.base, strrchr_~t#1.offset, 1); 11722#L511-3 assume 0 == strrchr_#t~mem3#1;havoc strrchr_#t~mem3#1;strrchr_#res#1.base, strrchr_#res#1.offset := strrchr_~l~0#1.base, strrchr_~l~0#1.offset; 11721#strrchr_returnLabel#1 
[2024-11-19 14:18:39,820 INFO  L747   eck$LassoCheckResult]: Loop: 11721#strrchr_returnLabel#1 basename_#t~ret5#1.base, basename_#t~ret5#1.offset := strrchr_#res#1.base, strrchr_#res#1.offset;havoc strrchr_#t~mem2#1, strrchr_#t~mem3#1, strrchr_#t~pre4#1.base, strrchr_#t~pre4#1.offset, strrchr_~t#1.base, strrchr_~t#1.offset, strrchr_~c#1, strrchr_~ch~0#1, strrchr_~l~0#1.base, strrchr_~l~0#1.offset;havoc strrchr_#in~t#1.base, strrchr_#in~t#1.offset, strrchr_#in~c#1;assume { :end_inline_strrchr } true;basename_~c~0#1.base, basename_~c~0#1.offset := basename_#t~ret5#1.base, basename_#t~ret5#1.offset; 11720#L518 assume !(basename_~c~0#1.base == 0 && basename_~c~0#1.offset == 0);havoc basename_#t~ret5#1.base, basename_#t~ret5#1.offset;call basename_#t~mem6#1 := read~int#0(basename_~c~0#1.base, 1 + basename_~c~0#1.offset, 1); 11719#L519 assume 0 == basename_#t~mem6#1;havoc basename_#t~mem6#1; 11579#L520 assume !(basename_~c~0#1.base == basename_~path#1.base && basename_~c~0#1.offset == basename_~path#1.offset);call write~int#0(0, basename_~c~0#1.base, basename_~c~0#1.offset, 1); 11580#L517 assume { :begin_inline_strrchr } true;strrchr_#in~t#1.base, strrchr_#in~t#1.offset, strrchr_#in~c#1 := basename_~path#1.base, basename_~path#1.offset, 47;havoc strrchr_#res#1.base, strrchr_#res#1.offset;havoc strrchr_#t~mem2#1, strrchr_#t~mem3#1, strrchr_#t~pre4#1.base, strrchr_#t~pre4#1.offset, strrchr_~t#1.base, strrchr_~t#1.offset, strrchr_~c#1, strrchr_~ch~0#1, strrchr_~l~0#1.base, strrchr_~l~0#1.offset;strrchr_~t#1.base, strrchr_~t#1.offset := strrchr_#in~t#1.base, strrchr_#in~t#1.offset;strrchr_~c#1 := strrchr_#in~c#1;havoc strrchr_~ch~0#1;strrchr_~l~0#1.base, strrchr_~l~0#1.offset := 0, 0;strrchr_~ch~0#1 := (if strrchr_~c#1 % 256 <= 127 then strrchr_~c#1 % 256 else strrchr_~c#1 % 256 - 256); 11683#L510-1 call strrchr_#t~mem2#1 := read~int#0(strrchr_~t#1.base, strrchr_~t#1.offset, 1); 11677#L511 assume strrchr_#t~mem2#1 == strrchr_~ch~0#1;havoc strrchr_#t~mem2#1;strrchr_~l~0#1.base, strrchr_~l~0#1.offset := strrchr_~t#1.base, strrchr_~t#1.offset; 11678#L511-2 call strrchr_#t~mem3#1 := read~int#0(strrchr_~t#1.base, strrchr_~t#1.offset, 1); 11581#L511-3 assume !(0 == strrchr_#t~mem3#1);havoc strrchr_#t~mem3#1;strrchr_#t~pre4#1.base, strrchr_#t~pre4#1.offset := strrchr_~t#1.base, 1 + strrchr_~t#1.offset;strrchr_~t#1.base, strrchr_~t#1.offset := strrchr_~t#1.base, 1 + strrchr_~t#1.offset;havoc strrchr_#t~pre4#1.base, strrchr_#t~pre4#1.offset; 11582#L510-1 call strrchr_#t~mem2#1 := read~int#0(strrchr_~t#1.base, strrchr_~t#1.offset, 1); 11706#L511 assume strrchr_#t~mem2#1 == strrchr_~ch~0#1;havoc strrchr_#t~mem2#1;strrchr_~l~0#1.base, strrchr_~l~0#1.offset := strrchr_~t#1.base, strrchr_~t#1.offset; 11707#L511-2 call strrchr_#t~mem3#1 := read~int#0(strrchr_~t#1.base, strrchr_~t#1.offset, 1); 11801#L511-3 assume !(0 == strrchr_#t~mem3#1);havoc strrchr_#t~mem3#1;strrchr_#t~pre4#1.base, strrchr_#t~pre4#1.offset := strrchr_~t#1.base, 1 + strrchr_~t#1.offset;strrchr_~t#1.base, strrchr_~t#1.offset := strrchr_~t#1.base, 1 + strrchr_~t#1.offset;havoc strrchr_#t~pre4#1.base, strrchr_#t~pre4#1.offset; 11800#L510-1 call strrchr_#t~mem2#1 := read~int#0(strrchr_~t#1.base, strrchr_~t#1.offset, 1); 11799#L511 assume strrchr_#t~mem2#1 == strrchr_~ch~0#1;havoc strrchr_#t~mem2#1;strrchr_~l~0#1.base, strrchr_~l~0#1.offset := strrchr_~t#1.base, strrchr_~t#1.offset; 11798#L511-2 call strrchr_#t~mem3#1 := read~int#0(strrchr_~t#1.base, strrchr_~t#1.offset, 1); 11797#L511-3 assume !(0 == strrchr_#t~mem3#1);havoc strrchr_#t~mem3#1;strrchr_#t~pre4#1.base, strrchr_#t~pre4#1.offset := strrchr_~t#1.base, 1 + strrchr_~t#1.offset;strrchr_~t#1.base, strrchr_~t#1.offset := strrchr_~t#1.base, 1 + strrchr_~t#1.offset;havoc strrchr_#t~pre4#1.base, strrchr_#t~pre4#1.offset; 11796#L510-1 call strrchr_#t~mem2#1 := read~int#0(strrchr_~t#1.base, strrchr_~t#1.offset, 1); 11795#L511 assume strrchr_#t~mem2#1 == strrchr_~ch~0#1;havoc strrchr_#t~mem2#1;strrchr_~l~0#1.base, strrchr_~l~0#1.offset := strrchr_~t#1.base, strrchr_~t#1.offset; 11794#L511-2 call strrchr_#t~mem3#1 := read~int#0(strrchr_~t#1.base, strrchr_~t#1.offset, 1); 11793#L511-3 assume !(0 == strrchr_#t~mem3#1);havoc strrchr_#t~mem3#1;strrchr_#t~pre4#1.base, strrchr_#t~pre4#1.offset := strrchr_~t#1.base, 1 + strrchr_~t#1.offset;strrchr_~t#1.base, strrchr_~t#1.offset := strrchr_~t#1.base, 1 + strrchr_~t#1.offset;havoc strrchr_#t~pre4#1.base, strrchr_#t~pre4#1.offset; 11792#L510-1 call strrchr_#t~mem2#1 := read~int#0(strrchr_~t#1.base, strrchr_~t#1.offset, 1); 11791#L511 assume strrchr_#t~mem2#1 == strrchr_~ch~0#1;havoc strrchr_#t~mem2#1;strrchr_~l~0#1.base, strrchr_~l~0#1.offset := strrchr_~t#1.base, strrchr_~t#1.offset; 11790#L511-2 call strrchr_#t~mem3#1 := read~int#0(strrchr_~t#1.base, strrchr_~t#1.offset, 1); 11789#L511-3 assume !(0 == strrchr_#t~mem3#1);havoc strrchr_#t~mem3#1;strrchr_#t~pre4#1.base, strrchr_#t~pre4#1.offset := strrchr_~t#1.base, 1 + strrchr_~t#1.offset;strrchr_~t#1.base, strrchr_~t#1.offset := strrchr_~t#1.base, 1 + strrchr_~t#1.offset;havoc strrchr_#t~pre4#1.base, strrchr_#t~pre4#1.offset; 11788#L510-1 call strrchr_#t~mem2#1 := read~int#0(strrchr_~t#1.base, strrchr_~t#1.offset, 1); 11787#L511 assume strrchr_#t~mem2#1 == strrchr_~ch~0#1;havoc strrchr_#t~mem2#1;strrchr_~l~0#1.base, strrchr_~l~0#1.offset := strrchr_~t#1.base, strrchr_~t#1.offset; 11745#L511-2 call strrchr_#t~mem3#1 := read~int#0(strrchr_~t#1.base, strrchr_~t#1.offset, 1); 11749#L511-3 assume !(0 == strrchr_#t~mem3#1);havoc strrchr_#t~mem3#1;strrchr_#t~pre4#1.base, strrchr_#t~pre4#1.offset := strrchr_~t#1.base, 1 + strrchr_~t#1.offset;strrchr_~t#1.base, strrchr_~t#1.offset := strrchr_~t#1.base, 1 + strrchr_~t#1.offset;havoc strrchr_#t~pre4#1.base, strrchr_#t~pre4#1.offset; 11747#L510-1 call strrchr_#t~mem2#1 := read~int#0(strrchr_~t#1.base, strrchr_~t#1.offset, 1); 11744#L511 assume strrchr_#t~mem2#1 == strrchr_~ch~0#1;havoc strrchr_#t~mem2#1;strrchr_~l~0#1.base, strrchr_~l~0#1.offset := strrchr_~t#1.base, strrchr_~t#1.offset; 11697#L511-2 call strrchr_#t~mem3#1 := read~int#0(strrchr_~t#1.base, strrchr_~t#1.offset, 1); 11698#L511-3 assume !(0 == strrchr_#t~mem3#1);havoc strrchr_#t~mem3#1;strrchr_#t~pre4#1.base, strrchr_#t~pre4#1.offset := strrchr_~t#1.base, 1 + strrchr_~t#1.offset;strrchr_~t#1.base, strrchr_~t#1.offset := strrchr_~t#1.base, 1 + strrchr_~t#1.offset;havoc strrchr_#t~pre4#1.base, strrchr_#t~pre4#1.offset; 11694#L510-1 call strrchr_#t~mem2#1 := read~int#0(strrchr_~t#1.base, strrchr_~t#1.offset, 1); 11695#L511 assume !(strrchr_#t~mem2#1 == strrchr_~ch~0#1);havoc strrchr_#t~mem2#1; 11689#L511-2 call strrchr_#t~mem3#1 := read~int#0(strrchr_~t#1.base, strrchr_~t#1.offset, 1); 11690#L511-3 assume 0 == strrchr_#t~mem3#1;havoc strrchr_#t~mem3#1;strrchr_#res#1.base, strrchr_#res#1.offset := strrchr_~l~0#1.base, strrchr_~l~0#1.offset; 11721#strrchr_returnLabel#1 
[2024-11-19 14:18:39,820 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2024-11-19 14:18:39,820 INFO  L85        PathProgramCache]: Analyzing trace with hash 930090669, now seen corresponding path program 13 times
[2024-11-19 14:18:39,820 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-19 14:18:39,820 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2159176]
[2024-11-19 14:18:39,821 INFO  L93    rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY
[2024-11-19 14:18:39,821 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-19 14:18:39,832 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is sat
[2024-11-19 14:18:39,832 INFO  L356             TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders.
[2024-11-19 14:18:39,838 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is sat
[2024-11-19 14:18:39,843 INFO  L130   FreeRefinementEngine]: Strategy CAMEL found a feasible trace
[2024-11-19 14:18:39,847 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2024-11-19 14:18:39,848 INFO  L85        PathProgramCache]: Analyzing trace with hash -1188777634, now seen corresponding path program 14 times
[2024-11-19 14:18:39,848 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-19 14:18:39,848 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [795830729]
[2024-11-19 14:18:39,848 INFO  L93    rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1
[2024-11-19 14:18:39,848 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-19 14:18:39,858 INFO  L227   tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s)
[2024-11-19 14:18:39,859 INFO  L228   tOrderPrioritization]: Conjunction of SSA is sat
[2024-11-19 14:18:39,859 INFO  L356             TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders.
[2024-11-19 14:18:39,865 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is sat
[2024-11-19 14:18:39,868 INFO  L130   FreeRefinementEngine]: Strategy CAMEL found a feasible trace
[2024-11-19 14:18:39,869 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2024-11-19 14:18:39,869 INFO  L85        PathProgramCache]: Analyzing trace with hash 1338416690, now seen corresponding path program 14 times
[2024-11-19 14:18:39,869 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-19 14:18:39,869 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1515455724]
[2024-11-19 14:18:39,870 INFO  L93    rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1
[2024-11-19 14:18:39,870 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-19 14:18:39,889 INFO  L227   tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s)
[2024-11-19 14:18:39,889 INFO  L228   tOrderPrioritization]: Conjunction of SSA is unsat
[2024-11-19 14:18:40,626 INFO  L134       CoverageAnalysis]: Checked inductivity of 481 backedges. 1 proven. 480 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-11-19 14:18:40,626 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-11-19 14:18:40,626 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1515455724]
[2024-11-19 14:18:40,627 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1515455724] provided 0 perfect and 1 imperfect interpolant sequences
[2024-11-19 14:18:40,627 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [525618063]
[2024-11-19 14:18:40,627 INFO  L93    rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1
[2024-11-19 14:18:40,627 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2024-11-19 14:18:40,627 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3
[2024-11-19 14:18:40,629 INFO  L229       MonitoredProcess]: Starting monitored process 59 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2024-11-19 14:18:40,630 INFO  L327       MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (59)] Waiting until timeout for monitored process
[2024-11-19 14:18:40,765 INFO  L227   tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s)
[2024-11-19 14:18:40,765 INFO  L228   tOrderPrioritization]: Conjunction of SSA is unsat
[2024-11-19 14:18:40,767 INFO  L255         TraceCheckSpWp]: Trace formula consists of 441 conjuncts, 106 conjuncts are in the unsatisfiable core
[2024-11-19 14:18:40,770 INFO  L278         TraceCheckSpWp]: Computing forward predicates...
[2024-11-19 14:18:40,939 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-11-19 14:18:41,297 INFO  L134       CoverageAnalysis]: Checked inductivity of 481 backedges. 87 proven. 390 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked.
[2024-11-19 14:18:41,297 INFO  L311         TraceCheckSpWp]: Computing backward predicates...
[2024-11-19 14:18:41,609 INFO  L349             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2024-11-19 14:18:41,610 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 115 treesize of output 91
[2024-11-19 14:18:42,205 INFO  L134       CoverageAnalysis]: Checked inductivity of 481 backedges. 86 proven. 391 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked.
[2024-11-19 14:18:42,205 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleZ3 [525618063] provided 0 perfect and 2 imperfect interpolant sequences
[2024-11-19 14:18:42,205 INFO  L185   FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences.
[2024-11-19 14:18:42,205 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 26, 26] total 62
[2024-11-19 14:18:42,205 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [318775783]
[2024-11-19 14:18:42,205 INFO  L85    oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton
[2024-11-19 14:18:43,156 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-11-19 14:18:43,156 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 62 interpolants.
[2024-11-19 14:18:43,157 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=204, Invalid=3578, Unknown=0, NotChecked=0, Total=3782
[2024-11-19 14:18:43,157 INFO  L87              Difference]: Start difference. First operand 270 states and 333 transitions. cyclomatic complexity: 75 Second operand  has 62 states, 62 states have (on average 2.774193548387097) internal successors, (172), 62 states have internal predecessors, (172), 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-11-19 14:18:47,029 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2024-11-19 14:18:47,029 INFO  L93              Difference]: Finished difference Result 892 states and 1086 transitions.
[2024-11-19 14:18:47,029 INFO  L82        GeneralOperation]: Start removeNonLiveStates. Operand 892 states and 1086 transitions.
[2024-11-19 14:18:47,032 INFO  L131   ngComponentsAnalysis]: Automaton has 8 accepting balls. 672
[2024-11-19 14:18:47,036 INFO  L88        GeneralOperation]: Finished removeNonLiveStates. Reduced from 892 states to 892 states and 1086 transitions.
[2024-11-19 14:18:47,036 INFO  L87         BuchiClosureNwa]: Accepting states before buchiClosure: 720
[2024-11-19 14:18:47,036 INFO  L106        BuchiClosureNwa]: Accepting states after buchiClosure: 720
[2024-11-19 14:18:47,036 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 892 states and 1086 transitions.
[2024-11-19 14:18:47,037 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is not deterministic.
[2024-11-19 14:18:47,037 INFO  L218   hiAutomatonCegarLoop]: Abstraction has 892 states and 1086 transitions.
[2024-11-19 14:18:47,037 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 892 states and 1086 transitions.
[2024-11-19 14:18:47,048 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 892 to 726.
[2024-11-19 14:18:47,049 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 726 states, 726 states have (on average 1.2355371900826446) internal successors, (897), 725 states have internal predecessors, (897), 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-11-19 14:18:47,050 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 726 states to 726 states and 897 transitions.
[2024-11-19 14:18:47,051 INFO  L240   hiAutomatonCegarLoop]: Abstraction has 726 states and 897 transitions.
[2024-11-19 14:18:47,051 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 67 states. 
[2024-11-19 14:18:47,051 INFO  L425   stractBuchiCegarLoop]: Abstraction has 726 states and 897 transitions.
[2024-11-19 14:18:47,052 INFO  L332   stractBuchiCegarLoop]: ======== Iteration 21 ============
[2024-11-19 14:18:47,052 INFO  L72            BuchiIsEmpty]: Start buchiIsEmpty. Operand 726 states and 897 transitions.
[2024-11-19 14:18:47,054 INFO  L131   ngComponentsAnalysis]: Automaton has 8 accepting balls. 560
[2024-11-19 14:18:47,054 INFO  L87            BuchiIsEmpty]: Finished buchiIsEmpty Result is false
[2024-11-19 14:18:47,054 INFO  L119           BuchiIsEmpty]: Starting construction of run
[2024-11-19 14:18:47,056 INFO  L148   hiAutomatonCegarLoop]: Counterexample stem histogram [8, 8, 7, 5, 3, 1, 1, 1, 1, 1]
[2024-11-19 14:18:47,056 INFO  L149   hiAutomatonCegarLoop]: Counterexample loop histogram [9, 9, 8, 7, 2, 1, 1, 1, 1, 1, 1]
[2024-11-19 14:18:47,056 INFO  L745   eck$LassoCheckResult]: Stem: 13338#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 13339#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet7#1, main_#t~malloc8#1.base, main_#t~malloc8#1.offset, main_#t~ret9#1.base, main_#t~ret9#1.offset, main_~in_len~0#1, main_~in~0#1.base, main_~in~0#1.offset;havoc main_#t~nondet7#1;main_~in_len~0#1 := main_#t~nondet7#1;havoc main_#t~nondet7#1; 13340#L531 assume !(main_~in_len~0#1 < 1);call main_#t~malloc8#1.base, main_#t~malloc8#1.offset := #Ultimate.allocOnStack(main_~in_len~0#1 % 18446744073709551616);main_~in~0#1.base, main_~in~0#1.offset := main_#t~malloc8#1.base, main_#t~malloc8#1.offset;call write~int#0(0, main_~in~0#1.base, main_~in~0#1.offset + (main_~in_len~0#1 - 1), 1);assume { :begin_inline_basename } true;basename_#in~path#1.base, basename_#in~path#1.offset := main_~in~0#1.base, main_~in~0#1.offset;havoc basename_#res#1.base, basename_#res#1.offset;havoc basename_#t~ret5#1.base, basename_#t~ret5#1.offset, basename_#t~mem6#1, basename_~path#1.base, basename_~path#1.offset, basename_~c~0#1.base, basename_~c~0#1.offset;basename_~path#1.base, basename_~path#1.offset := basename_#in~path#1.base, basename_#in~path#1.offset;havoc basename_~c~0#1.base, basename_~c~0#1.offset; 13341#L517 assume { :begin_inline_strrchr } true;strrchr_#in~t#1.base, strrchr_#in~t#1.offset, strrchr_#in~c#1 := basename_~path#1.base, basename_~path#1.offset, 47;havoc strrchr_#res#1.base, strrchr_#res#1.offset;havoc strrchr_#t~mem2#1, strrchr_#t~mem3#1, strrchr_#t~pre4#1.base, strrchr_#t~pre4#1.offset, strrchr_~t#1.base, strrchr_~t#1.offset, strrchr_~c#1, strrchr_~ch~0#1, strrchr_~l~0#1.base, strrchr_~l~0#1.offset;strrchr_~t#1.base, strrchr_~t#1.offset := strrchr_#in~t#1.base, strrchr_#in~t#1.offset;strrchr_~c#1 := strrchr_#in~c#1;havoc strrchr_~ch~0#1;strrchr_~l~0#1.base, strrchr_~l~0#1.offset := 0, 0;strrchr_~ch~0#1 := (if strrchr_~c#1 % 256 <= 127 then strrchr_~c#1 % 256 else strrchr_~c#1 % 256 - 256); 13399#L510-1 call strrchr_#t~mem2#1 := read~int#0(strrchr_~t#1.base, strrchr_~t#1.offset, 1); 13397#L511 assume strrchr_#t~mem2#1 == strrchr_~ch~0#1;havoc strrchr_#t~mem2#1;strrchr_~l~0#1.base, strrchr_~l~0#1.offset := strrchr_~t#1.base, strrchr_~t#1.offset; 13395#L511-2 call strrchr_#t~mem3#1 := read~int#0(strrchr_~t#1.base, strrchr_~t#1.offset, 1); 13396#L511-3 assume !(0 == strrchr_#t~mem3#1);havoc strrchr_#t~mem3#1;strrchr_#t~pre4#1.base, strrchr_#t~pre4#1.offset := strrchr_~t#1.base, 1 + strrchr_~t#1.offset;strrchr_~t#1.base, strrchr_~t#1.offset := strrchr_~t#1.base, 1 + strrchr_~t#1.offset;havoc strrchr_#t~pre4#1.base, strrchr_#t~pre4#1.offset; 13391#L510-1 call strrchr_#t~mem2#1 := read~int#0(strrchr_~t#1.base, strrchr_~t#1.offset, 1); 13392#L511 assume strrchr_#t~mem2#1 == strrchr_~ch~0#1;havoc strrchr_#t~mem2#1;strrchr_~l~0#1.base, strrchr_~l~0#1.offset := strrchr_~t#1.base, strrchr_~t#1.offset; 13648#L511-2 call strrchr_#t~mem3#1 := read~int#0(strrchr_~t#1.base, strrchr_~t#1.offset, 1); 13647#L511-3 assume !(0 == strrchr_#t~mem3#1);havoc strrchr_#t~mem3#1;strrchr_#t~pre4#1.base, strrchr_#t~pre4#1.offset := strrchr_~t#1.base, 1 + strrchr_~t#1.offset;strrchr_~t#1.base, strrchr_~t#1.offset := strrchr_~t#1.base, 1 + strrchr_~t#1.offset;havoc strrchr_#t~pre4#1.base, strrchr_#t~pre4#1.offset; 13646#L510-1 call strrchr_#t~mem2#1 := read~int#0(strrchr_~t#1.base, strrchr_~t#1.offset, 1); 13645#L511 assume !(strrchr_#t~mem2#1 == strrchr_~ch~0#1);havoc strrchr_#t~mem2#1; 13644#L511-2 call strrchr_#t~mem3#1 := read~int#0(strrchr_~t#1.base, strrchr_~t#1.offset, 1); 13643#L511-3 assume !(0 == strrchr_#t~mem3#1);havoc strrchr_#t~mem3#1;strrchr_#t~pre4#1.base, strrchr_#t~pre4#1.offset := strrchr_~t#1.base, 1 + strrchr_~t#1.offset;strrchr_~t#1.base, strrchr_~t#1.offset := strrchr_~t#1.base, 1 + strrchr_~t#1.offset;havoc strrchr_#t~pre4#1.base, strrchr_#t~pre4#1.offset; 13642#L510-1 call strrchr_#t~mem2#1 := read~int#0(strrchr_~t#1.base, strrchr_~t#1.offset, 1); 13641#L511 assume !(strrchr_#t~mem2#1 == strrchr_~ch~0#1);havoc strrchr_#t~mem2#1; 13640#L511-2 call strrchr_#t~mem3#1 := read~int#0(strrchr_~t#1.base, strrchr_~t#1.offset, 1); 13639#L511-3 assume !(0 == strrchr_#t~mem3#1);havoc strrchr_#t~mem3#1;strrchr_#t~pre4#1.base, strrchr_#t~pre4#1.offset := strrchr_~t#1.base, 1 + strrchr_~t#1.offset;strrchr_~t#1.base, strrchr_~t#1.offset := strrchr_~t#1.base, 1 + strrchr_~t#1.offset;havoc strrchr_#t~pre4#1.base, strrchr_#t~pre4#1.offset; 13638#L510-1 call strrchr_#t~mem2#1 := read~int#0(strrchr_~t#1.base, strrchr_~t#1.offset, 1); 13637#L511 assume !(strrchr_#t~mem2#1 == strrchr_~ch~0#1);havoc strrchr_#t~mem2#1; 13636#L511-2 call strrchr_#t~mem3#1 := read~int#0(strrchr_~t#1.base, strrchr_~t#1.offset, 1); 13635#L511-3 assume !(0 == strrchr_#t~mem3#1);havoc strrchr_#t~mem3#1;strrchr_#t~pre4#1.base, strrchr_#t~pre4#1.offset := strrchr_~t#1.base, 1 + strrchr_~t#1.offset;strrchr_~t#1.base, strrchr_~t#1.offset := strrchr_~t#1.base, 1 + strrchr_~t#1.offset;havoc strrchr_#t~pre4#1.base, strrchr_#t~pre4#1.offset; 13634#L510-1 call strrchr_#t~mem2#1 := read~int#0(strrchr_~t#1.base, strrchr_~t#1.offset, 1); 13633#L511 assume !(strrchr_#t~mem2#1 == strrchr_~ch~0#1);havoc strrchr_#t~mem2#1; 13632#L511-2 call strrchr_#t~mem3#1 := read~int#0(strrchr_~t#1.base, strrchr_~t#1.offset, 1); 13631#L511-3 assume !(0 == strrchr_#t~mem3#1);havoc strrchr_#t~mem3#1;strrchr_#t~pre4#1.base, strrchr_#t~pre4#1.offset := strrchr_~t#1.base, 1 + strrchr_~t#1.offset;strrchr_~t#1.base, strrchr_~t#1.offset := strrchr_~t#1.base, 1 + strrchr_~t#1.offset;havoc strrchr_#t~pre4#1.base, strrchr_#t~pre4#1.offset; 13630#L510-1 call strrchr_#t~mem2#1 := read~int#0(strrchr_~t#1.base, strrchr_~t#1.offset, 1); 13627#L511 assume strrchr_#t~mem2#1 == strrchr_~ch~0#1;havoc strrchr_#t~mem2#1;strrchr_~l~0#1.base, strrchr_~l~0#1.offset := strrchr_~t#1.base, strrchr_~t#1.offset; 13626#L511-2 call strrchr_#t~mem3#1 := read~int#0(strrchr_~t#1.base, strrchr_~t#1.offset, 1); 13601#L511-3 assume !(0 == strrchr_#t~mem3#1);havoc strrchr_#t~mem3#1;strrchr_#t~pre4#1.base, strrchr_#t~pre4#1.offset := strrchr_~t#1.base, 1 + strrchr_~t#1.offset;strrchr_~t#1.base, strrchr_~t#1.offset := strrchr_~t#1.base, 1 + strrchr_~t#1.offset;havoc strrchr_#t~pre4#1.base, strrchr_#t~pre4#1.offset; 13598#L510-1 call strrchr_#t~mem2#1 := read~int#0(strrchr_~t#1.base, strrchr_~t#1.offset, 1); 13595#L511 assume !(strrchr_#t~mem2#1 == strrchr_~ch~0#1);havoc strrchr_#t~mem2#1; 13566#L511-2 call strrchr_#t~mem3#1 := read~int#0(strrchr_~t#1.base, strrchr_~t#1.offset, 1); 13557#L511-3 assume 0 == strrchr_#t~mem3#1;havoc strrchr_#t~mem3#1;strrchr_#res#1.base, strrchr_#res#1.offset := strrchr_~l~0#1.base, strrchr_~l~0#1.offset; 13535#strrchr_returnLabel#1 
[2024-11-19 14:18:47,057 INFO  L747   eck$LassoCheckResult]: Loop: 13535#strrchr_returnLabel#1 basename_#t~ret5#1.base, basename_#t~ret5#1.offset := strrchr_#res#1.base, strrchr_#res#1.offset;havoc strrchr_#t~mem2#1, strrchr_#t~mem3#1, strrchr_#t~pre4#1.base, strrchr_#t~pre4#1.offset, strrchr_~t#1.base, strrchr_~t#1.offset, strrchr_~c#1, strrchr_~ch~0#1, strrchr_~l~0#1.base, strrchr_~l~0#1.offset;havoc strrchr_#in~t#1.base, strrchr_#in~t#1.offset, strrchr_#in~c#1;assume { :end_inline_strrchr } true;basename_~c~0#1.base, basename_~c~0#1.offset := basename_#t~ret5#1.base, basename_#t~ret5#1.offset; 13533#L518 assume !(basename_~c~0#1.base == 0 && basename_~c~0#1.offset == 0);havoc basename_#t~ret5#1.base, basename_#t~ret5#1.offset;call basename_#t~mem6#1 := read~int#0(basename_~c~0#1.base, 1 + basename_~c~0#1.offset, 1); 13531#L519 assume 0 == basename_#t~mem6#1;havoc basename_#t~mem6#1; 13529#L520 assume !(basename_~c~0#1.base == basename_~path#1.base && basename_~c~0#1.offset == basename_~path#1.offset);call write~int#0(0, basename_~c~0#1.base, basename_~c~0#1.offset, 1); 13527#L517 assume { :begin_inline_strrchr } true;strrchr_#in~t#1.base, strrchr_#in~t#1.offset, strrchr_#in~c#1 := basename_~path#1.base, basename_~path#1.offset, 47;havoc strrchr_#res#1.base, strrchr_#res#1.offset;havoc strrchr_#t~mem2#1, strrchr_#t~mem3#1, strrchr_#t~pre4#1.base, strrchr_#t~pre4#1.offset, strrchr_~t#1.base, strrchr_~t#1.offset, strrchr_~c#1, strrchr_~ch~0#1, strrchr_~l~0#1.base, strrchr_~l~0#1.offset;strrchr_~t#1.base, strrchr_~t#1.offset := strrchr_#in~t#1.base, strrchr_#in~t#1.offset;strrchr_~c#1 := strrchr_#in~c#1;havoc strrchr_~ch~0#1;strrchr_~l~0#1.base, strrchr_~l~0#1.offset := 0, 0;strrchr_~ch~0#1 := (if strrchr_~c#1 % 256 <= 127 then strrchr_~c#1 % 256 else strrchr_~c#1 % 256 - 256); 13525#L510-1 call strrchr_#t~mem2#1 := read~int#0(strrchr_~t#1.base, strrchr_~t#1.offset, 1); 13522#L511 assume strrchr_#t~mem2#1 == strrchr_~ch~0#1;havoc strrchr_#t~mem2#1;strrchr_~l~0#1.base, strrchr_~l~0#1.offset := strrchr_~t#1.base, strrchr_~t#1.offset; 13518#L511-2 call strrchr_#t~mem3#1 := read~int#0(strrchr_~t#1.base, strrchr_~t#1.offset, 1); 13519#L511-3 assume !(0 == strrchr_#t~mem3#1);havoc strrchr_#t~mem3#1;strrchr_#t~pre4#1.base, strrchr_#t~pre4#1.offset := strrchr_~t#1.base, 1 + strrchr_~t#1.offset;strrchr_~t#1.base, strrchr_~t#1.offset := strrchr_~t#1.base, 1 + strrchr_~t#1.offset;havoc strrchr_#t~pre4#1.base, strrchr_#t~pre4#1.offset; 13510#L510-1 call strrchr_#t~mem2#1 := read~int#0(strrchr_~t#1.base, strrchr_~t#1.offset, 1); 13511#L511 assume strrchr_#t~mem2#1 == strrchr_~ch~0#1;havoc strrchr_#t~mem2#1;strrchr_~l~0#1.base, strrchr_~l~0#1.offset := strrchr_~t#1.base, strrchr_~t#1.offset; 13625#L511-2 call strrchr_#t~mem3#1 := read~int#0(strrchr_~t#1.base, strrchr_~t#1.offset, 1); 13624#L511-3 assume !(0 == strrchr_#t~mem3#1);havoc strrchr_#t~mem3#1;strrchr_#t~pre4#1.base, strrchr_#t~pre4#1.offset := strrchr_~t#1.base, 1 + strrchr_~t#1.offset;strrchr_~t#1.base, strrchr_~t#1.offset := strrchr_~t#1.base, 1 + strrchr_~t#1.offset;havoc strrchr_#t~pre4#1.base, strrchr_#t~pre4#1.offset; 13623#L510-1 call strrchr_#t~mem2#1 := read~int#0(strrchr_~t#1.base, strrchr_~t#1.offset, 1); 13622#L511 assume strrchr_#t~mem2#1 == strrchr_~ch~0#1;havoc strrchr_#t~mem2#1;strrchr_~l~0#1.base, strrchr_~l~0#1.offset := strrchr_~t#1.base, strrchr_~t#1.offset; 13621#L511-2 call strrchr_#t~mem3#1 := read~int#0(strrchr_~t#1.base, strrchr_~t#1.offset, 1); 13620#L511-3 assume !(0 == strrchr_#t~mem3#1);havoc strrchr_#t~mem3#1;strrchr_#t~pre4#1.base, strrchr_#t~pre4#1.offset := strrchr_~t#1.base, 1 + strrchr_~t#1.offset;strrchr_~t#1.base, strrchr_~t#1.offset := strrchr_~t#1.base, 1 + strrchr_~t#1.offset;havoc strrchr_#t~pre4#1.base, strrchr_#t~pre4#1.offset; 13619#L510-1 call strrchr_#t~mem2#1 := read~int#0(strrchr_~t#1.base, strrchr_~t#1.offset, 1); 13618#L511 assume strrchr_#t~mem2#1 == strrchr_~ch~0#1;havoc strrchr_#t~mem2#1;strrchr_~l~0#1.base, strrchr_~l~0#1.offset := strrchr_~t#1.base, strrchr_~t#1.offset; 13617#L511-2 call strrchr_#t~mem3#1 := read~int#0(strrchr_~t#1.base, strrchr_~t#1.offset, 1); 13616#L511-3 assume !(0 == strrchr_#t~mem3#1);havoc strrchr_#t~mem3#1;strrchr_#t~pre4#1.base, strrchr_#t~pre4#1.offset := strrchr_~t#1.base, 1 + strrchr_~t#1.offset;strrchr_~t#1.base, strrchr_~t#1.offset := strrchr_~t#1.base, 1 + strrchr_~t#1.offset;havoc strrchr_#t~pre4#1.base, strrchr_#t~pre4#1.offset; 13615#L510-1 call strrchr_#t~mem2#1 := read~int#0(strrchr_~t#1.base, strrchr_~t#1.offset, 1); 13614#L511 assume strrchr_#t~mem2#1 == strrchr_~ch~0#1;havoc strrchr_#t~mem2#1;strrchr_~l~0#1.base, strrchr_~l~0#1.offset := strrchr_~t#1.base, strrchr_~t#1.offset; 13613#L511-2 call strrchr_#t~mem3#1 := read~int#0(strrchr_~t#1.base, strrchr_~t#1.offset, 1); 13612#L511-3 assume !(0 == strrchr_#t~mem3#1);havoc strrchr_#t~mem3#1;strrchr_#t~pre4#1.base, strrchr_#t~pre4#1.offset := strrchr_~t#1.base, 1 + strrchr_~t#1.offset;strrchr_~t#1.base, strrchr_~t#1.offset := strrchr_~t#1.base, 1 + strrchr_~t#1.offset;havoc strrchr_#t~pre4#1.base, strrchr_#t~pre4#1.offset; 13611#L510-1 call strrchr_#t~mem2#1 := read~int#0(strrchr_~t#1.base, strrchr_~t#1.offset, 1); 13610#L511 assume strrchr_#t~mem2#1 == strrchr_~ch~0#1;havoc strrchr_#t~mem2#1;strrchr_~l~0#1.base, strrchr_~l~0#1.offset := strrchr_~t#1.base, strrchr_~t#1.offset; 13609#L511-2 call strrchr_#t~mem3#1 := read~int#0(strrchr_~t#1.base, strrchr_~t#1.offset, 1); 13608#L511-3 assume !(0 == strrchr_#t~mem3#1);havoc strrchr_#t~mem3#1;strrchr_#t~pre4#1.base, strrchr_#t~pre4#1.offset := strrchr_~t#1.base, 1 + strrchr_~t#1.offset;strrchr_~t#1.base, strrchr_~t#1.offset := strrchr_~t#1.base, 1 + strrchr_~t#1.offset;havoc strrchr_#t~pre4#1.base, strrchr_#t~pre4#1.offset; 13606#L510-1 call strrchr_#t~mem2#1 := read~int#0(strrchr_~t#1.base, strrchr_~t#1.offset, 1); 13604#L511 assume !(strrchr_#t~mem2#1 == strrchr_~ch~0#1);havoc strrchr_#t~mem2#1; 13600#L511-2 call strrchr_#t~mem3#1 := read~int#0(strrchr_~t#1.base, strrchr_~t#1.offset, 1); 13597#L511-3 assume !(0 == strrchr_#t~mem3#1);havoc strrchr_#t~mem3#1;strrchr_#t~pre4#1.base, strrchr_#t~pre4#1.offset := strrchr_~t#1.base, 1 + strrchr_~t#1.offset;strrchr_~t#1.base, strrchr_~t#1.offset := strrchr_~t#1.base, 1 + strrchr_~t#1.offset;havoc strrchr_#t~pre4#1.base, strrchr_#t~pre4#1.offset; 13594#L510-1 call strrchr_#t~mem2#1 := read~int#0(strrchr_~t#1.base, strrchr_~t#1.offset, 1); 13593#L511 assume strrchr_#t~mem2#1 == strrchr_~ch~0#1;havoc strrchr_#t~mem2#1;strrchr_~l~0#1.base, strrchr_~l~0#1.offset := strrchr_~t#1.base, strrchr_~t#1.offset; 13589#L511-2 call strrchr_#t~mem3#1 := read~int#0(strrchr_~t#1.base, strrchr_~t#1.offset, 1); 13586#L511-3 assume !(0 == strrchr_#t~mem3#1);havoc strrchr_#t~mem3#1;strrchr_#t~pre4#1.base, strrchr_#t~pre4#1.offset := strrchr_~t#1.base, 1 + strrchr_~t#1.offset;strrchr_~t#1.base, strrchr_~t#1.offset := strrchr_~t#1.base, 1 + strrchr_~t#1.offset;havoc strrchr_#t~pre4#1.base, strrchr_#t~pre4#1.offset; 13583#L510-1 call strrchr_#t~mem2#1 := read~int#0(strrchr_~t#1.base, strrchr_~t#1.offset, 1); 13579#L511 assume !(strrchr_#t~mem2#1 == strrchr_~ch~0#1);havoc strrchr_#t~mem2#1; 13567#L511-2 call strrchr_#t~mem3#1 := read~int#0(strrchr_~t#1.base, strrchr_~t#1.offset, 1); 13558#L511-3 assume 0 == strrchr_#t~mem3#1;havoc strrchr_#t~mem3#1;strrchr_#res#1.base, strrchr_#res#1.offset := strrchr_~l~0#1.base, strrchr_~l~0#1.offset; 13535#strrchr_returnLabel#1 
[2024-11-19 14:18:47,057 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2024-11-19 14:18:47,057 INFO  L85        PathProgramCache]: Analyzing trace with hash 930090669, now seen corresponding path program 14 times
[2024-11-19 14:18:47,057 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-19 14:18:47,057 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1234044353]
[2024-11-19 14:18:47,057 INFO  L93    rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1
[2024-11-19 14:18:47,058 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-19 14:18:47,069 INFO  L227   tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s)
[2024-11-19 14:18:47,069 INFO  L228   tOrderPrioritization]: Conjunction of SSA is sat
[2024-11-19 14:18:47,069 INFO  L356             TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders.
[2024-11-19 14:18:47,075 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is sat
[2024-11-19 14:18:47,079 INFO  L130   FreeRefinementEngine]: Strategy CAMEL found a feasible trace
[2024-11-19 14:18:47,079 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2024-11-19 14:18:47,079 INFO  L85        PathProgramCache]: Analyzing trace with hash 179314504, now seen corresponding path program 15 times
[2024-11-19 14:18:47,079 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-19 14:18:47,080 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [920283528]
[2024-11-19 14:18:47,080 INFO  L93    rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2
[2024-11-19 14:18:47,080 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-19 14:18:47,093 INFO  L227   tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 9 check-sat command(s)
[2024-11-19 14:18:47,093 INFO  L228   tOrderPrioritization]: Conjunction of SSA is sat
[2024-11-19 14:18:47,093 INFO  L356             TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders.
[2024-11-19 14:18:47,099 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is sat
[2024-11-19 14:18:47,103 INFO  L130   FreeRefinementEngine]: Strategy CAMEL found a feasible trace
[2024-11-19 14:18:47,103 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2024-11-19 14:18:47,103 INFO  L85        PathProgramCache]: Analyzing trace with hash 1915191836, now seen corresponding path program 15 times
[2024-11-19 14:18:47,104 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-19 14:18:47,104 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [129870613]
[2024-11-19 14:18:47,104 INFO  L93    rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2
[2024-11-19 14:18:47,104 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-19 14:18:47,135 INFO  L227   tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 9 check-sat command(s)
[2024-11-19 14:18:47,135 INFO  L228   tOrderPrioritization]: Conjunction of SSA is unsat
[2024-11-19 14:18:48,001 INFO  L134       CoverageAnalysis]: Checked inductivity of 545 backedges. 291 proven. 182 refuted. 0 times theorem prover too weak. 72 trivial. 0 not checked.
[2024-11-19 14:18:48,001 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-11-19 14:18:48,001 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [129870613]
[2024-11-19 14:18:48,001 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [129870613] provided 0 perfect and 1 imperfect interpolant sequences
[2024-11-19 14:18:48,001 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [447997745]
[2024-11-19 14:18:48,001 INFO  L93    rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2
[2024-11-19 14:18:48,002 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2024-11-19 14:18:48,002 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3
[2024-11-19 14:18:48,003 INFO  L229       MonitoredProcess]: Starting monitored process 60 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2024-11-19 14:18:48,004 INFO  L327       MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (60)] Waiting until timeout for monitored process
[2024-11-19 14:18:48,171 INFO  L227   tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 9 check-sat command(s)
[2024-11-19 14:18:48,172 INFO  L228   tOrderPrioritization]: Conjunction of SSA is unsat
[2024-11-19 14:18:48,176 INFO  L255         TraceCheckSpWp]: Trace formula consists of 459 conjuncts, 126 conjuncts are in the unsatisfiable core
[2024-11-19 14:18:48,179 INFO  L278         TraceCheckSpWp]: Computing forward predicates...
[2024-11-19 14:18:48,186 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-11-19 14:18:48,602 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2024-11-19 14:18:48,603 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11
[2024-11-19 14:18:49,140 INFO  L134       CoverageAnalysis]: Checked inductivity of 545 backedges. 93 proven. 450 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked.
[2024-11-19 14:18:49,141 INFO  L311         TraceCheckSpWp]: Computing backward predicates...
[2024-11-19 14:19:03,139 INFO  L134       CoverageAnalysis]: Checked inductivity of 545 backedges. 101 proven. 442 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked.
[2024-11-19 14:19:03,139 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleZ3 [447997745] provided 0 perfect and 2 imperfect interpolant sequences
[2024-11-19 14:19:03,139 INFO  L185   FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences.
[2024-11-19 14:19:03,140 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 30, 29] total 72
[2024-11-19 14:19:03,140 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1043596821]
[2024-11-19 14:19:03,140 INFO  L85    oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton
[2024-11-19 14:19:04,194 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-11-19 14:19:04,194 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 72 interpolants.
[2024-11-19 14:19:04,195 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=275, Invalid=4836, Unknown=1, NotChecked=0, Total=5112
[2024-11-19 14:19:04,195 INFO  L87              Difference]: Start difference. First operand 726 states and 897 transitions. cyclomatic complexity: 191 Second operand  has 72 states, 72 states have (on average 2.625) internal successors, (189), 72 states have internal predecessors, (189), 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)