./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/pthread-ext/08_rand_cas.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/pthread-ext/08_rand_cas.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 111430583c5cad5728291a83d9964586feec908088fcc502d1f1ab24d409725c --- Real Ultimate output --- This is Ultimate 0.3.0-?-48c9605-m [2025-02-08 00:55:34,344 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-08 00:55:34,420 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-02-08 00:55:34,424 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-08 00:55:34,425 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-08 00:55:34,454 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-08 00:55:34,455 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-08 00:55:34,455 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-08 00:55:34,455 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-08 00:55:34,455 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-08 00:55:34,455 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-08 00:55:34,455 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-08 00:55:34,456 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-08 00:55:34,456 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-08 00:55:34,456 INFO L153 SettingsManager]: * Use SBE=true [2025-02-08 00:55:34,456 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-08 00:55:34,456 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-08 00:55:34,456 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-08 00:55:34,456 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-08 00:55:34,456 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-08 00:55:34,458 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-08 00:55:34,458 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-08 00:55:34,459 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-08 00:55:34,459 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-08 00:55:34,459 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-08 00:55:34,459 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-08 00:55:34,459 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-08 00:55:34,459 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-08 00:55:34,459 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-08 00:55:34,459 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-08 00:55:34,460 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-08 00:55:34,460 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-08 00:55:34,460 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-08 00:55:34,460 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-08 00:55:34,460 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-08 00:55:34,461 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-08 00:55:34,461 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-08 00:55:34,461 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-08 00:55:34,461 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-08 00:55:34,461 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-08 00:55:34,461 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-08 00:55:34,461 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-08 00:55:34,461 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-08 00:55:34,461 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 -> 111430583c5cad5728291a83d9964586feec908088fcc502d1f1ab24d409725c [2025-02-08 00:55:34,748 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-08 00:55:34,757 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-08 00:55:34,760 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-08 00:55:34,762 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-08 00:55:34,762 INFO L274 PluginConnector]: CDTParser initialized [2025-02-08 00:55:34,763 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/pthread-ext/08_rand_cas.i [2025-02-08 00:55:36,064 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/ad51b0a23/dcbd464be5a442e0903d20c4f5e19a1c/FLAG06c5069bc [2025-02-08 00:55:36,453 INFO L384 CDTParser]: Found 1 translation units. [2025-02-08 00:55:36,456 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/pthread-ext/08_rand_cas.i [2025-02-08 00:55:36,473 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/ad51b0a23/dcbd464be5a442e0903d20c4f5e19a1c/FLAG06c5069bc [2025-02-08 00:55:36,492 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/ad51b0a23/dcbd464be5a442e0903d20c4f5e19a1c [2025-02-08 00:55:36,495 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-08 00:55:36,497 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-08 00:55:36,498 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-08 00:55:36,499 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-08 00:55:36,503 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-08 00:55:36,503 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.02 12:55:36" (1/1) ... [2025-02-08 00:55:36,505 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@665646d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 12:55:36, skipping insertion in model container [2025-02-08 00:55:36,506 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.02 12:55:36" (1/1) ... [2025-02-08 00:55:36,540 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-08 00:55:36,784 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/pthread-ext/08_rand_cas.i[30837,30850] [2025-02-08 00:55:36,794 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/pthread-ext/08_rand_cas.i[31185,31198] [2025-02-08 00:55:36,797 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/pthread-ext/08_rand_cas.i[31448,31461] [2025-02-08 00:55:36,802 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-08 00:55:36,809 INFO L200 MainTranslator]: Completed pre-run [2025-02-08 00:55:36,861 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/pthread-ext/08_rand_cas.i[30837,30850] [2025-02-08 00:55:36,863 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/pthread-ext/08_rand_cas.i[31185,31198] [2025-02-08 00:55:36,865 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/pthread-ext/08_rand_cas.i[31448,31461] [2025-02-08 00:55:36,867 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-08 00:55:36,902 INFO L204 MainTranslator]: Completed translation [2025-02-08 00:55:36,902 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 12:55:36 WrapperNode [2025-02-08 00:55:36,903 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-08 00:55:36,904 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-08 00:55:36,904 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-08 00:55:36,904 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-08 00:55:36,911 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 12:55:36" (1/1) ... [2025-02-08 00:55:36,926 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 12:55:36" (1/1) ... [2025-02-08 00:55:36,948 INFO L138 Inliner]: procedures = 178, calls = 35, calls flagged for inlining = 13, calls inlined = 14, statements flattened = 135 [2025-02-08 00:55:36,949 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-08 00:55:36,949 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-08 00:55:36,949 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-08 00:55:36,949 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-08 00:55:36,956 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 12:55:36" (1/1) ... [2025-02-08 00:55:36,956 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 12:55:36" (1/1) ... [2025-02-08 00:55:36,962 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 12:55:36" (1/1) ... [2025-02-08 00:55:36,985 INFO L175 MemorySlicer]: Split 11 memory accesses to 3 slices as follows [6, 2, 3]. 55 percent of accesses are in the largest equivalence class. The 3 initializations are split as follows [1, 2, 0]. The 4 writes are split as follows [2, 0, 2]. [2025-02-08 00:55:36,986 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 12:55:36" (1/1) ... [2025-02-08 00:55:36,986 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 12:55:36" (1/1) ... [2025-02-08 00:55:36,991 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 12:55:36" (1/1) ... [2025-02-08 00:55:36,992 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 12:55:36" (1/1) ... [2025-02-08 00:55:36,997 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 12:55:36" (1/1) ... [2025-02-08 00:55:36,998 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 12:55:36" (1/1) ... [2025-02-08 00:55:37,000 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-08 00:55:37,005 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-08 00:55:37,005 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-08 00:55:37,005 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-08 00:55:37,006 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 12:55:36" (1/1) ... [2025-02-08 00:55:37,011 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-08 00:55:37,023 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 00:55:37,036 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-08 00:55:37,041 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-08 00:55:37,062 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-02-08 00:55:37,063 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-02-08 00:55:37,063 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2025-02-08 00:55:37,063 INFO L130 BoogieDeclarations]: Found specification of procedure thr1 [2025-02-08 00:55:37,063 INFO L138 BoogieDeclarations]: Found implementation of procedure thr1 [2025-02-08 00:55:37,063 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-02-08 00:55:37,064 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-02-08 00:55:37,064 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2025-02-08 00:55:37,064 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2025-02-08 00:55:37,064 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-08 00:55:37,064 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-02-08 00:55:37,064 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-02-08 00:55:37,064 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-02-08 00:55:37,064 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-02-08 00:55:37,065 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-02-08 00:55:37,065 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2025-02-08 00:55:37,065 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-08 00:55:37,065 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-08 00:55:37,067 WARN L227 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-02-08 00:55:37,213 INFO L257 CfgBuilder]: Building ICFG [2025-02-08 00:55:37,215 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-08 00:55:37,475 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L737: PseudoRandomUsingAtomic_nextInt_~nextInt_return~0#1 := (if PseudoRandomUsingAtomic_nextInt_~nexts~0#1 < 0 && 0 != PseudoRandomUsingAtomic_nextInt_~nexts~0#1 % PseudoRandomUsingAtomic_nextInt_~n#1 then (if PseudoRandomUsingAtomic_nextInt_~n#1 < 0 then PseudoRandomUsingAtomic_nextInt_~nexts~0#1 % PseudoRandomUsingAtomic_nextInt_~n#1 + PseudoRandomUsingAtomic_nextInt_~n#1 else PseudoRandomUsingAtomic_nextInt_~nexts~0#1 % PseudoRandomUsingAtomic_nextInt_~n#1 - PseudoRandomUsingAtomic_nextInt_~n#1) else PseudoRandomUsingAtomic_nextInt_~nexts~0#1 % PseudoRandomUsingAtomic_nextInt_~n#1); [2025-02-08 00:55:37,475 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L723: SUMMARY for call write~int#2(0, __VERIFIER_atomic_CAS_~r#1.base, __VERIFIER_atomic_CAS_~r#1.offset, 4); srcloc: null [2025-02-08 00:55:37,476 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L733: havoc PseudoRandomUsingAtomic_nextInt_#t~ret6#1; [2025-02-08 00:55:37,476 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L733-1: PseudoRandomUsingAtomic_nextInt_~nexts~0#1 := PseudoRandomUsingAtomic_nextInt_#t~ret6#1; [2025-02-08 00:55:37,476 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L733-2: assume { :end_inline_calculateNext } true;assume -2147483648 <= PseudoRandomUsingAtomic_nextInt_#t~ret6#1 && PseudoRandomUsingAtomic_nextInt_#t~ret6#1 <= 2147483647; [2025-02-08 00:55:37,476 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L733-3: havoc calculateNext_#in~s2#1; [2025-02-08 00:55:37,476 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L733-4: havoc calculateNext_#t~nondet3#1, calculateNext_~s2#1, calculateNext_~calculateNext_return~0#1; [2025-02-08 00:55:37,476 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L733-5: PseudoRandomUsingAtomic_nextInt_#t~ret6#1 := calculateNext_#res#1; [2025-02-08 00:55:37,476 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L717: assume __VERIFIER_atomic_CAS_#t~mem4#1 == __VERIFIER_atomic_CAS_~e#1; [2025-02-08 00:55:37,476 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L717: assume !(__VERIFIER_atomic_CAS_#t~mem4#1 == __VERIFIER_atomic_CAS_~e#1); [2025-02-08 00:55:37,476 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L717-1: havoc __VERIFIER_atomic_CAS_#t~mem4#1; [2025-02-08 00:55:37,476 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L717-2: havoc __VERIFIER_atomic_CAS_#t~mem4#1; [2025-02-08 00:55:37,476 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L717-3: SUMMARY for call __VERIFIER_atomic_CAS_#t~mem4#1 := read~int#0(__VERIFIER_atomic_CAS_~v#1.base, __VERIFIER_atomic_CAS_~v#1.offset, 4); srcloc: null [2025-02-08 00:55:37,476 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L734: assume false; [2025-02-08 00:55:37,476 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L734: assume !false; [2025-02-08 00:55:37,477 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L734-1: assume false; [2025-02-08 00:55:37,477 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L734-2: assume !(PseudoRandomUsingAtomic_nextInt_~nexts~0#1 != PseudoRandomUsingAtomic_nextInt_~read~0#1); [2025-02-08 00:55:37,477 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L734-2: assume !!(PseudoRandomUsingAtomic_nextInt_~nexts~0#1 != PseudoRandomUsingAtomic_nextInt_~read~0#1); [2025-02-08 00:55:37,477 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L735: [2025-02-08 00:55:37,477 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L735-1: havoc __VERIFIER_atomic_CAS_#in~v#1.base, __VERIFIER_atomic_CAS_#in~v#1.offset, __VERIFIER_atomic_CAS_#in~e#1, __VERIFIER_atomic_CAS_#in~u#1, __VERIFIER_atomic_CAS_#in~r#1.base, __VERIFIER_atomic_CAS_#in~r#1.offset;assume { :end_inline___VERIFIER_atomic_CAS } true; [2025-02-08 00:55:37,477 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L735-2: havoc __VERIFIER_atomic_CAS_#t~mem4#1, __VERIFIER_atomic_CAS_~v#1.base, __VERIFIER_atomic_CAS_~v#1.offset, __VERIFIER_atomic_CAS_~e#1, __VERIFIER_atomic_CAS_~u#1, __VERIFIER_atomic_CAS_~r#1.base, __VERIFIER_atomic_CAS_~r#1.offset; [2025-02-08 00:55:37,477 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L735-3: havoc __VERIFIER_atomic_CAS_#t~mem4#1, __VERIFIER_atomic_CAS_~v#1.base, __VERIFIER_atomic_CAS_~v#1.offset, __VERIFIER_atomic_CAS_~e#1, __VERIFIER_atomic_CAS_~u#1, __VERIFIER_atomic_CAS_~r#1.base, __VERIFIER_atomic_CAS_~r#1.offset; [2025-02-08 00:55:37,477 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L735-4: assume { :begin_inline___VERIFIER_atomic_CAS } true;__VERIFIER_atomic_CAS_#in~v#1.base, __VERIFIER_atomic_CAS_#in~v#1.offset, __VERIFIER_atomic_CAS_#in~e#1, __VERIFIER_atomic_CAS_#in~u#1, __VERIFIER_atomic_CAS_#in~r#1.base, __VERIFIER_atomic_CAS_#in~r#1.offset := ~#seed~0.base, ~#seed~0.offset, PseudoRandomUsingAtomic_nextInt_~read~0#1, PseudoRandomUsingAtomic_nextInt_~nexts~0#1, PseudoRandomUsingAtomic_nextInt_~#casret~0#1.base, PseudoRandomUsingAtomic_nextInt_~#casret~0#1.offset; [2025-02-08 00:55:37,477 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L760: havoc PseudoRandomUsingAtomic__threadmain_#t~ret9#1; [2025-02-08 00:55:37,477 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L760-1: PseudoRandomUsingAtomic__threadmain_~myrand~0#1 := PseudoRandomUsingAtomic__threadmain_#t~ret9#1; [2025-02-08 00:55:37,477 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L760-2: assume { :end_inline_PseudoRandomUsingAtomic_nextInt } true;assume -2147483648 <= PseudoRandomUsingAtomic__threadmain_#t~ret9#1 && PseudoRandomUsingAtomic__threadmain_#t~ret9#1 <= 2147483647; [2025-02-08 00:55:37,477 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L760-3: havoc PseudoRandomUsingAtomic_nextInt_#in~n#1; [2025-02-08 00:55:37,477 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L760-4: havoc PseudoRandomUsingAtomic_nextInt_#t~mem5#1, PseudoRandomUsingAtomic_nextInt_#t~ret6#1, PseudoRandomUsingAtomic_nextInt_#t~mem7#1, PseudoRandomUsingAtomic_nextInt_~n#1, PseudoRandomUsingAtomic_nextInt_~read~0#1, PseudoRandomUsingAtomic_nextInt_~nexts~0#1, PseudoRandomUsingAtomic_nextInt_~#casret~0#1.base, PseudoRandomUsingAtomic_nextInt_~#casret~0#1.offset, PseudoRandomUsingAtomic_nextInt_~nextInt_return~0#1; [2025-02-08 00:55:37,477 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L760-5: PseudoRandomUsingAtomic__threadmain_#t~ret9#1 := PseudoRandomUsingAtomic_nextInt_#res#1; [2025-02-08 00:55:37,477 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L719: SUMMARY for call write~int#2(1, __VERIFIER_atomic_CAS_~r#1.base, __VERIFIER_atomic_CAS_~r#1.offset, 4); srcloc: null [2025-02-08 00:55:37,477 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L719-1: SUMMARY for call write~int#0(__VERIFIER_atomic_CAS_~u#1, __VERIFIER_atomic_CAS_~v#1.base, __VERIFIER_atomic_CAS_~v#1.offset, 4); srcloc: null [2025-02-08 00:55:37,478 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L777: havoc PseudoRandomUsingAtomic__threadmain_#t~ret9#1, PseudoRandomUsingAtomic__threadmain_~myrand~0#1;assume { :end_inline_PseudoRandomUsingAtomic__threadmain } true; [2025-02-08 00:55:37,478 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L711: __VERIFIER_atomic_CAS_~r#1.base, __VERIFIER_atomic_CAS_~r#1.offset := __VERIFIER_atomic_CAS_#in~r#1.base, __VERIFIER_atomic_CAS_#in~r#1.offset; [2025-02-08 00:55:37,478 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L711-1: __VERIFIER_atomic_CAS_~u#1 := __VERIFIER_atomic_CAS_#in~u#1; [2025-02-08 00:55:37,478 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L711-2: __VERIFIER_atomic_CAS_~e#1 := __VERIFIER_atomic_CAS_#in~e#1; [2025-02-08 00:55:37,478 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L711-3: __VERIFIER_atomic_CAS_~v#1.base, __VERIFIER_atomic_CAS_~v#1.offset := __VERIFIER_atomic_CAS_#in~v#1.base, __VERIFIER_atomic_CAS_#in~v#1.offset; [2025-02-08 00:55:37,478 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L736: assume 1 == PseudoRandomUsingAtomic_nextInt_#t~mem7#1; [2025-02-08 00:55:37,478 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L736: assume !(1 == PseudoRandomUsingAtomic_nextInt_#t~mem7#1); [2025-02-08 00:55:37,478 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L736-1: havoc PseudoRandomUsingAtomic_nextInt_#t~mem7#1; [2025-02-08 00:55:37,478 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L736-2: havoc PseudoRandomUsingAtomic_nextInt_#t~mem7#1; [2025-02-08 00:55:37,478 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L736-3: SUMMARY for call PseudoRandomUsingAtomic_nextInt_#t~mem7#1 := read~int#2(PseudoRandomUsingAtomic_nextInt_~#casret~0#1.base, PseudoRandomUsingAtomic_nextInt_~#casret~0#1.offset, 4); srcloc: null [2025-02-08 00:55:37,478 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L761: assume false; [2025-02-08 00:55:37,478 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L761: assume !false; [2025-02-08 00:55:37,478 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L761-1: assume false; [2025-02-08 00:55:37,479 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L728: havoc PseudoRandomUsingAtomic_nextInt_~#casret~0#1.base, PseudoRandomUsingAtomic_nextInt_~#casret~0#1.offset; [2025-02-08 00:55:37,479 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L761-2: assume !(PseudoRandomUsingAtomic__threadmain_~myrand~0#1 <= 10); [2025-02-08 00:55:37,479 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L761-2: assume !!(PseudoRandomUsingAtomic__threadmain_~myrand~0#1 <= 10); [2025-02-08 00:55:37,479 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L728-1: SUMMARY for call ULTIMATE.dealloc(PseudoRandomUsingAtomic_nextInt_~#casret~0#1.base, PseudoRandomUsingAtomic_nextInt_~#casret~0#1.offset); srcloc: null [2025-02-08 00:55:37,506 INFO L304 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-02-08 00:55:37,506 INFO L308 CfgBuilder]: Performing block encoding [2025-02-08 00:55:37,625 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-08 00:55:37,625 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-08 00:55:37,629 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.02 12:55:37 BoogieIcfgContainer [2025-02-08 00:55:37,629 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-08 00:55:37,631 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-08 00:55:37,631 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-08 00:55:37,635 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-08 00:55:37,636 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.02 12:55:36" (1/3) ... [2025-02-08 00:55:37,636 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6e8462e3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.02 12:55:37, skipping insertion in model container [2025-02-08 00:55:37,636 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 12:55:36" (2/3) ... [2025-02-08 00:55:37,637 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6e8462e3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.02 12:55:37, skipping insertion in model container [2025-02-08 00:55:37,637 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.02 12:55:37" (3/3) ... [2025-02-08 00:55:37,638 INFO L128 eAbstractionObserver]: Analyzing ICFG 08_rand_cas.i [2025-02-08 00:55:37,651 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-08 00:55:37,653 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG 08_rand_cas.i that has 2 procedures, 30 locations, 1 initial locations, 4 loop locations, and 3 error locations. [2025-02-08 00:55:37,653 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-02-08 00:55:37,702 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-02-08 00:55:37,739 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 34 transitions, 72 flow [2025-02-08 00:55:37,764 INFO L124 PetriNetUnfolderBase]: 4/36 cut-off events. [2025-02-08 00:55:37,768 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-02-08 00:55:37,770 INFO L83 FinitePrefix]: Finished finitePrefix Result has 40 conditions, 36 events. 4/36 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 50 event pairs, 0 based on Foata normal form. 0/26 useless extension candidates. Maximal degree in co-relation 31. Up to 2 conditions per place. [2025-02-08 00:55:37,771 INFO L82 GeneralOperation]: Start removeDead. Operand has 33 places, 34 transitions, 72 flow [2025-02-08 00:55:37,773 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 33 places, 34 transitions, 72 flow [2025-02-08 00:55:37,780 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-08 00:55:37,794 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;@3c2f901e, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-08 00:55:37,794 INFO L334 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2025-02-08 00:55:37,799 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-02-08 00:55:37,799 INFO L124 PetriNetUnfolderBase]: 0/10 cut-off events. [2025-02-08 00:55:37,799 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-02-08 00:55:37,800 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 00:55:37,800 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1] [2025-02-08 00:55:37,801 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [thr1Err2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thr1Err2ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-08 00:55:37,805 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 00:55:37,806 INFO L85 PathProgramCache]: Analyzing trace with hash 384531566, now seen corresponding path program 1 times [2025-02-08 00:55:37,812 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 00:55:37,813 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [64282251] [2025-02-08 00:55:37,813 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 00:55:37,814 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 00:55:37,894 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-02-08 00:55:37,911 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-02-08 00:55:37,911 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 00:55:37,911 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-08 00:55:37,911 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-08 00:55:37,916 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-02-08 00:55:37,929 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-02-08 00:55:37,930 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 00:55:37,930 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-08 00:55:37,951 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-08 00:55:37,954 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-02-08 00:55:37,955 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 3 remaining) [2025-02-08 00:55:37,957 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err2ASSERT_VIOLATIONERROR_FUNCTION (1 of 3 remaining) [2025-02-08 00:55:37,957 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err2ASSERT_VIOLATIONERROR_FUNCTION (0 of 3 remaining) [2025-02-08 00:55:37,958 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-02-08 00:55:37,959 INFO L422 BasicCegarLoop]: Path program histogram: [1] [2025-02-08 00:55:37,962 WARN L246 ceAbstractionStarter]: 1 thread instances were not sufficient, I will increase this number and restart the analysis [2025-02-08 00:55:37,965 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 2 thread instances. [2025-02-08 00:55:38,012 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-02-08 00:55:38,017 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 60 places, 63 transitions, 136 flow [2025-02-08 00:55:38,048 INFO L124 PetriNetUnfolderBase]: 8/68 cut-off events. [2025-02-08 00:55:38,050 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2025-02-08 00:55:38,052 INFO L83 FinitePrefix]: Finished finitePrefix Result has 76 conditions, 68 events. 8/68 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 181 event pairs, 0 based on Foata normal form. 0/49 useless extension candidates. Maximal degree in co-relation 59. Up to 3 conditions per place. [2025-02-08 00:55:38,053 INFO L82 GeneralOperation]: Start removeDead. Operand has 60 places, 63 transitions, 136 flow [2025-02-08 00:55:38,055 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 60 places, 63 transitions, 136 flow [2025-02-08 00:55:38,057 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-08 00:55:38,058 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;@3c2f901e, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-08 00:55:38,059 INFO L334 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2025-02-08 00:55:38,071 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-02-08 00:55:38,071 INFO L124 PetriNetUnfolderBase]: 0/23 cut-off events. [2025-02-08 00:55:38,072 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2025-02-08 00:55:38,072 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 00:55:38,072 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 2, 1, 1, 1, 1] [2025-02-08 00:55:38,072 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [thr1Err2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thr1Err2ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2025-02-08 00:55:38,073 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 00:55:38,074 INFO L85 PathProgramCache]: Analyzing trace with hash -2147083057, now seen corresponding path program 1 times [2025-02-08 00:55:38,074 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 00:55:38,074 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1698237911] [2025-02-08 00:55:38,074 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 00:55:38,074 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 00:55:38,095 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-02-08 00:55:38,111 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-02-08 00:55:38,113 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 00:55:38,113 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-08 00:55:38,113 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-08 00:55:38,119 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-02-08 00:55:38,128 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-02-08 00:55:38,129 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 00:55:38,129 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-08 00:55:38,135 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-08 00:55:38,135 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-02-08 00:55:38,135 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 4 remaining) [2025-02-08 00:55:38,135 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err2ASSERT_VIOLATIONERROR_FUNCTION (2 of 4 remaining) [2025-02-08 00:55:38,135 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err2ASSERT_VIOLATIONERROR_FUNCTION (1 of 4 remaining) [2025-02-08 00:55:38,136 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err2ASSERT_VIOLATIONERROR_FUNCTION (0 of 4 remaining) [2025-02-08 00:55:38,136 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-02-08 00:55:38,136 INFO L422 BasicCegarLoop]: Path program histogram: [1] [2025-02-08 00:55:38,137 WARN L246 ceAbstractionStarter]: 2 thread instances were not sufficient, I will increase this number and restart the analysis [2025-02-08 00:55:38,137 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 3 thread instances. [2025-02-08 00:55:38,186 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-02-08 00:55:38,207 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 87 places, 92 transitions, 202 flow [2025-02-08 00:55:38,233 INFO L124 PetriNetUnfolderBase]: 12/100 cut-off events. [2025-02-08 00:55:38,233 INFO L125 PetriNetUnfolderBase]: For 7/7 co-relation queries the response was YES. [2025-02-08 00:55:38,235 INFO L83 FinitePrefix]: Finished finitePrefix Result has 113 conditions, 100 events. 12/100 cut-off events. For 7/7 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 323 event pairs, 0 based on Foata normal form. 0/72 useless extension candidates. Maximal degree in co-relation 87. Up to 4 conditions per place. [2025-02-08 00:55:38,235 INFO L82 GeneralOperation]: Start removeDead. Operand has 87 places, 92 transitions, 202 flow [2025-02-08 00:55:38,236 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 87 places, 92 transitions, 202 flow [2025-02-08 00:55:38,237 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-08 00:55:38,238 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;@3c2f901e, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-08 00:55:38,238 INFO L334 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2025-02-08 00:55:38,251 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-02-08 00:55:38,252 INFO L124 PetriNetUnfolderBase]: 0/41 cut-off events. [2025-02-08 00:55:38,252 INFO L125 PetriNetUnfolderBase]: For 7/7 co-relation queries the response was YES. [2025-02-08 00:55:38,252 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 00:55:38,252 INFO L206 CegarLoopForPetriNet]: trace histogram [4, 3, 1, 1, 1, 1, 1] [2025-02-08 00:55:38,252 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [thr1Err2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thr1Err2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2025-02-08 00:55:38,253 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 00:55:38,253 INFO L85 PathProgramCache]: Analyzing trace with hash 461627725, now seen corresponding path program 1 times [2025-02-08 00:55:38,253 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 00:55:38,253 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1817550757] [2025-02-08 00:55:38,253 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 00:55:38,253 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 00:55:38,270 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-02-08 00:55:38,282 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-02-08 00:55:38,283 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 00:55:38,283 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-08 00:55:38,283 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-08 00:55:38,289 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-02-08 00:55:38,308 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-02-08 00:55:38,308 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 00:55:38,308 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-08 00:55:38,317 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-08 00:55:38,317 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-02-08 00:55:38,317 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (4 of 5 remaining) [2025-02-08 00:55:38,317 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err2ASSERT_VIOLATIONERROR_FUNCTION (3 of 5 remaining) [2025-02-08 00:55:38,317 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err2ASSERT_VIOLATIONERROR_FUNCTION (2 of 5 remaining) [2025-02-08 00:55:38,318 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err2ASSERT_VIOLATIONERROR_FUNCTION (1 of 5 remaining) [2025-02-08 00:55:38,318 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err2ASSERT_VIOLATIONERROR_FUNCTION (0 of 5 remaining) [2025-02-08 00:55:38,318 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-02-08 00:55:38,318 INFO L422 BasicCegarLoop]: Path program histogram: [1] [2025-02-08 00:55:38,323 WARN L246 ceAbstractionStarter]: 3 thread instances were not sufficient, I will increase this number and restart the analysis [2025-02-08 00:55:38,323 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 4 thread instances. [2025-02-08 00:55:38,389 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-02-08 00:55:38,392 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 114 places, 121 transitions, 270 flow [2025-02-08 00:55:38,413 INFO L124 PetriNetUnfolderBase]: 16/132 cut-off events. [2025-02-08 00:55:38,413 INFO L125 PetriNetUnfolderBase]: For 16/16 co-relation queries the response was YES. [2025-02-08 00:55:38,414 INFO L83 FinitePrefix]: Finished finitePrefix Result has 151 conditions, 132 events. 16/132 cut-off events. For 16/16 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 493 event pairs, 0 based on Foata normal form. 0/95 useless extension candidates. Maximal degree in co-relation 115. Up to 5 conditions per place. [2025-02-08 00:55:38,414 INFO L82 GeneralOperation]: Start removeDead. Operand has 114 places, 121 transitions, 270 flow [2025-02-08 00:55:38,416 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 114 places, 121 transitions, 270 flow [2025-02-08 00:55:38,417 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-08 00:55:38,417 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;@3c2f901e, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-08 00:55:38,417 INFO L334 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2025-02-08 00:55:38,425 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-02-08 00:55:38,425 INFO L124 PetriNetUnfolderBase]: 2/51 cut-off events. [2025-02-08 00:55:38,425 INFO L125 PetriNetUnfolderBase]: For 10/10 co-relation queries the response was YES. [2025-02-08 00:55:38,425 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 00:55:38,425 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 00:55:38,425 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting thr1Err2ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thr1Err2ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2025-02-08 00:55:38,426 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 00:55:38,426 INFO L85 PathProgramCache]: Analyzing trace with hash -765030326, now seen corresponding path program 1 times [2025-02-08 00:55:38,426 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 00:55:38,426 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1280897450] [2025-02-08 00:55:38,426 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 00:55:38,426 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 00:55:38,441 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-02-08 00:55:38,458 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-02-08 00:55:38,458 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 00:55:38,458 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 00:55:38,692 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 00:55:38,692 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 00:55:38,693 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1280897450] [2025-02-08 00:55:38,693 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1280897450] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 00:55:38,693 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 00:55:38,693 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-08 00:55:38,694 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1254968694] [2025-02-08 00:55:38,694 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 00:55:38,699 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-08 00:55:38,703 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 00:55:38,726 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-08 00:55:38,726 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-08 00:55:38,735 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 49 out of 121 [2025-02-08 00:55:38,738 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 114 places, 121 transitions, 270 flow. Second operand has 4 states, 4 states have (on average 51.25) internal successors, (205), 4 states have internal predecessors, (205), 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-08 00:55:38,738 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 00:55:38,738 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 49 of 121 [2025-02-08 00:55:38,741 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 00:56:05,169 INFO L124 PetriNetUnfolderBase]: 284734/446153 cut-off events. [2025-02-08 00:56:05,170 INFO L125 PetriNetUnfolderBase]: For 24194/24194 co-relation queries the response was YES. [2025-02-08 00:56:06,159 INFO L83 FinitePrefix]: Finished finitePrefix Result has 802240 conditions, 446153 events. 284734/446153 cut-off events. For 24194/24194 co-relation queries the response was YES. Maximal size of possible extension queue 14380. Compared 4548163 event pairs, 84607 based on Foata normal form. 68892/469312 useless extension candidates. Maximal degree in co-relation 53387. Up to 204105 conditions per place. [2025-02-08 00:56:08,140 INFO L140 encePairwiseOnDemand]: 98/121 looper letters, 127 selfloop transitions, 6 changer transitions 0/181 dead transitions. [2025-02-08 00:56:08,141 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 106 places, 181 transitions, 698 flow [2025-02-08 00:56:08,142 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-08 00:56:08,144 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-02-08 00:56:08,150 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 368 transitions. [2025-02-08 00:56:08,152 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7603305785123967 [2025-02-08 00:56:08,153 INFO L175 Difference]: Start difference. First operand has 114 places, 121 transitions, 270 flow. Second operand 4 states and 368 transitions. [2025-02-08 00:56:08,154 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 106 places, 181 transitions, 698 flow [2025-02-08 00:56:08,193 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 106 places, 181 transitions, 680 flow, removed 9 selfloop flow, removed 0 redundant places. [2025-02-08 00:56:08,196 INFO L231 Difference]: Finished difference. Result has 107 places, 106 transitions, 258 flow [2025-02-08 00:56:08,199 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=121, PETRI_DIFFERENCE_MINUEND_FLOW=226, PETRI_DIFFERENCE_MINUEND_PLACES=103, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=102, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=96, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=258, PETRI_PLACES=107, PETRI_TRANSITIONS=106} [2025-02-08 00:56:08,201 INFO L279 CegarLoopForPetriNet]: 114 programPoint places, -7 predicate places. [2025-02-08 00:56:08,201 INFO L471 AbstractCegarLoop]: Abstraction has has 107 places, 106 transitions, 258 flow [2025-02-08 00:56:08,202 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 51.25) internal successors, (205), 4 states have internal predecessors, (205), 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-08 00:56:08,202 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 00:56:08,205 INFO L206 CegarLoopForPetriNet]: trace histogram [5, 4, 1, 1, 1, 1, 1, 1] [2025-02-08 00:56:08,205 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-02-08 00:56:08,205 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [thr1Err2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thr1Err2ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2025-02-08 00:56:08,206 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 00:56:08,206 INFO L85 PathProgramCache]: Analyzing trace with hash 64686363, now seen corresponding path program 1 times [2025-02-08 00:56:08,206 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 00:56:08,206 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1247660186] [2025-02-08 00:56:08,206 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 00:56:08,206 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 00:56:08,221 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-02-08 00:56:08,230 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-02-08 00:56:08,230 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 00:56:08,230 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-08 00:56:08,230 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-08 00:56:08,238 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-02-08 00:56:08,244 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-02-08 00:56:08,245 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 00:56:08,245 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-08 00:56:08,251 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-08 00:56:08,251 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-02-08 00:56:08,251 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (5 of 6 remaining) [2025-02-08 00:56:08,252 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err2ASSERT_VIOLATIONERROR_FUNCTION (4 of 6 remaining) [2025-02-08 00:56:08,252 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err2ASSERT_VIOLATIONERROR_FUNCTION (3 of 6 remaining) [2025-02-08 00:56:08,252 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err2ASSERT_VIOLATIONERROR_FUNCTION (2 of 6 remaining) [2025-02-08 00:56:08,252 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err2ASSERT_VIOLATIONERROR_FUNCTION (1 of 6 remaining) [2025-02-08 00:56:08,252 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err2ASSERT_VIOLATIONERROR_FUNCTION (0 of 6 remaining) [2025-02-08 00:56:08,252 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-02-08 00:56:08,252 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1] [2025-02-08 00:56:08,253 WARN L246 ceAbstractionStarter]: 4 thread instances were not sufficient, I will increase this number and restart the analysis [2025-02-08 00:56:08,253 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 5 thread instances. [2025-02-08 00:56:08,316 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-02-08 00:56:08,321 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 141 places, 150 transitions, 340 flow [2025-02-08 00:56:08,337 INFO L124 PetriNetUnfolderBase]: 20/164 cut-off events. [2025-02-08 00:56:08,337 INFO L125 PetriNetUnfolderBase]: For 30/30 co-relation queries the response was YES. [2025-02-08 00:56:08,338 INFO L83 FinitePrefix]: Finished finitePrefix Result has 190 conditions, 164 events. 20/164 cut-off events. For 30/30 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 656 event pairs, 0 based on Foata normal form. 0/118 useless extension candidates. Maximal degree in co-relation 150. Up to 6 conditions per place. [2025-02-08 00:56:08,338 INFO L82 GeneralOperation]: Start removeDead. Operand has 141 places, 150 transitions, 340 flow [2025-02-08 00:56:08,341 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 141 places, 150 transitions, 340 flow [2025-02-08 00:56:08,343 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-08 00:56:08,344 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;@3c2f901e, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-08 00:56:08,346 INFO L334 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2025-02-08 00:56:08,350 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-02-08 00:56:08,350 INFO L124 PetriNetUnfolderBase]: 2/58 cut-off events. [2025-02-08 00:56:08,350 INFO L125 PetriNetUnfolderBase]: For 10/10 co-relation queries the response was YES. [2025-02-08 00:56:08,350 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 00:56:08,350 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 00:56:08,350 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting thr1Err2ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thr1Err2ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2025-02-08 00:56:08,350 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 00:56:08,350 INFO L85 PathProgramCache]: Analyzing trace with hash 1040956412, now seen corresponding path program 1 times [2025-02-08 00:56:08,350 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 00:56:08,351 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2017208367] [2025-02-08 00:56:08,351 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 00:56:08,351 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 00:56:08,359 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-02-08 00:56:08,364 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-02-08 00:56:08,367 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 00:56:08,367 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 00:56:08,479 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 00:56:08,479 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 00:56:08,479 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2017208367] [2025-02-08 00:56:08,479 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2017208367] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 00:56:08,480 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 00:56:08,480 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-08 00:56:08,480 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [445628483] [2025-02-08 00:56:08,480 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 00:56:08,480 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-08 00:56:08,480 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 00:56:08,481 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-08 00:56:08,481 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-08 00:56:08,488 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 62 out of 150 [2025-02-08 00:56:08,489 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 141 places, 150 transitions, 340 flow. Second operand has 4 states, 4 states have (on average 64.25) internal successors, (257), 4 states have internal predecessors, (257), 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-08 00:56:08,489 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 00:56:08,489 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 62 of 150 [2025-02-08 00:56:08,489 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand