./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/weaver/parallel-parallel-sum-1.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/parallel-parallel-sum-1.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 b1e99af7c76570461a4b0ac70d664412f250ec04f47fd9ca8c0f85236f1348c6 --- Real Ultimate output --- This is Ultimate 0.3.0-?-48c9605-m [2025-02-08 08:37:39,139 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-08 08:37:39,175 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:37:39,179 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-08 08:37:39,179 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-08 08:37:39,193 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-08 08:37:39,194 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-08 08:37:39,194 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-08 08:37:39,194 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-08 08:37:39,194 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-08 08:37:39,195 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-08 08:37:39,195 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-08 08:37:39,195 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-08 08:37:39,195 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-08 08:37:39,195 INFO L153 SettingsManager]: * Use SBE=true [2025-02-08 08:37:39,195 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-08 08:37:39,195 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-08 08:37:39,195 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-08 08:37:39,195 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-08 08:37:39,195 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-08 08:37:39,195 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2025-02-08 08:37:39,195 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2025-02-08 08:37:39,195 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2025-02-08 08:37:39,195 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-08 08:37:39,195 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-02-08 08:37:39,195 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-02-08 08:37:39,196 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-08 08:37:39,196 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-08 08:37:39,196 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-08 08:37:39,196 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-08 08:37:39,196 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-08 08:37:39,196 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-08 08:37:39,196 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-08 08:37:39,196 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-08 08:37:39,196 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-08 08:37:39,196 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-08 08:37:39,196 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-08 08:37:39,196 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-08 08:37:39,196 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-08 08:37:39,196 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-08 08:37:39,196 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-08 08:37:39,196 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-08 08:37:39,196 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 -> b1e99af7c76570461a4b0ac70d664412f250ec04f47fd9ca8c0f85236f1348c6 [2025-02-08 08:37:39,403 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-08 08:37:39,410 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-08 08:37:39,414 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-08 08:37:39,415 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-08 08:37:39,415 INFO L274 PluginConnector]: CDTParser initialized [2025-02-08 08:37:39,417 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/weaver/parallel-parallel-sum-1.wvr.c [2025-02-08 08:37:40,574 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/282f957d4/16df1581bd4848c283fdd182101aee56/FLAG62c92da83 [2025-02-08 08:37:40,818 INFO L384 CDTParser]: Found 1 translation units. [2025-02-08 08:37:40,818 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/weaver/parallel-parallel-sum-1.wvr.c [2025-02-08 08:37:40,848 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/282f957d4/16df1581bd4848c283fdd182101aee56/FLAG62c92da83 [2025-02-08 08:37:41,148 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/282f957d4/16df1581bd4848c283fdd182101aee56 [2025-02-08 08:37:41,150 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-08 08:37:41,151 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-08 08:37:41,152 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-08 08:37:41,152 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-08 08:37:41,155 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-08 08:37:41,156 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.02 08:37:41" (1/1) ... [2025-02-08 08:37:41,156 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@aac1a9c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 08:37:41, skipping insertion in model container [2025-02-08 08:37:41,156 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.02 08:37:41" (1/1) ... [2025-02-08 08:37:41,167 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-08 08:37:41,302 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:37:41,305 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-08 08:37:41,317 INFO L200 MainTranslator]: Completed pre-run [2025-02-08 08:37:41,349 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-08 08:37:41,363 INFO L204 MainTranslator]: Completed translation [2025-02-08 08:37:41,364 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 08:37:41 WrapperNode [2025-02-08 08:37:41,364 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-08 08:37:41,365 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-08 08:37:41,365 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-08 08:37:41,366 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-08 08:37:41,370 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:37:41" (1/1) ... [2025-02-08 08:37:41,377 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:37:41" (1/1) ... [2025-02-08 08:37:41,399 INFO L138 Inliner]: procedures = 26, calls = 49, calls flagged for inlining = 19, calls inlined = 25, statements flattened = 290 [2025-02-08 08:37:41,400 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-08 08:37:41,400 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-08 08:37:41,400 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-08 08:37:41,400 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-08 08:37:41,406 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 08:37:41" (1/1) ... [2025-02-08 08:37:41,406 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 08:37:41" (1/1) ... [2025-02-08 08:37:41,410 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 08:37:41" (1/1) ... [2025-02-08 08:37:41,426 INFO L175 MemorySlicer]: Split 7 memory accesses to 2 slices as follows [2, 5]. 71 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0]. The 1 writes are split as follows [0, 1]. [2025-02-08 08:37:41,426 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 08:37:41" (1/1) ... [2025-02-08 08:37:41,426 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 08:37:41" (1/1) ... [2025-02-08 08:37:41,431 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 08:37:41" (1/1) ... [2025-02-08 08:37:41,436 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 08:37:41" (1/1) ... [2025-02-08 08:37:41,437 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 08:37:41" (1/1) ... [2025-02-08 08:37:41,438 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 08:37:41" (1/1) ... [2025-02-08 08:37:41,440 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-08 08:37:41,440 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-08 08:37:41,440 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-08 08:37:41,440 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-08 08:37:41,441 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 08:37:41" (1/1) ... [2025-02-08 08:37:41,446 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-08 08:37:41,454 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 08:37:41,464 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:37:41,466 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:37:41,480 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-08 08:37:41,480 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-02-08 08:37:41,481 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-02-08 08:37:41,481 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-02-08 08:37:41,481 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-02-08 08:37:41,481 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2025-02-08 08:37:41,481 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2025-02-08 08:37:41,481 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2025-02-08 08:37:41,481 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2025-02-08 08:37:41,481 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2025-02-08 08:37:41,481 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2025-02-08 08:37:41,481 INFO L130 BoogieDeclarations]: Found specification of procedure thread4 [2025-02-08 08:37:41,481 INFO L138 BoogieDeclarations]: Found implementation of procedure thread4 [2025-02-08 08:37:41,481 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-02-08 08:37:41,481 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-02-08 08:37:41,481 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2025-02-08 08:37:41,481 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2025-02-08 08:37:41,481 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-02-08 08:37:41,481 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-08 08:37:41,481 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-08 08:37:41,482 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:37:41,558 INFO L257 CfgBuilder]: Building ICFG [2025-02-08 08:37:41,560 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-08 08:37:41,634 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L56: [2025-02-08 08:37:41,635 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L55: havoc #t~ret4#1; [2025-02-08 08:37:41,635 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L55-1: ~s1~0 := #t~ret4#1; [2025-02-08 08:37:41,636 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L55-2: assume { :end_inline_plus } true;assume -2147483648 <= #t~ret4#1 && #t~ret4#1 <= 2147483647; [2025-02-08 08:37:41,636 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L55-3: havoc plus_#in~a#1, plus_#in~b#1; [2025-02-08 08:37:41,636 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L55-4: havoc plus_~a#1, plus_~b#1; [2025-02-08 08:37:41,637 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L55-5: #t~ret4#1 := plus_#res#1; [2025-02-08 08:37:41,696 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L70: havoc #t~ret8#1; [2025-02-08 08:37:41,696 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L70-1: ~s1~0 := #t~ret8#1; [2025-02-08 08:37:41,696 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L70-2: assume { :end_inline_plus } true;assume -2147483648 <= #t~ret8#1 && #t~ret8#1 <= 2147483647; [2025-02-08 08:37:41,696 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L70-3: havoc plus_#in~a#1, plus_#in~b#1; [2025-02-08 08:37:41,696 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L70-4: havoc plus_~a#1, plus_~b#1; [2025-02-08 08:37:41,696 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L70-5: #t~ret8#1 := plus_#res#1; [2025-02-08 08:37:41,696 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L71: [2025-02-08 08:37:41,735 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L85: havoc #t~ret12#1; [2025-02-08 08:37:41,735 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L85-1: ~s2~0 := #t~ret12#1; [2025-02-08 08:37:41,735 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L85-2: assume { :end_inline_plus } true;assume -2147483648 <= #t~ret12#1 && #t~ret12#1 <= 2147483647; [2025-02-08 08:37:41,736 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L85-3: havoc plus_#in~a#1, plus_#in~b#1; [2025-02-08 08:37:41,736 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L85-4: havoc plus_~a#1, plus_~b#1; [2025-02-08 08:37:41,736 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L85-5: #t~ret12#1 := plus_#res#1; [2025-02-08 08:37:41,736 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L86: [2025-02-08 08:37:41,782 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L100: havoc #t~ret16#1; [2025-02-08 08:37:41,782 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L100-1: ~s2~0 := #t~ret16#1; [2025-02-08 08:37:41,782 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L100-2: assume { :end_inline_plus } true;assume -2147483648 <= #t~ret16#1 && #t~ret16#1 <= 2147483647; [2025-02-08 08:37:41,782 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L100-3: havoc plus_#in~a#1, plus_#in~b#1; [2025-02-08 08:37:41,782 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L100-4: havoc plus_~a#1, plus_~b#1; [2025-02-08 08:37:41,782 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L100-5: #t~ret16#1 := plus_#res#1; [2025-02-08 08:37:41,782 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L101: [2025-02-08 08:37:41,902 INFO L304 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-02-08 08:37:41,905 INFO L308 CfgBuilder]: Performing block encoding [2025-02-08 08:37:42,142 WARN L149 AtomicBlockAnalyzer]: Unexpected successor node of atomic block begin: L155 is not an error location. [2025-02-08 08:37:42,144 WARN L149 AtomicBlockAnalyzer]: Unexpected successor node of atomic block begin: L155 is not an error location. [2025-02-08 08:37:42,144 WARN L149 AtomicBlockAnalyzer]: Unexpected successor node of atomic block begin: L155 is not an error location. [2025-02-08 08:37:42,144 WARN L149 AtomicBlockAnalyzer]: Unexpected successor node of atomic block begin: L155 is not an error location. [2025-02-08 08:37:42,145 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-08 08:37:42,145 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-08 08:37:42,146 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.02 08:37:42 BoogieIcfgContainer [2025-02-08 08:37:42,146 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-08 08:37:42,148 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-08 08:37:42,148 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-08 08:37:42,151 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-08 08:37:42,151 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.02 08:37:41" (1/3) ... [2025-02-08 08:37:42,152 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2e838b9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.02 08:37:42, skipping insertion in model container [2025-02-08 08:37:42,152 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 08:37:41" (2/3) ... [2025-02-08 08:37:42,152 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2e838b9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.02 08:37:42, skipping insertion in model container [2025-02-08 08:37:42,153 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.02 08:37:42" (3/3) ... [2025-02-08 08:37:42,153 INFO L128 eAbstractionObserver]: Analyzing ICFG parallel-parallel-sum-1.wvr.c [2025-02-08 08:37:42,165 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-08 08:37:42,166 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG parallel-parallel-sum-1.wvr.c that has 5 procedures, 63 locations, 1 initial locations, 5 loop locations, and 12 error locations. [2025-02-08 08:37:42,166 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-02-08 08:37:42,224 INFO L143 ThreadInstanceAdder]: Constructed 4 joinOtherThreadTransitions. [2025-02-08 08:37:42,249 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 75 places, 67 transitions, 162 flow [2025-02-08 08:37:42,281 INFO L124 PetriNetUnfolderBase]: 5/63 cut-off events. [2025-02-08 08:37:42,283 INFO L125 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2025-02-08 08:37:42,288 INFO L83 FinitePrefix]: Finished finitePrefix Result has 80 conditions, 63 events. 5/63 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 151 event pairs, 0 based on Foata normal form. 0/42 useless extension candidates. Maximal degree in co-relation 53. Up to 2 conditions per place. [2025-02-08 08:37:42,289 INFO L82 GeneralOperation]: Start removeDead. Operand has 75 places, 67 transitions, 162 flow [2025-02-08 08:37:42,292 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 70 places, 62 transitions, 148 flow [2025-02-08 08:37:42,299 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-08 08:37:42,306 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;@77b2bc0, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-08 08:37:42,307 INFO L334 AbstractCegarLoop]: Starting to check reachability of 24 error locations. [2025-02-08 08:37:42,311 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-02-08 08:37:42,312 INFO L124 PetriNetUnfolderBase]: 1/4 cut-off events. [2025-02-08 08:37:42,312 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-02-08 08:37:42,312 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 08:37:42,312 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2025-02-08 08:37:42,312 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 21 more)] === [2025-02-08 08:37:42,316 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 08:37:42,317 INFO L85 PathProgramCache]: Analyzing trace with hash 771602, now seen corresponding path program 1 times [2025-02-08 08:37:42,323 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 08:37:42,323 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1447462672] [2025-02-08 08:37:42,325 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 08:37:42,325 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 08:37:42,376 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-02-08 08:37:42,391 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-02-08 08:37:42,391 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 08:37:42,392 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 08:37:42,506 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:37:42,509 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 08:37:42,509 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1447462672] [2025-02-08 08:37:42,510 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1447462672] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 08:37:42,510 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 08:37:42,510 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-02-08 08:37:42,511 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [241476290] [2025-02-08 08:37:42,512 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 08:37:42,516 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 08:37:42,519 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 08:37:42,532 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 08:37:42,532 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 08:37:42,539 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 67 [2025-02-08 08:37:42,541 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 70 places, 62 transitions, 148 flow. Second operand has 3 states, 3 states have (on average 12.0) internal successors, (36), 3 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 08:37:42,541 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 08:37:42,541 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 67 [2025-02-08 08:37:42,541 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 08:37:46,032 INFO L124 PetriNetUnfolderBase]: 46385/62134 cut-off events. [2025-02-08 08:37:46,033 INFO L125 PetriNetUnfolderBase]: For 2871/2871 co-relation queries the response was YES. [2025-02-08 08:37:46,175 INFO L83 FinitePrefix]: Finished finitePrefix Result has 126569 conditions, 62134 events. 46385/62134 cut-off events. For 2871/2871 co-relation queries the response was YES. Maximal size of possible extension queue 2748. Compared 378216 event pairs, 46384 based on Foata normal form. 1/41954 useless extension candidates. Maximal degree in co-relation 119895. Up to 61967 conditions per place. [2025-02-08 08:37:46,413 INFO L140 encePairwiseOnDemand]: 59/67 looper letters, 47 selfloop transitions, 2 changer transitions 0/55 dead transitions. [2025-02-08 08:37:46,414 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 69 places, 55 transitions, 232 flow [2025-02-08 08:37:46,415 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 08:37:46,417 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 08:37:46,423 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 88 transitions. [2025-02-08 08:37:46,426 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.43781094527363185 [2025-02-08 08:37:46,427 INFO L175 Difference]: Start difference. First operand has 70 places, 62 transitions, 148 flow. Second operand 3 states and 88 transitions. [2025-02-08 08:37:46,427 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 69 places, 55 transitions, 232 flow [2025-02-08 08:37:46,460 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 61 places, 55 transitions, 216 flow, removed 0 selfloop flow, removed 8 redundant places. [2025-02-08 08:37:46,464 INFO L231 Difference]: Finished difference. Result has 61 places, 55 transitions, 122 flow [2025-02-08 08:37:46,465 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=67, PETRI_DIFFERENCE_MINUEND_FLOW=118, PETRI_DIFFERENCE_MINUEND_PLACES=59, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=55, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=53, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=122, PETRI_PLACES=61, PETRI_TRANSITIONS=55} [2025-02-08 08:37:46,468 INFO L279 CegarLoopForPetriNet]: 70 programPoint places, -9 predicate places. [2025-02-08 08:37:46,470 INFO L471 AbstractCegarLoop]: Abstraction has has 61 places, 55 transitions, 122 flow [2025-02-08 08:37:46,470 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 12.0) internal successors, (36), 3 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 08:37:46,470 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 08:37:46,470 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2025-02-08 08:37:46,470 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-02-08 08:37:46,471 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 21 more)] === [2025-02-08 08:37:46,472 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 08:37:46,472 INFO L85 PathProgramCache]: Analyzing trace with hash 771603, now seen corresponding path program 1 times [2025-02-08 08:37:46,472 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 08:37:46,472 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [127185473] [2025-02-08 08:37:46,472 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 08:37:46,472 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 08:37:46,481 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-02-08 08:37:46,509 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-02-08 08:37:46,512 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 08:37:46,512 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 08:37:46,737 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:37:46,737 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 08:37:46,737 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [127185473] [2025-02-08 08:37:46,738 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [127185473] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 08:37:46,738 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 08:37:46,738 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 08:37:46,738 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [607409281] [2025-02-08 08:37:46,738 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 08:37:46,739 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-08 08:37:46,740 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 08:37:46,740 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-08 08:37:46,741 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-08 08:37:46,745 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 67 [2025-02-08 08:37:46,745 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 61 places, 55 transitions, 122 flow. Second operand has 4 states, 4 states have (on average 11.75) internal successors, (47), 4 states have internal predecessors, (47), 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:37:46,746 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 08:37:46,746 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 67 [2025-02-08 08:37:46,746 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 08:37:49,127 INFO L124 PetriNetUnfolderBase]: 46386/62137 cut-off events. [2025-02-08 08:37:49,127 INFO L125 PetriNetUnfolderBase]: For 657/657 co-relation queries the response was YES. [2025-02-08 08:37:49,183 INFO L83 FinitePrefix]: Finished finitePrefix Result has 124936 conditions, 62137 events. 46386/62137 cut-off events. For 657/657 co-relation queries the response was YES. Maximal size of possible extension queue 2748. Compared 378196 event pairs, 46384 based on Foata normal form. 0/41956 useless extension candidates. Maximal degree in co-relation 124914. Up to 61972 conditions per place. [2025-02-08 08:37:49,353 INFO L140 encePairwiseOnDemand]: 62/67 looper letters, 49 selfloop transitions, 4 changer transitions 0/58 dead transitions. [2025-02-08 08:37:49,353 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 64 places, 58 transitions, 236 flow [2025-02-08 08:37:49,354 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-08 08:37:49,354 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-02-08 08:37:49,355 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 98 transitions. [2025-02-08 08:37:49,356 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.3656716417910448 [2025-02-08 08:37:49,356 INFO L175 Difference]: Start difference. First operand has 61 places, 55 transitions, 122 flow. Second operand 4 states and 98 transitions. [2025-02-08 08:37:49,356 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 64 places, 58 transitions, 236 flow [2025-02-08 08:37:49,356 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 62 places, 58 transitions, 230 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-08 08:37:49,357 INFO L231 Difference]: Finished difference. Result has 64 places, 58 transitions, 145 flow [2025-02-08 08:37:49,358 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=67, PETRI_DIFFERENCE_MINUEND_FLOW=118, PETRI_DIFFERENCE_MINUEND_PLACES=59, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=55, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=51, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=145, PETRI_PLACES=64, PETRI_TRANSITIONS=58} [2025-02-08 08:37:49,358 INFO L279 CegarLoopForPetriNet]: 70 programPoint places, -6 predicate places. [2025-02-08 08:37:49,358 INFO L471 AbstractCegarLoop]: Abstraction has has 64 places, 58 transitions, 145 flow [2025-02-08 08:37:49,358 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.75) internal successors, (47), 4 states have internal predecessors, (47), 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:37:49,358 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 08:37:49,358 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1] [2025-02-08 08:37:49,359 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-02-08 08:37:49,359 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 21 more)] === [2025-02-08 08:37:49,359 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 08:37:49,359 INFO L85 PathProgramCache]: Analyzing trace with hash 741534428, now seen corresponding path program 1 times [2025-02-08 08:37:49,359 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 08:37:49,359 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1720461995] [2025-02-08 08:37:49,359 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 08:37:49,359 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 08:37:49,367 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-02-08 08:37:49,383 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-02-08 08:37:49,384 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 08:37:49,384 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 08:37:49,613 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:37:49,613 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 08:37:49,613 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1720461995] [2025-02-08 08:37:49,614 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1720461995] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 08:37:49,614 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1947583921] [2025-02-08 08:37:49,614 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 08:37:49,614 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 08:37:49,614 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 08:37:49,616 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:37:49,618 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:37:49,665 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-02-08 08:37:49,675 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-02-08 08:37:49,676 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 08:37:49,676 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 08:37:49,677 INFO L256 TraceCheckSpWp]: Trace formula consists of 78 conjuncts, 16 conjuncts are in the unsatisfiable core [2025-02-08 08:37:49,681 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 08:37:49,725 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:37:49,889 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:37:49,890 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-08 08:37:49,973 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:37:49,973 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1947583921] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-08 08:37:49,973 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-08 08:37:49,973 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2025-02-08 08:37:49,974 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [697663703] [2025-02-08 08:37:49,974 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-08 08:37:49,974 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-02-08 08:37:49,974 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 08:37:49,974 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-02-08 08:37:49,974 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=76, Unknown=0, NotChecked=0, Total=110 [2025-02-08 08:37:49,994 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 67 [2025-02-08 08:37:49,995 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 64 places, 58 transitions, 145 flow. Second operand has 11 states, 11 states have (on average 12.363636363636363) internal successors, (136), 11 states have internal predecessors, (136), 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:37:49,995 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 08:37:49,995 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 67 [2025-02-08 08:37:49,995 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 08:37:52,942 INFO L124 PetriNetUnfolderBase]: 46387/62139 cut-off events. [2025-02-08 08:37:52,943 INFO L125 PetriNetUnfolderBase]: For 657/657 co-relation queries the response was YES. [2025-02-08 08:37:53,027 INFO L83 FinitePrefix]: Finished finitePrefix Result has 124952 conditions, 62139 events. 46387/62139 cut-off events. For 657/657 co-relation queries the response was YES. Maximal size of possible extension queue 2748. Compared 378142 event pairs, 46384 based on Foata normal form. 0/41957 useless extension candidates. Maximal degree in co-relation 124921. Up to 61969 conditions per place. [2025-02-08 08:37:53,186 INFO L140 encePairwiseOnDemand]: 62/67 looper letters, 45 selfloop transitions, 10 changer transitions 0/60 dead transitions. [2025-02-08 08:37:53,186 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 70 places, 60 transitions, 263 flow [2025-02-08 08:37:53,186 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-02-08 08:37:53,187 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2025-02-08 08:37:53,187 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 145 transitions. [2025-02-08 08:37:53,187 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.27052238805970147 [2025-02-08 08:37:53,188 INFO L175 Difference]: Start difference. First operand has 64 places, 58 transitions, 145 flow. Second operand 8 states and 145 transitions. [2025-02-08 08:37:53,188 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 70 places, 60 transitions, 263 flow [2025-02-08 08:37:53,188 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 69 places, 60 transitions, 260 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-02-08 08:37:53,189 INFO L231 Difference]: Finished difference. Result has 69 places, 60 transitions, 170 flow [2025-02-08 08:37:53,189 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=67, PETRI_DIFFERENCE_MINUEND_FLOW=138, PETRI_DIFFERENCE_MINUEND_PLACES=62, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=57, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=50, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=170, PETRI_PLACES=69, PETRI_TRANSITIONS=60} [2025-02-08 08:37:53,189 INFO L279 CegarLoopForPetriNet]: 70 programPoint places, -1 predicate places. [2025-02-08 08:37:53,189 INFO L471 AbstractCegarLoop]: Abstraction has has 69 places, 60 transitions, 170 flow [2025-02-08 08:37:53,190 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 12.363636363636363) internal successors, (136), 11 states have internal predecessors, (136), 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:37:53,190 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 08:37:53,190 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2025-02-08 08:37:53,197 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-02-08 08:37:53,394 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 08:37:53,394 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 21 more)] === [2025-02-08 08:37:53,395 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 08:37:53,395 INFO L85 PathProgramCache]: Analyzing trace with hash -272885270, now seen corresponding path program 1 times [2025-02-08 08:37:53,395 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 08:37:53,395 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1307853884] [2025-02-08 08:37:53,395 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 08:37:53,395 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 08:37:53,400 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-02-08 08:37:53,403 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-02-08 08:37:53,403 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 08:37:53,403 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 08:37:53,450 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:37:53,451 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 08:37:53,451 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1307853884] [2025-02-08 08:37:53,451 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1307853884] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 08:37:53,451 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 08:37:53,451 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 08:37:53,451 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1775228896] [2025-02-08 08:37:53,451 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 08:37:53,452 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-08 08:37:53,452 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 08:37:53,452 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-08 08:37:53,453 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-08 08:37:53,459 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 67 [2025-02-08 08:37:53,459 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 69 places, 60 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 12.5) internal successors, (50), 4 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 08:37:53,459 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 08:37:53,459 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 67 [2025-02-08 08:37:53,461 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 08:37:55,107 INFO L124 PetriNetUnfolderBase]: 28969/39052 cut-off events. [2025-02-08 08:37:55,108 INFO L125 PetriNetUnfolderBase]: For 448/448 co-relation queries the response was YES. [2025-02-08 08:37:55,162 INFO L83 FinitePrefix]: Finished finitePrefix Result has 78585 conditions, 39052 events. 28969/39052 cut-off events. For 448/448 co-relation queries the response was YES. Maximal size of possible extension queue 1716. Compared 228619 event pairs, 28966 based on Foata normal form. 0/29346 useless extension candidates. Maximal degree in co-relation 78547. Up to 38915 conditions per place. [2025-02-08 08:37:55,275 INFO L140 encePairwiseOnDemand]: 61/67 looper letters, 47 selfloop transitions, 4 changer transitions 0/56 dead transitions. [2025-02-08 08:37:55,275 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 68 places, 56 transitions, 264 flow [2025-02-08 08:37:55,275 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-08 08:37:55,276 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-02-08 08:37:55,276 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 93 transitions. [2025-02-08 08:37:55,276 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.34701492537313433 [2025-02-08 08:37:55,276 INFO L175 Difference]: Start difference. First operand has 69 places, 60 transitions, 170 flow. Second operand 4 states and 93 transitions. [2025-02-08 08:37:55,276 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 68 places, 56 transitions, 264 flow [2025-02-08 08:37:55,279 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 61 places, 56 transitions, 222 flow, removed 6 selfloop flow, removed 7 redundant places. [2025-02-08 08:37:55,279 INFO L231 Difference]: Finished difference. Result has 61 places, 56 transitions, 128 flow [2025-02-08 08:37:55,280 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=67, PETRI_DIFFERENCE_MINUEND_FLOW=120, PETRI_DIFFERENCE_MINUEND_PLACES=58, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=56, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=52, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=128, PETRI_PLACES=61, PETRI_TRANSITIONS=56} [2025-02-08 08:37:55,280 INFO L279 CegarLoopForPetriNet]: 70 programPoint places, -9 predicate places. [2025-02-08 08:37:55,280 INFO L471 AbstractCegarLoop]: Abstraction has has 61 places, 56 transitions, 128 flow [2025-02-08 08:37:55,280 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.5) internal successors, (50), 4 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 08:37:55,280 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 08:37:55,281 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2025-02-08 08:37:55,281 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-02-08 08:37:55,281 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 21 more)] === [2025-02-08 08:37:55,281 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 08:37:55,281 INFO L85 PathProgramCache]: Analyzing trace with hash -272885269, now seen corresponding path program 1 times [2025-02-08 08:37:55,281 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 08:37:55,281 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1173468946] [2025-02-08 08:37:55,282 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 08:37:55,282 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 08:37:55,287 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-02-08 08:37:55,292 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-02-08 08:37:55,292 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 08:37:55,292 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 08:37:55,384 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:37:55,385 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 08:37:55,385 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1173468946] [2025-02-08 08:37:55,385 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1173468946] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 08:37:55,385 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 08:37:55,385 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 08:37:55,385 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [347504387] [2025-02-08 08:37:55,386 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 08:37:55,386 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-08 08:37:55,386 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 08:37:55,386 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-08 08:37:55,387 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-08 08:37:55,389 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 67 [2025-02-08 08:37:55,389 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 61 places, 56 transitions, 128 flow. Second operand has 4 states, 4 states have (on average 13.5) internal successors, (54), 4 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:37:55,390 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 08:37:55,390 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 67 [2025-02-08 08:37:55,390 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 08:37:57,526 INFO L124 PetriNetUnfolderBase]: 40102/54302 cut-off events. [2025-02-08 08:37:57,526 INFO L125 PetriNetUnfolderBase]: For 728/728 co-relation queries the response was YES. [2025-02-08 08:37:57,596 INFO L83 FinitePrefix]: Finished finitePrefix Result has 109234 conditions, 54302 events. 40102/54302 cut-off events. For 728/728 co-relation queries the response was YES. Maximal size of possible extension queue 2122. Compared 331148 event pairs, 40100 based on Foata normal form. 1527/42851 useless extension candidates. Maximal degree in co-relation 78539. Up to 38920 conditions per place. [2025-02-08 08:37:57,746 INFO L140 encePairwiseOnDemand]: 59/67 looper letters, 81 selfloop transitions, 3 changer transitions 1/90 dead transitions. [2025-02-08 08:37:57,746 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 64 places, 90 transitions, 374 flow [2025-02-08 08:37:57,746 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-08 08:37:57,746 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-02-08 08:37:57,747 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 135 transitions. [2025-02-08 08:37:57,747 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.503731343283582 [2025-02-08 08:37:57,747 INFO L175 Difference]: Start difference. First operand has 61 places, 56 transitions, 128 flow. Second operand 4 states and 135 transitions. [2025-02-08 08:37:57,748 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 64 places, 90 transitions, 374 flow [2025-02-08 08:37:57,748 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 62 places, 90 transitions, 369 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-08 08:37:57,749 INFO L231 Difference]: Finished difference. Result has 63 places, 56 transitions, 140 flow [2025-02-08 08:37:57,749 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=67, PETRI_DIFFERENCE_MINUEND_FLOW=123, PETRI_DIFFERENCE_MINUEND_PLACES=59, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=56, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=53, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=140, PETRI_PLACES=63, PETRI_TRANSITIONS=56} [2025-02-08 08:37:57,750 INFO L279 CegarLoopForPetriNet]: 70 programPoint places, -7 predicate places. [2025-02-08 08:37:57,750 INFO L471 AbstractCegarLoop]: Abstraction has has 63 places, 56 transitions, 140 flow [2025-02-08 08:37:57,750 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.5) internal successors, (54), 4 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:37:57,750 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 08:37:57,750 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 08:37:57,750 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-02-08 08:37:57,750 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 21 more)] === [2025-02-08 08:37:57,750 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 08:37:57,751 INFO L85 PathProgramCache]: Analyzing trace with hash -1228819916, now seen corresponding path program 1 times [2025-02-08 08:37:57,751 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 08:37:57,751 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1326369755] [2025-02-08 08:37:57,751 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 08:37:57,751 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 08:37:57,755 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-02-08 08:37:57,759 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-02-08 08:37:57,760 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 08:37:57,760 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 08:37:57,821 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-02-08 08:37:57,822 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 08:37:57,822 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1326369755] [2025-02-08 08:37:57,822 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1326369755] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 08:37:57,822 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1769277548] [2025-02-08 08:37:57,822 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 08:37:57,822 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 08:37:57,822 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 08:37:57,824 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:37:57,826 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:37:57,867 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-02-08 08:37:57,877 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-02-08 08:37:57,877 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 08:37:57,877 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 08:37:57,878 INFO L256 TraceCheckSpWp]: Trace formula consists of 108 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-02-08 08:37:57,879 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 08:37:57,917 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-02-08 08:37:57,918 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-08 08:37:57,947 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-02-08 08:37:57,948 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1769277548] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-08 08:37:57,948 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-08 08:37:57,948 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 8 [2025-02-08 08:37:57,948 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [919045215] [2025-02-08 08:37:57,948 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-08 08:37:57,948 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-02-08 08:37:57,948 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 08:37:57,949 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-02-08 08:37:57,949 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2025-02-08 08:37:57,959 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 67 [2025-02-08 08:37:57,960 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 63 places, 56 transitions, 140 flow. Second operand has 10 states, 10 states have (on average 14.0) internal successors, (140), 10 states have internal predecessors, (140), 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:37:57,960 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 08:37:57,960 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 67 [2025-02-08 08:37:57,960 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 08:38:01,351 INFO L124 PetriNetUnfolderBase]: 51235/69554 cut-off events. [2025-02-08 08:38:01,351 INFO L125 PetriNetUnfolderBase]: For 4864/4864 co-relation queries the response was YES. [2025-02-08 08:38:01,435 INFO L83 FinitePrefix]: Finished finitePrefix Result has 144714 conditions, 69554 events. 51235/69554 cut-off events. For 4864/4864 co-relation queries the response was YES. Maximal size of possible extension queue 2557. Compared 438242 event pairs, 51234 based on Foata normal form. 1526/54568 useless extension candidates. Maximal degree in co-relation 114030. Up to 38915 conditions per place. [2025-02-08 08:38:01,601 INFO L140 encePairwiseOnDemand]: 58/67 looper letters, 78 selfloop transitions, 8 changer transitions 0/91 dead transitions. [2025-02-08 08:38:01,601 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 69 places, 91 transitions, 392 flow [2025-02-08 08:38:01,601 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-02-08 08:38:01,601 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-02-08 08:38:01,602 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 174 transitions. [2025-02-08 08:38:01,602 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.37100213219616207 [2025-02-08 08:38:01,602 INFO L175 Difference]: Start difference. First operand has 63 places, 56 transitions, 140 flow. Second operand 7 states and 174 transitions. [2025-02-08 08:38:01,602 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 69 places, 91 transitions, 392 flow [2025-02-08 08:38:01,604 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 67 places, 91 transitions, 387 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-08 08:38:01,605 INFO L231 Difference]: Finished difference. Result has 69 places, 57 transitions, 172 flow [2025-02-08 08:38:01,605 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=67, PETRI_DIFFERENCE_MINUEND_FLOW=135, PETRI_DIFFERENCE_MINUEND_PLACES=61, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=56, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=48, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=172, PETRI_PLACES=69, PETRI_TRANSITIONS=57} [2025-02-08 08:38:01,605 INFO L279 CegarLoopForPetriNet]: 70 programPoint places, -1 predicate places. [2025-02-08 08:38:01,605 INFO L471 AbstractCegarLoop]: Abstraction has has 69 places, 57 transitions, 172 flow [2025-02-08 08:38:01,606 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 14.0) internal successors, (140), 10 states have internal predecessors, (140), 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:38:01,606 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 08:38:01,606 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 08:38:01,612 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-02-08 08:38:01,806 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:38:01,807 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 21 more)] === [2025-02-08 08:38:01,807 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 08:38:01,807 INFO L85 PathProgramCache]: Analyzing trace with hash -759014339, now seen corresponding path program 2 times [2025-02-08 08:38:01,807 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 08:38:01,807 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1414173169] [2025-02-08 08:38:01,807 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-08 08:38:01,807 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 08:38:01,814 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 11 statements into 2 equivalence classes. [2025-02-08 08:38:01,826 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 7 of 11 statements. [2025-02-08 08:38:01,827 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-02-08 08:38:01,827 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 08:38:01,957 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-02-08 08:38:01,957 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 08:38:01,957 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1414173169] [2025-02-08 08:38:01,958 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1414173169] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 08:38:01,958 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 08:38:01,958 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 08:38:01,958 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [994118976] [2025-02-08 08:38:01,958 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 08:38:01,958 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-08 08:38:01,958 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 08:38:01,958 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-08 08:38:01,959 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-08 08:38:01,967 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 67 [2025-02-08 08:38:01,967 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 69 places, 57 transitions, 172 flow. Second operand has 4 states, 4 states have (on average 14.0) internal successors, (56), 4 states have internal predecessors, (56), 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:38:01,967 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 08:38:01,967 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 67 [2025-02-08 08:38:01,967 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 08:38:04,769 INFO L124 PetriNetUnfolderBase]: 44359/60356 cut-off events. [2025-02-08 08:38:04,769 INFO L125 PetriNetUnfolderBase]: For 6732/6732 co-relation queries the response was YES. [2025-02-08 08:38:04,842 INFO L83 FinitePrefix]: Finished finitePrefix Result has 125675 conditions, 60356 events. 44359/60356 cut-off events. For 6732/6732 co-relation queries the response was YES. Maximal size of possible extension queue 2197. Compared 375989 event pairs, 44358 based on Foata normal form. 0/47480 useless extension candidates. Maximal degree in co-relation 64296. Up to 60158 conditions per place. [2025-02-08 08:38:04,968 INFO L140 encePairwiseOnDemand]: 63/67 looper letters, 46 selfloop transitions, 4 changer transitions 0/55 dead transitions. [2025-02-08 08:38:04,969 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 70 places, 55 transitions, 260 flow [2025-02-08 08:38:04,969 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-08 08:38:04,969 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-02-08 08:38:04,969 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 93 transitions. [2025-02-08 08:38:04,970 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.34701492537313433 [2025-02-08 08:38:04,970 INFO L175 Difference]: Start difference. First operand has 69 places, 57 transitions, 172 flow. Second operand 4 states and 93 transitions. [2025-02-08 08:38:04,970 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 70 places, 55 transitions, 260 flow [2025-02-08 08:38:04,972 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 67 places, 55 transitions, 252 flow, removed 0 selfloop flow, removed 3 redundant places. [2025-02-08 08:38:04,973 INFO L231 Difference]: Finished difference. Result has 67 places, 55 transitions, 160 flow [2025-02-08 08:38:04,973 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=67, PETRI_DIFFERENCE_MINUEND_FLOW=152, PETRI_DIFFERENCE_MINUEND_PLACES=64, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=55, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=51, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=160, PETRI_PLACES=67, PETRI_TRANSITIONS=55} [2025-02-08 08:38:04,974 INFO L279 CegarLoopForPetriNet]: 70 programPoint places, -3 predicate places. [2025-02-08 08:38:04,974 INFO L471 AbstractCegarLoop]: Abstraction has has 67 places, 55 transitions, 160 flow [2025-02-08 08:38:04,974 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 14.0) internal successors, (56), 4 states have internal predecessors, (56), 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:38:04,974 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 08:38:04,974 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 08:38:04,974 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-02-08 08:38:04,974 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting thread3Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 21 more)] === [2025-02-08 08:38:04,975 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 08:38:04,975 INFO L85 PathProgramCache]: Analyzing trace with hash 884981305, now seen corresponding path program 1 times [2025-02-08 08:38:04,975 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 08:38:04,975 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1049675345] [2025-02-08 08:38:04,975 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 08:38:04,975 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 08:38:04,980 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-02-08 08:38:04,983 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-02-08 08:38:04,984 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 08:38:04,984 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 08:38:05,036 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:38:05,037 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 08:38:05,037 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1049675345] [2025-02-08 08:38:05,037 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1049675345] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 08:38:05,037 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 08:38:05,037 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 08:38:05,037 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [795133653] [2025-02-08 08:38:05,037 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 08:38:05,037 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-08 08:38:05,038 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 08:38:05,038 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-08 08:38:05,038 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-08 08:38:05,041 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 67 [2025-02-08 08:38:05,041 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 67 places, 55 transitions, 160 flow. Second operand has 4 states, 4 states have (on average 14.5) internal successors, (58), 4 states have internal predecessors, (58), 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:38:05,041 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 08:38:05,042 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 67 [2025-02-08 08:38:05,042 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 08:38:07,317 INFO L124 PetriNetUnfolderBase]: 37633/51303 cut-off events. [2025-02-08 08:38:07,318 INFO L125 PetriNetUnfolderBase]: For 6909/6909 co-relation queries the response was YES. [2025-02-08 08:38:07,407 INFO L83 FinitePrefix]: Finished finitePrefix Result has 107486 conditions, 51303 events. 37633/51303 cut-off events. For 6909/6909 co-relation queries the response was YES. Maximal size of possible extension queue 1820. Compared 313943 event pairs, 37632 based on Foata normal form. 611/41424 useless extension candidates. Maximal degree in co-relation 64306. Up to 44976 conditions per place. [2025-02-08 08:38:07,524 INFO L140 encePairwiseOnDemand]: 60/67 looper letters, 47 selfloop transitions, 2 changer transitions 29/83 dead transitions. [2025-02-08 08:38:07,524 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 70 places, 83 transitions, 380 flow [2025-02-08 08:38:07,525 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-08 08:38:07,525 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-02-08 08:38:07,525 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 126 transitions. [2025-02-08 08:38:07,525 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4701492537313433 [2025-02-08 08:38:07,525 INFO L175 Difference]: Start difference. First operand has 67 places, 55 transitions, 160 flow. Second operand 4 states and 126 transitions. [2025-02-08 08:38:07,526 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 70 places, 83 transitions, 380 flow [2025-02-08 08:38:07,528 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 68 places, 83 transitions, 375 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-08 08:38:07,529 INFO L231 Difference]: Finished difference. Result has 69 places, 54 transitions, 159 flow [2025-02-08 08:38:07,529 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=67, PETRI_DIFFERENCE_MINUEND_FLOW=155, PETRI_DIFFERENCE_MINUEND_PLACES=65, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=55, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=53, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=159, PETRI_PLACES=69, PETRI_TRANSITIONS=54} [2025-02-08 08:38:07,530 INFO L279 CegarLoopForPetriNet]: 70 programPoint places, -1 predicate places. [2025-02-08 08:38:07,530 INFO L471 AbstractCegarLoop]: Abstraction has has 69 places, 54 transitions, 159 flow [2025-02-08 08:38:07,530 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 14.5) internal successors, (58), 4 states have internal predecessors, (58), 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:38:07,530 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 08:38:07,530 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 08:38:07,530 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-02-08 08:38:07,530 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting thread3Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 21 more)] === [2025-02-08 08:38:07,530 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 08:38:07,530 INFO L85 PathProgramCache]: Analyzing trace with hash 1396574722, now seen corresponding path program 1 times [2025-02-08 08:38:07,531 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 08:38:07,531 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1231962821] [2025-02-08 08:38:07,531 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 08:38:07,531 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 08:38:07,537 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-02-08 08:38:07,543 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-02-08 08:38:07,543 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 08:38:07,543 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 08:38:07,617 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-02-08 08:38:07,617 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 08:38:07,617 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1231962821] [2025-02-08 08:38:07,618 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1231962821] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 08:38:07,618 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1837594414] [2025-02-08 08:38:07,618 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 08:38:07,618 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 08:38:07,618 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 08:38:07,620 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:38:07,621 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:38:07,666 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-02-08 08:38:07,680 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-02-08 08:38:07,680 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 08:38:07,680 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 08:38:07,682 INFO L256 TraceCheckSpWp]: Trace formula consists of 142 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-02-08 08:38:07,684 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 08:38:07,754 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-02-08 08:38:07,754 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-08 08:38:07,798 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-02-08 08:38:07,798 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1837594414] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-08 08:38:07,798 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-08 08:38:07,798 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 8 [2025-02-08 08:38:07,798 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1702284813] [2025-02-08 08:38:07,798 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-08 08:38:07,799 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-02-08 08:38:07,799 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 08:38:07,799 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-02-08 08:38:07,799 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2025-02-08 08:38:07,807 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 67 [2025-02-08 08:38:07,807 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 69 places, 54 transitions, 159 flow. Second operand has 10 states, 10 states have (on average 14.8) internal successors, (148), 10 states have internal predecessors, (148), 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:38:07,807 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 08:38:07,808 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 67 [2025-02-08 08:38:07,808 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand