./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/pthread-ext/26_stack_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/26_stack_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 3df48c747d95355ac505f3aa498934ae4a3962ec64d7e6dbfdd54f02fbeda355 --- Real Ultimate output --- This is Ultimate 0.3.0-?-48c9605-m [2025-02-08 08:12:39,797 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-08 08:12:39,839 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:12:39,843 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-08 08:12:39,843 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-08 08:12:39,869 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-08 08:12:39,870 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-08 08:12:39,870 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-08 08:12:39,870 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-08 08:12:39,870 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-08 08:12:39,870 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-08 08:12:39,870 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-08 08:12:39,871 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-08 08:12:39,871 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-08 08:12:39,871 INFO L153 SettingsManager]: * Use SBE=true [2025-02-08 08:12:39,871 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-08 08:12:39,871 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-08 08:12:39,871 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-08 08:12:39,871 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-08 08:12:39,871 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-08 08:12:39,871 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2025-02-08 08:12:39,871 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2025-02-08 08:12:39,871 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2025-02-08 08:12:39,871 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-08 08:12:39,871 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-02-08 08:12:39,873 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-02-08 08:12:39,873 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-08 08:12:39,873 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-08 08:12:39,873 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-08 08:12:39,873 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-08 08:12:39,873 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-08 08:12:39,873 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-08 08:12:39,873 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-08 08:12:39,873 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-08 08:12:39,873 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-08 08:12:39,873 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-08 08:12:39,873 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-08 08:12:39,873 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-08 08:12:39,873 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-08 08:12:39,873 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-08 08:12:39,873 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-08 08:12:39,873 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-08 08:12:39,874 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 -> 3df48c747d95355ac505f3aa498934ae4a3962ec64d7e6dbfdd54f02fbeda355 [2025-02-08 08:12:40,100 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-08 08:12:40,106 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-08 08:12:40,108 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-08 08:12:40,109 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-08 08:12:40,109 INFO L274 PluginConnector]: CDTParser initialized [2025-02-08 08:12:40,110 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/pthread-ext/26_stack_cas.i [2025-02-08 08:12:41,284 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/f1af4eede/4a0e1b3fe05a417494867aaa78c54c50/FLAG8ff7c01be [2025-02-08 08:12:41,617 INFO L384 CDTParser]: Found 1 translation units. [2025-02-08 08:12:41,618 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/pthread-ext/26_stack_cas.i [2025-02-08 08:12:41,641 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/f1af4eede/4a0e1b3fe05a417494867aaa78c54c50/FLAG8ff7c01be [2025-02-08 08:12:41,863 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/f1af4eede/4a0e1b3fe05a417494867aaa78c54c50 [2025-02-08 08:12:41,865 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-08 08:12:41,867 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-08 08:12:41,870 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-08 08:12:41,870 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-08 08:12:41,873 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-08 08:12:41,873 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.02 08:12:41" (1/1) ... [2025-02-08 08:12:41,876 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@756e6a64 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 08:12:41, skipping insertion in model container [2025-02-08 08:12:41,876 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.02 08:12:41" (1/1) ... [2025-02-08 08:12:41,900 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-08 08:12:42,117 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-08 08:12:42,126 INFO L200 MainTranslator]: Completed pre-run [2025-02-08 08:12:42,175 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-08 08:12:42,207 INFO L204 MainTranslator]: Completed translation [2025-02-08 08:12:42,208 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 08:12:42 WrapperNode [2025-02-08 08:12:42,208 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-08 08:12:42,209 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-08 08:12:42,209 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-08 08:12:42,209 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-08 08:12:42,213 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:12:42" (1/1) ... [2025-02-08 08:12:42,219 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:12:42" (1/1) ... [2025-02-08 08:12:42,238 INFO L138 Inliner]: procedures = 179, calls = 47, calls flagged for inlining = 17, calls inlined = 20, statements flattened = 247 [2025-02-08 08:12:42,240 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-08 08:12:42,240 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-08 08:12:42,240 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-08 08:12:42,240 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-08 08:12:42,246 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 08:12:42" (1/1) ... [2025-02-08 08:12:42,246 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 08:12:42" (1/1) ... [2025-02-08 08:12:42,248 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 08:12:42" (1/1) ... [2025-02-08 08:12:42,271 INFO L175 MemorySlicer]: Split 24 memory accesses to 4 slices as follows [2, 4, 6, 12]. 50 percent of accesses are in the largest equivalence class. The 6 initializations are split as follows [2, 1, 1, 2]. The 9 writes are split as follows [0, 2, 2, 5]. [2025-02-08 08:12:42,271 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 08:12:42" (1/1) ... [2025-02-08 08:12:42,271 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 08:12:42" (1/1) ... [2025-02-08 08:12:42,278 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 08:12:42" (1/1) ... [2025-02-08 08:12:42,279 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 08:12:42" (1/1) ... [2025-02-08 08:12:42,280 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 08:12:42" (1/1) ... [2025-02-08 08:12:42,280 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 08:12:42" (1/1) ... [2025-02-08 08:12:42,282 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-08 08:12:42,286 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-08 08:12:42,287 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-08 08:12:42,287 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-08 08:12:42,287 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 08:12:42" (1/1) ... [2025-02-08 08:12:42,295 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-08 08:12:42,304 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 08:12:42,319 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:12:42,328 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:12:42,345 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-02-08 08:12:42,345 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-02-08 08:12:42,345 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2025-02-08 08:12:42,345 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2025-02-08 08:12:42,346 INFO L130 BoogieDeclarations]: Found specification of procedure thr1 [2025-02-08 08:12:42,346 INFO L138 BoogieDeclarations]: Found implementation of procedure thr1 [2025-02-08 08:12:42,346 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-02-08 08:12:42,346 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-02-08 08:12:42,346 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2025-02-08 08:12:42,346 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2025-02-08 08:12:42,346 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2025-02-08 08:12:42,346 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-08 08:12:42,346 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-02-08 08:12:42,347 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-02-08 08:12:42,347 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-02-08 08:12:42,347 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-02-08 08:12:42,347 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-02-08 08:12:42,347 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2025-02-08 08:12:42,347 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2025-02-08 08:12:42,347 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-08 08:12:42,347 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-08 08:12:42,348 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:12:42,466 INFO L257 CfgBuilder]: Building ICFG [2025-02-08 08:12:42,468 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-08 08:12:42,764 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L713: SUMMARY for call write~int#1(0, __VERIFIER_atomic_CAS_~r#1.base, __VERIFIER_atomic_CAS_~r#1.offset, 4); srcloc: null [2025-02-08 08:12:42,764 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L713: assume !(1 == #valid[__VERIFIER_atomic_CAS_~r#1.base]); [2025-02-08 08:12:42,764 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L713: 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:12:42,764 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L746-1: push_#res#1 := 0; [2025-02-08 08:12:42,764 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L763: assume { :end_inline_reach_error } true;assume false; [2025-02-08 08:12:42,764 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L763-1: havoc reach_error_#t~nondet0#1.base, reach_error_#t~nondet0#1.offset; [2025-02-08 08:12:42,764 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L763-2: assume { :begin_inline_reach_error } true;havoc reach_error_#t~nondet0#1.base, reach_error_#t~nondet0#1.offset; [2025-02-08 08:12:42,764 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L763-3: havoc __VERIFIER_atomic_assert_#t~short11#1; [2025-02-08 08:12:42,764 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L763-4: havoc __VERIFIER_atomic_assert_#t~short11#1; [2025-02-08 08:12:42,764 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L763-5: assume !__VERIFIER_atomic_assert_#t~short11#1; [2025-02-08 08:12:42,764 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L763-5: assume !!__VERIFIER_atomic_assert_#t~short11#1; [2025-02-08 08:12:42,764 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L763-6: havoc __VERIFIER_atomic_assert_#t~ret10#1; [2025-02-08 08:12:42,764 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L763-7: havoc __VERIFIER_atomic_assert_#t~ret10#1; [2025-02-08 08:12:42,764 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L763-8: __VERIFIER_atomic_assert_#t~short11#1 := 0 == __VERIFIER_atomic_assert_#t~ret10#1; [2025-02-08 08:12:42,765 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L763-9: assume { :end_inline_isEmpty } true;assume -2147483648 <= __VERIFIER_atomic_assert_#t~ret10#1 && __VERIFIER_atomic_assert_#t~ret10#1 <= 2147483647; [2025-02-08 08:12:42,765 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L763-10: havoc isEmpty_#t~mem6#1; [2025-02-08 08:12:42,765 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L763-11: __VERIFIER_atomic_assert_#t~ret10#1 := isEmpty_#res#1; [2025-02-08 08:12:42,765 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L763-12: havoc isEmpty_#t~mem6#1; [2025-02-08 08:12:42,765 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L763-13: assume __VERIFIER_atomic_assert_#t~short11#1; [2025-02-08 08:12:42,765 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L763-13: assume !__VERIFIER_atomic_assert_#t~short11#1; [2025-02-08 08:12:42,765 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L763-14: assume { :begin_inline_isEmpty } true;havoc isEmpty_#res#1; [2025-02-08 08:12:42,765 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L763-15: __VERIFIER_atomic_assert_#t~short11#1 := 0 == __VERIFIER_atomic_assert_~r#1; [2025-02-08 08:12:42,765 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L748: assume 0 <= push_~newTop~0#1 % 4294967296 && push_~newTop~0#1 % 4294967296 < 65; [2025-02-08 08:12:42,765 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L748: assume !(0 <= push_~newTop~0#1 % 4294967296 && push_~newTop~0#1 % 4294967296 < 65); [2025-02-08 08:12:42,767 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L748-1: ~memory~0 := ~memory~0[push_~newTop~0#1 := push_~d#1]; [2025-02-08 08:12:42,768 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L749: assume true; [2025-02-08 08:12:42,768 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L749: assume !true; [2025-02-08 08:12:42,768 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L750: [2025-02-08 08:12:42,768 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L701: __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:12:42,768 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L701-1: __VERIFIER_atomic_CAS_~u#1 := __VERIFIER_atomic_CAS_#in~u#1; [2025-02-08 08:12:42,768 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L701-2: __VERIFIER_atomic_CAS_~e#1 := __VERIFIER_atomic_CAS_#in~e#1; [2025-02-08 08:12:42,768 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L701-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:12:42,768 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L751: havoc push_#t~mem8#1; [2025-02-08 08:12:42,768 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L751-1: push_~oldTop~0#1 := push_#t~mem8#1; [2025-02-08 08:12:42,768 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L751-2: SUMMARY for call push_#t~mem8#1 := read~int#2(~#top~0.base, ~#top~0.offset, 4); srcloc: null [2025-02-08 08:12:42,768 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L751-2: assume !(1 == #valid[~#top~0.base]); [2025-02-08 08:12:42,768 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L751-2: assume !(4 + ~#top~0.offset <= #length[~#top~0.base] && 0 <= ~#top~0.offset); [2025-02-08 08:12:42,768 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L752: [2025-02-08 08:12:42,768 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L769: havoc push_loop_#t~ret13#1; [2025-02-08 08:12:42,768 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L769-1: push_loop_~r~0#1 := push_loop_#t~ret13#1; [2025-02-08 08:12:42,768 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L769-2: assume { :end_inline_push } true;assume -2147483648 <= push_loop_#t~ret13#1 && push_loop_#t~ret13#1 <= 2147483647; [2025-02-08 08:12:42,768 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L769-3: havoc push_#in~d#1; [2025-02-08 08:12:42,768 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L769-4: havoc push_#t~ret7#1, push_#t~mem8#1, push_#t~mem9#1, push_~d#1, push_~oldTop~0#1, push_~newTop~0#1, push_~#casret~0#1.base, push_~#casret~0#1.offset; [2025-02-08 08:12:42,768 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L769-5: push_loop_#t~ret13#1 := push_#res#1; [2025-02-08 08:12:42,768 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L753: assume 0 <= (1 + push_~newTop~0#1) % 4294967296 && (1 + push_~newTop~0#1) % 4294967296 < 65; [2025-02-08 08:12:42,768 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L753: assume !(0 <= (1 + push_~newTop~0#1) % 4294967296 && (1 + push_~newTop~0#1) % 4294967296 < 65); [2025-02-08 08:12:42,768 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L753-1: ~memory~0 := ~memory~0[1 + push_~newTop~0#1 := push_~oldTop~0#1]; [2025-02-08 08:12:42,768 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L770: [2025-02-08 08:12:42,768 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L770-1: havoc __VERIFIER_atomic_assert_#in~r#1;assume { :end_inline___VERIFIER_atomic_assert } true; [2025-02-08 08:12:42,768 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L737: assume 0 == isEmpty_#t~mem6#1; [2025-02-08 08:12:42,769 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L737: assume !(0 == isEmpty_#t~mem6#1); [2025-02-08 08:12:42,769 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L770-2: havoc __VERIFIER_atomic_assert_#t~ret10#1, __VERIFIER_atomic_assert_#t~short11#1, __VERIFIER_atomic_assert_~r#1; [2025-02-08 08:12:42,769 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L737-1: havoc isEmpty_#t~mem6#1; [2025-02-08 08:12:42,769 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L737-2: havoc isEmpty_#t~mem6#1; [2025-02-08 08:12:42,769 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L770-3: havoc __VERIFIER_atomic_assert_#t~ret10#1, __VERIFIER_atomic_assert_#t~short11#1, __VERIFIER_atomic_assert_~r#1; [2025-02-08 08:12:42,769 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L737-3: SUMMARY for call isEmpty_#t~mem6#1 := read~int#2(~#top~0.base, ~#top~0.offset, 4); srcloc: null [2025-02-08 08:12:42,769 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L737-3: assume !(1 == #valid[~#top~0.base]); [2025-02-08 08:12:42,769 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L737-3: assume !(4 + ~#top~0.offset <= #length[~#top~0.base] && 0 <= ~#top~0.offset); [2025-02-08 08:12:42,769 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L770-4: assume { :begin_inline___VERIFIER_atomic_assert } true;__VERIFIER_atomic_assert_#in~r#1 := push_loop_~r~0#1; [2025-02-08 08:12:42,769 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L754: [2025-02-08 08:12:42,769 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L754-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:12:42,769 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L754-2: havoc __VERIFIER_atomic_CAS_#t~mem5#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:12:42,769 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L754-3: havoc __VERIFIER_atomic_CAS_#t~mem5#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:12:42,769 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L754-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 := ~#top~0.base, ~#top~0.offset, push_~oldTop~0#1, push_~newTop~0#1, push_~#casret~0#1.base, push_~#casret~0#1.offset; [2025-02-08 08:12:42,769 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L738-1: isEmpty_#res#1 := 1; [2025-02-08 08:12:42,769 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L755: assume 1 == push_#t~mem9#1; [2025-02-08 08:12:42,769 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L755: assume !(1 == push_#t~mem9#1); [2025-02-08 08:12:42,769 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L755-1: havoc push_#t~mem9#1; [2025-02-08 08:12:42,769 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L755-2: havoc push_#t~mem9#1; [2025-02-08 08:12:42,769 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L755-3: SUMMARY for call push_#t~mem9#1 := read~int#1(push_~#casret~0#1.base, push_~#casret~0#1.offset, 4); srcloc: null [2025-02-08 08:12:42,769 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L755-3: assume !(1 == #valid[push_~#casret~0#1.base]); [2025-02-08 08:12:42,771 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L755-3: assume !(4 + push_~#casret~0#1.offset <= #length[push_~#casret~0#1.base] && 0 <= push_~#casret~0#1.offset); [2025-02-08 08:12:42,771 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L756-1: push_#res#1 := 1; [2025-02-08 08:12:42,771 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L740-1: isEmpty_#res#1 := 0; [2025-02-08 08:12:42,771 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L707: assume __VERIFIER_atomic_CAS_#t~mem5#1 == __VERIFIER_atomic_CAS_~e#1; [2025-02-08 08:12:42,771 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L707: assume !(__VERIFIER_atomic_CAS_#t~mem5#1 == __VERIFIER_atomic_CAS_~e#1); [2025-02-08 08:12:42,771 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L707-1: havoc __VERIFIER_atomic_CAS_#t~mem5#1; [2025-02-08 08:12:42,772 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L707-2: havoc __VERIFIER_atomic_CAS_#t~mem5#1; [2025-02-08 08:12:42,772 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L707-3: SUMMARY for call __VERIFIER_atomic_CAS_#t~mem5#1 := read~int#2(__VERIFIER_atomic_CAS_~v#1.base, __VERIFIER_atomic_CAS_~v#1.offset, 4); srcloc: null [2025-02-08 08:12:42,772 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L707-3: assume !(1 == #valid[__VERIFIER_atomic_CAS_~v#1.base]); [2025-02-08 08:12:42,772 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L707-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:12:42,773 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L709: SUMMARY for call write~int#1(1, __VERIFIER_atomic_CAS_~r#1.base, __VERIFIER_atomic_CAS_~r#1.offset, 4); srcloc: null [2025-02-08 08:12:42,773 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L709: assume !(1 == #valid[__VERIFIER_atomic_CAS_~r#1.base]); [2025-02-08 08:12:42,773 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L709: 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:12:42,773 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L709-1: SUMMARY for call write~int#2(__VERIFIER_atomic_CAS_~u#1, __VERIFIER_atomic_CAS_~v#1.base, __VERIFIER_atomic_CAS_~v#1.offset, 4); srcloc: null [2025-02-08 08:12:42,773 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L709-1: assume !(1 == #valid[__VERIFIER_atomic_CAS_~v#1.base]); [2025-02-08 08:12:42,773 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L709-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:12:42,773 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L743: havoc push_~#casret~0#1.base, push_~#casret~0#1.offset; [2025-02-08 08:12:42,773 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L743-1: SUMMARY for call ULTIMATE.dealloc(push_~#casret~0#1.base, push_~#casret~0#1.offset); srcloc: null [2025-02-08 08:12:42,773 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L743-2: havoc push_~#casret~0#1.base, push_~#casret~0#1.offset; [2025-02-08 08:12:42,773 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L743-3: SUMMARY for call ULTIMATE.dealloc(push_~#casret~0#1.base, push_~#casret~0#1.offset); srcloc: null [2025-02-08 08:12:42,776 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L743-4: havoc push_~#casret~0#1.base, push_~#casret~0#1.offset; [2025-02-08 08:12:42,777 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L743-5: SUMMARY for call ULTIMATE.dealloc(push_~#casret~0#1.base, push_~#casret~0#1.offset); srcloc: null [2025-02-08 08:12:42,777 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L17: assume false; [2025-02-08 08:12:42,777 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L17: assume !false; [2025-02-08 08:12:42,777 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L17-1: assume false; [2025-02-08 08:12:42,777 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L17-1: assume !false; [2025-02-08 08:12:42,777 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L744: havoc push_#t~ret7#1; [2025-02-08 08:12:42,777 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L744-1: push_~newTop~0#1 := push_#t~ret7#1; [2025-02-08 08:12:42,777 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L744-2: assume { :end_inline_index_malloc } true;assume -2147483648 <= push_#t~ret7#1 && push_#t~ret7#1 <= 2147483647; [2025-02-08 08:12:42,777 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L744-3: havoc index_malloc_~curr_alloc_idx~0#1; [2025-02-08 08:12:42,777 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L744-4: push_#t~ret7#1 := index_malloc_#res#1; [2025-02-08 08:12:42,777 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L761: __VERIFIER_atomic_assert_~r#1 := __VERIFIER_atomic_assert_#in~r#1; [2025-02-08 08:12:42,777 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L745: assume 0 == push_~newTop~0#1; [2025-02-08 08:12:42,777 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L745: assume !(0 == push_~newTop~0#1); [2025-02-08 08:12:42,877 INFO L304 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-02-08 08:12:42,877 INFO L308 CfgBuilder]: Performing block encoding [2025-02-08 08:12:43,198 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-08 08:12:43,198 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-08 08:12:43,198 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.02 08:12:43 BoogieIcfgContainer [2025-02-08 08:12:43,198 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-08 08:12:43,200 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-08 08:12:43,200 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-08 08:12:43,203 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-08 08:12:43,204 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.02 08:12:41" (1/3) ... [2025-02-08 08:12:43,205 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@460c124e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.02 08:12:43, skipping insertion in model container [2025-02-08 08:12:43,205 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 08:12:42" (2/3) ... [2025-02-08 08:12:43,205 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@460c124e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.02 08:12:43, skipping insertion in model container [2025-02-08 08:12:43,205 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.02 08:12:43" (3/3) ... [2025-02-08 08:12:43,205 INFO L128 eAbstractionObserver]: Analyzing ICFG 26_stack_cas.i [2025-02-08 08:12:43,217 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-08 08:12:43,218 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG 26_stack_cas.i that has 2 procedures, 48 locations, 1 initial locations, 3 loop locations, and 40 error locations. [2025-02-08 08:12:43,218 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-02-08 08:12:43,267 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-02-08 08:12:43,293 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 51 places, 50 transitions, 104 flow [2025-02-08 08:12:43,321 INFO L124 PetriNetUnfolderBase]: 2/54 cut-off events. [2025-02-08 08:12:43,324 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-02-08 08:12:43,326 INFO L83 FinitePrefix]: Finished finitePrefix Result has 58 conditions, 54 events. 2/54 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 122 event pairs, 0 based on Foata normal form. 0/24 useless extension candidates. Maximal degree in co-relation 47. Up to 2 conditions per place. [2025-02-08 08:12:43,326 INFO L82 GeneralOperation]: Start removeDead. Operand has 51 places, 50 transitions, 104 flow [2025-02-08 08:12:43,328 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 51 places, 50 transitions, 104 flow [2025-02-08 08:12:43,336 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-08 08:12:43,347 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;@873c9a5, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-08 08:12:43,347 INFO L334 AbstractCegarLoop]: Starting to check reachability of 46 error locations. [2025-02-08 08:12:43,353 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-02-08 08:12:43,353 INFO L124 PetriNetUnfolderBase]: 0/3 cut-off events. [2025-02-08 08:12:43,353 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-02-08 08:12:43,353 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 08:12:43,355 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2025-02-08 08:12:43,355 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [thr1Err37REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err38REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err35REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 43 more)] === [2025-02-08 08:12:43,359 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 08:12:43,360 INFO L85 PathProgramCache]: Analyzing trace with hash 624084, now seen corresponding path program 1 times [2025-02-08 08:12:43,365 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 08:12:43,367 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [990300349] [2025-02-08 08:12:43,367 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 08:12:43,368 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 08:12:43,687 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-02-08 08:12:43,714 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-02-08 08:12:43,715 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 08:12:43,715 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 08:12:43,802 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:43,803 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 08:12:43,803 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [990300349] [2025-02-08 08:12:43,803 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [990300349] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 08:12:43,803 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 08:12:43,803 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 08:12:43,804 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [562311740] [2025-02-08 08:12:43,805 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 08:12:43,810 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-02-08 08:12:43,812 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 08:12:43,827 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-02-08 08:12:43,828 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-02-08 08:12:43,829 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 50 [2025-02-08 08:12:43,830 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 51 places, 50 transitions, 104 flow. Second operand has 2 states, 2 states have (on average 14.0) internal successors, (28), 2 states have internal predecessors, (28), 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:43,830 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 08:12:43,831 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 50 [2025-02-08 08:12:43,831 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 08:12:43,900 INFO L124 PetriNetUnfolderBase]: 51/140 cut-off events. [2025-02-08 08:12:43,901 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-02-08 08:12:43,901 INFO L83 FinitePrefix]: Finished finitePrefix Result has 257 conditions, 140 events. 51/140 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 491 event pairs, 39 based on Foata normal form. 0/95 useless extension candidates. Maximal degree in co-relation 237. Up to 113 conditions per place. [2025-02-08 08:12:43,902 INFO L140 encePairwiseOnDemand]: 38/50 looper letters, 24 selfloop transitions, 0 changer transitions 0/36 dead transitions. [2025-02-08 08:12:43,903 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 38 places, 36 transitions, 124 flow [2025-02-08 08:12:43,903 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-02-08 08:12:43,905 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2025-02-08 08:12:43,909 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 62 transitions. [2025-02-08 08:12:43,910 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.62 [2025-02-08 08:12:43,911 INFO L175 Difference]: Start difference. First operand has 51 places, 50 transitions, 104 flow. Second operand 2 states and 62 transitions. [2025-02-08 08:12:43,912 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 38 places, 36 transitions, 124 flow [2025-02-08 08:12:43,916 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 38 places, 36 transitions, 124 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-02-08 08:12:43,918 INFO L231 Difference]: Finished difference. Result has 38 places, 36 transitions, 76 flow [2025-02-08 08:12:43,920 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=50, PETRI_DIFFERENCE_MINUEND_FLOW=76, PETRI_DIFFERENCE_MINUEND_PLACES=37, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=36, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=36, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=76, PETRI_PLACES=38, PETRI_TRANSITIONS=36} [2025-02-08 08:12:43,923 INFO L279 CegarLoopForPetriNet]: 51 programPoint places, -13 predicate places. [2025-02-08 08:12:43,923 INFO L471 AbstractCegarLoop]: Abstraction has has 38 places, 36 transitions, 76 flow [2025-02-08 08:12:43,923 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 14.0) internal successors, (28), 2 states have internal predecessors, (28), 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:43,923 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 08:12:43,923 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2025-02-08 08:12:43,923 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-02-08 08:12:43,924 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting thr1Err37REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thr1Err37REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err38REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err35REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 43 more)] === [2025-02-08 08:12:43,925 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 08:12:43,925 INFO L85 PathProgramCache]: Analyzing trace with hash 599882095, now seen corresponding path program 1 times [2025-02-08 08:12:43,925 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 08:12:43,925 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1153385799] [2025-02-08 08:12:43,925 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 08:12:43,925 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 08:12:44,167 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-02-08 08:12:44,186 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-02-08 08:12:44,186 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 08:12:44,186 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 08:12:44,291 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:44,291 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 08:12:44,291 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1153385799] [2025-02-08 08:12:44,291 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1153385799] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 08:12:44,291 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 08:12:44,291 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-02-08 08:12:44,291 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2057665223] [2025-02-08 08:12:44,291 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 08:12:44,292 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 08:12:44,292 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 08:12:44,294 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 08:12:44,295 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 08:12:44,298 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 50 [2025-02-08 08:12:44,298 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 38 places, 36 transitions, 76 flow. Second operand has 3 states, 3 states have (on average 14.333333333333334) internal successors, (43), 3 states have internal predecessors, (43), 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:44,298 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 08:12:44,298 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 50 [2025-02-08 08:12:44,298 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 08:12:44,348 INFO L124 PetriNetUnfolderBase]: 45/126 cut-off events. [2025-02-08 08:12:44,349 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-02-08 08:12:44,350 INFO L83 FinitePrefix]: Finished finitePrefix Result has 232 conditions, 126 events. 45/126 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 415 event pairs, 35 based on Foata normal form. 0/89 useless extension candidates. Maximal degree in co-relation 228. Up to 100 conditions per place. [2025-02-08 08:12:44,352 INFO L140 encePairwiseOnDemand]: 47/50 looper letters, 21 selfloop transitions, 1 changer transitions 0/34 dead transitions. [2025-02-08 08:12:44,352 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 38 places, 34 transitions, 116 flow [2025-02-08 08:12:44,352 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 08:12:44,352 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 08:12:44,353 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 63 transitions. [2025-02-08 08:12:44,354 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.42 [2025-02-08 08:12:44,354 INFO L175 Difference]: Start difference. First operand has 38 places, 36 transitions, 76 flow. Second operand 3 states and 63 transitions. [2025-02-08 08:12:44,354 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 38 places, 34 transitions, 116 flow [2025-02-08 08:12:44,355 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 38 places, 34 transitions, 116 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-02-08 08:12:44,356 INFO L231 Difference]: Finished difference. Result has 38 places, 34 transitions, 74 flow [2025-02-08 08:12:44,357 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=50, PETRI_DIFFERENCE_MINUEND_FLOW=72, PETRI_DIFFERENCE_MINUEND_PLACES=36, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=34, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=33, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=74, PETRI_PLACES=38, PETRI_TRANSITIONS=34} [2025-02-08 08:12:44,357 INFO L279 CegarLoopForPetriNet]: 51 programPoint places, -13 predicate places. [2025-02-08 08:12:44,357 INFO L471 AbstractCegarLoop]: Abstraction has has 38 places, 34 transitions, 74 flow [2025-02-08 08:12:44,357 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 14.333333333333334) internal successors, (43), 3 states have internal predecessors, (43), 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:44,357 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 08:12:44,358 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2025-02-08 08:12:44,358 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-02-08 08:12:44,358 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting thr1Err38REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thr1Err37REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err38REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err35REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 43 more)] === [2025-02-08 08:12:44,358 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 08:12:44,359 INFO L85 PathProgramCache]: Analyzing trace with hash 599882096, now seen corresponding path program 1 times [2025-02-08 08:12:44,359 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 08:12:44,359 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [427563071] [2025-02-08 08:12:44,359 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 08:12:44,359 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 08:12:44,527 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-02-08 08:12:44,550 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-02-08 08:12:44,553 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 08:12:44,553 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 08:12:44,719 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:44,720 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 08:12:44,720 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [427563071] [2025-02-08 08:12:44,720 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [427563071] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 08:12:44,720 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 08:12:44,720 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-02-08 08:12:44,720 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [568306125] [2025-02-08 08:12:44,720 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 08:12:44,721 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 08:12:44,722 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 08:12:44,722 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 08:12:44,724 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 08:12:44,726 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 50 [2025-02-08 08:12:44,726 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 38 places, 34 transitions, 74 flow. Second operand has 3 states, 3 states have (on average 14.333333333333334) internal successors, (43), 3 states have internal predecessors, (43), 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:44,726 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 08:12:44,726 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 50 [2025-02-08 08:12:44,726 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 08:12:44,774 INFO L124 PetriNetUnfolderBase]: 39/112 cut-off events. [2025-02-08 08:12:44,775 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-02-08 08:12:44,775 INFO L83 FinitePrefix]: Finished finitePrefix Result has 208 conditions, 112 events. 39/112 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 342 event pairs, 31 based on Foata normal form. 0/83 useless extension candidates. Maximal degree in co-relation 203. Up to 88 conditions per place. [2025-02-08 08:12:44,776 INFO L140 encePairwiseOnDemand]: 47/50 looper letters, 19 selfloop transitions, 1 changer transitions 0/32 dead transitions. [2025-02-08 08:12:44,776 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 38 places, 32 transitions, 110 flow [2025-02-08 08:12:44,776 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 08:12:44,776 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 08:12:44,776 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 61 transitions. [2025-02-08 08:12:44,777 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4066666666666667 [2025-02-08 08:12:44,777 INFO L175 Difference]: Start difference. First operand has 38 places, 34 transitions, 74 flow. Second operand 3 states and 61 transitions. [2025-02-08 08:12:44,777 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 38 places, 32 transitions, 110 flow [2025-02-08 08:12:44,777 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 37 places, 32 transitions, 109 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-02-08 08:12:44,778 INFO L231 Difference]: Finished difference. Result has 37 places, 32 transitions, 71 flow [2025-02-08 08:12:44,778 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=50, PETRI_DIFFERENCE_MINUEND_FLOW=69, PETRI_DIFFERENCE_MINUEND_PLACES=35, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=32, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=31, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=71, PETRI_PLACES=37, PETRI_TRANSITIONS=32} [2025-02-08 08:12:44,778 INFO L279 CegarLoopForPetriNet]: 51 programPoint places, -14 predicate places. [2025-02-08 08:12:44,778 INFO L471 AbstractCegarLoop]: Abstraction has has 37 places, 32 transitions, 71 flow [2025-02-08 08:12:44,778 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 14.333333333333334) internal successors, (43), 3 states have internal predecessors, (43), 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:44,778 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 08:12:44,779 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1] [2025-02-08 08:12:44,779 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-02-08 08:12:44,779 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [thr1Err37REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err38REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err35REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 43 more)] === [2025-02-08 08:12:44,779 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 08:12:44,779 INFO L85 PathProgramCache]: Analyzing trace with hash 1416427917, now seen corresponding path program 1 times [2025-02-08 08:12:44,779 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 08:12:44,779 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1084050428] [2025-02-08 08:12:44,779 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 08:12:44,780 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 08:12:44,959 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-02-08 08:12:44,970 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-02-08 08:12:44,970 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 08:12:44,970 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-08 08:12:44,970 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-08 08:12:44,975 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-02-08 08:12:44,983 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-02-08 08:12:44,986 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 08:12:44,986 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-08 08:12:45,007 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-08 08:12:45,007 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-02-08 08:12:45,008 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (45 of 46 remaining) [2025-02-08 08:12:45,009 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err37REQUIRES_VIOLATIONMEMORY_DEREFERENCE (44 of 46 remaining) [2025-02-08 08:12:45,009 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err38REQUIRES_VIOLATIONMEMORY_DEREFERENCE (43 of 46 remaining) [2025-02-08 08:12:45,010 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err35REQUIRES_VIOLATIONMEMORY_DEREFERENCE (42 of 46 remaining) [2025-02-08 08:12:45,010 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err36REQUIRES_VIOLATIONMEMORY_DEREFERENCE (41 of 46 remaining) [2025-02-08 08:12:45,010 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err33REQUIRES_VIOLATIONMEMORY_DEREFERENCE (40 of 46 remaining) [2025-02-08 08:12:45,010 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err34REQUIRES_VIOLATIONMEMORY_DEREFERENCE (39 of 46 remaining) [2025-02-08 08:12:45,010 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err31REQUIRES_VIOLATIONMEMORY_DEREFERENCE (38 of 46 remaining) [2025-02-08 08:12:45,010 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err32REQUIRES_VIOLATIONMEMORY_DEREFERENCE (37 of 46 remaining) [2025-02-08 08:12:45,010 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err29REQUIRES_VIOLATIONMEMORY_DEREFERENCE (36 of 46 remaining) [2025-02-08 08:12:45,010 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err30REQUIRES_VIOLATIONMEMORY_DEREFERENCE (35 of 46 remaining) [2025-02-08 08:12:45,011 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err27REQUIRES_VIOLATIONMEMORY_DEREFERENCE (34 of 46 remaining) [2025-02-08 08:12:45,011 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err28REQUIRES_VIOLATIONMEMORY_DEREFERENCE (33 of 46 remaining) [2025-02-08 08:12:45,011 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err25REQUIRES_VIOLATIONMEMORY_DEREFERENCE (32 of 46 remaining) [2025-02-08 08:12:45,011 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err26REQUIRES_VIOLATIONMEMORY_DEREFERENCE (31 of 46 remaining) [2025-02-08 08:12:45,011 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err19REQUIRES_VIOLATIONMEMORY_DEREFERENCE (30 of 46 remaining) [2025-02-08 08:12:45,011 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err20REQUIRES_VIOLATIONMEMORY_DEREFERENCE (29 of 46 remaining) [2025-02-08 08:12:45,011 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err17REQUIRES_VIOLATIONMEMORY_DEREFERENCE (28 of 46 remaining) [2025-02-08 08:12:45,011 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err18REQUIRES_VIOLATIONMEMORY_DEREFERENCE (27 of 46 remaining) [2025-02-08 08:12:45,011 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err23REQUIRES_VIOLATIONMEMORY_DEREFERENCE (26 of 46 remaining) [2025-02-08 08:12:45,011 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err24REQUIRES_VIOLATIONMEMORY_DEREFERENCE (25 of 46 remaining) [2025-02-08 08:12:45,011 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err21REQUIRES_VIOLATIONMEMORY_DEREFERENCE (24 of 46 remaining) [2025-02-08 08:12:45,011 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err22REQUIRES_VIOLATIONMEMORY_DEREFERENCE (23 of 46 remaining) [2025-02-08 08:12:45,011 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (22 of 46 remaining) [2025-02-08 08:12:45,011 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err37REQUIRES_VIOLATIONMEMORY_DEREFERENCE (21 of 46 remaining) [2025-02-08 08:12:45,011 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err38REQUIRES_VIOLATIONMEMORY_DEREFERENCE (20 of 46 remaining) [2025-02-08 08:12:45,011 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err35REQUIRES_VIOLATIONMEMORY_DEREFERENCE (19 of 46 remaining) [2025-02-08 08:12:45,011 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err36REQUIRES_VIOLATIONMEMORY_DEREFERENCE (18 of 46 remaining) [2025-02-08 08:12:45,011 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err33REQUIRES_VIOLATIONMEMORY_DEREFERENCE (17 of 46 remaining) [2025-02-08 08:12:45,011 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err34REQUIRES_VIOLATIONMEMORY_DEREFERENCE (16 of 46 remaining) [2025-02-08 08:12:45,011 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err31REQUIRES_VIOLATIONMEMORY_DEREFERENCE (15 of 46 remaining) [2025-02-08 08:12:45,011 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err32REQUIRES_VIOLATIONMEMORY_DEREFERENCE (14 of 46 remaining) [2025-02-08 08:12:45,011 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err29REQUIRES_VIOLATIONMEMORY_DEREFERENCE (13 of 46 remaining) [2025-02-08 08:12:45,011 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err30REQUIRES_VIOLATIONMEMORY_DEREFERENCE (12 of 46 remaining) [2025-02-08 08:12:45,011 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err27REQUIRES_VIOLATIONMEMORY_DEREFERENCE (11 of 46 remaining) [2025-02-08 08:12:45,012 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err28REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 46 remaining) [2025-02-08 08:12:45,012 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err25REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 46 remaining) [2025-02-08 08:12:45,012 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err26REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 46 remaining) [2025-02-08 08:12:45,012 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err19REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 46 remaining) [2025-02-08 08:12:45,012 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err20REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 46 remaining) [2025-02-08 08:12:45,012 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err17REQUIRES_VIOLATIONMEMORY_DEREFERENCE (5 of 46 remaining) [2025-02-08 08:12:45,012 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err18REQUIRES_VIOLATIONMEMORY_DEREFERENCE (4 of 46 remaining) [2025-02-08 08:12:45,012 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err23REQUIRES_VIOLATIONMEMORY_DEREFERENCE (3 of 46 remaining) [2025-02-08 08:12:45,012 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err24REQUIRES_VIOLATIONMEMORY_DEREFERENCE (2 of 46 remaining) [2025-02-08 08:12:45,012 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err21REQUIRES_VIOLATIONMEMORY_DEREFERENCE (1 of 46 remaining) [2025-02-08 08:12:45,012 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err22REQUIRES_VIOLATIONMEMORY_DEREFERENCE (0 of 46 remaining) [2025-02-08 08:12:45,012 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-02-08 08:12:45,012 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1] [2025-02-08 08:12:45,014 WARN L246 ceAbstractionStarter]: 1 thread instances were not sufficient, I will increase this number and restart the analysis [2025-02-08 08:12:45,014 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 2 thread instances. [2025-02-08 08:12:45,069 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-02-08 08:12:45,072 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 94 places, 93 transitions, 196 flow [2025-02-08 08:12:45,086 INFO L124 PetriNetUnfolderBase]: 4/102 cut-off events. [2025-02-08 08:12:45,086 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2025-02-08 08:12:45,087 INFO L83 FinitePrefix]: Finished finitePrefix Result has 110 conditions, 102 events. 4/102 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 370 event pairs, 0 based on Foata normal form. 0/44 useless extension candidates. Maximal degree in co-relation 89. Up to 3 conditions per place. [2025-02-08 08:12:45,087 INFO L82 GeneralOperation]: Start removeDead. Operand has 94 places, 93 transitions, 196 flow [2025-02-08 08:12:45,088 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 94 places, 93 transitions, 196 flow [2025-02-08 08:12:45,089 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-08 08:12:45,089 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;@873c9a5, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-08 08:12:45,089 INFO L334 AbstractCegarLoop]: Starting to check reachability of 68 error locations. [2025-02-08 08:12:45,093 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-02-08 08:12:45,093 INFO L124 PetriNetUnfolderBase]: 0/3 cut-off events. [2025-02-08 08:12:45,093 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-02-08 08:12:45,093 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 08:12:45,093 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2025-02-08 08:12:45,093 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [thr1Err37REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err38REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err35REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 65 more)] === [2025-02-08 08:12:45,094 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 08:12:45,094 INFO L85 PathProgramCache]: Analyzing trace with hash 716433, now seen corresponding path program 1 times [2025-02-08 08:12:45,094 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 08:12:45,094 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [454633780] [2025-02-08 08:12:45,094 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 08:12:45,094 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 08:12:45,394 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-02-08 08:12:45,398 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-02-08 08:12:45,398 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 08:12:45,398 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 08:12:45,410 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:45,410 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 08:12:45,410 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [454633780] [2025-02-08 08:12:45,410 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [454633780] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 08:12:45,410 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 08:12:45,410 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 08:12:45,411 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [200319810] [2025-02-08 08:12:45,411 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 08:12:45,411 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-02-08 08:12:45,411 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 08:12:45,412 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-02-08 08:12:45,412 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-02-08 08:12:45,412 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 24 out of 93 [2025-02-08 08:12:45,412 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 94 places, 93 transitions, 196 flow. Second operand has 2 states, 2 states have (on average 25.0) internal successors, (50), 2 states have internal predecessors, (50), 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:45,412 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 08:12:45,412 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 24 of 93 [2025-02-08 08:12:45,412 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 08:12:45,811 INFO L124 PetriNetUnfolderBase]: 2696/4449 cut-off events. [2025-02-08 08:12:45,812 INFO L125 PetriNetUnfolderBase]: For 126/126 co-relation queries the response was YES. [2025-02-08 08:12:45,818 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8499 conditions, 4449 events. 2696/4449 cut-off events. For 126/126 co-relation queries the response was YES. Maximal size of possible extension queue 362. Compared 29781 event pairs, 2121 based on Foata normal form. 0/2788 useless extension candidates. Maximal degree in co-relation 4680. Up to 3982 conditions per place. [2025-02-08 08:12:45,832 INFO L140 encePairwiseOnDemand]: 70/93 looper letters, 45 selfloop transitions, 0 changer transitions 0/68 dead transitions. [2025-02-08 08:12:45,832 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 70 places, 68 transitions, 236 flow [2025-02-08 08:12:45,833 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-02-08 08:12:45,833 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2025-02-08 08:12:45,833 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 116 transitions. [2025-02-08 08:12:45,833 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6236559139784946 [2025-02-08 08:12:45,834 INFO L175 Difference]: Start difference. First operand has 94 places, 93 transitions, 196 flow. Second operand 2 states and 116 transitions. [2025-02-08 08:12:45,834 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 70 places, 68 transitions, 236 flow [2025-02-08 08:12:45,834 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 70 places, 68 transitions, 236 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-02-08 08:12:45,835 INFO L231 Difference]: Finished difference. Result has 70 places, 68 transitions, 146 flow [2025-02-08 08:12:45,835 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=93, PETRI_DIFFERENCE_MINUEND_FLOW=146, PETRI_DIFFERENCE_MINUEND_PLACES=69, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=68, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=68, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=146, PETRI_PLACES=70, PETRI_TRANSITIONS=68} [2025-02-08 08:12:45,835 INFO L279 CegarLoopForPetriNet]: 94 programPoint places, -24 predicate places. [2025-02-08 08:12:45,835 INFO L471 AbstractCegarLoop]: Abstraction has has 70 places, 68 transitions, 146 flow [2025-02-08 08:12:45,836 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 25.0) internal successors, (50), 2 states have internal predecessors, (50), 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:45,836 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 08:12:45,836 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2025-02-08 08:12:45,836 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-02-08 08:12:45,836 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting thr1Err37REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thr1Err37REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err38REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err35REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 65 more)] === [2025-02-08 08:12:45,836 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 08:12:45,836 INFO L85 PathProgramCache]: Analyzing trace with hash 688674166, now seen corresponding path program 1 times [2025-02-08 08:12:45,836 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 08:12:45,836 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1500670849] [2025-02-08 08:12:45,836 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 08:12:45,836 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 08:12:45,987 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-02-08 08:12:45,991 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-02-08 08:12:45,991 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 08:12:45,991 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 08:12:46,026 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:46,026 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 08:12:46,026 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1500670849] [2025-02-08 08:12:46,027 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1500670849] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 08:12:46,027 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 08:12:46,027 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-02-08 08:12:46,027 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1641056074] [2025-02-08 08:12:46,027 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 08:12:46,027 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 08:12:46,027 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 08:12:46,027 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 08:12:46,027 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 08:12:46,031 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 24 out of 93 [2025-02-08 08:12:46,031 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 70 places, 68 transitions, 146 flow. Second operand has 3 states, 3 states have (on average 25.333333333333332) internal successors, (76), 3 states have internal predecessors, (76), 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:46,031 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 08:12:46,031 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 24 of 93 [2025-02-08 08:12:46,031 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 08:12:46,250 INFO L124 PetriNetUnfolderBase]: 2144/3577 cut-off events. [2025-02-08 08:12:46,250 INFO L125 PetriNetUnfolderBase]: For 92/92 co-relation queries the response was YES. [2025-02-08 08:12:46,256 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6838 conditions, 3577 events. 2144/3577 cut-off events. For 92/92 co-relation queries the response was YES. Maximal size of possible extension queue 278. Compared 22884 event pairs, 1731 based on Foata normal form. 0/2418 useless extension candidates. Maximal degree in co-relation 6833. Up to 3197 conditions per place. [2025-02-08 08:12:46,271 INFO L140 encePairwiseOnDemand]: 88/93 looper letters, 40 selfloop transitions, 1 changer transitions 0/64 dead transitions. [2025-02-08 08:12:46,271 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 68 places, 64 transitions, 220 flow [2025-02-08 08:12:46,272 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 08:12:46,272 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 08:12:46,272 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 117 transitions. [2025-02-08 08:12:46,273 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.41935483870967744 [2025-02-08 08:12:46,273 INFO L175 Difference]: Start difference. First operand has 70 places, 68 transitions, 146 flow. Second operand 3 states and 117 transitions. [2025-02-08 08:12:46,273 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 68 places, 64 transitions, 220 flow [2025-02-08 08:12:46,273 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 68 places, 64 transitions, 220 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-02-08 08:12:46,274 INFO L231 Difference]: Finished difference. Result has 68 places, 64 transitions, 140 flow [2025-02-08 08:12:46,274 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=93, 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:12:46,274 INFO L279 CegarLoopForPetriNet]: 94 programPoint places, -26 predicate places. [2025-02-08 08:12:46,275 INFO L471 AbstractCegarLoop]: Abstraction has has 68 places, 64 transitions, 140 flow [2025-02-08 08:12:46,275 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 25.333333333333332) internal successors, (76), 3 states have internal predecessors, (76), 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:46,275 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 08:12:46,275 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2025-02-08 08:12:46,275 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-02-08 08:12:46,275 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting thr1Err38REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thr1Err37REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err38REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err35REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 65 more)] === [2025-02-08 08:12:46,275 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 08:12:46,275 INFO L85 PathProgramCache]: Analyzing trace with hash 688674167, now seen corresponding path program 1 times [2025-02-08 08:12:46,275 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 08:12:46,275 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1571750502] [2025-02-08 08:12:46,275 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 08:12:46,275 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 08:12:46,433 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-02-08 08:12:46,437 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-02-08 08:12:46,437 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 08:12:46,437 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 08:12:46,493 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:46,493 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 08:12:46,493 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1571750502] [2025-02-08 08:12:46,493 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1571750502] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 08:12:46,493 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 08:12:46,493 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-02-08 08:12:46,493 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1566990800] [2025-02-08 08:12:46,493 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 08:12:46,493 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 08:12:46,493 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 08:12:46,494 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 08:12:46,494 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 08:12:46,497 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 24 out of 93 [2025-02-08 08:12:46,497 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 68 places, 64 transitions, 140 flow. Second operand has 3 states, 3 states have (on average 25.333333333333332) internal successors, (76), 3 states have internal predecessors, (76), 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:46,497 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 08:12:46,497 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 24 of 93 [2025-02-08 08:12:46,497 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 08:12:46,655 INFO L124 PetriNetUnfolderBase]: 1652/2797 cut-off events. [2025-02-08 08:12:46,655 INFO L125 PetriNetUnfolderBase]: For 66/66 co-relation queries the response was YES. [2025-02-08 08:12:46,658 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5354 conditions, 2797 events. 1652/2797 cut-off events. For 66/66 co-relation queries the response was YES. Maximal size of possible extension queue 196. Compared 16977 event pairs, 1381 based on Foata normal form. 0/2072 useless extension candidates. Maximal degree in co-relation 5348. Up to 2497 conditions per place. [2025-02-08 08:12:46,666 INFO L140 encePairwiseOnDemand]: 88/93 looper letters, 36 selfloop transitions, 1 changer transitions 0/60 dead transitions. [2025-02-08 08:12:46,666 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 66 places, 60 transitions, 206 flow [2025-02-08 08:12:46,667 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 08:12:46,667 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 08:12:46,667 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 113 transitions. [2025-02-08 08:12:46,667 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4050179211469534 [2025-02-08 08:12:46,667 INFO L175 Difference]: Start difference. First operand has 68 places, 64 transitions, 140 flow. Second operand 3 states and 113 transitions. [2025-02-08 08:12:46,667 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 66 places, 60 transitions, 206 flow [2025-02-08 08:12:46,668 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 65 places, 60 transitions, 205 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-02-08 08:12:46,668 INFO L231 Difference]: Finished difference. Result has 65 places, 60 transitions, 133 flow [2025-02-08 08:12:46,669 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=93, PETRI_DIFFERENCE_MINUEND_FLOW=131, PETRI_DIFFERENCE_MINUEND_PLACES=63, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=60, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=59, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=133, PETRI_PLACES=65, PETRI_TRANSITIONS=60} [2025-02-08 08:12:46,669 INFO L279 CegarLoopForPetriNet]: 94 programPoint places, -29 predicate places. [2025-02-08 08:12:46,669 INFO L471 AbstractCegarLoop]: Abstraction has has 65 places, 60 transitions, 133 flow [2025-02-08 08:12:46,670 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 25.333333333333332) internal successors, (76), 3 states have internal predecessors, (76), 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:46,670 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 08:12:46,670 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 08:12:46,670 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-02-08 08:12:46,670 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting thr1Err33REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thr1Err37REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err38REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err35REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 65 more)] === [2025-02-08 08:12:46,670 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 08:12:46,670 INFO L85 PathProgramCache]: Analyzing trace with hash -765809878, now seen corresponding path program 1 times [2025-02-08 08:12:46,670 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 08:12:46,670 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [954796951] [2025-02-08 08:12:46,670 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 08:12:46,670 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 08:12:46,821 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-02-08 08:12:46,826 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-02-08 08:12:46,826 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 08:12:46,826 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 08:12:46,861 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:46,861 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 08:12:46,861 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [954796951] [2025-02-08 08:12:46,861 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [954796951] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 08:12:46,861 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 08:12:46,861 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-02-08 08:12:46,861 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1173484545] [2025-02-08 08:12:46,861 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 08:12:46,861 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 08:12:46,862 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 08:12:46,862 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 08:12:46,862 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 08:12:46,867 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 22 out of 93 [2025-02-08 08:12:46,867 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 65 places, 60 transitions, 133 flow. Second operand has 3 states, 3 states have (on average 23.666666666666668) internal successors, (71), 3 states have internal predecessors, (71), 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:46,867 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 08:12:46,868 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 22 of 93 [2025-02-08 08:12:46,868 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 08:12:47,025 INFO L124 PetriNetUnfolderBase]: 1652/2791 cut-off events. [2025-02-08 08:12:47,025 INFO L125 PetriNetUnfolderBase]: For 66/66 co-relation queries the response was YES. [2025-02-08 08:12:47,028 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5349 conditions, 2791 events. 1652/2791 cut-off events. For 66/66 co-relation queries the response was YES. Maximal size of possible extension queue 196. Compared 16952 event pairs, 1381 based on Foata normal form. 0/2072 useless extension candidates. Maximal degree in co-relation 5343. Up to 2497 conditions per place. [2025-02-08 08:12:47,036 INFO L140 encePairwiseOnDemand]: 90/93 looper letters, 36 selfloop transitions, 1 changer transitions 0/58 dead transitions. [2025-02-08 08:12:47,037 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 65 places, 58 transitions, 203 flow [2025-02-08 08:12:47,037 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 08:12:47,037 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 08:12:47,037 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 105 transitions. [2025-02-08 08:12:47,038 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.3763440860215054 [2025-02-08 08:12:47,038 INFO L175 Difference]: Start difference. First operand has 65 places, 60 transitions, 133 flow. Second operand 3 states and 105 transitions. [2025-02-08 08:12:47,038 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 65 places, 58 transitions, 203 flow [2025-02-08 08:12:47,038 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 64 places, 58 transitions, 202 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-02-08 08:12:47,039 INFO L231 Difference]: Finished difference. Result has 64 places, 58 transitions, 130 flow [2025-02-08 08:12:47,039 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=93, PETRI_DIFFERENCE_MINUEND_FLOW=128, PETRI_DIFFERENCE_MINUEND_PLACES=62, 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=130, PETRI_PLACES=64, PETRI_TRANSITIONS=58} [2025-02-08 08:12:47,039 INFO L279 CegarLoopForPetriNet]: 94 programPoint places, -30 predicate places. [2025-02-08 08:12:47,039 INFO L471 AbstractCegarLoop]: Abstraction has has 64 places, 58 transitions, 130 flow [2025-02-08 08:12:47,039 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 23.666666666666668) internal successors, (71), 3 states have internal predecessors, (71), 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:47,039 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 08:12:47,039 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 08:12:47,039 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-02-08 08:12:47,039 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting thr1Err34REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thr1Err37REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err38REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err35REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 65 more)] === [2025-02-08 08:12:47,040 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 08:12:47,040 INFO L85 PathProgramCache]: Analyzing trace with hash -765809877, now seen corresponding path program 1 times [2025-02-08 08:12:47,040 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 08:12:47,040 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [405953503] [2025-02-08 08:12:47,040 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 08:12:47,040 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 08:12:47,253 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-02-08 08:12:47,257 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-02-08 08:12:47,257 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 08:12:47,257 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 08:12:47,300 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:47,300 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 08:12:47,300 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [405953503] [2025-02-08 08:12:47,300 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [405953503] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 08:12:47,300 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 08:12:47,300 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-02-08 08:12:47,300 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [334553046] [2025-02-08 08:12:47,300 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 08:12:47,300 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 08:12:47,300 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 08:12:47,300 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 08:12:47,301 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 08:12:47,304 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 22 out of 93 [2025-02-08 08:12:47,304 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 64 places, 58 transitions, 130 flow. Second operand has 3 states, 3 states have (on average 23.666666666666668) internal successors, (71), 3 states have internal predecessors, (71), 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:47,304 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 08:12:47,304 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 22 of 93 [2025-02-08 08:12:47,304 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 08:12:47,454 INFO L124 PetriNetUnfolderBase]: 1652/2785 cut-off events. [2025-02-08 08:12:47,454 INFO L125 PetriNetUnfolderBase]: For 66/66 co-relation queries the response was YES. [2025-02-08 08:12:47,457 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5344 conditions, 2785 events. 1652/2785 cut-off events. For 66/66 co-relation queries the response was YES. Maximal size of possible extension queue 196. Compared 16814 event pairs, 1381 based on Foata normal form. 0/2066 useless extension candidates. Maximal degree in co-relation 5338. Up to 2497 conditions per place. [2025-02-08 08:12:47,465 INFO L140 encePairwiseOnDemand]: 90/93 looper letters, 36 selfloop transitions, 1 changer transitions 0/56 dead transitions. [2025-02-08 08:12:47,465 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 64 places, 56 transitions, 200 flow [2025-02-08 08:12:47,465 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 08:12:47,465 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 08:12:47,465 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 105 transitions. [2025-02-08 08:12:47,466 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.3763440860215054 [2025-02-08 08:12:47,466 INFO L175 Difference]: Start difference. First operand has 64 places, 58 transitions, 130 flow. Second operand 3 states and 105 transitions. [2025-02-08 08:12:47,466 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 64 places, 56 transitions, 200 flow [2025-02-08 08:12:47,466 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 63 places, 56 transitions, 199 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-02-08 08:12:47,467 INFO L231 Difference]: Finished difference. Result has 63 places, 56 transitions, 127 flow [2025-02-08 08:12:47,467 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=93, PETRI_DIFFERENCE_MINUEND_FLOW=125, PETRI_DIFFERENCE_MINUEND_PLACES=61, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=56, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=55, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=127, PETRI_PLACES=63, PETRI_TRANSITIONS=56} [2025-02-08 08:12:47,467 INFO L279 CegarLoopForPetriNet]: 94 programPoint places, -31 predicate places. [2025-02-08 08:12:47,467 INFO L471 AbstractCegarLoop]: Abstraction has has 63 places, 56 transitions, 127 flow [2025-02-08 08:12:47,467 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 23.666666666666668) internal successors, (71), 3 states have internal predecessors, (71), 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:47,467 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 08:12:47,467 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 2, 1, 1, 1, 1] [2025-02-08 08:12:47,468 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-02-08 08:12:47,468 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [thr1Err37REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err38REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err35REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 65 more)] === [2025-02-08 08:12:47,468 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 08:12:47,468 INFO L85 PathProgramCache]: Analyzing trace with hash -659483405, now seen corresponding path program 1 times [2025-02-08 08:12:47,468 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 08:12:47,468 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [514683884] [2025-02-08 08:12:47,468 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 08:12:47,468 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 08:12:47,623 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-02-08 08:12:47,629 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-02-08 08:12:47,629 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 08:12:47,629 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-08 08:12:47,629 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-08 08:12:47,631 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-02-08 08:12:47,634 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-02-08 08:12:47,634 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 08:12:47,634 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-08 08:12:47,639 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-08 08:12:47,639 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-02-08 08:12:47,639 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (67 of 68 remaining) [2025-02-08 08:12:47,639 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err37REQUIRES_VIOLATIONMEMORY_DEREFERENCE (66 of 68 remaining) [2025-02-08 08:12:47,639 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err38REQUIRES_VIOLATIONMEMORY_DEREFERENCE (65 of 68 remaining) [2025-02-08 08:12:47,639 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err35REQUIRES_VIOLATIONMEMORY_DEREFERENCE (64 of 68 remaining) [2025-02-08 08:12:47,639 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err36REQUIRES_VIOLATIONMEMORY_DEREFERENCE (63 of 68 remaining) [2025-02-08 08:12:47,639 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err33REQUIRES_VIOLATIONMEMORY_DEREFERENCE (62 of 68 remaining) [2025-02-08 08:12:47,639 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err34REQUIRES_VIOLATIONMEMORY_DEREFERENCE (61 of 68 remaining) [2025-02-08 08:12:47,639 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err31REQUIRES_VIOLATIONMEMORY_DEREFERENCE (60 of 68 remaining) [2025-02-08 08:12:47,640 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err32REQUIRES_VIOLATIONMEMORY_DEREFERENCE (59 of 68 remaining) [2025-02-08 08:12:47,640 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err29REQUIRES_VIOLATIONMEMORY_DEREFERENCE (58 of 68 remaining) [2025-02-08 08:12:47,640 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err30REQUIRES_VIOLATIONMEMORY_DEREFERENCE (57 of 68 remaining) [2025-02-08 08:12:47,640 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err27REQUIRES_VIOLATIONMEMORY_DEREFERENCE (56 of 68 remaining) [2025-02-08 08:12:47,640 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err28REQUIRES_VIOLATIONMEMORY_DEREFERENCE (55 of 68 remaining) [2025-02-08 08:12:47,640 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err25REQUIRES_VIOLATIONMEMORY_DEREFERENCE (54 of 68 remaining) [2025-02-08 08:12:47,640 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err26REQUIRES_VIOLATIONMEMORY_DEREFERENCE (53 of 68 remaining) [2025-02-08 08:12:47,640 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err19REQUIRES_VIOLATIONMEMORY_DEREFERENCE (52 of 68 remaining) [2025-02-08 08:12:47,640 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err20REQUIRES_VIOLATIONMEMORY_DEREFERENCE (51 of 68 remaining) [2025-02-08 08:12:47,640 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err17REQUIRES_VIOLATIONMEMORY_DEREFERENCE (50 of 68 remaining) [2025-02-08 08:12:47,640 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err18REQUIRES_VIOLATIONMEMORY_DEREFERENCE (49 of 68 remaining) [2025-02-08 08:12:47,640 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err23REQUIRES_VIOLATIONMEMORY_DEREFERENCE (48 of 68 remaining) [2025-02-08 08:12:47,640 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err24REQUIRES_VIOLATIONMEMORY_DEREFERENCE (47 of 68 remaining) [2025-02-08 08:12:47,640 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err21REQUIRES_VIOLATIONMEMORY_DEREFERENCE (46 of 68 remaining) [2025-02-08 08:12:47,640 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err22REQUIRES_VIOLATIONMEMORY_DEREFERENCE (45 of 68 remaining) [2025-02-08 08:12:47,640 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (44 of 68 remaining) [2025-02-08 08:12:47,640 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err37REQUIRES_VIOLATIONMEMORY_DEREFERENCE (43 of 68 remaining) [2025-02-08 08:12:47,640 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err38REQUIRES_VIOLATIONMEMORY_DEREFERENCE (42 of 68 remaining) [2025-02-08 08:12:47,640 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err35REQUIRES_VIOLATIONMEMORY_DEREFERENCE (41 of 68 remaining) [2025-02-08 08:12:47,640 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err36REQUIRES_VIOLATIONMEMORY_DEREFERENCE (40 of 68 remaining) [2025-02-08 08:12:47,640 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err33REQUIRES_VIOLATIONMEMORY_DEREFERENCE (39 of 68 remaining) [2025-02-08 08:12:47,640 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err34REQUIRES_VIOLATIONMEMORY_DEREFERENCE (38 of 68 remaining) [2025-02-08 08:12:47,640 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err31REQUIRES_VIOLATIONMEMORY_DEREFERENCE (37 of 68 remaining) [2025-02-08 08:12:47,640 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err32REQUIRES_VIOLATIONMEMORY_DEREFERENCE (36 of 68 remaining) [2025-02-08 08:12:47,640 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err29REQUIRES_VIOLATIONMEMORY_DEREFERENCE (35 of 68 remaining) [2025-02-08 08:12:47,640 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err30REQUIRES_VIOLATIONMEMORY_DEREFERENCE (34 of 68 remaining) [2025-02-08 08:12:47,640 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err27REQUIRES_VIOLATIONMEMORY_DEREFERENCE (33 of 68 remaining) [2025-02-08 08:12:47,640 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err28REQUIRES_VIOLATIONMEMORY_DEREFERENCE (32 of 68 remaining) [2025-02-08 08:12:47,640 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err25REQUIRES_VIOLATIONMEMORY_DEREFERENCE (31 of 68 remaining) [2025-02-08 08:12:47,640 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err26REQUIRES_VIOLATIONMEMORY_DEREFERENCE (30 of 68 remaining) [2025-02-08 08:12:47,640 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err19REQUIRES_VIOLATIONMEMORY_DEREFERENCE (29 of 68 remaining) [2025-02-08 08:12:47,640 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err20REQUIRES_VIOLATIONMEMORY_DEREFERENCE (28 of 68 remaining) [2025-02-08 08:12:47,640 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err17REQUIRES_VIOLATIONMEMORY_DEREFERENCE (27 of 68 remaining) [2025-02-08 08:12:47,640 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err18REQUIRES_VIOLATIONMEMORY_DEREFERENCE (26 of 68 remaining) [2025-02-08 08:12:47,640 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err23REQUIRES_VIOLATIONMEMORY_DEREFERENCE (25 of 68 remaining) [2025-02-08 08:12:47,640 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err24REQUIRES_VIOLATIONMEMORY_DEREFERENCE (24 of 68 remaining) [2025-02-08 08:12:47,641 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err21REQUIRES_VIOLATIONMEMORY_DEREFERENCE (23 of 68 remaining) [2025-02-08 08:12:47,641 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err22REQUIRES_VIOLATIONMEMORY_DEREFERENCE (22 of 68 remaining) [2025-02-08 08:12:47,641 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err37REQUIRES_VIOLATIONMEMORY_DEREFERENCE (21 of 68 remaining) [2025-02-08 08:12:47,641 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err38REQUIRES_VIOLATIONMEMORY_DEREFERENCE (20 of 68 remaining) [2025-02-08 08:12:47,641 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err35REQUIRES_VIOLATIONMEMORY_DEREFERENCE (19 of 68 remaining) [2025-02-08 08:12:47,641 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err36REQUIRES_VIOLATIONMEMORY_DEREFERENCE (18 of 68 remaining) [2025-02-08 08:12:47,641 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err33REQUIRES_VIOLATIONMEMORY_DEREFERENCE (17 of 68 remaining) [2025-02-08 08:12:47,641 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err34REQUIRES_VIOLATIONMEMORY_DEREFERENCE (16 of 68 remaining) [2025-02-08 08:12:47,641 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err31REQUIRES_VIOLATIONMEMORY_DEREFERENCE (15 of 68 remaining) [2025-02-08 08:12:47,641 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err32REQUIRES_VIOLATIONMEMORY_DEREFERENCE (14 of 68 remaining) [2025-02-08 08:12:47,641 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err29REQUIRES_VIOLATIONMEMORY_DEREFERENCE (13 of 68 remaining) [2025-02-08 08:12:47,641 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err30REQUIRES_VIOLATIONMEMORY_DEREFERENCE (12 of 68 remaining) [2025-02-08 08:12:47,641 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err27REQUIRES_VIOLATIONMEMORY_DEREFERENCE (11 of 68 remaining) [2025-02-08 08:12:47,641 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err28REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 68 remaining) [2025-02-08 08:12:47,641 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err25REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 68 remaining) [2025-02-08 08:12:47,641 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err26REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 68 remaining) [2025-02-08 08:12:47,641 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err19REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 68 remaining) [2025-02-08 08:12:47,641 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err20REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 68 remaining) [2025-02-08 08:12:47,641 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err17REQUIRES_VIOLATIONMEMORY_DEREFERENCE (5 of 68 remaining) [2025-02-08 08:12:47,641 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err18REQUIRES_VIOLATIONMEMORY_DEREFERENCE (4 of 68 remaining) [2025-02-08 08:12:47,641 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err23REQUIRES_VIOLATIONMEMORY_DEREFERENCE (3 of 68 remaining) [2025-02-08 08:12:47,641 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err24REQUIRES_VIOLATIONMEMORY_DEREFERENCE (2 of 68 remaining) [2025-02-08 08:12:47,641 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err21REQUIRES_VIOLATIONMEMORY_DEREFERENCE (1 of 68 remaining) [2025-02-08 08:12:47,641 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err22REQUIRES_VIOLATIONMEMORY_DEREFERENCE (0 of 68 remaining) [2025-02-08 08:12:47,641 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-02-08 08:12:47,641 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1] [2025-02-08 08:12:47,642 WARN L246 ceAbstractionStarter]: 2 thread instances were not sufficient, I will increase this number and restart the analysis [2025-02-08 08:12:47,642 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 3 thread instances. [2025-02-08 08:12:47,678 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-02-08 08:12:47,679 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 137 places, 136 transitions, 290 flow [2025-02-08 08:12:47,688 INFO L124 PetriNetUnfolderBase]: 6/150 cut-off events. [2025-02-08 08:12:47,688 INFO L125 PetriNetUnfolderBase]: For 7/7 co-relation queries the response was YES. [2025-02-08 08:12:47,688 INFO L83 FinitePrefix]: Finished finitePrefix Result has 163 conditions, 150 events. 6/150 cut-off events. For 7/7 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 664 event pairs, 0 based on Foata normal form. 0/64 useless extension candidates. Maximal degree in co-relation 131. Up to 4 conditions per place. [2025-02-08 08:12:47,688 INFO L82 GeneralOperation]: Start removeDead. Operand has 137 places, 136 transitions, 290 flow [2025-02-08 08:12:47,689 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 137 places, 136 transitions, 290 flow [2025-02-08 08:12:47,690 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-08 08:12:47,690 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;@873c9a5, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-08 08:12:47,690 INFO L334 AbstractCegarLoop]: Starting to check reachability of 90 error locations. [2025-02-08 08:12:47,691 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-02-08 08:12:47,691 INFO L124 PetriNetUnfolderBase]: 0/3 cut-off events. [2025-02-08 08:12:47,691 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-02-08 08:12:47,691 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 08:12:47,691 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2025-02-08 08:12:47,691 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [thr1Err37REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err38REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err35REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 87 more)] === [2025-02-08 08:12:47,692 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 08:12:47,692 INFO L85 PathProgramCache]: Analyzing trace with hash 851481, now seen corresponding path program 1 times [2025-02-08 08:12:47,692 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 08:12:47,692 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1588824848] [2025-02-08 08:12:47,692 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 08:12:47,692 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 08:12:47,830 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-02-08 08:12:47,831 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-02-08 08:12:47,831 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 08:12:47,832 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 08:12:47,837 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:47,837 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 08:12:47,837 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1588824848] [2025-02-08 08:12:47,837 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1588824848] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 08:12:47,837 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 08:12:47,837 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 08:12:47,837 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [498154350] [2025-02-08 08:12:47,837 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 08:12:47,838 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-02-08 08:12:47,838 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 08:12:47,838 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-02-08 08:12:47,838 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-02-08 08:12:47,838 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 35 out of 136 [2025-02-08 08:12:47,838 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 137 places, 136 transitions, 290 flow. Second operand has 2 states, 2 states have (on average 36.0) internal successors, (72), 2 states have internal predecessors, (72), 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:47,838 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 08:12:47,838 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 35 of 136 [2025-02-08 08:12:47,838 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 08:12:54,312 INFO L124 PetriNetUnfolderBase]: 90707/126102 cut-off events. [2025-02-08 08:12:54,312 INFO L125 PetriNetUnfolderBase]: For 4635/4635 co-relation queries the response was YES. [2025-02-08 08:12:54,441 INFO L83 FinitePrefix]: Finished finitePrefix Result has 245497 conditions, 126102 events. 90707/126102 cut-off events. For 4635/4635 co-relation queries the response was YES. Maximal size of possible extension queue 6369. Compared 985098 event pairs, 72438 based on Foata normal form. 0/75549 useless extension candidates. Maximal degree in co-relation 80631. Up to 117562 conditions per place. [2025-02-08 08:12:54,904 INFO L140 encePairwiseOnDemand]: 102/136 looper letters, 66 selfloop transitions, 0 changer transitions 0/100 dead transitions. [2025-02-08 08:12:54,904 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 100 transitions, 350 flow [2025-02-08 08:12:54,907 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-02-08 08:12:54,907 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2025-02-08 08:12:54,908 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 170 transitions. [2025-02-08 08:12:54,908 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.625 [2025-02-08 08:12:54,908 INFO L175 Difference]: Start difference. First operand has 137 places, 136 transitions, 290 flow. Second operand 2 states and 170 transitions. [2025-02-08 08:12:54,908 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 100 transitions, 350 flow [2025-02-08 08:12:54,912 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 102 places, 100 transitions, 348 flow, removed 1 selfloop flow, removed 0 redundant places. [2025-02-08 08:12:54,914 INFO L231 Difference]: Finished difference. Result has 102 places, 100 transitions, 216 flow [2025-02-08 08:12:54,915 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=136, PETRI_DIFFERENCE_MINUEND_FLOW=216, PETRI_DIFFERENCE_MINUEND_PLACES=101, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=100, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=100, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=216, PETRI_PLACES=102, PETRI_TRANSITIONS=100} [2025-02-08 08:12:54,915 INFO L279 CegarLoopForPetriNet]: 137 programPoint places, -35 predicate places. [2025-02-08 08:12:54,916 INFO L471 AbstractCegarLoop]: Abstraction has has 102 places, 100 transitions, 216 flow [2025-02-08 08:12:54,916 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 36.0) internal successors, (72), 2 states have internal predecessors, (72), 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:54,916 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 08:12:54,916 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2025-02-08 08:12:54,916 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-02-08 08:12:54,917 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting thr1Err37REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thr1Err37REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err38REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err35REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 87 more)] === [2025-02-08 08:12:54,917 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 08:12:54,917 INFO L85 PathProgramCache]: Analyzing trace with hash 818500008, now seen corresponding path program 1 times [2025-02-08 08:12:54,917 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 08:12:54,917 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [324477476] [2025-02-08 08:12:54,917 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 08:12:54,917 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 08:12:55,053 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-02-08 08:12:55,057 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-02-08 08:12:55,057 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 08:12:55,057 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 08:12:55,095 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:55,095 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 08:12:55,095 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [324477476] [2025-02-08 08:12:55,095 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [324477476] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 08:12:55,095 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 08:12:55,096 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-02-08 08:12:55,096 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1739846557] [2025-02-08 08:12:55,096 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 08:12:55,096 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 08:12:55,096 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 08:12:55,096 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 08:12:55,096 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 08:12:55,102 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 35 out of 136 [2025-02-08 08:12:55,102 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 102 places, 100 transitions, 216 flow. Second operand has 3 states, 3 states have (on average 36.333333333333336) internal successors, (109), 3 states have internal predecessors, (109), 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:55,102 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 08:12:55,102 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 35 of 136 [2025-02-08 08:12:55,102 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 08:13:00,040 INFO L124 PetriNetUnfolderBase]: 65217/91404 cut-off events. [2025-02-08 08:13:00,040 INFO L125 PetriNetUnfolderBase]: For 2057/2057 co-relation queries the response was YES. [2025-02-08 08:13:00,179 INFO L83 FinitePrefix]: Finished finitePrefix Result has 177721 conditions, 91404 events. 65217/91404 cut-off events. For 2057/2057 co-relation queries the response was YES. Maximal size of possible extension queue 4605. Compared 691822 event pairs, 53568 based on Foata normal form. 0/60043 useless extension candidates. Maximal degree in co-relation 177715. Up to 85169 conditions per place. [2025-02-08 08:13:00,616 INFO L140 encePairwiseOnDemand]: 129/136 looper letters, 59 selfloop transitions, 1 changer transitions 0/94 dead transitions. [2025-02-08 08:13:00,616 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 98 places, 94 transitions, 324 flow [2025-02-08 08:13:00,623 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 08:13:00,624 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 08:13:00,624 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 171 transitions. [2025-02-08 08:13:00,624 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.41911764705882354 [2025-02-08 08:13:00,624 INFO L175 Difference]: Start difference. First operand has 102 places, 100 transitions, 216 flow. Second operand 3 states and 171 transitions. [2025-02-08 08:13:00,624 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 98 places, 94 transitions, 324 flow [2025-02-08 08:13:00,627 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 98 places, 94 transitions, 324 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-02-08 08:13:00,632 INFO L231 Difference]: Finished difference. Result has 98 places, 94 transitions, 206 flow [2025-02-08 08:13:00,632 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=136, 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:13:00,632 INFO L279 CegarLoopForPetriNet]: 137 programPoint places, -39 predicate places. [2025-02-08 08:13:00,632 INFO L471 AbstractCegarLoop]: Abstraction has has 98 places, 94 transitions, 206 flow [2025-02-08 08:13:00,632 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 36.333333333333336) internal successors, (109), 3 states have internal predecessors, (109), 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:13:00,632 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 08:13:00,633 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2025-02-08 08:13:00,633 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-02-08 08:13:00,633 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting thr1Err38REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thr1Err37REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err38REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err35REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 87 more)] === [2025-02-08 08:13:00,633 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 08:13:00,633 INFO L85 PathProgramCache]: Analyzing trace with hash 818500009, now seen corresponding path program 1 times [2025-02-08 08:13:00,633 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 08:13:00,633 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [419710012] [2025-02-08 08:13:00,633 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 08:13:00,633 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 08:13:01,120 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-02-08 08:13:01,124 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-02-08 08:13:01,124 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 08:13:01,124 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 08:13:01,198 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:13:01,198 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 08:13:01,198 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [419710012] [2025-02-08 08:13:01,198 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [419710012] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 08:13:01,198 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 08:13:01,198 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-02-08 08:13:01,198 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [877818871] [2025-02-08 08:13:01,198 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 08:13:01,198 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 08:13:01,198 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 08:13:01,199 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 08:13:01,199 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 08:13:01,207 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 35 out of 136 [2025-02-08 08:13:01,207 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 98 places, 94 transitions, 206 flow. Second operand has 3 states, 3 states have (on average 36.333333333333336) internal successors, (109), 3 states have internal predecessors, (109), 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:13:01,207 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 08:13:01,207 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 35 of 136 [2025-02-08 08:13:01,208 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 08:13:04,464 INFO L124 PetriNetUnfolderBase]: 44923/63678 cut-off events. [2025-02-08 08:13:04,464 INFO L125 PetriNetUnfolderBase]: For 1233/1233 co-relation queries the response was YES. [2025-02-08 08:13:04,575 INFO L83 FinitePrefix]: Finished finitePrefix Result has 123891 conditions, 63678 events. 44923/63678 cut-off events. For 1233/1233 co-relation queries the response was YES. Maximal size of possible extension queue 3022. Compared 465359 event pairs, 38298 based on Foata normal form. 0/46689 useless extension candidates. Maximal degree in co-relation 123884. Up to 59285 conditions per place. [2025-02-08 08:13:04,820 INFO L140 encePairwiseOnDemand]: 129/136 looper letters, 53 selfloop transitions, 1 changer transitions 0/88 dead transitions. [2025-02-08 08:13:04,820 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 94 places, 88 transitions, 302 flow [2025-02-08 08:13:04,821 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 08:13:04,821 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 08:13:04,821 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 165 transitions. [2025-02-08 08:13:04,822 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.40441176470588236 [2025-02-08 08:13:04,822 INFO L175 Difference]: Start difference. First operand has 98 places, 94 transitions, 206 flow. Second operand 3 states and 165 transitions. [2025-02-08 08:13:04,822 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 94 places, 88 transitions, 302 flow [2025-02-08 08:13:04,823 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 93 places, 88 transitions, 301 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-02-08 08:13:04,824 INFO L231 Difference]: Finished difference. Result has 93 places, 88 transitions, 195 flow [2025-02-08 08:13:04,824 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=136, PETRI_DIFFERENCE_MINUEND_FLOW=193, PETRI_DIFFERENCE_MINUEND_PLACES=91, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=88, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=87, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=195, PETRI_PLACES=93, PETRI_TRANSITIONS=88} [2025-02-08 08:13:04,824 INFO L279 CegarLoopForPetriNet]: 137 programPoint places, -44 predicate places. [2025-02-08 08:13:04,824 INFO L471 AbstractCegarLoop]: Abstraction has has 93 places, 88 transitions, 195 flow [2025-02-08 08:13:04,825 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 36.333333333333336) internal successors, (109), 3 states have internal predecessors, (109), 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:13:04,825 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 08:13:04,825 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 08:13:04,825 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-02-08 08:13:04,825 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting thr1Err33REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thr1Err37REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err38REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err35REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 87 more)] === [2025-02-08 08:13:04,825 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 08:13:04,825 INFO L85 PathProgramCache]: Analyzing trace with hash 1405417792, now seen corresponding path program 1 times [2025-02-08 08:13:04,825 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 08:13:04,826 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1962703890] [2025-02-08 08:13:04,826 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 08:13:04,826 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 08:13:05,167 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-02-08 08:13:05,171 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-02-08 08:13:05,171 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 08:13:05,171 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 08:13:05,200 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:13:05,201 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 08:13:05,201 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1962703890] [2025-02-08 08:13:05,201 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1962703890] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 08:13:05,201 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 08:13:05,201 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-02-08 08:13:05,201 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [97661875] [2025-02-08 08:13:05,201 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 08:13:05,201 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 08:13:05,201 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 08:13:05,202 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 08:13:05,202 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 08:13:05,210 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 32 out of 136 [2025-02-08 08:13:05,210 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 93 places, 88 transitions, 195 flow. Second operand has 3 states, 3 states have (on average 33.666666666666664) internal successors, (101), 3 states have internal predecessors, (101), 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:13:05,210 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 08:13:05,210 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 32 of 136 [2025-02-08 08:13:05,210 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 08:13:08,594 INFO L124 PetriNetUnfolderBase]: 44923/63647 cut-off events. [2025-02-08 08:13:08,595 INFO L125 PetriNetUnfolderBase]: For 1233/1233 co-relation queries the response was YES. [2025-02-08 08:13:08,724 INFO L83 FinitePrefix]: Finished finitePrefix Result has 123861 conditions, 63647 events. 44923/63647 cut-off events. For 1233/1233 co-relation queries the response was YES. Maximal size of possible extension queue 3022. Compared 465320 event pairs, 38298 based on Foata normal form. 0/46689 useless extension candidates. Maximal degree in co-relation 123854. Up to 59285 conditions per place. [2025-02-08 08:13:08,992 INFO L140 encePairwiseOnDemand]: 132/136 looper letters, 53 selfloop transitions, 1 changer transitions 0/85 dead transitions. [2025-02-08 08:13:08,992 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 92 places, 85 transitions, 297 flow [2025-02-08 08:13:08,993 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 08:13:08,993 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 08:13:08,994 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 153 transitions. [2025-02-08 08:13:08,994 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.375 [2025-02-08 08:13:08,994 INFO L175 Difference]: Start difference. First operand has 93 places, 88 transitions, 195 flow. Second operand 3 states and 153 transitions. [2025-02-08 08:13:08,994 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 92 places, 85 transitions, 297 flow [2025-02-08 08:13:08,995 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 91 places, 85 transitions, 296 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-02-08 08:13:08,996 INFO L231 Difference]: Finished difference. Result has 91 places, 85 transitions, 190 flow [2025-02-08 08:13:08,996 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=136, PETRI_DIFFERENCE_MINUEND_FLOW=188, PETRI_DIFFERENCE_MINUEND_PLACES=89, 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=190, PETRI_PLACES=91, PETRI_TRANSITIONS=85} [2025-02-08 08:13:08,997 INFO L279 CegarLoopForPetriNet]: 137 programPoint places, -46 predicate places. [2025-02-08 08:13:08,997 INFO L471 AbstractCegarLoop]: Abstraction has has 91 places, 85 transitions, 190 flow [2025-02-08 08:13:08,997 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 33.666666666666664) internal successors, (101), 3 states have internal predecessors, (101), 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:13:08,997 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 08:13:08,997 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 08:13:08,997 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-02-08 08:13:08,998 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting thr1Err34REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thr1Err37REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err38REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err35REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 87 more)] === [2025-02-08 08:13:08,998 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 08:13:08,998 INFO L85 PathProgramCache]: Analyzing trace with hash 1405417793, now seen corresponding path program 1 times [2025-02-08 08:13:08,998 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 08:13:08,998 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [376148266] [2025-02-08 08:13:08,998 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 08:13:08,998 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 08:13:09,337 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-02-08 08:13:09,344 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-02-08 08:13:09,344 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 08:13:09,344 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 08:13:09,382 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:13:09,383 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 08:13:09,383 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [376148266] [2025-02-08 08:13:09,383 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [376148266] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 08:13:09,383 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 08:13:09,383 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-02-08 08:13:09,383 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2079691872] [2025-02-08 08:13:09,383 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 08:13:09,383 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 08:13:09,383 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 08:13:09,383 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 08:13:09,384 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 08:13:09,394 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 32 out of 136 [2025-02-08 08:13:09,394 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 91 places, 85 transitions, 190 flow. Second operand has 3 states, 3 states have (on average 33.666666666666664) internal successors, (101), 3 states have internal predecessors, (101), 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:13:09,394 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 08:13:09,394 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 32 of 136 [2025-02-08 08:13:09,394 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand