./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/weaver/popl20-more-buffer-series.wvr.c --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/weaver/popl20-more-buffer-series.wvr.c -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 8dbd267b0e0821e8d358e8d234024d8e484ea32431972ed8b70b87052179a50c --- Real Ultimate output --- This is Ultimate 0.3.0-?-48c9605-m [2025-02-08 08:40:28,594 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-08 08:40:28,650 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:40:28,657 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-08 08:40:28,657 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-08 08:40:28,671 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-08 08:40:28,671 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-08 08:40:28,671 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-08 08:40:28,675 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-08 08:40:28,675 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-08 08:40:28,675 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-08 08:40:28,675 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-08 08:40:28,675 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-08 08:40:28,675 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-08 08:40:28,675 INFO L153 SettingsManager]: * Use SBE=true [2025-02-08 08:40:28,675 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-08 08:40:28,675 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-08 08:40:28,675 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-08 08:40:28,675 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-08 08:40:28,675 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-08 08:40:28,675 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2025-02-08 08:40:28,676 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2025-02-08 08:40:28,676 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2025-02-08 08:40:28,676 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-08 08:40:28,676 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-02-08 08:40:28,676 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-02-08 08:40:28,676 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-08 08:40:28,676 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-08 08:40:28,676 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-08 08:40:28,676 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-08 08:40:28,676 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-08 08:40:28,676 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-08 08:40:28,676 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-08 08:40:28,676 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-08 08:40:28,676 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-08 08:40:28,676 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-08 08:40:28,676 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-08 08:40:28,676 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-08 08:40:28,676 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-08 08:40:28,676 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-08 08:40:28,676 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-08 08:40:28,676 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-08 08:40:28,676 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 -> 8dbd267b0e0821e8d358e8d234024d8e484ea32431972ed8b70b87052179a50c [2025-02-08 08:40:28,890 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-08 08:40:28,895 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-08 08:40:28,897 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-08 08:40:28,898 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-08 08:40:28,898 INFO L274 PluginConnector]: CDTParser initialized [2025-02-08 08:40:28,899 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/weaver/popl20-more-buffer-series.wvr.c [2025-02-08 08:40:29,998 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/a6b4dce6e/078fa039df334cfa9aab5a16453e78e3/FLAGb6f405edc [2025-02-08 08:40:30,216 INFO L384 CDTParser]: Found 1 translation units. [2025-02-08 08:40:30,217 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/weaver/popl20-more-buffer-series.wvr.c [2025-02-08 08:40:30,250 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/a6b4dce6e/078fa039df334cfa9aab5a16453e78e3/FLAGb6f405edc [2025-02-08 08:40:30,576 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/a6b4dce6e/078fa039df334cfa9aab5a16453e78e3 [2025-02-08 08:40:30,579 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-08 08:40:30,579 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-08 08:40:30,580 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-08 08:40:30,580 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-08 08:40:30,587 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-08 08:40:30,587 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.02 08:40:30" (1/1) ... [2025-02-08 08:40:30,593 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@40242edb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 08:40:30, skipping insertion in model container [2025-02-08 08:40:30,593 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.02 08:40:30" (1/1) ... [2025-02-08 08:40:30,615 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-08 08:40:30,805 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-02-08 08:40:30,807 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-08 08:40:30,821 INFO L200 MainTranslator]: Completed pre-run [2025-02-08 08:40:30,849 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-08 08:40:30,863 INFO L204 MainTranslator]: Completed translation [2025-02-08 08:40:30,863 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 08:40:30 WrapperNode [2025-02-08 08:40:30,864 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-08 08:40:30,865 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-08 08:40:30,865 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-08 08:40:30,865 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-08 08:40:30,869 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:40:30" (1/1) ... [2025-02-08 08:40:30,879 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:40:30" (1/1) ... [2025-02-08 08:40:30,906 INFO L138 Inliner]: procedures = 26, calls = 68, calls flagged for inlining = 23, calls inlined = 29, statements flattened = 321 [2025-02-08 08:40:30,907 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-08 08:40:30,908 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-08 08:40:30,909 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-08 08:40:30,909 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-08 08:40:30,914 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 08:40:30" (1/1) ... [2025-02-08 08:40:30,914 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 08:40:30" (1/1) ... [2025-02-08 08:40:30,922 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 08:40:30" (1/1) ... [2025-02-08 08:40:30,944 INFO L175 MemorySlicer]: Split 12 memory accesses to 2 slices as follows [2, 10]. 83 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0]. The 3 writes are split as follows [0, 3]. [2025-02-08 08:40:30,944 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 08:40:30" (1/1) ... [2025-02-08 08:40:30,944 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 08:40:30" (1/1) ... [2025-02-08 08:40:30,954 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 08:40:30" (1/1) ... [2025-02-08 08:40:30,954 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 08:40:30" (1/1) ... [2025-02-08 08:40:30,959 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 08:40:30" (1/1) ... [2025-02-08 08:40:30,960 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 08:40:30" (1/1) ... [2025-02-08 08:40:30,966 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-08 08:40:30,966 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-08 08:40:30,966 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-08 08:40:30,966 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-08 08:40:30,967 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 08:40:30" (1/1) ... [2025-02-08 08:40:30,972 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-08 08:40:30,981 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 08:40:30,992 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:40:30,994 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:40:31,012 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-08 08:40:31,012 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-02-08 08:40:31,012 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-02-08 08:40:31,012 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-02-08 08:40:31,012 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-02-08 08:40:31,012 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2025-02-08 08:40:31,012 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2025-02-08 08:40:31,012 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2025-02-08 08:40:31,012 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2025-02-08 08:40:31,012 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2025-02-08 08:40:31,012 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2025-02-08 08:40:31,013 INFO L130 BoogieDeclarations]: Found specification of procedure thread4 [2025-02-08 08:40:31,013 INFO L138 BoogieDeclarations]: Found implementation of procedure thread4 [2025-02-08 08:40:31,013 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-02-08 08:40:31,013 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-02-08 08:40:31,013 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2025-02-08 08:40:31,013 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2025-02-08 08:40:31,013 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-02-08 08:40:31,013 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-08 08:40:31,013 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-08 08:40:31,014 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:40:31,102 INFO L257 CfgBuilder]: Building ICFG [2025-02-08 08:40:31,103 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-08 08:40:31,276 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L102: ~cond~2#1 := (if 0 == (if ~i~0 < ~N~0 || ~q1_front~0 < ~q1_back~0 then 1 else 0) then 0 else 1); [2025-02-08 08:40:31,277 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L99: havoc #t~ret11#1; [2025-02-08 08:40:31,277 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L99-1: havoc #t~mem10#1; [2025-02-08 08:40:31,277 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L99-2: ~total~0 := #t~ret11#1; [2025-02-08 08:40:31,277 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L99-3: assume { :end_inline_plus } true;assume -2147483648 <= #t~ret11#1 && #t~ret11#1 <= 2147483647; [2025-02-08 08:40:31,277 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L99-4: havoc plus_#in~a#1, plus_#in~b#1; [2025-02-08 08:40:31,277 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L99-5: havoc plus_~a#1, plus_~b#1; [2025-02-08 08:40:31,277 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L99-6: #t~ret11#1 := plus_#res#1; [2025-02-08 08:40:31,277 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L104: [2025-02-08 08:40:31,277 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L100: havoc #t~post12#1; [2025-02-08 08:40:31,277 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L100-1: ~q1_front~0 := 1 + #t~post12#1; [2025-02-08 08:40:31,277 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L100-2: #t~post12#1 := ~q1_front~0; [2025-02-08 08:40:31,277 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L101: [2025-02-08 08:40:31,311 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L122: [2025-02-08 08:40:31,311 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L118: havoc #t~post15#1; [2025-02-08 08:40:31,311 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L118-1: ~q2_front~0 := 1 + #t~post15#1; [2025-02-08 08:40:31,311 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L118-2: #t~post15#1 := ~q2_front~0; [2025-02-08 08:40:31,312 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L119: [2025-02-08 08:40:31,312 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L120: ~cond~3#1 := (if 0 == (if ~j~0 < ~N~0 || ~q2_front~0 < ~q2_back~0 then 1 else 0) then 0 else 1); [2025-02-08 08:40:31,312 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L117: havoc #t~ret14#1; [2025-02-08 08:40:31,312 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L117-1: havoc #t~mem13#1; [2025-02-08 08:40:31,312 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L117-2: ~total~0 := #t~ret14#1; [2025-02-08 08:40:31,312 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L117-3: assume { :end_inline_plus } true;assume -2147483648 <= #t~ret14#1 && #t~ret14#1 <= 2147483647; [2025-02-08 08:40:31,312 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L117-4: havoc plus_#in~a#1, plus_#in~b#1; [2025-02-08 08:40:31,312 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L117-5: havoc plus_~a#1, plus_~b#1; [2025-02-08 08:40:31,312 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L117-6: #t~ret14#1 := plus_#res#1; [2025-02-08 08:40:31,440 INFO L304 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-02-08 08:40:31,441 INFO L308 CfgBuilder]: Performing block encoding [2025-02-08 08:40:31,679 WARN L149 AtomicBlockAnalyzer]: Unexpected successor node of atomic block begin: L174 is not an error location. [2025-02-08 08:40:31,680 WARN L149 AtomicBlockAnalyzer]: Unexpected successor node of atomic block begin: L174 is not an error location. [2025-02-08 08:40:31,680 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-08 08:40:31,681 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-08 08:40:31,681 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.02 08:40:31 BoogieIcfgContainer [2025-02-08 08:40:31,681 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-08 08:40:31,683 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-08 08:40:31,683 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-08 08:40:31,686 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-08 08:40:31,686 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.02 08:40:30" (1/3) ... [2025-02-08 08:40:31,686 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@21437388 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.02 08:40:31, skipping insertion in model container [2025-02-08 08:40:31,686 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 08:40:30" (2/3) ... [2025-02-08 08:40:31,686 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@21437388 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.02 08:40:31, skipping insertion in model container [2025-02-08 08:40:31,686 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.02 08:40:31" (3/3) ... [2025-02-08 08:40:31,687 INFO L128 eAbstractionObserver]: Analyzing ICFG popl20-more-buffer-series.wvr.c [2025-02-08 08:40:31,697 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-08 08:40:31,697 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG popl20-more-buffer-series.wvr.c that has 5 procedures, 71 locations, 1 initial locations, 7 loop locations, and 22 error locations. [2025-02-08 08:40:31,698 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-02-08 08:40:31,751 INFO L143 ThreadInstanceAdder]: Constructed 4 joinOtherThreadTransitions. [2025-02-08 08:40:31,773 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 83 places, 75 transitions, 178 flow [2025-02-08 08:40:31,801 INFO L124 PetriNetUnfolderBase]: 5/71 cut-off events. [2025-02-08 08:40:31,802 INFO L125 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2025-02-08 08:40:31,805 INFO L83 FinitePrefix]: Finished finitePrefix Result has 88 conditions, 71 events. 5/71 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 205 event pairs, 0 based on Foata normal form. 0/42 useless extension candidates. Maximal degree in co-relation 59. Up to 2 conditions per place. [2025-02-08 08:40:31,805 INFO L82 GeneralOperation]: Start removeDead. Operand has 83 places, 75 transitions, 178 flow [2025-02-08 08:40:31,807 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 78 places, 70 transitions, 164 flow [2025-02-08 08:40:31,815 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-08 08:40:31,822 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;@3b1db7aa, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-08 08:40:31,822 INFO L334 AbstractCegarLoop]: Starting to check reachability of 40 error locations. [2025-02-08 08:40:31,824 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-02-08 08:40:31,824 INFO L124 PetriNetUnfolderBase]: 1/4 cut-off events. [2025-02-08 08:40:31,824 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-02-08 08:40:31,824 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 08:40:31,825 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2025-02-08 08:40:31,825 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 37 more)] === [2025-02-08 08:40:31,828 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 08:40:31,828 INFO L85 PathProgramCache]: Analyzing trace with hash 899262, now seen corresponding path program 1 times [2025-02-08 08:40:31,833 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 08:40:31,833 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1053904257] [2025-02-08 08:40:31,833 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 08:40:31,833 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 08:40:31,894 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-02-08 08:40:31,906 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-02-08 08:40:31,907 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 08:40:31,907 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 08:40:31,994 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:40:31,995 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 08:40:31,996 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1053904257] [2025-02-08 08:40:31,996 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1053904257] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 08:40:31,996 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 08:40:31,996 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-02-08 08:40:31,997 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [729141481] [2025-02-08 08:40:31,997 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 08:40:32,002 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 08:40:32,005 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 08:40:32,021 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 08:40:32,021 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 08:40:32,036 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 17 out of 75 [2025-02-08 08:40:32,038 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 78 places, 70 transitions, 164 flow. Second operand has 3 states, 3 states have (on average 18.0) internal successors, (54), 3 states have internal predecessors, (54), 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:40:32,038 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 08:40:32,038 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 17 of 75 [2025-02-08 08:40:32,039 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 08:40:34,470 INFO L124 PetriNetUnfolderBase]: 22497/30708 cut-off events. [2025-02-08 08:40:34,471 INFO L125 PetriNetUnfolderBase]: For 718/718 co-relation queries the response was YES. [2025-02-08 08:40:34,543 INFO L83 FinitePrefix]: Finished finitePrefix Result has 62091 conditions, 30708 events. 22497/30708 cut-off events. For 718/718 co-relation queries the response was YES. Maximal size of possible extension queue 1815. Compared 201558 event pairs, 20908 based on Foata normal form. 1/19225 useless extension candidates. Maximal degree in co-relation 59096. Up to 29848 conditions per place. [2025-02-08 08:40:34,683 INFO L140 encePairwiseOnDemand]: 67/75 looper letters, 49 selfloop transitions, 2 changer transitions 0/63 dead transitions. [2025-02-08 08:40:34,684 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 73 places, 63 transitions, 252 flow [2025-02-08 08:40:34,685 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 08:40:34,686 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 08:40:34,692 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 108 transitions. [2025-02-08 08:40:34,693 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.48 [2025-02-08 08:40:34,695 INFO L175 Difference]: Start difference. First operand has 78 places, 70 transitions, 164 flow. Second operand 3 states and 108 transitions. [2025-02-08 08:40:34,695 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 73 places, 63 transitions, 252 flow [2025-02-08 08:40:34,854 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 65 places, 63 transitions, 236 flow, removed 0 selfloop flow, removed 8 redundant places. [2025-02-08 08:40:34,856 INFO L231 Difference]: Finished difference. Result has 65 places, 63 transitions, 138 flow [2025-02-08 08:40:34,861 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=75, PETRI_DIFFERENCE_MINUEND_FLOW=134, PETRI_DIFFERENCE_MINUEND_PLACES=63, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=63, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=61, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=138, PETRI_PLACES=65, PETRI_TRANSITIONS=63} [2025-02-08 08:40:34,866 INFO L279 CegarLoopForPetriNet]: 78 programPoint places, -13 predicate places. [2025-02-08 08:40:34,866 INFO L471 AbstractCegarLoop]: Abstraction has has 65 places, 63 transitions, 138 flow [2025-02-08 08:40:34,866 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 18.0) internal successors, (54), 3 states have internal predecessors, (54), 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:40:34,866 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 08:40:34,866 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2025-02-08 08:40:34,866 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-02-08 08:40:34,867 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 37 more)] === [2025-02-08 08:40:34,867 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 08:40:34,867 INFO L85 PathProgramCache]: Analyzing trace with hash 899263, now seen corresponding path program 1 times [2025-02-08 08:40:34,867 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 08:40:34,867 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1000783449] [2025-02-08 08:40:34,867 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 08:40:34,867 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 08:40:34,879 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-02-08 08:40:34,906 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-02-08 08:40:34,907 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 08:40:34,907 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 08:40:35,139 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:40:35,140 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 08:40:35,140 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1000783449] [2025-02-08 08:40:35,140 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1000783449] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 08:40:35,140 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 08:40:35,140 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 08:40:35,140 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1883566704] [2025-02-08 08:40:35,140 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 08:40:35,141 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-08 08:40:35,141 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 08:40:35,141 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-08 08:40:35,141 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-08 08:40:35,168 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 17 out of 75 [2025-02-08 08:40:35,169 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 65 places, 63 transitions, 138 flow. Second operand has 4 states, 4 states have (on average 17.75) internal successors, (71), 4 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:40:35,169 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 08:40:35,169 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 17 of 75 [2025-02-08 08:40:35,170 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 08:40:37,056 INFO L124 PetriNetUnfolderBase]: 22498/30711 cut-off events. [2025-02-08 08:40:37,056 INFO L125 PetriNetUnfolderBase]: For 99/99 co-relation queries the response was YES. [2025-02-08 08:40:37,137 INFO L83 FinitePrefix]: Finished finitePrefix Result has 61155 conditions, 30711 events. 22498/30711 cut-off events. For 99/99 co-relation queries the response was YES. Maximal size of possible extension queue 1815. Compared 201819 event pairs, 20908 based on Foata normal form. 0/19224 useless extension candidates. Maximal degree in co-relation 61118. Up to 29861 conditions per place. [2025-02-08 08:40:37,299 INFO L140 encePairwiseOnDemand]: 70/75 looper letters, 53 selfloop transitions, 4 changer transitions 0/66 dead transitions. [2025-02-08 08:40:37,300 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 68 places, 66 transitions, 258 flow [2025-02-08 08:40:37,301 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-08 08:40:37,301 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-02-08 08:40:37,304 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 126 transitions. [2025-02-08 08:40:37,304 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.42 [2025-02-08 08:40:37,304 INFO L175 Difference]: Start difference. First operand has 65 places, 63 transitions, 138 flow. Second operand 4 states and 126 transitions. [2025-02-08 08:40:37,304 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 68 places, 66 transitions, 258 flow [2025-02-08 08:40:37,305 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 66 places, 66 transitions, 254 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-08 08:40:37,307 INFO L231 Difference]: Finished difference. Result has 68 places, 66 transitions, 161 flow [2025-02-08 08:40:37,307 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=75, PETRI_DIFFERENCE_MINUEND_FLOW=134, PETRI_DIFFERENCE_MINUEND_PLACES=63, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=63, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=59, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=161, PETRI_PLACES=68, PETRI_TRANSITIONS=66} [2025-02-08 08:40:37,307 INFO L279 CegarLoopForPetriNet]: 78 programPoint places, -10 predicate places. [2025-02-08 08:40:37,307 INFO L471 AbstractCegarLoop]: Abstraction has has 68 places, 66 transitions, 161 flow [2025-02-08 08:40:37,308 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 17.75) internal successors, (71), 4 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:40:37,308 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 08:40:37,308 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1] [2025-02-08 08:40:37,308 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-02-08 08:40:37,308 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 37 more)] === [2025-02-08 08:40:37,308 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 08:40:37,308 INFO L85 PathProgramCache]: Analyzing trace with hash 27880444, now seen corresponding path program 1 times [2025-02-08 08:40:37,308 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 08:40:37,308 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1495241362] [2025-02-08 08:40:37,308 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 08:40:37,308 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 08:40:37,317 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-02-08 08:40:37,337 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-02-08 08:40:37,340 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 08:40:37,341 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 08:40:37,553 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:40:37,554 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 08:40:37,554 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1495241362] [2025-02-08 08:40:37,554 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1495241362] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 08:40:37,554 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 08:40:37,554 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-08 08:40:37,554 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1408141175] [2025-02-08 08:40:37,554 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 08:40:37,554 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-08 08:40:37,555 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 08:40:37,555 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-08 08:40:37,555 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-08 08:40:37,571 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 17 out of 75 [2025-02-08 08:40:37,572 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 68 places, 66 transitions, 161 flow. Second operand has 5 states, 5 states have (on average 17.8) internal successors, (89), 5 states have internal predecessors, (89), 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:40:37,573 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 08:40:37,573 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 17 of 75 [2025-02-08 08:40:37,573 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 08:40:39,101 INFO L124 PetriNetUnfolderBase]: 22499/30714 cut-off events. [2025-02-08 08:40:39,102 INFO L125 PetriNetUnfolderBase]: For 99/99 co-relation queries the response was YES. [2025-02-08 08:40:39,130 INFO L83 FinitePrefix]: Finished finitePrefix Result has 61172 conditions, 30714 events. 22499/30714 cut-off events. For 99/99 co-relation queries the response was YES. Maximal size of possible extension queue 1815. Compared 201819 event pairs, 20908 based on Foata normal form. 0/19226 useless extension candidates. Maximal degree in co-relation 61147. Up to 29860 conditions per place. [2025-02-08 08:40:39,244 INFO L140 encePairwiseOnDemand]: 67/75 looper letters, 53 selfloop transitions, 7 changer transitions 0/69 dead transitions. [2025-02-08 08:40:39,244 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 72 places, 69 transitions, 287 flow [2025-02-08 08:40:39,244 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-08 08:40:39,245 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-02-08 08:40:39,245 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 146 transitions. [2025-02-08 08:40:39,245 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.3893333333333333 [2025-02-08 08:40:39,246 INFO L175 Difference]: Start difference. First operand has 68 places, 66 transitions, 161 flow. Second operand 5 states and 146 transitions. [2025-02-08 08:40:39,246 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 72 places, 69 transitions, 287 flow [2025-02-08 08:40:39,246 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 71 places, 69 transitions, 284 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-02-08 08:40:39,247 INFO L231 Difference]: Finished difference. Result has 73 places, 69 transitions, 195 flow [2025-02-08 08:40:39,247 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=75, PETRI_DIFFERENCE_MINUEND_FLOW=158, PETRI_DIFFERENCE_MINUEND_PLACES=67, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=66, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=59, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=195, PETRI_PLACES=73, PETRI_TRANSITIONS=69} [2025-02-08 08:40:39,248 INFO L279 CegarLoopForPetriNet]: 78 programPoint places, -5 predicate places. [2025-02-08 08:40:39,248 INFO L471 AbstractCegarLoop]: Abstraction has has 73 places, 69 transitions, 195 flow [2025-02-08 08:40:39,248 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 17.8) internal successors, (89), 5 states have internal predecessors, (89), 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:40:39,248 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 08:40:39,248 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1] [2025-02-08 08:40:39,248 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-02-08 08:40:39,249 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 37 more)] === [2025-02-08 08:40:39,249 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 08:40:39,249 INFO L85 PathProgramCache]: Analyzing trace with hash 864220340, now seen corresponding path program 1 times [2025-02-08 08:40:39,249 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 08:40:39,249 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [897125547] [2025-02-08 08:40:39,249 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 08:40:39,249 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 08:40:39,254 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-02-08 08:40:39,261 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-02-08 08:40:39,261 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 08:40:39,261 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 08:40:39,409 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 08:40:39,409 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 08:40:39,409 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [897125547] [2025-02-08 08:40:39,409 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [897125547] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 08:40:39,409 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [239986159] [2025-02-08 08:40:39,409 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 08:40:39,409 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 08:40:39,410 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 08:40:39,414 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-08 08:40:39,416 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-02-08 08:40:39,465 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-02-08 08:40:39,474 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-02-08 08:40:39,474 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 08:40:39,474 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 08:40:39,476 INFO L256 TraceCheckSpWp]: Trace formula consists of 87 conjuncts, 14 conjuncts are in the unsatisfiable core [2025-02-08 08:40:39,482 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 08:40:39,528 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2025-02-08 08:40:39,691 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 08:40:39,692 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-08 08:40:39,788 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 08:40:39,788 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [239986159] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-08 08:40:39,788 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-08 08:40:39,788 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2025-02-08 08:40:39,788 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1028057122] [2025-02-08 08:40:39,788 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-08 08:40:39,789 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-02-08 08:40:39,789 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 08:40:39,789 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-02-08 08:40:39,789 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=76, Unknown=0, NotChecked=0, Total=110 [2025-02-08 08:40:39,864 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 17 out of 75 [2025-02-08 08:40:39,864 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 73 places, 69 transitions, 195 flow. Second operand has 11 states, 11 states have (on average 18.363636363636363) internal successors, (202), 11 states have internal predecessors, (202), 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:40:39,865 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 08:40:39,865 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 17 of 75 [2025-02-08 08:40:39,865 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 08:40:41,810 INFO L124 PetriNetUnfolderBase]: 22499/30713 cut-off events. [2025-02-08 08:40:41,810 INFO L125 PetriNetUnfolderBase]: For 102/102 co-relation queries the response was YES. [2025-02-08 08:40:41,860 INFO L83 FinitePrefix]: Finished finitePrefix Result has 61185 conditions, 30713 events. 22499/30713 cut-off events. For 102/102 co-relation queries the response was YES. Maximal size of possible extension queue 1818. Compared 202138 event pairs, 20908 based on Foata normal form. 0/19228 useless extension candidates. Maximal degree in co-relation 61157. Up to 29860 conditions per place. [2025-02-08 08:40:41,974 INFO L140 encePairwiseOnDemand]: 70/75 looper letters, 52 selfloop transitions, 7 changer transitions 0/68 dead transitions. [2025-02-08 08:40:41,974 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 77 places, 68 transitions, 309 flow [2025-02-08 08:40:41,974 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-08 08:40:41,974 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-02-08 08:40:41,975 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 159 transitions. [2025-02-08 08:40:41,975 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.35333333333333333 [2025-02-08 08:40:41,975 INFO L175 Difference]: Start difference. First operand has 73 places, 69 transitions, 195 flow. Second operand 6 states and 159 transitions. [2025-02-08 08:40:41,975 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 77 places, 68 transitions, 309 flow [2025-02-08 08:40:41,976 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 76 places, 68 transitions, 308 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-02-08 08:40:41,977 INFO L231 Difference]: Finished difference. Result has 76 places, 68 transitions, 204 flow [2025-02-08 08:40:41,977 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=75, PETRI_DIFFERENCE_MINUEND_FLOW=190, PETRI_DIFFERENCE_MINUEND_PLACES=71, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=68, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=61, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=204, PETRI_PLACES=76, PETRI_TRANSITIONS=68} [2025-02-08 08:40:41,977 INFO L279 CegarLoopForPetriNet]: 78 programPoint places, -2 predicate places. [2025-02-08 08:40:41,977 INFO L471 AbstractCegarLoop]: Abstraction has has 76 places, 68 transitions, 204 flow [2025-02-08 08:40:41,978 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 18.363636363636363) internal successors, (202), 11 states have internal predecessors, (202), 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:40:41,978 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 08:40:41,978 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2025-02-08 08:40:41,984 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-02-08 08:40:42,178 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 08:40:42,179 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 37 more)] === [2025-02-08 08:40:42,179 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 08:40:42,179 INFO L85 PathProgramCache]: Analyzing trace with hash 864294065, now seen corresponding path program 1 times [2025-02-08 08:40:42,180 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 08:40:42,180 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1975954844] [2025-02-08 08:40:42,180 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 08:40:42,180 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 08:40:42,189 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-02-08 08:40:42,205 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-02-08 08:40:42,206 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 08:40:42,206 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 08:40:42,389 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:40:42,390 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 08:40:42,390 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1975954844] [2025-02-08 08:40:42,390 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1975954844] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 08:40:42,390 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 08:40:42,390 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-08 08:40:42,390 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [992973397] [2025-02-08 08:40:42,390 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 08:40:42,390 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-08 08:40:42,391 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 08:40:42,391 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-08 08:40:42,391 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-08 08:40:42,419 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 17 out of 75 [2025-02-08 08:40:42,419 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 76 places, 68 transitions, 204 flow. Second operand has 5 states, 5 states have (on average 18.0) internal successors, (90), 5 states have internal predecessors, (90), 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:40:42,419 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 08:40:42,419 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 17 of 75 [2025-02-08 08:40:42,420 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 08:40:44,149 INFO L124 PetriNetUnfolderBase]: 22500/30716 cut-off events. [2025-02-08 08:40:44,150 INFO L125 PetriNetUnfolderBase]: For 102/102 co-relation queries the response was YES. [2025-02-08 08:40:44,185 INFO L83 FinitePrefix]: Finished finitePrefix Result has 61198 conditions, 30716 events. 22500/30716 cut-off events. For 102/102 co-relation queries the response was YES. Maximal size of possible extension queue 1818. Compared 202220 event pairs, 20908 based on Foata normal form. 0/19230 useless extension candidates. Maximal degree in co-relation 61165. Up to 29862 conditions per place. [2025-02-08 08:40:44,302 INFO L140 encePairwiseOnDemand]: 66/75 looper letters, 53 selfloop transitions, 9 changer transitions 0/71 dead transitions. [2025-02-08 08:40:44,303 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 80 places, 71 transitions, 334 flow [2025-02-08 08:40:44,303 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-08 08:40:44,303 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-02-08 08:40:44,305 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 145 transitions. [2025-02-08 08:40:44,305 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.38666666666666666 [2025-02-08 08:40:44,305 INFO L175 Difference]: Start difference. First operand has 76 places, 68 transitions, 204 flow. Second operand 5 states and 145 transitions. [2025-02-08 08:40:44,305 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 80 places, 71 transitions, 334 flow [2025-02-08 08:40:44,307 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 72 places, 71 transitions, 300 flow, removed 3 selfloop flow, removed 8 redundant places. [2025-02-08 08:40:44,310 INFO L231 Difference]: Finished difference. Result has 74 places, 71 transitions, 213 flow [2025-02-08 08:40:44,310 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=75, PETRI_DIFFERENCE_MINUEND_FLOW=170, PETRI_DIFFERENCE_MINUEND_PLACES=68, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=68, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=59, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=213, PETRI_PLACES=74, PETRI_TRANSITIONS=71} [2025-02-08 08:40:44,310 INFO L279 CegarLoopForPetriNet]: 78 programPoint places, -4 predicate places. [2025-02-08 08:40:44,310 INFO L471 AbstractCegarLoop]: Abstraction has has 74 places, 71 transitions, 213 flow [2025-02-08 08:40:44,310 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 18.0) internal successors, (90), 5 states have internal predecessors, (90), 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:40:44,310 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 08:40:44,310 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1] [2025-02-08 08:40:44,310 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-02-08 08:40:44,311 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 37 more)] === [2025-02-08 08:40:44,311 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 08:40:44,311 INFO L85 PathProgramCache]: Analyzing trace with hash 1023331650, now seen corresponding path program 1 times [2025-02-08 08:40:44,311 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 08:40:44,311 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1212440716] [2025-02-08 08:40:44,311 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 08:40:44,311 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 08:40:44,319 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-02-08 08:40:44,327 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-02-08 08:40:44,327 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 08:40:44,327 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 08:40:44,489 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 08:40:44,489 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 08:40:44,489 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1212440716] [2025-02-08 08:40:44,489 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1212440716] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 08:40:44,490 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [725024205] [2025-02-08 08:40:44,490 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 08:40:44,490 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 08:40:44,490 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 08:40:44,492 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-08 08:40:44,493 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-02-08 08:40:44,533 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-02-08 08:40:44,546 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-02-08 08:40:44,546 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 08:40:44,546 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 08:40:44,547 INFO L256 TraceCheckSpWp]: Trace formula consists of 112 conjuncts, 12 conjuncts are in the unsatisfiable core [2025-02-08 08:40:44,548 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 08:40:44,564 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2025-02-08 08:40:44,651 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 08:40:44,651 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-08 08:40:44,750 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 08:40:44,750 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [725024205] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-08 08:40:44,750 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-08 08:40:44,750 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 11 [2025-02-08 08:40:44,751 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1834720225] [2025-02-08 08:40:44,751 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-08 08:40:44,751 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-02-08 08:40:44,751 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 08:40:44,751 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-02-08 08:40:44,751 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=118, Unknown=0, NotChecked=0, Total=156 [2025-02-08 08:40:44,854 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 17 out of 75 [2025-02-08 08:40:44,854 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 74 places, 71 transitions, 213 flow. Second operand has 13 states, 13 states have (on average 18.307692307692307) internal successors, (238), 13 states have internal predecessors, (238), 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:40:44,855 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 08:40:44,855 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 17 of 75 [2025-02-08 08:40:44,855 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 08:40:46,391 INFO L124 PetriNetUnfolderBase]: 22500/30715 cut-off events. [2025-02-08 08:40:46,391 INFO L125 PetriNetUnfolderBase]: For 104/104 co-relation queries the response was YES. [2025-02-08 08:40:46,428 INFO L83 FinitePrefix]: Finished finitePrefix Result has 61196 conditions, 30715 events. 22500/30715 cut-off events. For 104/104 co-relation queries the response was YES. Maximal size of possible extension queue 1815. Compared 201847 event pairs, 20908 based on Foata normal form. 0/19232 useless extension candidates. Maximal degree in co-relation 61154. Up to 29855 conditions per place. [2025-02-08 08:40:46,882 INFO L140 encePairwiseOnDemand]: 67/75 looper letters, 49 selfloop transitions, 12 changer transitions 0/70 dead transitions. [2025-02-08 08:40:46,882 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 79 places, 70 transitions, 331 flow [2025-02-08 08:40:46,883 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-02-08 08:40:46,883 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-02-08 08:40:46,884 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 178 transitions. [2025-02-08 08:40:46,884 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.33904761904761904 [2025-02-08 08:40:46,884 INFO L175 Difference]: Start difference. First operand has 74 places, 71 transitions, 213 flow. Second operand 7 states and 178 transitions. [2025-02-08 08:40:46,884 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 79 places, 70 transitions, 331 flow [2025-02-08 08:40:46,885 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 77 places, 70 transitions, 324 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-08 08:40:46,885 INFO L231 Difference]: Finished difference. Result has 77 places, 70 transitions, 226 flow [2025-02-08 08:40:46,885 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=75, PETRI_DIFFERENCE_MINUEND_FLOW=202, PETRI_DIFFERENCE_MINUEND_PLACES=71, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=70, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=58, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=226, PETRI_PLACES=77, PETRI_TRANSITIONS=70} [2025-02-08 08:40:46,886 INFO L279 CegarLoopForPetriNet]: 78 programPoint places, -1 predicate places. [2025-02-08 08:40:46,886 INFO L471 AbstractCegarLoop]: Abstraction has has 77 places, 70 transitions, 226 flow [2025-02-08 08:40:46,886 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 18.307692307692307) internal successors, (238), 13 states have internal predecessors, (238), 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:40:46,886 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 08:40:46,886 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1] [2025-02-08 08:40:46,898 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-02-08 08:40:47,087 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 08:40:47,087 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 37 more)] === [2025-02-08 08:40:47,088 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 08:40:47,088 INFO L85 PathProgramCache]: Analyzing trace with hash 1657935701, now seen corresponding path program 1 times [2025-02-08 08:40:47,088 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 08:40:47,088 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [721146702] [2025-02-08 08:40:47,088 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 08:40:47,089 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 08:40:47,100 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-02-08 08:40:47,110 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-02-08 08:40:47,113 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 08:40:47,113 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 08:40:47,291 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 08:40:47,291 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 08:40:47,291 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [721146702] [2025-02-08 08:40:47,291 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [721146702] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 08:40:47,291 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [541549886] [2025-02-08 08:40:47,291 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 08:40:47,291 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 08:40:47,291 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 08:40:47,293 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-08 08:40:47,295 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-02-08 08:40:47,339 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-02-08 08:40:47,354 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-02-08 08:40:47,354 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 08:40:47,354 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 08:40:47,355 INFO L256 TraceCheckSpWp]: Trace formula consists of 137 conjuncts, 14 conjuncts are in the unsatisfiable core [2025-02-08 08:40:47,356 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 08:40:47,369 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2025-02-08 08:40:47,490 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 08:40:47,490 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-08 08:40:47,620 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 08:40:47,621 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [541549886] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-08 08:40:47,621 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-08 08:40:47,621 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 11 [2025-02-08 08:40:47,621 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [196221923] [2025-02-08 08:40:47,621 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-08 08:40:47,621 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-02-08 08:40:47,621 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 08:40:47,622 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-02-08 08:40:47,622 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=116, Unknown=0, NotChecked=0, Total=156 [2025-02-08 08:40:47,717 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 17 out of 75 [2025-02-08 08:40:47,717 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 77 places, 70 transitions, 226 flow. Second operand has 13 states, 13 states have (on average 18.46153846153846) internal successors, (240), 13 states have internal predecessors, (240), 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:40:47,717 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 08:40:47,717 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 17 of 75 [2025-02-08 08:40:47,717 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 08:40:50,126 INFO L124 PetriNetUnfolderBase]: 22500/30714 cut-off events. [2025-02-08 08:40:50,127 INFO L125 PetriNetUnfolderBase]: For 105/105 co-relation queries the response was YES. [2025-02-08 08:40:50,155 INFO L83 FinitePrefix]: Finished finitePrefix Result has 61201 conditions, 30714 events. 22500/30714 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 1818. Compared 201950 event pairs, 20908 based on Foata normal form. 0/19232 useless extension candidates. Maximal degree in co-relation 61156. Up to 29854 conditions per place. [2025-02-08 08:40:50,248 INFO L140 encePairwiseOnDemand]: 66/75 looper letters, 45 selfloop transitions, 15 changer transitions 0/69 dead transitions. [2025-02-08 08:40:50,248 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 82 places, 69 transitions, 342 flow [2025-02-08 08:40:50,249 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-02-08 08:40:50,249 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-02-08 08:40:50,249 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 177 transitions. [2025-02-08 08:40:50,250 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.33714285714285713 [2025-02-08 08:40:50,250 INFO L175 Difference]: Start difference. First operand has 77 places, 70 transitions, 226 flow. Second operand 7 states and 177 transitions. [2025-02-08 08:40:50,250 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 82 places, 69 transitions, 342 flow [2025-02-08 08:40:50,251 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 77 places, 69 transitions, 317 flow, removed 3 selfloop flow, removed 5 redundant places. [2025-02-08 08:40:50,255 INFO L231 Difference]: Finished difference. Result has 77 places, 69 transitions, 227 flow [2025-02-08 08:40:50,255 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=75, PETRI_DIFFERENCE_MINUEND_FLOW=197, PETRI_DIFFERENCE_MINUEND_PLACES=71, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=69, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=54, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=227, PETRI_PLACES=77, PETRI_TRANSITIONS=69} [2025-02-08 08:40:50,256 INFO L279 CegarLoopForPetriNet]: 78 programPoint places, -1 predicate places. [2025-02-08 08:40:50,256 INFO L471 AbstractCegarLoop]: Abstraction has has 77 places, 69 transitions, 227 flow [2025-02-08 08:40:50,256 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 18.46153846153846) internal successors, (240), 13 states have internal predecessors, (240), 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:40:50,256 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 08:40:50,256 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 08:40:50,271 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-02-08 08:40:50,457 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 08:40:50,457 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 37 more)] === [2025-02-08 08:40:50,458 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 08:40:50,458 INFO L85 PathProgramCache]: Analyzing trace with hash -39438798, now seen corresponding path program 1 times [2025-02-08 08:40:50,458 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 08:40:50,458 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [535514638] [2025-02-08 08:40:50,458 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 08:40:50,458 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 08:40:50,463 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-02-08 08:40:50,468 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-02-08 08:40:50,468 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 08:40:50,468 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 08:40:50,524 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 08:40:50,524 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 08:40:50,524 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [535514638] [2025-02-08 08:40:50,524 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [535514638] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 08:40:50,524 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 08:40:50,524 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 08:40:50,524 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1299424415] [2025-02-08 08:40:50,524 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 08:40:50,525 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-08 08:40:50,525 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 08:40:50,525 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-08 08:40:50,525 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-08 08:40:50,530 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 20 out of 75 [2025-02-08 08:40:50,530 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 77 places, 69 transitions, 227 flow. Second operand has 4 states, 4 states have (on average 21.75) internal successors, (87), 4 states have internal predecessors, (87), 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:40:50,530 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 08:40:50,530 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 20 of 75 [2025-02-08 08:40:50,530 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 08:40:52,791 INFO L124 PetriNetUnfolderBase]: 26005/35755 cut-off events. [2025-02-08 08:40:52,791 INFO L125 PetriNetUnfolderBase]: For 128/128 co-relation queries the response was YES. [2025-02-08 08:40:52,842 INFO L83 FinitePrefix]: Finished finitePrefix Result has 71274 conditions, 35755 events. 26005/35755 cut-off events. For 128/128 co-relation queries the response was YES. Maximal size of possible extension queue 1975. Compared 238722 event pairs, 24260 based on Foata normal form. 808/24107 useless extension candidates. Maximal degree in co-relation 61156. Up to 29863 conditions per place. [2025-02-08 08:40:52,975 INFO L140 encePairwiseOnDemand]: 60/75 looper letters, 96 selfloop transitions, 7 changer transitions 0/112 dead transitions. [2025-02-08 08:40:52,975 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 81 places, 112 transitions, 573 flow [2025-02-08 08:40:52,975 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-08 08:40:52,975 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-02-08 08:40:52,976 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 205 transitions. [2025-02-08 08:40:52,976 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5466666666666666 [2025-02-08 08:40:52,976 INFO L175 Difference]: Start difference. First operand has 77 places, 69 transitions, 227 flow. Second operand 5 states and 205 transitions. [2025-02-08 08:40:52,976 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 81 places, 112 transitions, 573 flow [2025-02-08 08:40:52,977 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 75 places, 112 transitions, 516 flow, removed 6 selfloop flow, removed 6 redundant places. [2025-02-08 08:40:52,978 INFO L231 Difference]: Finished difference. Result has 77 places, 73 transitions, 255 flow [2025-02-08 08:40:52,978 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=75, PETRI_DIFFERENCE_MINUEND_FLOW=192, PETRI_DIFFERENCE_MINUEND_PLACES=71, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=69, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=62, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=255, PETRI_PLACES=77, PETRI_TRANSITIONS=73} [2025-02-08 08:40:52,979 INFO L279 CegarLoopForPetriNet]: 78 programPoint places, -1 predicate places. [2025-02-08 08:40:52,979 INFO L471 AbstractCegarLoop]: Abstraction has has 77 places, 73 transitions, 255 flow [2025-02-08 08:40:52,979 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 21.75) internal successors, (87), 4 states have internal predecessors, (87), 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:40:52,979 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 08:40:52,979 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 08:40:52,979 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-02-08 08:40:52,980 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 37 more)] === [2025-02-08 08:40:52,980 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 08:40:52,980 INFO L85 PathProgramCache]: Analyzing trace with hash -1252399510, now seen corresponding path program 1 times [2025-02-08 08:40:52,980 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 08:40:52,980 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [557937935] [2025-02-08 08:40:52,980 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 08:40:52,980 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 08:40:52,986 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-02-08 08:40:52,992 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-02-08 08:40:52,993 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 08:40:52,993 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 08:40:53,108 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-02-08 08:40:53,108 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 08:40:53,108 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [557937935] [2025-02-08 08:40:53,108 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [557937935] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 08:40:53,108 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 08:40:53,108 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-08 08:40:53,109 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [491385738] [2025-02-08 08:40:53,109 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 08:40:53,109 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-08 08:40:53,109 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 08:40:53,109 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-08 08:40:53,109 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-02-08 08:40:53,118 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 19 out of 75 [2025-02-08 08:40:53,119 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 77 places, 73 transitions, 255 flow. Second operand has 6 states, 6 states have (on average 20.666666666666668) internal successors, (124), 6 states have internal predecessors, (124), 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:40:53,119 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 08:40:53,119 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 19 of 75 [2025-02-08 08:40:53,119 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 08:40:57,971 INFO L124 PetriNetUnfolderBase]: 60494/82201 cut-off events. [2025-02-08 08:40:57,971 INFO L125 PetriNetUnfolderBase]: For 2946/2946 co-relation queries the response was YES. [2025-02-08 08:40:58,076 INFO L83 FinitePrefix]: Finished finitePrefix Result has 181181 conditions, 82201 events. 60494/82201 cut-off events. For 2946/2946 co-relation queries the response was YES. Maximal size of possible extension queue 3600. Compared 573930 event pairs, 27618 based on Foata normal form. 0/53459 useless extension candidates. Maximal degree in co-relation 157974. Up to 35529 conditions per place. [2025-02-08 08:40:58,320 INFO L140 encePairwiseOnDemand]: 68/75 looper letters, 154 selfloop transitions, 10 changer transitions 0/172 dead transitions. [2025-02-08 08:40:58,320 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 82 places, 172 transitions, 827 flow [2025-02-08 08:40:58,320 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-08 08:40:58,320 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-02-08 08:40:58,321 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 269 transitions. [2025-02-08 08:40:58,321 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5977777777777777 [2025-02-08 08:40:58,321 INFO L175 Difference]: Start difference. First operand has 77 places, 73 transitions, 255 flow. Second operand 6 states and 269 transitions. [2025-02-08 08:40:58,321 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 82 places, 172 transitions, 827 flow [2025-02-08 08:40:58,331 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 80 places, 172 transitions, 822 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-08 08:40:58,332 INFO L231 Difference]: Finished difference. Result has 83 places, 75 transitions, 291 flow [2025-02-08 08:40:58,333 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=75, PETRI_DIFFERENCE_MINUEND_FLOW=250, PETRI_DIFFERENCE_MINUEND_PLACES=75, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=73, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=63, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=291, PETRI_PLACES=83, PETRI_TRANSITIONS=75} [2025-02-08 08:40:58,333 INFO L279 CegarLoopForPetriNet]: 78 programPoint places, 5 predicate places. [2025-02-08 08:40:58,333 INFO L471 AbstractCegarLoop]: Abstraction has has 83 places, 75 transitions, 291 flow [2025-02-08 08:40:58,333 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 20.666666666666668) internal successors, (124), 6 states have internal predecessors, (124), 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:40:58,334 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 08:40:58,334 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 08:40:58,334 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-02-08 08:40:58,334 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting thread2Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 37 more)] === [2025-02-08 08:40:58,334 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 08:40:58,334 INFO L85 PathProgramCache]: Analyzing trace with hash 766331008, now seen corresponding path program 1 times [2025-02-08 08:40:58,334 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 08:40:58,334 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [810481997] [2025-02-08 08:40:58,334 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 08:40:58,335 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 08:40:58,339 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-02-08 08:40:58,342 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-02-08 08:40:58,343 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 08:40:58,343 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 08:40:58,401 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-02-08 08:40:58,401 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 08:40:58,401 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [810481997] [2025-02-08 08:40:58,401 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [810481997] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 08:40:58,401 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 08:40:58,401 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-08 08:40:58,401 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1880563461] [2025-02-08 08:40:58,401 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 08:40:58,402 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-08 08:40:58,402 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 08:40:58,402 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-08 08:40:58,402 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-08 08:40:58,410 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 17 out of 75 [2025-02-08 08:40:58,411 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 83 places, 75 transitions, 291 flow. Second operand has 4 states, 4 states have (on average 19.25) internal successors, (77), 4 states have internal predecessors, (77), 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:40:58,411 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 08:40:58,411 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 17 of 75 [2025-02-08 08:40:58,411 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand