./Ultimate.py --spec ../sv-benchmarks/c/properties/termination.prp --file ../sv-benchmarks/c/seq-pthread/cs_stateful-1.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version c00e63dc 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/seq-pthread/cs_stateful-1.i -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-32bit-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 32bit --witnessprinter.graph.data.programhash 8ecae2ca1de1e5b446d807037ed0cb2d4fc04c355acb35a6870f18f7e175f10e --- Real Ultimate output --- This is Ultimate 0.3.0-?-c00e63d-m [2025-02-06 20:02:37,888 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-06 20:02:37,962 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-32bit-Automizer_Default.epf [2025-02-06 20:02:37,967 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-06 20:02:37,968 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-06 20:02:37,968 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder.Remove goto edges from RCFG [2025-02-06 20:02:37,993 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-06 20:02:37,994 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-06 20:02:37,994 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-06 20:02:37,995 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-06 20:02:37,995 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-06 20:02:37,996 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-06 20:02:37,996 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-06 20:02:37,996 INFO L153 SettingsManager]: * Use SBE=true [2025-02-06 20:02:37,996 INFO L151 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2025-02-06 20:02:37,997 INFO L153 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2025-02-06 20:02:37,997 INFO L153 SettingsManager]: * Use old map elimination=false [2025-02-06 20:02:37,997 INFO L153 SettingsManager]: * Use external solver (rank synthesis)=false [2025-02-06 20:02:37,997 INFO L153 SettingsManager]: * Use only trivial implications for array writes=true [2025-02-06 20:02:37,997 INFO L153 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2025-02-06 20:02:37,997 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-06 20:02:37,997 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2025-02-06 20:02:37,997 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-06 20:02:37,997 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-06 20:02:37,998 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-06 20:02:37,998 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-06 20:02:37,998 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2025-02-06 20:02:37,998 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2025-02-06 20:02:37,998 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2025-02-06 20:02:37,998 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-02-06 20:02:37,998 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-06 20:02:37,998 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-06 20:02:37,999 INFO L153 SettingsManager]: * Assume nondeterminstic values are in range=false [2025-02-06 20:02:37,999 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-06 20:02:37,999 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-06 20:02:37,999 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-06 20:02:37,999 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-06 20:02:38,000 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-06 20:02:38,000 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-06 20:02:38,000 INFO L151 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2025-02-06 20:02:38,000 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 -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 8ecae2ca1de1e5b446d807037ed0cb2d4fc04c355acb35a6870f18f7e175f10e [2025-02-06 20:02:38,288 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-06 20:02:38,299 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-06 20:02:38,302 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-06 20:02:38,303 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-06 20:02:38,304 INFO L274 PluginConnector]: CDTParser initialized [2025-02-06 20:02:38,305 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/seq-pthread/cs_stateful-1.i [2025-02-06 20:02:39,552 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/dd990e78e/5fd40bb83e364a0d97288bb1830ae374/FLAG54c3abfd7 [2025-02-06 20:02:39,933 INFO L384 CDTParser]: Found 1 translation units. [2025-02-06 20:02:39,936 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/seq-pthread/cs_stateful-1.i [2025-02-06 20:02:39,953 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/dd990e78e/5fd40bb83e364a0d97288bb1830ae374/FLAG54c3abfd7 [2025-02-06 20:02:39,970 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/dd990e78e/5fd40bb83e364a0d97288bb1830ae374 [2025-02-06 20:02:39,972 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-06 20:02:39,974 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-06 20:02:39,975 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-06 20:02:39,975 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-06 20:02:39,978 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-06 20:02:39,979 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.02 08:02:39" (1/1) ... [2025-02-06 20:02:39,979 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@608424ae and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 08:02:39, skipping insertion in model container [2025-02-06 20:02:39,979 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.02 08:02:39" (1/1) ... [2025-02-06 20:02:40,019 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-06 20:02:40,286 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-06 20:02:40,309 INFO L200 MainTranslator]: Completed pre-run [2025-02-06 20:02:40,395 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-06 20:02:40,430 INFO L204 MainTranslator]: Completed translation [2025-02-06 20:02:40,430 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 08:02:40 WrapperNode [2025-02-06 20:02:40,430 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-06 20:02:40,431 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-06 20:02:40,431 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-06 20:02:40,431 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-06 20:02:40,435 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 08:02:40" (1/1) ... [2025-02-06 20:02:40,456 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 08:02:40" (1/1) ... [2025-02-06 20:02:40,551 INFO L138 Inliner]: procedures = 144, calls = 241, calls flagged for inlining = 52, calls inlined = 142, statements flattened = 2454 [2025-02-06 20:02:40,552 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-06 20:02:40,552 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-06 20:02:40,552 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-06 20:02:40,552 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-06 20:02:40,560 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 08:02:40" (1/1) ... [2025-02-06 20:02:40,560 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 08:02:40" (1/1) ... [2025-02-06 20:02:40,594 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 08:02:40" (1/1) ... [2025-02-06 20:02:40,666 INFO L175 MemorySlicer]: Split 237 memory accesses to 16 slices as follows [2, 13, 3, 13, 13, 40, 12, 56, 3, 22, 22, 7, 18, 3, 7, 3]. 24 percent of accesses are in the largest equivalence class. The 31 initializations are split as follows [2, 3, 0, 3, 3, 6, 6, 4, 0, 2, 2, 0, 0, 0, 0, 0]. The 101 writes are split as follows [0, 7, 1, 7, 7, 13, 3, 26, 1, 10, 10, 1, 12, 1, 1, 1]. [2025-02-06 20:02:40,666 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 08:02:40" (1/1) ... [2025-02-06 20:02:40,667 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 08:02:40" (1/1) ... [2025-02-06 20:02:40,775 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 08:02:40" (1/1) ... [2025-02-06 20:02:40,783 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 08:02:40" (1/1) ... [2025-02-06 20:02:40,792 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 08:02:40" (1/1) ... [2025-02-06 20:02:40,803 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 08:02:40" (1/1) ... [2025-02-06 20:02:40,829 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-06 20:02:40,831 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-06 20:02:40,831 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-06 20:02:40,831 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-06 20:02:40,832 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 08:02:40" (1/1) ... [2025-02-06 20:02:40,836 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 20:02:40,848 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 20:02:40,863 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) [2025-02-06 20:02:40,869 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 [2025-02-06 20:02:40,888 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-02-06 20:02:40,888 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-02-06 20:02:40,888 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2025-02-06 20:02:40,889 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2025-02-06 20:02:40,889 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#4 [2025-02-06 20:02:40,889 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#5 [2025-02-06 20:02:40,889 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#6 [2025-02-06 20:02:40,889 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#7 [2025-02-06 20:02:40,889 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#8 [2025-02-06 20:02:40,889 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#9 [2025-02-06 20:02:40,889 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#10 [2025-02-06 20:02:40,889 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#11 [2025-02-06 20:02:40,889 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#12 [2025-02-06 20:02:40,889 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#13 [2025-02-06 20:02:40,889 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#14 [2025-02-06 20:02:40,890 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#15 [2025-02-06 20:02:40,890 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-02-06 20:02:40,890 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-02-06 20:02:40,890 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2025-02-06 20:02:40,890 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2025-02-06 20:02:40,890 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#4 [2025-02-06 20:02:40,890 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#5 [2025-02-06 20:02:40,890 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#6 [2025-02-06 20:02:40,891 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#7 [2025-02-06 20:02:40,891 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#8 [2025-02-06 20:02:40,891 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#9 [2025-02-06 20:02:40,891 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#10 [2025-02-06 20:02:40,891 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#11 [2025-02-06 20:02:40,891 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#12 [2025-02-06 20:02:40,891 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#13 [2025-02-06 20:02:40,891 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#14 [2025-02-06 20:02:40,891 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#15 [2025-02-06 20:02:40,891 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-06 20:02:40,892 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-02-06 20:02:40,892 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2025-02-06 20:02:40,893 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2025-02-06 20:02:40,893 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2025-02-06 20:02:40,893 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#3 [2025-02-06 20:02:40,893 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#4 [2025-02-06 20:02:40,893 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#5 [2025-02-06 20:02:40,893 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#6 [2025-02-06 20:02:40,893 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#7 [2025-02-06 20:02:40,893 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#8 [2025-02-06 20:02:40,893 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#9 [2025-02-06 20:02:40,893 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#10 [2025-02-06 20:02:40,893 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#11 [2025-02-06 20:02:40,893 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#12 [2025-02-06 20:02:40,893 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#13 [2025-02-06 20:02:40,893 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#14 [2025-02-06 20:02:40,893 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#15 [2025-02-06 20:02:40,893 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2025-02-06 20:02:40,893 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2025-02-06 20:02:40,893 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2025-02-06 20:02:40,893 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#3 [2025-02-06 20:02:40,893 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#4 [2025-02-06 20:02:40,893 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#5 [2025-02-06 20:02:40,894 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#6 [2025-02-06 20:02:40,894 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#7 [2025-02-06 20:02:40,894 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#8 [2025-02-06 20:02:40,894 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#9 [2025-02-06 20:02:40,894 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#10 [2025-02-06 20:02:40,894 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#11 [2025-02-06 20:02:40,894 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#12 [2025-02-06 20:02:40,894 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#13 [2025-02-06 20:02:40,894 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#14 [2025-02-06 20:02:40,894 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#15 [2025-02-06 20:02:40,894 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-02-06 20:02:40,894 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#0 [2025-02-06 20:02:40,894 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#1 [2025-02-06 20:02:40,894 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#2 [2025-02-06 20:02:40,894 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#3 [2025-02-06 20:02:40,894 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#4 [2025-02-06 20:02:40,894 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#5 [2025-02-06 20:02:40,894 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#6 [2025-02-06 20:02:40,894 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#7 [2025-02-06 20:02:40,894 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#8 [2025-02-06 20:02:40,894 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#9 [2025-02-06 20:02:40,894 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#10 [2025-02-06 20:02:40,894 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#11 [2025-02-06 20:02:40,894 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#12 [2025-02-06 20:02:40,897 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#13 [2025-02-06 20:02:40,897 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#14 [2025-02-06 20:02:40,897 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#15 [2025-02-06 20:02:40,897 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-02-06 20:02:40,897 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-02-06 20:02:40,897 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-02-06 20:02:40,897 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2025-02-06 20:02:40,897 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2025-02-06 20:02:40,897 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#5 [2025-02-06 20:02:40,897 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#6 [2025-02-06 20:02:40,897 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#7 [2025-02-06 20:02:40,897 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#8 [2025-02-06 20:02:40,897 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#9 [2025-02-06 20:02:40,897 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#10 [2025-02-06 20:02:40,897 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#11 [2025-02-06 20:02:40,897 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#12 [2025-02-06 20:02:40,897 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#13 [2025-02-06 20:02:40,897 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#14 [2025-02-06 20:02:40,897 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#15 [2025-02-06 20:02:40,897 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-06 20:02:40,897 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-06 20:02:41,178 INFO L257 CfgBuilder]: Building ICFG [2025-02-06 20:02:41,180 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-06 20:02:44,250 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L562-57: ~__CS_round~0 := (if ~__CS_round~0 % 256 % 4294967296 <= 2147483647 then ~__CS_round~0 % 256 % 4294967296 else ~__CS_round~0 % 256 % 4294967296 - 4294967296) + (if __CS_cs_~k~0#1 % 256 % 4294967296 <= 2147483647 then __CS_cs_~k~0#1 % 256 % 4294967296 else __CS_cs_~k~0#1 % 256 % 4294967296 - 4294967296);havoc __CS_cs_#t~nondet4#1;~__CS_ret~0 := (if 0 != __CS_cs_#t~nondet4#1 && 1 == (if ~__CS_round~0 % 256 % 4294967296 <= 2147483647 then ~__CS_round~0 % 256 % 4294967296 else ~__CS_round~0 % 256 % 4294967296 - 4294967296) then (if ~__CS_ret_PREEMPTED~0 % 256 % 4294967296 <= 2147483647 then ~__CS_ret_PREEMPTED~0 % 256 % 4294967296 else ~__CS_ret_PREEMPTED~0 % 256 % 4294967296 - 4294967296) else (if ~__CS_ret~0 % 256 % 4294967296 <= 2147483647 then ~__CS_ret~0 % 256 % 4294967296 else ~__CS_ret~0 % 256 % 4294967296 - 4294967296));havoc __CS_cs_#t~nondet4#1; [2025-02-06 20:02:44,251 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L562-58: ~__CS_round~0 := (if ~__CS_round~0 % 256 % 4294967296 <= 2147483647 then ~__CS_round~0 % 256 % 4294967296 else ~__CS_round~0 % 256 % 4294967296 - 4294967296) + (if __CS_cs_~k~0#1 % 256 % 4294967296 <= 2147483647 then __CS_cs_~k~0#1 % 256 % 4294967296 else __CS_cs_~k~0#1 % 256 % 4294967296 - 4294967296);havoc __CS_cs_#t~nondet4#1;~__CS_ret~0 := (if 0 != __CS_cs_#t~nondet4#1 && 1 == (if ~__CS_round~0 % 256 % 4294967296 <= 2147483647 then ~__CS_round~0 % 256 % 4294967296 else ~__CS_round~0 % 256 % 4294967296 - 4294967296) then (if ~__CS_ret_PREEMPTED~0 % 256 % 4294967296 <= 2147483647 then ~__CS_ret_PREEMPTED~0 % 256 % 4294967296 else ~__CS_ret_PREEMPTED~0 % 256 % 4294967296 - 4294967296) else (if ~__CS_ret~0 % 256 % 4294967296 <= 2147483647 then ~__CS_ret~0 % 256 % 4294967296 else ~__CS_ret~0 % 256 % 4294967296 - 4294967296));havoc __CS_cs_#t~nondet4#1; [2025-02-06 20:02:44,254 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L562-59: ~__CS_round~0 := (if ~__CS_round~0 % 256 % 4294967296 <= 2147483647 then ~__CS_round~0 % 256 % 4294967296 else ~__CS_round~0 % 256 % 4294967296 - 4294967296) + (if __CS_cs_~k~0#1 % 256 % 4294967296 <= 2147483647 then __CS_cs_~k~0#1 % 256 % 4294967296 else __CS_cs_~k~0#1 % 256 % 4294967296 - 4294967296);havoc __CS_cs_#t~nondet4#1;~__CS_ret~0 := (if 0 != __CS_cs_#t~nondet4#1 && 1 == (if ~__CS_round~0 % 256 % 4294967296 <= 2147483647 then ~__CS_round~0 % 256 % 4294967296 else ~__CS_round~0 % 256 % 4294967296 - 4294967296) then (if ~__CS_ret_PREEMPTED~0 % 256 % 4294967296 <= 2147483647 then ~__CS_ret_PREEMPTED~0 % 256 % 4294967296 else ~__CS_ret_PREEMPTED~0 % 256 % 4294967296 - 4294967296) else (if ~__CS_ret~0 % 256 % 4294967296 <= 2147483647 then ~__CS_ret~0 % 256 % 4294967296 else ~__CS_ret~0 % 256 % 4294967296 - 4294967296));havoc __CS_cs_#t~nondet4#1; [2025-02-06 20:02:44,255 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L742-1: assume 0 != (if ~__CS_ret~0 % 256 % 4294967296 <= 2147483647 then ~__CS_ret~0 % 256 % 4294967296 else ~__CS_ret~0 % 256 % 4294967296 - 4294967296);main_thread_#res#1.base, main_thread_#res#1.offset := 0, 0;call ULTIMATE.dealloc(main_thread_~#t1~0#1.base, main_thread_~#t1~0#1.offset);havoc main_thread_~#t1~0#1.base, main_thread_~#t1~0#1.offset;call ULTIMATE.dealloc(main_thread_~#t2~0#1.base, main_thread_~#t2~0#1.offset);havoc main_thread_~#t2~0#1.base, main_thread_~#t2~0#1.offset; [2025-02-06 20:02:44,255 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L742-1: assume !(0 != (if ~__CS_ret~0 % 256 % 4294967296 <= 2147483647 then ~__CS_ret~0 % 256 % 4294967296 else ~__CS_ret~0 % 256 % 4294967296 - 4294967296)); [2025-02-06 20:02:44,255 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L742-2: assume { :begin_inline___CS_cs } true;havoc __CS_cs_#t~nondet3#1, __CS_cs_#t~nondet4#1, __CS_cs_~k~0#1;havoc __CS_cs_#t~nondet3#1;__CS_cs_~k~0#1 := __CS_cs_#t~nondet3#1;havoc __CS_cs_#t~nondet3#1; [2025-02-06 20:02:44,255 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L742-4: assume 0 != (if ~__CS_ret~0 % 256 % 4294967296 <= 2147483647 then ~__CS_ret~0 % 256 % 4294967296 else ~__CS_ret~0 % 256 % 4294967296 - 4294967296);main_thread_#res#1.base, main_thread_#res#1.offset := 0, 0;call ULTIMATE.dealloc(main_thread_~#t1~0#1.base, main_thread_~#t1~0#1.offset);havoc main_thread_~#t1~0#1.base, main_thread_~#t1~0#1.offset;call ULTIMATE.dealloc(main_thread_~#t2~0#1.base, main_thread_~#t2~0#1.offset);havoc main_thread_~#t2~0#1.base, main_thread_~#t2~0#1.offset; [2025-02-06 20:02:44,255 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L742-4: assume !(0 != (if ~__CS_ret~0 % 256 % 4294967296 <= 2147483647 then ~__CS_ret~0 % 256 % 4294967296 else ~__CS_ret~0 % 256 % 4294967296 - 4294967296)); [2025-02-06 20:02:44,255 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L742-5: assume { :begin_inline___CS_cs } true;havoc __CS_cs_#t~nondet3#1, __CS_cs_#t~nondet4#1, __CS_cs_~k~0#1;havoc __CS_cs_#t~nondet3#1;__CS_cs_~k~0#1 := __CS_cs_#t~nondet3#1;havoc __CS_cs_#t~nondet3#1; [2025-02-06 20:02:44,255 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L742-7: assume 0 != (if ~__CS_ret~0 % 256 % 4294967296 <= 2147483647 then ~__CS_ret~0 % 256 % 4294967296 else ~__CS_ret~0 % 256 % 4294967296 - 4294967296);main_thread_#res#1.base, main_thread_#res#1.offset := 0, 0;call ULTIMATE.dealloc(main_thread_~#t1~0#1.base, main_thread_~#t1~0#1.offset);havoc main_thread_~#t1~0#1.base, main_thread_~#t1~0#1.offset;call ULTIMATE.dealloc(main_thread_~#t2~0#1.base, main_thread_~#t2~0#1.offset);havoc main_thread_~#t2~0#1.base, main_thread_~#t2~0#1.offset; [2025-02-06 20:02:44,256 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L742-7: assume !(0 != (if ~__CS_ret~0 % 256 % 4294967296 <= 2147483647 then ~__CS_ret~0 % 256 % 4294967296 else ~__CS_ret~0 % 256 % 4294967296 - 4294967296)); [2025-02-06 20:02:44,256 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L742-8: assume { :begin_inline___CS_cs } true;havoc __CS_cs_#t~nondet3#1, __CS_cs_#t~nondet4#1, __CS_cs_~k~0#1;havoc __CS_cs_#t~nondet3#1;__CS_cs_~k~0#1 := __CS_cs_#t~nondet3#1;havoc __CS_cs_#t~nondet3#1; [2025-02-06 20:02:44,256 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L744-1: assume 0 != (if ~__CS_ret~0 % 256 % 4294967296 <= 2147483647 then ~__CS_ret~0 % 256 % 4294967296 else ~__CS_ret~0 % 256 % 4294967296 - 4294967296);main_thread_#res#1.base, main_thread_#res#1.offset := 0, 0;call ULTIMATE.dealloc(main_thread_~#t1~0#1.base, main_thread_~#t1~0#1.offset);havoc main_thread_~#t1~0#1.base, main_thread_~#t1~0#1.offset;call ULTIMATE.dealloc(main_thread_~#t2~0#1.base, main_thread_~#t2~0#1.offset);havoc main_thread_~#t2~0#1.base, main_thread_~#t2~0#1.offset; [2025-02-06 20:02:44,256 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L744-1: assume !(0 != (if ~__CS_ret~0 % 256 % 4294967296 <= 2147483647 then ~__CS_ret~0 % 256 % 4294967296 else ~__CS_ret~0 % 256 % 4294967296 - 4294967296));assume { :begin_inline___CS_cs } true;havoc __CS_cs_#t~nondet3#1, __CS_cs_#t~nondet4#1, __CS_cs_~k~0#1;havoc __CS_cs_#t~nondet3#1;__CS_cs_~k~0#1 := __CS_cs_#t~nondet3#1;havoc __CS_cs_#t~nondet3#1; [2025-02-06 20:02:44,256 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L744-2: assume { :begin_inline___CS_cs } true;havoc __CS_cs_#t~nondet3#1, __CS_cs_#t~nondet4#1, __CS_cs_~k~0#1;havoc __CS_cs_#t~nondet3#1;__CS_cs_~k~0#1 := __CS_cs_#t~nondet3#1;havoc __CS_cs_#t~nondet3#1; [2025-02-06 20:02:44,256 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L744-4: assume 0 != (if ~__CS_ret~0 % 256 % 4294967296 <= 2147483647 then ~__CS_ret~0 % 256 % 4294967296 else ~__CS_ret~0 % 256 % 4294967296 - 4294967296);main_thread_#res#1.base, main_thread_#res#1.offset := 0, 0;call ULTIMATE.dealloc(main_thread_~#t1~0#1.base, main_thread_~#t1~0#1.offset);havoc main_thread_~#t1~0#1.base, main_thread_~#t1~0#1.offset;call ULTIMATE.dealloc(main_thread_~#t2~0#1.base, main_thread_~#t2~0#1.offset);havoc main_thread_~#t2~0#1.base, main_thread_~#t2~0#1.offset; [2025-02-06 20:02:44,256 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L744-4: assume !(0 != (if ~__CS_ret~0 % 256 % 4294967296 <= 2147483647 then ~__CS_ret~0 % 256 % 4294967296 else ~__CS_ret~0 % 256 % 4294967296 - 4294967296));assume { :begin_inline___CS_cs } true;havoc __CS_cs_#t~nondet3#1, __CS_cs_#t~nondet4#1, __CS_cs_~k~0#1;havoc __CS_cs_#t~nondet3#1;__CS_cs_~k~0#1 := __CS_cs_#t~nondet3#1;havoc __CS_cs_#t~nondet3#1; [2025-02-06 20:02:44,256 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L744-5: assume { :begin_inline___CS_cs } true;havoc __CS_cs_#t~nondet3#1, __CS_cs_#t~nondet4#1, __CS_cs_~k~0#1;havoc __CS_cs_#t~nondet3#1;__CS_cs_~k~0#1 := __CS_cs_#t~nondet3#1;havoc __CS_cs_#t~nondet3#1; [2025-02-06 20:02:44,256 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L744-7: assume 0 != (if ~__CS_ret~0 % 256 % 4294967296 <= 2147483647 then ~__CS_ret~0 % 256 % 4294967296 else ~__CS_ret~0 % 256 % 4294967296 - 4294967296);main_thread_#res#1.base, main_thread_#res#1.offset := 0, 0;call ULTIMATE.dealloc(main_thread_~#t1~0#1.base, main_thread_~#t1~0#1.offset);havoc main_thread_~#t1~0#1.base, main_thread_~#t1~0#1.offset;call ULTIMATE.dealloc(main_thread_~#t2~0#1.base, main_thread_~#t2~0#1.offset);havoc main_thread_~#t2~0#1.base, main_thread_~#t2~0#1.offset; [2025-02-06 20:02:44,256 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L744-7: assume !(0 != (if ~__CS_ret~0 % 256 % 4294967296 <= 2147483647 then ~__CS_ret~0 % 256 % 4294967296 else ~__CS_ret~0 % 256 % 4294967296 - 4294967296));assume { :begin_inline___CS_cs } true;havoc __CS_cs_#t~nondet3#1, __CS_cs_#t~nondet4#1, __CS_cs_~k~0#1;havoc __CS_cs_#t~nondet3#1;__CS_cs_~k~0#1 := __CS_cs_#t~nondet3#1;havoc __CS_cs_#t~nondet3#1; [2025-02-06 20:02:44,256 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L744-8: assume { :begin_inline___CS_cs } true;havoc __CS_cs_#t~nondet3#1, __CS_cs_#t~nondet4#1, __CS_cs_~k~0#1;havoc __CS_cs_#t~nondet3#1;__CS_cs_~k~0#1 := __CS_cs_#t~nondet3#1;havoc __CS_cs_#t~nondet3#1; [2025-02-06 20:02:44,256 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L746-1: assume 0 != (if ~__CS_ret~0 % 256 % 4294967296 <= 2147483647 then ~__CS_ret~0 % 256 % 4294967296 else ~__CS_ret~0 % 256 % 4294967296 - 4294967296);main_thread_#res#1.base, main_thread_#res#1.offset := 0, 0;call ULTIMATE.dealloc(main_thread_~#t1~0#1.base, main_thread_~#t1~0#1.offset);havoc main_thread_~#t1~0#1.base, main_thread_~#t1~0#1.offset;call ULTIMATE.dealloc(main_thread_~#t2~0#1.base, main_thread_~#t2~0#1.offset);havoc main_thread_~#t2~0#1.base, main_thread_~#t2~0#1.offset; [2025-02-06 20:02:44,256 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L746-1: assume !(0 != (if ~__CS_ret~0 % 256 % 4294967296 <= 2147483647 then ~__CS_ret~0 % 256 % 4294967296 else ~__CS_ret~0 % 256 % 4294967296 - 4294967296)); [2025-02-06 20:02:44,258 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L746-4: assume 0 != (if ~__CS_ret~0 % 256 % 4294967296 <= 2147483647 then ~__CS_ret~0 % 256 % 4294967296 else ~__CS_ret~0 % 256 % 4294967296 - 4294967296);main_thread_#res#1.base, main_thread_#res#1.offset := 0, 0;call ULTIMATE.dealloc(main_thread_~#t1~0#1.base, main_thread_~#t1~0#1.offset);havoc main_thread_~#t1~0#1.base, main_thread_~#t1~0#1.offset;call ULTIMATE.dealloc(main_thread_~#t2~0#1.base, main_thread_~#t2~0#1.offset);havoc main_thread_~#t2~0#1.base, main_thread_~#t2~0#1.offset; [2025-02-06 20:02:44,258 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L746-4: assume !(0 != (if ~__CS_ret~0 % 256 % 4294967296 <= 2147483647 then ~__CS_ret~0 % 256 % 4294967296 else ~__CS_ret~0 % 256 % 4294967296 - 4294967296)); [2025-02-06 20:02:44,258 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L746-7: assume 0 != (if ~__CS_ret~0 % 256 % 4294967296 <= 2147483647 then ~__CS_ret~0 % 256 % 4294967296 else ~__CS_ret~0 % 256 % 4294967296 - 4294967296);main_thread_#res#1.base, main_thread_#res#1.offset := 0, 0;call ULTIMATE.dealloc(main_thread_~#t1~0#1.base, main_thread_~#t1~0#1.offset);havoc main_thread_~#t1~0#1.base, main_thread_~#t1~0#1.offset;call ULTIMATE.dealloc(main_thread_~#t2~0#1.base, main_thread_~#t2~0#1.offset);havoc main_thread_~#t2~0#1.base, main_thread_~#t2~0#1.offset; [2025-02-06 20:02:44,258 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L746-7: assume !(0 != (if ~__CS_ret~0 % 256 % 4294967296 <= 2147483647 then ~__CS_ret~0 % 256 % 4294967296 else ~__CS_ret~0 % 256 % 4294967296 - 4294967296)); [2025-02-06 20:02:44,258 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint __CS_cs_returnLabel#39: havoc __CS_cs_#t~nondet3#1, __CS_cs_#t~nondet4#1, __CS_cs_~k~0#1;assume { :end_inline___CS_cs } true; [2025-02-06 20:02:44,258 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint __CS_cs_returnLabel#40: havoc __CS_cs_#t~nondet3#1, __CS_cs_#t~nondet4#1, __CS_cs_~k~0#1;assume { :end_inline___CS_cs } true; [2025-02-06 20:02:44,258 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint __CS_cs_returnLabel#41: havoc __CS_cs_#t~nondet3#1, __CS_cs_#t~nondet4#1, __CS_cs_~k~0#1;assume { :end_inline___CS_cs } true; [2025-02-06 20:02:44,258 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint __CS_cs_returnLabel#13: havoc __CS_cs_#t~nondet3#1, __CS_cs_#t~nondet4#1, __CS_cs_~k~0#1;assume { :end_inline___CS_cs } true; [2025-02-06 20:02:44,258 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint __CS_cs_returnLabel#68: havoc __CS_cs_#t~nondet3#1, __CS_cs_#t~nondet4#1, __CS_cs_~k~0#1;assume { :end_inline___CS_cs } true; [2025-02-06 20:02:44,258 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint __CS_cs_returnLabel#69: havoc __CS_cs_#t~nondet3#1, __CS_cs_#t~nondet4#1, __CS_cs_~k~0#1;assume { :end_inline___CS_cs } true; [2025-02-06 20:02:44,258 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint __CS_cs_returnLabel#67: havoc __CS_cs_#t~nondet3#1, __CS_cs_#t~nondet4#1, __CS_cs_~k~0#1;assume { :end_inline___CS_cs } true; [2025-02-06 20:02:44,258 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint __CS_cs_returnLabel#11: havoc __CS_cs_#t~nondet3#1, __CS_cs_#t~nondet4#1, __CS_cs_~k~0#1;assume { :end_inline___CS_cs } true; [2025-02-06 20:02:44,258 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint __CS_cs_returnLabel#12: havoc __CS_cs_#t~nondet3#1, __CS_cs_#t~nondet4#1, __CS_cs_~k~0#1;assume { :end_inline___CS_cs } true; [2025-02-06 20:02:44,258 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L561-1: assume !((if ~__CS_round~0 % 256 % 4294967296 <= 2147483647 then ~__CS_round~0 % 256 % 4294967296 else ~__CS_round~0 % 256 % 4294967296 - 4294967296) + (if __CS_cs_~k~0#1 % 256 % 4294967296 <= 2147483647 then __CS_cs_~k~0#1 % 256 % 4294967296 else __CS_cs_~k~0#1 % 256 % 4294967296 - 4294967296) < 2);assume false; [2025-02-06 20:02:44,258 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L561-1: assume !!((if ~__CS_round~0 % 256 % 4294967296 <= 2147483647 then ~__CS_round~0 % 256 % 4294967296 else ~__CS_round~0 % 256 % 4294967296 - 4294967296) + (if __CS_cs_~k~0#1 % 256 % 4294967296 <= 2147483647 then __CS_cs_~k~0#1 % 256 % 4294967296 else __CS_cs_~k~0#1 % 256 % 4294967296 - 4294967296) < 2); [2025-02-06 20:02:44,258 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L561-2: assume !((if ~__CS_round~0 % 256 % 4294967296 <= 2147483647 then ~__CS_round~0 % 256 % 4294967296 else ~__CS_round~0 % 256 % 4294967296 - 4294967296) + (if __CS_cs_~k~0#1 % 256 % 4294967296 <= 2147483647 then __CS_cs_~k~0#1 % 256 % 4294967296 else __CS_cs_~k~0#1 % 256 % 4294967296 - 4294967296) < 2);assume false; [2025-02-06 20:02:44,259 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L561-2: assume !!((if ~__CS_round~0 % 256 % 4294967296 <= 2147483647 then ~__CS_round~0 % 256 % 4294967296 else ~__CS_round~0 % 256 % 4294967296 - 4294967296) + (if __CS_cs_~k~0#1 % 256 % 4294967296 <= 2147483647 then __CS_cs_~k~0#1 % 256 % 4294967296 else __CS_cs_~k~0#1 % 256 % 4294967296 - 4294967296) < 2); [2025-02-06 20:02:44,259 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L561-3: assume !((if ~__CS_round~0 % 256 % 4294967296 <= 2147483647 then ~__CS_round~0 % 256 % 4294967296 else ~__CS_round~0 % 256 % 4294967296 - 4294967296) + (if __CS_cs_~k~0#1 % 256 % 4294967296 <= 2147483647 then __CS_cs_~k~0#1 % 256 % 4294967296 else __CS_cs_~k~0#1 % 256 % 4294967296 - 4294967296) < 2);assume false; [2025-02-06 20:02:44,259 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L561-3: assume !!((if ~__CS_round~0 % 256 % 4294967296 <= 2147483647 then ~__CS_round~0 % 256 % 4294967296 else ~__CS_round~0 % 256 % 4294967296 - 4294967296) + (if __CS_cs_~k~0#1 % 256 % 4294967296 <= 2147483647 then __CS_cs_~k~0#1 % 256 % 4294967296 else __CS_cs_~k~0#1 % 256 % 4294967296 - 4294967296) < 2); [2025-02-06 20:02:44,259 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L561-29: assume !((if ~__CS_round~0 % 256 % 4294967296 <= 2147483647 then ~__CS_round~0 % 256 % 4294967296 else ~__CS_round~0 % 256 % 4294967296 - 4294967296) + (if __CS_cs_~k~0#1 % 256 % 4294967296 <= 2147483647 then __CS_cs_~k~0#1 % 256 % 4294967296 else __CS_cs_~k~0#1 % 256 % 4294967296 - 4294967296) < 2);assume false; [2025-02-06 20:02:44,259 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L561-29: assume !!((if ~__CS_round~0 % 256 % 4294967296 <= 2147483647 then ~__CS_round~0 % 256 % 4294967296 else ~__CS_round~0 % 256 % 4294967296 - 4294967296) + (if __CS_cs_~k~0#1 % 256 % 4294967296 <= 2147483647 then __CS_cs_~k~0#1 % 256 % 4294967296 else __CS_cs_~k~0#1 % 256 % 4294967296 - 4294967296) < 2); [2025-02-06 20:02:44,259 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L561-30: assume !((if ~__CS_round~0 % 256 % 4294967296 <= 2147483647 then ~__CS_round~0 % 256 % 4294967296 else ~__CS_round~0 % 256 % 4294967296 - 4294967296) + (if __CS_cs_~k~0#1 % 256 % 4294967296 <= 2147483647 then __CS_cs_~k~0#1 % 256 % 4294967296 else __CS_cs_~k~0#1 % 256 % 4294967296 - 4294967296) < 2);assume false; [2025-02-06 20:02:44,259 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L561-30: assume !!((if ~__CS_round~0 % 256 % 4294967296 <= 2147483647 then ~__CS_round~0 % 256 % 4294967296 else ~__CS_round~0 % 256 % 4294967296 - 4294967296) + (if __CS_cs_~k~0#1 % 256 % 4294967296 <= 2147483647 then __CS_cs_~k~0#1 % 256 % 4294967296 else __CS_cs_~k~0#1 % 256 % 4294967296 - 4294967296) < 2); [2025-02-06 20:02:44,259 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L561-31: assume !((if ~__CS_round~0 % 256 % 4294967296 <= 2147483647 then ~__CS_round~0 % 256 % 4294967296 else ~__CS_round~0 % 256 % 4294967296 - 4294967296) + (if __CS_cs_~k~0#1 % 256 % 4294967296 <= 2147483647 then __CS_cs_~k~0#1 % 256 % 4294967296 else __CS_cs_~k~0#1 % 256 % 4294967296 - 4294967296) < 2);assume false; [2025-02-06 20:02:44,260 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L561-31: assume !!((if ~__CS_round~0 % 256 % 4294967296 <= 2147483647 then ~__CS_round~0 % 256 % 4294967296 else ~__CS_round~0 % 256 % 4294967296 - 4294967296) + (if __CS_cs_~k~0#1 % 256 % 4294967296 <= 2147483647 then __CS_cs_~k~0#1 % 256 % 4294967296 else __CS_cs_~k~0#1 % 256 % 4294967296 - 4294967296) < 2); [2025-02-06 20:02:44,261 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L562-1: ~__CS_round~0 := (if ~__CS_round~0 % 256 % 4294967296 <= 2147483647 then ~__CS_round~0 % 256 % 4294967296 else ~__CS_round~0 % 256 % 4294967296 - 4294967296) + (if __CS_cs_~k~0#1 % 256 % 4294967296 <= 2147483647 then __CS_cs_~k~0#1 % 256 % 4294967296 else __CS_cs_~k~0#1 % 256 % 4294967296 - 4294967296);havoc __CS_cs_#t~nondet4#1;~__CS_ret~0 := (if 0 != __CS_cs_#t~nondet4#1 && 1 == (if ~__CS_round~0 % 256 % 4294967296 <= 2147483647 then ~__CS_round~0 % 256 % 4294967296 else ~__CS_round~0 % 256 % 4294967296 - 4294967296) then (if ~__CS_ret_PREEMPTED~0 % 256 % 4294967296 <= 2147483647 then ~__CS_ret_PREEMPTED~0 % 256 % 4294967296 else ~__CS_ret_PREEMPTED~0 % 256 % 4294967296 - 4294967296) else (if ~__CS_ret~0 % 256 % 4294967296 <= 2147483647 then ~__CS_ret~0 % 256 % 4294967296 else ~__CS_ret~0 % 256 % 4294967296 - 4294967296));havoc __CS_cs_#t~nondet4#1; [2025-02-06 20:02:44,262 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L562-2: ~__CS_round~0 := (if ~__CS_round~0 % 256 % 4294967296 <= 2147483647 then ~__CS_round~0 % 256 % 4294967296 else ~__CS_round~0 % 256 % 4294967296 - 4294967296) + (if __CS_cs_~k~0#1 % 256 % 4294967296 <= 2147483647 then __CS_cs_~k~0#1 % 256 % 4294967296 else __CS_cs_~k~0#1 % 256 % 4294967296 - 4294967296);havoc __CS_cs_#t~nondet4#1;~__CS_ret~0 := (if 0 != __CS_cs_#t~nondet4#1 && 1 == (if ~__CS_round~0 % 256 % 4294967296 <= 2147483647 then ~__CS_round~0 % 256 % 4294967296 else ~__CS_round~0 % 256 % 4294967296 - 4294967296) then (if ~__CS_ret_PREEMPTED~0 % 256 % 4294967296 <= 2147483647 then ~__CS_ret_PREEMPTED~0 % 256 % 4294967296 else ~__CS_ret_PREEMPTED~0 % 256 % 4294967296 - 4294967296) else (if ~__CS_ret~0 % 256 % 4294967296 <= 2147483647 then ~__CS_ret~0 % 256 % 4294967296 else ~__CS_ret~0 % 256 % 4294967296 - 4294967296));havoc __CS_cs_#t~nondet4#1; [2025-02-06 20:02:44,262 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L562-3: ~__CS_round~0 := (if ~__CS_round~0 % 256 % 4294967296 <= 2147483647 then ~__CS_round~0 % 256 % 4294967296 else ~__CS_round~0 % 256 % 4294967296 - 4294967296) + (if __CS_cs_~k~0#1 % 256 % 4294967296 <= 2147483647 then __CS_cs_~k~0#1 % 256 % 4294967296 else __CS_cs_~k~0#1 % 256 % 4294967296 - 4294967296);havoc __CS_cs_#t~nondet4#1;~__CS_ret~0 := (if 0 != __CS_cs_#t~nondet4#1 && 1 == (if ~__CS_round~0 % 256 % 4294967296 <= 2147483647 then ~__CS_round~0 % 256 % 4294967296 else ~__CS_round~0 % 256 % 4294967296 - 4294967296) then (if ~__CS_ret_PREEMPTED~0 % 256 % 4294967296 <= 2147483647 then ~__CS_ret_PREEMPTED~0 % 256 % 4294967296 else ~__CS_ret_PREEMPTED~0 % 256 % 4294967296 - 4294967296) else (if ~__CS_ret~0 % 256 % 4294967296 <= 2147483647 then ~__CS_ret~0 % 256 % 4294967296 else ~__CS_ret~0 % 256 % 4294967296 - 4294967296));havoc __CS_cs_#t~nondet4#1; [2025-02-06 20:02:44,262 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L561-57: assume !((if ~__CS_round~0 % 256 % 4294967296 <= 2147483647 then ~__CS_round~0 % 256 % 4294967296 else ~__CS_round~0 % 256 % 4294967296 - 4294967296) + (if __CS_cs_~k~0#1 % 256 % 4294967296 <= 2147483647 then __CS_cs_~k~0#1 % 256 % 4294967296 else __CS_cs_~k~0#1 % 256 % 4294967296 - 4294967296) < 2);assume false; [2025-02-06 20:02:44,262 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L561-57: assume !!((if ~__CS_round~0 % 256 % 4294967296 <= 2147483647 then ~__CS_round~0 % 256 % 4294967296 else ~__CS_round~0 % 256 % 4294967296 - 4294967296) + (if __CS_cs_~k~0#1 % 256 % 4294967296 <= 2147483647 then __CS_cs_~k~0#1 % 256 % 4294967296 else __CS_cs_~k~0#1 % 256 % 4294967296 - 4294967296) < 2); [2025-02-06 20:02:44,262 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L561-58: assume !((if ~__CS_round~0 % 256 % 4294967296 <= 2147483647 then ~__CS_round~0 % 256 % 4294967296 else ~__CS_round~0 % 256 % 4294967296 - 4294967296) + (if __CS_cs_~k~0#1 % 256 % 4294967296 <= 2147483647 then __CS_cs_~k~0#1 % 256 % 4294967296 else __CS_cs_~k~0#1 % 256 % 4294967296 - 4294967296) < 2);assume false; [2025-02-06 20:02:44,262 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L561-58: assume !!((if ~__CS_round~0 % 256 % 4294967296 <= 2147483647 then ~__CS_round~0 % 256 % 4294967296 else ~__CS_round~0 % 256 % 4294967296 - 4294967296) + (if __CS_cs_~k~0#1 % 256 % 4294967296 <= 2147483647 then __CS_cs_~k~0#1 % 256 % 4294967296 else __CS_cs_~k~0#1 % 256 % 4294967296 - 4294967296) < 2); [2025-02-06 20:02:44,263 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L561-59: assume !((if ~__CS_round~0 % 256 % 4294967296 <= 2147483647 then ~__CS_round~0 % 256 % 4294967296 else ~__CS_round~0 % 256 % 4294967296 - 4294967296) + (if __CS_cs_~k~0#1 % 256 % 4294967296 <= 2147483647 then __CS_cs_~k~0#1 % 256 % 4294967296 else __CS_cs_~k~0#1 % 256 % 4294967296 - 4294967296) < 2);assume false; [2025-02-06 20:02:44,263 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L561-59: assume !!((if ~__CS_round~0 % 256 % 4294967296 <= 2147483647 then ~__CS_round~0 % 256 % 4294967296 else ~__CS_round~0 % 256 % 4294967296 - 4294967296) + (if __CS_cs_~k~0#1 % 256 % 4294967296 <= 2147483647 then __CS_cs_~k~0#1 % 256 % 4294967296 else __CS_cs_~k~0#1 % 256 % 4294967296 - 4294967296) < 2); [2025-02-06 20:02:44,263 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L562-29: ~__CS_round~0 := (if ~__CS_round~0 % 256 % 4294967296 <= 2147483647 then ~__CS_round~0 % 256 % 4294967296 else ~__CS_round~0 % 256 % 4294967296 - 4294967296) + (if __CS_cs_~k~0#1 % 256 % 4294967296 <= 2147483647 then __CS_cs_~k~0#1 % 256 % 4294967296 else __CS_cs_~k~0#1 % 256 % 4294967296 - 4294967296);havoc __CS_cs_#t~nondet4#1;~__CS_ret~0 := (if 0 != __CS_cs_#t~nondet4#1 && 1 == (if ~__CS_round~0 % 256 % 4294967296 <= 2147483647 then ~__CS_round~0 % 256 % 4294967296 else ~__CS_round~0 % 256 % 4294967296 - 4294967296) then (if ~__CS_ret_PREEMPTED~0 % 256 % 4294967296 <= 2147483647 then ~__CS_ret_PREEMPTED~0 % 256 % 4294967296 else ~__CS_ret_PREEMPTED~0 % 256 % 4294967296 - 4294967296) else (if ~__CS_ret~0 % 256 % 4294967296 <= 2147483647 then ~__CS_ret~0 % 256 % 4294967296 else ~__CS_ret~0 % 256 % 4294967296 - 4294967296));havoc __CS_cs_#t~nondet4#1; [2025-02-06 20:02:44,263 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L562-30: ~__CS_round~0 := (if ~__CS_round~0 % 256 % 4294967296 <= 2147483647 then ~__CS_round~0 % 256 % 4294967296 else ~__CS_round~0 % 256 % 4294967296 - 4294967296) + (if __CS_cs_~k~0#1 % 256 % 4294967296 <= 2147483647 then __CS_cs_~k~0#1 % 256 % 4294967296 else __CS_cs_~k~0#1 % 256 % 4294967296 - 4294967296);havoc __CS_cs_#t~nondet4#1;~__CS_ret~0 := (if 0 != __CS_cs_#t~nondet4#1 && 1 == (if ~__CS_round~0 % 256 % 4294967296 <= 2147483647 then ~__CS_round~0 % 256 % 4294967296 else ~__CS_round~0 % 256 % 4294967296 - 4294967296) then (if ~__CS_ret_PREEMPTED~0 % 256 % 4294967296 <= 2147483647 then ~__CS_ret_PREEMPTED~0 % 256 % 4294967296 else ~__CS_ret_PREEMPTED~0 % 256 % 4294967296 - 4294967296) else (if ~__CS_ret~0 % 256 % 4294967296 <= 2147483647 then ~__CS_ret~0 % 256 % 4294967296 else ~__CS_ret~0 % 256 % 4294967296 - 4294967296));havoc __CS_cs_#t~nondet4#1; [2025-02-06 20:02:44,263 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L562-31: ~__CS_round~0 := (if ~__CS_round~0 % 256 % 4294967296 <= 2147483647 then ~__CS_round~0 % 256 % 4294967296 else ~__CS_round~0 % 256 % 4294967296 - 4294967296) + (if __CS_cs_~k~0#1 % 256 % 4294967296 <= 2147483647 then __CS_cs_~k~0#1 % 256 % 4294967296 else __CS_cs_~k~0#1 % 256 % 4294967296 - 4294967296);havoc __CS_cs_#t~nondet4#1;~__CS_ret~0 := (if 0 != __CS_cs_#t~nondet4#1 && 1 == (if ~__CS_round~0 % 256 % 4294967296 <= 2147483647 then ~__CS_round~0 % 256 % 4294967296 else ~__CS_round~0 % 256 % 4294967296 - 4294967296) then (if ~__CS_ret_PREEMPTED~0 % 256 % 4294967296 <= 2147483647 then ~__CS_ret_PREEMPTED~0 % 256 % 4294967296 else ~__CS_ret_PREEMPTED~0 % 256 % 4294967296 - 4294967296) else (if ~__CS_ret~0 % 256 % 4294967296 <= 2147483647 then ~__CS_ret~0 % 256 % 4294967296 else ~__CS_ret~0 % 256 % 4294967296 - 4294967296));havoc __CS_cs_#t~nondet4#1; [2025-02-06 20:02:44,511 INFO L? ?]: Removed 620 outVars from TransFormulas that were not future-live. [2025-02-06 20:02:44,511 INFO L308 CfgBuilder]: Performing block encoding [2025-02-06 20:02:44,540 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-06 20:02:44,540 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-06 20:02:44,541 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 08:02:44 BoogieIcfgContainer [2025-02-06 20:02:44,543 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-06 20:02:44,544 INFO L112 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2025-02-06 20:02:44,544 INFO L270 PluginConnector]: Initializing BuchiAutomizer... [2025-02-06 20:02:44,549 INFO L274 PluginConnector]: BuchiAutomizer initialized [2025-02-06 20:02:44,550 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2025-02-06 20:02:44,550 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 06.02 08:02:39" (1/3) ... [2025-02-06 20:02:44,551 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@50f802ee and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 06.02 08:02:44, skipping insertion in model container [2025-02-06 20:02:44,551 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2025-02-06 20:02:44,551 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 08:02:40" (2/3) ... [2025-02-06 20:02:44,551 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@50f802ee and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 06.02 08:02:44, skipping insertion in model container [2025-02-06 20:02:44,551 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2025-02-06 20:02:44,551 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 08:02:44" (3/3) ... [2025-02-06 20:02:44,552 INFO L363 chiAutomizerObserver]: Analyzing ICFG cs_stateful-1.i [2025-02-06 20:02:44,613 INFO L306 stractBuchiCegarLoop]: Interprodecural is true [2025-02-06 20:02:44,613 INFO L307 stractBuchiCegarLoop]: Hoare is None [2025-02-06 20:02:44,613 INFO L308 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2025-02-06 20:02:44,613 INFO L309 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2025-02-06 20:02:44,614 INFO L310 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2025-02-06 20:02:44,614 INFO L311 stractBuchiCegarLoop]: Difference is false [2025-02-06 20:02:44,614 INFO L312 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2025-02-06 20:02:44,614 INFO L316 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiAutomatonCegarLoop ======== [2025-02-06 20:02:44,620 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 482 states, 481 states have (on average 1.503118503118503) internal successors, (723), 481 states have internal predecessors, (723), 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) [2025-02-06 20:02:44,670 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2025-02-06 20:02:44,671 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-02-06 20:02:44,672 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-02-06 20:02:44,677 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2025-02-06 20:02:44,677 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2025-02-06 20:02:44,678 INFO L338 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2025-02-06 20:02:44,679 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 482 states, 481 states have (on average 1.503118503118503) internal successors, (723), 481 states have internal predecessors, (723), 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) [2025-02-06 20:02:44,695 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2025-02-06 20:02:44,695 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-02-06 20:02:44,695 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-02-06 20:02:44,695 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2025-02-06 20:02:44,695 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2025-02-06 20:02:44,700 INFO L752 eck$LassoCheckResult]: Stem: "assume { :begin_inline_ULTIMATE.init } true;havoc ULTIMATE.init_#t~nondet99#1, ULTIMATE.init_#t~nondet100#1, ULTIMATE.init_#t~nondet101#1, ULTIMATE.init_#t~nondet102#1, ULTIMATE.init_#t~nondet103#1, ULTIMATE.init_#t~nondet104#1;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int#0(48, 1, 0, 1);call write~init~int#0(0, 1, 1, 1);call #Ultimate.allocInit(16, 2);~__CS_round~0 := 0;~__CS_ret~0 := 0;~__CS_ret_PREEMPTED~0 := 1;~__CS_ret_ERROR~0 := 2;~__CS_ret_FINISHED~0 := 4;~__CS_error~0 := 0;~__CS_thread_index~0 := 0;call #Ultimate.allocInit(3, 3);~#__CS_thread_allocated~0.base, ~#__CS_thread_allocated~0.offset := 3, 0;call write~init~int#1(0, ~#__CS_thread_allocated~0.base, ~#__CS_thread_allocated~0.offset, 1);call write~init~int#1(0, ~#__CS_thread_allocated~0.base, 1 + ~#__CS_thread_allocated~0.offset, 1);call write~init~int#1(0, ~#__CS_thread_allocated~0.base, 2 + ~#__CS_thread_allocated~0.offset, 1);call #Ultimate.allocInit(3, 4);~#__CS_thread_born_round~0.base, ~#__CS_thread_born_round~0.offset := 4, 0;call write~init~int#3(0, ~#__CS_thread_born_round~0.base, ~#__CS_thread_born_round~0.offset, 1);call write~init~int#3(0, ~#__CS_thread_born_round~0.base, 1 + ~#__CS_thread_born_round~0.offset, 1);call write~init~int#3(0, ~#__CS_thread_born_round~0.base, 2 + ~#__CS_thread_born_round~0.offset, 1);call #Ultimate.allocInit(12, 5);~#__CS_thread~0.base, ~#__CS_thread~0.offset := 5, 0;call write~init~$Pointer$#4(0, 0, ~#__CS_thread~0.base, ~#__CS_thread~0.offset, 4);call write~init~$Pointer$#4(0, 0, ~#__CS_thread~0.base, 4 + ~#__CS_thread~0.offset, 4);call write~init~$Pointer$#4(0, 0, ~#__CS_thread~0.base, 8 + ~#__CS_thread~0.offset, 4);call #Ultimate.allocInit(6, 6);~#__CS_thread_status~0.base, ~#__CS_thread_status~0.offset := 6, 0;call write~init~int#5(0, ~#__CS_thread_status~0.base, ~#__CS_thread_status~0.offset, 1);call write~init~int#5(0, ~#__CS_thread_status~0.base, 1 + ~#__CS_thread_status~0.offset, 1);call write~init~int#5(0, ~#__CS_thread_status~0.base, 2 + ~#__CS_thread_status~0.offset, 1);call write~init~int#5(0, ~#__CS_thread_status~0.base, 3 + ~#__CS_thread_status~0.offset, 1);call write~init~int#5(0, ~#__CS_thread_status~0.base, 4 + ~#__CS_thread_status~0.offset, 1);call write~init~int#5(0, ~#__CS_thread_status~0.base, 5 + ~#__CS_thread_status~0.offset, 1);~__THREAD_UNUSED~0 := 0;~__THREAD_RUNNING~0 := 1;~__THREAD_FINISHED~0 := 2;call #Ultimate.allocInit(24, 7);~#__CS_thread_lockedon~0.base, ~#__CS_thread_lockedon~0.offset := 7, 0;call write~init~$Pointer$#6(0, 0, ~#__CS_thread_lockedon~0.base, ~#__CS_thread_lockedon~0.offset, 4);call write~init~$Pointer$#6(0, 0, ~#__CS_thread_lockedon~0.base, 4 + ~#__CS_thread_lockedon~0.offset, 4);call write~init~$Pointer$#6(0, 0, ~#__CS_thread_lockedon~0.base, 8 + ~#__CS_thread_lockedon~0.offset, 4);call write~init~$Pointer$#6(0, 0, ~#__CS_thread_lockedon~0.base, 12 + ~#__CS_thread_lockedon~0.offset, 4);call write~init~$Pointer$#6(0, 0, ~#__CS_thread_lockedon~0.base, 16 + ~#__CS_thread_lockedon~0.offset, 4);call write~init~$Pointer$#6(0, 0, ~#__CS_thread_lockedon~0.base, 20 + ~#__CS_thread_lockedon~0.offset, 4);call #Ultimate.allocInit(2, 8);~#ma~0.base, ~#ma~0.offset := 8, 0;call write~init~int#7(0, ~#ma~0.base, ~#ma~0.offset, 1);call write~init~int#7(0, ~#ma~0.base, 1 + ~#ma~0.offset, 1);call #Ultimate.allocInit(2, 9);~#mb~0.base, ~#mb~0.offset := 9, 0;call write~init~int#7(0, ~#mb~0.base, ~#mb~0.offset, 1);call write~init~int#7(0, ~#mb~0.base, 1 + ~#mb~0.offset, 1);call #Ultimate.allocInit(8, 10);~#data1~0.base, ~#data1~0.offset := 10, 0;call write~init~int#9(0, ~#data1~0.base, ~#data1~0.offset, 4);call write~init~int#9(0, ~#data1~0.base, 4 + ~#data1~0.offset, 4);call #Ultimate.allocInit(8, 11);~#data2~0.base, ~#data2~0.offset := 11, 0;call write~init~int#10(0, ~#data2~0.base, ~#data2~0.offset, 4);call write~init~int#10(0, ~#data2~0.base, 4 + ~#data2~0.offset, 4);~__CS_u~0.ma := ~__CS_u~0.ma[0 := 0];~__CS_u~0.ma := ~__CS_u~0.ma[1 := 0];~__CS_u~0.mb := ~__CS_u~0.mb[0 := ULTIMATE.init_#t~nondet99#1];~__CS_u~0.mb := ~__CS_u~0.mb[1 := ULTIMATE.init_#t~nondet100#1];~__CS_u~0.data1 := ~__CS_u~0.data1[0 := ULTIMATE.init_#t~nondet101#1];~__CS_u~0.data1 := ~__CS_u~0.data1[1 := ULTIMATE.init_#t~nondet102#1];~__CS_u~0.data2 := ~__CS_u~0.data2[0 := ULTIMATE.init_#t~nondet103#1];~__CS_u~0.data2 := ~__CS_u~0.data2[1 := ULTIMATE.init_#t~nondet104#1];havoc ULTIMATE.init_#t~nondet99#1;havoc ULTIMATE.init_#t~nondet100#1;havoc ULTIMATE.init_#t~nondet101#1;havoc ULTIMATE.init_#t~nondet102#1;havoc ULTIMATE.init_#t~nondet103#1;havoc ULTIMATE.init_#t~nondet104#1;" "havoc ULTIMATE.init_#t~nondet99#1, ULTIMATE.init_#t~nondet100#1, ULTIMATE.init_#t~nondet101#1, ULTIMATE.init_#t~nondet102#1, ULTIMATE.init_#t~nondet103#1, ULTIMATE.init_#t~nondet104#1;assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet46#1, main_#t~nondet47#1, main_#t~pre48#1, main_~j~2#1, main_#t~nondet49#1, main_#t~nondet50#1, main_#t~nondet51#1, main_#t~nondet52#1, main_#t~pre53#1, main_~i~0#1, main_#t~mem54#1, main_#t~mem55#1, main_#t~mem56#1, main_#t~mem57#1.base, main_#t~mem57#1.offset, main_#t~mem58#1.base, main_#t~mem58#1.offset, main_#t~mem59#1.base, main_#t~mem59#1.offset, main_#t~mem60#1, main_#t~mem61#1, main_#t~mem62#1, main_#t~mem63#1, main_#t~mem64#1, main_#t~mem65#1, main_#t~mem67#1.base, main_#t~mem67#1.offset, main_#t~ret68#1.base, main_#t~ret68#1.offset, main_#t~mem69#1, main_#t~mem70#1, main_#t~mem72#1.base, main_#t~mem72#1.offset, main_#t~ret73#1.base, main_#t~ret73#1.offset, main_#t~mem74#1, main_#t~mem75#1, main_#t~mem77#1.base, main_#t~mem77#1.offset, main_#t~ret78#1.base, main_#t~ret78#1.offset, main_#t~mem79#1, main_#t~mem80#1, main_#t~mem81#1, main_#t~mem82#1, main_#t~mem83#1, main_#t~mem84#1, main_#t~mem85#1.base, main_#t~mem85#1.offset, main_#t~mem86#1.base, main_#t~mem86#1.offset, main_#t~mem87#1.base, main_#t~mem87#1.offset, main_#t~mem88#1.base, main_#t~mem88#1.offset, main_#t~mem89#1.base, main_#t~mem89#1.offset, main_#t~mem90#1.base, main_#t~mem90#1.offset, main_#t~mem91#1, main_#t~mem92#1, main_#t~mem93#1, main_#t~mem94#1, main_#t~mem95#1, main_#t~mem96#1, main_#t~mem97#1, main_#t~mem98#1, main_~#__CS_cp___CS_thread_status~0#1.base, main_~#__CS_cp___CS_thread_status~0#1.offset, main_~#__CS_cp___CS_thread_lockedon~0#1.base, main_~#__CS_cp___CS_thread_lockedon~0#1.offset, main_~#__CS_cp_ma~0#1.base, main_~#__CS_cp_ma~0#1.offset, main_~#__CS_cp_mb~0#1.base, main_~#__CS_cp_mb~0#1.offset, main_~#__CS_cp_data1~0#1.base, main_~#__CS_cp_data1~0#1.offset, main_~#__CS_cp_data2~0#1.base, main_~#__CS_cp_data2~0#1.offset;call main_~#__CS_cp___CS_thread_status~0#1.base, main_~#__CS_cp___CS_thread_status~0#1.offset := #Ultimate.allocOnStack(6);call main_~#__CS_cp___CS_thread_lockedon~0#1.base, main_~#__CS_cp___CS_thread_lockedon~0#1.offset := #Ultimate.allocOnStack(24);call main_~#__CS_cp_ma~0#1.base, main_~#__CS_cp_ma~0#1.offset := #Ultimate.allocOnStack(2);call main_~#__CS_cp_mb~0#1.base, main_~#__CS_cp_mb~0#1.offset := #Ultimate.allocOnStack(2);call main_~#__CS_cp_data1~0#1.base, main_~#__CS_cp_data1~0#1.offset := #Ultimate.allocOnStack(8);call main_~#__CS_cp_data2~0#1.base, main_~#__CS_cp_data2~0#1.offset := #Ultimate.allocOnStack(8);main_~i~0#1 := 0;" [2025-02-06 20:02:44,700 INFO L754 eck$LassoCheckResult]: Loop: "assume main_~i~0#1 < 2;main_~j~2#1 := 0;" "assume !(main_~j~2#1 < 3);havoc main_~j~2#1;havoc main_#t~nondet49#1;call write~int#13(main_#t~nondet49#1, main_~#__CS_cp_ma~0#1.base, main_~#__CS_cp_ma~0#1.offset + main_~i~0#1, 1);havoc main_#t~nondet49#1;havoc main_#t~nondet50#1;call write~int#2(main_#t~nondet50#1, main_~#__CS_cp_mb~0#1.base, main_~#__CS_cp_mb~0#1.offset + main_~i~0#1, 1);havoc main_#t~nondet50#1;havoc main_#t~nondet51#1;call write~int#15(main_#t~nondet51#1, main_~#__CS_cp_data1~0#1.base, main_~#__CS_cp_data1~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet51#1;havoc main_#t~nondet52#1;call write~int#8(main_#t~nondet52#1, main_~#__CS_cp_data2~0#1.base, main_~#__CS_cp_data2~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet52#1;main_#t~pre53#1 := 1 + main_~i~0#1;main_~i~0#1 := 1 + main_~i~0#1;havoc main_#t~pre53#1;" [2025-02-06 20:02:44,705 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 20:02:44,706 INFO L85 PathProgramCache]: Analyzing trace with hash 39328, now seen corresponding path program 1 times [2025-02-06 20:02:44,712 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 20:02:44,712 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1875259305] [2025-02-06 20:02:44,713 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 20:02:44,713 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 20:02:44,805 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-02-06 20:02:44,874 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-02-06 20:02:44,876 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 20:02:44,876 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 20:02:44,876 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-06 20:02:44,893 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-02-06 20:02:44,942 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-02-06 20:02:44,944 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 20:02:44,944 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 20:02:44,978 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-06 20:02:44,980 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 20:02:44,980 INFO L85 PathProgramCache]: Analyzing trace with hash 39263, now seen corresponding path program 1 times [2025-02-06 20:02:44,981 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 20:02:44,981 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1413776091] [2025-02-06 20:02:44,981 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 20:02:44,981 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 20:02:45,002 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-02-06 20:02:45,017 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-02-06 20:02:45,017 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 20:02:45,017 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 20:02:45,112 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 20:02:45,112 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 20:02:45,112 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1413776091] [2025-02-06 20:02:45,112 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1413776091] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 20:02:45,113 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 20:02:45,113 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-02-06 20:02:45,113 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [164949926] [2025-02-06 20:02:45,113 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 20:02:45,116 INFO L769 eck$LassoCheckResult]: loop already infeasible [2025-02-06 20:02:45,117 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 20:02:45,138 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 20:02:45,139 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 20:02:45,142 INFO L87 Difference]: Start difference. First operand has 482 states, 481 states have (on average 1.503118503118503) internal successors, (723), 481 states have internal predecessors, (723), 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, 2 states have (on average 1.0) internal successors, (2), 2 states have internal predecessors, (2), 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) [2025-02-06 20:02:45,216 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 20:02:45,217 INFO L93 Difference]: Finished difference Result 482 states and 630 transitions. [2025-02-06 20:02:45,218 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 482 states and 630 transitions. [2025-02-06 20:02:45,223 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2025-02-06 20:02:45,229 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 482 states to 5 states and 6 transitions. [2025-02-06 20:02:45,230 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 5 [2025-02-06 20:02:45,231 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 5 [2025-02-06 20:02:45,231 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 6 transitions. [2025-02-06 20:02:45,231 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2025-02-06 20:02:45,232 INFO L218 hiAutomatonCegarLoop]: Abstraction has 5 states and 6 transitions. [2025-02-06 20:02:45,242 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5 states and 6 transitions. [2025-02-06 20:02:45,249 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5 to 5. [2025-02-06 20:02:45,250 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 1.2) internal successors, (6), 4 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 20:02:45,250 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 6 transitions. [2025-02-06 20:02:45,251 INFO L240 hiAutomatonCegarLoop]: Abstraction has 5 states and 6 transitions. [2025-02-06 20:02:45,252 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 20:02:45,255 INFO L432 stractBuchiCegarLoop]: Abstraction has 5 states and 6 transitions. [2025-02-06 20:02:45,255 INFO L338 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2025-02-06 20:02:45,255 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 5 states and 6 transitions. [2025-02-06 20:02:45,257 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2025-02-06 20:02:45,257 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-02-06 20:02:45,257 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-02-06 20:02:45,257 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2025-02-06 20:02:45,257 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2025-02-06 20:02:45,257 INFO L752 eck$LassoCheckResult]: Stem: "assume { :begin_inline_ULTIMATE.init } true;havoc ULTIMATE.init_#t~nondet99#1, ULTIMATE.init_#t~nondet100#1, ULTIMATE.init_#t~nondet101#1, ULTIMATE.init_#t~nondet102#1, ULTIMATE.init_#t~nondet103#1, ULTIMATE.init_#t~nondet104#1;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int#0(48, 1, 0, 1);call write~init~int#0(0, 1, 1, 1);call #Ultimate.allocInit(16, 2);~__CS_round~0 := 0;~__CS_ret~0 := 0;~__CS_ret_PREEMPTED~0 := 1;~__CS_ret_ERROR~0 := 2;~__CS_ret_FINISHED~0 := 4;~__CS_error~0 := 0;~__CS_thread_index~0 := 0;call #Ultimate.allocInit(3, 3);~#__CS_thread_allocated~0.base, ~#__CS_thread_allocated~0.offset := 3, 0;call write~init~int#1(0, ~#__CS_thread_allocated~0.base, ~#__CS_thread_allocated~0.offset, 1);call write~init~int#1(0, ~#__CS_thread_allocated~0.base, 1 + ~#__CS_thread_allocated~0.offset, 1);call write~init~int#1(0, ~#__CS_thread_allocated~0.base, 2 + ~#__CS_thread_allocated~0.offset, 1);call #Ultimate.allocInit(3, 4);~#__CS_thread_born_round~0.base, ~#__CS_thread_born_round~0.offset := 4, 0;call write~init~int#3(0, ~#__CS_thread_born_round~0.base, ~#__CS_thread_born_round~0.offset, 1);call write~init~int#3(0, ~#__CS_thread_born_round~0.base, 1 + ~#__CS_thread_born_round~0.offset, 1);call write~init~int#3(0, ~#__CS_thread_born_round~0.base, 2 + ~#__CS_thread_born_round~0.offset, 1);call #Ultimate.allocInit(12, 5);~#__CS_thread~0.base, ~#__CS_thread~0.offset := 5, 0;call write~init~$Pointer$#4(0, 0, ~#__CS_thread~0.base, ~#__CS_thread~0.offset, 4);call write~init~$Pointer$#4(0, 0, ~#__CS_thread~0.base, 4 + ~#__CS_thread~0.offset, 4);call write~init~$Pointer$#4(0, 0, ~#__CS_thread~0.base, 8 + ~#__CS_thread~0.offset, 4);call #Ultimate.allocInit(6, 6);~#__CS_thread_status~0.base, ~#__CS_thread_status~0.offset := 6, 0;call write~init~int#5(0, ~#__CS_thread_status~0.base, ~#__CS_thread_status~0.offset, 1);call write~init~int#5(0, ~#__CS_thread_status~0.base, 1 + ~#__CS_thread_status~0.offset, 1);call write~init~int#5(0, ~#__CS_thread_status~0.base, 2 + ~#__CS_thread_status~0.offset, 1);call write~init~int#5(0, ~#__CS_thread_status~0.base, 3 + ~#__CS_thread_status~0.offset, 1);call write~init~int#5(0, ~#__CS_thread_status~0.base, 4 + ~#__CS_thread_status~0.offset, 1);call write~init~int#5(0, ~#__CS_thread_status~0.base, 5 + ~#__CS_thread_status~0.offset, 1);~__THREAD_UNUSED~0 := 0;~__THREAD_RUNNING~0 := 1;~__THREAD_FINISHED~0 := 2;call #Ultimate.allocInit(24, 7);~#__CS_thread_lockedon~0.base, ~#__CS_thread_lockedon~0.offset := 7, 0;call write~init~$Pointer$#6(0, 0, ~#__CS_thread_lockedon~0.base, ~#__CS_thread_lockedon~0.offset, 4);call write~init~$Pointer$#6(0, 0, ~#__CS_thread_lockedon~0.base, 4 + ~#__CS_thread_lockedon~0.offset, 4);call write~init~$Pointer$#6(0, 0, ~#__CS_thread_lockedon~0.base, 8 + ~#__CS_thread_lockedon~0.offset, 4);call write~init~$Pointer$#6(0, 0, ~#__CS_thread_lockedon~0.base, 12 + ~#__CS_thread_lockedon~0.offset, 4);call write~init~$Pointer$#6(0, 0, ~#__CS_thread_lockedon~0.base, 16 + ~#__CS_thread_lockedon~0.offset, 4);call write~init~$Pointer$#6(0, 0, ~#__CS_thread_lockedon~0.base, 20 + ~#__CS_thread_lockedon~0.offset, 4);call #Ultimate.allocInit(2, 8);~#ma~0.base, ~#ma~0.offset := 8, 0;call write~init~int#7(0, ~#ma~0.base, ~#ma~0.offset, 1);call write~init~int#7(0, ~#ma~0.base, 1 + ~#ma~0.offset, 1);call #Ultimate.allocInit(2, 9);~#mb~0.base, ~#mb~0.offset := 9, 0;call write~init~int#7(0, ~#mb~0.base, ~#mb~0.offset, 1);call write~init~int#7(0, ~#mb~0.base, 1 + ~#mb~0.offset, 1);call #Ultimate.allocInit(8, 10);~#data1~0.base, ~#data1~0.offset := 10, 0;call write~init~int#9(0, ~#data1~0.base, ~#data1~0.offset, 4);call write~init~int#9(0, ~#data1~0.base, 4 + ~#data1~0.offset, 4);call #Ultimate.allocInit(8, 11);~#data2~0.base, ~#data2~0.offset := 11, 0;call write~init~int#10(0, ~#data2~0.base, ~#data2~0.offset, 4);call write~init~int#10(0, ~#data2~0.base, 4 + ~#data2~0.offset, 4);~__CS_u~0.ma := ~__CS_u~0.ma[0 := 0];~__CS_u~0.ma := ~__CS_u~0.ma[1 := 0];~__CS_u~0.mb := ~__CS_u~0.mb[0 := ULTIMATE.init_#t~nondet99#1];~__CS_u~0.mb := ~__CS_u~0.mb[1 := ULTIMATE.init_#t~nondet100#1];~__CS_u~0.data1 := ~__CS_u~0.data1[0 := ULTIMATE.init_#t~nondet101#1];~__CS_u~0.data1 := ~__CS_u~0.data1[1 := ULTIMATE.init_#t~nondet102#1];~__CS_u~0.data2 := ~__CS_u~0.data2[0 := ULTIMATE.init_#t~nondet103#1];~__CS_u~0.data2 := ~__CS_u~0.data2[1 := ULTIMATE.init_#t~nondet104#1];havoc ULTIMATE.init_#t~nondet99#1;havoc ULTIMATE.init_#t~nondet100#1;havoc ULTIMATE.init_#t~nondet101#1;havoc ULTIMATE.init_#t~nondet102#1;havoc ULTIMATE.init_#t~nondet103#1;havoc ULTIMATE.init_#t~nondet104#1;" "havoc ULTIMATE.init_#t~nondet99#1, ULTIMATE.init_#t~nondet100#1, ULTIMATE.init_#t~nondet101#1, ULTIMATE.init_#t~nondet102#1, ULTIMATE.init_#t~nondet103#1, ULTIMATE.init_#t~nondet104#1;assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet46#1, main_#t~nondet47#1, main_#t~pre48#1, main_~j~2#1, main_#t~nondet49#1, main_#t~nondet50#1, main_#t~nondet51#1, main_#t~nondet52#1, main_#t~pre53#1, main_~i~0#1, main_#t~mem54#1, main_#t~mem55#1, main_#t~mem56#1, main_#t~mem57#1.base, main_#t~mem57#1.offset, main_#t~mem58#1.base, main_#t~mem58#1.offset, main_#t~mem59#1.base, main_#t~mem59#1.offset, main_#t~mem60#1, main_#t~mem61#1, main_#t~mem62#1, main_#t~mem63#1, main_#t~mem64#1, main_#t~mem65#1, main_#t~mem67#1.base, main_#t~mem67#1.offset, main_#t~ret68#1.base, main_#t~ret68#1.offset, main_#t~mem69#1, main_#t~mem70#1, main_#t~mem72#1.base, main_#t~mem72#1.offset, main_#t~ret73#1.base, main_#t~ret73#1.offset, main_#t~mem74#1, main_#t~mem75#1, main_#t~mem77#1.base, main_#t~mem77#1.offset, main_#t~ret78#1.base, main_#t~ret78#1.offset, main_#t~mem79#1, main_#t~mem80#1, main_#t~mem81#1, main_#t~mem82#1, main_#t~mem83#1, main_#t~mem84#1, main_#t~mem85#1.base, main_#t~mem85#1.offset, main_#t~mem86#1.base, main_#t~mem86#1.offset, main_#t~mem87#1.base, main_#t~mem87#1.offset, main_#t~mem88#1.base, main_#t~mem88#1.offset, main_#t~mem89#1.base, main_#t~mem89#1.offset, main_#t~mem90#1.base, main_#t~mem90#1.offset, main_#t~mem91#1, main_#t~mem92#1, main_#t~mem93#1, main_#t~mem94#1, main_#t~mem95#1, main_#t~mem96#1, main_#t~mem97#1, main_#t~mem98#1, main_~#__CS_cp___CS_thread_status~0#1.base, main_~#__CS_cp___CS_thread_status~0#1.offset, main_~#__CS_cp___CS_thread_lockedon~0#1.base, main_~#__CS_cp___CS_thread_lockedon~0#1.offset, main_~#__CS_cp_ma~0#1.base, main_~#__CS_cp_ma~0#1.offset, main_~#__CS_cp_mb~0#1.base, main_~#__CS_cp_mb~0#1.offset, main_~#__CS_cp_data1~0#1.base, main_~#__CS_cp_data1~0#1.offset, main_~#__CS_cp_data2~0#1.base, main_~#__CS_cp_data2~0#1.offset;call main_~#__CS_cp___CS_thread_status~0#1.base, main_~#__CS_cp___CS_thread_status~0#1.offset := #Ultimate.allocOnStack(6);call main_~#__CS_cp___CS_thread_lockedon~0#1.base, main_~#__CS_cp___CS_thread_lockedon~0#1.offset := #Ultimate.allocOnStack(24);call main_~#__CS_cp_ma~0#1.base, main_~#__CS_cp_ma~0#1.offset := #Ultimate.allocOnStack(2);call main_~#__CS_cp_mb~0#1.base, main_~#__CS_cp_mb~0#1.offset := #Ultimate.allocOnStack(2);call main_~#__CS_cp_data1~0#1.base, main_~#__CS_cp_data1~0#1.offset := #Ultimate.allocOnStack(8);call main_~#__CS_cp_data2~0#1.base, main_~#__CS_cp_data2~0#1.offset := #Ultimate.allocOnStack(8);main_~i~0#1 := 0;" [2025-02-06 20:02:45,257 INFO L754 eck$LassoCheckResult]: Loop: "assume main_~i~0#1 < 2;main_~j~2#1 := 0;" "assume main_~j~2#1 < 3;havoc main_#t~nondet46#1;call write~int#14(main_#t~nondet46#1, main_~#__CS_cp___CS_thread_status~0#1.base, main_~#__CS_cp___CS_thread_status~0#1.offset + 3 * main_~i~0#1 + main_~j~2#1, 1);havoc main_#t~nondet46#1;havoc main_#t~nondet47#1;call write~$Pointer$#11(0, (if main_#t~nondet47#1 % 4294967296 % 4294967296 <= 2147483647 then main_#t~nondet47#1 % 4294967296 % 4294967296 else main_#t~nondet47#1 % 4294967296 % 4294967296 - 4294967296), main_~#__CS_cp___CS_thread_lockedon~0#1.base, main_~#__CS_cp___CS_thread_lockedon~0#1.offset + 12 * main_~i~0#1 + 4 * main_~j~2#1, 4);havoc main_#t~nondet47#1;main_#t~pre48#1 := 1 + main_~j~2#1;main_~j~2#1 := 1 + main_~j~2#1;havoc main_#t~pre48#1;" "assume !(main_~j~2#1 < 3);havoc main_~j~2#1;havoc main_#t~nondet49#1;call write~int#13(main_#t~nondet49#1, main_~#__CS_cp_ma~0#1.base, main_~#__CS_cp_ma~0#1.offset + main_~i~0#1, 1);havoc main_#t~nondet49#1;havoc main_#t~nondet50#1;call write~int#2(main_#t~nondet50#1, main_~#__CS_cp_mb~0#1.base, main_~#__CS_cp_mb~0#1.offset + main_~i~0#1, 1);havoc main_#t~nondet50#1;havoc main_#t~nondet51#1;call write~int#15(main_#t~nondet51#1, main_~#__CS_cp_data1~0#1.base, main_~#__CS_cp_data1~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet51#1;havoc main_#t~nondet52#1;call write~int#8(main_#t~nondet52#1, main_~#__CS_cp_data2~0#1.base, main_~#__CS_cp_data2~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet52#1;main_#t~pre53#1 := 1 + main_~i~0#1;main_~i~0#1 := 1 + main_~i~0#1;havoc main_#t~pre53#1;" [2025-02-06 20:02:45,258 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 20:02:45,258 INFO L85 PathProgramCache]: Analyzing trace with hash 39328, now seen corresponding path program 2 times [2025-02-06 20:02:45,259 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 20:02:45,259 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1750612573] [2025-02-06 20:02:45,259 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-06 20:02:45,259 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 20:02:45,287 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 2 statements into 1 equivalence classes. [2025-02-06 20:02:45,303 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-02-06 20:02:45,303 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-02-06 20:02:45,303 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 20:02:45,304 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-06 20:02:45,309 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-02-06 20:02:45,323 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-02-06 20:02:45,323 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 20:02:45,323 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 20:02:45,337 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-06 20:02:45,337 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 20:02:45,338 INFO L85 PathProgramCache]: Analyzing trace with hash 1218379, now seen corresponding path program 1 times [2025-02-06 20:02:45,338 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 20:02:45,338 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1683546616] [2025-02-06 20:02:45,338 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 20:02:45,338 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 20:02:45,370 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-02-06 20:02:45,389 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-02-06 20:02:45,390 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 20:02:45,390 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 20:02:45,457 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 20:02:45,457 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 20:02:45,457 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1683546616] [2025-02-06 20:02:45,457 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1683546616] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 20:02:45,457 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [835912543] [2025-02-06 20:02:45,457 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 20:02:45,458 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 20:02:45,458 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 20:02:45,461 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 20:02:45,463 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-02-06 20:02:45,679 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-02-06 20:02:45,695 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-02-06 20:02:45,695 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 20:02:45,695 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 20:02:45,697 INFO L256 TraceCheckSpWp]: Trace formula consists of 107 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-02-06 20:02:45,698 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 20:02:45,719 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 20:02:45,719 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 20:02:45,738 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 20:02:45,738 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [835912543] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 20:02:45,738 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-06 20:02:45,738 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [2, 2, 2] total 3 [2025-02-06 20:02:45,738 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [866985707] [2025-02-06 20:02:45,739 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-06 20:02:45,739 INFO L769 eck$LassoCheckResult]: loop already infeasible [2025-02-06 20:02:45,739 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 20:02:45,739 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-06 20:02:45,739 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2025-02-06 20:02:45,740 INFO L87 Difference]: Start difference. First operand 5 states and 6 transitions. cyclomatic complexity: 2 Second operand has 5 states, 4 states have (on average 1.5) internal successors, (6), 4 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 20:02:45,769 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 20:02:45,769 INFO L93 Difference]: Finished difference Result 7 states and 8 transitions. [2025-02-06 20:02:45,769 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 7 states and 8 transitions. [2025-02-06 20:02:45,770 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2025-02-06 20:02:45,770 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 7 states to 7 states and 8 transitions. [2025-02-06 20:02:45,770 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 7 [2025-02-06 20:02:45,770 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 7 [2025-02-06 20:02:45,770 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 8 transitions. [2025-02-06 20:02:45,770 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2025-02-06 20:02:45,770 INFO L218 hiAutomatonCegarLoop]: Abstraction has 7 states and 8 transitions. [2025-02-06 20:02:45,770 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7 states and 8 transitions. [2025-02-06 20:02:45,771 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7 to 7. [2025-02-06 20:02:45,771 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 1.1428571428571428) internal successors, (8), 6 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) [2025-02-06 20:02:45,771 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 8 transitions. [2025-02-06 20:02:45,771 INFO L240 hiAutomatonCegarLoop]: Abstraction has 7 states and 8 transitions. [2025-02-06 20:02:45,773 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-06 20:02:45,773 INFO L432 stractBuchiCegarLoop]: Abstraction has 7 states and 8 transitions. [2025-02-06 20:02:45,773 INFO L338 stractBuchiCegarLoop]: ======== Iteration 3 ============ [2025-02-06 20:02:45,773 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 7 states and 8 transitions. [2025-02-06 20:02:45,774 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2025-02-06 20:02:45,774 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-02-06 20:02:45,774 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-02-06 20:02:45,774 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2025-02-06 20:02:45,774 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [3, 1, 1] [2025-02-06 20:02:45,774 INFO L752 eck$LassoCheckResult]: Stem: "assume { :begin_inline_ULTIMATE.init } true;havoc ULTIMATE.init_#t~nondet99#1, ULTIMATE.init_#t~nondet100#1, ULTIMATE.init_#t~nondet101#1, ULTIMATE.init_#t~nondet102#1, ULTIMATE.init_#t~nondet103#1, ULTIMATE.init_#t~nondet104#1;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int#0(48, 1, 0, 1);call write~init~int#0(0, 1, 1, 1);call #Ultimate.allocInit(16, 2);~__CS_round~0 := 0;~__CS_ret~0 := 0;~__CS_ret_PREEMPTED~0 := 1;~__CS_ret_ERROR~0 := 2;~__CS_ret_FINISHED~0 := 4;~__CS_error~0 := 0;~__CS_thread_index~0 := 0;call #Ultimate.allocInit(3, 3);~#__CS_thread_allocated~0.base, ~#__CS_thread_allocated~0.offset := 3, 0;call write~init~int#1(0, ~#__CS_thread_allocated~0.base, ~#__CS_thread_allocated~0.offset, 1);call write~init~int#1(0, ~#__CS_thread_allocated~0.base, 1 + ~#__CS_thread_allocated~0.offset, 1);call write~init~int#1(0, ~#__CS_thread_allocated~0.base, 2 + ~#__CS_thread_allocated~0.offset, 1);call #Ultimate.allocInit(3, 4);~#__CS_thread_born_round~0.base, ~#__CS_thread_born_round~0.offset := 4, 0;call write~init~int#3(0, ~#__CS_thread_born_round~0.base, ~#__CS_thread_born_round~0.offset, 1);call write~init~int#3(0, ~#__CS_thread_born_round~0.base, 1 + ~#__CS_thread_born_round~0.offset, 1);call write~init~int#3(0, ~#__CS_thread_born_round~0.base, 2 + ~#__CS_thread_born_round~0.offset, 1);call #Ultimate.allocInit(12, 5);~#__CS_thread~0.base, ~#__CS_thread~0.offset := 5, 0;call write~init~$Pointer$#4(0, 0, ~#__CS_thread~0.base, ~#__CS_thread~0.offset, 4);call write~init~$Pointer$#4(0, 0, ~#__CS_thread~0.base, 4 + ~#__CS_thread~0.offset, 4);call write~init~$Pointer$#4(0, 0, ~#__CS_thread~0.base, 8 + ~#__CS_thread~0.offset, 4);call #Ultimate.allocInit(6, 6);~#__CS_thread_status~0.base, ~#__CS_thread_status~0.offset := 6, 0;call write~init~int#5(0, ~#__CS_thread_status~0.base, ~#__CS_thread_status~0.offset, 1);call write~init~int#5(0, ~#__CS_thread_status~0.base, 1 + ~#__CS_thread_status~0.offset, 1);call write~init~int#5(0, ~#__CS_thread_status~0.base, 2 + ~#__CS_thread_status~0.offset, 1);call write~init~int#5(0, ~#__CS_thread_status~0.base, 3 + ~#__CS_thread_status~0.offset, 1);call write~init~int#5(0, ~#__CS_thread_status~0.base, 4 + ~#__CS_thread_status~0.offset, 1);call write~init~int#5(0, ~#__CS_thread_status~0.base, 5 + ~#__CS_thread_status~0.offset, 1);~__THREAD_UNUSED~0 := 0;~__THREAD_RUNNING~0 := 1;~__THREAD_FINISHED~0 := 2;call #Ultimate.allocInit(24, 7);~#__CS_thread_lockedon~0.base, ~#__CS_thread_lockedon~0.offset := 7, 0;call write~init~$Pointer$#6(0, 0, ~#__CS_thread_lockedon~0.base, ~#__CS_thread_lockedon~0.offset, 4);call write~init~$Pointer$#6(0, 0, ~#__CS_thread_lockedon~0.base, 4 + ~#__CS_thread_lockedon~0.offset, 4);call write~init~$Pointer$#6(0, 0, ~#__CS_thread_lockedon~0.base, 8 + ~#__CS_thread_lockedon~0.offset, 4);call write~init~$Pointer$#6(0, 0, ~#__CS_thread_lockedon~0.base, 12 + ~#__CS_thread_lockedon~0.offset, 4);call write~init~$Pointer$#6(0, 0, ~#__CS_thread_lockedon~0.base, 16 + ~#__CS_thread_lockedon~0.offset, 4);call write~init~$Pointer$#6(0, 0, ~#__CS_thread_lockedon~0.base, 20 + ~#__CS_thread_lockedon~0.offset, 4);call #Ultimate.allocInit(2, 8);~#ma~0.base, ~#ma~0.offset := 8, 0;call write~init~int#7(0, ~#ma~0.base, ~#ma~0.offset, 1);call write~init~int#7(0, ~#ma~0.base, 1 + ~#ma~0.offset, 1);call #Ultimate.allocInit(2, 9);~#mb~0.base, ~#mb~0.offset := 9, 0;call write~init~int#7(0, ~#mb~0.base, ~#mb~0.offset, 1);call write~init~int#7(0, ~#mb~0.base, 1 + ~#mb~0.offset, 1);call #Ultimate.allocInit(8, 10);~#data1~0.base, ~#data1~0.offset := 10, 0;call write~init~int#9(0, ~#data1~0.base, ~#data1~0.offset, 4);call write~init~int#9(0, ~#data1~0.base, 4 + ~#data1~0.offset, 4);call #Ultimate.allocInit(8, 11);~#data2~0.base, ~#data2~0.offset := 11, 0;call write~init~int#10(0, ~#data2~0.base, ~#data2~0.offset, 4);call write~init~int#10(0, ~#data2~0.base, 4 + ~#data2~0.offset, 4);~__CS_u~0.ma := ~__CS_u~0.ma[0 := 0];~__CS_u~0.ma := ~__CS_u~0.ma[1 := 0];~__CS_u~0.mb := ~__CS_u~0.mb[0 := ULTIMATE.init_#t~nondet99#1];~__CS_u~0.mb := ~__CS_u~0.mb[1 := ULTIMATE.init_#t~nondet100#1];~__CS_u~0.data1 := ~__CS_u~0.data1[0 := ULTIMATE.init_#t~nondet101#1];~__CS_u~0.data1 := ~__CS_u~0.data1[1 := ULTIMATE.init_#t~nondet102#1];~__CS_u~0.data2 := ~__CS_u~0.data2[0 := ULTIMATE.init_#t~nondet103#1];~__CS_u~0.data2 := ~__CS_u~0.data2[1 := ULTIMATE.init_#t~nondet104#1];havoc ULTIMATE.init_#t~nondet99#1;havoc ULTIMATE.init_#t~nondet100#1;havoc ULTIMATE.init_#t~nondet101#1;havoc ULTIMATE.init_#t~nondet102#1;havoc ULTIMATE.init_#t~nondet103#1;havoc ULTIMATE.init_#t~nondet104#1;" "havoc ULTIMATE.init_#t~nondet99#1, ULTIMATE.init_#t~nondet100#1, ULTIMATE.init_#t~nondet101#1, ULTIMATE.init_#t~nondet102#1, ULTIMATE.init_#t~nondet103#1, ULTIMATE.init_#t~nondet104#1;assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet46#1, main_#t~nondet47#1, main_#t~pre48#1, main_~j~2#1, main_#t~nondet49#1, main_#t~nondet50#1, main_#t~nondet51#1, main_#t~nondet52#1, main_#t~pre53#1, main_~i~0#1, main_#t~mem54#1, main_#t~mem55#1, main_#t~mem56#1, main_#t~mem57#1.base, main_#t~mem57#1.offset, main_#t~mem58#1.base, main_#t~mem58#1.offset, main_#t~mem59#1.base, main_#t~mem59#1.offset, main_#t~mem60#1, main_#t~mem61#1, main_#t~mem62#1, main_#t~mem63#1, main_#t~mem64#1, main_#t~mem65#1, main_#t~mem67#1.base, main_#t~mem67#1.offset, main_#t~ret68#1.base, main_#t~ret68#1.offset, main_#t~mem69#1, main_#t~mem70#1, main_#t~mem72#1.base, main_#t~mem72#1.offset, main_#t~ret73#1.base, main_#t~ret73#1.offset, main_#t~mem74#1, main_#t~mem75#1, main_#t~mem77#1.base, main_#t~mem77#1.offset, main_#t~ret78#1.base, main_#t~ret78#1.offset, main_#t~mem79#1, main_#t~mem80#1, main_#t~mem81#1, main_#t~mem82#1, main_#t~mem83#1, main_#t~mem84#1, main_#t~mem85#1.base, main_#t~mem85#1.offset, main_#t~mem86#1.base, main_#t~mem86#1.offset, main_#t~mem87#1.base, main_#t~mem87#1.offset, main_#t~mem88#1.base, main_#t~mem88#1.offset, main_#t~mem89#1.base, main_#t~mem89#1.offset, main_#t~mem90#1.base, main_#t~mem90#1.offset, main_#t~mem91#1, main_#t~mem92#1, main_#t~mem93#1, main_#t~mem94#1, main_#t~mem95#1, main_#t~mem96#1, main_#t~mem97#1, main_#t~mem98#1, main_~#__CS_cp___CS_thread_status~0#1.base, main_~#__CS_cp___CS_thread_status~0#1.offset, main_~#__CS_cp___CS_thread_lockedon~0#1.base, main_~#__CS_cp___CS_thread_lockedon~0#1.offset, main_~#__CS_cp_ma~0#1.base, main_~#__CS_cp_ma~0#1.offset, main_~#__CS_cp_mb~0#1.base, main_~#__CS_cp_mb~0#1.offset, main_~#__CS_cp_data1~0#1.base, main_~#__CS_cp_data1~0#1.offset, main_~#__CS_cp_data2~0#1.base, main_~#__CS_cp_data2~0#1.offset;call main_~#__CS_cp___CS_thread_status~0#1.base, main_~#__CS_cp___CS_thread_status~0#1.offset := #Ultimate.allocOnStack(6);call main_~#__CS_cp___CS_thread_lockedon~0#1.base, main_~#__CS_cp___CS_thread_lockedon~0#1.offset := #Ultimate.allocOnStack(24);call main_~#__CS_cp_ma~0#1.base, main_~#__CS_cp_ma~0#1.offset := #Ultimate.allocOnStack(2);call main_~#__CS_cp_mb~0#1.base, main_~#__CS_cp_mb~0#1.offset := #Ultimate.allocOnStack(2);call main_~#__CS_cp_data1~0#1.base, main_~#__CS_cp_data1~0#1.offset := #Ultimate.allocOnStack(8);call main_~#__CS_cp_data2~0#1.base, main_~#__CS_cp_data2~0#1.offset := #Ultimate.allocOnStack(8);main_~i~0#1 := 0;" [2025-02-06 20:02:45,774 INFO L754 eck$LassoCheckResult]: Loop: "assume main_~i~0#1 < 2;main_~j~2#1 := 0;" "assume main_~j~2#1 < 3;havoc main_#t~nondet46#1;call write~int#14(main_#t~nondet46#1, main_~#__CS_cp___CS_thread_status~0#1.base, main_~#__CS_cp___CS_thread_status~0#1.offset + 3 * main_~i~0#1 + main_~j~2#1, 1);havoc main_#t~nondet46#1;havoc main_#t~nondet47#1;call write~$Pointer$#11(0, (if main_#t~nondet47#1 % 4294967296 % 4294967296 <= 2147483647 then main_#t~nondet47#1 % 4294967296 % 4294967296 else main_#t~nondet47#1 % 4294967296 % 4294967296 - 4294967296), main_~#__CS_cp___CS_thread_lockedon~0#1.base, main_~#__CS_cp___CS_thread_lockedon~0#1.offset + 12 * main_~i~0#1 + 4 * main_~j~2#1, 4);havoc main_#t~nondet47#1;main_#t~pre48#1 := 1 + main_~j~2#1;main_~j~2#1 := 1 + main_~j~2#1;havoc main_#t~pre48#1;" "assume main_~j~2#1 < 3;havoc main_#t~nondet46#1;call write~int#14(main_#t~nondet46#1, main_~#__CS_cp___CS_thread_status~0#1.base, main_~#__CS_cp___CS_thread_status~0#1.offset + 3 * main_~i~0#1 + main_~j~2#1, 1);havoc main_#t~nondet46#1;havoc main_#t~nondet47#1;call write~$Pointer$#11(0, (if main_#t~nondet47#1 % 4294967296 % 4294967296 <= 2147483647 then main_#t~nondet47#1 % 4294967296 % 4294967296 else main_#t~nondet47#1 % 4294967296 % 4294967296 - 4294967296), main_~#__CS_cp___CS_thread_lockedon~0#1.base, main_~#__CS_cp___CS_thread_lockedon~0#1.offset + 12 * main_~i~0#1 + 4 * main_~j~2#1, 4);havoc main_#t~nondet47#1;main_#t~pre48#1 := 1 + main_~j~2#1;main_~j~2#1 := 1 + main_~j~2#1;havoc main_#t~pre48#1;" "assume main_~j~2#1 < 3;havoc main_#t~nondet46#1;call write~int#14(main_#t~nondet46#1, main_~#__CS_cp___CS_thread_status~0#1.base, main_~#__CS_cp___CS_thread_status~0#1.offset + 3 * main_~i~0#1 + main_~j~2#1, 1);havoc main_#t~nondet46#1;havoc main_#t~nondet47#1;call write~$Pointer$#11(0, (if main_#t~nondet47#1 % 4294967296 % 4294967296 <= 2147483647 then main_#t~nondet47#1 % 4294967296 % 4294967296 else main_#t~nondet47#1 % 4294967296 % 4294967296 - 4294967296), main_~#__CS_cp___CS_thread_lockedon~0#1.base, main_~#__CS_cp___CS_thread_lockedon~0#1.offset + 12 * main_~i~0#1 + 4 * main_~j~2#1, 4);havoc main_#t~nondet47#1;main_#t~pre48#1 := 1 + main_~j~2#1;main_~j~2#1 := 1 + main_~j~2#1;havoc main_#t~pre48#1;" "assume !(main_~j~2#1 < 3);havoc main_~j~2#1;havoc main_#t~nondet49#1;call write~int#13(main_#t~nondet49#1, main_~#__CS_cp_ma~0#1.base, main_~#__CS_cp_ma~0#1.offset + main_~i~0#1, 1);havoc main_#t~nondet49#1;havoc main_#t~nondet50#1;call write~int#2(main_#t~nondet50#1, main_~#__CS_cp_mb~0#1.base, main_~#__CS_cp_mb~0#1.offset + main_~i~0#1, 1);havoc main_#t~nondet50#1;havoc main_#t~nondet51#1;call write~int#15(main_#t~nondet51#1, main_~#__CS_cp_data1~0#1.base, main_~#__CS_cp_data1~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet51#1;havoc main_#t~nondet52#1;call write~int#8(main_#t~nondet52#1, main_~#__CS_cp_data2~0#1.base, main_~#__CS_cp_data2~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet52#1;main_#t~pre53#1 := 1 + main_~i~0#1;main_~i~0#1 := 1 + main_~i~0#1;havoc main_#t~pre53#1;" [2025-02-06 20:02:45,775 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 20:02:45,775 INFO L85 PathProgramCache]: Analyzing trace with hash 39328, now seen corresponding path program 3 times [2025-02-06 20:02:45,775 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 20:02:45,775 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1228244861] [2025-02-06 20:02:45,775 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-02-06 20:02:45,775 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 20:02:45,789 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 2 statements into 1 equivalence classes. [2025-02-06 20:02:45,815 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-02-06 20:02:45,815 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-02-06 20:02:45,817 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 20:02:45,817 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-06 20:02:45,821 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-02-06 20:02:45,834 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-02-06 20:02:45,835 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 20:02:45,835 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 20:02:45,851 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-06 20:02:45,852 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 20:02:45,852 INFO L85 PathProgramCache]: Analyzing trace with hash 1170901451, now seen corresponding path program 2 times [2025-02-06 20:02:45,852 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 20:02:45,852 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [567606738] [2025-02-06 20:02:45,852 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-06 20:02:45,852 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 20:02:45,873 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 5 statements into 2 equivalence classes. [2025-02-06 20:02:45,907 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 5 of 5 statements. [2025-02-06 20:02:45,907 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-06 20:02:45,907 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 20:02:45,908 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-06 20:02:45,914 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-02-06 20:02:45,943 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-02-06 20:02:45,943 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 20:02:45,943 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 20:02:45,956 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-06 20:02:45,958 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 20:02:45,958 INFO L85 PathProgramCache]: Analyzing trace with hash 1788091276, now seen corresponding path program 1 times [2025-02-06 20:02:45,958 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 20:02:45,959 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [608619256] [2025-02-06 20:02:45,959 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 20:02:45,959 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 20:02:45,990 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-02-06 20:02:46,068 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-02-06 20:02:46,068 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 20:02:46,069 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 20:02:46,069 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-06 20:02:46,078 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-02-06 20:02:46,130 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-02-06 20:02:46,130 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 20:02:46,131 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 20:02:46,151 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-06 20:04:23,343 WARN L286 SmtUtils]: Spent 1.62m on a formula simplification. DAG size of input: 326 DAG size of output: 311 (called from [L 276] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.TransFormulaUtils.sequentialComposition)