./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/seq-pthread/cs_queue-1.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 48c9605d Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/seq-pthread/cs_queue-1.i -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 38d92478d67c3996e3815aaa6d0075347cfc456da7f20d1b1bb733d11593b6cf --- Real Ultimate output --- This is Ultimate 0.3.0-?-48c9605-m [2025-02-07 21:25:11,670 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-07 21:25:11,730 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-02-07 21:25:11,736 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-07 21:25:11,738 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-07 21:25:11,757 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-07 21:25:11,760 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-07 21:25:11,760 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-07 21:25:11,761 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-07 21:25:11,761 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-07 21:25:11,761 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-07 21:25:11,762 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-07 21:25:11,762 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-07 21:25:11,762 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-07 21:25:11,762 INFO L153 SettingsManager]: * Use SBE=true [2025-02-07 21:25:11,763 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-07 21:25:11,763 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-07 21:25:11,763 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-07 21:25:11,763 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-07 21:25:11,763 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-07 21:25:11,763 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-07 21:25:11,763 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-07 21:25:11,763 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-07 21:25:11,763 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-07 21:25:11,763 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-07 21:25:11,764 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-07 21:25:11,764 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-07 21:25:11,764 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-07 21:25:11,764 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-07 21:25:11,764 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-07 21:25:11,764 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-07 21:25:11,764 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-07 21:25:11,765 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-07 21:25:11,765 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-07 21:25:11,765 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-07 21:25:11,765 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-07 21:25:11,765 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-07 21:25:11,765 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-07 21:25:11,765 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-07 21:25:11,765 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-07 21:25:11,765 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-07 21:25:11,765 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-07 21:25:11,765 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-07 21:25:11,765 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) 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 -> 38d92478d67c3996e3815aaa6d0075347cfc456da7f20d1b1bb733d11593b6cf [2025-02-07 21:25:12,010 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-07 21:25:12,018 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-07 21:25:12,019 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-07 21:25:12,021 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-07 21:25:12,021 INFO L274 PluginConnector]: CDTParser initialized [2025-02-07 21:25:12,023 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/seq-pthread/cs_queue-1.i [2025-02-07 21:25:13,231 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/00ea409a0/9c23f3cd82714394aed9870e2af818a1/FLAGfcf55e472 [2025-02-07 21:25:13,567 INFO L384 CDTParser]: Found 1 translation units. [2025-02-07 21:25:13,568 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/seq-pthread/cs_queue-1.i [2025-02-07 21:25:13,588 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/00ea409a0/9c23f3cd82714394aed9870e2af818a1/FLAGfcf55e472 [2025-02-07 21:25:13,608 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/00ea409a0/9c23f3cd82714394aed9870e2af818a1 [2025-02-07 21:25:13,610 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-07 21:25:13,612 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-07 21:25:13,614 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-07 21:25:13,614 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-07 21:25:13,617 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-07 21:25:13,618 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.02 09:25:13" (1/1) ... [2025-02-07 21:25:13,619 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4ed0eb3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 09:25:13, skipping insertion in model container [2025-02-07 21:25:13,619 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.02 09:25:13" (1/1) ... [2025-02-07 21:25:13,660 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-07 21:25:13,918 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/seq-pthread/cs_queue-1.i[34744,34757] [2025-02-07 21:25:14,022 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-07 21:25:14,039 INFO L200 MainTranslator]: Completed pre-run [2025-02-07 21:25:14,078 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/seq-pthread/cs_queue-1.i[34744,34757] [2025-02-07 21:25:14,155 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-07 21:25:14,208 INFO L204 MainTranslator]: Completed translation [2025-02-07 21:25:14,209 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 09:25:14 WrapperNode [2025-02-07 21:25:14,210 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-07 21:25:14,211 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-07 21:25:14,211 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-07 21:25:14,211 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-07 21:25:14,215 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 09:25:14" (1/1) ... [2025-02-07 21:25:14,254 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 09:25:14" (1/1) ... [2025-02-07 21:25:14,321 INFO L138 Inliner]: procedures = 251, calls = 629, calls flagged for inlining = 9, calls inlined = 9, statements flattened = 1399 [2025-02-07 21:25:14,322 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-07 21:25:14,322 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-07 21:25:14,322 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-07 21:25:14,322 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-07 21:25:14,330 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 09:25:14" (1/1) ... [2025-02-07 21:25:14,330 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 09:25:14" (1/1) ... [2025-02-07 21:25:14,341 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 09:25:14" (1/1) ... [2025-02-07 21:25:14,395 INFO L175 MemorySlicer]: Split 397 memory accesses to 20 slices as follows [2, 8, 8, 8, 20, 12, 50, 82, 8, 0, 8, 3, 8, 3, 113, 7, 3, 6, 41, 7]. 28 percent of accesses are in the largest equivalence class. The 117 initializations are split as follows [2, 3, 3, 3, 6, 6, 0, 40, 2, 0, 2, 0, 2, 0, 46, 0, 0, 2, 0, 0]. The 94 writes are split as follows [0, 2, 2, 2, 8, 3, 4, 21, 4, 0, 4, 1, 3, 1, 33, 1, 1, 2, 1, 1]. [2025-02-07 21:25:14,395 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 09:25:14" (1/1) ... [2025-02-07 21:25:14,395 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 09:25:14" (1/1) ... [2025-02-07 21:25:14,432 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 09:25:14" (1/1) ... [2025-02-07 21:25:14,437 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 09:25:14" (1/1) ... [2025-02-07 21:25:14,444 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 09:25:14" (1/1) ... [2025-02-07 21:25:14,449 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 09:25:14" (1/1) ... [2025-02-07 21:25:14,459 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-07 21:25:14,459 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-07 21:25:14,460 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-07 21:25:14,460 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-07 21:25:14,460 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 09:25:14" (1/1) ... [2025-02-07 21:25:14,464 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-07 21:25:14,490 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-07 21:25:14,502 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-02-07 21:25:14,504 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-02-07 21:25:14,520 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-02-07 21:25:14,520 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-02-07 21:25:14,520 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-02-07 21:25:14,521 INFO L130 BoogieDeclarations]: Found specification of procedure empty [2025-02-07 21:25:14,521 INFO L138 BoogieDeclarations]: Found implementation of procedure empty [2025-02-07 21:25:14,521 INFO L130 BoogieDeclarations]: Found specification of procedure __CS_pthread_mutex_lock [2025-02-07 21:25:14,521 INFO L138 BoogieDeclarations]: Found implementation of procedure __CS_pthread_mutex_lock [2025-02-07 21:25:14,521 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2025-02-07 21:25:14,521 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2025-02-07 21:25:14,521 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2025-02-07 21:25:14,521 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#3 [2025-02-07 21:25:14,521 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#4 [2025-02-07 21:25:14,521 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#5 [2025-02-07 21:25:14,522 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#6 [2025-02-07 21:25:14,522 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#7 [2025-02-07 21:25:14,522 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#8 [2025-02-07 21:25:14,522 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#9 [2025-02-07 21:25:14,522 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#10 [2025-02-07 21:25:14,522 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#11 [2025-02-07 21:25:14,522 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#12 [2025-02-07 21:25:14,522 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#13 [2025-02-07 21:25:14,523 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#14 [2025-02-07 21:25:14,523 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#15 [2025-02-07 21:25:14,523 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#16 [2025-02-07 21:25:14,523 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#17 [2025-02-07 21:25:14,523 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#18 [2025-02-07 21:25:14,523 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#19 [2025-02-07 21:25:14,523 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-02-07 21:25:14,523 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#0 [2025-02-07 21:25:14,523 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#1 [2025-02-07 21:25:14,523 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#2 [2025-02-07 21:25:14,524 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#3 [2025-02-07 21:25:14,524 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#4 [2025-02-07 21:25:14,524 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#5 [2025-02-07 21:25:14,524 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#6 [2025-02-07 21:25:14,524 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#7 [2025-02-07 21:25:14,524 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#8 [2025-02-07 21:25:14,524 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#9 [2025-02-07 21:25:14,524 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#10 [2025-02-07 21:25:14,524 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#11 [2025-02-07 21:25:14,524 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#12 [2025-02-07 21:25:14,524 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#13 [2025-02-07 21:25:14,524 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#14 [2025-02-07 21:25:14,524 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#15 [2025-02-07 21:25:14,524 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#16 [2025-02-07 21:25:14,525 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#17 [2025-02-07 21:25:14,525 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#18 [2025-02-07 21:25:14,525 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#19 [2025-02-07 21:25:14,525 INFO L130 BoogieDeclarations]: Found specification of procedure __CS_pthread_mutex_unlock [2025-02-07 21:25:14,525 INFO L138 BoogieDeclarations]: Found implementation of procedure __CS_pthread_mutex_unlock [2025-02-07 21:25:14,525 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-02-07 21:25:14,525 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-02-07 21:25:14,525 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2025-02-07 21:25:14,525 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2025-02-07 21:25:14,525 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#4 [2025-02-07 21:25:14,525 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#5 [2025-02-07 21:25:14,525 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#6 [2025-02-07 21:25:14,525 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#7 [2025-02-07 21:25:14,525 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#8 [2025-02-07 21:25:14,525 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#9 [2025-02-07 21:25:14,526 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#10 [2025-02-07 21:25:14,526 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#11 [2025-02-07 21:25:14,526 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#12 [2025-02-07 21:25:14,526 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#13 [2025-02-07 21:25:14,526 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#14 [2025-02-07 21:25:14,526 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#15 [2025-02-07 21:25:14,526 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#16 [2025-02-07 21:25:14,526 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#17 [2025-02-07 21:25:14,526 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#18 [2025-02-07 21:25:14,526 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#19 [2025-02-07 21:25:14,526 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2025-02-07 21:25:14,526 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2025-02-07 21:25:14,526 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-02-07 21:25:14,526 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-02-07 21:25:14,526 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2025-02-07 21:25:14,526 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2025-02-07 21:25:14,527 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#4 [2025-02-07 21:25:14,527 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#5 [2025-02-07 21:25:14,527 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#6 [2025-02-07 21:25:14,527 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#7 [2025-02-07 21:25:14,527 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#8 [2025-02-07 21:25:14,527 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#9 [2025-02-07 21:25:14,527 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#10 [2025-02-07 21:25:14,527 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#11 [2025-02-07 21:25:14,527 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#12 [2025-02-07 21:25:14,527 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#13 [2025-02-07 21:25:14,527 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#14 [2025-02-07 21:25:14,527 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#15 [2025-02-07 21:25:14,527 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#16 [2025-02-07 21:25:14,527 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#17 [2025-02-07 21:25:14,527 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#18 [2025-02-07 21:25:14,527 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#19 [2025-02-07 21:25:14,528 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-07 21:25:14,528 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2025-02-07 21:25:14,528 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2025-02-07 21:25:14,528 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2025-02-07 21:25:14,528 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#3 [2025-02-07 21:25:14,528 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#4 [2025-02-07 21:25:14,528 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#5 [2025-02-07 21:25:14,528 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#6 [2025-02-07 21:25:14,528 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#7 [2025-02-07 21:25:14,528 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#8 [2025-02-07 21:25:14,528 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#9 [2025-02-07 21:25:14,528 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#10 [2025-02-07 21:25:14,528 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#11 [2025-02-07 21:25:14,528 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#12 [2025-02-07 21:25:14,528 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#13 [2025-02-07 21:25:14,528 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#14 [2025-02-07 21:25:14,528 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#15 [2025-02-07 21:25:14,528 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#16 [2025-02-07 21:25:14,528 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#17 [2025-02-07 21:25:14,528 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#18 [2025-02-07 21:25:14,529 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#19 [2025-02-07 21:25:14,529 INFO L130 BoogieDeclarations]: Found specification of procedure __CS_pthread_create [2025-02-07 21:25:14,529 INFO L138 BoogieDeclarations]: Found implementation of procedure __CS_pthread_create [2025-02-07 21:25:14,529 INFO L130 BoogieDeclarations]: Found specification of procedure __CS_pthread_join [2025-02-07 21:25:14,529 INFO L138 BoogieDeclarations]: Found implementation of procedure __CS_pthread_join [2025-02-07 21:25:14,529 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~$Pointer$~TO~$Pointer$ [2025-02-07 21:25:14,529 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~$Pointer$~TO~$Pointer$ [2025-02-07 21:25:14,529 INFO L130 BoogieDeclarations]: Found specification of procedure __CS_cs [2025-02-07 21:25:14,529 INFO L138 BoogieDeclarations]: Found implementation of procedure __CS_cs [2025-02-07 21:25:14,529 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-02-07 21:25:14,529 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-02-07 21:25:14,529 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-02-07 21:25:14,529 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2025-02-07 21:25:14,530 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2025-02-07 21:25:14,530 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#5 [2025-02-07 21:25:14,530 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#6 [2025-02-07 21:25:14,530 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#7 [2025-02-07 21:25:14,530 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#8 [2025-02-07 21:25:14,530 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#9 [2025-02-07 21:25:14,530 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#10 [2025-02-07 21:25:14,530 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#11 [2025-02-07 21:25:14,530 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#12 [2025-02-07 21:25:14,530 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#13 [2025-02-07 21:25:14,530 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#14 [2025-02-07 21:25:14,530 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#15 [2025-02-07 21:25:14,530 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#16 [2025-02-07 21:25:14,530 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#17 [2025-02-07 21:25:14,530 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#18 [2025-02-07 21:25:14,530 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#19 [2025-02-07 21:25:14,530 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-07 21:25:14,530 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-07 21:25:14,783 INFO L257 CfgBuilder]: Building ICFG [2025-02-07 21:25:14,785 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-07 21:25:14,873 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L976: assume 0 != (if ~__CS_ret~0 % 256 % 4294967296 <= 2147483647 then ~__CS_ret~0 % 256 % 4294967296 else ~__CS_ret~0 % 256 % 4294967296 - 4294967296);#res := 0; [2025-02-07 21:25:14,873 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L976: assume !(0 != (if ~__CS_ret~0 % 256 % 4294967296 <= 2147483647 then ~__CS_ret~0 % 256 % 4294967296 else ~__CS_ret~0 % 256 % 4294967296 - 4294967296)); [2025-02-07 21:25:14,873 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L976-1: SUMMARY for call __CS_cs(); srcloc: null [2025-02-07 21:25:14,873 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L971: assume 0 != (if ~__CS_ret~0 % 256 % 4294967296 <= 2147483647 then ~__CS_ret~0 % 256 % 4294967296 else ~__CS_ret~0 % 256 % 4294967296 - 4294967296);#res := 0; [2025-02-07 21:25:14,873 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L971: assume !(0 != (if ~__CS_ret~0 % 256 % 4294967296 <= 2147483647 then ~__CS_ret~0 % 256 % 4294967296 else ~__CS_ret~0 % 256 % 4294967296 - 4294967296)); [2025-02-07 21:25:14,873 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L971-1: SUMMARY for call __CS_cs(); srcloc: null [2025-02-07 21:25:15,343 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1093-1: assume 0 != (if ~__CS_ret~0 % 256 % 4294967296 <= 2147483647 then ~__CS_ret~0 % 256 % 4294967296 else ~__CS_ret~0 % 256 % 4294967296 - 4294967296);t2_#res#1.base, t2_#res#1.offset := 0, 0; [2025-02-07 21:25:15,343 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1093-1: assume !(0 != (if ~__CS_ret~0 % 256 % 4294967296 <= 2147483647 then ~__CS_ret~0 % 256 % 4294967296 else ~__CS_ret~0 % 256 % 4294967296 - 4294967296)); [2025-02-07 21:25:15,343 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1093-2: SUMMARY for call __CS_cs(); srcloc: null [2025-02-07 21:25:15,343 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint ##fun~$Pointer$~TO~$Pointer$FINAL: assume true; [2025-02-07 21:25:15,344 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1127-1: assume 0 != (if ~__CS_ret~0 % 256 % 4294967296 <= 2147483647 then ~__CS_ret~0 % 256 % 4294967296 else ~__CS_ret~0 % 256 % 4294967296 - 4294967296);main_thread_#res#1.base, main_thread_#res#1.offset := 0, 0;call ULTIMATE.dealloc(main_thread_~#id1~0#1.base, main_thread_~#id1~0#1.offset);havoc main_thread_~#id1~0#1.base, main_thread_~#id1~0#1.offset;call ULTIMATE.dealloc(main_thread_~#id2~0#1.base, main_thread_~#id2~0#1.offset);havoc main_thread_~#id2~0#1.base, main_thread_~#id2~0#1.offset; [2025-02-07 21:25:15,344 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1127-1: assume !(0 != (if ~__CS_ret~0 % 256 % 4294967296 <= 2147483647 then ~__CS_ret~0 % 256 % 4294967296 else ~__CS_ret~0 % 256 % 4294967296 - 4294967296)); [2025-02-07 21:25:15,344 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1127-2: SUMMARY for call __CS_cs(); srcloc: null [2025-02-07 21:25:15,344 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1129-1: assume 0 != (if ~__CS_ret~0 % 256 % 4294967296 <= 2147483647 then ~__CS_ret~0 % 256 % 4294967296 else ~__CS_ret~0 % 256 % 4294967296 - 4294967296);main_thread_#res#1.base, main_thread_#res#1.offset := 0, 0;call ULTIMATE.dealloc(main_thread_~#id1~0#1.base, main_thread_~#id1~0#1.offset);havoc main_thread_~#id1~0#1.base, main_thread_~#id1~0#1.offset;call ULTIMATE.dealloc(main_thread_~#id2~0#1.base, main_thread_~#id2~0#1.offset);havoc main_thread_~#id2~0#1.base, main_thread_~#id2~0#1.offset; [2025-02-07 21:25:15,344 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1129-1: assume !(0 != (if ~__CS_ret~0 % 256 % 4294967296 <= 2147483647 then ~__CS_ret~0 % 256 % 4294967296 else ~__CS_ret~0 % 256 % 4294967296 - 4294967296)); [2025-02-07 21:25:15,344 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1129-2: SUMMARY for call __CS_cs(); srcloc: null [2025-02-07 21:25:15,344 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1015-1: assume 0 != (if ~__CS_ret~0 % 256 % 4294967296 <= 2147483647 then ~__CS_ret~0 % 256 % 4294967296 else ~__CS_ret~0 % 256 % 4294967296 - 4294967296);enqueue_#res#1 := 0; [2025-02-07 21:25:15,344 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1015-1: assume !(0 != (if ~__CS_ret~0 % 256 % 4294967296 <= 2147483647 then ~__CS_ret~0 % 256 % 4294967296 else ~__CS_ret~0 % 256 % 4294967296 - 4294967296));t1_#t~ret70#1 := enqueue_#res#1;havoc enqueue_#t~mem54#1, enqueue_#t~mem55#1, enqueue_#t~post56#1, enqueue_#t~mem57#1, enqueue_#t~mem58#1, enqueue_#t~post59#1, enqueue_~q#1.base, enqueue_~q#1.offset, enqueue_~x#1;havoc enqueue_#in~q#1.base, enqueue_#in~q#1.offset, enqueue_#in~x#1;assume { :end_inline_enqueue } true;assume -2147483648 <= t1_#t~ret70#1 && t1_#t~ret70#1 <= 2147483647;havoc t1_#t~ret70#1; [2025-02-07 21:25:15,344 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1015-2: SUMMARY for call __CS_cs(); srcloc: null [2025-02-07 21:25:15,344 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1132: main_thread_#t~ret84#1 := __CS_pthread_mutex_init_#res#1;havoc __CS_pthread_mutex_init_~mutex#1.base, __CS_pthread_mutex_init_~mutex#1.offset, __CS_pthread_mutex_init_~attr#1.base, __CS_pthread_mutex_init_~attr#1.offset;havoc __CS_pthread_mutex_init_#in~mutex#1.base, __CS_pthread_mutex_init_#in~mutex#1.offset, __CS_pthread_mutex_init_#in~attr#1.base, __CS_pthread_mutex_init_#in~attr#1.offset;assume { :end_inline___CS_pthread_mutex_init } true;assume -2147483648 <= main_thread_#t~ret84#1 && main_thread_#t~ret84#1 <= 2147483647;havoc main_thread_#t~ret84#1; [2025-02-07 21:25:15,345 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1133-1: assume 0 != (if ~__CS_ret~0 % 256 % 4294967296 <= 2147483647 then ~__CS_ret~0 % 256 % 4294967296 else ~__CS_ret~0 % 256 % 4294967296 - 4294967296);main_thread_#res#1.base, main_thread_#res#1.offset := 0, 0;call ULTIMATE.dealloc(main_thread_~#id1~0#1.base, main_thread_~#id1~0#1.offset);havoc main_thread_~#id1~0#1.base, main_thread_~#id1~0#1.offset;call ULTIMATE.dealloc(main_thread_~#id2~0#1.base, main_thread_~#id2~0#1.offset);havoc main_thread_~#id2~0#1.base, main_thread_~#id2~0#1.offset; [2025-02-07 21:25:15,345 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1133-1: assume !(0 != (if ~__CS_ret~0 % 256 % 4294967296 <= 2147483647 then ~__CS_ret~0 % 256 % 4294967296 else ~__CS_ret~0 % 256 % 4294967296 - 4294967296)); [2025-02-07 21:25:15,345 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1133-2: SUMMARY for call __CS_cs(); srcloc: null [2025-02-07 21:25:15,345 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1134: assume -2147483648 <= main_thread_#t~ret85#1 && main_thread_#t~ret85#1 <= 2147483647;havoc main_thread_#t~ret85#1; [2025-02-07 21:25:15,345 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1134-1: SUMMARY for call main_thread_#t~ret85#1 := __CS_pthread_create(main_thread_~#id1~0#1.base, main_thread_~#id1~0#1.offset, 0, 0, #funAddr~t1.base, #funAddr~t1.offset, ~#queue~0.base, ~#queue~0.offset + 92 * (if ~__CS_round~0 % 256 % 4294967296 <= 2147483647 then ~__CS_round~0 % 256 % 4294967296 else ~__CS_round~0 % 256 % 4294967296 - 4294967296)); srcloc: null [2025-02-07 21:25:15,345 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1068-1: assume 0 != (if ~__CS_ret~0 % 256 % 4294967296 <= 2147483647 then ~__CS_ret~0 % 256 % 4294967296 else ~__CS_ret~0 % 256 % 4294967296 - 4294967296);t1_#res#1.base, t1_#res#1.offset := 0, 0; [2025-02-07 21:25:15,345 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1068-1: assume !(0 != (if ~__CS_ret~0 % 256 % 4294967296 <= 2147483647 then ~__CS_ret~0 % 256 % 4294967296 else ~__CS_ret~0 % 256 % 4294967296 - 4294967296));#t~ret368#1.base, #t~ret368#1.offset := t1_#res#1.base, t1_#res#1.offset;havoc t1_#t~ret67#1, t1_#t~mem68#1, t1_#t~nondet69#1, t1_#t~ret70#1, t1_#t~post71#1, t1_#t~ret72#1, t1_~arg#1.base, t1_~arg#1.offset, t1_~value~0#1, t1_~i~0#1;havoc t1_#in~arg#1.base, t1_#in~arg#1.offset;assume { :end_inline_t1 } true;#t~funptrres367#1.base, #t~funptrres367#1.offset := #t~ret368#1.base, #t~ret368#1.offset; [2025-02-07 21:25:15,345 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1068-2: SUMMARY for call __CS_cs(); srcloc: null [2025-02-07 21:25:15,345 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1085: assume (if 0 == t2_#t~ret76#1 then 1 else 0) == t2_#t~mem77#1;havoc t2_#t~ret76#1;havoc t2_#t~mem77#1; [2025-02-07 21:25:15,345 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1085: assume !((if 0 == t2_#t~ret76#1 then 1 else 0) == t2_#t~mem77#1);havoc t2_#t~ret76#1;havoc t2_#t~mem77#1; [2025-02-07 21:25:15,345 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1135-1: assume 0 != (if ~__CS_ret~0 % 256 % 4294967296 <= 2147483647 then ~__CS_ret~0 % 256 % 4294967296 else ~__CS_ret~0 % 256 % 4294967296 - 4294967296);main_thread_#res#1.base, main_thread_#res#1.offset := 0, 0;call ULTIMATE.dealloc(main_thread_~#id1~0#1.base, main_thread_~#id1~0#1.offset);havoc main_thread_~#id1~0#1.base, main_thread_~#id1~0#1.offset;call ULTIMATE.dealloc(main_thread_~#id2~0#1.base, main_thread_~#id2~0#1.offset);havoc main_thread_~#id2~0#1.base, main_thread_~#id2~0#1.offset; [2025-02-07 21:25:15,346 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1135-1: assume !(0 != (if ~__CS_ret~0 % 256 % 4294967296 <= 2147483647 then ~__CS_ret~0 % 256 % 4294967296 else ~__CS_ret~0 % 256 % 4294967296 - 4294967296)); [2025-02-07 21:25:15,346 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1135-2: SUMMARY for call __CS_cs(); srcloc: null [2025-02-07 21:25:15,346 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1036-1: assume 0 != (if ~__CS_ret~0 % 256 % 4294967296 <= 2147483647 then ~__CS_ret~0 % 256 % 4294967296 else ~__CS_ret~0 % 256 % 4294967296 - 4294967296);dequeue_#res#1 := 0; [2025-02-07 21:25:15,346 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1036-1: assume !(0 != (if ~__CS_ret~0 % 256 % 4294967296 <= 2147483647 then ~__CS_ret~0 % 256 % 4294967296 else ~__CS_ret~0 % 256 % 4294967296 - 4294967296));t2_#t~ret76#1 := dequeue_#res#1;havoc dequeue_#t~mem60#1, dequeue_#t~mem61#1, dequeue_#t~mem62#1, dequeue_#t~post63#1, dequeue_#t~mem64#1, dequeue_#t~mem65#1, dequeue_#t~post66#1, dequeue_~q#1.base, dequeue_~q#1.offset, dequeue_~x~0#1;havoc dequeue_#in~q#1.base, dequeue_#in~q#1.offset;assume { :end_inline_dequeue } true;assume -2147483648 <= t2_#t~ret76#1 && t2_#t~ret76#1 <= 2147483647;call t2_#t~mem77#1 := read~int#7(~#stored_elements~0.base, ~#stored_elements~0.offset + 80 * (if ~__CS_round~0 % 256 % 4294967296 <= 2147483647 then ~__CS_round~0 % 256 % 4294967296 else ~__CS_round~0 % 256 % 4294967296 - 4294967296) + 4 * t2_~i~1#1, 4); [2025-02-07 21:25:15,346 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1036-2: SUMMARY for call __CS_cs(); srcloc: null [2025-02-07 21:25:15,346 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1136: assume -2147483648 <= main_thread_#t~ret86#1 && main_thread_#t~ret86#1 <= 2147483647;havoc main_thread_#t~ret86#1; [2025-02-07 21:25:15,346 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1136-1: SUMMARY for call main_thread_#t~ret86#1 := __CS_pthread_create(main_thread_~#id2~0#1.base, main_thread_~#id2~0#1.offset, 0, 0, #funAddr~t2.base, #funAddr~t2.offset, ~#queue~0.base, ~#queue~0.offset + 92 * (if ~__CS_round~0 % 256 % 4294967296 <= 2147483647 then ~__CS_round~0 % 256 % 4294967296 else ~__CS_round~0 % 256 % 4294967296 - 4294967296)); srcloc: null [2025-02-07 21:25:15,346 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1087-1: assume 0 != (if ~__CS_ret~0 % 256 % 4294967296 <= 2147483647 then ~__CS_ret~0 % 256 % 4294967296 else ~__CS_ret~0 % 256 % 4294967296 - 4294967296);t2_#res#1.base, t2_#res#1.offset := 0, 0; [2025-02-07 21:25:15,346 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1087-1: assume !(0 != (if ~__CS_ret~0 % 256 % 4294967296 <= 2147483647 then ~__CS_ret~0 % 256 % 4294967296 else ~__CS_ret~0 % 256 % 4294967296 - 4294967296)); [2025-02-07 21:25:15,346 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1087-2: SUMMARY for call __CS_cs(); srcloc: null [2025-02-07 21:25:15,346 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1054-1: assume 0 != (if ~__CS_ret~0 % 256 % 4294967296 <= 2147483647 then ~__CS_ret~0 % 256 % 4294967296 else ~__CS_ret~0 % 256 % 4294967296 - 4294967296);t1_#res#1.base, t1_#res#1.offset := 0, 0; [2025-02-07 21:25:15,346 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1054-1: assume !(0 != (if ~__CS_ret~0 % 256 % 4294967296 <= 2147483647 then ~__CS_ret~0 % 256 % 4294967296 else ~__CS_ret~0 % 256 % 4294967296 - 4294967296));call write~int#7(t1_~value~0#1, ~#stored_elements~0.base, ~#stored_elements~0.offset + 80 * (if ~__CS_round~0 % 256 % 4294967296 <= 2147483647 then ~__CS_round~0 % 256 % 4294967296 else ~__CS_round~0 % 256 % 4294967296 - 4294967296) + 4 * t1_~i~0#1, 4); [2025-02-07 21:25:15,346 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1054-2: SUMMARY for call __CS_cs(); srcloc: null [2025-02-07 21:25:15,347 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1137-1: assume 0 != (if ~__CS_ret~0 % 256 % 4294967296 <= 2147483647 then ~__CS_ret~0 % 256 % 4294967296 else ~__CS_ret~0 % 256 % 4294967296 - 4294967296);main_thread_#res#1.base, main_thread_#res#1.offset := 0, 0;call ULTIMATE.dealloc(main_thread_~#id1~0#1.base, main_thread_~#id1~0#1.offset);havoc main_thread_~#id1~0#1.base, main_thread_~#id1~0#1.offset;call ULTIMATE.dealloc(main_thread_~#id2~0#1.base, main_thread_~#id2~0#1.offset);havoc main_thread_~#id2~0#1.base, main_thread_~#id2~0#1.offset; [2025-02-07 21:25:15,347 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1137-1: assume !(0 != (if ~__CS_ret~0 % 256 % 4294967296 <= 2147483647 then ~__CS_ret~0 % 256 % 4294967296 else ~__CS_ret~0 % 256 % 4294967296 - 4294967296));call main_thread_#t~mem87#1 := read~int#17(main_thread_~#id1~0#1.base, main_thread_~#id1~0#1.offset, 1); [2025-02-07 21:25:15,347 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1137-2: SUMMARY for call __CS_cs(); srcloc: null [2025-02-07 21:25:15,347 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1138: assume -2147483648 <= main_thread_#t~ret88#1 && main_thread_#t~ret88#1 <= 2147483647;havoc main_thread_#t~mem87#1;havoc main_thread_#t~ret88#1; [2025-02-07 21:25:15,347 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1138-1: SUMMARY for call main_thread_#t~ret88#1 := __CS_pthread_join(main_thread_#t~mem87#1, 0, 0); srcloc: null [2025-02-07 21:25:15,347 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1089-1: assume 0 != (if ~__CS_ret~0 % 256 % 4294967296 <= 2147483647 then ~__CS_ret~0 % 256 % 4294967296 else ~__CS_ret~0 % 256 % 4294967296 - 4294967296);t2_#res#1.base, t2_#res#1.offset := 0, 0; [2025-02-07 21:25:15,347 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1089-1: assume !(0 != (if ~__CS_ret~0 % 256 % 4294967296 <= 2147483647 then ~__CS_ret~0 % 256 % 4294967296 else ~__CS_ret~0 % 256 % 4294967296 - 4294967296));~__CS_error~0 := 1;~__CS_ret~0 := ~__CS_ret_ERROR~0;~__CS_error_detail~0 := ~__ERR_ERROR_LABEL_REACHED~0;t2_#res#1.base, t2_#res#1.offset := 0, 0; [2025-02-07 21:25:15,347 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L-1: #res#1.base, #res#1.offset := #t~funptrres367#1.base, #t~funptrres367#1.offset;havoc #t~funptrres367#1.base, #t~funptrres367#1.offset;havoc #t~ret368#1.base, #t~ret368#1.offset;havoc #t~ret369#1.base, #t~ret369#1.offset;havoc #t~ret370#1.base, #t~ret370#1.offset; [2025-02-07 21:25:15,347 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1089-2: SUMMARY for call __CS_cs(); srcloc: null [2025-02-07 21:25:15,347 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1056-1: assume 0 != (if ~__CS_ret~0 % 256 % 4294967296 <= 2147483647 then ~__CS_ret~0 % 256 % 4294967296 else ~__CS_ret~0 % 256 % 4294967296 - 4294967296);t1_#res#1.base, t1_#res#1.offset := 0, 0; [2025-02-07 21:25:15,347 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1056-1: assume !(0 != (if ~__CS_ret~0 % 256 % 4294967296 <= 2147483647 then ~__CS_ret~0 % 256 % 4294967296 else ~__CS_ret~0 % 256 % 4294967296 - 4294967296));t1_#t~post71#1 := t1_~i~0#1;t1_~i~0#1 := 1 + t1_#t~post71#1;havoc t1_#t~post71#1; [2025-02-07 21:25:15,347 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1056-2: SUMMARY for call __CS_cs(); srcloc: null [2025-02-07 21:25:15,347 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1139-1: assume 0 != (if ~__CS_ret~0 % 256 % 4294967296 <= 2147483647 then ~__CS_ret~0 % 256 % 4294967296 else ~__CS_ret~0 % 256 % 4294967296 - 4294967296);main_thread_#res#1.base, main_thread_#res#1.offset := 0, 0;call ULTIMATE.dealloc(main_thread_~#id1~0#1.base, main_thread_~#id1~0#1.offset);havoc main_thread_~#id1~0#1.base, main_thread_~#id1~0#1.offset;call ULTIMATE.dealloc(main_thread_~#id2~0#1.base, main_thread_~#id2~0#1.offset);havoc main_thread_~#id2~0#1.base, main_thread_~#id2~0#1.offset; [2025-02-07 21:25:15,348 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1139-1: assume !(0 != (if ~__CS_ret~0 % 256 % 4294967296 <= 2147483647 then ~__CS_ret~0 % 256 % 4294967296 else ~__CS_ret~0 % 256 % 4294967296 - 4294967296));call main_thread_#t~mem89#1 := read~int#17(main_thread_~#id2~0#1.base, main_thread_~#id2~0#1.offset, 1); [2025-02-07 21:25:15,348 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1139-2: SUMMARY for call __CS_cs(); srcloc: null [2025-02-07 21:25:15,348 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1140: assume -2147483648 <= main_thread_#t~ret90#1 && main_thread_#t~ret90#1 <= 2147483647;havoc main_thread_#t~mem89#1;havoc main_thread_#t~ret90#1; [2025-02-07 21:25:15,348 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1140-1: SUMMARY for call main_thread_#t~ret90#1 := __CS_pthread_join(main_thread_#t~mem89#1, 0, 0); srcloc: null [2025-02-07 21:25:15,348 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1091-1: assume 0 != (if ~__CS_ret~0 % 256 % 4294967296 <= 2147483647 then ~__CS_ret~0 % 256 % 4294967296 else ~__CS_ret~0 % 256 % 4294967296 - 4294967296);t2_#res#1.base, t2_#res#1.offset := 0, 0; [2025-02-07 21:25:15,348 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1091-1: assume !(0 != (if ~__CS_ret~0 % 256 % 4294967296 <= 2147483647 then ~__CS_ret~0 % 256 % 4294967296 else ~__CS_ret~0 % 256 % 4294967296 - 4294967296)); [2025-02-07 21:25:15,348 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1091-2: SUMMARY for call __CS_cs(); srcloc: null [2025-02-07 21:25:15,348 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1141-1: assume 0 != (if ~__CS_ret~0 % 256 % 4294967296 <= 2147483647 then ~__CS_ret~0 % 256 % 4294967296 else ~__CS_ret~0 % 256 % 4294967296 - 4294967296);main_thread_#res#1.base, main_thread_#res#1.offset := 0, 0;call ULTIMATE.dealloc(main_thread_~#id1~0#1.base, main_thread_~#id1~0#1.offset);havoc main_thread_~#id1~0#1.base, main_thread_~#id1~0#1.offset;call ULTIMATE.dealloc(main_thread_~#id2~0#1.base, main_thread_~#id2~0#1.offset);havoc main_thread_~#id2~0#1.base, main_thread_~#id2~0#1.offset; [2025-02-07 21:25:15,348 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1141-1: assume !(0 != (if ~__CS_ret~0 % 256 % 4294967296 <= 2147483647 then ~__CS_ret~0 % 256 % 4294967296 else ~__CS_ret~0 % 256 % 4294967296 - 4294967296));call ULTIMATE.dealloc(main_thread_~#id1~0#1.base, main_thread_~#id1~0#1.offset);havoc main_thread_~#id1~0#1.base, main_thread_~#id1~0#1.offset;call ULTIMATE.dealloc(main_thread_~#id2~0#1.base, main_thread_~#id2~0#1.offset);havoc main_thread_~#id2~0#1.base, main_thread_~#id2~0#1.offset;#t~ret370#1.base, #t~ret370#1.offset := main_thread_#res#1.base, main_thread_#res#1.offset;havoc main_thread_#t~nondet80#1, main_thread_#t~nondet81#1, main_thread_#t~ret82#1, main_thread_#t~ret83#1, main_thread_#t~ret84#1, main_thread_#t~ret85#1, main_thread_#t~ret86#1, main_thread_#t~mem87#1, main_thread_#t~ret88#1, main_thread_#t~mem89#1, main_thread_#t~ret90#1, main_thread_~arg#1.base, main_thread_~arg#1.offset, main_thread_~#id1~0#1.base, main_thread_~#id1~0#1.offset, main_thread_~#id2~0#1.base, main_thread_~#id2~0#1.offset;havoc main_thread_#in~arg#1.base, main_thread_#in~arg#1.offset;assume { :end_inline_main_thread } true;#t~funptrres367#1.base, #t~funptrres367#1.offset := #t~ret370#1.base, #t~ret370#1.offset; [2025-02-07 21:25:15,348 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1141-2: SUMMARY for call __CS_cs(); srcloc: null [2025-02-07 21:25:15,348 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1108-1: assume 0 != (if ~__CS_ret~0 % 256 % 4294967296 <= 2147483647 then ~__CS_ret~0 % 256 % 4294967296 else ~__CS_ret~0 % 256 % 4294967296 - 4294967296);t2_#res#1.base, t2_#res#1.offset := 0, 0; [2025-02-07 21:25:15,348 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1108-1: assume !(0 != (if ~__CS_ret~0 % 256 % 4294967296 <= 2147483647 then ~__CS_ret~0 % 256 % 4294967296 else ~__CS_ret~0 % 256 % 4294967296 - 4294967296));#t~ret369#1.base, #t~ret369#1.offset := t2_#res#1.base, t2_#res#1.offset;havoc t2_#t~ret73#1, t2_#t~mem74#1, t2_#t~ret75#1, t2_#t~ret76#1, t2_#t~mem77#1, t2_#t~post78#1, t2_#t~ret79#1, t2_~arg#1.base, t2_~arg#1.offset, t2_~i~1#1;havoc t2_#in~arg#1.base, t2_#in~arg#1.offset;assume { :end_inline_t2 } true;#t~funptrres367#1.base, #t~funptrres367#1.offset := #t~ret369#1.base, #t~ret369#1.offset; [2025-02-07 21:25:15,349 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1108-2: SUMMARY for call __CS_cs(); srcloc: null [2025-02-07 21:25:15,349 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1125-1: assume 0 != (if ~__CS_ret~0 % 256 % 4294967296 <= 2147483647 then ~__CS_ret~0 % 256 % 4294967296 else ~__CS_ret~0 % 256 % 4294967296 - 4294967296);main_thread_#res#1.base, main_thread_#res#1.offset := 0, 0;call ULTIMATE.dealloc(main_thread_~#id1~0#1.base, main_thread_~#id1~0#1.offset);havoc main_thread_~#id1~0#1.base, main_thread_~#id1~0#1.offset;call ULTIMATE.dealloc(main_thread_~#id2~0#1.base, main_thread_~#id2~0#1.offset);havoc main_thread_~#id2~0#1.base, main_thread_~#id2~0#1.offset; [2025-02-07 21:25:15,349 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1125-1: assume !(0 != (if ~__CS_ret~0 % 256 % 4294967296 <= 2147483647 then ~__CS_ret~0 % 256 % 4294967296 else ~__CS_ret~0 % 256 % 4294967296 - 4294967296));~__CS_error~0 := 1;~__CS_ret~0 := ~__CS_ret_ERROR~0;~__CS_error_detail~0 := ~__ERR_ERROR_LABEL_REACHED~0;main_thread_#res#1.base, main_thread_#res#1.offset := 0, 0;call ULTIMATE.dealloc(main_thread_~#id1~0#1.base, main_thread_~#id1~0#1.offset);havoc main_thread_~#id1~0#1.base, main_thread_~#id1~0#1.offset;call ULTIMATE.dealloc(main_thread_~#id2~0#1.base, main_thread_~#id2~0#1.offset);havoc main_thread_~#id2~0#1.base, main_thread_~#id2~0#1.offset; [2025-02-07 21:25:15,349 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1125-2: SUMMARY for call __CS_cs(); srcloc: null [2025-02-07 21:25:19,950 INFO L? ?]: Removed 178 outVars from TransFormulas that were not future-live. [2025-02-07 21:25:19,951 INFO L308 CfgBuilder]: Performing block encoding [2025-02-07 21:25:19,966 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-07 21:25:19,966 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-07 21:25:19,966 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 07.02 09:25:19 BoogieIcfgContainer [2025-02-07 21:25:19,966 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-07 21:25:19,970 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-07 21:25:19,970 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-07 21:25:19,974 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-07 21:25:19,974 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.02 09:25:13" (1/3) ... [2025-02-07 21:25:19,975 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6baf8d2f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.02 09:25:19, skipping insertion in model container [2025-02-07 21:25:19,975 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 09:25:14" (2/3) ... [2025-02-07 21:25:19,975 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6baf8d2f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.02 09:25:19, skipping insertion in model container [2025-02-07 21:25:19,975 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 07.02 09:25:19" (3/3) ... [2025-02-07 21:25:19,976 INFO L128 eAbstractionObserver]: Analyzing ICFG cs_queue-1.i [2025-02-07 21:25:19,988 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-07 21:25:19,991 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG cs_queue-1.i that has 10 procedures, 306 locations, 1 initial locations, 6 loop locations, and 1 error locations. [2025-02-07 21:25:20,044 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-07 21:25:20,056 INFO L333 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@8ed392d, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-07 21:25:20,056 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-02-07 21:25:20,061 INFO L276 IsEmpty]: Start isEmpty. Operand has 295 states, 159 states have (on average 1.4779874213836477) internal successors, (235), 168 states have internal predecessors, (235), 119 states have call successors, (119), 7 states have call predecessors, (119), 6 states have return successors, (116), 116 states have call predecessors, (116), 116 states have call successors, (116) [2025-02-07 21:25:20,093 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 325 [2025-02-07 21:25:20,093 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 21:25:20,094 INFO L218 NwaCegarLoop]: trace histogram [52, 52, 52, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-07 21:25:20,094 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 21:25:20,098 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 21:25:20,100 INFO L85 PathProgramCache]: Analyzing trace with hash 522508778, now seen corresponding path program 1 times [2025-02-07 21:25:20,105 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 21:25:20,106 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [172906246] [2025-02-07 21:25:20,106 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 21:25:20,107 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 21:25:20,594 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 324 statements into 1 equivalence classes. [2025-02-07 21:25:20,726 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 324 of 324 statements. [2025-02-07 21:25:20,726 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 21:25:20,726 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 21:25:21,232 INFO L134 CoverageAnalysis]: Checked inductivity of 5304 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5304 trivial. 0 not checked. [2025-02-07 21:25:21,233 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 21:25:21,233 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [172906246] [2025-02-07 21:25:21,234 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [172906246] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 21:25:21,234 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 21:25:21,235 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-07 21:25:21,236 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [646654262] [2025-02-07 21:25:21,236 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 21:25:21,240 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-07 21:25:21,241 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 21:25:21,258 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-07 21:25:21,258 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-07 21:25:21,260 INFO L87 Difference]: Start difference. First operand has 295 states, 159 states have (on average 1.4779874213836477) internal successors, (235), 168 states have internal predecessors, (235), 119 states have call successors, (119), 7 states have call predecessors, (119), 6 states have return successors, (116), 116 states have call predecessors, (116), 116 states have call successors, (116) Second operand has 3 states, 3 states have (on average 22.0) internal successors, (66), 3 states have internal predecessors, (66), 1 states have call successors, (53), 2 states have call predecessors, (53), 1 states have return successors, (52), 1 states have call predecessors, (52), 1 states have call successors, (52) [2025-02-07 21:25:25,320 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-02-07 21:25:25,438 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 21:25:25,438 INFO L93 Difference]: Finished difference Result 568 states and 1024 transitions. [2025-02-07 21:25:25,439 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-07 21:25:25,440 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 22.0) internal successors, (66), 3 states have internal predecessors, (66), 1 states have call successors, (53), 2 states have call predecessors, (53), 1 states have return successors, (52), 1 states have call predecessors, (52), 1 states have call successors, (52) Word has length 324 [2025-02-07 21:25:25,441 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 21:25:25,446 INFO L225 Difference]: With dead ends: 568 [2025-02-07 21:25:25,446 INFO L226 Difference]: Without dead ends: 136 [2025-02-07 21:25:25,451 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-07 21:25:25,453 INFO L435 NwaCegarLoop]: 447 mSDtfsCounter, 6 mSDsluCounter, 444 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 0 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 891 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.1s IncrementalHoareTripleChecker+Time [2025-02-07 21:25:25,454 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 891 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 11 Invalid, 1 Unknown, 0 Unchecked, 4.1s Time] [2025-02-07 21:25:25,465 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 136 states. [2025-02-07 21:25:25,488 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 136 to 133. [2025-02-07 21:25:25,489 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 133 states, 71 states have (on average 1.0704225352112675) internal successors, (76), 72 states have internal predecessors, (76), 59 states have call successors, (59), 2 states have call predecessors, (59), 2 states have return successors, (58), 58 states have call predecessors, (58), 58 states have call successors, (58) [2025-02-07 21:25:25,492 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133 states to 133 states and 193 transitions. [2025-02-07 21:25:25,494 INFO L78 Accepts]: Start accepts. Automaton has 133 states and 193 transitions. Word has length 324 [2025-02-07 21:25:25,494 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 21:25:25,494 INFO L471 AbstractCegarLoop]: Abstraction has 133 states and 193 transitions. [2025-02-07 21:25:25,494 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 22.0) internal successors, (66), 3 states have internal predecessors, (66), 1 states have call successors, (53), 2 states have call predecessors, (53), 1 states have return successors, (52), 1 states have call predecessors, (52), 1 states have call successors, (52) [2025-02-07 21:25:25,494 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 193 transitions. [2025-02-07 21:25:25,498 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 329 [2025-02-07 21:25:25,498 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 21:25:25,498 INFO L218 NwaCegarLoop]: trace histogram [52, 52, 52, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-07 21:25:25,498 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-02-07 21:25:25,499 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 21:25:25,499 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 21:25:25,499 INFO L85 PathProgramCache]: Analyzing trace with hash 173824890, now seen corresponding path program 1 times [2025-02-07 21:25:25,499 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 21:25:25,500 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1821022442] [2025-02-07 21:25:25,500 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 21:25:25,500 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 21:25:25,837 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 328 statements into 1 equivalence classes. [2025-02-07 21:25:25,870 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 328 of 328 statements. [2025-02-07 21:25:25,872 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 21:25:25,872 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 21:25:26,128 INFO L134 CoverageAnalysis]: Checked inductivity of 5305 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 5304 trivial. 0 not checked. [2025-02-07 21:25:26,129 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 21:25:26,129 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1821022442] [2025-02-07 21:25:26,129 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1821022442] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 21:25:26,129 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 21:25:26,129 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-07 21:25:26,129 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [533309360] [2025-02-07 21:25:26,129 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 21:25:26,130 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-07 21:25:26,131 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 21:25:26,131 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-07 21:25:26,131 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-07 21:25:26,131 INFO L87 Difference]: Start difference. First operand 133 states and 193 transitions. Second operand has 3 states, 3 states have (on average 23.333333333333332) internal successors, (70), 3 states have internal predecessors, (70), 1 states have call successors, (53), 2 states have call predecessors, (53), 1 states have return successors, (52), 1 states have call predecessors, (52), 1 states have call successors, (52) [2025-02-07 21:25:26,214 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 21:25:26,217 INFO L93 Difference]: Finished difference Result 267 states and 390 transitions. [2025-02-07 21:25:26,217 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-07 21:25:26,218 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 23.333333333333332) internal successors, (70), 3 states have internal predecessors, (70), 1 states have call successors, (53), 2 states have call predecessors, (53), 1 states have return successors, (52), 1 states have call predecessors, (52), 1 states have call successors, (52) Word has length 328 [2025-02-07 21:25:26,218 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 21:25:26,219 INFO L225 Difference]: With dead ends: 267 [2025-02-07 21:25:26,219 INFO L226 Difference]: Without dead ends: 136 [2025-02-07 21:25:26,220 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-07 21:25:26,220 INFO L435 NwaCegarLoop]: 189 mSDtfsCounter, 0 mSDsluCounter, 184 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 373 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-07 21:25:26,221 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 373 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-07 21:25:26,221 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 136 states. [2025-02-07 21:25:26,230 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 136 to 136. [2025-02-07 21:25:26,231 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 136 states, 74 states have (on average 1.0675675675675675) internal successors, (79), 75 states have internal predecessors, (79), 59 states have call successors, (59), 2 states have call predecessors, (59), 2 states have return successors, (58), 58 states have call predecessors, (58), 58 states have call successors, (58) [2025-02-07 21:25:26,232 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 136 states to 136 states and 196 transitions. [2025-02-07 21:25:26,232 INFO L78 Accepts]: Start accepts. Automaton has 136 states and 196 transitions. Word has length 328 [2025-02-07 21:25:26,232 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 21:25:26,233 INFO L471 AbstractCegarLoop]: Abstraction has 136 states and 196 transitions. [2025-02-07 21:25:26,233 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 23.333333333333332) internal successors, (70), 3 states have internal predecessors, (70), 1 states have call successors, (53), 2 states have call predecessors, (53), 1 states have return successors, (52), 1 states have call predecessors, (52), 1 states have call successors, (52) [2025-02-07 21:25:26,233 INFO L276 IsEmpty]: Start isEmpty. Operand 136 states and 196 transitions. [2025-02-07 21:25:26,235 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 332 [2025-02-07 21:25:26,235 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 21:25:26,235 INFO L218 NwaCegarLoop]: trace histogram [52, 52, 52, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-07 21:25:26,235 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-02-07 21:25:26,236 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 21:25:26,237 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 21:25:26,239 INFO L85 PathProgramCache]: Analyzing trace with hash 130826310, now seen corresponding path program 1 times [2025-02-07 21:25:26,239 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 21:25:26,239 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [774194743] [2025-02-07 21:25:26,240 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 21:25:26,240 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 21:25:26,568 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 331 statements into 1 equivalence classes. [2025-02-07 21:25:26,590 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 331 of 331 statements. [2025-02-07 21:25:26,590 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 21:25:26,591 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 21:25:26,967 INFO L134 CoverageAnalysis]: Checked inductivity of 5308 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 5306 trivial. 0 not checked. [2025-02-07 21:25:26,968 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 21:25:26,968 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [774194743] [2025-02-07 21:25:26,968 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [774194743] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-07 21:25:26,968 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1179166101] [2025-02-07 21:25:26,968 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 21:25:26,968 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-07 21:25:26,968 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-07 21:25:26,970 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-07 21:25:26,972 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-02-07 21:25:27,616 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 331 statements into 1 equivalence classes. [2025-02-07 21:25:27,852 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 331 of 331 statements. [2025-02-07 21:25:27,852 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 21:25:27,852 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 21:25:27,861 INFO L256 TraceCheckSpWp]: Trace formula consists of 2088 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-02-07 21:25:27,872 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-07 21:25:27,928 INFO L134 CoverageAnalysis]: Checked inductivity of 5308 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 5306 trivial. 0 not checked. [2025-02-07 21:25:27,929 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-07 21:25:28,436 INFO L134 CoverageAnalysis]: Checked inductivity of 5308 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 5306 trivial. 0 not checked. [2025-02-07 21:25:28,436 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1179166101] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-07 21:25:28,436 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-07 21:25:28,436 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 7 [2025-02-07 21:25:28,436 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1607228572] [2025-02-07 21:25:28,436 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-07 21:25:28,437 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-07 21:25:28,437 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 21:25:28,438 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-07 21:25:28,438 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2025-02-07 21:25:28,439 INFO L87 Difference]: Start difference. First operand 136 states and 196 transitions. Second operand has 7 states, 7 states have (on average 11.571428571428571) internal successors, (81), 7 states have internal predecessors, (81), 1 states have call successors, (105), 2 states have call predecessors, (105), 2 states have return successors, (104), 1 states have call predecessors, (104), 1 states have call successors, (104) [2025-02-07 21:25:28,574 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 21:25:28,574 INFO L93 Difference]: Finished difference Result 277 states and 404 transitions. [2025-02-07 21:25:28,577 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-07 21:25:28,578 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 11.571428571428571) internal successors, (81), 7 states have internal predecessors, (81), 1 states have call successors, (105), 2 states have call predecessors, (105), 2 states have return successors, (104), 1 states have call predecessors, (104), 1 states have call successors, (104) Word has length 331 [2025-02-07 21:25:28,578 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 21:25:28,579 INFO L225 Difference]: With dead ends: 277 [2025-02-07 21:25:28,579 INFO L226 Difference]: Without dead ends: 143 [2025-02-07 21:25:28,580 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 664 GetRequests, 659 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2025-02-07 21:25:28,580 INFO L435 NwaCegarLoop]: 188 mSDtfsCounter, 0 mSDsluCounter, 184 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 372 SdHoareTripleChecker+Invalid, 38 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-07 21:25:28,582 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 372 Invalid, 38 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-07 21:25:28,582 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 143 states. [2025-02-07 21:25:28,596 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 143 to 143. [2025-02-07 21:25:28,596 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 143 states, 81 states have (on average 1.0617283950617284) internal successors, (86), 82 states have internal predecessors, (86), 59 states have call successors, (59), 2 states have call predecessors, (59), 2 states have return successors, (58), 58 states have call predecessors, (58), 58 states have call successors, (58) [2025-02-07 21:25:28,598 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 143 states to 143 states and 203 transitions. [2025-02-07 21:25:28,598 INFO L78 Accepts]: Start accepts. Automaton has 143 states and 203 transitions. Word has length 331 [2025-02-07 21:25:28,598 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 21:25:28,599 INFO L471 AbstractCegarLoop]: Abstraction has 143 states and 203 transitions. [2025-02-07 21:25:28,599 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 11.571428571428571) internal successors, (81), 7 states have internal predecessors, (81), 1 states have call successors, (105), 2 states have call predecessors, (105), 2 states have return successors, (104), 1 states have call predecessors, (104), 1 states have call successors, (104) [2025-02-07 21:25:28,600 INFO L276 IsEmpty]: Start isEmpty. Operand 143 states and 203 transitions. [2025-02-07 21:25:28,604 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 339 [2025-02-07 21:25:28,604 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 21:25:28,604 INFO L218 NwaCegarLoop]: trace histogram [52, 52, 52, 4, 4, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-07 21:25:28,615 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-02-07 21:25:28,805 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-07 21:25:28,805 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 21:25:28,805 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 21:25:28,806 INFO L85 PathProgramCache]: Analyzing trace with hash 1197875962, now seen corresponding path program 2 times [2025-02-07 21:25:28,806 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 21:25:28,806 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1490972314] [2025-02-07 21:25:28,806 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-07 21:25:28,806 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 21:25:29,080 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 338 statements into 2 equivalence classes. [2025-02-07 21:25:29,131 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 18 of 338 statements. [2025-02-07 21:25:29,131 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-02-07 21:25:29,131 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 21:25:29,536 INFO L134 CoverageAnalysis]: Checked inductivity of 5328 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5328 trivial. 0 not checked. [2025-02-07 21:25:29,536 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 21:25:29,536 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1490972314] [2025-02-07 21:25:29,536 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1490972314] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 21:25:29,536 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 21:25:29,536 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-07 21:25:29,536 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1585890061] [2025-02-07 21:25:29,536 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 21:25:29,539 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-07 21:25:29,539 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 21:25:29,539 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-07 21:25:29,540 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-07 21:25:29,540 INFO L87 Difference]: Start difference. First operand 143 states and 203 transitions. Second operand has 5 states, 5 states have (on average 14.6) internal successors, (73), 4 states have internal predecessors, (73), 1 states have call successors, (53), 2 states have call predecessors, (53), 1 states have return successors, (52), 1 states have call predecessors, (52), 1 states have call successors, (52) [2025-02-07 21:25:29,718 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 21:25:29,718 INFO L93 Difference]: Finished difference Result 149 states and 208 transitions. [2025-02-07 21:25:29,719 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-07 21:25:29,719 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 14.6) internal successors, (73), 4 states have internal predecessors, (73), 1 states have call successors, (53), 2 states have call predecessors, (53), 1 states have return successors, (52), 1 states have call predecessors, (52), 1 states have call successors, (52) Word has length 338 [2025-02-07 21:25:29,720 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 21:25:29,721 INFO L225 Difference]: With dead ends: 149 [2025-02-07 21:25:29,721 INFO L226 Difference]: Without dead ends: 147 [2025-02-07 21:25:29,721 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-02-07 21:25:29,722 INFO L435 NwaCegarLoop]: 184 mSDtfsCounter, 78 mSDsluCounter, 355 mSDsCounter, 0 mSdLazyCounter, 36 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 79 SdHoareTripleChecker+Valid, 539 SdHoareTripleChecker+Invalid, 36 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 36 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-07 21:25:29,722 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [79 Valid, 539 Invalid, 36 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 36 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-07 21:25:29,722 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 147 states. [2025-02-07 21:25:29,733 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 147 to 147. [2025-02-07 21:25:29,733 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 147 states, 84 states have (on average 1.0595238095238095) internal successors, (89), 85 states have internal predecessors, (89), 59 states have call successors, (59), 3 states have call predecessors, (59), 3 states have return successors, (58), 58 states have call predecessors, (58), 58 states have call successors, (58) [2025-02-07 21:25:29,734 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 147 states to 147 states and 206 transitions. [2025-02-07 21:25:29,735 INFO L78 Accepts]: Start accepts. Automaton has 147 states and 206 transitions. Word has length 338 [2025-02-07 21:25:29,735 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 21:25:29,735 INFO L471 AbstractCegarLoop]: Abstraction has 147 states and 206 transitions. [2025-02-07 21:25:29,736 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 14.6) internal successors, (73), 4 states have internal predecessors, (73), 1 states have call successors, (53), 2 states have call predecessors, (53), 1 states have return successors, (52), 1 states have call predecessors, (52), 1 states have call successors, (52) [2025-02-07 21:25:29,736 INFO L276 IsEmpty]: Start isEmpty. Operand 147 states and 206 transitions. [2025-02-07 21:25:29,738 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 344 [2025-02-07 21:25:29,738 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 21:25:29,738 INFO L218 NwaCegarLoop]: trace histogram [52, 52, 52, 4, 4, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-07 21:25:29,739 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-02-07 21:25:29,739 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 21:25:29,739 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 21:25:29,739 INFO L85 PathProgramCache]: Analyzing trace with hash 2117887753, now seen corresponding path program 1 times [2025-02-07 21:25:29,739 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 21:25:29,739 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1941947820] [2025-02-07 21:25:29,739 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 21:25:29,740 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 21:25:30,038 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 343 statements into 1 equivalence classes. [2025-02-07 21:25:30,068 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 343 of 343 statements. [2025-02-07 21:25:30,069 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 21:25:30,069 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 21:25:30,353 INFO L134 CoverageAnalysis]: Checked inductivity of 5330 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 5327 trivial. 0 not checked. [2025-02-07 21:25:30,353 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 21:25:30,353 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1941947820] [2025-02-07 21:25:30,353 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1941947820] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-07 21:25:30,353 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [844758480] [2025-02-07 21:25:30,353 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 21:25:30,353 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-07 21:25:30,354 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-07 21:25:30,356 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-07 21:25:30,357 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-02-07 21:25:31,116 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 343 statements into 1 equivalence classes. [2025-02-07 21:25:31,353 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 343 of 343 statements. [2025-02-07 21:25:31,353 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 21:25:31,353 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 21:25:31,362 INFO L256 TraceCheckSpWp]: Trace formula consists of 2226 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-02-07 21:25:31,373 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-07 21:25:31,499 INFO L134 CoverageAnalysis]: Checked inductivity of 5330 backedges. 1 proven. 10 refuted. 0 times theorem prover too weak. 5319 trivial. 0 not checked. [2025-02-07 21:25:31,499 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-07 21:25:32,223 INFO L134 CoverageAnalysis]: Checked inductivity of 5330 backedges. 3 proven. 10 refuted. 0 times theorem prover too weak. 5317 trivial. 0 not checked. [2025-02-07 21:25:32,223 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [844758480] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-07 21:25:32,224 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-07 21:25:32,224 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 7, 7] total 14 [2025-02-07 21:25:32,224 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [848227542] [2025-02-07 21:25:32,224 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-07 21:25:32,225 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-02-07 21:25:32,225 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 21:25:32,226 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-02-07 21:25:32,226 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=111, Unknown=0, NotChecked=0, Total=182 [2025-02-07 21:25:32,226 INFO L87 Difference]: Start difference. First operand 147 states and 206 transitions. Second operand has 14 states, 14 states have (on average 7.071428571428571) internal successors, (99), 14 states have internal predecessors, (99), 1 states have call successors, (107), 2 states have call predecessors, (107), 2 states have return successors, (106), 1 states have call predecessors, (106), 1 states have call successors, (106) [2025-02-07 21:25:37,176 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-02-07 21:25:41,186 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-02-07 21:25:41,221 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 21:25:41,222 INFO L93 Difference]: Finished difference Result 332 states and 480 transitions. [2025-02-07 21:25:41,222 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2025-02-07 21:25:41,223 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 7.071428571428571) internal successors, (99), 14 states have internal predecessors, (99), 1 states have call successors, (107), 2 states have call predecessors, (107), 2 states have return successors, (106), 1 states have call predecessors, (106), 1 states have call successors, (106) Word has length 343 [2025-02-07 21:25:41,223 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 21:25:41,224 INFO L225 Difference]: With dead ends: 332 [2025-02-07 21:25:41,224 INFO L226 Difference]: Without dead ends: 187 [2025-02-07 21:25:41,225 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 708 GetRequests, 676 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 212 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=396, Invalid=726, Unknown=0, NotChecked=0, Total=1122 [2025-02-07 21:25:41,228 INFO L435 NwaCegarLoop]: 186 mSDtfsCounter, 29 mSDsluCounter, 920 mSDsCounter, 0 mSdLazyCounter, 44 mSolverCounterSat, 83 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 8.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 29 SdHoareTripleChecker+Valid, 1106 SdHoareTripleChecker+Invalid, 129 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 83 IncrementalHoareTripleChecker+Valid, 44 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 8.4s IncrementalHoareTripleChecker+Time [2025-02-07 21:25:41,228 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [29 Valid, 1106 Invalid, 129 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [83 Valid, 44 Invalid, 2 Unknown, 0 Unchecked, 8.4s Time] [2025-02-07 21:25:41,229 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 187 states. [2025-02-07 21:25:41,255 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 187 to 187. [2025-02-07 21:25:41,256 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 187 states, 124 states have (on average 1.064516129032258) internal successors, (132), 125 states have internal predecessors, (132), 59 states have call successors, (59), 3 states have call predecessors, (59), 3 states have return successors, (58), 58 states have call predecessors, (58), 58 states have call successors, (58) [2025-02-07 21:25:41,257 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 187 states to 187 states and 249 transitions. [2025-02-07 21:25:41,258 INFO L78 Accepts]: Start accepts. Automaton has 187 states and 249 transitions. Word has length 343 [2025-02-07 21:25:41,258 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 21:25:41,258 INFO L471 AbstractCegarLoop]: Abstraction has 187 states and 249 transitions. [2025-02-07 21:25:41,258 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 7.071428571428571) internal successors, (99), 14 states have internal predecessors, (99), 1 states have call successors, (107), 2 states have call predecessors, (107), 2 states have return successors, (106), 1 states have call predecessors, (106), 1 states have call successors, (106) [2025-02-07 21:25:41,258 INFO L276 IsEmpty]: Start isEmpty. Operand 187 states and 249 transitions. [2025-02-07 21:25:41,263 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 384 [2025-02-07 21:25:41,263 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 21:25:41,263 INFO L218 NwaCegarLoop]: trace histogram [52, 52, 52, 20, 20, 6, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-07 21:25:41,275 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-02-07 21:25:41,464 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-07 21:25:41,464 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 21:25:41,465 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 21:25:41,465 INFO L85 PathProgramCache]: Analyzing trace with hash -276013107, now seen corresponding path program 2 times [2025-02-07 21:25:41,465 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 21:25:41,465 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [19158224] [2025-02-07 21:25:41,465 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-07 21:25:41,465 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 21:25:41,778 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 383 statements into 2 equivalence classes. [2025-02-07 21:25:41,831 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 18 of 383 statements. [2025-02-07 21:25:41,831 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-02-07 21:25:41,831 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 21:25:42,134 INFO L134 CoverageAnalysis]: Checked inductivity of 5799 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 5797 trivial. 0 not checked. [2025-02-07 21:25:42,135 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 21:25:42,135 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [19158224] [2025-02-07 21:25:42,135 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [19158224] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 21:25:42,135 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 21:25:42,135 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-07 21:25:42,135 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1001932159] [2025-02-07 21:25:42,135 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 21:25:42,135 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-07 21:25:42,136 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 21:25:42,136 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-07 21:25:42,136 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-07 21:25:42,136 INFO L87 Difference]: Start difference. First operand 187 states and 249 transitions. Second operand has 3 states, 3 states have (on average 25.333333333333332) internal successors, (76), 3 states have internal predecessors, (76), 1 states have call successors, (54), 2 states have call predecessors, (54), 1 states have return successors, (53), 1 states have call predecessors, (53), 1 states have call successors, (53) [2025-02-07 21:25:42,162 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 21:25:42,162 INFO L93 Difference]: Finished difference Result 187 states and 249 transitions. [2025-02-07 21:25:42,166 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-07 21:25:42,166 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 25.333333333333332) internal successors, (76), 3 states have internal predecessors, (76), 1 states have call successors, (54), 2 states have call predecessors, (54), 1 states have return successors, (53), 1 states have call predecessors, (53), 1 states have call successors, (53) Word has length 383 [2025-02-07 21:25:42,166 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 21:25:42,167 INFO L225 Difference]: With dead ends: 187 [2025-02-07 21:25:42,167 INFO L226 Difference]: Without dead ends: 0 [2025-02-07 21:25:42,167 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-07 21:25:42,168 INFO L435 NwaCegarLoop]: 9 mSDtfsCounter, 0 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 1 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 16 SdHoareTripleChecker+Invalid, 1 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 1 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-07 21:25:42,168 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 16 Invalid, 1 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 1 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-07 21:25:42,168 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2025-02-07 21:25:42,168 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2025-02-07 21:25:42,168 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 21:25:42,168 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2025-02-07 21:25:42,168 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 383 [2025-02-07 21:25:42,168 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 21:25:42,168 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-02-07 21:25:42,169 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 25.333333333333332) internal successors, (76), 3 states have internal predecessors, (76), 1 states have call successors, (54), 2 states have call predecessors, (54), 1 states have return successors, (53), 1 states have call predecessors, (53), 1 states have call successors, (53) [2025-02-07 21:25:42,169 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2025-02-07 21:25:42,169 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2025-02-07 21:25:42,171 INFO L782 garLoopResultBuilder]: Registering result SAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-02-07 21:25:42,171 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-02-07 21:25:42,173 INFO L422 BasicCegarLoop]: Path program histogram: [2, 2, 1, 1] [2025-02-07 21:25:42,175 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2025-02-07 21:25:42,925 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-02-07 21:25:42,936 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.02 09:25:42 BoogieIcfgContainer [2025-02-07 21:25:42,937 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-02-07 21:25:42,937 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-02-07 21:25:42,937 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-02-07 21:25:42,937 INFO L274 PluginConnector]: Witness Printer initialized [2025-02-07 21:25:42,938 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 07.02 09:25:19" (3/4) ... [2025-02-07 21:25:42,939 INFO L146 WitnessPrinter]: Generating witness for correct program [2025-02-07 21:25:42,943 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure __CS_pthread_join [2025-02-07 21:25:42,943 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure __CS_pthread_mutex_lock [2025-02-07 21:25:42,943 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure __CS_pthread_mutex_unlock [2025-02-07 21:25:42,944 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure ##fun~$Pointer$~TO~$Pointer$ [2025-02-07 21:25:42,944 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure __CS_pthread_create [2025-02-07 21:25:42,944 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure assume_abort_if_not [2025-02-07 21:25:42,944 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure __VERIFIER_assert [2025-02-07 21:25:42,944 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure __CS_cs [2025-02-07 21:25:42,944 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure empty [2025-02-07 21:25:42,960 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 45 nodes and edges [2025-02-07 21:25:42,961 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 15 nodes and edges [2025-02-07 21:25:42,962 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 7 nodes and edges [2025-02-07 21:25:42,963 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2025-02-07 21:25:42,964 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2025-02-07 21:25:43,079 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-02-07 21:25:43,079 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.yml [2025-02-07 21:25:43,079 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-02-07 21:25:43,081 INFO L158 Benchmark]: Toolchain (without parser) took 29467.97ms. Allocated memory was 142.6MB in the beginning and 947.9MB in the end (delta: 805.3MB). Free memory was 110.1MB in the beginning and 434.7MB in the end (delta: -324.6MB). Peak memory consumption was 478.2MB. Max. memory is 16.1GB. [2025-02-07 21:25:43,081 INFO L158 Benchmark]: CDTParser took 0.26ms. Allocated memory is still 201.3MB. Free memory is still 123.5MB. There was no memory consumed. Max. memory is 16.1GB. [2025-02-07 21:25:43,082 INFO L158 Benchmark]: CACSL2BoogieTranslator took 596.50ms. Allocated memory is still 142.6MB. Free memory was 109.6MB in the beginning and 64.6MB in the end (delta: 45.0MB). Peak memory consumption was 50.3MB. Max. memory is 16.1GB. [2025-02-07 21:25:43,082 INFO L158 Benchmark]: Boogie Procedure Inliner took 111.05ms. Allocated memory is still 142.6MB. Free memory was 64.6MB in the beginning and 54.3MB in the end (delta: 10.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-02-07 21:25:43,082 INFO L158 Benchmark]: Boogie Preprocessor took 136.68ms. Allocated memory is still 142.6MB. Free memory was 54.3MB in the beginning and 41.1MB in the end (delta: 13.2MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-02-07 21:25:43,082 INFO L158 Benchmark]: IcfgBuilder took 5506.82ms. Allocated memory was 142.6MB in the beginning and 377.5MB in the end (delta: 234.9MB). Free memory was 41.1MB in the beginning and 270.2MB in the end (delta: -229.1MB). Peak memory consumption was 29.1MB. Max. memory is 16.1GB. [2025-02-07 21:25:43,083 INFO L158 Benchmark]: TraceAbstraction took 22966.69ms. Allocated memory was 377.5MB in the beginning and 947.9MB in the end (delta: 570.4MB). Free memory was 269.0MB in the beginning and 455.4MB in the end (delta: -186.3MB). Peak memory consumption was 380.5MB. Max. memory is 16.1GB. [2025-02-07 21:25:43,083 INFO L158 Benchmark]: Witness Printer took 142.34ms. Allocated memory is still 947.9MB. Free memory was 455.4MB in the beginning and 434.7MB in the end (delta: 20.7MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-02-07 21:25:43,085 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.26ms. Allocated memory is still 201.3MB. Free memory is still 123.5MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 596.50ms. Allocated memory is still 142.6MB. Free memory was 109.6MB in the beginning and 64.6MB in the end (delta: 45.0MB). Peak memory consumption was 50.3MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 111.05ms. Allocated memory is still 142.6MB. Free memory was 64.6MB in the beginning and 54.3MB in the end (delta: 10.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 136.68ms. Allocated memory is still 142.6MB. Free memory was 54.3MB in the beginning and 41.1MB in the end (delta: 13.2MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * IcfgBuilder took 5506.82ms. Allocated memory was 142.6MB in the beginning and 377.5MB in the end (delta: 234.9MB). Free memory was 41.1MB in the beginning and 270.2MB in the end (delta: -229.1MB). Peak memory consumption was 29.1MB. Max. memory is 16.1GB. * TraceAbstraction took 22966.69ms. Allocated memory was 377.5MB in the beginning and 947.9MB in the end (delta: 570.4MB). Free memory was 269.0MB in the beginning and 455.4MB in the end (delta: -186.3MB). Peak memory consumption was 380.5MB. Max. memory is 16.1GB. * Witness Printer took 142.34ms. Allocated memory is still 947.9MB. Free memory was 455.4MB in the beginning and 434.7MB in the end (delta: 20.7MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 779]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 10 procedures, 306 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 22.1s, OverallIterations: 6, TraceHistogramMax: 52, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.1s, AutomataDifference: 13.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 3 mSolverCounterUnknown, 114 SdHoareTripleChecker+Valid, 12.8s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 113 mSDsluCounter, 3297 SdHoareTripleChecker+Invalid, 12.7s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 2094 mSDsCounter, 109 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 116 IncrementalHoareTripleChecker+Invalid, 228 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 109 mSolverCounterUnsat, 1203 mSDtfsCounter, 116 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1388 GetRequests, 1343 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 216 ImplicationChecksByTransitivity, 1.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=295occurred in iteration=0, InterpolantAutomatonStates: 44, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 6 MinimizatonAttempts, 3 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.3s SsaConstructionTime, 0.8s SatisfiabilityAnalysisTime, 3.6s InterpolantComputationTime, 2721 NumberOfCodeBlocks, 2036 NumberOfCodeBlocksAsserted, 8 NumberOfCheckSat, 3385 ConstructedInterpolants, 0 QuantifiedInterpolants, 4215 SizeOfPredicates, 0 NumberOfNonLiveVariables, 4314 ConjunctsInSsa, 9 ConjunctsInUnsatCore, 10 InterpolantComputations, 4 PerfectInterpolantSequences, 53626/53650 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 1153]: Location Invariant Derived location invariant: ((__CS_error_detail == 0) && (__ERR_MAXTHREADS_REACHED == 1)) - InvariantResult [Line: 1160]: Location Invariant Derived location invariant: (((__CS_error_detail == 0) && (i <= 1)) && (__ERR_MAXTHREADS_REACHED == 1)) - InvariantResult [Line: 1167]: Location Invariant Derived location invariant: (((__CS_error_detail == 0) && (i <= 1)) && (__ERR_MAXTHREADS_REACHED == 1)) - InvariantResult [Line: 1163]: Location Invariant Derived location invariant: ((((__CS_error_detail == 0) && (i <= 1)) && (__ERR_MAXTHREADS_REACHED == 1)) && (j <= 3)) RESULT: Ultimate proved your program to be correct! [2025-02-07 21:25:43,126 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE