./Ultimate.py --spec ../sv-benchmarks/c/properties/termination.prp --file ../sv-benchmarks/c/termination-15/array15_alloca.i --full-output --architecture 64bit


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


Checking for termination
Using default analysis
Version 4f9af400
extending candidate: java
['java']
extending candidate: /usr/bin/java
['java', '/usr/bin/java']
extending candidate: /opt/oracle-jdk-bin-*/bin/java
['java', '/usr/bin/java']
extending candidate: /opt/openjdk-*/bin/java
['java', '/usr/bin/java']
extending candidate: /usr/lib/jvm/java-*-openjdk-amd64/bin/java
['java', '/usr/bin/java', '/usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java', '/usr/lib/jvm/java-17-openjdk-amd64/bin/java', '/usr/lib/jvm/java-11-openjdk-amd64/bin/java', '/usr/lib/jvm/java-1.17.0-openjdk-amd64/bin/java']
['/root/.sdkman/candidates/java/21.0.5-tem/bin/java', '-Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config', '-Xmx15G', '-Xms4m', '-jar', '/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar', '-data', '@noDefault', '-ultimatedata', '/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data', '-tc', '/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerTermination.xml', '-i', '../sv-benchmarks/c/termination-15/array15_alloca.i', '-s', '/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-64bit-Automizer_Default.epf', '--cacsl2boogietranslator.entry.function', 'main', '--witnessprinter.witness.directory', '/storage/repos/ultimate-jdk21/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) )\n\n', '--witnessprinter.graph.data.producer', 'Automizer', '--witnessprinter.graph.data.architecture', '64bit', '--witnessprinter.graph.data.programhash', '00e68ac4f80be925b23bb57b8164307bcf507e35ce753b52ea66514fcb8cc207']
Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerTermination.xml -i ../sv-benchmarks/c/termination-15/array15_alloca.i -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/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 00e68ac4f80be925b23bb57b8164307bcf507e35ce753b52ea66514fcb8cc207
--- Real Ultimate output ---
This is Ultimate 0.3.0-?-4f9af40
[2024-11-07 23:54:23,337 INFO  L188        SettingsManager]: Resetting all preferences to default values...
[2024-11-07 23:54:23,416 INFO  L114        SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-64bit-Automizer_Default.epf
[2024-11-07 23:54:23,421 WARN  L101        SettingsManager]: Preference file contains the following unknown settings:
[2024-11-07 23:54:23,421 WARN  L103        SettingsManager]:   * de.uni_freiburg.informatik.ultimate.core.Log level for class
[2024-11-07 23:54:23,449 INFO  L130        SettingsManager]: Preferences different from defaults after loading the file:
[2024-11-07 23:54:23,450 INFO  L151        SettingsManager]: Preferences of UltimateCore differ from their defaults:
[2024-11-07 23:54:23,450 INFO  L153        SettingsManager]:  * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR;
[2024-11-07 23:54:23,450 INFO  L151        SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults:
[2024-11-07 23:54:23,450 INFO  L153        SettingsManager]:  * Use memory slicer=true
[2024-11-07 23:54:23,450 INFO  L151        SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults:
[2024-11-07 23:54:23,450 INFO  L153        SettingsManager]:  * Create parallel compositions if possible=false
[2024-11-07 23:54:23,450 INFO  L153        SettingsManager]:  * Use SBE=true
[2024-11-07 23:54:23,451 INFO  L151        SettingsManager]: Preferences of BuchiAutomizer differ from their defaults:
[2024-11-07 23:54:23,451 INFO  L153        SettingsManager]:  * NCSB implementation=INTSET_LAZY3
[2024-11-07 23:54:23,451 INFO  L153        SettingsManager]:  * Use old map elimination=false
[2024-11-07 23:54:23,451 INFO  L153        SettingsManager]:  * Use external solver (rank synthesis)=false
[2024-11-07 23:54:23,451 INFO  L153        SettingsManager]:  * Use only trivial implications for array writes=true
[2024-11-07 23:54:23,453 INFO  L153        SettingsManager]:  * Rank analysis=LINEAR_WITH_GUESSES
[2024-11-07 23:54:23,453 INFO  L151        SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults:
[2024-11-07 23:54:23,453 INFO  L153        SettingsManager]:  * Pointer base address is valid at dereference=ASSUME
[2024-11-07 23:54:23,453 INFO  L153        SettingsManager]:  * Overapproximate operations on floating types=true
[2024-11-07 23:54:23,453 INFO  L153        SettingsManager]:  * Check division by zero=IGNORE
[2024-11-07 23:54:23,454 INFO  L153        SettingsManager]:  * Pointer to allocated memory at dereference=ASSUME
[2024-11-07 23:54:23,454 INFO  L153        SettingsManager]:  * If two pointers are subtracted or compared they have the same base address=ASSUME
[2024-11-07 23:54:23,454 INFO  L153        SettingsManager]:  * Check array bounds for arrays that are off heap=ASSUME
[2024-11-07 23:54:23,454 INFO  L153        SettingsManager]:  * Allow undefined functions=false
[2024-11-07 23:54:23,454 INFO  L153        SettingsManager]:  * Check unreachability of reach_error function=false
[2024-11-07 23:54:23,454 INFO  L153        SettingsManager]:  * Check if freed pointer was valid=false
[2024-11-07 23:54:23,454 INFO  L153        SettingsManager]:  * Assume nondeterminstic values are in range=false
[2024-11-07 23:54:23,454 INFO  L153        SettingsManager]:  * Use constant arrays=true
[2024-11-07 23:54:23,454 INFO  L151        SettingsManager]: Preferences of RCFGBuilder differ from their defaults:
[2024-11-07 23:54:23,454 INFO  L153        SettingsManager]:  * Size of a code block=SequenceOfStatements
[2024-11-07 23:54:23,454 INFO  L151        SettingsManager]: Preferences of TraceAbstraction differ from their defaults:
[2024-11-07 23:54:23,454 INFO  L153        SettingsManager]:  * Trace refinement strategy=CAMEL
[2024-11-07 23:54:23,454 INFO  L151        SettingsManager]: Preferences of IcfgTransformer differ from their defaults:
[2024-11-07 23:54:23,455 INFO  L153        SettingsManager]:  * TransformationType=MODULO_NEIGHBOR
Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main
Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate-jdk21/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 -> 00e68ac4f80be925b23bb57b8164307bcf507e35ce753b52ea66514fcb8cc207
[2024-11-07 23:54:23,732 INFO  L75    nceAwareModelManager]: Repository-Root is: /tmp
[2024-11-07 23:54:23,742 INFO  L261   ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized
[2024-11-07 23:54:23,744 INFO  L217   ainManager$Toolchain]: [Toolchain 1]: Toolchain selected.
[2024-11-07 23:54:23,745 INFO  L270        PluginConnector]: Initializing CDTParser...
[2024-11-07 23:54:23,746 INFO  L274        PluginConnector]: CDTParser initialized
[2024-11-07 23:54:23,748 INFO  L431   ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/termination-15/array15_alloca.i
[2024-11-07 23:54:25,035 INFO  L533              CDTParser]: Created temporary CDT project at NULL
[2024-11-07 23:54:25,337 INFO  L384              CDTParser]: Found 1 translation units.
[2024-11-07 23:54:25,340 INFO  L180              CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/termination-15/array15_alloca.i
[2024-11-07 23:54:25,353 INFO  L427              CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/3ccfbbea4/6014e2c4039b41c2895f0a06640de34d/FLAG0200d7ccb
[2024-11-07 23:54:25,374 INFO  L435              CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/3ccfbbea4/6014e2c4039b41c2895f0a06640de34d
[2024-11-07 23:54:25,377 INFO  L299   ainManager$Toolchain]: ####################### [Toolchain 1] #######################
[2024-11-07 23:54:25,378 INFO  L133        ToolchainWalker]: Walking toolchain with 6 elements.
[2024-11-07 23:54:25,379 INFO  L112        PluginConnector]: ------------------------CACSL2BoogieTranslator----------------------------
[2024-11-07 23:54:25,380 INFO  L270        PluginConnector]: Initializing CACSL2BoogieTranslator...
[2024-11-07 23:54:25,384 INFO  L274        PluginConnector]: CACSL2BoogieTranslator initialized
[2024-11-07 23:54:25,385 INFO  L184        PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 11:54:25" (1/1) ...
[2024-11-07 23:54:25,385 INFO  L204        PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6ccf0e4a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 11:54:25, skipping insertion in model container
[2024-11-07 23:54:25,386 INFO  L184        PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 11:54:25" (1/1) ...
[2024-11-07 23:54:25,412 INFO  L175         MainTranslator]: Built tables and reachable declarations
[2024-11-07 23:54:25,672 INFO  L210          PostProcessor]: Analyzing one entry point: main
[2024-11-07 23:54:25,680 INFO  L200         MainTranslator]: Completed pre-run
[2024-11-07 23:54:25,723 INFO  L210          PostProcessor]: Analyzing one entry point: main
[2024-11-07 23:54:25,760 INFO  L204         MainTranslator]: Completed translation
[2024-11-07 23:54:25,761 INFO  L201        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 11:54:25 WrapperNode
[2024-11-07 23:54:25,761 INFO  L131        PluginConnector]: ------------------------ END CACSL2BoogieTranslator----------------------------
[2024-11-07 23:54:25,762 INFO  L112        PluginConnector]: ------------------------Boogie Procedure Inliner----------------------------
[2024-11-07 23:54:25,762 INFO  L270        PluginConnector]: Initializing Boogie Procedure Inliner...
[2024-11-07 23:54:25,762 INFO  L274        PluginConnector]: Boogie Procedure Inliner initialized
[2024-11-07 23:54:25,767 INFO  L184        PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 11:54:25" (1/1) ...
[2024-11-07 23:54:25,778 INFO  L184        PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 11:54:25" (1/1) ...
[2024-11-07 23:54:25,800 INFO  L138                Inliner]: procedures = 151, calls = 10, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 55
[2024-11-07 23:54:25,801 INFO  L131        PluginConnector]: ------------------------ END Boogie Procedure Inliner----------------------------
[2024-11-07 23:54:25,801 INFO  L112        PluginConnector]: ------------------------Boogie Preprocessor----------------------------
[2024-11-07 23:54:25,802 INFO  L270        PluginConnector]: Initializing Boogie Preprocessor...
[2024-11-07 23:54:25,802 INFO  L274        PluginConnector]: Boogie Preprocessor initialized
[2024-11-07 23:54:25,808 INFO  L184        PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 11:54:25" (1/1) ...
[2024-11-07 23:54:25,808 INFO  L184        PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 11:54:25" (1/1) ...
[2024-11-07 23:54:25,810 INFO  L184        PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 11:54:25" (1/1) ...
[2024-11-07 23:54:25,822 INFO  L175           MemorySlicer]: Split 4 memory accesses to 1 slices as follows [4]. 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-07 23:54:25,824 INFO  L184        PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 11:54:25" (1/1) ...
[2024-11-07 23:54:25,824 INFO  L184        PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 11:54:25" (1/1) ...
[2024-11-07 23:54:25,830 INFO  L184        PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 11:54:25" (1/1) ...
[2024-11-07 23:54:25,833 INFO  L184        PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 11:54:25" (1/1) ...
[2024-11-07 23:54:25,837 INFO  L184        PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 11:54:25" (1/1) ...
[2024-11-07 23:54:25,837 INFO  L184        PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 11:54:25" (1/1) ...
[2024-11-07 23:54:25,838 INFO  L131        PluginConnector]: ------------------------ END Boogie Preprocessor----------------------------
[2024-11-07 23:54:25,842 INFO  L112        PluginConnector]: ------------------------RCFGBuilder----------------------------
[2024-11-07 23:54:25,842 INFO  L270        PluginConnector]: Initializing RCFGBuilder...
[2024-11-07 23:54:25,842 INFO  L274        PluginConnector]: RCFGBuilder initialized
[2024-11-07 23:54:25,843 INFO  L184        PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 11:54:25" (1/1) ...
[2024-11-07 23:54:25,853 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000
[2024-11-07 23:54:25,866 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3
[2024-11-07 23:54:25,880 INFO  L229       MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null)
[2024-11-07 23:54:25,883 INFO  L327       MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Waiting until timeout for monitored process
[2024-11-07 23:54:25,906 INFO  L130     BoogieDeclarations]: Found specification of procedure read~int#0
[2024-11-07 23:54:25,906 INFO  L130     BoogieDeclarations]: Found specification of procedure write~int#0
[2024-11-07 23:54:25,907 INFO  L130     BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack
[2024-11-07 23:54:25,907 INFO  L130     BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc
[2024-11-07 23:54:25,907 INFO  L130     BoogieDeclarations]: Found specification of procedure ULTIMATE.start
[2024-11-07 23:54:25,907 INFO  L138     BoogieDeclarations]: Found implementation of procedure ULTIMATE.start
[2024-11-07 23:54:25,977 INFO  L238             CfgBuilder]: Building ICFG
[2024-11-07 23:54:25,979 INFO  L264             CfgBuilder]: Building CFG for each procedure with an implementation
[2024-11-07 23:54:26,082 INFO  L?                        ?]: Removed 8 outVars from TransFormulas that were not future-live.
[2024-11-07 23:54:26,083 INFO  L287             CfgBuilder]: Performing block encoding
[2024-11-07 23:54:26,088 INFO  L311             CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start)
[2024-11-07 23:54:26,089 INFO  L316             CfgBuilder]: Removed 2 assume(true) statements.
[2024-11-07 23:54:26,089 INFO  L201        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 11:54:26 BoogieIcfgContainer
[2024-11-07 23:54:26,089 INFO  L131        PluginConnector]: ------------------------ END RCFGBuilder----------------------------
[2024-11-07 23:54:26,090 INFO  L112        PluginConnector]: ------------------------BuchiAutomizer----------------------------
[2024-11-07 23:54:26,090 INFO  L270        PluginConnector]: Initializing BuchiAutomizer...
[2024-11-07 23:54:26,095 INFO  L274        PluginConnector]: BuchiAutomizer initialized
[2024-11-07 23:54:26,096 INFO  L99          BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis
[2024-11-07 23:54:26,096 INFO  L184        PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 07.11 11:54:25" (1/3) ...
[2024-11-07 23:54:26,097 INFO  L204        PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@32d13fa9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 07.11 11:54:26, skipping insertion in model container
[2024-11-07 23:54:26,097 INFO  L99          BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis
[2024-11-07 23:54:26,097 INFO  L184        PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 11:54:25" (2/3) ...
[2024-11-07 23:54:26,097 INFO  L204        PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@32d13fa9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 07.11 11:54:26, skipping insertion in model container
[2024-11-07 23:54:26,098 INFO  L99          BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis
[2024-11-07 23:54:26,098 INFO  L184        PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 11:54:26" (3/3) ...
[2024-11-07 23:54:26,100 INFO  L332   chiAutomizerObserver]: Analyzing ICFG array15_alloca.i
[2024-11-07 23:54:26,153 INFO  L300   stractBuchiCegarLoop]: Interprodecural is true
[2024-11-07 23:54:26,153 INFO  L301   stractBuchiCegarLoop]: Hoare is None
[2024-11-07 23:54:26,154 INFO  L302   stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates
[2024-11-07 23:54:26,154 INFO  L303   stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE
[2024-11-07 23:54:26,154 INFO  L304   stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION
[2024-11-07 23:54:26,154 INFO  L305   stractBuchiCegarLoop]: Difference is false
[2024-11-07 23:54:26,154 INFO  L306   stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA
[2024-11-07 23:54:26,155 INFO  L310   stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiAutomatonCegarLoop ========
[2024-11-07 23:54:26,159 INFO  L72            BuchiIsEmpty]: Start buchiIsEmpty. Operand  has 15 states, 14 states have (on average 1.5714285714285714) internal successors, (22), 14 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-07 23:54:26,174 INFO  L131   ngComponentsAnalysis]: Automaton has 2 accepting balls. 5
[2024-11-07 23:54:26,175 INFO  L87            BuchiIsEmpty]: Finished buchiIsEmpty Result is false
[2024-11-07 23:54:26,175 INFO  L119           BuchiIsEmpty]: Starting construction of run
[2024-11-07 23:54:26,180 INFO  L148   hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1]
[2024-11-07 23:54:26,180 INFO  L149   hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1]
[2024-11-07 23:54:26,180 INFO  L332   stractBuchiCegarLoop]: ======== Iteration 1 ============
[2024-11-07 23:54:26,181 INFO  L72            BuchiIsEmpty]: Start buchiIsEmpty. Operand  has 15 states, 14 states have (on average 1.5714285714285714) internal successors, (22), 14 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-07 23:54:26,182 INFO  L131   ngComponentsAnalysis]: Automaton has 2 accepting balls. 5
[2024-11-07 23:54:26,182 INFO  L87            BuchiIsEmpty]: Finished buchiIsEmpty Result is false
[2024-11-07 23:54:26,182 INFO  L119           BuchiIsEmpty]: Starting construction of run
[2024-11-07 23:54:26,182 INFO  L148   hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1]
[2024-11-07 23:54:26,182 INFO  L149   hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1]
[2024-11-07 23:54:26,190 INFO  L745   eck$LassoCheckResult]: Stem: 10#$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~nondet205#1, main_#t~malloc206#1.base, main_#t~malloc206#1.offset, main_#t~nondet207#1, main_#t~mem208#1, main_#t~post209#1, main_#t~mem210#1, main_#t~post211#1, main_#t~post212#1, main_~i~0#1, main_~j~0#1, main_~length~0#1, main_~arr~0#1.base, main_~arr~0#1.offset;havoc main_~i~0#1;havoc main_~j~0#1;havoc main_#t~nondet205#1;main_~length~0#1 := main_#t~nondet205#1;havoc main_#t~nondet205#1; 11#L367true assume !(main_~length~0#1 < 1); 6#L367-2true call main_#t~malloc206#1.base, main_#t~malloc206#1.offset := #Ultimate.allocOnStack(4 * main_~length~0#1 % 18446744073709551616);main_~arr~0#1.base, main_~arr~0#1.offset := main_#t~malloc206#1.base, main_#t~malloc206#1.offset; 3#L369true assume !(main_~arr~0#1.base == 0 && main_~arr~0#1.offset == 0);main_~i~0#1 := 0; 4#L370-3true 
[2024-11-07 23:54:26,191 INFO  L747   eck$LassoCheckResult]: Loop: 4#L370-3true assume !!(main_~i~0#1 < main_~length~0#1);havoc main_#t~nondet207#1;call write~int#0(main_#t~nondet207#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet207#1;call main_#t~mem208#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4); 12#L372true assume main_#t~mem208#1 < 0;havoc main_#t~mem208#1;call write~int#0(0, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4); 15#L370-2true main_#t~post209#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post209#1;havoc main_#t~post209#1; 4#L370-3true 
[2024-11-07 23:54:26,195 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2024-11-07 23:54:26,196 INFO  L85        PathProgramCache]: Analyzing trace with hash 28695753, now seen corresponding path program 1 times
[2024-11-07 23:54:26,203 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-07 23:54:26,204 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [24689494]
[2024-11-07 23:54:26,204 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-07 23:54:26,204 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-07 23:54:26,309 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is sat
[2024-11-07 23:54:26,309 INFO  L356             TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders.
[2024-11-07 23:54:26,322 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is sat
[2024-11-07 23:54:26,340 INFO  L130   FreeRefinementEngine]: Strategy CAMEL found a feasible trace
[2024-11-07 23:54:26,343 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2024-11-07 23:54:26,344 INFO  L85        PathProgramCache]: Analyzing trace with hash 51737, now seen corresponding path program 1 times
[2024-11-07 23:54:26,344 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-07 23:54:26,344 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [942981477]
[2024-11-07 23:54:26,344 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-07 23:54:26,344 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-07 23:54:26,366 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is sat
[2024-11-07 23:54:26,366 INFO  L356             TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders.
[2024-11-07 23:54:26,375 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is sat
[2024-11-07 23:54:26,380 INFO  L130   FreeRefinementEngine]: Strategy CAMEL found a feasible trace
[2024-11-07 23:54:26,382 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2024-11-07 23:54:26,382 INFO  L85        PathProgramCache]: Analyzing trace with hash 176707665, now seen corresponding path program 1 times
[2024-11-07 23:54:26,382 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-07 23:54:26,382 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1915671607]
[2024-11-07 23:54:26,382 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-07 23:54:26,382 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-07 23:54:26,414 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is sat
[2024-11-07 23:54:26,414 INFO  L356             TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders.
[2024-11-07 23:54:26,432 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is sat
[2024-11-07 23:54:26,440 INFO  L130   FreeRefinementEngine]: Strategy CAMEL found a feasible trace
[2024-11-07 23:54:26,756 INFO  L204          LassoAnalysis]: Preferences:
[2024-11-07 23:54:26,756 INFO  L125   ssoRankerPreferences]: Compute integeral hull: false
[2024-11-07 23:54:26,757 INFO  L126   ssoRankerPreferences]: Enable LassoPartitioneer: true
[2024-11-07 23:54:26,758 INFO  L127   ssoRankerPreferences]: Term annotations enabled: false
[2024-11-07 23:54:26,758 INFO  L128   ssoRankerPreferences]: Use exernal solver: false
[2024-11-07 23:54:26,758 INFO  L129   ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000
[2024-11-07 23:54:26,758 INFO  L130   ssoRankerPreferences]: Dump SMT script to file: false
[2024-11-07 23:54:26,759 INFO  L131   ssoRankerPreferences]: Path of dumped script: 
[2024-11-07 23:54:26,759 INFO  L132   ssoRankerPreferences]: Filename of dumped script: array15_alloca.i_Iteration1_Lasso
[2024-11-07 23:54:26,759 INFO  L133   ssoRankerPreferences]: MapElimAlgo: Frank
[2024-11-07 23:54:26,759 INFO  L241          LassoAnalysis]: Starting lasso preprocessing...
[2024-11-07 23:54:26,769 INFO  L118          MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true
[2024-11-07 23:54:26,775 INFO  L118          MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true
[2024-11-07 23:54:26,778 INFO  L118          MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true
[2024-11-07 23:54:26,937 INFO  L118          MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true
[2024-11-07 23:54:26,942 INFO  L118          MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true
[2024-11-07 23:54:26,944 INFO  L118          MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true
[2024-11-07 23:54:26,948 INFO  L118          MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true
[2024-11-07 23:54:26,950 INFO  L118          MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true
[2024-11-07 23:54:26,954 INFO  L118          MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true
[2024-11-07 23:54:26,957 INFO  L118          MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true
[2024-11-07 23:54:26,961 INFO  L118          MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true
[2024-11-07 23:54:27,214 INFO  L259          LassoAnalysis]: Preprocessing complete.
[2024-11-07 23:54:27,219 INFO  L451          LassoAnalysis]: Using template 'affine'.
[2024-11-07 23:54:27,220 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000
[2024-11-07 23:54:27,220 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3
[2024-11-07 23:54:27,223 INFO  L229       MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null)
[2024-11-07 23:54:27,225 INFO  L327       MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Waiting until timeout for monitored process
[2024-11-07 23:54:27,225 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-07 23:54:27,236 INFO  L338   nArgumentSynthesizer]: Template has degree 0.
[2024-11-07 23:54:27,236 INFO  L351   nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation.
[2024-11-07 23:54:27,237 INFO  L203   nArgumentSynthesizer]: 1 stem disjuncts
[2024-11-07 23:54:27,237 INFO  L204   nArgumentSynthesizer]: 1 loop disjuncts
[2024-11-07 23:54:27,237 INFO  L205   nArgumentSynthesizer]: 2 template conjuncts.
[2024-11-07 23:54:27,240 INFO  L401   nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications.
[2024-11-07 23:54:27,240 INFO  L402   nArgumentSynthesizer]: A total of 0 supporting invariants were added.
[2024-11-07 23:54:27,242 INFO  L488          LassoAnalysis]: Proving termination failed for this template and these settings.
[2024-11-07 23:54:27,252 INFO  L552       MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Ended with exit code 0
[2024-11-07 23:54:27,253 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000
[2024-11-07 23:54:27,253 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3
[2024-11-07 23:54:27,255 INFO  L229       MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null)
[2024-11-07 23:54:27,255 INFO  L327       MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Waiting until timeout for monitored process
[2024-11-07 23:54:27,256 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-07 23:54:27,266 INFO  L338   nArgumentSynthesizer]: Template has degree 0.
[2024-11-07 23:54:27,266 INFO  L351   nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation.
[2024-11-07 23:54:27,266 INFO  L203   nArgumentSynthesizer]: 1 stem disjuncts
[2024-11-07 23:54:27,266 INFO  L204   nArgumentSynthesizer]: 1 loop disjuncts
[2024-11-07 23:54:27,266 INFO  L205   nArgumentSynthesizer]: 2 template conjuncts.
[2024-11-07 23:54:27,267 INFO  L401   nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications.
[2024-11-07 23:54:27,267 INFO  L402   nArgumentSynthesizer]: A total of 0 supporting invariants were added.
[2024-11-07 23:54:27,268 INFO  L488          LassoAnalysis]: Proving termination failed for this template and these settings.
[2024-11-07 23:54:27,279 INFO  L552       MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Ended with exit code 0
[2024-11-07 23:54:27,280 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000
[2024-11-07 23:54:27,280 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3
[2024-11-07 23:54:27,281 INFO  L229       MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null)
[2024-11-07 23:54:27,282 INFO  L327       MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Waiting until timeout for monitored process
[2024-11-07 23:54:27,283 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-07 23:54:27,296 INFO  L338   nArgumentSynthesizer]: Template has degree 0.
[2024-11-07 23:54:27,297 INFO  L203   nArgumentSynthesizer]: 1 stem disjuncts
[2024-11-07 23:54:27,297 INFO  L204   nArgumentSynthesizer]: 1 loop disjuncts
[2024-11-07 23:54:27,297 INFO  L205   nArgumentSynthesizer]: 2 template conjuncts.
[2024-11-07 23:54:27,301 INFO  L401   nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications.
[2024-11-07 23:54:27,301 INFO  L402   nArgumentSynthesizer]: A total of 2 supporting invariants were added.
[2024-11-07 23:54:27,307 INFO  L488          LassoAnalysis]: Proving termination failed for this template and these settings.
[2024-11-07 23:54:27,322 INFO  L552       MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Ended with exit code 0
[2024-11-07 23:54:27,322 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000
[2024-11-07 23:54:27,323 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3
[2024-11-07 23:54:27,325 INFO  L229       MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null)
[2024-11-07 23:54:27,328 INFO  L327       MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Waiting until timeout for monitored process
[2024-11-07 23:54:27,328 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-07 23:54:27,341 INFO  L338   nArgumentSynthesizer]: Template has degree 0.
[2024-11-07 23:54:27,341 INFO  L203   nArgumentSynthesizer]: 1 stem disjuncts
[2024-11-07 23:54:27,341 INFO  L204   nArgumentSynthesizer]: 1 loop disjuncts
[2024-11-07 23:54:27,341 INFO  L205   nArgumentSynthesizer]: 2 template conjuncts.
[2024-11-07 23:54:27,344 INFO  L401   nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications.
[2024-11-07 23:54:27,344 INFO  L402   nArgumentSynthesizer]: A total of 2 supporting invariants were added.
[2024-11-07 23:54:27,350 INFO  L488          LassoAnalysis]: Proving termination failed for this template and these settings.
[2024-11-07 23:54:27,365 INFO  L552       MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Ended with exit code 0
[2024-11-07 23:54:27,365 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000
[2024-11-07 23:54:27,366 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3
[2024-11-07 23:54:27,368 INFO  L229       MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null)
[2024-11-07 23:54:27,369 INFO  L327       MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Waiting until timeout for monitored process
[2024-11-07 23:54:27,371 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-07 23:54:27,382 INFO  L338   nArgumentSynthesizer]: Template has degree 0.
[2024-11-07 23:54:27,382 INFO  L203   nArgumentSynthesizer]: 1 stem disjuncts
[2024-11-07 23:54:27,382 INFO  L204   nArgumentSynthesizer]: 1 loop disjuncts
[2024-11-07 23:54:27,382 INFO  L205   nArgumentSynthesizer]: 2 template conjuncts.
[2024-11-07 23:54:27,390 INFO  L401   nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications.
[2024-11-07 23:54:27,390 INFO  L402   nArgumentSynthesizer]: A total of 2 supporting invariants were added.
[2024-11-07 23:54:27,402 INFO  L420   nArgumentSynthesizer]: Found a termination argument, trying to simplify.
[2024-11-07 23:54:27,428 INFO  L443   ModelExtractionUtils]: Simplification made 12 calls to the SMT solver.
[2024-11-07 23:54:27,430 INFO  L444   ModelExtractionUtils]: 1 out of 19 variables were initially zero. Simplification set additionally 14 variables to zero.
[2024-11-07 23:54:27,433 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000
[2024-11-07 23:54:27,433 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3
[2024-11-07 23:54:27,436 INFO  L229       MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null)
[2024-11-07 23:54:27,437 INFO  L327       MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Waiting until timeout for monitored process
[2024-11-07 23:54:27,437 INFO  L435   nArgumentSynthesizer]: Simplifying supporting invariants...
[2024-11-07 23:54:27,452 INFO  L438   nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2.
[2024-11-07 23:54:27,452 INFO  L474          LassoAnalysis]: Proved termination.
[2024-11-07 23:54:27,452 INFO  L476          LassoAnalysis]: Termination argument consisting of:
Ranking function f(ULTIMATE.start_main_~arr~0#1.offset, v_rep(select #length ULTIMATE.start_main_~arr~0#1.base)_1, ULTIMATE.start_main_~i~0#1) = -1*ULTIMATE.start_main_~arr~0#1.offset + 2*v_rep(select #length ULTIMATE.start_main_~arr~0#1.base)_1 - 4*ULTIMATE.start_main_~i~0#1
Supporting invariants []
[2024-11-07 23:54:27,467 INFO  L540       MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Forceful destruction successful, exit code 0
[2024-11-07 23:54:27,482 INFO  L156   tatePredicateManager]: 3 out of 3 supporting invariants were superfluous and have been removed
[2024-11-07 23:54:27,489 WARN  L976   BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #length
[2024-11-07 23:54:27,490 WARN  L976   BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#length,GLOBAL]
[2024-11-07 23:54:27,493 WARN  L976   BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~arr~0!offset
[2024-11-07 23:54:27,510 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2024-11-07 23:54:27,526 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 23:54:27,528 INFO  L255         TraceCheckSpWp]: Trace formula consists of 26 conjuncts, 2 conjuncts are in the unsatisfiable core
[2024-11-07 23:54:27,529 INFO  L278         TraceCheckSpWp]: Computing forward predicates...
[2024-11-07 23:54:27,551 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 23:54:27,552 INFO  L255         TraceCheckSpWp]: Trace formula consists of 24 conjuncts, 5 conjuncts are in the unsatisfiable core
[2024-11-07 23:54:27,553 INFO  L278         TraceCheckSpWp]: Computing forward predicates...
[2024-11-07 23:54:27,596 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-07 23:54:27,620 INFO  L141   lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates 
[2024-11-07 23:54:27,622 INFO  L71    iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand  has 15 states, 14 states have (on average 1.5714285714285714) internal successors, (22), 14 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 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-11-07 23:54:27,663 INFO  L75    iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand  has 15 states, 14 states have (on average 1.5714285714285714) internal successors, (22), 14 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 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 28 states and 40 transitions. Complement of second has 6 states.
[2024-11-07 23:54:27,665 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 1 non-accepting loop states 1 accepting loop states 
[2024-11-07 23:54:27,668 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-11-07 23:54:27,671 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 23 transitions.
[2024-11-07 23:54:27,675 INFO  L84            BuchiAccepts]: Start buchiAccepts Operand 4 states and 23 transitions. Stem has 5 letters. Loop has 3 letters.
[2024-11-07 23:54:27,677 INFO  L116           BuchiAccepts]: Finished buchiAccepts.
[2024-11-07 23:54:27,677 INFO  L84            BuchiAccepts]: Start buchiAccepts Operand 4 states and 23 transitions. Stem has 8 letters. Loop has 3 letters.
[2024-11-07 23:54:27,677 INFO  L116           BuchiAccepts]: Finished buchiAccepts.
[2024-11-07 23:54:27,677 INFO  L84            BuchiAccepts]: Start buchiAccepts Operand 4 states and 23 transitions. Stem has 5 letters. Loop has 6 letters.
[2024-11-07 23:54:27,678 INFO  L116           BuchiAccepts]: Finished buchiAccepts.
[2024-11-07 23:54:27,678 INFO  L82        GeneralOperation]: Start removeNonLiveStates. Operand 28 states and 40 transitions.
[2024-11-07 23:54:27,680 INFO  L131   ngComponentsAnalysis]: Automaton has 1 accepting balls. 2
[2024-11-07 23:54:27,682 INFO  L88        GeneralOperation]: Finished removeNonLiveStates. Reduced from 28 states to 12 states and 17 transitions.
[2024-11-07 23:54:27,682 INFO  L87         BuchiClosureNwa]: Accepting states before buchiClosure: 8
[2024-11-07 23:54:27,683 INFO  L106        BuchiClosureNwa]: Accepting states after buchiClosure: 9
[2024-11-07 23:54:27,683 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 12 states and 17 transitions.
[2024-11-07 23:54:27,683 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2024-11-07 23:54:27,683 INFO  L218   hiAutomatonCegarLoop]: Abstraction has 12 states and 17 transitions.
[2024-11-07 23:54:27,692 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 12 states and 17 transitions.
[2024-11-07 23:54:27,698 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 12 to 12.
[2024-11-07 23:54:27,699 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 12 states, 12 states have (on average 1.4166666666666667) internal successors, (17), 11 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-11-07 23:54:27,699 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 17 transitions.
[2024-11-07 23:54:27,700 INFO  L240   hiAutomatonCegarLoop]: Abstraction has 12 states and 17 transitions.
[2024-11-07 23:54:27,700 INFO  L425   stractBuchiCegarLoop]: Abstraction has 12 states and 17 transitions.
[2024-11-07 23:54:27,700 INFO  L332   stractBuchiCegarLoop]: ======== Iteration 2 ============
[2024-11-07 23:54:27,700 INFO  L72            BuchiIsEmpty]: Start buchiIsEmpty. Operand 12 states and 17 transitions.
[2024-11-07 23:54:27,701 INFO  L131   ngComponentsAnalysis]: Automaton has 1 accepting balls. 2
[2024-11-07 23:54:27,701 INFO  L87            BuchiIsEmpty]: Finished buchiIsEmpty Result is false
[2024-11-07 23:54:27,701 INFO  L119           BuchiIsEmpty]: Starting construction of run
[2024-11-07 23:54:27,702 INFO  L148   hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1]
[2024-11-07 23:54:27,702 INFO  L149   hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1]
[2024-11-07 23:54:27,703 INFO  L745   eck$LassoCheckResult]: Stem: 109#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 110#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet205#1, main_#t~malloc206#1.base, main_#t~malloc206#1.offset, main_#t~nondet207#1, main_#t~mem208#1, main_#t~post209#1, main_#t~mem210#1, main_#t~post211#1, main_#t~post212#1, main_~i~0#1, main_~j~0#1, main_~length~0#1, main_~arr~0#1.base, main_~arr~0#1.offset;havoc main_~i~0#1;havoc main_~j~0#1;havoc main_#t~nondet205#1;main_~length~0#1 := main_#t~nondet205#1;havoc main_#t~nondet205#1; 111#L367 assume !(main_~length~0#1 < 1); 103#L367-2 call main_#t~malloc206#1.base, main_#t~malloc206#1.offset := #Ultimate.allocOnStack(4 * main_~length~0#1 % 18446744073709551616);main_~arr~0#1.base, main_~arr~0#1.offset := main_#t~malloc206#1.base, main_#t~malloc206#1.offset; 104#L369 assume !(main_~arr~0#1.base == 0 && main_~arr~0#1.offset == 0);main_~i~0#1 := 0; 105#L370-3 assume !(main_~i~0#1 < main_~length~0#1); 108#L370-4 main_~j~0#1 := 0; 107#L378-2 
[2024-11-07 23:54:27,703 INFO  L747   eck$LassoCheckResult]: Loop: 107#L378-2 assume !!(0 <= main_~j~0#1 && main_~j~0#1 < main_~length~0#1);call main_#t~mem210#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); 106#L378 assume main_#t~mem210#1 > 0;havoc main_#t~mem210#1;main_#t~post211#1 := main_~j~0#1;main_~j~0#1 := main_#t~post211#1 - 1;havoc main_#t~post211#1; 107#L378-2 
[2024-11-07 23:54:27,704 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2024-11-07 23:54:27,704 INFO  L85        PathProgramCache]: Analyzing trace with hash 1806815510, now seen corresponding path program 1 times
[2024-11-07 23:54:27,704 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-07 23:54:27,704 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [15201703]
[2024-11-07 23:54:27,705 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-07 23:54:27,705 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-07 23:54:27,720 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 23:54:27,797 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-07 23:54:27,797 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-11-07 23:54:27,797 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [15201703]
[2024-11-07 23:54:27,798 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [15201703] provided 1 perfect and 0 imperfect interpolant sequences
[2024-11-07 23:54:27,798 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-11-07 23:54:27,798 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2024-11-07 23:54:27,798 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1724579311]
[2024-11-07 23:54:27,799 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-11-07 23:54:27,800 INFO  L750   eck$LassoCheckResult]: stem already infeasible
[2024-11-07 23:54:27,800 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2024-11-07 23:54:27,800 INFO  L85        PathProgramCache]: Analyzing trace with hash 2308, now seen corresponding path program 1 times
[2024-11-07 23:54:27,800 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-07 23:54:27,801 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [891801676]
[2024-11-07 23:54:27,801 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-07 23:54:27,801 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-07 23:54:27,806 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is sat
[2024-11-07 23:54:27,806 INFO  L356             TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders.
[2024-11-07 23:54:27,811 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is sat
[2024-11-07 23:54:27,812 INFO  L130   FreeRefinementEngine]: Strategy CAMEL found a feasible trace
[2024-11-07 23:54:27,866 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-11-07 23:54:27,867 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2024-11-07 23:54:27,868 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12
[2024-11-07 23:54:27,869 INFO  L87              Difference]: Start difference. First operand 12 states and 17 transitions. cyclomatic complexity: 7 Second operand  has 4 states, 4 states have (on average 1.75) internal successors, (7), 4 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-11-07 23:54:27,895 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2024-11-07 23:54:27,895 INFO  L93              Difference]: Finished difference Result 14 states and 19 transitions.
[2024-11-07 23:54:27,895 INFO  L82        GeneralOperation]: Start removeNonLiveStates. Operand 14 states and 19 transitions.
[2024-11-07 23:54:27,896 INFO  L131   ngComponentsAnalysis]: Automaton has 1 accepting balls. 2
[2024-11-07 23:54:27,897 INFO  L88        GeneralOperation]: Finished removeNonLiveStates. Reduced from 14 states to 14 states and 19 transitions.
[2024-11-07 23:54:27,897 INFO  L87         BuchiClosureNwa]: Accepting states before buchiClosure: 9
[2024-11-07 23:54:27,897 INFO  L106        BuchiClosureNwa]: Accepting states after buchiClosure: 9
[2024-11-07 23:54:27,897 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 14 states and 19 transitions.
[2024-11-07 23:54:27,898 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2024-11-07 23:54:27,898 INFO  L218   hiAutomatonCegarLoop]: Abstraction has 14 states and 19 transitions.
[2024-11-07 23:54:27,898 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 14 states and 19 transitions.
[2024-11-07 23:54:27,909 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 12.
[2024-11-07 23:54:27,909 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 12 states, 12 states have (on average 1.3333333333333333) internal successors, (16), 11 states have internal predecessors, (16), 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-07 23:54:27,909 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 16 transitions.
[2024-11-07 23:54:27,909 INFO  L240   hiAutomatonCegarLoop]: Abstraction has 12 states and 16 transitions.
[2024-11-07 23:54:27,910 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 
[2024-11-07 23:54:27,911 INFO  L425   stractBuchiCegarLoop]: Abstraction has 12 states and 16 transitions.
[2024-11-07 23:54:27,911 INFO  L332   stractBuchiCegarLoop]: ======== Iteration 3 ============
[2024-11-07 23:54:27,911 INFO  L72            BuchiIsEmpty]: Start buchiIsEmpty. Operand 12 states and 16 transitions.
[2024-11-07 23:54:27,911 INFO  L131   ngComponentsAnalysis]: Automaton has 1 accepting balls. 2
[2024-11-07 23:54:27,911 INFO  L87            BuchiIsEmpty]: Finished buchiIsEmpty Result is false
[2024-11-07 23:54:27,911 INFO  L119           BuchiIsEmpty]: Starting construction of run
[2024-11-07 23:54:27,911 INFO  L148   hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-11-07 23:54:27,912 INFO  L149   hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1]
[2024-11-07 23:54:27,912 INFO  L745   eck$LassoCheckResult]: Stem: 142#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 143#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet205#1, main_#t~malloc206#1.base, main_#t~malloc206#1.offset, main_#t~nondet207#1, main_#t~mem208#1, main_#t~post209#1, main_#t~mem210#1, main_#t~post211#1, main_#t~post212#1, main_~i~0#1, main_~j~0#1, main_~length~0#1, main_~arr~0#1.base, main_~arr~0#1.offset;havoc main_~i~0#1;havoc main_~j~0#1;havoc main_#t~nondet205#1;main_~length~0#1 := main_#t~nondet205#1;havoc main_#t~nondet205#1; 144#L367 assume !(main_~length~0#1 < 1); 136#L367-2 call main_#t~malloc206#1.base, main_#t~malloc206#1.offset := #Ultimate.allocOnStack(4 * main_~length~0#1 % 18446744073709551616);main_~arr~0#1.base, main_~arr~0#1.offset := main_#t~malloc206#1.base, main_#t~malloc206#1.offset; 137#L369 assume !(main_~arr~0#1.base == 0 && main_~arr~0#1.offset == 0);main_~i~0#1 := 0; 138#L370-3 assume !!(main_~i~0#1 < main_~length~0#1);havoc main_#t~nondet207#1;call write~int#0(main_#t~nondet207#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet207#1;call main_#t~mem208#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4); 145#L372 assume !(main_#t~mem208#1 < 0);havoc main_#t~mem208#1; 147#L370-2 main_#t~post209#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post209#1;havoc main_#t~post209#1; 146#L370-3 assume !(main_~i~0#1 < main_~length~0#1); 139#L370-4 main_~j~0#1 := 0; 140#L378-2 
[2024-11-07 23:54:27,912 INFO  L747   eck$LassoCheckResult]: Loop: 140#L378-2 assume !!(0 <= main_~j~0#1 && main_~j~0#1 < main_~length~0#1);call main_#t~mem210#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); 141#L378 assume main_#t~mem210#1 > 0;havoc main_#t~mem210#1;main_#t~post211#1 := main_~j~0#1;main_~j~0#1 := main_#t~post211#1 - 1;havoc main_#t~post211#1; 140#L378-2 
[2024-11-07 23:54:27,912 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2024-11-07 23:54:27,912 INFO  L85        PathProgramCache]: Analyzing trace with hash -1982565540, now seen corresponding path program 1 times
[2024-11-07 23:54:27,913 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-07 23:54:27,913 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1721579492]
[2024-11-07 23:54:27,913 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-07 23:54:27,913 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-07 23:54:27,923 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is sat
[2024-11-07 23:54:27,924 INFO  L356             TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders.
[2024-11-07 23:54:27,934 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is sat
[2024-11-07 23:54:27,937 INFO  L130   FreeRefinementEngine]: Strategy CAMEL found a feasible trace
[2024-11-07 23:54:27,938 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2024-11-07 23:54:27,938 INFO  L85        PathProgramCache]: Analyzing trace with hash 2308, now seen corresponding path program 2 times
[2024-11-07 23:54:27,938 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-07 23:54:27,938 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [369339326]
[2024-11-07 23:54:27,939 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-07 23:54:27,939 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-07 23:54:27,943 INFO  L552       MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Ended with exit code 0
[2024-11-07 23:54:27,945 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is sat
[2024-11-07 23:54:27,946 INFO  L356             TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders.
[2024-11-07 23:54:27,951 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is sat
[2024-11-07 23:54:27,953 INFO  L130   FreeRefinementEngine]: Strategy CAMEL found a feasible trace
[2024-11-07 23:54:27,953 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2024-11-07 23:54:27,953 INFO  L85        PathProgramCache]: Analyzing trace with hash 1719996831, now seen corresponding path program 1 times
[2024-11-07 23:54:27,953 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-07 23:54:27,953 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [804303732]
[2024-11-07 23:54:27,953 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-07 23:54:27,955 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-07 23:54:27,970 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is sat
[2024-11-07 23:54:27,971 INFO  L356             TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders.
[2024-11-07 23:54:27,986 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is sat
[2024-11-07 23:54:27,989 INFO  L130   FreeRefinementEngine]: Strategy CAMEL found a feasible trace
[2024-11-07 23:54:28,227 INFO  L204          LassoAnalysis]: Preferences:
[2024-11-07 23:54:28,227 INFO  L125   ssoRankerPreferences]: Compute integeral hull: false
[2024-11-07 23:54:28,227 INFO  L126   ssoRankerPreferences]: Enable LassoPartitioneer: true
[2024-11-07 23:54:28,227 INFO  L127   ssoRankerPreferences]: Term annotations enabled: false
[2024-11-07 23:54:28,227 INFO  L128   ssoRankerPreferences]: Use exernal solver: false
[2024-11-07 23:54:28,227 INFO  L129   ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000
[2024-11-07 23:54:28,227 INFO  L130   ssoRankerPreferences]: Dump SMT script to file: false
[2024-11-07 23:54:28,227 INFO  L131   ssoRankerPreferences]: Path of dumped script: 
[2024-11-07 23:54:28,227 INFO  L132   ssoRankerPreferences]: Filename of dumped script: array15_alloca.i_Iteration3_Lasso
[2024-11-07 23:54:28,227 INFO  L133   ssoRankerPreferences]: MapElimAlgo: Frank
[2024-11-07 23:54:28,227 INFO  L241          LassoAnalysis]: Starting lasso preprocessing...
[2024-11-07 23:54:28,229 INFO  L118          MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true
[2024-11-07 23:54:28,234 INFO  L118          MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true
[2024-11-07 23:54:28,236 INFO  L118          MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true
[2024-11-07 23:54:28,239 INFO  L118          MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true
[2024-11-07 23:54:28,241 INFO  L118          MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true
[2024-11-07 23:54:28,243 INFO  L118          MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true
[2024-11-07 23:54:28,246 INFO  L118          MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true
[2024-11-07 23:54:28,247 INFO  L118          MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true
[2024-11-07 23:54:28,365 INFO  L118          MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true
[2024-11-07 23:54:28,367 INFO  L118          MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true
[2024-11-07 23:54:28,370 INFO  L118          MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true
[2024-11-07 23:54:28,539 INFO  L259          LassoAnalysis]: Preprocessing complete.
[2024-11-07 23:54:28,541 INFO  L451          LassoAnalysis]: Using template 'affine'.
[2024-11-07 23:54:28,541 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000
[2024-11-07 23:54:28,542 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3
[2024-11-07 23:54:28,544 INFO  L229       MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null)
[2024-11-07 23:54:28,545 INFO  L327       MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Waiting until timeout for monitored process
[2024-11-07 23:54:28,546 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-07 23:54:28,559 INFO  L338   nArgumentSynthesizer]: Template has degree 0.
[2024-11-07 23:54:28,559 INFO  L351   nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation.
[2024-11-07 23:54:28,559 INFO  L203   nArgumentSynthesizer]: 1 stem disjuncts
[2024-11-07 23:54:28,559 INFO  L204   nArgumentSynthesizer]: 1 loop disjuncts
[2024-11-07 23:54:28,559 INFO  L205   nArgumentSynthesizer]: 2 template conjuncts.
[2024-11-07 23:54:28,560 INFO  L401   nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications.
[2024-11-07 23:54:28,560 INFO  L402   nArgumentSynthesizer]: A total of 0 supporting invariants were added.
[2024-11-07 23:54:28,563 INFO  L488          LassoAnalysis]: Proving termination failed for this template and these settings.
[2024-11-07 23:54:28,577 INFO  L552       MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Ended with exit code 0
[2024-11-07 23:54:28,578 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000
[2024-11-07 23:54:28,578 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3
[2024-11-07 23:54:28,580 INFO  L229       MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null)
[2024-11-07 23:54:28,581 INFO  L327       MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Waiting until timeout for monitored process
[2024-11-07 23:54:28,582 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-07 23:54:28,594 INFO  L338   nArgumentSynthesizer]: Template has degree 0.
[2024-11-07 23:54:28,595 INFO  L351   nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation.
[2024-11-07 23:54:28,595 INFO  L203   nArgumentSynthesizer]: 1 stem disjuncts
[2024-11-07 23:54:28,595 INFO  L204   nArgumentSynthesizer]: 1 loop disjuncts
[2024-11-07 23:54:28,595 INFO  L205   nArgumentSynthesizer]: 2 template conjuncts.
[2024-11-07 23:54:28,595 INFO  L401   nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications.
[2024-11-07 23:54:28,595 INFO  L402   nArgumentSynthesizer]: A total of 0 supporting invariants were added.
[2024-11-07 23:54:28,598 INFO  L488          LassoAnalysis]: Proving termination failed for this template and these settings.
[2024-11-07 23:54:28,612 INFO  L552       MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Ended with exit code 0
[2024-11-07 23:54:28,612 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000
[2024-11-07 23:54:28,613 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3
[2024-11-07 23:54:28,615 INFO  L229       MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null)
[2024-11-07 23:54:28,616 INFO  L327       MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Waiting until timeout for monitored process
[2024-11-07 23:54:28,617 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-07 23:54:28,630 INFO  L338   nArgumentSynthesizer]: Template has degree 0.
[2024-11-07 23:54:28,630 INFO  L351   nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation.
[2024-11-07 23:54:28,630 INFO  L203   nArgumentSynthesizer]: 1 stem disjuncts
[2024-11-07 23:54:28,630 INFO  L204   nArgumentSynthesizer]: 1 loop disjuncts
[2024-11-07 23:54:28,630 INFO  L205   nArgumentSynthesizer]: 2 template conjuncts.
[2024-11-07 23:54:28,630 INFO  L401   nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications.
[2024-11-07 23:54:28,630 INFO  L402   nArgumentSynthesizer]: A total of 0 supporting invariants were added.
[2024-11-07 23:54:28,631 INFO  L488          LassoAnalysis]: Proving termination failed for this template and these settings.
[2024-11-07 23:54:28,641 INFO  L552       MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Ended with exit code 0
[2024-11-07 23:54:28,641 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000
[2024-11-07 23:54:28,642 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3
[2024-11-07 23:54:28,643 INFO  L229       MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null)
[2024-11-07 23:54:28,644 INFO  L327       MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (11)] Waiting until timeout for monitored process
[2024-11-07 23:54:28,645 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-07 23:54:28,655 INFO  L338   nArgumentSynthesizer]: Template has degree 0.
[2024-11-07 23:54:28,655 INFO  L351   nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation.
[2024-11-07 23:54:28,655 INFO  L203   nArgumentSynthesizer]: 1 stem disjuncts
[2024-11-07 23:54:28,655 INFO  L204   nArgumentSynthesizer]: 1 loop disjuncts
[2024-11-07 23:54:28,655 INFO  L205   nArgumentSynthesizer]: 2 template conjuncts.
[2024-11-07 23:54:28,656 INFO  L401   nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications.
[2024-11-07 23:54:28,656 INFO  L402   nArgumentSynthesizer]: A total of 0 supporting invariants were added.
[2024-11-07 23:54:28,657 INFO  L488          LassoAnalysis]: Proving termination failed for this template and these settings.
[2024-11-07 23:54:28,666 INFO  L552       MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (11)] Ended with exit code 0
[2024-11-07 23:54:28,666 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000
[2024-11-07 23:54:28,666 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3
[2024-11-07 23:54:28,668 INFO  L229       MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null)
[2024-11-07 23:54:28,669 INFO  L327       MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (12)] Waiting until timeout for monitored process
[2024-11-07 23:54:28,669 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-07 23:54:28,679 INFO  L338   nArgumentSynthesizer]: Template has degree 0.
[2024-11-07 23:54:28,679 INFO  L351   nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation.
[2024-11-07 23:54:28,679 INFO  L203   nArgumentSynthesizer]: 1 stem disjuncts
[2024-11-07 23:54:28,679 INFO  L204   nArgumentSynthesizer]: 1 loop disjuncts
[2024-11-07 23:54:28,679 INFO  L205   nArgumentSynthesizer]: 2 template conjuncts.
[2024-11-07 23:54:28,680 INFO  L401   nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications.
[2024-11-07 23:54:28,680 INFO  L402   nArgumentSynthesizer]: A total of 0 supporting invariants were added.
[2024-11-07 23:54:28,681 INFO  L488          LassoAnalysis]: Proving termination failed for this template and these settings.
[2024-11-07 23:54:28,691 INFO  L552       MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (12)] Ended with exit code 0
[2024-11-07 23:54:28,691 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000
[2024-11-07 23:54:28,691 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3
[2024-11-07 23:54:28,693 INFO  L229       MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null)
[2024-11-07 23:54:28,694 INFO  L327       MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (13)] Waiting until timeout for monitored process
[2024-11-07 23:54:28,694 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-07 23:54:28,704 INFO  L338   nArgumentSynthesizer]: Template has degree 0.
[2024-11-07 23:54:28,705 INFO  L351   nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation.
[2024-11-07 23:54:28,705 INFO  L203   nArgumentSynthesizer]: 1 stem disjuncts
[2024-11-07 23:54:28,705 INFO  L204   nArgumentSynthesizer]: 1 loop disjuncts
[2024-11-07 23:54:28,705 INFO  L205   nArgumentSynthesizer]: 2 template conjuncts.
[2024-11-07 23:54:28,705 INFO  L401   nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications.
[2024-11-07 23:54:28,705 INFO  L402   nArgumentSynthesizer]: A total of 0 supporting invariants were added.
[2024-11-07 23:54:28,707 INFO  L488          LassoAnalysis]: Proving termination failed for this template and these settings.
[2024-11-07 23:54:28,717 INFO  L552       MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (13)] Ended with exit code 0
[2024-11-07 23:54:28,717 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000
[2024-11-07 23:54:28,717 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3
[2024-11-07 23:54:28,719 INFO  L229       MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null)
[2024-11-07 23:54:28,720 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-07 23:54:28,720 INFO  L327       MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (14)] Waiting until timeout for monitored process
[2024-11-07 23:54:28,730 INFO  L338   nArgumentSynthesizer]: Template has degree 0.
[2024-11-07 23:54:28,730 INFO  L351   nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation.
[2024-11-07 23:54:28,730 INFO  L203   nArgumentSynthesizer]: 1 stem disjuncts
[2024-11-07 23:54:28,730 INFO  L204   nArgumentSynthesizer]: 1 loop disjuncts
[2024-11-07 23:54:28,730 INFO  L205   nArgumentSynthesizer]: 2 template conjuncts.
[2024-11-07 23:54:28,731 INFO  L401   nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications.
[2024-11-07 23:54:28,731 INFO  L402   nArgumentSynthesizer]: A total of 0 supporting invariants were added.
[2024-11-07 23:54:28,734 INFO  L488          LassoAnalysis]: Proving termination failed for this template and these settings.
[2024-11-07 23:54:28,748 INFO  L552       MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (14)] Ended with exit code 0
[2024-11-07 23:54:28,749 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000
[2024-11-07 23:54:28,749 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3
[2024-11-07 23:54:28,751 INFO  L229       MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null)
[2024-11-07 23:54:28,752 INFO  L327       MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (15)] Waiting until timeout for monitored process
[2024-11-07 23:54:28,753 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-07 23:54:28,764 INFO  L338   nArgumentSynthesizer]: Template has degree 0.
[2024-11-07 23:54:28,764 INFO  L203   nArgumentSynthesizer]: 1 stem disjuncts
[2024-11-07 23:54:28,764 INFO  L204   nArgumentSynthesizer]: 1 loop disjuncts
[2024-11-07 23:54:28,765 INFO  L205   nArgumentSynthesizer]: 2 template conjuncts.
[2024-11-07 23:54:28,771 INFO  L401   nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications.
[2024-11-07 23:54:28,771 INFO  L402   nArgumentSynthesizer]: A total of 2 supporting invariants were added.
[2024-11-07 23:54:28,783 INFO  L420   nArgumentSynthesizer]: Found a termination argument, trying to simplify.
[2024-11-07 23:54:28,826 INFO  L443   ModelExtractionUtils]: Simplification made 25 calls to the SMT solver.
[2024-11-07 23:54:28,826 INFO  L444   ModelExtractionUtils]: 1 out of 19 variables were initially zero. Simplification set additionally 15 variables to zero.
[2024-11-07 23:54:28,826 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000
[2024-11-07 23:54:28,826 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3
[2024-11-07 23:54:28,828 INFO  L229       MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null)
[2024-11-07 23:54:28,830 INFO  L327       MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (16)] Waiting until timeout for monitored process
[2024-11-07 23:54:28,830 INFO  L435   nArgumentSynthesizer]: Simplifying supporting invariants...
[2024-11-07 23:54:28,845 INFO  L438   nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2.
[2024-11-07 23:54:28,845 INFO  L474          LassoAnalysis]: Proved termination.
[2024-11-07 23:54:28,845 INFO  L476          LassoAnalysis]: Termination argument consisting of:
Ranking function f(ULTIMATE.start_main_~j~0#1, v_rep(select #length ULTIMATE.start_main_#t~malloc206#1.base)_2) = 2*ULTIMATE.start_main_~j~0#1 + 1*v_rep(select #length ULTIMATE.start_main_#t~malloc206#1.base)_2
Supporting invariants []
[2024-11-07 23:54:28,859 INFO  L552       MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (15)] Ended with exit code 0
[2024-11-07 23:54:28,868 INFO  L156   tatePredicateManager]: 2 out of 3 supporting invariants were superfluous and have been removed
[2024-11-07 23:54:28,871 WARN  L976   BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #length
[2024-11-07 23:54:28,871 WARN  L976   BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#length,GLOBAL]
[2024-11-07 23:54:28,891 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2024-11-07 23:54:28,906 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 23:54:28,907 INFO  L255         TraceCheckSpWp]: Trace formula consists of 43 conjuncts, 4 conjuncts are in the unsatisfiable core
[2024-11-07 23:54:28,908 INFO  L278         TraceCheckSpWp]: Computing forward predicates...
[2024-11-07 23:54:28,938 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 23:54:28,938 WARN  L253         TraceCheckSpWp]: Trace formula consists of 15 conjuncts, 8 conjuncts are in the unsatisfiable core
[2024-11-07 23:54:28,939 INFO  L278         TraceCheckSpWp]: Computing forward predicates...
[2024-11-07 23:54:28,965 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-07 23:54:28,966 INFO  L141   lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.2 stem predicates 2 loop predicates 
[2024-11-07 23:54:28,966 INFO  L71    iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 12 states and 16 transitions. cyclomatic complexity: 6 Second operand  has 4 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-11-07 23:54:29,013 INFO  L75    iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 12 states and 16 transitions. cyclomatic complexity: 6. Second operand  has 4 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 16 states and 22 transitions. Complement of second has 6 states.
[2024-11-07 23:54:29,013 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 2 stem states 1 non-accepting loop states 1 accepting loop states 
[2024-11-07 23:54:29,014 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 4 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-11-07 23:54:29,014 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 14 transitions.
[2024-11-07 23:54:29,014 INFO  L84            BuchiAccepts]: Start buchiAccepts Operand 4 states and 14 transitions. Stem has 10 letters. Loop has 2 letters.
[2024-11-07 23:54:29,014 INFO  L116           BuchiAccepts]: Finished buchiAccepts.
[2024-11-07 23:54:29,014 INFO  L84            BuchiAccepts]: Start buchiAccepts Operand 4 states and 14 transitions. Stem has 12 letters. Loop has 2 letters.
[2024-11-07 23:54:29,014 INFO  L116           BuchiAccepts]: Finished buchiAccepts.
[2024-11-07 23:54:29,014 INFO  L84            BuchiAccepts]: Start buchiAccepts Operand 4 states and 14 transitions. Stem has 10 letters. Loop has 4 letters.
[2024-11-07 23:54:29,015 INFO  L116           BuchiAccepts]: Finished buchiAccepts.
[2024-11-07 23:54:29,015 INFO  L82        GeneralOperation]: Start removeNonLiveStates. Operand 16 states and 22 transitions.
[2024-11-07 23:54:29,015 INFO  L131   ngComponentsAnalysis]: Automaton has 1 accepting balls. 2
[2024-11-07 23:54:29,015 INFO  L88        GeneralOperation]: Finished removeNonLiveStates. Reduced from 16 states to 16 states and 22 transitions.
[2024-11-07 23:54:29,015 INFO  L87         BuchiClosureNwa]: Accepting states before buchiClosure: 10
[2024-11-07 23:54:29,015 INFO  L106        BuchiClosureNwa]: Accepting states after buchiClosure: 11
[2024-11-07 23:54:29,016 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 16 states and 22 transitions.
[2024-11-07 23:54:29,016 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is not deterministic.
[2024-11-07 23:54:29,016 INFO  L218   hiAutomatonCegarLoop]: Abstraction has 16 states and 22 transitions.
[2024-11-07 23:54:29,016 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 16 states and 22 transitions.
[2024-11-07 23:54:29,016 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 16.
[2024-11-07 23:54:29,017 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 16 states, 16 states have (on average 1.375) 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-07 23:54:29,017 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 22 transitions.
[2024-11-07 23:54:29,017 INFO  L240   hiAutomatonCegarLoop]: Abstraction has 16 states and 22 transitions.
[2024-11-07 23:54:29,017 INFO  L425   stractBuchiCegarLoop]: Abstraction has 16 states and 22 transitions.
[2024-11-07 23:54:29,017 INFO  L332   stractBuchiCegarLoop]: ======== Iteration 4 ============
[2024-11-07 23:54:29,017 INFO  L72            BuchiIsEmpty]: Start buchiIsEmpty. Operand 16 states and 22 transitions.
[2024-11-07 23:54:29,018 INFO  L131   ngComponentsAnalysis]: Automaton has 1 accepting balls. 2
[2024-11-07 23:54:29,018 INFO  L87            BuchiIsEmpty]: Finished buchiIsEmpty Result is false
[2024-11-07 23:54:29,018 INFO  L119           BuchiIsEmpty]: Starting construction of run
[2024-11-07 23:54:29,018 INFO  L148   hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-11-07 23:54:29,018 INFO  L149   hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1]
[2024-11-07 23:54:29,018 INFO  L745   eck$LassoCheckResult]: Stem: 248#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 249#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet205#1, main_#t~malloc206#1.base, main_#t~malloc206#1.offset, main_#t~nondet207#1, main_#t~mem208#1, main_#t~post209#1, main_#t~mem210#1, main_#t~post211#1, main_#t~post212#1, main_~i~0#1, main_~j~0#1, main_~length~0#1, main_~arr~0#1.base, main_~arr~0#1.offset;havoc main_~i~0#1;havoc main_~j~0#1;havoc main_#t~nondet205#1;main_~length~0#1 := main_#t~nondet205#1;havoc main_#t~nondet205#1; 250#L367 assume !(main_~length~0#1 < 1); 239#L367-2 call main_#t~malloc206#1.base, main_#t~malloc206#1.offset := #Ultimate.allocOnStack(4 * main_~length~0#1 % 18446744073709551616);main_~arr~0#1.base, main_~arr~0#1.offset := main_#t~malloc206#1.base, main_#t~malloc206#1.offset; 240#L369 assume !(main_~arr~0#1.base == 0 && main_~arr~0#1.offset == 0);main_~i~0#1 := 0; 241#L370-3 assume !!(main_~i~0#1 < main_~length~0#1);havoc main_#t~nondet207#1;call write~int#0(main_#t~nondet207#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet207#1;call main_#t~mem208#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4); 251#L372 assume !(main_#t~mem208#1 < 0);havoc main_#t~mem208#1; 254#L370-2 main_#t~post209#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post209#1;havoc main_#t~post209#1; 252#L370-3 assume !(main_~i~0#1 < main_~length~0#1); 242#L370-4 main_~j~0#1 := 0; 243#L378-2 assume !!(0 <= main_~j~0#1 && main_~j~0#1 < main_~length~0#1);call main_#t~mem210#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); 244#L378 assume !(main_#t~mem210#1 > 0);havoc main_#t~mem210#1;main_#t~post212#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post212#1;havoc main_#t~post212#1; 245#L378-2 
[2024-11-07 23:54:29,018 INFO  L747   eck$LassoCheckResult]: Loop: 245#L378-2 assume !!(0 <= main_~j~0#1 && main_~j~0#1 < main_~length~0#1);call main_#t~mem210#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); 253#L378 assume main_#t~mem210#1 > 0;havoc main_#t~mem210#1;main_#t~post211#1 := main_~j~0#1;main_~j~0#1 := main_#t~post211#1 - 1;havoc main_#t~post211#1; 245#L378-2 
[2024-11-07 23:54:29,019 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2024-11-07 23:54:29,019 INFO  L85        PathProgramCache]: Analyzing trace with hash 1719996833, now seen corresponding path program 1 times
[2024-11-07 23:54:29,019 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-07 23:54:29,019 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1237486921]
[2024-11-07 23:54:29,019 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-07 23:54:29,019 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-07 23:54:29,035 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is sat
[2024-11-07 23:54:29,036 INFO  L356             TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders.
[2024-11-07 23:54:29,051 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is sat
[2024-11-07 23:54:29,059 INFO  L130   FreeRefinementEngine]: Strategy CAMEL found a feasible trace
[2024-11-07 23:54:29,060 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2024-11-07 23:54:29,060 INFO  L85        PathProgramCache]: Analyzing trace with hash 2308, now seen corresponding path program 3 times
[2024-11-07 23:54:29,060 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-07 23:54:29,060 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1691142168]
[2024-11-07 23:54:29,060 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-07 23:54:29,060 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-07 23:54:29,067 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is sat
[2024-11-07 23:54:29,067 INFO  L356             TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders.
[2024-11-07 23:54:29,073 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is sat
[2024-11-07 23:54:29,074 INFO  L130   FreeRefinementEngine]: Strategy CAMEL found a feasible trace
[2024-11-07 23:54:29,074 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2024-11-07 23:54:29,074 INFO  L85        PathProgramCache]: Analyzing trace with hash -645451100, now seen corresponding path program 1 times
[2024-11-07 23:54:29,075 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-07 23:54:29,075 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [511009257]
[2024-11-07 23:54:29,075 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-07 23:54:29,075 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-07 23:54:29,088 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 23:54:29,206 INFO  L134       CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-11-07 23:54:29,206 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-11-07 23:54:29,206 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [511009257]
[2024-11-07 23:54:29,207 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [511009257] provided 0 perfect and 1 imperfect interpolant sequences
[2024-11-07 23:54:29,207 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2072346392]
[2024-11-07 23:54:29,207 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-07 23:54:29,207 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2024-11-07 23:54:29,207 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3
[2024-11-07 23:54:29,209 INFO  L229       MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2024-11-07 23:54:29,210 INFO  L327       MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process
[2024-11-07 23:54:29,255 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 23:54:29,256 INFO  L255         TraceCheckSpWp]: Trace formula consists of 65 conjuncts, 6 conjuncts are in the unsatisfiable core
[2024-11-07 23:54:29,257 INFO  L278         TraceCheckSpWp]: Computing forward predicates...
[2024-11-07 23:54:29,303 INFO  L134       CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-11-07 23:54:29,304 INFO  L311         TraceCheckSpWp]: Computing backward predicates...
[2024-11-07 23:54:29,348 INFO  L134       CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-11-07 23:54:29,348 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleZ3 [2072346392] provided 0 perfect and 2 imperfect interpolant sequences
[2024-11-07 23:54:29,348 INFO  L185   FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences.
[2024-11-07 23:54:29,349 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 11
[2024-11-07 23:54:29,349 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1179670916]
[2024-11-07 23:54:29,349 INFO  L85    oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton
[2024-11-07 23:54:29,424 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-11-07 23:54:29,425 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants.
[2024-11-07 23:54:29,425 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=78, Unknown=0, NotChecked=0, Total=110
[2024-11-07 23:54:29,425 INFO  L87              Difference]: Start difference. First operand 16 states and 22 transitions. cyclomatic complexity: 9 Second operand  has 11 states, 11 states have (on average 2.272727272727273) internal successors, (25), 11 states have internal predecessors, (25), 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-07 23:54:29,429 INFO  L540       MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (16)] Forceful destruction successful, exit code 0
[2024-11-07 23:54:29,535 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2024-11-07 23:54:29,535 INFO  L93              Difference]: Finished difference Result 35 states and 48 transitions.
[2024-11-07 23:54:29,535 INFO  L82        GeneralOperation]: Start removeNonLiveStates. Operand 35 states and 48 transitions.
[2024-11-07 23:54:29,536 INFO  L131   ngComponentsAnalysis]: Automaton has 1 accepting balls. 2
[2024-11-07 23:54:29,537 INFO  L88        GeneralOperation]: Finished removeNonLiveStates. Reduced from 35 states to 21 states and 28 transitions.
[2024-11-07 23:54:29,537 INFO  L87         BuchiClosureNwa]: Accepting states before buchiClosure: 11
[2024-11-07 23:54:29,537 INFO  L106        BuchiClosureNwa]: Accepting states after buchiClosure: 11
[2024-11-07 23:54:29,537 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 21 states and 28 transitions.
[2024-11-07 23:54:29,537 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is not deterministic.
[2024-11-07 23:54:29,537 INFO  L218   hiAutomatonCegarLoop]: Abstraction has 21 states and 28 transitions.
[2024-11-07 23:54:29,537 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 21 states and 28 transitions.
[2024-11-07 23:54:29,538 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 19.
[2024-11-07 23:54:29,540 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 19 states, 19 states have (on average 1.3157894736842106) internal successors, (25), 18 states have internal predecessors, (25), 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-07 23:54:29,541 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 25 transitions.
[2024-11-07 23:54:29,541 INFO  L240   hiAutomatonCegarLoop]: Abstraction has 19 states and 25 transitions.
[2024-11-07 23:54:29,541 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. 
[2024-11-07 23:54:29,542 INFO  L425   stractBuchiCegarLoop]: Abstraction has 19 states and 25 transitions.
[2024-11-07 23:54:29,543 INFO  L332   stractBuchiCegarLoop]: ======== Iteration 5 ============
[2024-11-07 23:54:29,543 INFO  L72            BuchiIsEmpty]: Start buchiIsEmpty. Operand 19 states and 25 transitions.
[2024-11-07 23:54:29,543 INFO  L131   ngComponentsAnalysis]: Automaton has 1 accepting balls. 2
[2024-11-07 23:54:29,544 INFO  L87            BuchiIsEmpty]: Finished buchiIsEmpty Result is false
[2024-11-07 23:54:29,544 INFO  L119           BuchiIsEmpty]: Starting construction of run
[2024-11-07 23:54:29,544 INFO  L148   hiAutomatonCegarLoop]: Counterexample stem histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-11-07 23:54:29,544 INFO  L149   hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1]
[2024-11-07 23:54:29,545 INFO  L745   eck$LassoCheckResult]: Stem: 399#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 400#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet205#1, main_#t~malloc206#1.base, main_#t~malloc206#1.offset, main_#t~nondet207#1, main_#t~mem208#1, main_#t~post209#1, main_#t~mem210#1, main_#t~post211#1, main_#t~post212#1, main_~i~0#1, main_~j~0#1, main_~length~0#1, main_~arr~0#1.base, main_~arr~0#1.offset;havoc main_~i~0#1;havoc main_~j~0#1;havoc main_#t~nondet205#1;main_~length~0#1 := main_#t~nondet205#1;havoc main_#t~nondet205#1; 401#L367 assume !(main_~length~0#1 < 1); 390#L367-2 call main_#t~malloc206#1.base, main_#t~malloc206#1.offset := #Ultimate.allocOnStack(4 * main_~length~0#1 % 18446744073709551616);main_~arr~0#1.base, main_~arr~0#1.offset := main_#t~malloc206#1.base, main_#t~malloc206#1.offset; 391#L369 assume !(main_~arr~0#1.base == 0 && main_~arr~0#1.offset == 0);main_~i~0#1 := 0; 392#L370-3 assume !!(main_~i~0#1 < main_~length~0#1);havoc main_#t~nondet207#1;call write~int#0(main_#t~nondet207#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet207#1;call main_#t~mem208#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4); 402#L372 assume !(main_#t~mem208#1 < 0);havoc main_#t~mem208#1; 407#L370-2 main_#t~post209#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post209#1;havoc main_#t~post209#1; 403#L370-3 assume !!(main_~i~0#1 < main_~length~0#1);havoc main_#t~nondet207#1;call write~int#0(main_#t~nondet207#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet207#1;call main_#t~mem208#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4); 404#L372 assume !(main_#t~mem208#1 < 0);havoc main_#t~mem208#1; 406#L370-2 main_#t~post209#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post209#1;havoc main_#t~post209#1; 408#L370-3 assume !(main_~i~0#1 < main_~length~0#1); 397#L370-4 main_~j~0#1 := 0; 398#L378-2 assume !!(0 <= main_~j~0#1 && main_~j~0#1 < main_~length~0#1);call main_#t~mem210#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); 393#L378 assume !(main_#t~mem210#1 > 0);havoc main_#t~mem210#1;main_#t~post212#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post212#1;havoc main_#t~post212#1; 394#L378-2 
[2024-11-07 23:54:29,545 INFO  L747   eck$LassoCheckResult]: Loop: 394#L378-2 assume !!(0 <= main_~j~0#1 && main_~j~0#1 < main_~length~0#1);call main_#t~mem210#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); 405#L378 assume main_#t~mem210#1 > 0;havoc main_#t~mem210#1;main_#t~post211#1 := main_~j~0#1;main_~j~0#1 := main_#t~post211#1 - 1;havoc main_#t~post211#1; 394#L378-2 
[2024-11-07 23:54:29,545 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2024-11-07 23:54:29,545 INFO  L85        PathProgramCache]: Analyzing trace with hash -1238701285, now seen corresponding path program 2 times
[2024-11-07 23:54:29,546 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-07 23:54:29,546 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [450399050]
[2024-11-07 23:54:29,546 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-07 23:54:29,546 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-07 23:54:29,569 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is sat
[2024-11-07 23:54:29,569 INFO  L356             TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders.
[2024-11-07 23:54:29,584 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is sat
[2024-11-07 23:54:29,590 INFO  L130   FreeRefinementEngine]: Strategy CAMEL found a feasible trace
[2024-11-07 23:54:29,590 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2024-11-07 23:54:29,591 INFO  L85        PathProgramCache]: Analyzing trace with hash 2308, now seen corresponding path program 4 times
[2024-11-07 23:54:29,591 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-07 23:54:29,591 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1895101514]
[2024-11-07 23:54:29,591 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-07 23:54:29,591 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-07 23:54:29,596 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is sat
[2024-11-07 23:54:29,597 INFO  L356             TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders.
[2024-11-07 23:54:29,600 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is sat
[2024-11-07 23:54:29,602 INFO  L130   FreeRefinementEngine]: Strategy CAMEL found a feasible trace
[2024-11-07 23:54:29,602 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2024-11-07 23:54:29,602 INFO  L85        PathProgramCache]: Analyzing trace with hash -685992546, now seen corresponding path program 2 times
[2024-11-07 23:54:29,602 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-07 23:54:29,603 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1211613685]
[2024-11-07 23:54:29,603 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-07 23:54:29,603 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-07 23:54:29,618 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is sat
[2024-11-07 23:54:29,618 INFO  L356             TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders.
[2024-11-07 23:54:29,625 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is sat
[2024-11-07 23:54:29,628 INFO  L130   FreeRefinementEngine]: Strategy CAMEL found a feasible trace
[2024-11-07 23:54:29,948 INFO  L204          LassoAnalysis]: Preferences:
[2024-11-07 23:54:29,948 INFO  L125   ssoRankerPreferences]: Compute integeral hull: false
[2024-11-07 23:54:29,948 INFO  L126   ssoRankerPreferences]: Enable LassoPartitioneer: true
[2024-11-07 23:54:29,948 INFO  L127   ssoRankerPreferences]: Term annotations enabled: false
[2024-11-07 23:54:29,948 INFO  L128   ssoRankerPreferences]: Use exernal solver: false
[2024-11-07 23:54:29,949 INFO  L129   ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000
[2024-11-07 23:54:29,949 INFO  L130   ssoRankerPreferences]: Dump SMT script to file: false
[2024-11-07 23:54:29,949 INFO  L131   ssoRankerPreferences]: Path of dumped script: 
[2024-11-07 23:54:29,949 INFO  L132   ssoRankerPreferences]: Filename of dumped script: array15_alloca.i_Iteration5_Lasso
[2024-11-07 23:54:29,949 INFO  L133   ssoRankerPreferences]: MapElimAlgo: Frank
[2024-11-07 23:54:29,949 INFO  L241          LassoAnalysis]: Starting lasso preprocessing...
[2024-11-07 23:54:29,950 INFO  L118          MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true
[2024-11-07 23:54:29,952 INFO  L118          MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true
[2024-11-07 23:54:29,954 INFO  L118          MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true
[2024-11-07 23:54:29,956 INFO  L118          MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true
[2024-11-07 23:54:29,958 INFO  L118          MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true
[2024-11-07 23:54:29,961 INFO  L118          MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true
[2024-11-07 23:54:29,962 INFO  L118          MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true
[2024-11-07 23:54:30,085 INFO  L118          MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true
[2024-11-07 23:54:30,088 INFO  L118          MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true
[2024-11-07 23:54:30,089 INFO  L118          MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true
[2024-11-07 23:54:30,091 INFO  L118          MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true
[2024-11-07 23:54:30,223 INFO  L259          LassoAnalysis]: Preprocessing complete.
[2024-11-07 23:54:30,223 INFO  L451          LassoAnalysis]: Using template 'affine'.
[2024-11-07 23:54:30,223 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000
[2024-11-07 23:54:30,223 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3
[2024-11-07 23:54:30,225 INFO  L229       MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null)
[2024-11-07 23:54:30,228 INFO  L327       MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (18)] Waiting until timeout for monitored process
[2024-11-07 23:54:30,229 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-07 23:54:30,241 INFO  L338   nArgumentSynthesizer]: Template has degree 0.
[2024-11-07 23:54:30,242 INFO  L351   nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation.
[2024-11-07 23:54:30,242 INFO  L203   nArgumentSynthesizer]: 1 stem disjuncts
[2024-11-07 23:54:30,242 INFO  L204   nArgumentSynthesizer]: 1 loop disjuncts
[2024-11-07 23:54:30,242 INFO  L205   nArgumentSynthesizer]: 2 template conjuncts.
[2024-11-07 23:54:30,242 INFO  L401   nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications.
[2024-11-07 23:54:30,242 INFO  L402   nArgumentSynthesizer]: A total of 0 supporting invariants were added.
[2024-11-07 23:54:30,244 INFO  L488          LassoAnalysis]: Proving termination failed for this template and these settings.
[2024-11-07 23:54:30,253 INFO  L552       MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (18)] Ended with exit code 0
[2024-11-07 23:54:30,254 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000
[2024-11-07 23:54:30,254 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3
[2024-11-07 23:54:30,255 INFO  L229       MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null)
[2024-11-07 23:54:30,257 INFO  L327       MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (19)] Waiting until timeout for monitored process
[2024-11-07 23:54:30,257 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-07 23:54:30,267 INFO  L338   nArgumentSynthesizer]: Template has degree 0.
[2024-11-07 23:54:30,267 INFO  L351   nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation.
[2024-11-07 23:54:30,268 INFO  L203   nArgumentSynthesizer]: 1 stem disjuncts
[2024-11-07 23:54:30,268 INFO  L204   nArgumentSynthesizer]: 1 loop disjuncts
[2024-11-07 23:54:30,268 INFO  L205   nArgumentSynthesizer]: 2 template conjuncts.
[2024-11-07 23:54:30,268 INFO  L401   nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications.
[2024-11-07 23:54:30,268 INFO  L402   nArgumentSynthesizer]: A total of 0 supporting invariants were added.
[2024-11-07 23:54:30,271 INFO  L488          LassoAnalysis]: Proving termination failed for this template and these settings.
[2024-11-07 23:54:30,284 INFO  L552       MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (19)] Ended with exit code 0
[2024-11-07 23:54:30,284 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000
[2024-11-07 23:54:30,285 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3
[2024-11-07 23:54:30,286 INFO  L229       MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null)
[2024-11-07 23:54:30,287 INFO  L327       MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (20)] Waiting until timeout for monitored process
[2024-11-07 23:54:30,288 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-07 23:54:30,297 INFO  L338   nArgumentSynthesizer]: Template has degree 0.
[2024-11-07 23:54:30,298 INFO  L351   nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation.
[2024-11-07 23:54:30,298 INFO  L203   nArgumentSynthesizer]: 1 stem disjuncts
[2024-11-07 23:54:30,298 INFO  L204   nArgumentSynthesizer]: 1 loop disjuncts
[2024-11-07 23:54:30,298 INFO  L205   nArgumentSynthesizer]: 2 template conjuncts.
[2024-11-07 23:54:30,298 INFO  L401   nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications.
[2024-11-07 23:54:30,298 INFO  L402   nArgumentSynthesizer]: A total of 0 supporting invariants were added.
[2024-11-07 23:54:30,299 INFO  L488          LassoAnalysis]: Proving termination failed for this template and these settings.
[2024-11-07 23:54:30,309 INFO  L552       MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (20)] Ended with exit code 0
[2024-11-07 23:54:30,310 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000
[2024-11-07 23:54:30,310 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3
[2024-11-07 23:54:30,312 INFO  L229       MonitoredProcess]: Starting monitored process 21 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null)
[2024-11-07 23:54:30,312 INFO  L327       MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (21)] Waiting until timeout for monitored process
[2024-11-07 23:54:30,313 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-07 23:54:30,323 INFO  L338   nArgumentSynthesizer]: Template has degree 0.
[2024-11-07 23:54:30,323 INFO  L351   nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation.
[2024-11-07 23:54:30,323 INFO  L203   nArgumentSynthesizer]: 1 stem disjuncts
[2024-11-07 23:54:30,323 INFO  L204   nArgumentSynthesizer]: 1 loop disjuncts
[2024-11-07 23:54:30,323 INFO  L205   nArgumentSynthesizer]: 2 template conjuncts.
[2024-11-07 23:54:30,323 INFO  L401   nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications.
[2024-11-07 23:54:30,323 INFO  L402   nArgumentSynthesizer]: A total of 0 supporting invariants were added.
[2024-11-07 23:54:30,324 INFO  L488          LassoAnalysis]: Proving termination failed for this template and these settings.
[2024-11-07 23:54:30,334 INFO  L540       MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (21)] Forceful destruction successful, exit code 0
[2024-11-07 23:54:30,334 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000
[2024-11-07 23:54:30,335 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3
[2024-11-07 23:54:30,336 INFO  L229       MonitoredProcess]: Starting monitored process 22 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null)
[2024-11-07 23:54:30,337 INFO  L327       MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (22)] Waiting until timeout for monitored process
[2024-11-07 23:54:30,337 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-07 23:54:30,347 INFO  L338   nArgumentSynthesizer]: Template has degree 0.
[2024-11-07 23:54:30,347 INFO  L351   nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation.
[2024-11-07 23:54:30,347 INFO  L203   nArgumentSynthesizer]: 1 stem disjuncts
[2024-11-07 23:54:30,347 INFO  L204   nArgumentSynthesizer]: 1 loop disjuncts
[2024-11-07 23:54:30,347 INFO  L205   nArgumentSynthesizer]: 2 template conjuncts.
[2024-11-07 23:54:30,348 INFO  L401   nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications.
[2024-11-07 23:54:30,348 INFO  L402   nArgumentSynthesizer]: A total of 0 supporting invariants were added.
[2024-11-07 23:54:30,348 INFO  L488          LassoAnalysis]: Proving termination failed for this template and these settings.
[2024-11-07 23:54:30,358 INFO  L552       MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (22)] Ended with exit code 0
[2024-11-07 23:54:30,359 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000
[2024-11-07 23:54:30,359 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3
[2024-11-07 23:54:30,361 INFO  L229       MonitoredProcess]: Starting monitored process 23 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null)
[2024-11-07 23:54:30,361 INFO  L327       MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (23)] Waiting until timeout for monitored process
[2024-11-07 23:54:30,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-07 23:54:30,372 INFO  L338   nArgumentSynthesizer]: Template has degree 0.
[2024-11-07 23:54:30,372 INFO  L351   nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation.
[2024-11-07 23:54:30,373 INFO  L203   nArgumentSynthesizer]: 1 stem disjuncts
[2024-11-07 23:54:30,373 INFO  L204   nArgumentSynthesizer]: 1 loop disjuncts
[2024-11-07 23:54:30,373 INFO  L205   nArgumentSynthesizer]: 2 template conjuncts.
[2024-11-07 23:54:30,373 INFO  L401   nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications.
[2024-11-07 23:54:30,373 INFO  L402   nArgumentSynthesizer]: A total of 0 supporting invariants were added.
[2024-11-07 23:54:30,374 INFO  L488          LassoAnalysis]: Proving termination failed for this template and these settings.
[2024-11-07 23:54:30,386 INFO  L552       MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (23)] Ended with exit code 0
[2024-11-07 23:54:30,387 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000
[2024-11-07 23:54:30,387 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3
[2024-11-07 23:54:30,388 INFO  L229       MonitoredProcess]: Starting monitored process 24 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null)
[2024-11-07 23:54:30,389 INFO  L327       MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (24)] Waiting until timeout for monitored process
[2024-11-07 23:54:30,390 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-07 23:54:30,399 INFO  L338   nArgumentSynthesizer]: Template has degree 0.
[2024-11-07 23:54:30,399 INFO  L203   nArgumentSynthesizer]: 1 stem disjuncts
[2024-11-07 23:54:30,399 INFO  L204   nArgumentSynthesizer]: 1 loop disjuncts
[2024-11-07 23:54:30,399 INFO  L205   nArgumentSynthesizer]: 2 template conjuncts.
[2024-11-07 23:54:30,401 INFO  L401   nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications.
[2024-11-07 23:54:30,401 INFO  L402   nArgumentSynthesizer]: A total of 2 supporting invariants were added.
[2024-11-07 23:54:30,404 INFO  L488          LassoAnalysis]: Proving termination failed for this template and these settings.
[2024-11-07 23:54:30,415 INFO  L552       MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (24)] Ended with exit code 0
[2024-11-07 23:54:30,415 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000
[2024-11-07 23:54:30,415 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3
[2024-11-07 23:54:30,417 INFO  L229       MonitoredProcess]: Starting monitored process 25 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null)
[2024-11-07 23:54:30,418 INFO  L327       MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (25)] Waiting until timeout for monitored process
[2024-11-07 23:54:30,419 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-07 23:54:30,429 INFO  L338   nArgumentSynthesizer]: Template has degree 0.
[2024-11-07 23:54:30,429 INFO  L203   nArgumentSynthesizer]: 1 stem disjuncts
[2024-11-07 23:54:30,429 INFO  L204   nArgumentSynthesizer]: 1 loop disjuncts
[2024-11-07 23:54:30,429 INFO  L205   nArgumentSynthesizer]: 2 template conjuncts.
[2024-11-07 23:54:30,431 INFO  L401   nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications.
[2024-11-07 23:54:30,431 INFO  L402   nArgumentSynthesizer]: A total of 2 supporting invariants were added.
[2024-11-07 23:54:30,434 INFO  L488          LassoAnalysis]: Proving termination failed for this template and these settings.
[2024-11-07 23:54:30,448 INFO  L552       MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (25)] Ended with exit code 0
[2024-11-07 23:54:30,449 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000
[2024-11-07 23:54:30,449 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3
[2024-11-07 23:54:30,451 INFO  L229       MonitoredProcess]: Starting monitored process 26 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null)
[2024-11-07 23:54:30,453 INFO  L327       MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (26)] Waiting until timeout for monitored process
[2024-11-07 23:54:30,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-07 23:54:30,465 INFO  L338   nArgumentSynthesizer]: Template has degree 0.
[2024-11-07 23:54:30,465 INFO  L203   nArgumentSynthesizer]: 1 stem disjuncts
[2024-11-07 23:54:30,465 INFO  L204   nArgumentSynthesizer]: 1 loop disjuncts
[2024-11-07 23:54:30,465 INFO  L205   nArgumentSynthesizer]: 2 template conjuncts.
[2024-11-07 23:54:30,469 INFO  L401   nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications.
[2024-11-07 23:54:30,469 INFO  L402   nArgumentSynthesizer]: A total of 2 supporting invariants were added.
[2024-11-07 23:54:30,478 INFO  L420   nArgumentSynthesizer]: Found a termination argument, trying to simplify.
[2024-11-07 23:54:30,501 INFO  L443   ModelExtractionUtils]: Simplification made 16 calls to the SMT solver.
[2024-11-07 23:54:30,501 INFO  L444   ModelExtractionUtils]: 4 out of 19 variables were initially zero. Simplification set additionally 12 variables to zero.
[2024-11-07 23:54:30,501 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000
[2024-11-07 23:54:30,501 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3
[2024-11-07 23:54:30,504 INFO  L229       MonitoredProcess]: Starting monitored process 27 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null)
[2024-11-07 23:54:30,505 INFO  L327       MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (27)] Waiting until timeout for monitored process
[2024-11-07 23:54:30,505 INFO  L435   nArgumentSynthesizer]: Simplifying supporting invariants...
[2024-11-07 23:54:30,519 INFO  L438   nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2.
[2024-11-07 23:54:30,519 INFO  L474          LassoAnalysis]: Proved termination.
[2024-11-07 23:54:30,519 INFO  L476          LassoAnalysis]: Termination argument consisting of:
Ranking function f(v_rep(select #length ULTIMATE.start_main_~arr~0#1.base)_3, ULTIMATE.start_main_~j~0#1) = 1*v_rep(select #length ULTIMATE.start_main_~arr~0#1.base)_3 + 8*ULTIMATE.start_main_~j~0#1
Supporting invariants []
[2024-11-07 23:54:30,534 INFO  L552       MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (26)] Ended with exit code 0
[2024-11-07 23:54:30,542 INFO  L156   tatePredicateManager]: 4 out of 4 supporting invariants were superfluous and have been removed
[2024-11-07 23:54:30,543 WARN  L976   BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #length
[2024-11-07 23:54:30,543 WARN  L976   BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#length,GLOBAL]
[2024-11-07 23:54:30,555 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2024-11-07 23:54:30,571 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 23:54:30,572 INFO  L255         TraceCheckSpWp]: Trace formula consists of 68 conjuncts, 2 conjuncts are in the unsatisfiable core
[2024-11-07 23:54:30,573 INFO  L278         TraceCheckSpWp]: Computing forward predicates...
[2024-11-07 23:54:30,593 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 23:54:30,593 INFO  L255         TraceCheckSpWp]: Trace formula consists of 13 conjuncts, 6 conjuncts are in the unsatisfiable core
[2024-11-07 23:54:30,593 INFO  L278         TraceCheckSpWp]: Computing forward predicates...
[2024-11-07 23:54:30,613 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-07 23:54:30,613 INFO  L141   lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates 
[2024-11-07 23:54:30,614 INFO  L71    iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 19 states and 25 transitions. cyclomatic complexity: 9 Second operand  has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 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-07 23:54:30,630 INFO  L75    iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 19 states and 25 transitions. cyclomatic complexity: 9. Second operand  has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 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) Result 23 states and 31 transitions. Complement of second has 5 states.
[2024-11-07 23:54:30,630 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states 
[2024-11-07 23:54:30,631 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 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-07 23:54:30,631 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 16 transitions.
[2024-11-07 23:54:30,631 INFO  L84            BuchiAccepts]: Start buchiAccepts Operand 3 states and 16 transitions. Stem has 15 letters. Loop has 2 letters.
[2024-11-07 23:54:30,631 INFO  L116           BuchiAccepts]: Finished buchiAccepts.
[2024-11-07 23:54:30,631 INFO  L84            BuchiAccepts]: Start buchiAccepts Operand 3 states and 16 transitions. Stem has 17 letters. Loop has 2 letters.
[2024-11-07 23:54:30,631 INFO  L116           BuchiAccepts]: Finished buchiAccepts.
[2024-11-07 23:54:30,631 INFO  L84            BuchiAccepts]: Start buchiAccepts Operand 3 states and 16 transitions. Stem has 15 letters. Loop has 4 letters.
[2024-11-07 23:54:30,631 INFO  L116           BuchiAccepts]: Finished buchiAccepts.
[2024-11-07 23:54:30,631 INFO  L82        GeneralOperation]: Start removeNonLiveStates. Operand 23 states and 31 transitions.
[2024-11-07 23:54:30,632 INFO  L131   ngComponentsAnalysis]: Automaton has 1 accepting balls. 2
[2024-11-07 23:54:30,632 INFO  L88        GeneralOperation]: Finished removeNonLiveStates. Reduced from 23 states to 23 states and 31 transitions.
[2024-11-07 23:54:30,632 INFO  L87         BuchiClosureNwa]: Accepting states before buchiClosure: 12
[2024-11-07 23:54:30,632 INFO  L106        BuchiClosureNwa]: Accepting states after buchiClosure: 13
[2024-11-07 23:54:30,632 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 23 states and 31 transitions.
[2024-11-07 23:54:30,633 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is not deterministic.
[2024-11-07 23:54:30,633 INFO  L218   hiAutomatonCegarLoop]: Abstraction has 23 states and 31 transitions.
[2024-11-07 23:54:30,633 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 23 states and 31 transitions.
[2024-11-07 23:54:30,633 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23.
[2024-11-07 23:54:30,634 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 23 states, 23 states have (on average 1.3478260869565217) internal successors, (31), 22 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-11-07 23:54:30,634 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 31 transitions.
[2024-11-07 23:54:30,634 INFO  L240   hiAutomatonCegarLoop]: Abstraction has 23 states and 31 transitions.
[2024-11-07 23:54:30,634 INFO  L425   stractBuchiCegarLoop]: Abstraction has 23 states and 31 transitions.
[2024-11-07 23:54:30,634 INFO  L332   stractBuchiCegarLoop]: ======== Iteration 6 ============
[2024-11-07 23:54:30,635 INFO  L72            BuchiIsEmpty]: Start buchiIsEmpty. Operand 23 states and 31 transitions.
[2024-11-07 23:54:30,635 INFO  L131   ngComponentsAnalysis]: Automaton has 1 accepting balls. 2
[2024-11-07 23:54:30,635 INFO  L87            BuchiIsEmpty]: Finished buchiIsEmpty Result is false
[2024-11-07 23:54:30,635 INFO  L119           BuchiIsEmpty]: Starting construction of run
[2024-11-07 23:54:30,636 INFO  L148   hiAutomatonCegarLoop]: Counterexample stem histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1]
[2024-11-07 23:54:30,636 INFO  L149   hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1]
[2024-11-07 23:54:30,636 INFO  L745   eck$LassoCheckResult]: Stem: 528#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 529#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet205#1, main_#t~malloc206#1.base, main_#t~malloc206#1.offset, main_#t~nondet207#1, main_#t~mem208#1, main_#t~post209#1, main_#t~mem210#1, main_#t~post211#1, main_#t~post212#1, main_~i~0#1, main_~j~0#1, main_~length~0#1, main_~arr~0#1.base, main_~arr~0#1.offset;havoc main_~i~0#1;havoc main_~j~0#1;havoc main_#t~nondet205#1;main_~length~0#1 := main_#t~nondet205#1;havoc main_#t~nondet205#1; 530#L367 assume !(main_~length~0#1 < 1); 519#L367-2 call main_#t~malloc206#1.base, main_#t~malloc206#1.offset := #Ultimate.allocOnStack(4 * main_~length~0#1 % 18446744073709551616);main_~arr~0#1.base, main_~arr~0#1.offset := main_#t~malloc206#1.base, main_#t~malloc206#1.offset; 520#L369 assume !(main_~arr~0#1.base == 0 && main_~arr~0#1.offset == 0);main_~i~0#1 := 0; 521#L370-3 assume !!(main_~i~0#1 < main_~length~0#1);havoc main_#t~nondet207#1;call write~int#0(main_#t~nondet207#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet207#1;call main_#t~mem208#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4); 531#L372 assume !(main_#t~mem208#1 < 0);havoc main_#t~mem208#1; 536#L370-2 main_#t~post209#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post209#1;havoc main_#t~post209#1; 532#L370-3 assume !!(main_~i~0#1 < main_~length~0#1);havoc main_#t~nondet207#1;call write~int#0(main_#t~nondet207#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet207#1;call main_#t~mem208#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4); 533#L372 assume !(main_#t~mem208#1 < 0);havoc main_#t~mem208#1; 538#L370-2 main_#t~post209#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post209#1;havoc main_#t~post209#1; 537#L370-3 assume !(main_~i~0#1 < main_~length~0#1); 526#L370-4 main_~j~0#1 := 0; 527#L378-2 assume !!(0 <= main_~j~0#1 && main_~j~0#1 < main_~length~0#1);call main_#t~mem210#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); 522#L378 assume !(main_#t~mem210#1 > 0);havoc main_#t~mem210#1;main_#t~post212#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post212#1;havoc main_#t~post212#1; 523#L378-2 assume !!(0 <= main_~j~0#1 && main_~j~0#1 < main_~length~0#1);call main_#t~mem210#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); 539#L378 assume !(main_#t~mem210#1 > 0);havoc main_#t~mem210#1;main_#t~post212#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post212#1;havoc main_#t~post212#1; 534#L378-2 
[2024-11-07 23:54:30,636 INFO  L747   eck$LassoCheckResult]: Loop: 534#L378-2 assume !!(0 <= main_~j~0#1 && main_~j~0#1 < main_~length~0#1);call main_#t~mem210#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); 535#L378 assume main_#t~mem210#1 > 0;havoc main_#t~mem210#1;main_#t~post211#1 := main_~j~0#1;main_~j~0#1 := main_#t~post211#1 - 1;havoc main_#t~post211#1; 534#L378-2 
[2024-11-07 23:54:30,636 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2024-11-07 23:54:30,636 INFO  L85        PathProgramCache]: Analyzing trace with hash -685992544, now seen corresponding path program 3 times
[2024-11-07 23:54:30,636 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-07 23:54:30,637 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1984110510]
[2024-11-07 23:54:30,637 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-07 23:54:30,637 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-07 23:54:30,648 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is sat
[2024-11-07 23:54:30,648 INFO  L356             TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders.
[2024-11-07 23:54:30,655 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is sat
[2024-11-07 23:54:30,658 INFO  L130   FreeRefinementEngine]: Strategy CAMEL found a feasible trace
[2024-11-07 23:54:30,658 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2024-11-07 23:54:30,658 INFO  L85        PathProgramCache]: Analyzing trace with hash 2308, now seen corresponding path program 5 times
[2024-11-07 23:54:30,658 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-07 23:54:30,658 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [650492813]
[2024-11-07 23:54:30,658 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-07 23:54:30,659 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-07 23:54:30,661 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is sat
[2024-11-07 23:54:30,661 INFO  L356             TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders.
[2024-11-07 23:54:30,662 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is sat
[2024-11-07 23:54:30,663 INFO  L130   FreeRefinementEngine]: Strategy CAMEL found a feasible trace
[2024-11-07 23:54:30,664 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2024-11-07 23:54:30,664 INFO  L85        PathProgramCache]: Analyzing trace with hash -2108837149, now seen corresponding path program 3 times
[2024-11-07 23:54:30,664 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-07 23:54:30,664 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [83105028]
[2024-11-07 23:54:30,664 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-07 23:54:30,664 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-07 23:54:30,688 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 23:54:30,703 INFO  L552       MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (27)] Ended with exit code 0
[2024-11-07 23:54:30,798 INFO  L134       CoverageAnalysis]: Checked inductivity of 11 backedges. 3 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-11-07 23:54:30,798 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-11-07 23:54:30,798 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [83105028]
[2024-11-07 23:54:30,798 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [83105028] provided 0 perfect and 1 imperfect interpolant sequences
[2024-11-07 23:54:30,798 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [807514485]
[2024-11-07 23:54:30,799 INFO  L93    rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2
[2024-11-07 23:54:30,799 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2024-11-07 23:54:30,799 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3
[2024-11-07 23:54:30,801 INFO  L229       MonitoredProcess]: Starting monitored process 28 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2024-11-07 23:54:30,803 INFO  L327       MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (28)] Waiting until timeout for monitored process
[2024-11-07 23:54:30,864 INFO  L227   tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s)
[2024-11-07 23:54:30,864 INFO  L228   tOrderPrioritization]: Conjunction of SSA is unsat
[2024-11-07 23:54:30,864 INFO  L255         TraceCheckSpWp]: Trace formula consists of 90 conjuncts, 8 conjuncts are in the unsatisfiable core
[2024-11-07 23:54:30,866 INFO  L278         TraceCheckSpWp]: Computing forward predicates...
[2024-11-07 23:54:30,935 INFO  L134       CoverageAnalysis]: Checked inductivity of 11 backedges. 6 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-11-07 23:54:30,935 INFO  L311         TraceCheckSpWp]: Computing backward predicates...
[2024-11-07 23:54:30,995 INFO  L134       CoverageAnalysis]: Checked inductivity of 11 backedges. 6 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-11-07 23:54:30,995 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleZ3 [807514485] provided 0 perfect and 2 imperfect interpolant sequences
[2024-11-07 23:54:30,995 INFO  L185   FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences.
[2024-11-07 23:54:30,995 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 14
[2024-11-07 23:54:30,995 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1039974539]
[2024-11-07 23:54:30,995 INFO  L85    oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton
[2024-11-07 23:54:31,041 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-11-07 23:54:31,041 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants.
[2024-11-07 23:54:31,041 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=133, Unknown=0, NotChecked=0, Total=182
[2024-11-07 23:54:31,041 INFO  L87              Difference]: Start difference. First operand 23 states and 31 transitions. cyclomatic complexity: 12 Second operand  has 14 states, 14 states have (on average 2.2857142857142856) internal successors, (32), 14 states have internal predecessors, (32), 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-07 23:54:31,125 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2024-11-07 23:54:31,125 INFO  L93              Difference]: Finished difference Result 48 states and 65 transitions.
[2024-11-07 23:54:31,125 INFO  L82        GeneralOperation]: Start removeNonLiveStates. Operand 48 states and 65 transitions.
[2024-11-07 23:54:31,126 INFO  L131   ngComponentsAnalysis]: Automaton has 2 accepting balls. 7
[2024-11-07 23:54:31,127 INFO  L88        GeneralOperation]: Finished removeNonLiveStates. Reduced from 48 states to 46 states and 62 transitions.
[2024-11-07 23:54:31,127 INFO  L87         BuchiClosureNwa]: Accepting states before buchiClosure: 24
[2024-11-07 23:54:31,127 INFO  L106        BuchiClosureNwa]: Accepting states after buchiClosure: 24
[2024-11-07 23:54:31,127 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 46 states and 62 transitions.
[2024-11-07 23:54:31,127 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is not deterministic.
[2024-11-07 23:54:31,127 INFO  L218   hiAutomatonCegarLoop]: Abstraction has 46 states and 62 transitions.
[2024-11-07 23:54:31,127 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 46 states and 62 transitions.
[2024-11-07 23:54:31,133 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 39.
[2024-11-07 23:54:31,133 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 39 states, 39 states have (on average 1.358974358974359) internal successors, (53), 38 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-11-07 23:54:31,134 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 53 transitions.
[2024-11-07 23:54:31,134 INFO  L240   hiAutomatonCegarLoop]: Abstraction has 39 states and 53 transitions.
[2024-11-07 23:54:31,134 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. 
[2024-11-07 23:54:31,135 INFO  L425   stractBuchiCegarLoop]: Abstraction has 39 states and 53 transitions.
[2024-11-07 23:54:31,135 INFO  L332   stractBuchiCegarLoop]: ======== Iteration 7 ============
[2024-11-07 23:54:31,135 INFO  L72            BuchiIsEmpty]: Start buchiIsEmpty. Operand 39 states and 53 transitions.
[2024-11-07 23:54:31,135 INFO  L131   ngComponentsAnalysis]: Automaton has 2 accepting balls. 6
[2024-11-07 23:54:31,135 INFO  L87            BuchiIsEmpty]: Finished buchiIsEmpty Result is false
[2024-11-07 23:54:31,135 INFO  L119           BuchiIsEmpty]: Starting construction of run
[2024-11-07 23:54:31,136 INFO  L148   hiAutomatonCegarLoop]: Counterexample stem histogram [3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-11-07 23:54:31,136 INFO  L149   hiAutomatonCegarLoop]: Counterexample loop histogram [2, 1, 1]
[2024-11-07 23:54:31,136 INFO  L745   eck$LassoCheckResult]: Stem: 726#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 727#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet205#1, main_#t~malloc206#1.base, main_#t~malloc206#1.offset, main_#t~nondet207#1, main_#t~mem208#1, main_#t~post209#1, main_#t~mem210#1, main_#t~post211#1, main_#t~post212#1, main_~i~0#1, main_~j~0#1, main_~length~0#1, main_~arr~0#1.base, main_~arr~0#1.offset;havoc main_~i~0#1;havoc main_~j~0#1;havoc main_#t~nondet205#1;main_~length~0#1 := main_#t~nondet205#1;havoc main_#t~nondet205#1; 728#L367 assume !(main_~length~0#1 < 1); 717#L367-2 call main_#t~malloc206#1.base, main_#t~malloc206#1.offset := #Ultimate.allocOnStack(4 * main_~length~0#1 % 18446744073709551616);main_~arr~0#1.base, main_~arr~0#1.offset := main_#t~malloc206#1.base, main_#t~malloc206#1.offset; 718#L369 assume !(main_~arr~0#1.base == 0 && main_~arr~0#1.offset == 0);main_~i~0#1 := 0; 719#L370-3 assume !!(main_~i~0#1 < main_~length~0#1);havoc main_#t~nondet207#1;call write~int#0(main_#t~nondet207#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet207#1;call main_#t~mem208#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4); 729#L372 assume !(main_#t~mem208#1 < 0);havoc main_#t~mem208#1; 740#L370-2 main_#t~post209#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post209#1;havoc main_#t~post209#1; 730#L370-3 assume !!(main_~i~0#1 < main_~length~0#1);havoc main_#t~nondet207#1;call write~int#0(main_#t~nondet207#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet207#1;call main_#t~mem208#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4); 731#L372 assume !(main_#t~mem208#1 < 0);havoc main_#t~mem208#1; 738#L370-2 main_#t~post209#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post209#1;havoc main_#t~post209#1; 739#L370-3 assume !(main_~i~0#1 < main_~length~0#1); 724#L370-4 main_~j~0#1 := 0; 725#L378-2 assume !!(0 <= main_~j~0#1 && main_~j~0#1 < main_~length~0#1);call main_#t~mem210#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); 742#L378 assume !(main_#t~mem210#1 > 0);havoc main_#t~mem210#1;main_#t~post212#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post212#1;havoc main_#t~post212#1; 741#L378-2 assume !!(0 <= main_~j~0#1 && main_~j~0#1 < main_~length~0#1);call main_#t~mem210#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); 722#L378 assume main_#t~mem210#1 > 0;havoc main_#t~mem210#1;main_#t~post211#1 := main_~j~0#1;main_~j~0#1 := main_#t~post211#1 - 1;havoc main_#t~post211#1; 723#L378-2 assume !!(0 <= main_~j~0#1 && main_~j~0#1 < main_~length~0#1);call main_#t~mem210#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); 752#L378 assume !(main_#t~mem210#1 > 0);havoc main_#t~mem210#1;main_#t~post212#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post212#1;havoc main_#t~post212#1; 750#L378-2 
[2024-11-07 23:54:31,136 INFO  L747   eck$LassoCheckResult]: Loop: 750#L378-2 assume !!(0 <= main_~j~0#1 && main_~j~0#1 < main_~length~0#1);call main_#t~mem210#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); 747#L378 assume main_#t~mem210#1 > 0;havoc main_#t~mem210#1;main_#t~post211#1 := main_~j~0#1;main_~j~0#1 := main_#t~post211#1 - 1;havoc main_#t~post211#1; 732#L378-2 assume !!(0 <= main_~j~0#1 && main_~j~0#1 < main_~length~0#1);call main_#t~mem210#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); 733#L378 assume !(main_#t~mem210#1 > 0);havoc main_#t~mem210#1;main_#t~post212#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post212#1;havoc main_#t~post212#1; 750#L378-2 
[2024-11-07 23:54:31,136 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2024-11-07 23:54:31,136 INFO  L85        PathProgramCache]: Analyzing trace with hash -2108839069, now seen corresponding path program 4 times
[2024-11-07 23:54:31,136 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-07 23:54:31,136 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [7042136]
[2024-11-07 23:54:31,136 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-07 23:54:31,136 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-07 23:54:31,156 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is sat
[2024-11-07 23:54:31,156 INFO  L356             TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders.
[2024-11-07 23:54:31,164 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is sat
[2024-11-07 23:54:31,167 INFO  L130   FreeRefinementEngine]: Strategy CAMEL found a feasible trace
[2024-11-07 23:54:31,167 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2024-11-07 23:54:31,167 INFO  L85        PathProgramCache]: Analyzing trace with hash 2219337, now seen corresponding path program 1 times
[2024-11-07 23:54:31,168 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-07 23:54:31,168 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1407231257]
[2024-11-07 23:54:31,168 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-07 23:54:31,168 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-07 23:54:31,172 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is sat
[2024-11-07 23:54:31,172 INFO  L356             TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders.
[2024-11-07 23:54:31,174 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is sat
[2024-11-07 23:54:31,176 INFO  L130   FreeRefinementEngine]: Strategy CAMEL found a feasible trace
[2024-11-07 23:54:31,178 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2024-11-07 23:54:31,178 INFO  L85        PathProgramCache]: Analyzing trace with hash 50792363, now seen corresponding path program 5 times
[2024-11-07 23:54:31,178 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-07 23:54:31,178 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1397859202]
[2024-11-07 23:54:31,178 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-07 23:54:31,178 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-07 23:54:31,192 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is sat
[2024-11-07 23:54:31,193 INFO  L356             TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders.
[2024-11-07 23:54:31,208 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is sat
[2024-11-07 23:54:31,234 INFO  L130   FreeRefinementEngine]: Strategy CAMEL found a feasible trace
[2024-11-07 23:54:31,908 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is sat
[2024-11-07 23:54:31,908 INFO  L356             TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders.
[2024-11-07 23:54:31,918 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is sat
[2024-11-07 23:54:31,944 WARN  L976   BoogieBacktranslator]: Unfinished Backtranslation: The program execution was not completely translated back.
[2024-11-07 23:54:31,950 WARN  L976   BoogieBacktranslator]: Unfinished Backtranslation: The program execution was not completely translated back.
[2024-11-07 23:54:31,958 WARN  L976   BoogieBacktranslator]: Unfinished Backtranslation: The program execution was not completely translated back.
[2024-11-07 23:54:31,962 WARN  L976   BoogieBacktranslator]: Unfinished Backtranslation: The program execution was not completely translated back.
[2024-11-07 23:54:31,962 INFO  L201        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 07.11 11:54:31 BoogieIcfgContainer
[2024-11-07 23:54:31,962 INFO  L131        PluginConnector]: ------------------------ END BuchiAutomizer----------------------------
[2024-11-07 23:54:31,963 INFO  L112        PluginConnector]: ------------------------Witness Printer----------------------------
[2024-11-07 23:54:31,963 INFO  L270        PluginConnector]: Initializing Witness Printer...
[2024-11-07 23:54:31,963 INFO  L274        PluginConnector]: Witness Printer initialized
[2024-11-07 23:54:31,964 INFO  L184        PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 11:54:26" (3/4) ...
[2024-11-07 23:54:31,966 INFO  L139         WitnessPrinter]: Generating witness for non-termination counterexample
[2024-11-07 23:54:31,973 WARN  L976   BoogieBacktranslator]: Unfinished Backtranslation: The program execution was not completely translated back.
[2024-11-07 23:54:31,973 WARN  L976   BoogieBacktranslator]: Unfinished Backtranslation: The program execution was not completely translated back.
[2024-11-07 23:54:32,006 INFO  L149         WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.graphml
[2024-11-07 23:54:32,006 INFO  L131        PluginConnector]: ------------------------ END Witness Printer----------------------------
[2024-11-07 23:54:32,006 INFO  L158              Benchmark]: Toolchain (without parser) took 6628.56ms. Allocated memory was 100.7MB in the beginning and 125.8MB in the end (delta: 25.2MB). Free memory was 76.3MB in the beginning and 40.0MB in the end (delta: 36.2MB). Peak memory consumption was 59.9MB. Max. memory is 16.1GB.
[2024-11-07 23:54:32,007 INFO  L158              Benchmark]: CDTParser took 0.67ms. Allocated memory is still 83.9MB. Free memory is still 48.0MB. There was no memory consumed. Max. memory is 16.1GB.
[2024-11-07 23:54:32,007 INFO  L158              Benchmark]: CACSL2BoogieTranslator took 382.31ms. Allocated memory is still 100.7MB. Free memory was 76.1MB in the beginning and 58.1MB in the end (delta: 18.0MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB.
[2024-11-07 23:54:32,007 INFO  L158              Benchmark]: Boogie Procedure Inliner took 38.99ms. Allocated memory is still 100.7MB. Free memory was 58.1MB in the beginning and 56.7MB in the end (delta: 1.4MB). There was no memory consumed. Max. memory is 16.1GB.
[2024-11-07 23:54:32,007 INFO  L158              Benchmark]: Boogie Preprocessor took 39.68ms. Allocated memory is still 100.7MB. Free memory was 56.5MB in the beginning and 55.3MB in the end (delta: 1.2MB). There was no memory consumed. Max. memory is 16.1GB.
[2024-11-07 23:54:32,007 INFO  L158              Benchmark]: RCFGBuilder took 247.50ms. Allocated memory is still 100.7MB. Free memory was 55.2MB in the beginning and 45.2MB in the end (delta: 10.0MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB.
[2024-11-07 23:54:32,008 INFO  L158              Benchmark]: BuchiAutomizer took 5872.04ms. Allocated memory was 100.7MB in the beginning and 125.8MB in the end (delta: 25.2MB). Free memory was 45.2MB in the beginning and 41.9MB in the end (delta: 3.3MB). Peak memory consumption was 26.4MB. Max. memory is 16.1GB.
[2024-11-07 23:54:32,008 INFO  L158              Benchmark]: Witness Printer took 43.11ms. Allocated memory is still 125.8MB. Free memory was 41.9MB in the beginning and 40.0MB in the end (delta: 1.9MB). There was no memory consumed. Max. memory is 16.1GB.
[2024-11-07 23:54:32,009 INFO  L338   ainManager$Toolchain]: #######################  End [Toolchain 1] #######################
 --- Results ---
 * Results from de.uni_freiburg.informatik.ultimate.core:
  - StatisticsResult: Toolchain Benchmarks
    Benchmark results are:
 * CDTParser took 0.67ms. Allocated memory is still 83.9MB. Free memory is still 48.0MB. There was no memory consumed. Max. memory is 16.1GB.
 * CACSL2BoogieTranslator took 382.31ms. Allocated memory is still 100.7MB. Free memory was 76.1MB in the beginning and 58.1MB in the end (delta: 18.0MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB.
 * Boogie Procedure Inliner took 38.99ms. Allocated memory is still 100.7MB. Free memory was 58.1MB in the beginning and 56.7MB in the end (delta: 1.4MB). There was no memory consumed. Max. memory is 16.1GB.
 * Boogie Preprocessor took 39.68ms. Allocated memory is still 100.7MB. Free memory was 56.5MB in the beginning and 55.3MB in the end (delta: 1.2MB). There was no memory consumed. Max. memory is 16.1GB.
 * RCFGBuilder took 247.50ms. Allocated memory is still 100.7MB. Free memory was 55.2MB in the beginning and 45.2MB in the end (delta: 10.0MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB.
 * BuchiAutomizer took 5872.04ms. Allocated memory was 100.7MB in the beginning and 125.8MB in the end (delta: 25.2MB). Free memory was 45.2MB in the beginning and 41.9MB in the end (delta: 3.3MB). Peak memory consumption was 26.4MB. Max. memory is 16.1GB.
 * Witness Printer took 43.11ms. Allocated memory is still 125.8MB. Free memory was 41.9MB in the beginning and 40.0MB in the end (delta: 1.9MB). There was no memory consumed. Max. memory is 16.1GB.
 * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator:
  - GenericResult: Unfinished Backtranslation
    Unfinished Backtranslation: Unknown variable: #length
  - GenericResult: Unfinished Backtranslation
    Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#length,GLOBAL]
  - GenericResult: Unfinished Backtranslation
    Unfinished Backtranslation: Unknown variable: ~arr~0!offset
  - GenericResult: Unfinished Backtranslation
    Unfinished Backtranslation: Unknown variable: #length
  - GenericResult: Unfinished Backtranslation
    Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#length,GLOBAL]
  - GenericResult: Unfinished Backtranslation
    Unfinished Backtranslation: Unknown variable: #length
  - GenericResult: Unfinished Backtranslation
    Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#length,GLOBAL]
  - GenericResult: Unfinished Backtranslation
    Unfinished Backtranslation: The program execution was not completely translated back.
  - GenericResult: Unfinished Backtranslation
    Unfinished Backtranslation: The program execution was not completely translated back.
  - GenericResult: Unfinished Backtranslation
    Unfinished Backtranslation: The program execution was not completely translated back.
  - GenericResult: Unfinished Backtranslation
    Unfinished Backtranslation: The program execution was not completely translated back.
  - GenericResult: Unfinished Backtranslation
    Unfinished Backtranslation: The program execution was not completely translated back.
  - GenericResult: Unfinished Backtranslation
    Unfinished Backtranslation: The program execution was not completely translated back.
 * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction:
  - StatisticsResult: Constructed decomposition of program
    Your program was decomposed into 6 terminating modules (3 trivial, 3 deterministic, 0 nondeterministic) and one nonterminating remainder module.One deterministic module has affine ranking function null and consists of 4 locations. One deterministic module has affine ranking function null and consists of 4 locations. One deterministic module has affine ranking function null and consists of 3 locations. 3 modules have a trivial ranking function, the largest among these consists of 14 locations. The remainder module has 39 locations.
  - StatisticsResult: Timing statistics
    BüchiAutomizer plugin needed 5.7s and 7 iterations.  TraceHistogramMax:3. Analysis of lassos took 5.0s. Construction of modules took 0.1s. Büchi inclusion checks took 0.4s. Highest rank in rank-based complementation 3. Minimization of det autom 2. Minimization of nondet autom 4. Automata minimization 0.0s AutomataMinimizationTime, 6 MinimizatonAttempts, 11 StatesRemovedByMinimization, 3 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had -1 states and ocurred in iteration -1.	Nontrivial modules had stage [3, 0, 0, 0, 0].	InterpolantCoveringCapabilityFinite: 0/0	InterpolantCoveringCapabilityBuchi: 0/0	HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 100 SdHoareTripleChecker+Valid, 0.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 98 mSDsluCounter, 123 SdHoareTripleChecker+Invalid, 0.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 67 mSDsCounter, 26 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 225 IncrementalHoareTripleChecker+Invalid, 251 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 26 mSolverCounterUnsat, 56 mSDtfsCounter, 225 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown	LassoAnalysisResults: nont1 unkn0 SFLI0 SFLT0 conc2 concLT0 SILN0 SILU1 SILI0 SILT0 lasso3 LassoPreprocessingBenchmarks:   Lassos: inital111 mio100 ax100 hnf100 lsp100 ukn78 mio100 lsp55 div125 bol100 ite100 ukn100 eq158 hnf91 smp90 dnf100 smp100 tf100 neg100 sie100 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 27ms VariablesStem: 3 VariablesLoop: 2 DisjunctsStem: 1 DisjunctsLoop: 1 SupportingInvariants: 2 MotzkinApplications: 6 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 0	LassoNonterminationAnalysisSatUnbounded: 0	LassoNonterminationAnalysisUnsat: 0	LassoNonterminationAnalysisUnknown: 0	LassoNonterminationAnalysisTime: 0.0s	InitialAbstractionConstructionTime: 0.0s
  - TerminationAnalysisResult: Nontermination possible
    Buchi Automizer proved that your program is nonterminating for some inputs
  - LassoShapedNonTerminationArgument [Line: 377]: Nontermination argument in form of an infinite program execution.
    Nontermination argument in form of an infinite program execution.
Stem:
[L365]              int i, j;
[L366]              int length = __VERIFIER_nondet_int();
[L367]  COND FALSE  !(length < 1)
        VAL         [length=2]
[L368]              int *arr = __builtin_alloca(length*sizeof(int));
        VAL         [arr={2:0}, length=2]
[L369]  COND FALSE  !(!arr)
[L370]              i=0
        VAL         [arr={2:0}, i=0, length=2]
[L370]  COND TRUE   i<length
[L371]              arr[i] = __VERIFIER_nondet_int()
[L372]  EXPR        arr[i]
[L372]  COND FALSE  !(arr[i] < 0)
[L370]              i++
        VAL         [arr={2:0}, i=1, length=2]
[L370]  COND TRUE   i<length
[L371]              arr[i] = __VERIFIER_nondet_int()
[L372]  EXPR        arr[i]
[L372]  COND FALSE  !(arr[i] < 0)
[L370]              i++
        VAL         [arr={2:0}, i=2, length=2]
[L370]  COND FALSE  !(i<length)
        VAL         [arr={2:0}, length=2]
[L376]              j = 0
        VAL         [arr={2:0}, j=0, length=2]
[L377]  COND TRUE   0 <= j && j < length
[L378]  EXPR        arr[j]
[L378]  COND FALSE  !(arr[j] > 0)
[L381]              j++
        VAL         [arr={2:0}, j=1, length=2]
[L377]  COND TRUE   0 <= j && j < length
[L378]  EXPR        arr[j]
[L378]  COND TRUE   arr[j] > 0
[L379]              j--
        VAL         [arr={2:0}, j=0, length=2]
[L377]  COND TRUE   0 <= j && j < length
[L378]  EXPR        arr[j]
[L378]  COND FALSE  !(arr[j] > 0)
[L381]              j++
        VAL         [arr={2:0}, j=1, length=2]
Loop:
[L377]  COND TRUE   0 <= j && j < length
[L378]  EXPR        arr[j]
[L378]  COND TRUE   arr[j] > 0
[L379]              j--
[L377]  COND TRUE   0 <= j && j < length
[L378]  EXPR        arr[j]
[L378]  COND FALSE  !(arr[j] > 0)
[L381]              j++
End of lasso representation.
  - StatisticsResult: NonterminationArgumentStatistics
    Fixpoint
  - NonterminatingLassoResult [Line: 377]: Nonterminating execution
    Found a nonterminating execution for the following lasso shaped sequence of statements.
Stem:
[L365]              int i, j;
[L366]              int length = __VERIFIER_nondet_int();
[L367]  COND FALSE  !(length < 1)
        VAL         [length=2]
[L368]              int *arr = __builtin_alloca(length*sizeof(int));
        VAL         [arr={2:0}, length=2]
[L369]  COND FALSE  !(!arr)
[L370]              i=0
        VAL         [arr={2:0}, i=0, length=2]
[L370]  COND TRUE   i<length
[L371]              arr[i] = __VERIFIER_nondet_int()
[L372]  EXPR        arr[i]
[L372]  COND FALSE  !(arr[i] < 0)
[L370]              i++
        VAL         [arr={2:0}, i=1, length=2]
[L370]  COND TRUE   i<length
[L371]              arr[i] = __VERIFIER_nondet_int()
[L372]  EXPR        arr[i]
[L372]  COND FALSE  !(arr[i] < 0)
[L370]              i++
        VAL         [arr={2:0}, i=2, length=2]
[L370]  COND FALSE  !(i<length)
        VAL         [arr={2:0}, length=2]
[L376]              j = 0
        VAL         [arr={2:0}, j=0, length=2]
[L377]  COND TRUE   0 <= j && j < length
[L378]  EXPR        arr[j]
[L378]  COND FALSE  !(arr[j] > 0)
[L381]              j++
        VAL         [arr={2:0}, j=1, length=2]
[L377]  COND TRUE   0 <= j && j < length
[L378]  EXPR        arr[j]
[L378]  COND TRUE   arr[j] > 0
[L379]              j--
        VAL         [arr={2:0}, j=0, length=2]
[L377]  COND TRUE   0 <= j && j < length
[L378]  EXPR        arr[j]
[L378]  COND FALSE  !(arr[j] > 0)
[L381]              j++
        VAL         [arr={2:0}, j=1, length=2]
Loop:
[L377]  COND TRUE   0 <= j && j < length
[L378]  EXPR        arr[j]
[L378]  COND TRUE   arr[j] > 0
[L379]              j--
[L377]  COND TRUE   0 <= j && j < length
[L378]  EXPR        arr[j]
[L378]  COND FALSE  !(arr[j] > 0)
[L381]              j++
End of lasso representation.
RESULT: Ultimate proved your program to be incorrect!
[2024-11-07 23:54:32,038 INFO  L552       MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (28)] Ended with exit code 0
[2024-11-07 23:54:32,237 INFO  L552       MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Ended with exit code 0
[2024-11-07 23:54:32,437 INFO  L552       MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Ended with exit code 0
Received shutdown request...
--- End real Ultimate output ---

Execution finished normally
Writing output log to file Ultimate.log
Writing human readable error path to file UltimateCounterExample.errorpath
Result:
FALSE(TERM)