./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/termination.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-pthread/cs_stateful-1.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 84cfde4a Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/AutomizerTermination.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-pthread/cs_stateful-1.i -s /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-clean/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.2.5-dev-84cfde4 [2024-10-12 01:13:41,042 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-12 01:13:41,115 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-32bit-Automizer_Default.epf [2024-10-12 01:13:41,123 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-12 01:13:41,125 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-12 01:13:41,151 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-12 01:13:41,152 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-12 01:13:41,152 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-12 01:13:41,153 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-12 01:13:41,155 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-12 01:13:41,156 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-12 01:13:41,156 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-12 01:13:41,157 INFO L153 SettingsManager]: * Use SBE=true [2024-10-12 01:13:41,157 INFO L151 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2024-10-12 01:13:41,159 INFO L153 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2024-10-12 01:13:41,159 INFO L153 SettingsManager]: * Use old map elimination=false [2024-10-12 01:13:41,159 INFO L153 SettingsManager]: * Use external solver (rank synthesis)=false [2024-10-12 01:13:41,160 INFO L153 SettingsManager]: * Use only trivial implications for array writes=true [2024-10-12 01:13:41,160 INFO L153 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2024-10-12 01:13:41,160 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-12 01:13:41,160 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2024-10-12 01:13:41,161 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-12 01:13:41,161 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-12 01:13:41,162 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-12 01:13:41,163 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-12 01:13:41,164 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2024-10-12 01:13:41,164 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2024-10-12 01:13:41,164 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2024-10-12 01:13:41,165 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-12 01:13:41,165 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-10-12 01:13:41,165 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-12 01:13:41,166 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-12 01:13:41,166 INFO L153 SettingsManager]: * Assume nondeterminstic values are in range=false [2024-10-12 01:13:41,166 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-12 01:13:41,167 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-12 01:13:41,167 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-12 01:13:41,167 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-12 01:13:41,167 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-12 01:13:41,168 INFO L151 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2024-10-12 01:13:41,168 INFO L153 SettingsManager]: * TransformationType=MODULO_NEIGHBOR WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate-clean/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 [2024-10-12 01:13:41,417 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-12 01:13:41,435 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-12 01:13:41,438 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-12 01:13:41,439 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-12 01:13:41,439 INFO L274 PluginConnector]: CDTParser initialized [2024-10-12 01:13:41,440 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-pthread/cs_stateful-1.i [2024-10-12 01:13:42,772 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-12 01:13:43,027 INFO L384 CDTParser]: Found 1 translation units. [2024-10-12 01:13:43,028 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-pthread/cs_stateful-1.i [2024-10-12 01:13:43,050 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/c9a15003f/e849d281ad0f44de9a57ede16a25670a/FLAG6cda11997 [2024-10-12 01:13:43,065 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/c9a15003f/e849d281ad0f44de9a57ede16a25670a [2024-10-12 01:13:43,067 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-12 01:13:43,068 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-12 01:13:43,069 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-12 01:13:43,069 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-12 01:13:43,073 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-12 01:13:43,073 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.10 01:13:43" (1/1) ... [2024-10-12 01:13:43,074 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@e00d5ed and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 01:13:43, skipping insertion in model container [2024-10-12 01:13:43,074 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.10 01:13:43" (1/1) ... [2024-10-12 01:13:43,133 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-12 01:13:43,549 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-12 01:13:43,564 INFO L200 MainTranslator]: Completed pre-run [2024-10-12 01:13:43,654 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-12 01:13:43,699 INFO L204 MainTranslator]: Completed translation [2024-10-12 01:13:43,700 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 01:13:43 WrapperNode [2024-10-12 01:13:43,700 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-12 01:13:43,701 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-12 01:13:43,701 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-12 01:13:43,702 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-12 01:13:43,708 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 01:13:43" (1/1) ... [2024-10-12 01:13:43,734 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 01:13:43" (1/1) ... [2024-10-12 01:13:43,862 INFO L138 Inliner]: procedures = 144, calls = 232, calls flagged for inlining = 52, calls inlined = 142, statements flattened = 2462 [2024-10-12 01:13:43,863 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-12 01:13:43,864 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-12 01:13:43,864 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-12 01:13:43,864 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-12 01:13:43,875 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 01:13:43" (1/1) ... [2024-10-12 01:13:43,875 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 01:13:43" (1/1) ... [2024-10-12 01:13:43,912 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 01:13:43" (1/1) ... [2024-10-12 01:13:43,986 INFO L175 MemorySlicer]: Split 224 memory accesses to 15 slices as follows [2, 13, 13, 3, 40, 12, 56, 22, 3, 22, 7, 3, 7, 18, 3]. 25 percent of accesses are in the largest equivalence class. The 28 initializations are split as follows [2, 3, 3, 0, 6, 6, 4, 2, 0, 2, 0, 0, 0, 0, 0]. The 94 writes are split as follows [0, 7, 7, 1, 13, 3, 26, 10, 1, 10, 1, 1, 1, 12, 1]. [2024-10-12 01:13:43,986 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 01:13:43" (1/1) ... [2024-10-12 01:13:43,987 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 01:13:43" (1/1) ... [2024-10-12 01:13:44,040 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 01:13:43" (1/1) ... [2024-10-12 01:13:44,063 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 01:13:43" (1/1) ... [2024-10-12 01:13:44,082 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 01:13:43" (1/1) ... [2024-10-12 01:13:44,097 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 01:13:43" (1/1) ... [2024-10-12 01:13:44,122 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-12 01:13:44,124 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-12 01:13:44,124 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-12 01:13:44,124 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-12 01:13:44,125 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 01:13:43" (1/1) ... [2024-10-12 01:13:44,130 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 01:13:44,142 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 01:13:44,161 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-12 01:13:44,165 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Waiting until timeout for monitored process [2024-10-12 01:13:44,292 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-10-12 01:13:44,296 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-10-12 01:13:44,296 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2024-10-12 01:13:44,296 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2024-10-12 01:13:44,296 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#4 [2024-10-12 01:13:44,297 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#5 [2024-10-12 01:13:44,297 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#6 [2024-10-12 01:13:44,297 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#7 [2024-10-12 01:13:44,297 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#8 [2024-10-12 01:13:44,297 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#9 [2024-10-12 01:13:44,297 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#10 [2024-10-12 01:13:44,297 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#11 [2024-10-12 01:13:44,298 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#12 [2024-10-12 01:13:44,298 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#13 [2024-10-12 01:13:44,298 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#14 [2024-10-12 01:13:44,298 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-10-12 01:13:44,298 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-10-12 01:13:44,298 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2024-10-12 01:13:44,298 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2024-10-12 01:13:44,298 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#4 [2024-10-12 01:13:44,298 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#5 [2024-10-12 01:13:44,298 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#6 [2024-10-12 01:13:44,298 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#7 [2024-10-12 01:13:44,298 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#8 [2024-10-12 01:13:44,299 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#9 [2024-10-12 01:13:44,299 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#10 [2024-10-12 01:13:44,299 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#11 [2024-10-12 01:13:44,299 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#12 [2024-10-12 01:13:44,299 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#13 [2024-10-12 01:13:44,299 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#14 [2024-10-12 01:13:44,299 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-12 01:13:44,299 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-10-12 01:13:44,299 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2024-10-12 01:13:44,299 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2024-10-12 01:13:44,299 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2024-10-12 01:13:44,300 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#3 [2024-10-12 01:13:44,300 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#4 [2024-10-12 01:13:44,300 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#5 [2024-10-12 01:13:44,300 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#6 [2024-10-12 01:13:44,300 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#7 [2024-10-12 01:13:44,300 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#8 [2024-10-12 01:13:44,304 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#9 [2024-10-12 01:13:44,304 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#10 [2024-10-12 01:13:44,304 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#11 [2024-10-12 01:13:44,305 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#12 [2024-10-12 01:13:44,305 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#13 [2024-10-12 01:13:44,305 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#14 [2024-10-12 01:13:44,305 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2024-10-12 01:13:44,305 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2024-10-12 01:13:44,305 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2024-10-12 01:13:44,305 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#3 [2024-10-12 01:13:44,305 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#4 [2024-10-12 01:13:44,305 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#5 [2024-10-12 01:13:44,305 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#6 [2024-10-12 01:13:44,306 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#7 [2024-10-12 01:13:44,306 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#8 [2024-10-12 01:13:44,306 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#9 [2024-10-12 01:13:44,306 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#10 [2024-10-12 01:13:44,306 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#11 [2024-10-12 01:13:44,306 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#12 [2024-10-12 01:13:44,306 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#13 [2024-10-12 01:13:44,306 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#14 [2024-10-12 01:13:44,306 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-10-12 01:13:44,307 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#0 [2024-10-12 01:13:44,307 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#1 [2024-10-12 01:13:44,307 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#2 [2024-10-12 01:13:44,307 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#3 [2024-10-12 01:13:44,307 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#4 [2024-10-12 01:13:44,307 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#5 [2024-10-12 01:13:44,307 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#6 [2024-10-12 01:13:44,307 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#7 [2024-10-12 01:13:44,307 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#8 [2024-10-12 01:13:44,308 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#9 [2024-10-12 01:13:44,314 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#10 [2024-10-12 01:13:44,314 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#11 [2024-10-12 01:13:44,314 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#12 [2024-10-12 01:13:44,315 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#13 [2024-10-12 01:13:44,315 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#14 [2024-10-12 01:13:44,315 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-12 01:13:44,315 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-10-12 01:13:44,315 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-10-12 01:13:44,315 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2024-10-12 01:13:44,315 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2024-10-12 01:13:44,315 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#5 [2024-10-12 01:13:44,316 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#6 [2024-10-12 01:13:44,316 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#7 [2024-10-12 01:13:44,316 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#8 [2024-10-12 01:13:44,316 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#9 [2024-10-12 01:13:44,316 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#10 [2024-10-12 01:13:44,316 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#11 [2024-10-12 01:13:44,316 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#12 [2024-10-12 01:13:44,316 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#13 [2024-10-12 01:13:44,316 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#14 [2024-10-12 01:13:44,316 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-12 01:13:44,317 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-12 01:13:44,592 INFO L238 CfgBuilder]: Building ICFG [2024-10-12 01:13:44,594 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-12 01:13:44,608 WARN L779 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2024-10-12 01:13:44,608 WARN L779 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2024-10-12 01:13:44,627 WARN L779 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2024-10-12 01:13:44,628 WARN L779 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2024-10-12 01:13:44,646 WARN L779 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2024-10-12 01:13:44,647 WARN L779 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2024-10-12 01:13:47,897 INFO L733 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##305: 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);~__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; [2024-10-12 01:13:47,898 INFO L733 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##304: 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; [2024-10-12 01:13:47,898 INFO L733 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##309: 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);~__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; [2024-10-12 01:13:47,898 INFO L733 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##308: 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; [2024-10-12 01:13:47,899 INFO L733 $ProcedureCfgBuilder]: dead code at ProgramPoint L558-10: havoc __CS_cs_#t~nondet3#1, __CS_cs_#t~nondet4#1, __CS_cs_~k~0#1;assume { :end_inline___CS_cs } true; [2024-10-12 01:13:47,899 INFO L733 $ProcedureCfgBuilder]: dead code at ProgramPoint L558-11: havoc __CS_cs_#t~nondet3#1, __CS_cs_#t~nondet4#1, __CS_cs_~k~0#1;assume { :end_inline___CS_cs } true; [2024-10-12 01:13:47,899 INFO L733 $ProcedureCfgBuilder]: dead code at ProgramPoint L558-12: havoc __CS_cs_#t~nondet3#1, __CS_cs_#t~nondet4#1, __CS_cs_~k~0#1;assume { :end_inline___CS_cs } true; [2024-10-12 01:13:47,899 INFO L733 $ProcedureCfgBuilder]: dead code at ProgramPoint L558-38: havoc __CS_cs_#t~nondet3#1, __CS_cs_#t~nondet4#1, __CS_cs_~k~0#1;assume { :end_inline___CS_cs } true; [2024-10-12 01:13:47,899 INFO L733 $ProcedureCfgBuilder]: dead code at ProgramPoint L558-39: havoc __CS_cs_#t~nondet3#1, __CS_cs_#t~nondet4#1, __CS_cs_~k~0#1;assume { :end_inline___CS_cs } true; [2024-10-12 01:13:47,899 INFO L733 $ProcedureCfgBuilder]: dead code at ProgramPoint L558-40: havoc __CS_cs_#t~nondet3#1, __CS_cs_#t~nondet4#1, __CS_cs_~k~0#1;assume { :end_inline___CS_cs } true; [2024-10-12 01:13:47,899 INFO L733 $ProcedureCfgBuilder]: dead code at ProgramPoint L558-66: havoc __CS_cs_#t~nondet3#1, __CS_cs_#t~nondet4#1, __CS_cs_~k~0#1;assume { :end_inline___CS_cs } true; [2024-10-12 01:13:47,900 INFO L733 $ProcedureCfgBuilder]: dead code at ProgramPoint L558-67: havoc __CS_cs_#t~nondet3#1, __CS_cs_#t~nondet4#1, __CS_cs_~k~0#1;assume { :end_inline___CS_cs } true; [2024-10-12 01:13:47,900 INFO L733 $ProcedureCfgBuilder]: dead code at ProgramPoint L558-68: havoc __CS_cs_#t~nondet3#1, __CS_cs_#t~nondet4#1, __CS_cs_~k~0#1;assume { :end_inline___CS_cs } true; [2024-10-12 01:13:47,900 INFO L733 $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; [2024-10-12 01:13:47,900 INFO L733 $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); [2024-10-12 01:13:47,900 INFO L733 $ProcedureCfgBuilder]: dead code at ProgramPoint L561-32: ~__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; [2024-10-12 01:13:47,901 INFO L733 $ProcedureCfgBuilder]: dead code at ProgramPoint L561-108: 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; [2024-10-12 01:13:47,901 INFO L733 $ProcedureCfgBuilder]: dead code at ProgramPoint L561-108: 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); [2024-10-12 01:13:47,901 INFO L733 $ProcedureCfgBuilder]: dead code at ProgramPoint L561-110: ~__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; [2024-10-12 01:13:47,901 INFO L733 $ProcedureCfgBuilder]: dead code at ProgramPoint L561-186: 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; [2024-10-12 01:13:47,901 INFO L733 $ProcedureCfgBuilder]: dead code at ProgramPoint L561-186: 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); [2024-10-12 01:13:47,901 INFO L733 $ProcedureCfgBuilder]: dead code at ProgramPoint L561-188: ~__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; [2024-10-12 01:13:47,902 INFO L733 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##508: 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; [2024-10-12 01:13:47,902 INFO L733 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##509: 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);~__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; [2024-10-12 01:13:47,902 INFO L733 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##513: 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);~__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; [2024-10-12 01:13:47,902 INFO L733 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##512: 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; [2024-10-12 01:13:47,902 INFO L733 $ProcedureCfgBuilder]: dead code at ProgramPoint L742: 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; [2024-10-12 01:13:47,903 INFO L733 $ProcedureCfgBuilder]: dead code at ProgramPoint L742: assume !(0 != (if ~__CS_ret~0 % 256 % 4294967296 <= 2147483647 then ~__CS_ret~0 % 256 % 4294967296 else ~__CS_ret~0 % 256 % 4294967296 - 4294967296)); [2024-10-12 01:13:47,903 INFO L733 $ProcedureCfgBuilder]: dead code at ProgramPoint L742-2: 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; [2024-10-12 01:13:47,903 INFO L733 $ProcedureCfgBuilder]: dead code at ProgramPoint L742-2: assume !(0 != (if ~__CS_ret~0 % 256 % 4294967296 <= 2147483647 then ~__CS_ret~0 % 256 % 4294967296 else ~__CS_ret~0 % 256 % 4294967296 - 4294967296)); [2024-10-12 01:13:47,903 INFO L733 $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; [2024-10-12 01:13:47,903 INFO L733 $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)); [2024-10-12 01:13:47,903 INFO L733 $ProcedureCfgBuilder]: dead code at ProgramPoint L744: 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; [2024-10-12 01:13:47,904 INFO L733 $ProcedureCfgBuilder]: dead code at ProgramPoint L744: 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; [2024-10-12 01:13:47,904 INFO L733 $ProcedureCfgBuilder]: dead code at ProgramPoint L744-2: 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; [2024-10-12 01:13:47,904 INFO L733 $ProcedureCfgBuilder]: dead code at ProgramPoint L744-2: 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; [2024-10-12 01:13:47,904 INFO L733 $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; [2024-10-12 01:13:47,904 INFO L733 $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; [2024-10-12 01:13:47,904 INFO L733 $ProcedureCfgBuilder]: dead code at ProgramPoint L746: 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; [2024-10-12 01:13:47,904 INFO L733 $ProcedureCfgBuilder]: dead code at ProgramPoint L746: assume !(0 != (if ~__CS_ret~0 % 256 % 4294967296 <= 2147483647 then ~__CS_ret~0 % 256 % 4294967296 else ~__CS_ret~0 % 256 % 4294967296 - 4294967296)); [2024-10-12 01:13:47,905 INFO L733 $ProcedureCfgBuilder]: dead code at ProgramPoint L746-2: 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; [2024-10-12 01:13:47,905 INFO L733 $ProcedureCfgBuilder]: dead code at ProgramPoint L746-2: assume !(0 != (if ~__CS_ret~0 % 256 % 4294967296 <= 2147483647 then ~__CS_ret~0 % 256 % 4294967296 else ~__CS_ret~0 % 256 % 4294967296 - 4294967296)); [2024-10-12 01:13:47,905 INFO L733 $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; [2024-10-12 01:13:47,905 INFO L733 $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)); [2024-10-12 01:13:47,905 INFO L733 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##100: 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; [2024-10-12 01:13:47,905 INFO L733 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##104: 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; [2024-10-12 01:13:47,905 INFO L733 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##101: 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);~__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; [2024-10-12 01:13:47,906 INFO L733 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##105: 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);~__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; [2024-10-12 01:13:48,094 INFO L? ?]: Removed 616 outVars from TransFormulas that were not future-live. [2024-10-12 01:13:48,095 INFO L287 CfgBuilder]: Performing block encoding [2024-10-12 01:13:48,128 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-12 01:13:48,129 INFO L314 CfgBuilder]: Removed 6 assume(true) statements. [2024-10-12 01:13:48,129 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.10 01:13:48 BoogieIcfgContainer [2024-10-12 01:13:48,129 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-12 01:13:48,130 INFO L112 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2024-10-12 01:13:48,130 INFO L270 PluginConnector]: Initializing BuchiAutomizer... [2024-10-12 01:13:48,134 INFO L274 PluginConnector]: BuchiAutomizer initialized [2024-10-12 01:13:48,135 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2024-10-12 01:13:48,135 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 12.10 01:13:43" (1/3) ... [2024-10-12 01:13:48,139 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@19dbaf68 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 12.10 01:13:48, skipping insertion in model container [2024-10-12 01:13:48,139 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2024-10-12 01:13:48,139 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 01:13:43" (2/3) ... [2024-10-12 01:13:48,139 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@19dbaf68 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 12.10 01:13:48, skipping insertion in model container [2024-10-12 01:13:48,141 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2024-10-12 01:13:48,141 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.10 01:13:48" (3/3) ... [2024-10-12 01:13:48,143 INFO L332 chiAutomizerObserver]: Analyzing ICFG cs_stateful-1.i [2024-10-12 01:13:48,206 INFO L300 stractBuchiCegarLoop]: Interprodecural is true [2024-10-12 01:13:48,206 INFO L301 stractBuchiCegarLoop]: Hoare is None [2024-10-12 01:13:48,207 INFO L302 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2024-10-12 01:13:48,207 INFO L303 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2024-10-12 01:13:48,207 INFO L304 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2024-10-12 01:13:48,207 INFO L305 stractBuchiCegarLoop]: Difference is false [2024-10-12 01:13:48,207 INFO L306 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2024-10-12 01:13:48,208 INFO L310 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiAutomatonCegarLoop ======== [2024-10-12 01:13:48,215 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 498 states, 497 states have (on average 1.4909456740442657) internal successors, (741), 497 states have internal predecessors, (741), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 01:13:48,264 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2024-10-12 01:13:48,264 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-10-12 01:13:48,265 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-10-12 01:13:48,275 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2024-10-12 01:13:48,275 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2024-10-12 01:13:48,275 INFO L332 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2024-10-12 01:13:48,277 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 498 states, 497 states have (on average 1.4909456740442657) internal successors, (741), 497 states have internal predecessors, (741), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 01:13:48,295 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2024-10-12 01:13:48,295 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-10-12 01:13:48,295 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-10-12 01:13:48,296 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2024-10-12 01:13:48,296 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2024-10-12 01:13:48,305 INFO L745 eck$LassoCheckResult]: Stem: 153#$Ultimate##0true assume { :begin_inline_ULTIMATE.init } true;havoc ULTIMATE.init_#t~nondet96#1, ULTIMATE.init_#t~nondet97#1, ULTIMATE.init_#t~nondet98#1, ULTIMATE.init_#t~nondet99#1, ULTIMATE.init_#t~nondet100#1, ULTIMATE.init_#t~nondet101#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#2(0, ~#__CS_thread_born_round~0.base, ~#__CS_thread_born_round~0.offset, 1);call write~init~int#2(0, ~#__CS_thread_born_round~0.base, 1 + ~#__CS_thread_born_round~0.offset, 1);call write~init~int#2(0, ~#__CS_thread_born_round~0.base, 2 + ~#__CS_thread_born_round~0.offset, 1);~__CS_thread~0.base, ~__CS_thread~0.offset := ~__CS_thread~0.base[0 := 0], ~__CS_thread~0.offset[0 := 0];~__CS_thread~0.base, ~__CS_thread~0.offset := ~__CS_thread~0.base[1 := 0], ~__CS_thread~0.offset[1 := 0];~__CS_thread~0.base, ~__CS_thread~0.offset := ~__CS_thread~0.base[2 := 0], ~__CS_thread~0.offset[2 := 0];call #Ultimate.allocInit(6, 5);~#__CS_thread_status~0.base, ~#__CS_thread_status~0.offset := 5, 0;call write~init~int#4(0, ~#__CS_thread_status~0.base, ~#__CS_thread_status~0.offset, 1);call write~init~int#4(0, ~#__CS_thread_status~0.base, 1 + ~#__CS_thread_status~0.offset, 1);call write~init~int#4(0, ~#__CS_thread_status~0.base, 2 + ~#__CS_thread_status~0.offset, 1);call write~init~int#4(0, ~#__CS_thread_status~0.base, 3 + ~#__CS_thread_status~0.offset, 1);call write~init~int#4(0, ~#__CS_thread_status~0.base, 4 + ~#__CS_thread_status~0.offset, 1);call write~init~int#4(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, 6);~#__CS_thread_lockedon~0.base, ~#__CS_thread_lockedon~0.offset := 6, 0;call write~init~$Pointer$#5(0, 0, ~#__CS_thread_lockedon~0.base, ~#__CS_thread_lockedon~0.offset, 4);call write~init~$Pointer$#5(0, 0, ~#__CS_thread_lockedon~0.base, 4 + ~#__CS_thread_lockedon~0.offset, 4);call write~init~$Pointer$#5(0, 0, ~#__CS_thread_lockedon~0.base, 8 + ~#__CS_thread_lockedon~0.offset, 4);call write~init~$Pointer$#5(0, 0, ~#__CS_thread_lockedon~0.base, 12 + ~#__CS_thread_lockedon~0.offset, 4);call write~init~$Pointer$#5(0, 0, ~#__CS_thread_lockedon~0.base, 16 + ~#__CS_thread_lockedon~0.offset, 4);call write~init~$Pointer$#5(0, 0, ~#__CS_thread_lockedon~0.base, 20 + ~#__CS_thread_lockedon~0.offset, 4);call #Ultimate.allocInit(2, 7);~#ma~0.base, ~#ma~0.offset := 7, 0;call write~init~int#6(0, ~#ma~0.base, ~#ma~0.offset, 1);call write~init~int#6(0, ~#ma~0.base, 1 + ~#ma~0.offset, 1);call #Ultimate.allocInit(2, 8);~#mb~0.base, ~#mb~0.offset := 8, 0;call write~init~int#6(0, ~#mb~0.base, ~#mb~0.offset, 1);call write~init~int#6(0, ~#mb~0.base, 1 + ~#mb~0.offset, 1);call #Ultimate.allocInit(8, 9);~#data1~0.base, ~#data1~0.offset := 9, 0;call write~init~int#7(0, ~#data1~0.base, ~#data1~0.offset, 4);call write~init~int#7(0, ~#data1~0.base, 4 + ~#data1~0.offset, 4);call #Ultimate.allocInit(8, 10);~#data2~0.base, ~#data2~0.offset := 10, 0;call write~init~int#9(0, ~#data2~0.base, ~#data2~0.offset, 4);call write~init~int#9(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~nondet96#1];~__CS_u~0.mb := ~__CS_u~0.mb[1 := ULTIMATE.init_#t~nondet97#1];~__CS_u~0.data1 := ~__CS_u~0.data1[0 := ULTIMATE.init_#t~nondet98#1];~__CS_u~0.data1 := ~__CS_u~0.data1[1 := ULTIMATE.init_#t~nondet99#1];~__CS_u~0.data2 := ~__CS_u~0.data2[0 := ULTIMATE.init_#t~nondet100#1];~__CS_u~0.data2 := ~__CS_u~0.data2[1 := ULTIMATE.init_#t~nondet101#1];havoc ULTIMATE.init_#t~nondet96#1;havoc ULTIMATE.init_#t~nondet97#1;havoc ULTIMATE.init_#t~nondet98#1;havoc ULTIMATE.init_#t~nondet99#1;havoc ULTIMATE.init_#t~nondet100#1;havoc ULTIMATE.init_#t~nondet101#1; 414#L-1true havoc ULTIMATE.init_#t~nondet96#1, ULTIMATE.init_#t~nondet97#1, ULTIMATE.init_#t~nondet98#1, ULTIMATE.init_#t~nondet99#1, ULTIMATE.init_#t~nondet100#1, ULTIMATE.init_#t~nondet101#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~ret67#1.base, main_#t~ret67#1.offset, main_#t~mem68#1, main_#t~mem69#1, main_#t~ret71#1.base, main_#t~ret71#1.offset, main_#t~mem72#1, main_#t~mem73#1, main_#t~ret75#1.base, main_#t~ret75#1.offset, main_#t~mem76#1, main_#t~mem77#1, main_#t~mem78#1, main_#t~mem79#1, main_#t~mem80#1, main_#t~mem81#1, main_#t~mem82#1.base, main_#t~mem82#1.offset, main_#t~mem83#1.base, main_#t~mem83#1.offset, main_#t~mem84#1.base, main_#t~mem84#1.offset, 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, main_#t~mem89#1, main_#t~mem90#1, main_#t~mem91#1, main_#t~mem92#1, main_#t~mem93#1, main_#t~mem94#1, main_#t~mem95#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; 181#L758-3true [2024-10-12 01:13:48,306 INFO L747 eck$LassoCheckResult]: Loop: 181#L758-3true assume !!(main_~i~0#1 < 2);main_~j~2#1 := 0; 175#L759-3true assume !(main_~j~2#1 < 3); 351#L759-4true havoc main_~j~2#1;havoc main_#t~nondet49#1;call write~int#3(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#11(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#8(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#14(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; 9#L758-2true main_#t~pre53#1 := 1 + main_~i~0#1;main_~i~0#1 := 1 + main_~i~0#1;havoc main_#t~pre53#1; 181#L758-3true [2024-10-12 01:13:48,311 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 01:13:48,312 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 1 times [2024-10-12 01:13:48,323 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 01:13:48,324 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1663807044] [2024-10-12 01:13:48,325 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 01:13:48,325 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 01:13:48,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 01:13:48,503 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-12 01:13:48,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 01:13:48,604 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-12 01:13:48,607 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 01:13:48,608 INFO L85 PathProgramCache]: Analyzing trace with hash 1237577, now seen corresponding path program 1 times [2024-10-12 01:13:48,608 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 01:13:48,608 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2113491138] [2024-10-12 01:13:48,608 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 01:13:48,609 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 01:13:48,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:13:48,762 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 01:13:48,763 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 01:13:48,763 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2113491138] [2024-10-12 01:13:48,764 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2113491138] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 01:13:48,764 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 01:13:48,764 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-12 01:13:48,764 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1509411270] [2024-10-12 01:13:48,765 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 01:13:48,769 INFO L762 eck$LassoCheckResult]: loop already infeasible [2024-10-12 01:13:48,770 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 01:13:48,804 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-12 01:13:48,804 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 01:13:48,807 INFO L87 Difference]: Start difference. First operand has 498 states, 497 states have (on average 1.4909456740442657) internal successors, (741), 497 states have internal predecessors, (741), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 2 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 01:13:48,876 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 01:13:48,877 INFO L93 Difference]: Finished difference Result 499 states and 647 transitions. [2024-10-12 01:13:48,879 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 499 states and 647 transitions. [2024-10-12 01:13:48,885 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2024-10-12 01:13:48,888 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 499 states to 9 states and 10 transitions. [2024-10-12 01:13:48,889 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 9 [2024-10-12 01:13:48,889 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 9 [2024-10-12 01:13:48,890 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 10 transitions. [2024-10-12 01:13:48,890 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2024-10-12 01:13:48,890 INFO L218 hiAutomatonCegarLoop]: Abstraction has 9 states and 10 transitions. [2024-10-12 01:13:48,904 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9 states and 10 transitions. [2024-10-12 01:13:48,911 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9 to 8. [2024-10-12 01:13:48,911 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 1.125) internal successors, (9), 7 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 01:13:48,912 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 9 transitions. [2024-10-12 01:13:48,913 INFO L240 hiAutomatonCegarLoop]: Abstraction has 8 states and 9 transitions. [2024-10-12 01:13:48,914 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-12 01:13:48,917 INFO L425 stractBuchiCegarLoop]: Abstraction has 8 states and 9 transitions. [2024-10-12 01:13:48,917 INFO L332 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2024-10-12 01:13:48,917 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 8 states and 9 transitions. [2024-10-12 01:13:48,918 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 6 [2024-10-12 01:13:48,918 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-10-12 01:13:48,918 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-10-12 01:13:48,918 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2024-10-12 01:13:48,918 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2024-10-12 01:13:48,919 INFO L745 eck$LassoCheckResult]: Stem: 1009#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;havoc ULTIMATE.init_#t~nondet96#1, ULTIMATE.init_#t~nondet97#1, ULTIMATE.init_#t~nondet98#1, ULTIMATE.init_#t~nondet99#1, ULTIMATE.init_#t~nondet100#1, ULTIMATE.init_#t~nondet101#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#2(0, ~#__CS_thread_born_round~0.base, ~#__CS_thread_born_round~0.offset, 1);call write~init~int#2(0, ~#__CS_thread_born_round~0.base, 1 + ~#__CS_thread_born_round~0.offset, 1);call write~init~int#2(0, ~#__CS_thread_born_round~0.base, 2 + ~#__CS_thread_born_round~0.offset, 1);~__CS_thread~0.base, ~__CS_thread~0.offset := ~__CS_thread~0.base[0 := 0], ~__CS_thread~0.offset[0 := 0];~__CS_thread~0.base, ~__CS_thread~0.offset := ~__CS_thread~0.base[1 := 0], ~__CS_thread~0.offset[1 := 0];~__CS_thread~0.base, ~__CS_thread~0.offset := ~__CS_thread~0.base[2 := 0], ~__CS_thread~0.offset[2 := 0];call #Ultimate.allocInit(6, 5);~#__CS_thread_status~0.base, ~#__CS_thread_status~0.offset := 5, 0;call write~init~int#4(0, ~#__CS_thread_status~0.base, ~#__CS_thread_status~0.offset, 1);call write~init~int#4(0, ~#__CS_thread_status~0.base, 1 + ~#__CS_thread_status~0.offset, 1);call write~init~int#4(0, ~#__CS_thread_status~0.base, 2 + ~#__CS_thread_status~0.offset, 1);call write~init~int#4(0, ~#__CS_thread_status~0.base, 3 + ~#__CS_thread_status~0.offset, 1);call write~init~int#4(0, ~#__CS_thread_status~0.base, 4 + ~#__CS_thread_status~0.offset, 1);call write~init~int#4(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, 6);~#__CS_thread_lockedon~0.base, ~#__CS_thread_lockedon~0.offset := 6, 0;call write~init~$Pointer$#5(0, 0, ~#__CS_thread_lockedon~0.base, ~#__CS_thread_lockedon~0.offset, 4);call write~init~$Pointer$#5(0, 0, ~#__CS_thread_lockedon~0.base, 4 + ~#__CS_thread_lockedon~0.offset, 4);call write~init~$Pointer$#5(0, 0, ~#__CS_thread_lockedon~0.base, 8 + ~#__CS_thread_lockedon~0.offset, 4);call write~init~$Pointer$#5(0, 0, ~#__CS_thread_lockedon~0.base, 12 + ~#__CS_thread_lockedon~0.offset, 4);call write~init~$Pointer$#5(0, 0, ~#__CS_thread_lockedon~0.base, 16 + ~#__CS_thread_lockedon~0.offset, 4);call write~init~$Pointer$#5(0, 0, ~#__CS_thread_lockedon~0.base, 20 + ~#__CS_thread_lockedon~0.offset, 4);call #Ultimate.allocInit(2, 7);~#ma~0.base, ~#ma~0.offset := 7, 0;call write~init~int#6(0, ~#ma~0.base, ~#ma~0.offset, 1);call write~init~int#6(0, ~#ma~0.base, 1 + ~#ma~0.offset, 1);call #Ultimate.allocInit(2, 8);~#mb~0.base, ~#mb~0.offset := 8, 0;call write~init~int#6(0, ~#mb~0.base, ~#mb~0.offset, 1);call write~init~int#6(0, ~#mb~0.base, 1 + ~#mb~0.offset, 1);call #Ultimate.allocInit(8, 9);~#data1~0.base, ~#data1~0.offset := 9, 0;call write~init~int#7(0, ~#data1~0.base, ~#data1~0.offset, 4);call write~init~int#7(0, ~#data1~0.base, 4 + ~#data1~0.offset, 4);call #Ultimate.allocInit(8, 10);~#data2~0.base, ~#data2~0.offset := 10, 0;call write~init~int#9(0, ~#data2~0.base, ~#data2~0.offset, 4);call write~init~int#9(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~nondet96#1];~__CS_u~0.mb := ~__CS_u~0.mb[1 := ULTIMATE.init_#t~nondet97#1];~__CS_u~0.data1 := ~__CS_u~0.data1[0 := ULTIMATE.init_#t~nondet98#1];~__CS_u~0.data1 := ~__CS_u~0.data1[1 := ULTIMATE.init_#t~nondet99#1];~__CS_u~0.data2 := ~__CS_u~0.data2[0 := ULTIMATE.init_#t~nondet100#1];~__CS_u~0.data2 := ~__CS_u~0.data2[1 := ULTIMATE.init_#t~nondet101#1];havoc ULTIMATE.init_#t~nondet96#1;havoc ULTIMATE.init_#t~nondet97#1;havoc ULTIMATE.init_#t~nondet98#1;havoc ULTIMATE.init_#t~nondet99#1;havoc ULTIMATE.init_#t~nondet100#1;havoc ULTIMATE.init_#t~nondet101#1; 1010#L-1 havoc ULTIMATE.init_#t~nondet96#1, ULTIMATE.init_#t~nondet97#1, ULTIMATE.init_#t~nondet98#1, ULTIMATE.init_#t~nondet99#1, ULTIMATE.init_#t~nondet100#1, ULTIMATE.init_#t~nondet101#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~ret67#1.base, main_#t~ret67#1.offset, main_#t~mem68#1, main_#t~mem69#1, main_#t~ret71#1.base, main_#t~ret71#1.offset, main_#t~mem72#1, main_#t~mem73#1, main_#t~ret75#1.base, main_#t~ret75#1.offset, main_#t~mem76#1, main_#t~mem77#1, main_#t~mem78#1, main_#t~mem79#1, main_#t~mem80#1, main_#t~mem81#1, main_#t~mem82#1.base, main_#t~mem82#1.offset, main_#t~mem83#1.base, main_#t~mem83#1.offset, main_#t~mem84#1.base, main_#t~mem84#1.offset, 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, main_#t~mem89#1, main_#t~mem90#1, main_#t~mem91#1, main_#t~mem92#1, main_#t~mem93#1, main_#t~mem94#1, main_#t~mem95#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; 1012#L758-3 [2024-10-12 01:13:48,919 INFO L747 eck$LassoCheckResult]: Loop: 1012#L758-3 assume !!(main_~i~0#1 < 2);main_~j~2#1 := 0; 1006#L759-3 assume !!(main_~j~2#1 < 3);havoc main_#t~nondet46#1;call write~int#12(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$#10(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; 1007#L759-2 main_#t~pre48#1 := 1 + main_~j~2#1;main_~j~2#1 := 1 + main_~j~2#1;havoc main_#t~pre48#1; 1008#L759-3 assume !(main_~j~2#1 < 3); 1013#L759-4 havoc main_~j~2#1;havoc main_#t~nondet49#1;call write~int#3(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#11(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#8(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#14(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; 1011#L758-2 main_#t~pre53#1 := 1 + main_~i~0#1;main_~i~0#1 := 1 + main_~i~0#1;havoc main_#t~pre53#1; 1012#L758-3 [2024-10-12 01:13:48,920 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 01:13:48,920 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 2 times [2024-10-12 01:13:48,920 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 01:13:48,920 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [164461894] [2024-10-12 01:13:48,920 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 01:13:48,921 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 01:13:48,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 01:13:48,954 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-12 01:13:48,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 01:13:48,996 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-12 01:13:48,997 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 01:13:48,997 INFO L85 PathProgramCache]: Analyzing trace with hash 1191030535, now seen corresponding path program 1 times [2024-10-12 01:13:48,997 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 01:13:48,997 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1074096884] [2024-10-12 01:13:48,997 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 01:13:48,997 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 01:13:49,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:13:49,099 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 01:13:49,099 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 01:13:49,100 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1074096884] [2024-10-12 01:13:49,100 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1074096884] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-12 01:13:49,100 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [719665567] [2024-10-12 01:13:49,100 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 01:13:49,100 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-12 01:13:49,101 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 01:13:49,103 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-12 01:13:49,104 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-10-12 01:13:49,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:13:49,296 INFO L255 TraceCheckSpWp]: Trace formula consists of 107 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-12 01:13:49,298 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 01:13:49,336 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 01:13:49,338 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-12 01:13:49,356 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 01:13:49,357 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [719665567] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-12 01:13:49,359 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-12 01:13:49,359 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 4 [2024-10-12 01:13:49,360 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1493055676] [2024-10-12 01:13:49,360 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-12 01:13:49,360 INFO L762 eck$LassoCheckResult]: loop already infeasible [2024-10-12 01:13:49,360 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 01:13:49,361 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-12 01:13:49,361 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2024-10-12 01:13:49,361 INFO L87 Difference]: Start difference. First operand 8 states and 9 transitions. cyclomatic complexity: 2 Second operand has 5 states, 5 states have (on average 2.0) internal successors, (10), 4 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 01:13:49,406 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 01:13:49,406 INFO L93 Difference]: Finished difference Result 12 states and 13 transitions. [2024-10-12 01:13:49,406 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 12 states and 13 transitions. [2024-10-12 01:13:49,407 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 10 [2024-10-12 01:13:49,408 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 12 states to 12 states and 13 transitions. [2024-10-12 01:13:49,408 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 12 [2024-10-12 01:13:49,408 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 12 [2024-10-12 01:13:49,409 INFO L73 IsDeterministic]: Start isDeterministic. Operand 12 states and 13 transitions. [2024-10-12 01:13:49,409 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2024-10-12 01:13:49,409 INFO L218 hiAutomatonCegarLoop]: Abstraction has 12 states and 13 transitions. [2024-10-12 01:13:49,409 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12 states and 13 transitions. [2024-10-12 01:13:49,410 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12 to 12. [2024-10-12 01:13:49,410 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 12 states have (on average 1.0833333333333333) internal successors, (13), 11 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 01:13:49,410 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 13 transitions. [2024-10-12 01:13:49,410 INFO L240 hiAutomatonCegarLoop]: Abstraction has 12 states and 13 transitions. [2024-10-12 01:13:49,412 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-12 01:13:49,413 INFO L425 stractBuchiCegarLoop]: Abstraction has 12 states and 13 transitions. [2024-10-12 01:13:49,413 INFO L332 stractBuchiCegarLoop]: ======== Iteration 3 ============ [2024-10-12 01:13:49,413 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 12 states and 13 transitions. [2024-10-12 01:13:49,413 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 10 [2024-10-12 01:13:49,413 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-10-12 01:13:49,413 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-10-12 01:13:49,414 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2024-10-12 01:13:49,414 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [3, 3, 1, 1, 1, 1] [2024-10-12 01:13:49,414 INFO L745 eck$LassoCheckResult]: Stem: 1067#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;havoc ULTIMATE.init_#t~nondet96#1, ULTIMATE.init_#t~nondet97#1, ULTIMATE.init_#t~nondet98#1, ULTIMATE.init_#t~nondet99#1, ULTIMATE.init_#t~nondet100#1, ULTIMATE.init_#t~nondet101#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#2(0, ~#__CS_thread_born_round~0.base, ~#__CS_thread_born_round~0.offset, 1);call write~init~int#2(0, ~#__CS_thread_born_round~0.base, 1 + ~#__CS_thread_born_round~0.offset, 1);call write~init~int#2(0, ~#__CS_thread_born_round~0.base, 2 + ~#__CS_thread_born_round~0.offset, 1);~__CS_thread~0.base, ~__CS_thread~0.offset := ~__CS_thread~0.base[0 := 0], ~__CS_thread~0.offset[0 := 0];~__CS_thread~0.base, ~__CS_thread~0.offset := ~__CS_thread~0.base[1 := 0], ~__CS_thread~0.offset[1 := 0];~__CS_thread~0.base, ~__CS_thread~0.offset := ~__CS_thread~0.base[2 := 0], ~__CS_thread~0.offset[2 := 0];call #Ultimate.allocInit(6, 5);~#__CS_thread_status~0.base, ~#__CS_thread_status~0.offset := 5, 0;call write~init~int#4(0, ~#__CS_thread_status~0.base, ~#__CS_thread_status~0.offset, 1);call write~init~int#4(0, ~#__CS_thread_status~0.base, 1 + ~#__CS_thread_status~0.offset, 1);call write~init~int#4(0, ~#__CS_thread_status~0.base, 2 + ~#__CS_thread_status~0.offset, 1);call write~init~int#4(0, ~#__CS_thread_status~0.base, 3 + ~#__CS_thread_status~0.offset, 1);call write~init~int#4(0, ~#__CS_thread_status~0.base, 4 + ~#__CS_thread_status~0.offset, 1);call write~init~int#4(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, 6);~#__CS_thread_lockedon~0.base, ~#__CS_thread_lockedon~0.offset := 6, 0;call write~init~$Pointer$#5(0, 0, ~#__CS_thread_lockedon~0.base, ~#__CS_thread_lockedon~0.offset, 4);call write~init~$Pointer$#5(0, 0, ~#__CS_thread_lockedon~0.base, 4 + ~#__CS_thread_lockedon~0.offset, 4);call write~init~$Pointer$#5(0, 0, ~#__CS_thread_lockedon~0.base, 8 + ~#__CS_thread_lockedon~0.offset, 4);call write~init~$Pointer$#5(0, 0, ~#__CS_thread_lockedon~0.base, 12 + ~#__CS_thread_lockedon~0.offset, 4);call write~init~$Pointer$#5(0, 0, ~#__CS_thread_lockedon~0.base, 16 + ~#__CS_thread_lockedon~0.offset, 4);call write~init~$Pointer$#5(0, 0, ~#__CS_thread_lockedon~0.base, 20 + ~#__CS_thread_lockedon~0.offset, 4);call #Ultimate.allocInit(2, 7);~#ma~0.base, ~#ma~0.offset := 7, 0;call write~init~int#6(0, ~#ma~0.base, ~#ma~0.offset, 1);call write~init~int#6(0, ~#ma~0.base, 1 + ~#ma~0.offset, 1);call #Ultimate.allocInit(2, 8);~#mb~0.base, ~#mb~0.offset := 8, 0;call write~init~int#6(0, ~#mb~0.base, ~#mb~0.offset, 1);call write~init~int#6(0, ~#mb~0.base, 1 + ~#mb~0.offset, 1);call #Ultimate.allocInit(8, 9);~#data1~0.base, ~#data1~0.offset := 9, 0;call write~init~int#7(0, ~#data1~0.base, ~#data1~0.offset, 4);call write~init~int#7(0, ~#data1~0.base, 4 + ~#data1~0.offset, 4);call #Ultimate.allocInit(8, 10);~#data2~0.base, ~#data2~0.offset := 10, 0;call write~init~int#9(0, ~#data2~0.base, ~#data2~0.offset, 4);call write~init~int#9(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~nondet96#1];~__CS_u~0.mb := ~__CS_u~0.mb[1 := ULTIMATE.init_#t~nondet97#1];~__CS_u~0.data1 := ~__CS_u~0.data1[0 := ULTIMATE.init_#t~nondet98#1];~__CS_u~0.data1 := ~__CS_u~0.data1[1 := ULTIMATE.init_#t~nondet99#1];~__CS_u~0.data2 := ~__CS_u~0.data2[0 := ULTIMATE.init_#t~nondet100#1];~__CS_u~0.data2 := ~__CS_u~0.data2[1 := ULTIMATE.init_#t~nondet101#1];havoc ULTIMATE.init_#t~nondet96#1;havoc ULTIMATE.init_#t~nondet97#1;havoc ULTIMATE.init_#t~nondet98#1;havoc ULTIMATE.init_#t~nondet99#1;havoc ULTIMATE.init_#t~nondet100#1;havoc ULTIMATE.init_#t~nondet101#1; 1068#L-1 havoc ULTIMATE.init_#t~nondet96#1, ULTIMATE.init_#t~nondet97#1, ULTIMATE.init_#t~nondet98#1, ULTIMATE.init_#t~nondet99#1, ULTIMATE.init_#t~nondet100#1, ULTIMATE.init_#t~nondet101#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~ret67#1.base, main_#t~ret67#1.offset, main_#t~mem68#1, main_#t~mem69#1, main_#t~ret71#1.base, main_#t~ret71#1.offset, main_#t~mem72#1, main_#t~mem73#1, main_#t~ret75#1.base, main_#t~ret75#1.offset, main_#t~mem76#1, main_#t~mem77#1, main_#t~mem78#1, main_#t~mem79#1, main_#t~mem80#1, main_#t~mem81#1, main_#t~mem82#1.base, main_#t~mem82#1.offset, main_#t~mem83#1.base, main_#t~mem83#1.offset, main_#t~mem84#1.base, main_#t~mem84#1.offset, 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, main_#t~mem89#1, main_#t~mem90#1, main_#t~mem91#1, main_#t~mem92#1, main_#t~mem93#1, main_#t~mem94#1, main_#t~mem95#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; 1070#L758-3 [2024-10-12 01:13:49,414 INFO L747 eck$LassoCheckResult]: Loop: 1070#L758-3 assume !!(main_~i~0#1 < 2);main_~j~2#1 := 0; 1064#L759-3 assume !!(main_~j~2#1 < 3);havoc main_#t~nondet46#1;call write~int#12(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$#10(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; 1065#L759-2 main_#t~pre48#1 := 1 + main_~j~2#1;main_~j~2#1 := 1 + main_~j~2#1;havoc main_#t~pre48#1; 1066#L759-3 assume !!(main_~j~2#1 < 3);havoc main_#t~nondet46#1;call write~int#12(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$#10(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; 1075#L759-2 main_#t~pre48#1 := 1 + main_~j~2#1;main_~j~2#1 := 1 + main_~j~2#1;havoc main_#t~pre48#1; 1074#L759-3 assume !!(main_~j~2#1 < 3);havoc main_#t~nondet46#1;call write~int#12(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$#10(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; 1073#L759-2 main_#t~pre48#1 := 1 + main_~j~2#1;main_~j~2#1 := 1 + main_~j~2#1;havoc main_#t~pre48#1; 1072#L759-3 assume !(main_~j~2#1 < 3); 1071#L759-4 havoc main_~j~2#1;havoc main_#t~nondet49#1;call write~int#3(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#11(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#8(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#14(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; 1069#L758-2 main_#t~pre53#1 := 1 + main_~i~0#1;main_~i~0#1 := 1 + main_~i~0#1;havoc main_#t~pre53#1; 1070#L758-3 [2024-10-12 01:13:49,417 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 01:13:49,417 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 3 times [2024-10-12 01:13:49,417 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 01:13:49,417 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1305509992] [2024-10-12 01:13:49,417 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 01:13:49,418 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 01:13:49,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 01:13:49,454 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-12 01:13:49,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 01:13:49,491 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-12 01:13:49,492 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 01:13:49,493 INFO L85 PathProgramCache]: Analyzing trace with hash -2055044605, now seen corresponding path program 2 times [2024-10-12 01:13:49,493 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 01:13:49,493 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1560886269] [2024-10-12 01:13:49,493 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 01:13:49,494 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 01:13:49,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 01:13:49,548 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-12 01:13:49,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 01:13:49,587 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-12 01:13:49,587 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 01:13:49,588 INFO L85 PathProgramCache]: Analyzing trace with hash 149568325, now seen corresponding path program 1 times [2024-10-12 01:13:49,588 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 01:13:49,588 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1484741285] [2024-10-12 01:13:49,588 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 01:13:49,588 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 01:13:49,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 01:13:49,675 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-12 01:13:49,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 01:13:49,765 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-12 01:14:59,463 WARN L286 SmtUtils]: Spent 1.16m on a formula simplification. DAG size of input: 326 DAG size of output: 310 (called from [L 275] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.TransFormulaUtils.sequentialComposition) [2024-10-12 01:15:22,310 INFO L204 LassoAnalysis]: Preferences: [2024-10-12 01:15:22,310 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2024-10-12 01:15:22,311 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-10-12 01:15:22,311 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2024-10-12 01:15:22,311 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2024-10-12 01:15:22,311 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 01:15:22,311 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2024-10-12 01:15:22,311 INFO L131 ssoRankerPreferences]: Path of dumped script: [2024-10-12 01:15:22,311 INFO L132 ssoRankerPreferences]: Filename of dumped script: cs_stateful-1.i_Iteration3_Lasso [2024-10-12 01:15:22,311 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2024-10-12 01:15:22,311 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2024-10-12 01:15:22,351 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 01:15:22,361 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 01:15:22,363 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 01:15:22,364 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 01:15:22,366 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 01:15:22,370 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 01:15:22,372 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 01:15:22,374 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true