./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/pthread-ext/08_rand_cas.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) 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/AutomizerMemDerefMemtrack.xml -i ../sv-benchmarks/c/pthread-ext/08_rand_cas.i -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-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 valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --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 08:11:48,673 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-08 08:11:48,719 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2025-02-08 08:11:48,723 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-08 08:11:48,723 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-08 08:11:48,740 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-08 08:11:48,740 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-08 08:11:48,741 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-08 08:11:48,741 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-08 08:11:48,741 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-08 08:11:48,741 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-08 08:11:48,741 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-08 08:11:48,741 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-08 08:11:48,741 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-08 08:11:48,741 INFO L153 SettingsManager]: * Use SBE=true [2025-02-08 08:11:48,742 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-08 08:11:48,742 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-08 08:11:48,742 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-08 08:11:48,742 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-08 08:11:48,742 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-08 08:11:48,742 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2025-02-08 08:11:48,742 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2025-02-08 08:11:48,742 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2025-02-08 08:11:48,742 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-08 08:11:48,742 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-02-08 08:11:48,743 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-02-08 08:11:48,743 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-08 08:11:48,743 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-08 08:11:48,743 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-08 08:11:48,743 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-08 08:11:48,743 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-08 08:11:48,743 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-08 08:11:48,743 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-08 08:11:48,743 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-08 08:11:48,743 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-08 08:11:48,744 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-08 08:11:48,744 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-08 08:11:48,744 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-08 08:11:48,744 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-08 08:11:48,744 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-08 08:11:48,744 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-08 08:11:48,744 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-08 08:11:48,744 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 valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) 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 08:11:48,914 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-08 08:11:48,929 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-08 08:11:48,935 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-08 08:11:48,935 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-08 08:11:48,936 INFO L274 PluginConnector]: CDTParser initialized [2025-02-08 08:11:48,936 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 08:11:50,347 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/a4ea7f068/43abc8605f414afdaa1c6db4bf3e286a/FLAGfc80302b2 [2025-02-08 08:11:50,660 INFO L384 CDTParser]: Found 1 translation units. [2025-02-08 08:11:50,661 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/pthread-ext/08_rand_cas.i [2025-02-08 08:11:50,676 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/a4ea7f068/43abc8605f414afdaa1c6db4bf3e286a/FLAGfc80302b2 [2025-02-08 08:11:50,690 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/a4ea7f068/43abc8605f414afdaa1c6db4bf3e286a [2025-02-08 08:11:50,692 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-08 08:11:50,693 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-08 08:11:50,695 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-08 08:11:50,695 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-08 08:11:50,698 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-08 08:11:50,698 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.02 08:11:50" (1/1) ... [2025-02-08 08:11:50,703 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@312fc221 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 08:11:50, skipping insertion in model container [2025-02-08 08:11:50,703 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.02 08:11:50" (1/1) ... [2025-02-08 08:11:50,735 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-08 08:11:50,957 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-08 08:11:50,965 INFO L200 MainTranslator]: Completed pre-run [2025-02-08 08:11:51,007 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-08 08:11:51,037 INFO L204 MainTranslator]: Completed translation [2025-02-08 08:11:51,038 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 08:11:51 WrapperNode [2025-02-08 08:11:51,038 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-08 08:11:51,039 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-08 08:11:51,039 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-08 08:11:51,040 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-08 08:11:51,045 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 08:11:51" (1/1) ... [2025-02-08 08:11:51,057 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 08:11:51" (1/1) ... [2025-02-08 08:11:51,076 INFO L138 Inliner]: procedures = 178, calls = 38, calls flagged for inlining = 16, calls inlined = 17, statements flattened = 141 [2025-02-08 08:11:51,076 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-08 08:11:51,077 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-08 08:11:51,077 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-08 08:11:51,077 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-08 08:11:51,082 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 08:11:51" (1/1) ... [2025-02-08 08:11:51,082 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 08:11:51" (1/1) ... [2025-02-08 08:11:51,084 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 08:11:51" (1/1) ... [2025-02-08 08:11:51,092 INFO L175 MemorySlicer]: Split 11 memory accesses to 3 slices as follows [2, 6, 3]. 55 percent of accesses are in the largest equivalence class. The 3 initializations are split as follows [2, 1, 0]. The 4 writes are split as follows [0, 2, 2]. [2025-02-08 08:11:51,092 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 08:11:51" (1/1) ... [2025-02-08 08:11:51,092 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 08:11:51" (1/1) ... [2025-02-08 08:11:51,096 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 08:11:51" (1/1) ... [2025-02-08 08:11:51,097 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 08:11:51" (1/1) ... [2025-02-08 08:11:51,098 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 08:11:51" (1/1) ... [2025-02-08 08:11:51,098 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 08:11:51" (1/1) ... [2025-02-08 08:11:51,100 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-08 08:11:51,100 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-08 08:11:51,101 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-08 08:11:51,101 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-08 08:11:51,101 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 08:11:51" (1/1) ... [2025-02-08 08:11:51,105 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-08 08:11:51,116 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 08:11:51,126 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 08:11:51,130 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 08:11:51,143 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-02-08 08:11:51,144 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-02-08 08:11:51,144 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2025-02-08 08:11:51,144 INFO L130 BoogieDeclarations]: Found specification of procedure thr1 [2025-02-08 08:11:51,144 INFO L138 BoogieDeclarations]: Found implementation of procedure thr1 [2025-02-08 08:11:51,144 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-02-08 08:11:51,144 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-02-08 08:11:51,144 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2025-02-08 08:11:51,144 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2025-02-08 08:11:51,144 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-08 08:11:51,144 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-02-08 08:11:51,144 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-02-08 08:11:51,144 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-02-08 08:11:51,144 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-02-08 08:11:51,144 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-02-08 08:11:51,145 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2025-02-08 08:11:51,145 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-08 08:11:51,145 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-08 08:11:51,146 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 08:11:51,225 INFO L257 CfgBuilder]: Building ICFG [2025-02-08 08:11:51,226 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-08 08:11:51,395 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 08:11:51,395 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 08:11:51,395 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L723: assume !(1 == #valid[__VERIFIER_atomic_CAS_~r#1.base]); [2025-02-08 08:11:51,395 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L723: assume !(4 + __VERIFIER_atomic_CAS_~r#1.offset <= #length[__VERIFIER_atomic_CAS_~r#1.base] && 0 <= __VERIFIER_atomic_CAS_~r#1.offset); [2025-02-08 08:11:51,396 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L733: havoc PseudoRandomUsingAtomic_nextInt_#t~ret6#1; [2025-02-08 08:11:51,396 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L733-1: PseudoRandomUsingAtomic_nextInt_~nexts~0#1 := PseudoRandomUsingAtomic_nextInt_#t~ret6#1; [2025-02-08 08:11:51,396 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 08:11:51,396 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L733-3: havoc calculateNext_#in~s2#1; [2025-02-08 08:11:51,396 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 08:11:51,396 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L733-5: PseudoRandomUsingAtomic_nextInt_#t~ret6#1 := calculateNext_#res#1; [2025-02-08 08:11:51,396 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L717: assume __VERIFIER_atomic_CAS_#t~mem4#1 == __VERIFIER_atomic_CAS_~e#1; [2025-02-08 08:11:51,396 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L717: assume !(__VERIFIER_atomic_CAS_#t~mem4#1 == __VERIFIER_atomic_CAS_~e#1); [2025-02-08 08:11:51,396 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L717-1: havoc __VERIFIER_atomic_CAS_#t~mem4#1; [2025-02-08 08:11:51,396 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L717-2: havoc __VERIFIER_atomic_CAS_#t~mem4#1; [2025-02-08 08:11:51,396 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L717-3: SUMMARY for call __VERIFIER_atomic_CAS_#t~mem4#1 := read~int#1(__VERIFIER_atomic_CAS_~v#1.base, __VERIFIER_atomic_CAS_~v#1.offset, 4); srcloc: null [2025-02-08 08:11:51,396 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L717-3: assume !(1 == #valid[__VERIFIER_atomic_CAS_~v#1.base]); [2025-02-08 08:11:51,396 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L717-3: assume !(4 + __VERIFIER_atomic_CAS_~v#1.offset <= #length[__VERIFIER_atomic_CAS_~v#1.base] && 0 <= __VERIFIER_atomic_CAS_~v#1.offset); [2025-02-08 08:11:51,396 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L734: assume { :end_inline_reach_error } true;assume false; [2025-02-08 08:11:51,396 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L734-1: havoc reach_error_#t~nondet0#1.base, reach_error_#t~nondet0#1.offset; [2025-02-08 08:11:51,396 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L734-2: assume !(PseudoRandomUsingAtomic_nextInt_~nexts~0#1 != PseudoRandomUsingAtomic_nextInt_~read~0#1); [2025-02-08 08:11:51,396 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L734-2: assume !!(PseudoRandomUsingAtomic_nextInt_~nexts~0#1 != PseudoRandomUsingAtomic_nextInt_~read~0#1); [2025-02-08 08:11:51,396 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L734-3: assume { :begin_inline_reach_error } true;havoc reach_error_#t~nondet0#1.base, reach_error_#t~nondet0#1.offset; [2025-02-08 08:11:51,396 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L735: [2025-02-08 08:11:51,396 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 08:11:51,397 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 08:11:51,397 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 08:11:51,397 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 08:11:51,397 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L760: havoc PseudoRandomUsingAtomic__threadmain_#t~ret9#1; [2025-02-08 08:11:51,397 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L760-1: PseudoRandomUsingAtomic__threadmain_~myrand~0#1 := PseudoRandomUsingAtomic__threadmain_#t~ret9#1; [2025-02-08 08:11:51,397 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 08:11:51,397 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L760-3: havoc PseudoRandomUsingAtomic_nextInt_#in~n#1; [2025-02-08 08:11:51,398 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 08:11:51,398 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L760-5: PseudoRandomUsingAtomic__threadmain_#t~ret9#1 := PseudoRandomUsingAtomic_nextInt_#res#1; [2025-02-08 08:11:51,398 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L17: assume false; [2025-02-08 08:11:51,398 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L17: assume !false; [2025-02-08 08:11:51,398 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L17-1: assume false; [2025-02-08 08:11:51,398 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L17-1: assume !false; [2025-02-08 08:11:51,398 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 08:11:51,398 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L719: assume !(1 == #valid[__VERIFIER_atomic_CAS_~r#1.base]); [2025-02-08 08:11:51,398 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L719: assume !(4 + __VERIFIER_atomic_CAS_~r#1.offset <= #length[__VERIFIER_atomic_CAS_~r#1.base] && 0 <= __VERIFIER_atomic_CAS_~r#1.offset); [2025-02-08 08:11:51,398 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L17-2: assume false; [2025-02-08 08:11:51,398 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L17-2: assume !false; [2025-02-08 08:11:51,398 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L719-1: SUMMARY for call write~int#1(__VERIFIER_atomic_CAS_~u#1, __VERIFIER_atomic_CAS_~v#1.base, __VERIFIER_atomic_CAS_~v#1.offset, 4); srcloc: null [2025-02-08 08:11:51,399 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L719-1: assume !(1 == #valid[__VERIFIER_atomic_CAS_~v#1.base]); [2025-02-08 08:11:51,399 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L719-1: assume !(4 + __VERIFIER_atomic_CAS_~v#1.offset <= #length[__VERIFIER_atomic_CAS_~v#1.base] && 0 <= __VERIFIER_atomic_CAS_~v#1.offset); [2025-02-08 08:11:51,399 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L17-3: assume false; [2025-02-08 08:11:51,399 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L17-3: assume !false; [2025-02-08 08:11:51,399 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 08:11:51,399 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 08:11:51,399 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L711-1: __VERIFIER_atomic_CAS_~u#1 := __VERIFIER_atomic_CAS_#in~u#1; [2025-02-08 08:11:51,399 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L711-2: __VERIFIER_atomic_CAS_~e#1 := __VERIFIER_atomic_CAS_#in~e#1; [2025-02-08 08:11:51,399 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 08:11:51,399 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L736: assume 1 == PseudoRandomUsingAtomic_nextInt_#t~mem7#1; [2025-02-08 08:11:51,399 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L736: assume !(1 == PseudoRandomUsingAtomic_nextInt_#t~mem7#1); [2025-02-08 08:11:51,399 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L736-1: havoc PseudoRandomUsingAtomic_nextInt_#t~mem7#1; [2025-02-08 08:11:51,399 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L736-2: havoc PseudoRandomUsingAtomic_nextInt_#t~mem7#1; [2025-02-08 08:11:51,399 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 08:11:51,399 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L736-3: assume !(1 == #valid[PseudoRandomUsingAtomic_nextInt_~#casret~0#1.base]); [2025-02-08 08:11:51,399 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L736-3: assume !(4 + PseudoRandomUsingAtomic_nextInt_~#casret~0#1.offset <= #length[PseudoRandomUsingAtomic_nextInt_~#casret~0#1.base] && 0 <= PseudoRandomUsingAtomic_nextInt_~#casret~0#1.offset); [2025-02-08 08:11:51,399 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L761: assume { :end_inline_reach_error } true;assume false; [2025-02-08 08:11:51,399 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L761-1: havoc reach_error_#t~nondet0#1.base, reach_error_#t~nondet0#1.offset; [2025-02-08 08:11:51,399 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L728: havoc PseudoRandomUsingAtomic_nextInt_~#casret~0#1.base, PseudoRandomUsingAtomic_nextInt_~#casret~0#1.offset; [2025-02-08 08:11:51,399 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L761-2: assume !(PseudoRandomUsingAtomic__threadmain_~myrand~0#1 <= 10); [2025-02-08 08:11:51,399 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L761-2: assume !!(PseudoRandomUsingAtomic__threadmain_~myrand~0#1 <= 10); [2025-02-08 08:11:51,399 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 08:11:51,399 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L761-3: assume { :begin_inline_reach_error } true;havoc reach_error_#t~nondet0#1.base, reach_error_#t~nondet0#1.offset; [2025-02-08 08:11:51,420 INFO L304 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-02-08 08:11:51,420 INFO L308 CfgBuilder]: Performing block encoding [2025-02-08 08:11:51,486 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-08 08:11:51,490 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-08 08:11:51,490 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.02 08:11:51 BoogieIcfgContainer [2025-02-08 08:11:51,490 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-08 08:11:51,492 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-08 08:11:51,492 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-08 08:11:51,496 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-08 08:11:51,496 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.02 08:11:50" (1/3) ... [2025-02-08 08:11:51,496 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3f115877 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.02 08:11:51, skipping insertion in model container [2025-02-08 08:11:51,497 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 08:11:51" (2/3) ... [2025-02-08 08:11:51,497 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3f115877 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.02 08:11:51, skipping insertion in model container [2025-02-08 08:11:51,497 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.02 08:11:51" (3/3) ... [2025-02-08 08:11:51,498 INFO L128 eAbstractionObserver]: Analyzing ICFG 08_rand_cas.i [2025-02-08 08:11:51,508 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-08 08:11:51,509 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG 08_rand_cas.i that has 2 procedures, 41 locations, 1 initial locations, 4 loop locations, and 20 error locations. [2025-02-08 08:11:51,510 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-02-08 08:11:51,564 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-02-08 08:11:51,592 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 44 places, 46 transitions, 96 flow [2025-02-08 08:11:51,624 INFO L124 PetriNetUnfolderBase]: 5/50 cut-off events. [2025-02-08 08:11:51,625 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-02-08 08:11:51,628 INFO L83 FinitePrefix]: Finished finitePrefix Result has 54 conditions, 50 events. 5/50 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 104 event pairs, 0 based on Foata normal form. 0/31 useless extension candidates. Maximal degree in co-relation 43. Up to 2 conditions per place. [2025-02-08 08:11:51,628 INFO L82 GeneralOperation]: Start removeDead. Operand has 44 places, 46 transitions, 96 flow [2025-02-08 08:11:51,631 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 44 places, 46 transitions, 96 flow [2025-02-08 08:11:51,642 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-08 08:11:51,652 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=None, 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;@710d523f, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-08 08:11:51,653 INFO L334 AbstractCegarLoop]: Starting to check reachability of 16 error locations. [2025-02-08 08:11:51,659 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-02-08 08:11:51,659 INFO L124 PetriNetUnfolderBase]: 0/3 cut-off events. [2025-02-08 08:11:51,659 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-02-08 08:11:51,659 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 08:11:51,659 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2025-02-08 08:11:51,660 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [thr1Err17REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err18REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2025-02-08 08:11:51,664 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 08:11:51,664 INFO L85 PathProgramCache]: Analyzing trace with hash 343921, now seen corresponding path program 1 times [2025-02-08 08:11:51,669 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 08:11:51,669 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [457642719] [2025-02-08 08:11:51,669 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 08:11:51,670 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 08:11:51,727 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-02-08 08:11:51,731 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-02-08 08:11:51,732 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 08:11:51,732 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 08:11:51,788 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 08:11:51,789 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 08:11:51,789 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [457642719] [2025-02-08 08:11:51,790 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [457642719] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 08:11:51,790 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 08:11:51,790 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 08:11:51,791 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [671013088] [2025-02-08 08:11:51,792 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 08:11:51,795 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-02-08 08:11:51,799 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 08:11:51,814 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-02-08 08:11:51,815 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-02-08 08:11:51,816 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 17 out of 46 [2025-02-08 08:11:51,818 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 44 places, 46 transitions, 96 flow. Second operand has 2 states, 2 states have (on average 18.0) internal successors, (36), 2 states have internal predecessors, (36), 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 08:11:51,818 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 08:11:51,818 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 17 of 46 [2025-02-08 08:11:51,819 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 08:11:51,878 INFO L124 PetriNetUnfolderBase]: 40/130 cut-off events. [2025-02-08 08:11:51,879 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-02-08 08:11:51,880 INFO L83 FinitePrefix]: Finished finitePrefix Result has 225 conditions, 130 events. 40/130 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 474 event pairs, 34 based on Foata normal form. 12/120 useless extension candidates. Maximal degree in co-relation 209. Up to 91 conditions per place. [2025-02-08 08:11:51,883 INFO L140 encePairwiseOnDemand]: 40/46 looper letters, 21 selfloop transitions, 0 changer transitions 0/37 dead transitions. [2025-02-08 08:11:51,883 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 39 places, 37 transitions, 120 flow [2025-02-08 08:11:51,884 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-02-08 08:11:51,885 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2025-02-08 08:11:51,889 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 61 transitions. [2025-02-08 08:11:51,890 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6630434782608695 [2025-02-08 08:11:51,893 INFO L175 Difference]: Start difference. First operand has 44 places, 46 transitions, 96 flow. Second operand 2 states and 61 transitions. [2025-02-08 08:11:51,894 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 39 places, 37 transitions, 120 flow [2025-02-08 08:11:51,896 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 39 places, 37 transitions, 120 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-02-08 08:11:51,897 INFO L231 Difference]: Finished difference. Result has 39 places, 37 transitions, 78 flow [2025-02-08 08:11:51,899 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=46, PETRI_DIFFERENCE_MINUEND_FLOW=78, PETRI_DIFFERENCE_MINUEND_PLACES=38, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=37, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=37, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=78, PETRI_PLACES=39, PETRI_TRANSITIONS=37} [2025-02-08 08:11:51,901 INFO L279 CegarLoopForPetriNet]: 44 programPoint places, -5 predicate places. [2025-02-08 08:11:51,901 INFO L471 AbstractCegarLoop]: Abstraction has has 39 places, 37 transitions, 78 flow [2025-02-08 08:11:51,901 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 18.0) internal successors, (36), 2 states have internal predecessors, (36), 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 08:11:51,901 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 08:11:51,901 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1] [2025-02-08 08:11:51,901 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-02-08 08:11:51,901 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [thr1Err17REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err18REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2025-02-08 08:11:51,902 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 08:11:51,902 INFO L85 PathProgramCache]: Analyzing trace with hash 1658977586, now seen corresponding path program 1 times [2025-02-08 08:11:51,902 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 08:11:51,902 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [909889572] [2025-02-08 08:11:51,902 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 08:11:51,902 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 08:11:51,909 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-02-08 08:11:51,919 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-02-08 08:11:51,919 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 08:11:51,919 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-08 08:11:51,919 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-08 08:11:51,925 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-02-08 08:11:51,930 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-02-08 08:11:51,931 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 08:11:51,931 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-08 08:11:51,941 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-08 08:11:51,941 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-02-08 08:11:51,942 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (15 of 16 remaining) [2025-02-08 08:11:51,943 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err17REQUIRES_VIOLATIONMEMORY_DEREFERENCE (14 of 16 remaining) [2025-02-08 08:11:51,943 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err18REQUIRES_VIOLATIONMEMORY_DEREFERENCE (13 of 16 remaining) [2025-02-08 08:11:51,943 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (12 of 16 remaining) [2025-02-08 08:11:51,944 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err13REQUIRES_VIOLATIONMEMORY_DEREFERENCE (11 of 16 remaining) [2025-02-08 08:11:51,944 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err15REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 16 remaining) [2025-02-08 08:11:51,944 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err16REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 16 remaining) [2025-02-08 08:11:51,944 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err14ASSERT_VIOLATIONMEMORY_LEAK (8 of 16 remaining) [2025-02-08 08:11:51,944 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (7 of 16 remaining) [2025-02-08 08:11:51,944 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err17REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 16 remaining) [2025-02-08 08:11:51,944 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err18REQUIRES_VIOLATIONMEMORY_DEREFERENCE (5 of 16 remaining) [2025-02-08 08:11:51,944 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (4 of 16 remaining) [2025-02-08 08:11:51,944 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err13REQUIRES_VIOLATIONMEMORY_DEREFERENCE (3 of 16 remaining) [2025-02-08 08:11:51,944 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err15REQUIRES_VIOLATIONMEMORY_DEREFERENCE (2 of 16 remaining) [2025-02-08 08:11:51,944 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err16REQUIRES_VIOLATIONMEMORY_DEREFERENCE (1 of 16 remaining) [2025-02-08 08:11:51,945 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err14ASSERT_VIOLATIONMEMORY_LEAK (0 of 16 remaining) [2025-02-08 08:11:51,945 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-02-08 08:11:51,945 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1] [2025-02-08 08:11:51,947 WARN L246 ceAbstractionStarter]: 1 thread instances were not sufficient, I will increase this number and restart the analysis [2025-02-08 08:11:51,947 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 2 thread instances. [2025-02-08 08:11:51,974 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-02-08 08:11:51,976 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 80 places, 85 transitions, 180 flow [2025-02-08 08:11:51,987 INFO L124 PetriNetUnfolderBase]: 10/94 cut-off events. [2025-02-08 08:11:51,988 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2025-02-08 08:11:51,988 INFO L83 FinitePrefix]: Finished finitePrefix Result has 102 conditions, 94 events. 10/94 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 327 event pairs, 0 based on Foata normal form. 0/58 useless extension candidates. Maximal degree in co-relation 81. Up to 3 conditions per place. [2025-02-08 08:11:51,989 INFO L82 GeneralOperation]: Start removeDead. Operand has 80 places, 85 transitions, 180 flow [2025-02-08 08:11:51,989 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 80 places, 85 transitions, 180 flow [2025-02-08 08:11:51,990 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-08 08:11:51,990 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=None, 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;@710d523f, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-08 08:11:51,991 INFO L334 AbstractCegarLoop]: Starting to check reachability of 23 error locations. [2025-02-08 08:11:51,991 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-02-08 08:11:51,992 INFO L124 PetriNetUnfolderBase]: 0/3 cut-off events. [2025-02-08 08:11:51,992 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-02-08 08:11:51,992 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 08:11:51,992 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2025-02-08 08:11:51,992 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [thr1Err17REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err18REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 20 more)] === [2025-02-08 08:11:51,992 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 08:11:51,992 INFO L85 PathProgramCache]: Analyzing trace with hash 428326, now seen corresponding path program 1 times [2025-02-08 08:11:51,992 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 08:11:51,992 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1212440716] [2025-02-08 08:11:51,992 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 08:11:51,992 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 08:11:51,998 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-02-08 08:11:51,999 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-02-08 08:11:51,999 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 08:11:51,999 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 08:11:52,007 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 08:11:52,007 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 08:11:52,008 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1212440716] [2025-02-08 08:11:52,008 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1212440716] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 08:11:52,008 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 08:11:52,008 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 08:11:52,008 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1688251946] [2025-02-08 08:11:52,008 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 08:11:52,008 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-02-08 08:11:52,008 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 08:11:52,009 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-02-08 08:11:52,009 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-02-08 08:11:52,009 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 32 out of 85 [2025-02-08 08:11:52,009 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 80 places, 85 transitions, 180 flow. Second operand has 2 states, 2 states have (on average 33.0) internal successors, (66), 2 states have internal predecessors, (66), 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 08:11:52,009 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 08:11:52,009 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 32 of 85 [2025-02-08 08:11:52,009 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 08:11:52,371 INFO L124 PetriNetUnfolderBase]: 1729/3472 cut-off events. [2025-02-08 08:11:52,371 INFO L125 PetriNetUnfolderBase]: For 69/69 co-relation queries the response was YES. [2025-02-08 08:11:52,378 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6124 conditions, 3472 events. 1729/3472 cut-off events. For 69/69 co-relation queries the response was YES. Maximal size of possible extension queue 247. Compared 26159 event pairs, 1564 based on Foata normal form. 444/3203 useless extension candidates. Maximal degree in co-relation 2218. Up to 2593 conditions per place. [2025-02-08 08:11:52,394 INFO L140 encePairwiseOnDemand]: 74/85 looper letters, 39 selfloop transitions, 0 changer transitions 0/70 dead transitions. [2025-02-08 08:11:52,394 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 72 places, 70 transitions, 228 flow [2025-02-08 08:11:52,395 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-02-08 08:11:52,395 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2025-02-08 08:11:52,396 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 114 transitions. [2025-02-08 08:11:52,396 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6705882352941176 [2025-02-08 08:11:52,396 INFO L175 Difference]: Start difference. First operand has 80 places, 85 transitions, 180 flow. Second operand 2 states and 114 transitions. [2025-02-08 08:11:52,396 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 72 places, 70 transitions, 228 flow [2025-02-08 08:11:52,397 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 72 places, 70 transitions, 228 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-02-08 08:11:52,398 INFO L231 Difference]: Finished difference. Result has 72 places, 70 transitions, 150 flow [2025-02-08 08:11:52,398 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=85, PETRI_DIFFERENCE_MINUEND_FLOW=150, PETRI_DIFFERENCE_MINUEND_PLACES=71, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=70, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=70, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=150, PETRI_PLACES=72, PETRI_TRANSITIONS=70} [2025-02-08 08:11:52,401 INFO L279 CegarLoopForPetriNet]: 80 programPoint places, -8 predicate places. [2025-02-08 08:11:52,401 INFO L471 AbstractCegarLoop]: Abstraction has has 72 places, 70 transitions, 150 flow [2025-02-08 08:11:52,401 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 33.0) internal successors, (66), 2 states have internal predecessors, (66), 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 08:11:52,401 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 08:11:52,401 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 08:11:52,402 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-02-08 08:11:52,402 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting thr1Err17REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thr1Err17REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err18REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 20 more)] === [2025-02-08 08:11:52,402 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 08:11:52,402 INFO L85 PathProgramCache]: Analyzing trace with hash 434594602, now seen corresponding path program 1 times [2025-02-08 08:11:52,402 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 08:11:52,403 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [260829746] [2025-02-08 08:11:52,403 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 08:11:52,403 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 08:11:52,416 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-02-08 08:11:52,423 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-02-08 08:11:52,425 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 08:11:52,425 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 08:11:52,504 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 08:11:52,504 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 08:11:52,505 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [260829746] [2025-02-08 08:11:52,509 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [260829746] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 08:11:52,509 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 08:11:52,509 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-02-08 08:11:52,509 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [530404274] [2025-02-08 08:11:52,509 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 08:11:52,509 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 08:11:52,510 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 08:11:52,510 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 08:11:52,510 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 08:11:52,518 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 30 out of 85 [2025-02-08 08:11:52,519 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 72 places, 70 transitions, 150 flow. Second operand has 3 states, 3 states have (on average 32.0) internal successors, (96), 3 states have internal predecessors, (96), 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 08:11:52,519 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 08:11:52,519 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 30 of 85 [2025-02-08 08:11:52,519 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 08:11:52,775 INFO L124 PetriNetUnfolderBase]: 1377/2832 cut-off events. [2025-02-08 08:11:52,776 INFO L125 PetriNetUnfolderBase]: For 63/63 co-relation queries the response was YES. [2025-02-08 08:11:52,782 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4935 conditions, 2832 events. 1377/2832 cut-off events. For 63/63 co-relation queries the response was YES. Maximal size of possible extension queue 167. Compared 20603 event pairs, 1230 based on Foata normal form. 0/2395 useless extension candidates. Maximal degree in co-relation 4930. Up to 2048 conditions per place. [2025-02-08 08:11:52,793 INFO L140 encePairwiseOnDemand]: 78/85 looper letters, 34 selfloop transitions, 1 changer transitions 0/64 dead transitions. [2025-02-08 08:11:52,794 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 68 places, 64 transitions, 208 flow [2025-02-08 08:11:52,794 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 08:11:52,794 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 08:11:52,795 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 131 transitions. [2025-02-08 08:11:52,796 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5137254901960784 [2025-02-08 08:11:52,796 INFO L175 Difference]: Start difference. First operand has 72 places, 70 transitions, 150 flow. Second operand 3 states and 131 transitions. [2025-02-08 08:11:52,796 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 68 places, 64 transitions, 208 flow [2025-02-08 08:11:52,797 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 68 places, 64 transitions, 208 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-02-08 08:11:52,799 INFO L231 Difference]: Finished difference. Result has 68 places, 64 transitions, 140 flow [2025-02-08 08:11:52,799 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=85, PETRI_DIFFERENCE_MINUEND_FLOW=138, PETRI_DIFFERENCE_MINUEND_PLACES=66, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=64, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=63, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=140, PETRI_PLACES=68, PETRI_TRANSITIONS=64} [2025-02-08 08:11:52,800 INFO L279 CegarLoopForPetriNet]: 80 programPoint places, -12 predicate places. [2025-02-08 08:11:52,801 INFO L471 AbstractCegarLoop]: Abstraction has has 68 places, 64 transitions, 140 flow [2025-02-08 08:11:52,801 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 32.0) internal successors, (96), 3 states have internal predecessors, (96), 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 08:11:52,801 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 08:11:52,801 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 08:11:52,801 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-02-08 08:11:52,801 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting thr1Err18REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thr1Err17REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err18REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 20 more)] === [2025-02-08 08:11:52,803 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 08:11:52,803 INFO L85 PathProgramCache]: Analyzing trace with hash 434594603, now seen corresponding path program 1 times [2025-02-08 08:11:52,803 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 08:11:52,803 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2030966583] [2025-02-08 08:11:52,803 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 08:11:52,803 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 08:11:52,817 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-02-08 08:11:52,820 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-02-08 08:11:52,820 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 08:11:52,820 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 08:11:52,929 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 08:11:52,932 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 08:11:52,932 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2030966583] [2025-02-08 08:11:52,932 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2030966583] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 08:11:52,932 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 08:11:52,932 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-02-08 08:11:52,932 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [173653005] [2025-02-08 08:11:52,932 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 08:11:52,932 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 08:11:52,932 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 08:11:52,933 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 08:11:52,933 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 08:11:52,938 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 30 out of 85 [2025-02-08 08:11:52,938 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 68 places, 64 transitions, 140 flow. Second operand has 3 states, 3 states have (on average 32.0) internal successors, (96), 3 states have internal predecessors, (96), 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 08:11:52,938 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 08:11:52,938 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 30 of 85 [2025-02-08 08:11:52,938 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 08:11:53,146 INFO L124 PetriNetUnfolderBase]: 1065/2256 cut-off events. [2025-02-08 08:11:53,146 INFO L125 PetriNetUnfolderBase]: For 57/57 co-relation queries the response was YES. [2025-02-08 08:11:53,152 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3875 conditions, 2256 events. 1065/2256 cut-off events. For 57/57 co-relation queries the response was YES. Maximal size of possible extension queue 124. Compared 15792 event pairs, 936 based on Foata normal form. 0/2041 useless extension candidates. Maximal degree in co-relation 3869. Up to 1568 conditions per place. [2025-02-08 08:11:53,159 INFO L140 encePairwiseOnDemand]: 78/85 looper letters, 30 selfloop transitions, 1 changer transitions 0/58 dead transitions. [2025-02-08 08:11:53,160 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 64 places, 58 transitions, 190 flow [2025-02-08 08:11:53,160 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 08:11:53,160 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 08:11:53,161 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 127 transitions. [2025-02-08 08:11:53,161 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4980392156862745 [2025-02-08 08:11:53,161 INFO L175 Difference]: Start difference. First operand has 68 places, 64 transitions, 140 flow. Second operand 3 states and 127 transitions. [2025-02-08 08:11:53,161 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 64 places, 58 transitions, 190 flow [2025-02-08 08:11:53,162 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 63 places, 58 transitions, 189 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-02-08 08:11:53,162 INFO L231 Difference]: Finished difference. Result has 63 places, 58 transitions, 129 flow [2025-02-08 08:11:53,163 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=85, PETRI_DIFFERENCE_MINUEND_FLOW=127, PETRI_DIFFERENCE_MINUEND_PLACES=61, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=58, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=57, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=129, PETRI_PLACES=63, PETRI_TRANSITIONS=58} [2025-02-08 08:11:53,163 INFO L279 CegarLoopForPetriNet]: 80 programPoint places, -17 predicate places. [2025-02-08 08:11:53,163 INFO L471 AbstractCegarLoop]: Abstraction has has 63 places, 58 transitions, 129 flow [2025-02-08 08:11:53,163 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 32.0) internal successors, (96), 3 states have internal predecessors, (96), 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 08:11:53,163 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 08:11:53,163 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 2, 1, 1, 1, 1] [2025-02-08 08:11:53,164 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-02-08 08:11:53,164 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [thr1Err17REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err18REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 20 more)] === [2025-02-08 08:11:53,164 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 08:11:53,164 INFO L85 PathProgramCache]: Analyzing trace with hash -777274103, now seen corresponding path program 1 times [2025-02-08 08:11:53,164 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 08:11:53,164 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [519911618] [2025-02-08 08:11:53,164 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 08:11:53,164 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 08:11:53,170 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-02-08 08:11:53,172 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-02-08 08:11:53,172 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 08:11:53,172 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-08 08:11:53,172 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-08 08:11:53,174 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-02-08 08:11:53,178 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-02-08 08:11:53,178 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 08:11:53,178 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-08 08:11:53,181 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-08 08:11:53,182 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-02-08 08:11:53,182 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (22 of 23 remaining) [2025-02-08 08:11:53,182 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err17REQUIRES_VIOLATIONMEMORY_DEREFERENCE (21 of 23 remaining) [2025-02-08 08:11:53,182 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err18REQUIRES_VIOLATIONMEMORY_DEREFERENCE (20 of 23 remaining) [2025-02-08 08:11:53,182 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (19 of 23 remaining) [2025-02-08 08:11:53,182 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err13REQUIRES_VIOLATIONMEMORY_DEREFERENCE (18 of 23 remaining) [2025-02-08 08:11:53,182 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err15REQUIRES_VIOLATIONMEMORY_DEREFERENCE (17 of 23 remaining) [2025-02-08 08:11:53,182 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err16REQUIRES_VIOLATIONMEMORY_DEREFERENCE (16 of 23 remaining) [2025-02-08 08:11:53,182 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err14ASSERT_VIOLATIONMEMORY_LEAK (15 of 23 remaining) [2025-02-08 08:11:53,183 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (14 of 23 remaining) [2025-02-08 08:11:53,183 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err17REQUIRES_VIOLATIONMEMORY_DEREFERENCE (13 of 23 remaining) [2025-02-08 08:11:53,183 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err18REQUIRES_VIOLATIONMEMORY_DEREFERENCE (12 of 23 remaining) [2025-02-08 08:11:53,183 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (11 of 23 remaining) [2025-02-08 08:11:53,183 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err13REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 23 remaining) [2025-02-08 08:11:53,183 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err15REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 23 remaining) [2025-02-08 08:11:53,183 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err16REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 23 remaining) [2025-02-08 08:11:53,183 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err14ASSERT_VIOLATIONMEMORY_LEAK (7 of 23 remaining) [2025-02-08 08:11:53,183 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err17REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 23 remaining) [2025-02-08 08:11:53,183 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err18REQUIRES_VIOLATIONMEMORY_DEREFERENCE (5 of 23 remaining) [2025-02-08 08:11:53,183 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (4 of 23 remaining) [2025-02-08 08:11:53,183 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err13REQUIRES_VIOLATIONMEMORY_DEREFERENCE (3 of 23 remaining) [2025-02-08 08:11:53,184 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err15REQUIRES_VIOLATIONMEMORY_DEREFERENCE (2 of 23 remaining) [2025-02-08 08:11:53,184 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err16REQUIRES_VIOLATIONMEMORY_DEREFERENCE (1 of 23 remaining) [2025-02-08 08:11:53,184 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err14ASSERT_VIOLATIONMEMORY_LEAK (0 of 23 remaining) [2025-02-08 08:11:53,184 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-02-08 08:11:53,184 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1] [2025-02-08 08:11:53,184 WARN L246 ceAbstractionStarter]: 2 thread instances were not sufficient, I will increase this number and restart the analysis [2025-02-08 08:11:53,184 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 3 thread instances. [2025-02-08 08:11:53,221 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-02-08 08:11:53,223 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 116 places, 124 transitions, 266 flow [2025-02-08 08:11:53,235 INFO L124 PetriNetUnfolderBase]: 15/138 cut-off events. [2025-02-08 08:11:53,235 INFO L125 PetriNetUnfolderBase]: For 7/7 co-relation queries the response was YES. [2025-02-08 08:11:53,236 INFO L83 FinitePrefix]: Finished finitePrefix Result has 151 conditions, 138 events. 15/138 cut-off events. For 7/7 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 574 event pairs, 0 based on Foata normal form. 0/85 useless extension candidates. Maximal degree in co-relation 119. Up to 4 conditions per place. [2025-02-08 08:11:53,236 INFO L82 GeneralOperation]: Start removeDead. Operand has 116 places, 124 transitions, 266 flow [2025-02-08 08:11:53,237 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 116 places, 124 transitions, 266 flow [2025-02-08 08:11:53,238 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-08 08:11:53,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=None, 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;@710d523f, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-08 08:11:53,239 INFO L334 AbstractCegarLoop]: Starting to check reachability of 30 error locations. [2025-02-08 08:11:53,239 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-02-08 08:11:53,239 INFO L124 PetriNetUnfolderBase]: 0/3 cut-off events. [2025-02-08 08:11:53,240 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-02-08 08:11:53,240 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 08:11:53,240 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2025-02-08 08:11:53,240 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [thr1Err17REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err18REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 27 more)] === [2025-02-08 08:11:53,240 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 08:11:53,240 INFO L85 PathProgramCache]: Analyzing trace with hash 551458, now seen corresponding path program 1 times [2025-02-08 08:11:53,240 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 08:11:53,240 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1880563461] [2025-02-08 08:11:53,240 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 08:11:53,240 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 08:11:53,246 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-02-08 08:11:53,247 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-02-08 08:11:53,247 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 08:11:53,247 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 08:11:53,250 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 08:11:53,250 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 08:11:53,250 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1880563461] [2025-02-08 08:11:53,251 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1880563461] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 08:11:53,251 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 08:11:53,251 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 08:11:53,251 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [903203251] [2025-02-08 08:11:53,251 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 08:11:53,251 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-02-08 08:11:53,251 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 08:11:53,251 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-02-08 08:11:53,251 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-02-08 08:11:53,252 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 47 out of 124 [2025-02-08 08:11:53,252 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 116 places, 124 transitions, 266 flow. Second operand has 2 states, 2 states have (on average 48.0) internal successors, (96), 2 states have internal predecessors, (96), 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 08:11:53,252 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 08:11:53,252 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 47 of 124 [2025-02-08 08:11:53,252 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 08:11:57,589 INFO L124 PetriNetUnfolderBase]: 49000/81212 cut-off events. [2025-02-08 08:11:57,590 INFO L125 PetriNetUnfolderBase]: For 2438/2438 co-relation queries the response was YES. [2025-02-08 08:11:57,714 INFO L83 FinitePrefix]: Finished finitePrefix Result has 146721 conditions, 81212 events. 49000/81212 cut-off events. For 2438/2438 co-relation queries the response was YES. Maximal size of possible extension queue 4057. Compared 778691 event pairs, 45628 based on Foata normal form. 12018/75019 useless extension candidates. Maximal degree in co-relation 20293. Up to 64153 conditions per place. [2025-02-08 08:11:58,022 INFO L140 encePairwiseOnDemand]: 108/124 looper letters, 57 selfloop transitions, 0 changer transitions 0/103 dead transitions. [2025-02-08 08:11:58,022 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 105 places, 103 transitions, 338 flow [2025-02-08 08:11:58,023 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-02-08 08:11:58,023 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2025-02-08 08:11:58,023 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 167 transitions. [2025-02-08 08:11:58,024 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6733870967741935 [2025-02-08 08:11:58,024 INFO L175 Difference]: Start difference. First operand has 116 places, 124 transitions, 266 flow. Second operand 2 states and 167 transitions. [2025-02-08 08:11:58,024 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 105 places, 103 transitions, 338 flow [2025-02-08 08:11:58,026 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 105 places, 103 transitions, 336 flow, removed 1 selfloop flow, removed 0 redundant places. [2025-02-08 08:11:58,027 INFO L231 Difference]: Finished difference. Result has 105 places, 103 transitions, 222 flow [2025-02-08 08:11:58,028 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=124, PETRI_DIFFERENCE_MINUEND_FLOW=222, PETRI_DIFFERENCE_MINUEND_PLACES=104, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=103, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=103, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=222, PETRI_PLACES=105, PETRI_TRANSITIONS=103} [2025-02-08 08:11:58,029 INFO L279 CegarLoopForPetriNet]: 116 programPoint places, -11 predicate places. [2025-02-08 08:11:58,029 INFO L471 AbstractCegarLoop]: Abstraction has has 105 places, 103 transitions, 222 flow [2025-02-08 08:11:58,029 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 48.0) internal successors, (96), 2 states have internal predecessors, (96), 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 08:11:58,029 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 08:11:58,030 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 08:11:58,030 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-02-08 08:11:58,030 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting thr1Err17REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thr1Err17REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err18REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 27 more)] === [2025-02-08 08:11:58,030 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 08:11:58,031 INFO L85 PathProgramCache]: Analyzing trace with hash 637307076, now seen corresponding path program 1 times [2025-02-08 08:11:58,031 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 08:11:58,031 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1778467103] [2025-02-08 08:11:58,031 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 08:11:58,031 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 08:11:58,038 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-02-08 08:11:58,041 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-02-08 08:11:58,044 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 08:11:58,044 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 08:11:58,092 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 08:11:58,093 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 08:11:58,093 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1778467103] [2025-02-08 08:11:58,093 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1778467103] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 08:11:58,093 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 08:11:58,094 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-02-08 08:11:58,094 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [31858658] [2025-02-08 08:11:58,094 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 08:11:58,094 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 08:11:58,094 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 08:11:58,094 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 08:11:58,094 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 08:11:58,105 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 44 out of 124 [2025-02-08 08:11:58,106 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 105 places, 103 transitions, 222 flow. Second operand has 3 states, 3 states have (on average 46.0) internal successors, (138), 3 states have internal predecessors, (138), 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 08:11:58,106 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 08:11:58,106 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 44 of 124 [2025-02-08 08:11:58,106 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 08:12:00,892 INFO L124 PetriNetUnfolderBase]: 34656/58769 cut-off events. [2025-02-08 08:12:00,892 INFO L125 PetriNetUnfolderBase]: For 1281/1281 co-relation queries the response was YES. [2025-02-08 08:12:00,987 INFO L83 FinitePrefix]: Finished finitePrefix Result has 104649 conditions, 58769 events. 34656/58769 cut-off events. For 1281/1281 co-relation queries the response was YES. Maximal size of possible extension queue 2623. Compared 551094 event pairs, 31950 based on Foata normal form. 0/49023 useless extension candidates. Maximal degree in co-relation 104643. Up to 45056 conditions per place. [2025-02-08 08:12:01,170 INFO L140 encePairwiseOnDemand]: 114/124 looper letters, 50 selfloop transitions, 1 changer transitions 0/94 dead transitions. [2025-02-08 08:12:01,170 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 98 places, 94 transitions, 306 flow [2025-02-08 08:12:01,171 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 08:12:01,171 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 08:12:01,171 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 192 transitions. [2025-02-08 08:12:01,171 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5161290322580645 [2025-02-08 08:12:01,171 INFO L175 Difference]: Start difference. First operand has 105 places, 103 transitions, 222 flow. Second operand 3 states and 192 transitions. [2025-02-08 08:12:01,171 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 98 places, 94 transitions, 306 flow [2025-02-08 08:12:01,174 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 98 places, 94 transitions, 306 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-02-08 08:12:01,175 INFO L231 Difference]: Finished difference. Result has 98 places, 94 transitions, 206 flow [2025-02-08 08:12:01,175 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=124, PETRI_DIFFERENCE_MINUEND_FLOW=204, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=94, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=93, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=206, PETRI_PLACES=98, PETRI_TRANSITIONS=94} [2025-02-08 08:12:01,175 INFO L279 CegarLoopForPetriNet]: 116 programPoint places, -18 predicate places. [2025-02-08 08:12:01,175 INFO L471 AbstractCegarLoop]: Abstraction has has 98 places, 94 transitions, 206 flow [2025-02-08 08:12:01,175 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 46.0) internal successors, (138), 3 states have internal predecessors, (138), 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 08:12:01,176 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 08:12:01,176 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 08:12:01,176 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-02-08 08:12:01,176 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting thr1Err18REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thr1Err17REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err18REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 27 more)] === [2025-02-08 08:12:01,176 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 08:12:01,176 INFO L85 PathProgramCache]: Analyzing trace with hash 637307077, now seen corresponding path program 1 times [2025-02-08 08:12:01,176 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 08:12:01,176 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [492611490] [2025-02-08 08:12:01,176 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 08:12:01,177 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 08:12:01,183 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-02-08 08:12:01,187 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-02-08 08:12:01,187 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 08:12:01,187 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 08:12:01,263 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 08:12:01,264 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 08:12:01,264 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [492611490] [2025-02-08 08:12:01,264 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [492611490] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 08:12:01,264 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 08:12:01,264 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-02-08 08:12:01,264 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [564694883] [2025-02-08 08:12:01,264 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 08:12:01,264 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 08:12:01,264 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 08:12:01,264 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 08:12:01,264 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 08:12:01,276 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 44 out of 124 [2025-02-08 08:12:01,276 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 98 places, 94 transitions, 206 flow. Second operand has 3 states, 3 states have (on average 46.0) internal successors, (138), 3 states have internal predecessors, (138), 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 08:12:01,276 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 08:12:01,276 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 44 of 124 [2025-02-08 08:12:01,276 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 08:12:02,925 INFO L124 PetriNetUnfolderBase]: 23432/40910 cut-off events. [2025-02-08 08:12:02,926 INFO L125 PetriNetUnfolderBase]: For 1095/1095 co-relation queries the response was YES. [2025-02-08 08:12:03,006 INFO L83 FinitePrefix]: Finished finitePrefix Result has 71734 conditions, 40910 events. 23432/40910 cut-off events. For 1095/1095 co-relation queries the response was YES. Maximal size of possible extension queue 1671. Compared 374350 event pairs, 21320 based on Foata normal form. 0/36972 useless extension candidates. Maximal degree in co-relation 71727. Up to 30184 conditions per place. [2025-02-08 08:12:03,119 INFO L140 encePairwiseOnDemand]: 114/124 looper letters, 44 selfloop transitions, 1 changer transitions 0/85 dead transitions. [2025-02-08 08:12:03,119 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 91 places, 85 transitions, 278 flow [2025-02-08 08:12:03,123 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 08:12:03,124 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 08:12:03,124 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 186 transitions. [2025-02-08 08:12:03,125 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5 [2025-02-08 08:12:03,126 INFO L175 Difference]: Start difference. First operand has 98 places, 94 transitions, 206 flow. Second operand 3 states and 186 transitions. [2025-02-08 08:12:03,126 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 91 places, 85 transitions, 278 flow [2025-02-08 08:12:03,132 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 90 places, 85 transitions, 277 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-02-08 08:12:03,135 INFO L231 Difference]: Finished difference. Result has 90 places, 85 transitions, 189 flow [2025-02-08 08:12:03,136 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=124, PETRI_DIFFERENCE_MINUEND_FLOW=187, PETRI_DIFFERENCE_MINUEND_PLACES=88, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=85, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=84, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=189, PETRI_PLACES=90, PETRI_TRANSITIONS=85} [2025-02-08 08:12:03,140 INFO L279 CegarLoopForPetriNet]: 116 programPoint places, -26 predicate places. [2025-02-08 08:12:03,141 INFO L471 AbstractCegarLoop]: Abstraction has has 90 places, 85 transitions, 189 flow [2025-02-08 08:12:03,141 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 46.0) internal successors, (138), 3 states have internal predecessors, (138), 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 08:12:03,141 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 08:12:03,141 INFO L206 CegarLoopForPetriNet]: trace histogram [4, 3, 1, 1, 1, 1, 1] [2025-02-08 08:12:03,141 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-02-08 08:12:03,141 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [thr1Err17REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err18REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 27 more)] === [2025-02-08 08:12:03,142 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 08:12:03,142 INFO L85 PathProgramCache]: Analyzing trace with hash -2041050671, now seen corresponding path program 1 times [2025-02-08 08:12:03,142 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 08:12:03,142 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1068411602] [2025-02-08 08:12:03,142 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 08:12:03,142 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 08:12:03,158 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-02-08 08:12:03,160 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-02-08 08:12:03,160 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 08:12:03,160 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-08 08:12:03,167 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-08 08:12:03,170 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-02-08 08:12:03,181 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-02-08 08:12:03,181 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 08:12:03,181 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-08 08:12:03,193 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-08 08:12:03,196 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-02-08 08:12:03,197 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (29 of 30 remaining) [2025-02-08 08:12:03,197 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err17REQUIRES_VIOLATIONMEMORY_DEREFERENCE (28 of 30 remaining) [2025-02-08 08:12:03,197 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err18REQUIRES_VIOLATIONMEMORY_DEREFERENCE (27 of 30 remaining) [2025-02-08 08:12:03,197 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (26 of 30 remaining) [2025-02-08 08:12:03,197 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err13REQUIRES_VIOLATIONMEMORY_DEREFERENCE (25 of 30 remaining) [2025-02-08 08:12:03,197 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err15REQUIRES_VIOLATIONMEMORY_DEREFERENCE (24 of 30 remaining) [2025-02-08 08:12:03,197 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err16REQUIRES_VIOLATIONMEMORY_DEREFERENCE (23 of 30 remaining) [2025-02-08 08:12:03,197 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err14ASSERT_VIOLATIONMEMORY_LEAK (22 of 30 remaining) [2025-02-08 08:12:03,197 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (21 of 30 remaining) [2025-02-08 08:12:03,197 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err17REQUIRES_VIOLATIONMEMORY_DEREFERENCE (20 of 30 remaining) [2025-02-08 08:12:03,197 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err18REQUIRES_VIOLATIONMEMORY_DEREFERENCE (19 of 30 remaining) [2025-02-08 08:12:03,197 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (18 of 30 remaining) [2025-02-08 08:12:03,197 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err13REQUIRES_VIOLATIONMEMORY_DEREFERENCE (17 of 30 remaining) [2025-02-08 08:12:03,197 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err15REQUIRES_VIOLATIONMEMORY_DEREFERENCE (16 of 30 remaining) [2025-02-08 08:12:03,197 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err16REQUIRES_VIOLATIONMEMORY_DEREFERENCE (15 of 30 remaining) [2025-02-08 08:12:03,197 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err14ASSERT_VIOLATIONMEMORY_LEAK (14 of 30 remaining) [2025-02-08 08:12:03,197 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err17REQUIRES_VIOLATIONMEMORY_DEREFERENCE (13 of 30 remaining) [2025-02-08 08:12:03,197 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err18REQUIRES_VIOLATIONMEMORY_DEREFERENCE (12 of 30 remaining) [2025-02-08 08:12:03,197 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (11 of 30 remaining) [2025-02-08 08:12:03,197 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err13REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 30 remaining) [2025-02-08 08:12:03,201 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err15REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 30 remaining) [2025-02-08 08:12:03,201 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err16REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 30 remaining) [2025-02-08 08:12:03,201 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err14ASSERT_VIOLATIONMEMORY_LEAK (7 of 30 remaining) [2025-02-08 08:12:03,201 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err17REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 30 remaining) [2025-02-08 08:12:03,201 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err18REQUIRES_VIOLATIONMEMORY_DEREFERENCE (5 of 30 remaining) [2025-02-08 08:12:03,201 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (4 of 30 remaining) [2025-02-08 08:12:03,202 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err13REQUIRES_VIOLATIONMEMORY_DEREFERENCE (3 of 30 remaining) [2025-02-08 08:12:03,202 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err15REQUIRES_VIOLATIONMEMORY_DEREFERENCE (2 of 30 remaining) [2025-02-08 08:12:03,202 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err16REQUIRES_VIOLATIONMEMORY_DEREFERENCE (1 of 30 remaining) [2025-02-08 08:12:03,202 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err14ASSERT_VIOLATIONMEMORY_LEAK (0 of 30 remaining) [2025-02-08 08:12:03,202 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-02-08 08:12:03,202 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1] [2025-02-08 08:12:03,202 WARN L246 ceAbstractionStarter]: 3 thread instances were not sufficient, I will increase this number and restart the analysis [2025-02-08 08:12:03,203 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 4 thread instances. [2025-02-08 08:12:03,253 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-02-08 08:12:03,254 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 152 places, 163 transitions, 354 flow [2025-02-08 08:12:03,266 INFO L124 PetriNetUnfolderBase]: 20/182 cut-off events. [2025-02-08 08:12:03,266 INFO L125 PetriNetUnfolderBase]: For 16/16 co-relation queries the response was YES. [2025-02-08 08:12:03,267 INFO L83 FinitePrefix]: Finished finitePrefix Result has 201 conditions, 182 events. 20/182 cut-off events. For 16/16 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 830 event pairs, 0 based on Foata normal form. 0/112 useless extension candidates. Maximal degree in co-relation 157. Up to 5 conditions per place. [2025-02-08 08:12:03,267 INFO L82 GeneralOperation]: Start removeDead. Operand has 152 places, 163 transitions, 354 flow [2025-02-08 08:12:03,270 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 152 places, 163 transitions, 354 flow [2025-02-08 08:12:03,271 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-08 08:12:03,272 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=None, 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;@710d523f, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-08 08:12:03,272 INFO L334 AbstractCegarLoop]: Starting to check reachability of 37 error locations. [2025-02-08 08:12:03,272 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-02-08 08:12:03,274 INFO L124 PetriNetUnfolderBase]: 0/3 cut-off events. [2025-02-08 08:12:03,274 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-02-08 08:12:03,274 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 08:12:03,275 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2025-02-08 08:12:03,275 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [thr1Err17REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err18REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 34 more)] === [2025-02-08 08:12:03,275 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 08:12:03,275 INFO L85 PathProgramCache]: Analyzing trace with hash 713317, now seen corresponding path program 1 times [2025-02-08 08:12:03,275 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 08:12:03,275 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [707817804] [2025-02-08 08:12:03,275 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 08:12:03,275 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 08:12:03,279 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-02-08 08:12:03,280 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-02-08 08:12:03,280 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 08:12:03,280 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 08:12:03,283 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 08:12:03,285 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 08:12:03,285 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [707817804] [2025-02-08 08:12:03,285 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [707817804] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 08:12:03,285 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 08:12:03,285 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 08:12:03,286 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1056322619] [2025-02-08 08:12:03,286 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 08:12:03,286 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-02-08 08:12:03,286 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 08:12:03,286 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-02-08 08:12:03,286 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-02-08 08:12:03,287 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 62 out of 163 [2025-02-08 08:12:03,287 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 152 places, 163 transitions, 354 flow. Second operand has 2 states, 2 states have (on average 63.0) internal successors, (126), 2 states have internal predecessors, (126), 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 08:12:03,287 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 08:12:03,287 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 62 of 163 [2025-02-08 08:12:03,287 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand