./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 551b0097 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-?-551b009-m [2025-01-10 01:05:47,095 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-10 01:05:47,202 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2025-01-10 01:05:47,207 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-10 01:05:47,207 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-10 01:05:47,222 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-10 01:05:47,222 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-10 01:05:47,222 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-10 01:05:47,223 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-10 01:05:47,223 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-10 01:05:47,223 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-10 01:05:47,223 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-10 01:05:47,223 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-10 01:05:47,223 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-10 01:05:47,223 INFO L153 SettingsManager]: * Use SBE=true [2025-01-10 01:05:47,224 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-10 01:05:47,224 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-10 01:05:47,224 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-10 01:05:47,224 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-10 01:05:47,224 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-10 01:05:47,224 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2025-01-10 01:05:47,224 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2025-01-10 01:05:47,224 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2025-01-10 01:05:47,224 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-10 01:05:47,224 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-01-10 01:05:47,224 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-01-10 01:05:47,224 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-10 01:05:47,224 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-10 01:05:47,225 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-10 01:05:47,225 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-10 01:05:47,225 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-10 01:05:47,225 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-10 01:05:47,225 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-10 01:05:47,225 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-10 01:05:47,225 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-10 01:05:47,225 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-10 01:05:47,225 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-10 01:05:47,225 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-10 01:05:47,225 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-10 01:05:47,225 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-10 01:05:47,226 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-10 01:05:47,226 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-10 01:05:47,226 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-10 01:05:47,226 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-10 01:05:47,226 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-10 01:05:47,226 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-10 01:05:47,226 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-10 01:05:47,226 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-01-10 01:05:47,407 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-10 01:05:47,417 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-10 01:05:47,423 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-10 01:05:47,423 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-10 01:05:47,424 INFO L274 PluginConnector]: CDTParser initialized [2025-01-10 01:05:47,424 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-01-10 01:05:48,545 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/a36cb8e99/097b82d9af6d4bb7b8704b0f9c27f345/FLAG0b3cfa385 [2025-01-10 01:05:48,865 INFO L384 CDTParser]: Found 1 translation units. [2025-01-10 01:05:48,867 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/weaver/parallel-parallel-sum-1.wvr.c [2025-01-10 01:05:48,877 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/a36cb8e99/097b82d9af6d4bb7b8704b0f9c27f345/FLAG0b3cfa385 [2025-01-10 01:05:49,121 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/a36cb8e99/097b82d9af6d4bb7b8704b0f9c27f345 [2025-01-10 01:05:49,123 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-10 01:05:49,124 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-10 01:05:49,125 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-10 01:05:49,125 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-10 01:05:49,128 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-10 01:05:49,129 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.01 01:05:49" (1/1) ... [2025-01-10 01:05:49,130 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4db9aec2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:05:49, skipping insertion in model container [2025-01-10 01:05:49,130 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.01 01:05:49" (1/1) ... [2025-01-10 01:05:49,141 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-10 01:05:49,250 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-01-10 01:05:49,253 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-10 01:05:49,259 INFO L200 MainTranslator]: Completed pre-run [2025-01-10 01:05:49,276 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-10 01:05:49,286 INFO L204 MainTranslator]: Completed translation [2025-01-10 01:05:49,287 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:05:49 WrapperNode [2025-01-10 01:05:49,287 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-10 01:05:49,288 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-10 01:05:49,288 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-10 01:05:49,288 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-10 01:05:49,292 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:05:49" (1/1) ... [2025-01-10 01:05:49,297 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:05:49" (1/1) ... [2025-01-10 01:05:49,314 INFO L138 Inliner]: procedures = 26, calls = 49, calls flagged for inlining = 19, calls inlined = 25, statements flattened = 290 [2025-01-10 01:05:49,314 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-10 01:05:49,315 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-10 01:05:49,315 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-10 01:05:49,315 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-10 01:05:49,321 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:05:49" (1/1) ... [2025-01-10 01:05:49,321 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:05:49" (1/1) ... [2025-01-10 01:05:49,324 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:05:49" (1/1) ... [2025-01-10 01:05:49,333 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-01-10 01:05:49,334 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:05:49" (1/1) ... [2025-01-10 01:05:49,334 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:05:49" (1/1) ... [2025-01-10 01:05:49,339 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:05:49" (1/1) ... [2025-01-10 01:05:49,340 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:05:49" (1/1) ... [2025-01-10 01:05:49,342 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:05:49" (1/1) ... [2025-01-10 01:05:49,344 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:05:49" (1/1) ... [2025-01-10 01:05:49,344 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:05:49" (1/1) ... [2025-01-10 01:05:49,346 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-10 01:05:49,347 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-10 01:05:49,347 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-10 01:05:49,347 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-10 01:05:49,348 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:05:49" (1/1) ... [2025-01-10 01:05:49,351 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-10 01:05:49,361 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 01:05:49,372 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-01-10 01:05:49,383 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-01-10 01:05:49,399 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-10 01:05:49,399 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-01-10 01:05:49,399 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-01-10 01:05:49,399 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-01-10 01:05:49,399 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-01-10 01:05:49,399 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2025-01-10 01:05:49,399 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2025-01-10 01:05:49,399 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2025-01-10 01:05:49,400 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2025-01-10 01:05:49,400 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2025-01-10 01:05:49,400 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2025-01-10 01:05:49,400 INFO L130 BoogieDeclarations]: Found specification of procedure thread4 [2025-01-10 01:05:49,400 INFO L138 BoogieDeclarations]: Found implementation of procedure thread4 [2025-01-10 01:05:49,400 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-01-10 01:05:49,400 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-01-10 01:05:49,400 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2025-01-10 01:05:49,400 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2025-01-10 01:05:49,400 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-01-10 01:05:49,400 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-10 01:05:49,400 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-10 01:05:49,401 WARN L203 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-01-10 01:05:49,476 INFO L234 CfgBuilder]: Building ICFG [2025-01-10 01:05:49,478 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-10 01:05:49,833 INFO L279 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-01-10 01:05:49,834 INFO L283 CfgBuilder]: Performing block encoding [2025-01-10 01:05:50,156 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-10 01:05:50,156 INFO L312 CfgBuilder]: Removed 4 assume(true) statements. [2025-01-10 01:05:50,156 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 01:05:50 BoogieIcfgContainer [2025-01-10 01:05:50,156 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-10 01:05:50,161 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-10 01:05:50,161 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-10 01:05:50,164 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-10 01:05:50,164 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.01 01:05:49" (1/3) ... [2025-01-10 01:05:50,164 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6b9b22f8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.01 01:05:50, skipping insertion in model container [2025-01-10 01:05:50,165 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:05:49" (2/3) ... [2025-01-10 01:05:50,165 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6b9b22f8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.01 01:05:50, skipping insertion in model container [2025-01-10 01:05:50,165 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 01:05:50" (3/3) ... [2025-01-10 01:05:50,165 INFO L128 eAbstractionObserver]: Analyzing ICFG parallel-parallel-sum-1.wvr.c [2025-01-10 01:05:50,190 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-10 01:05:50,191 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG parallel-parallel-sum-1.wvr.c that has 5 procedures, 59 locations, 1 initial locations, 5 loop locations, and 12 error locations. [2025-01-10 01:05:50,191 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-01-10 01:05:50,270 INFO L143 ThreadInstanceAdder]: Constructed 4 joinOtherThreadTransitions. [2025-01-10 01:05:50,297 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 71 places, 67 transitions, 162 flow [2025-01-10 01:05:50,331 INFO L124 PetriNetUnfolderBase]: 9/63 cut-off events. [2025-01-10 01:05:50,333 INFO L125 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2025-01-10 01:05:50,336 INFO L83 FinitePrefix]: Finished finitePrefix Result has 80 conditions, 63 events. 9/63 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 136 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-01-10 01:05:50,338 INFO L82 GeneralOperation]: Start removeDead. Operand has 71 places, 67 transitions, 162 flow [2025-01-10 01:05:50,340 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 66 places, 62 transitions, 148 flow [2025-01-10 01:05:50,349 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-10 01:05:50,362 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;@759a22e5, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-10 01:05:50,362 INFO L334 AbstractCegarLoop]: Starting to check reachability of 24 error locations. [2025-01-10 01:05:50,368 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-01-10 01:05:50,368 INFO L124 PetriNetUnfolderBase]: 1/4 cut-off events. [2025-01-10 01:05:50,368 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-01-10 01:05:50,368 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 01:05:50,368 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2025-01-10 01:05:50,368 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 21 more)] === [2025-01-10 01:05:50,376 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:05:50,376 INFO L85 PathProgramCache]: Analyzing trace with hash 874201, now seen corresponding path program 1 times [2025-01-10 01:05:50,385 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:05:50,385 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [168504521] [2025-01-10 01:05:50,385 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:05:50,390 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:05:50,448 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-01-10 01:05:50,464 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-01-10 01:05:50,465 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:05:50,465 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:05:50,556 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 01:05:50,560 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:05:50,560 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [168504521] [2025-01-10 01:05:50,560 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [168504521] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 01:05:50,561 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 01:05:50,561 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-01-10 01:05:50,562 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [175927489] [2025-01-10 01:05:50,562 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 01:05:50,567 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-10 01:05:50,571 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:05:50,587 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-10 01:05:50,588 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-10 01:05:50,603 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 67 [2025-01-10 01:05:50,605 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 66 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-01-10 01:05:50,605 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 01:05:50,605 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 67 [2025-01-10 01:05:50,605 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 01:05:54,890 INFO L124 PetriNetUnfolderBase]: 52315/67901 cut-off events. [2025-01-10 01:05:54,890 INFO L125 PetriNetUnfolderBase]: For 2955/2955 co-relation queries the response was YES. [2025-01-10 01:05:55,063 INFO L83 FinitePrefix]: Finished finitePrefix Result has 138111 conditions, 67901 events. 52315/67901 cut-off events. For 2955/2955 co-relation queries the response was YES. Maximal size of possible extension queue 2648. Compared 379537 event pairs, 45712 based on Foata normal form. 1/48045 useless extension candidates. Maximal degree in co-relation 130913. Up to 67742 conditions per place. [2025-01-10 01:05:55,407 INFO L140 encePairwiseOnDemand]: 59/67 looper letters, 47 selfloop transitions, 2 changer transitions 0/55 dead transitions. [2025-01-10 01:05:55,408 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 65 places, 55 transitions, 232 flow [2025-01-10 01:05:55,409 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-10 01:05:55,411 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-10 01:05:55,417 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 88 transitions. [2025-01-10 01:05:55,418 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.43781094527363185 [2025-01-10 01:05:55,420 INFO L175 Difference]: Start difference. First operand has 66 places, 62 transitions, 148 flow. Second operand 3 states and 88 transitions. [2025-01-10 01:05:55,420 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 65 places, 55 transitions, 232 flow [2025-01-10 01:05:55,542 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 57 places, 55 transitions, 216 flow, removed 0 selfloop flow, removed 8 redundant places. [2025-01-10 01:05:55,545 INFO L231 Difference]: Finished difference. Result has 57 places, 55 transitions, 122 flow [2025-01-10 01:05:55,546 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=67, PETRI_DIFFERENCE_MINUEND_FLOW=118, PETRI_DIFFERENCE_MINUEND_PLACES=55, 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=57, PETRI_TRANSITIONS=55} [2025-01-10 01:05:55,549 INFO L279 CegarLoopForPetriNet]: 66 programPoint places, -9 predicate places. [2025-01-10 01:05:55,549 INFO L471 AbstractCegarLoop]: Abstraction has has 57 places, 55 transitions, 122 flow [2025-01-10 01:05:55,549 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-01-10 01:05:55,549 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 01:05:55,550 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2025-01-10 01:05:55,550 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-01-10 01:05:55,550 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 21 more)] === [2025-01-10 01:05:55,550 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:05:55,551 INFO L85 PathProgramCache]: Analyzing trace with hash 874202, now seen corresponding path program 1 times [2025-01-10 01:05:55,551 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:05:55,551 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1390150781] [2025-01-10 01:05:55,551 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:05:55,551 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:05:55,558 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-01-10 01:05:55,579 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-01-10 01:05:55,579 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:05:55,579 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:05:55,842 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 01:05:55,842 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:05:55,843 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1390150781] [2025-01-10 01:05:55,843 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1390150781] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 01:05:55,843 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 01:05:55,843 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-10 01:05:55,843 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [17192015] [2025-01-10 01:05:55,843 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 01:05:55,844 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-10 01:05:55,845 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:05:55,845 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-10 01:05:55,845 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-10 01:05:55,854 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 67 [2025-01-10 01:05:55,854 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 57 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-01-10 01:05:55,855 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 01:05:55,855 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 67 [2025-01-10 01:05:55,855 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 01:05:58,830 INFO L124 PetriNetUnfolderBase]: 52316/67904 cut-off events. [2025-01-10 01:05:58,830 INFO L125 PetriNetUnfolderBase]: For 693/693 co-relation queries the response was YES. [2025-01-10 01:05:58,906 INFO L83 FinitePrefix]: Finished finitePrefix Result has 136478 conditions, 67904 events. 52316/67904 cut-off events. For 693/693 co-relation queries the response was YES. Maximal size of possible extension queue 2648. Compared 379481 event pairs, 45712 based on Foata normal form. 0/48047 useless extension candidates. Maximal degree in co-relation 136456. Up to 67747 conditions per place. [2025-01-10 01:05:59,158 INFO L140 encePairwiseOnDemand]: 62/67 looper letters, 49 selfloop transitions, 4 changer transitions 0/58 dead transitions. [2025-01-10 01:05:59,158 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 60 places, 58 transitions, 236 flow [2025-01-10 01:05:59,159 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-10 01:05:59,159 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-01-10 01:05:59,161 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 98 transitions. [2025-01-10 01:05:59,161 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.3656716417910448 [2025-01-10 01:05:59,161 INFO L175 Difference]: Start difference. First operand has 57 places, 55 transitions, 122 flow. Second operand 4 states and 98 transitions. [2025-01-10 01:05:59,162 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 60 places, 58 transitions, 236 flow [2025-01-10 01:05:59,164 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 58 places, 58 transitions, 230 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-10 01:05:59,169 INFO L231 Difference]: Finished difference. Result has 60 places, 58 transitions, 145 flow [2025-01-10 01:05:59,169 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=67, PETRI_DIFFERENCE_MINUEND_FLOW=118, PETRI_DIFFERENCE_MINUEND_PLACES=55, 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=60, PETRI_TRANSITIONS=58} [2025-01-10 01:05:59,170 INFO L279 CegarLoopForPetriNet]: 66 programPoint places, -6 predicate places. [2025-01-10 01:05:59,173 INFO L471 AbstractCegarLoop]: Abstraction has has 60 places, 58 transitions, 145 flow [2025-01-10 01:05:59,173 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-01-10 01:05:59,173 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 01:05:59,173 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1] [2025-01-10 01:05:59,174 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-01-10 01:05:59,174 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 21 more)] === [2025-01-10 01:05:59,174 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:05:59,174 INFO L85 PathProgramCache]: Analyzing trace with hash 840136644, now seen corresponding path program 1 times [2025-01-10 01:05:59,175 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:05:59,175 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1099510464] [2025-01-10 01:05:59,175 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:05:59,175 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:05:59,182 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-01-10 01:05:59,191 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-01-10 01:05:59,191 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:05:59,191 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:05:59,437 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 01:05:59,437 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:05:59,437 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1099510464] [2025-01-10 01:05:59,437 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1099510464] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 01:05:59,437 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2120978652] [2025-01-10 01:05:59,437 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:05:59,437 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:05:59,438 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 01:05:59,440 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-01-10 01:05:59,442 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-01-10 01:05:59,493 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-01-10 01:05:59,503 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-01-10 01:05:59,503 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:05:59,503 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:05:59,505 INFO L256 TraceCheckSpWp]: Trace formula consists of 78 conjuncts, 12 conjuncts are in the unsatisfiable core [2025-01-10 01:05:59,507 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 01:05:59,581 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2025-01-10 01:05:59,692 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 01:05:59,693 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 01:05:59,785 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 01:05:59,786 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2120978652] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-10 01:05:59,786 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-10 01:05:59,786 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2025-01-10 01:05:59,786 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1896161333] [2025-01-10 01:05:59,786 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-10 01:05:59,786 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-01-10 01:05:59,787 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:05:59,787 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-01-10 01:05:59,787 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2025-01-10 01:05:59,808 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 67 [2025-01-10 01:05:59,808 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 60 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-01-10 01:05:59,809 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 01:05:59,809 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 67 [2025-01-10 01:05:59,809 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 01:06:02,675 INFO L124 PetriNetUnfolderBase]: 52316/67903 cut-off events. [2025-01-10 01:06:02,675 INFO L125 PetriNetUnfolderBase]: For 693/693 co-relation queries the response was YES. [2025-01-10 01:06:02,801 INFO L83 FinitePrefix]: Finished finitePrefix Result has 136485 conditions, 67903 events. 52316/67903 cut-off events. For 693/693 co-relation queries the response was YES. Maximal size of possible extension queue 2661. Compared 379725 event pairs, 45712 based on Foata normal form. 0/48046 useless extension candidates. Maximal degree in co-relation 136463. Up to 67743 conditions per place. [2025-01-10 01:06:03,201 INFO L140 encePairwiseOnDemand]: 62/67 looper letters, 45 selfloop transitions, 7 changer transitions 0/57 dead transitions. [2025-01-10 01:06:03,202 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 64 places, 57 transitions, 245 flow [2025-01-10 01:06:03,202 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-10 01:06:03,202 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-01-10 01:06:03,205 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 119 transitions. [2025-01-10 01:06:03,205 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.2960199004975124 [2025-01-10 01:06:03,206 INFO L175 Difference]: Start difference. First operand has 60 places, 58 transitions, 145 flow. Second operand 6 states and 119 transitions. [2025-01-10 01:06:03,207 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 64 places, 57 transitions, 245 flow [2025-01-10 01:06:03,207 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 63 places, 57 transitions, 242 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-01-10 01:06:03,208 INFO L231 Difference]: Finished difference. Result has 63 places, 57 transitions, 152 flow [2025-01-10 01:06:03,209 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=67, PETRI_DIFFERENCE_MINUEND_FLOW=138, PETRI_DIFFERENCE_MINUEND_PLACES=58, 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=6, PETRI_FLOW=152, PETRI_PLACES=63, PETRI_TRANSITIONS=57} [2025-01-10 01:06:03,210 INFO L279 CegarLoopForPetriNet]: 66 programPoint places, -3 predicate places. [2025-01-10 01:06:03,210 INFO L471 AbstractCegarLoop]: Abstraction has has 63 places, 57 transitions, 152 flow [2025-01-10 01:06:03,210 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-01-10 01:06:03,211 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 01:06:03,211 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:06:03,217 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-01-10 01:06:03,411 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-01-10 01:06:03,413 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 21 more)] === [2025-01-10 01:06:03,414 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:06:03,414 INFO L85 PathProgramCache]: Analyzing trace with hash 32770395, now seen corresponding path program 1 times [2025-01-10 01:06:03,414 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:06:03,414 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1292245851] [2025-01-10 01:06:03,414 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:06:03,414 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:06:03,421 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-01-10 01:06:03,426 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-01-10 01:06:03,427 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:06:03,427 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:06:03,492 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 01:06:03,492 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:06:03,492 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1292245851] [2025-01-10 01:06:03,492 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1292245851] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 01:06:03,492 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 01:06:03,493 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-10 01:06:03,493 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1156491126] [2025-01-10 01:06:03,493 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 01:06:03,493 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-10 01:06:03,493 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:06:03,493 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-10 01:06:03,494 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-10 01:06:03,498 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 67 [2025-01-10 01:06:03,498 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 63 places, 57 transitions, 152 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-01-10 01:06:03,498 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 01:06:03,498 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 67 [2025-01-10 01:06:03,498 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 01:06:05,681 INFO L124 PetriNetUnfolderBase]: 33149/43101 cut-off events. [2025-01-10 01:06:05,682 INFO L125 PetriNetUnfolderBase]: For 480/480 co-relation queries the response was YES. [2025-01-10 01:06:05,776 INFO L83 FinitePrefix]: Finished finitePrefix Result has 86683 conditions, 43101 events. 33149/43101 cut-off events. For 480/480 co-relation queries the response was YES. Maximal size of possible extension queue 1674. Compared 229699 event pairs, 28438 based on Foata normal form. 0/33628 useless extension candidates. Maximal degree in co-relation 86657. Up to 42972 conditions per place. [2025-01-10 01:06:05,903 INFO L140 encePairwiseOnDemand]: 61/67 looper letters, 45 selfloop transitions, 3 changer transitions 0/53 dead transitions. [2025-01-10 01:06:05,903 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 62 places, 53 transitions, 240 flow [2025-01-10 01:06:05,904 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-10 01:06:05,904 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-01-10 01:06:05,905 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 93 transitions. [2025-01-10 01:06:05,906 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.34701492537313433 [2025-01-10 01:06:05,906 INFO L175 Difference]: Start difference. First operand has 63 places, 57 transitions, 152 flow. Second operand 4 states and 93 transitions. [2025-01-10 01:06:05,907 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 62 places, 53 transitions, 240 flow [2025-01-10 01:06:05,909 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 55 places, 53 transitions, 210 flow, removed 3 selfloop flow, removed 7 redundant places. [2025-01-10 01:06:05,910 INFO L231 Difference]: Finished difference. Result has 55 places, 53 transitions, 120 flow [2025-01-10 01:06:05,910 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=67, PETRI_DIFFERENCE_MINUEND_FLOW=114, PETRI_DIFFERENCE_MINUEND_PLACES=52, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=53, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=50, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=120, PETRI_PLACES=55, PETRI_TRANSITIONS=53} [2025-01-10 01:06:05,910 INFO L279 CegarLoopForPetriNet]: 66 programPoint places, -11 predicate places. [2025-01-10 01:06:05,910 INFO L471 AbstractCegarLoop]: Abstraction has has 55 places, 53 transitions, 120 flow [2025-01-10 01:06:05,910 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-01-10 01:06:05,910 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 01:06:05,910 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:06:05,911 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-01-10 01:06:05,911 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 21 more)] === [2025-01-10 01:06:05,911 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:06:05,911 INFO L85 PathProgramCache]: Analyzing trace with hash 32770396, now seen corresponding path program 1 times [2025-01-10 01:06:05,911 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:06:05,911 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1399915263] [2025-01-10 01:06:05,911 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:06:05,911 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:06:05,921 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-01-10 01:06:05,926 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-01-10 01:06:05,927 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:06:05,927 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:06:05,994 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 01:06:05,994 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:06:05,994 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1399915263] [2025-01-10 01:06:05,994 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1399915263] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 01:06:05,994 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 01:06:05,994 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-10 01:06:05,994 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [600051167] [2025-01-10 01:06:05,994 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 01:06:05,995 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-10 01:06:05,995 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:06:05,995 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-10 01:06:05,995 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-10 01:06:05,998 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 67 [2025-01-10 01:06:05,998 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 55 places, 53 transitions, 120 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-01-10 01:06:05,998 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 01:06:05,998 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 67 [2025-01-10 01:06:05,999 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 01:06:08,405 INFO L124 PetriNetUnfolderBase]: 44979/58988 cut-off events. [2025-01-10 01:06:08,405 INFO L125 PetriNetUnfolderBase]: For 748/748 co-relation queries the response was YES. [2025-01-10 01:06:08,479 INFO L83 FinitePrefix]: Finished finitePrefix Result has 118607 conditions, 58988 events. 44979/58988 cut-off events. For 748/748 co-relation queries the response was YES. Maximal size of possible extension queue 2089. Compared 331865 event pairs, 39322 based on Foata normal form. 1505/47737 useless extension candidates. Maximal degree in co-relation 86609. Up to 42952 conditions per place. [2025-01-10 01:06:08,683 INFO L140 encePairwiseOnDemand]: 59/67 looper letters, 78 selfloop transitions, 3 changer transitions 1/87 dead transitions. [2025-01-10 01:06:08,684 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 58 places, 87 transitions, 360 flow [2025-01-10 01:06:08,684 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-10 01:06:08,684 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-01-10 01:06:08,685 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 135 transitions. [2025-01-10 01:06:08,685 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.503731343283582 [2025-01-10 01:06:08,685 INFO L175 Difference]: Start difference. First operand has 55 places, 53 transitions, 120 flow. Second operand 4 states and 135 transitions. [2025-01-10 01:06:08,686 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 58 places, 87 transitions, 360 flow [2025-01-10 01:06:08,686 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 56 places, 87 transitions, 356 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-10 01:06:08,689 INFO L231 Difference]: Finished difference. Result has 57 places, 53 transitions, 133 flow [2025-01-10 01:06:08,689 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=67, PETRI_DIFFERENCE_MINUEND_FLOW=116, PETRI_DIFFERENCE_MINUEND_PLACES=53, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=53, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=50, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=133, PETRI_PLACES=57, PETRI_TRANSITIONS=53} [2025-01-10 01:06:08,690 INFO L279 CegarLoopForPetriNet]: 66 programPoint places, -9 predicate places. [2025-01-10 01:06:08,691 INFO L471 AbstractCegarLoop]: Abstraction has has 57 places, 53 transitions, 133 flow [2025-01-10 01:06:08,691 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-01-10 01:06:08,691 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 01:06:08,691 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:06:08,691 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-01-10 01:06:08,691 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 21 more)] === [2025-01-10 01:06:08,692 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:06:08,692 INFO L85 PathProgramCache]: Analyzing trace with hash -1865702074, now seen corresponding path program 1 times [2025-01-10 01:06:08,692 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:06:08,692 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1699071362] [2025-01-10 01:06:08,692 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:06:08,692 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:06:08,698 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-01-10 01:06:08,705 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-01-10 01:06:08,705 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:06:08,705 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:06:08,777 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-01-10 01:06:08,777 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:06:08,777 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1699071362] [2025-01-10 01:06:08,777 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1699071362] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 01:06:08,778 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [201652749] [2025-01-10 01:06:08,778 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:06:08,778 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:06:08,778 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 01:06:08,782 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-01-10 01:06:08,784 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-01-10 01:06:08,831 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-01-10 01:06:08,842 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-01-10 01:06:08,843 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:06:08,843 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:06:08,845 INFO L256 TraceCheckSpWp]: Trace formula consists of 108 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-01-10 01:06:08,846 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 01:06:09,036 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-01-10 01:06:09,036 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 01:06:09,067 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-01-10 01:06:09,067 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [201652749] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-10 01:06:09,067 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-10 01:06:09,067 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 8 [2025-01-10 01:06:09,068 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1487168638] [2025-01-10 01:06:09,068 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-10 01:06:09,068 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-01-10 01:06:09,068 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:06:09,068 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-01-10 01:06:09,068 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2025-01-10 01:06:09,076 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 67 [2025-01-10 01:06:09,077 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 57 places, 53 transitions, 133 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-01-10 01:06:09,077 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 01:06:09,077 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 67 [2025-01-10 01:06:09,077 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 01:06:12,052 INFO L124 PetriNetUnfolderBase]: 56827/74897 cut-off events. [2025-01-10 01:06:12,052 INFO L125 PetriNetUnfolderBase]: For 4848/4848 co-relation queries the response was YES. [2025-01-10 01:06:12,170 INFO L83 FinitePrefix]: Finished finitePrefix Result has 155340 conditions, 74897 events. 56827/74897 cut-off events. For 4848/4848 co-relation queries the response was YES. Maximal size of possible extension queue 2365. Compared 436241 event pairs, 50223 based on Foata normal form. 1504/60205 useless extension candidates. Maximal degree in co-relation 123346. Up to 42950 conditions per place. [2025-01-10 01:06:12,558 INFO L140 encePairwiseOnDemand]: 58/67 looper letters, 78 selfloop transitions, 8 changer transitions 0/91 dead transitions. [2025-01-10 01:06:12,558 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 63 places, 91 transitions, 392 flow [2025-01-10 01:06:12,558 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-01-10 01:06:12,558 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-01-10 01:06:12,559 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 174 transitions. [2025-01-10 01:06:12,559 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.37100213219616207 [2025-01-10 01:06:12,559 INFO L175 Difference]: Start difference. First operand has 57 places, 53 transitions, 133 flow. Second operand 7 states and 174 transitions. [2025-01-10 01:06:12,559 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 63 places, 91 transitions, 392 flow [2025-01-10 01:06:12,561 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 61 places, 91 transitions, 387 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-10 01:06:12,562 INFO L231 Difference]: Finished difference. Result has 64 places, 57 transitions, 179 flow [2025-01-10 01:06:12,562 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=67, PETRI_DIFFERENCE_MINUEND_FLOW=128, PETRI_DIFFERENCE_MINUEND_PLACES=55, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=53, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=46, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=179, PETRI_PLACES=64, PETRI_TRANSITIONS=57} [2025-01-10 01:06:12,563 INFO L279 CegarLoopForPetriNet]: 66 programPoint places, -2 predicate places. [2025-01-10 01:06:12,563 INFO L471 AbstractCegarLoop]: Abstraction has has 64 places, 57 transitions, 179 flow [2025-01-10 01:06:12,563 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-01-10 01:06:12,563 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 01:06:12,563 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:06:12,569 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-01-10 01:06:12,764 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-01-10 01:06:12,764 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting thread3Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 21 more)] === [2025-01-10 01:06:12,764 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:06:12,764 INFO L85 PathProgramCache]: Analyzing trace with hash -1466017893, now seen corresponding path program 1 times [2025-01-10 01:06:12,764 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:06:12,764 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1994231956] [2025-01-10 01:06:12,764 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:06:12,765 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:06:12,770 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-01-10 01:06:12,778 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-01-10 01:06:12,778 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:06:12,779 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:06:12,834 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 01:06:12,834 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:06:12,834 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1994231956] [2025-01-10 01:06:12,834 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1994231956] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 01:06:12,834 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 01:06:12,834 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-10 01:06:12,834 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1776126014] [2025-01-10 01:06:12,834 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 01:06:12,835 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-10 01:06:12,835 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:06:12,835 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-10 01:06:12,835 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-10 01:06:12,837 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 67 [2025-01-10 01:06:12,838 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 64 places, 57 transitions, 179 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-01-10 01:06:12,838 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 01:06:12,838 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 67 [2025-01-10 01:06:12,838 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 01:06:15,893 INFO L124 PetriNetUnfolderBase]: 49569/65360 cut-off events. [2025-01-10 01:06:15,893 INFO L125 PetriNetUnfolderBase]: For 7641/7641 co-relation queries the response was YES. [2025-01-10 01:06:16,016 INFO L83 FinitePrefix]: Finished finitePrefix Result has 141015 conditions, 65360 events. 49569/65360 cut-off events. For 7641/7641 co-relation queries the response was YES. Maximal size of possible extension queue 2125. Compared 374950 event pairs, 43898 based on Foata normal form. 611/51923 useless extension candidates. Maximal degree in co-relation 96536. Up to 59025 conditions per place. [2025-01-10 01:06:16,167 INFO L140 encePairwiseOnDemand]: 60/67 looper letters, 49 selfloop transitions, 2 changer transitions 29/85 dead transitions. [2025-01-10 01:06:16,168 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 67 places, 85 transitions, 403 flow [2025-01-10 01:06:16,168 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-10 01:06:16,168 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-01-10 01:06:16,169 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 128 transitions. [2025-01-10 01:06:16,169 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.47761194029850745 [2025-01-10 01:06:16,169 INFO L175 Difference]: Start difference. First operand has 64 places, 57 transitions, 179 flow. Second operand 4 states and 128 transitions. [2025-01-10 01:06:16,169 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 67 places, 85 transitions, 403 flow [2025-01-10 01:06:16,177 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 66 places, 85 transitions, 400 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-01-10 01:06:16,180 INFO L231 Difference]: Finished difference. Result has 67 places, 56 transitions, 181 flow [2025-01-10 01:06:16,180 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=67, PETRI_DIFFERENCE_MINUEND_FLOW=176, PETRI_DIFFERENCE_MINUEND_PLACES=63, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=57, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=55, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=181, PETRI_PLACES=67, PETRI_TRANSITIONS=56} [2025-01-10 01:06:16,180 INFO L279 CegarLoopForPetriNet]: 66 programPoint places, 1 predicate places. [2025-01-10 01:06:16,180 INFO L471 AbstractCegarLoop]: Abstraction has has 67 places, 56 transitions, 181 flow [2025-01-10 01:06:16,180 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-01-10 01:06:16,180 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 01:06:16,180 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:06:16,180 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-01-10 01:06:16,181 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 21 more)] === [2025-01-10 01:06:16,181 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:06:16,181 INFO L85 PathProgramCache]: Analyzing trace with hash -936644944, now seen corresponding path program 2 times [2025-01-10 01:06:16,181 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:06:16,181 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1254471581] [2025-01-10 01:06:16,181 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-10 01:06:16,181 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:06:16,189 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 11 statements into 2 equivalence classes. [2025-01-10 01:06:16,199 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 7 of 11 statements. [2025-01-10 01:06:16,199 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-01-10 01:06:16,199 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:06:16,322 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-01-10 01:06:16,323 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:06:16,323 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1254471581] [2025-01-10 01:06:16,323 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1254471581] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 01:06:16,323 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 01:06:16,323 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-10 01:06:16,323 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1428033401] [2025-01-10 01:06:16,323 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 01:06:16,323 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-10 01:06:16,323 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:06:16,324 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-10 01:06:16,324 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-10 01:06:16,330 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 67 [2025-01-10 01:06:16,330 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 67 places, 56 transitions, 181 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-01-10 01:06:16,330 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 01:06:16,330 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 67 [2025-01-10 01:06:16,330 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 01:06:18,558 INFO L124 PetriNetUnfolderBase]: 37583/49340 cut-off events. [2025-01-10 01:06:18,558 INFO L125 PetriNetUnfolderBase]: For 7959/7959 co-relation queries the response was YES. [2025-01-10 01:06:18,630 INFO L83 FinitePrefix]: Finished finitePrefix Result has 108924 conditions, 49340 events. 37583/49340 cut-off events. For 7959/7959 co-relation queries the response was YES. Maximal size of possible extension queue 1766. Compared 273621 event pairs, 32730 based on Foata normal form. 0/40175 useless extension candidates. Maximal degree in co-relation 108906. Up to 49209 conditions per place. [2025-01-10 01:06:18,780 INFO L140 encePairwiseOnDemand]: 63/67 looper letters, 46 selfloop transitions, 3 changer transitions 0/54 dead transitions. [2025-01-10 01:06:18,780 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 66 places, 54 transitions, 267 flow [2025-01-10 01:06:18,780 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-10 01:06:18,780 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-01-10 01:06:18,781 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 93 transitions. [2025-01-10 01:06:18,781 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.34701492537313433 [2025-01-10 01:06:18,781 INFO L175 Difference]: Start difference. First operand has 67 places, 56 transitions, 181 flow. Second operand 4 states and 93 transitions. [2025-01-10 01:06:18,781 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 66 places, 54 transitions, 267 flow [2025-01-10 01:06:18,795 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 64 places, 54 transitions, 259 flow, removed 2 selfloop flow, removed 2 redundant places. [2025-01-10 01:06:18,797 INFO L231 Difference]: Finished difference. Result has 64 places, 54 transitions, 167 flow [2025-01-10 01:06:18,798 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=67, PETRI_DIFFERENCE_MINUEND_FLOW=161, PETRI_DIFFERENCE_MINUEND_PLACES=61, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=54, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=51, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=167, PETRI_PLACES=64, PETRI_TRANSITIONS=54} [2025-01-10 01:06:18,798 INFO L279 CegarLoopForPetriNet]: 66 programPoint places, -2 predicate places. [2025-01-10 01:06:18,798 INFO L471 AbstractCegarLoop]: Abstraction has has 64 places, 54 transitions, 167 flow [2025-01-10 01:06:18,799 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-01-10 01:06:18,799 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 01:06:18,799 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:06:18,799 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-01-10 01:06:18,799 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting thread3Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 21 more)] === [2025-01-10 01:06:18,799 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:06:18,799 INFO L85 PathProgramCache]: Analyzing trace with hash -1995313531, now seen corresponding path program 1 times [2025-01-10 01:06:18,799 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:06:18,800 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [793745823] [2025-01-10 01:06:18,800 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:06:18,800 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:06:18,805 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-01-10 01:06:18,810 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-01-10 01:06:18,811 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:06:18,812 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:06:18,883 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-01-10 01:06:18,884 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:06:18,884 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [793745823] [2025-01-10 01:06:18,884 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [793745823] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 01:06:18,884 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1977235876] [2025-01-10 01:06:18,884 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:06:18,884 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:06:18,884 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 01:06:18,886 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-01-10 01:06:18,892 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-01-10 01:06:18,937 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-01-10 01:06:18,952 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-01-10 01:06:18,952 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:06:18,952 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:06:18,952 INFO L256 TraceCheckSpWp]: Trace formula consists of 142 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-01-10 01:06:18,953 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 01:06:19,013 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-01-10 01:06:19,014 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 01:06:19,056 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-01-10 01:06:19,056 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1977235876] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-10 01:06:19,056 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-10 01:06:19,056 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 8 [2025-01-10 01:06:19,056 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [74250658] [2025-01-10 01:06:19,056 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-10 01:06:19,056 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-01-10 01:06:19,057 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:06:19,057 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-01-10 01:06:19,057 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2025-01-10 01:06:19,067 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 67 [2025-01-10 01:06:19,067 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 64 places, 54 transitions, 167 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-01-10 01:06:19,067 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 01:06:19,067 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 67 [2025-01-10 01:06:19,067 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand