./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/weaver/popl20-three-array-max.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/popl20-three-array-max.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 670814d0a16da58b0f26835e20c05a244e2f373856f13b9d4ff2a931783edf81 --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-10 01:13:09,690 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-10 01:13:09,727 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:13:09,730 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-10 01:13:09,730 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-10 01:13:09,744 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-10 01:13:09,744 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-10 01:13:09,744 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-10 01:13:09,744 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-10 01:13:09,744 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-10 01:13:09,745 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-10 01:13:09,745 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-10 01:13:09,745 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-10 01:13:09,745 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-10 01:13:09,745 INFO L153 SettingsManager]: * Use SBE=true [2025-01-10 01:13:09,745 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-10 01:13:09,745 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-10 01:13:09,745 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-10 01:13:09,745 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-10 01:13:09,745 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-10 01:13:09,745 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2025-01-10 01:13:09,745 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2025-01-10 01:13:09,745 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2025-01-10 01:13:09,745 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-10 01:13:09,745 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-01-10 01:13:09,745 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-01-10 01:13:09,745 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-10 01:13:09,746 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-10 01:13:09,746 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-10 01:13:09,747 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-10 01:13:09,747 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-10 01:13:09,748 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-10 01:13:09,748 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-10 01:13:09,748 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-10 01:13:09,748 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-10 01:13:09,748 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-10 01:13:09,748 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-10 01:13:09,748 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-10 01:13:09,748 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-10 01:13:09,748 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-10 01:13:09,748 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-10 01:13:09,748 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-10 01:13:09,748 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-10 01:13:09,748 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-10 01:13:09,748 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-10 01:13:09,748 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-10 01:13:09,748 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-10 01:13:09,748 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 -> 670814d0a16da58b0f26835e20c05a244e2f373856f13b9d4ff2a931783edf81 [2025-01-10 01:13:10,051 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-10 01:13:10,060 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-10 01:13:10,061 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-10 01:13:10,063 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-10 01:13:10,063 INFO L274 PluginConnector]: CDTParser initialized [2025-01-10 01:13:10,064 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/weaver/popl20-three-array-max.wvr.c [2025-01-10 01:13:11,866 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/eb3ff9c51/b4789fbdc67f4641b8f173c68dfe1554/FLAG957417989 [2025-01-10 01:13:12,101 INFO L384 CDTParser]: Found 1 translation units. [2025-01-10 01:13:12,101 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/weaver/popl20-three-array-max.wvr.c [2025-01-10 01:13:12,110 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/eb3ff9c51/b4789fbdc67f4641b8f173c68dfe1554/FLAG957417989 [2025-01-10 01:13:12,447 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/eb3ff9c51/b4789fbdc67f4641b8f173c68dfe1554 [2025-01-10 01:13:12,449 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-10 01:13:12,451 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-10 01:13:12,454 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-10 01:13:12,454 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-10 01:13:12,457 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-10 01:13:12,458 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.01 01:13:12" (1/1) ... [2025-01-10 01:13:12,459 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@10a8c99e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:13:12, skipping insertion in model container [2025-01-10 01:13:12,460 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.01 01:13:12" (1/1) ... [2025-01-10 01:13:12,481 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-10 01:13:12,617 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:13:12,622 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-10 01:13:12,632 INFO L200 MainTranslator]: Completed pre-run [2025-01-10 01:13:12,659 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-10 01:13:12,670 INFO L204 MainTranslator]: Completed translation [2025-01-10 01:13:12,671 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:13:12 WrapperNode [2025-01-10 01:13:12,672 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-10 01:13:12,672 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-10 01:13:12,672 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-10 01:13:12,673 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-10 01:13:12,677 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:13:12" (1/1) ... [2025-01-10 01:13:12,684 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:13:12" (1/1) ... [2025-01-10 01:13:12,706 INFO L138 Inliner]: procedures = 25, calls = 43, calls flagged for inlining = 15, calls inlined = 23, statements flattened = 212 [2025-01-10 01:13:12,706 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-10 01:13:12,707 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-10 01:13:12,707 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-10 01:13:12,708 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-10 01:13:12,715 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:13:12" (1/1) ... [2025-01-10 01:13:12,716 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:13:12" (1/1) ... [2025-01-10 01:13:12,719 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:13:12" (1/1) ... [2025-01-10 01:13:12,739 INFO L175 MemorySlicer]: Split 18 memory accesses to 2 slices as follows [2, 16]. 89 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0]. The 4 writes are split as follows [0, 4]. [2025-01-10 01:13:12,743 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:13:12" (1/1) ... [2025-01-10 01:13:12,744 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:13:12" (1/1) ... [2025-01-10 01:13:12,752 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:13:12" (1/1) ... [2025-01-10 01:13:12,757 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:13:12" (1/1) ... [2025-01-10 01:13:12,760 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:13:12" (1/1) ... [2025-01-10 01:13:12,761 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:13:12" (1/1) ... [2025-01-10 01:13:12,763 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:13:12" (1/1) ... [2025-01-10 01:13:12,765 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-10 01:13:12,770 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-10 01:13:12,770 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-10 01:13:12,770 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-10 01:13:12,771 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:13:12" (1/1) ... [2025-01-10 01:13:12,775 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-10 01:13:12,783 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 01:13:12,798 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:13:12,801 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:13:12,818 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-10 01:13:12,819 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2025-01-10 01:13:12,819 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2025-01-10 01:13:12,819 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2025-01-10 01:13:12,819 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2025-01-10 01:13:12,820 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2025-01-10 01:13:12,820 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2025-01-10 01:13:12,820 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-01-10 01:13:12,820 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-01-10 01:13:12,820 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-01-10 01:13:12,820 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-01-10 01:13:12,820 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2025-01-10 01:13:12,820 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2025-01-10 01:13:12,820 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-01-10 01:13:12,820 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-10 01:13:12,821 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-10 01:13:12,821 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-01-10 01:13:12,821 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-01-10 01:13:12,822 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:13:12,901 INFO L234 CfgBuilder]: Building ICFG [2025-01-10 01:13:12,903 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-10 01:13:13,240 INFO L279 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-01-10 01:13:13,242 INFO L283 CfgBuilder]: Performing block encoding [2025-01-10 01:13:13,584 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-10 01:13:13,584 INFO L312 CfgBuilder]: Removed 0 assume(true) statements. [2025-01-10 01:13:13,586 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 01:13:13 BoogieIcfgContainer [2025-01-10 01:13:13,586 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-10 01:13:13,589 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-10 01:13:13,590 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-10 01:13:13,597 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-10 01:13:13,597 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.01 01:13:12" (1/3) ... [2025-01-10 01:13:13,597 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@cbb66e7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.01 01:13:13, skipping insertion in model container [2025-01-10 01:13:13,597 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:13:12" (2/3) ... [2025-01-10 01:13:13,597 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@cbb66e7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.01 01:13:13, skipping insertion in model container [2025-01-10 01:13:13,597 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 01:13:13" (3/3) ... [2025-01-10 01:13:13,598 INFO L128 eAbstractionObserver]: Analyzing ICFG popl20-three-array-max.wvr.c [2025-01-10 01:13:13,613 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-10 01:13:13,614 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG popl20-three-array-max.wvr.c that has 4 procedures, 81 locations, 1 initial locations, 6 loop locations, and 34 error locations. [2025-01-10 01:13:13,614 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-01-10 01:13:13,668 INFO L143 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2025-01-10 01:13:13,700 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 90 places, 89 transitions, 199 flow [2025-01-10 01:13:13,742 INFO L124 PetriNetUnfolderBase]: 9/86 cut-off events. [2025-01-10 01:13:13,744 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2025-01-10 01:13:13,746 INFO L83 FinitePrefix]: Finished finitePrefix Result has 99 conditions, 86 events. 9/86 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 253 event pairs, 0 based on Foata normal form. 0/43 useless extension candidates. Maximal degree in co-relation 67. Up to 2 conditions per place. [2025-01-10 01:13:13,746 INFO L82 GeneralOperation]: Start removeDead. Operand has 90 places, 89 transitions, 199 flow [2025-01-10 01:13:13,748 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 86 places, 85 transitions, 188 flow [2025-01-10 01:13:13,753 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-10 01:13:13,762 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;@1588aede, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-10 01:13:13,762 INFO L334 AbstractCegarLoop]: Starting to check reachability of 55 error locations. [2025-01-10 01:13:13,768 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-01-10 01:13:13,768 INFO L124 PetriNetUnfolderBase]: 1/4 cut-off events. [2025-01-10 01:13:13,768 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-01-10 01:13:13,768 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 01:13:13,768 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2025-01-10 01:13:13,769 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 52 more)] === [2025-01-10 01:13:13,774 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:13:13,774 INFO L85 PathProgramCache]: Analyzing trace with hash 867145, now seen corresponding path program 1 times [2025-01-10 01:13:13,783 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:13:13,783 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [142817726] [2025-01-10 01:13:13,783 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:13:13,783 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:13:13,849 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-01-10 01:13:13,865 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-01-10 01:13:13,865 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:13:13,865 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:13:13,957 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:13:13,959 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:13:13,959 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [142817726] [2025-01-10 01:13:13,959 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [142817726] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 01:13:13,959 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 01:13:13,959 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-01-10 01:13:13,960 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [789986888] [2025-01-10 01:13:13,961 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 01:13:13,964 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-10 01:13:13,967 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:13:13,982 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-10 01:13:13,983 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-10 01:13:14,019 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 34 out of 89 [2025-01-10 01:13:14,022 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 86 places, 85 transitions, 188 flow. Second operand has 3 states, 3 states have (on average 35.0) internal successors, (105), 3 states have internal predecessors, (105), 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:13:14,023 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 01:13:14,023 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 34 of 89 [2025-01-10 01:13:14,024 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 01:13:14,649 INFO L124 PetriNetUnfolderBase]: 2958/4632 cut-off events. [2025-01-10 01:13:14,650 INFO L125 PetriNetUnfolderBase]: For 178/178 co-relation queries the response was YES. [2025-01-10 01:13:14,666 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8752 conditions, 4632 events. 2958/4632 cut-off events. For 178/178 co-relation queries the response was YES. Maximal size of possible extension queue 348. Compared 29775 event pairs, 2134 based on Foata normal form. 1/3242 useless extension candidates. Maximal degree in co-relation 8216. Up to 3883 conditions per place. [2025-01-10 01:13:14,695 INFO L140 encePairwiseOnDemand]: 81/89 looper letters, 46 selfloop transitions, 2 changer transitions 0/78 dead transitions. [2025-01-10 01:13:14,696 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 81 places, 78 transitions, 270 flow [2025-01-10 01:13:14,697 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-10 01:13:14,698 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-10 01:13:14,703 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 156 transitions. [2025-01-10 01:13:14,706 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5842696629213483 [2025-01-10 01:13:14,707 INFO L175 Difference]: Start difference. First operand has 86 places, 85 transitions, 188 flow. Second operand 3 states and 156 transitions. [2025-01-10 01:13:14,708 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 81 places, 78 transitions, 270 flow [2025-01-10 01:13:14,716 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 75 places, 78 transitions, 258 flow, removed 0 selfloop flow, removed 6 redundant places. [2025-01-10 01:13:14,720 INFO L231 Difference]: Finished difference. Result has 75 places, 78 transitions, 166 flow [2025-01-10 01:13:14,722 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=89, PETRI_DIFFERENCE_MINUEND_FLOW=162, PETRI_DIFFERENCE_MINUEND_PLACES=73, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=78, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=76, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=166, PETRI_PLACES=75, PETRI_TRANSITIONS=78} [2025-01-10 01:13:14,724 INFO L279 CegarLoopForPetriNet]: 86 programPoint places, -11 predicate places. [2025-01-10 01:13:14,726 INFO L471 AbstractCegarLoop]: Abstraction has has 75 places, 78 transitions, 166 flow [2025-01-10 01:13:14,726 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 35.0) internal successors, (105), 3 states have internal predecessors, (105), 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:13:14,726 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 01:13:14,726 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2025-01-10 01:13:14,726 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-01-10 01:13:14,727 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 52 more)] === [2025-01-10 01:13:14,727 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:13:14,727 INFO L85 PathProgramCache]: Analyzing trace with hash 867146, now seen corresponding path program 1 times [2025-01-10 01:13:14,727 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:13:14,728 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [564148826] [2025-01-10 01:13:14,728 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:13:14,729 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:13:14,738 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-01-10 01:13:14,760 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-01-10 01:13:14,761 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:13:14,761 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:13:15,015 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:13:15,015 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:13:15,015 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [564148826] [2025-01-10 01:13:15,016 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [564148826] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 01:13:15,016 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 01:13:15,016 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-10 01:13:15,016 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2096953433] [2025-01-10 01:13:15,016 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 01:13:15,017 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-10 01:13:15,017 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:13:15,017 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-10 01:13:15,017 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-10 01:13:15,057 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 34 out of 89 [2025-01-10 01:13:15,058 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 75 places, 78 transitions, 166 flow. Second operand has 4 states, 4 states have (on average 34.75) internal successors, (139), 4 states have internal predecessors, (139), 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:13:15,058 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 01:13:15,058 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 34 of 89 [2025-01-10 01:13:15,058 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 01:13:15,513 INFO L124 PetriNetUnfolderBase]: 2959/4635 cut-off events. [2025-01-10 01:13:15,513 INFO L125 PetriNetUnfolderBase]: For 51/51 co-relation queries the response was YES. [2025-01-10 01:13:15,519 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8615 conditions, 4635 events. 2959/4635 cut-off events. For 51/51 co-relation queries the response was YES. Maximal size of possible extension queue 348. Compared 29824 event pairs, 2134 based on Foata normal form. 0/3241 useless extension candidates. Maximal degree in co-relation 8578. Up to 3896 conditions per place. [2025-01-10 01:13:15,536 INFO L140 encePairwiseOnDemand]: 85/89 looper letters, 51 selfloop transitions, 3 changer transitions 0/81 dead transitions. [2025-01-10 01:13:15,536 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 77 places, 81 transitions, 280 flow [2025-01-10 01:13:15,537 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-10 01:13:15,537 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-10 01:13:15,538 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 157 transitions. [2025-01-10 01:13:15,538 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5880149812734082 [2025-01-10 01:13:15,539 INFO L175 Difference]: Start difference. First operand has 75 places, 78 transitions, 166 flow. Second operand 3 states and 157 transitions. [2025-01-10 01:13:15,539 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 77 places, 81 transitions, 280 flow [2025-01-10 01:13:15,539 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 75 places, 81 transitions, 276 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-10 01:13:15,541 INFO L231 Difference]: Finished difference. Result has 76 places, 80 transitions, 181 flow [2025-01-10 01:13:15,542 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=89, PETRI_DIFFERENCE_MINUEND_FLOW=162, PETRI_DIFFERENCE_MINUEND_PLACES=73, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=78, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=181, PETRI_PLACES=76, PETRI_TRANSITIONS=80} [2025-01-10 01:13:15,542 INFO L279 CegarLoopForPetriNet]: 86 programPoint places, -10 predicate places. [2025-01-10 01:13:15,543 INFO L471 AbstractCegarLoop]: Abstraction has has 76 places, 80 transitions, 181 flow [2025-01-10 01:13:15,543 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 34.75) internal successors, (139), 4 states have internal predecessors, (139), 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:13:15,543 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 01:13:15,543 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1] [2025-01-10 01:13:15,544 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-01-10 01:13:15,544 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 52 more)] === [2025-01-10 01:13:15,544 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:13:15,546 INFO L85 PathProgramCache]: Analyzing trace with hash 26883705, now seen corresponding path program 1 times [2025-01-10 01:13:15,547 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:13:15,547 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [599049815] [2025-01-10 01:13:15,547 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:13:15,547 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:13:15,558 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-01-10 01:13:15,564 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-01-10 01:13:15,567 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:13:15,567 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:13:15,649 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:13:15,650 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:13:15,650 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [599049815] [2025-01-10 01:13:15,650 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [599049815] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 01:13:15,650 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 01:13:15,650 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-10 01:13:15,650 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [450423427] [2025-01-10 01:13:15,650 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 01:13:15,650 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-10 01:13:15,651 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:13:15,651 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-10 01:13:15,651 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-10 01:13:15,661 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 37 out of 89 [2025-01-10 01:13:15,662 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 76 places, 80 transitions, 181 flow. Second operand has 3 states, 3 states have (on average 38.0) internal successors, (114), 3 states have internal predecessors, (114), 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:13:15,662 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 01:13:15,662 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 37 of 89 [2025-01-10 01:13:15,662 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 01:13:15,949 INFO L124 PetriNetUnfolderBase]: 2958/4634 cut-off events. [2025-01-10 01:13:15,949 INFO L125 PetriNetUnfolderBase]: For 51/51 co-relation queries the response was YES. [2025-01-10 01:13:15,953 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8615 conditions, 4634 events. 2958/4634 cut-off events. For 51/51 co-relation queries the response was YES. Maximal size of possible extension queue 348. Compared 29770 event pairs, 2134 based on Foata normal form. 1/3245 useless extension candidates. Maximal degree in co-relation 8602. Up to 3892 conditions per place. [2025-01-10 01:13:15,967 INFO L140 encePairwiseOnDemand]: 86/89 looper letters, 48 selfloop transitions, 2 changer transitions 0/80 dead transitions. [2025-01-10 01:13:15,967 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 78 places, 80 transitions, 278 flow [2025-01-10 01:13:15,968 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-10 01:13:15,968 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-10 01:13:15,968 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 162 transitions. [2025-01-10 01:13:15,969 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6067415730337079 [2025-01-10 01:13:15,969 INFO L175 Difference]: Start difference. First operand has 76 places, 80 transitions, 181 flow. Second operand 3 states and 162 transitions. [2025-01-10 01:13:15,969 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 78 places, 80 transitions, 278 flow [2025-01-10 01:13:15,969 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 77 places, 80 transitions, 276 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-01-10 01:13:15,970 INFO L231 Difference]: Finished difference. Result has 77 places, 79 transitions, 178 flow [2025-01-10 01:13:15,970 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=89, PETRI_DIFFERENCE_MINUEND_FLOW=174, PETRI_DIFFERENCE_MINUEND_PLACES=75, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=79, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=77, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=178, PETRI_PLACES=77, PETRI_TRANSITIONS=79} [2025-01-10 01:13:15,971 INFO L279 CegarLoopForPetriNet]: 86 programPoint places, -9 predicate places. [2025-01-10 01:13:15,971 INFO L471 AbstractCegarLoop]: Abstraction has has 77 places, 79 transitions, 178 flow [2025-01-10 01:13:15,971 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 38.0) internal successors, (114), 3 states have internal predecessors, (114), 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:13:15,971 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 01:13:15,971 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1] [2025-01-10 01:13:15,971 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-01-10 01:13:15,972 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 52 more)] === [2025-01-10 01:13:15,972 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:13:15,972 INFO L85 PathProgramCache]: Analyzing trace with hash 833356460, now seen corresponding path program 1 times [2025-01-10 01:13:15,972 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:13:15,972 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1527481807] [2025-01-10 01:13:15,972 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:13:15,972 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:13:15,977 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-01-10 01:13:15,982 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-01-10 01:13:15,983 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:13:15,983 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:13:16,130 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:13:16,130 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:13:16,130 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1527481807] [2025-01-10 01:13:16,131 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1527481807] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 01:13:16,131 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1394225145] [2025-01-10 01:13:16,131 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:13:16,132 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:13:16,132 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 01:13:16,134 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:13:16,137 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:13:16,176 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-01-10 01:13:16,185 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-01-10 01:13:16,186 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:13:16,186 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:13:16,191 INFO L256 TraceCheckSpWp]: Trace formula consists of 78 conjuncts, 18 conjuncts are in the unsatisfiable core [2025-01-10 01:13:16,194 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 01:13:16,248 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2025-01-10 01:13:16,372 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:13:16,372 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 01:13:16,453 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:13:16,453 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1394225145] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-10 01:13:16,453 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-10 01:13:16,453 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2025-01-10 01:13:16,453 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2128444342] [2025-01-10 01:13:16,453 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-10 01:13:16,453 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-01-10 01:13:16,454 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:13:16,454 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-01-10 01:13:16,454 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2025-01-10 01:13:16,701 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 34 out of 89 [2025-01-10 01:13:16,702 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 77 places, 79 transitions, 178 flow. Second operand has 11 states, 11 states have (on average 35.36363636363637) internal successors, (389), 11 states have internal predecessors, (389), 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:13:16,702 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 01:13:16,702 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 34 of 89 [2025-01-10 01:13:16,703 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 01:13:17,154 INFO L124 PetriNetUnfolderBase]: 2958/4633 cut-off events. [2025-01-10 01:13:17,155 INFO L125 PetriNetUnfolderBase]: For 52/52 co-relation queries the response was YES. [2025-01-10 01:13:17,159 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8616 conditions, 4633 events. 2958/4633 cut-off events. For 52/52 co-relation queries the response was YES. Maximal size of possible extension queue 348. Compared 29821 event pairs, 2134 based on Foata normal form. 0/3241 useless extension candidates. Maximal degree in co-relation 8602. Up to 3891 conditions per place. [2025-01-10 01:13:17,168 INFO L140 encePairwiseOnDemand]: 84/89 looper letters, 47 selfloop transitions, 5 changer transitions 0/79 dead transitions. [2025-01-10 01:13:17,168 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 80 places, 79 transitions, 280 flow [2025-01-10 01:13:17,169 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-10 01:13:17,169 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-01-10 01:13:17,169 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 223 transitions. [2025-01-10 01:13:17,170 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.501123595505618 [2025-01-10 01:13:17,170 INFO L175 Difference]: Start difference. First operand has 77 places, 79 transitions, 178 flow. Second operand 5 states and 223 transitions. [2025-01-10 01:13:17,170 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 80 places, 79 transitions, 280 flow [2025-01-10 01:13:17,170 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 78 places, 79 transitions, 276 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-10 01:13:17,171 INFO L231 Difference]: Finished difference. Result has 79 places, 79 transitions, 188 flow [2025-01-10 01:13:17,171 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=89, PETRI_DIFFERENCE_MINUEND_FLOW=170, PETRI_DIFFERENCE_MINUEND_PLACES=74, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=78, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=73, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=188, PETRI_PLACES=79, PETRI_TRANSITIONS=79} [2025-01-10 01:13:17,172 INFO L279 CegarLoopForPetriNet]: 86 programPoint places, -7 predicate places. [2025-01-10 01:13:17,172 INFO L471 AbstractCegarLoop]: Abstraction has has 79 places, 79 transitions, 188 flow [2025-01-10 01:13:17,172 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 35.36363636363637) internal successors, (389), 11 states have internal predecessors, (389), 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:13:17,172 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 01:13:17,172 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1] [2025-01-10 01:13:17,179 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-01-10 01:13:17,373 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:13:17,373 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 52 more)] === [2025-01-10 01:13:17,374 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:13:17,374 INFO L85 PathProgramCache]: Analyzing trace with hash 64248663, now seen corresponding path program 1 times [2025-01-10 01:13:17,374 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:13:17,374 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1743370155] [2025-01-10 01:13:17,374 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:13:17,374 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:13:17,381 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-01-10 01:13:17,388 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-01-10 01:13:17,388 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:13:17,389 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:13:17,557 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 01:13:17,557 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:13:17,557 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1743370155] [2025-01-10 01:13:17,557 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1743370155] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 01:13:17,557 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1880231044] [2025-01-10 01:13:17,557 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:13:17,557 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:13:17,557 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 01:13:17,563 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:13:17,564 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:13:17,602 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-01-10 01:13:17,611 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-01-10 01:13:17,612 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:13:17,612 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:13:17,612 INFO L256 TraceCheckSpWp]: Trace formula consists of 103 conjuncts, 20 conjuncts are in the unsatisfiable core [2025-01-10 01:13:17,614 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 01:13:17,621 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:13:17,696 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2025-01-10 01:13:17,696 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 32 treesize of output 27 [2025-01-10 01:13:17,716 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 01:13:17,716 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 01:13:17,771 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 01:13:17,771 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1880231044] provided 1 perfect and 1 imperfect interpolant sequences [2025-01-10 01:13:17,771 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-01-10 01:13:17,771 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4, 3] total 9 [2025-01-10 01:13:17,771 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1880422500] [2025-01-10 01:13:17,771 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 01:13:17,771 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-10 01:13:17,772 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:13:17,772 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-10 01:13:17,772 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2025-01-10 01:13:17,856 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 34 out of 89 [2025-01-10 01:13:17,857 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 79 places, 79 transitions, 188 flow. Second operand has 5 states, 5 states have (on average 35.2) internal successors, (176), 5 states have internal predecessors, (176), 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:13:17,857 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 01:13:17,857 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 34 of 89 [2025-01-10 01:13:17,857 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 01:13:18,180 INFO L124 PetriNetUnfolderBase]: 2960/4639 cut-off events. [2025-01-10 01:13:18,181 INFO L125 PetriNetUnfolderBase]: For 52/52 co-relation queries the response was YES. [2025-01-10 01:13:18,186 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8635 conditions, 4639 events. 2960/4639 cut-off events. For 52/52 co-relation queries the response was YES. Maximal size of possible extension queue 348. Compared 29827 event pairs, 2134 based on Foata normal form. 0/3245 useless extension candidates. Maximal degree in co-relation 8606. Up to 3894 conditions per place. [2025-01-10 01:13:18,200 INFO L140 encePairwiseOnDemand]: 80/89 looper letters, 51 selfloop transitions, 7 changer transitions 0/85 dead transitions. [2025-01-10 01:13:18,201 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 82 places, 85 transitions, 316 flow [2025-01-10 01:13:18,201 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-10 01:13:18,201 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-01-10 01:13:18,202 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 196 transitions. [2025-01-10 01:13:18,202 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.550561797752809 [2025-01-10 01:13:18,202 INFO L175 Difference]: Start difference. First operand has 79 places, 79 transitions, 188 flow. Second operand 4 states and 196 transitions. [2025-01-10 01:13:18,202 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 82 places, 85 transitions, 316 flow [2025-01-10 01:13:18,204 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 79 places, 85 transitions, 306 flow, removed 2 selfloop flow, removed 3 redundant places. [2025-01-10 01:13:18,206 INFO L231 Difference]: Finished difference. Result has 81 places, 83 transitions, 225 flow [2025-01-10 01:13:18,207 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=89, PETRI_DIFFERENCE_MINUEND_FLOW=178, PETRI_DIFFERENCE_MINUEND_PLACES=76, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=79, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=72, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=225, PETRI_PLACES=81, PETRI_TRANSITIONS=83} [2025-01-10 01:13:18,207 INFO L279 CegarLoopForPetriNet]: 86 programPoint places, -5 predicate places. [2025-01-10 01:13:18,209 INFO L471 AbstractCegarLoop]: Abstraction has has 81 places, 83 transitions, 225 flow [2025-01-10 01:13:18,209 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 35.2) internal successors, (176), 5 states have internal predecessors, (176), 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:13:18,209 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 01:13:18,209 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:13:18,216 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:13:18,409 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:13:18,410 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 52 more)] === [2025-01-10 01:13:18,411 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:13:18,411 INFO L85 PathProgramCache]: Analyzing trace with hash 1991709240, now seen corresponding path program 1 times [2025-01-10 01:13:18,411 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:13:18,411 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [762888770] [2025-01-10 01:13:18,411 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:13:18,412 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:13:18,418 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-01-10 01:13:18,428 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-01-10 01:13:18,428 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:13:18,428 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:13:18,488 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-01-10 01:13:18,488 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:13:18,489 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [762888770] [2025-01-10 01:13:18,489 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [762888770] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 01:13:18,489 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 01:13:18,489 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-10 01:13:18,489 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [145397572] [2025-01-10 01:13:18,489 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 01:13:18,489 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-10 01:13:18,489 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:13:18,490 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-10 01:13:18,490 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-01-10 01:13:18,500 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 37 out of 89 [2025-01-10 01:13:18,500 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 81 places, 83 transitions, 225 flow. Second operand has 4 states, 4 states have (on average 38.5) internal successors, (154), 4 states have internal predecessors, (154), 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:13:18,501 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 01:13:18,501 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 37 of 89 [2025-01-10 01:13:18,501 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 01:13:18,831 INFO L124 PetriNetUnfolderBase]: 2958/4637 cut-off events. [2025-01-10 01:13:18,831 INFO L125 PetriNetUnfolderBase]: For 56/56 co-relation queries the response was YES. [2025-01-10 01:13:18,837 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8641 conditions, 4637 events. 2958/4637 cut-off events. For 56/56 co-relation queries the response was YES. Maximal size of possible extension queue 348. Compared 29823 event pairs, 2134 based on Foata normal form. 2/3251 useless extension candidates. Maximal degree in co-relation 8611. Up to 3891 conditions per place. [2025-01-10 01:13:18,853 INFO L140 encePairwiseOnDemand]: 82/89 looper letters, 48 selfloop transitions, 6 changer transitions 0/83 dead transitions. [2025-01-10 01:13:18,853 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 84 places, 83 transitions, 327 flow [2025-01-10 01:13:18,853 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-10 01:13:18,854 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-01-10 01:13:18,854 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 204 transitions. [2025-01-10 01:13:18,855 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5730337078651685 [2025-01-10 01:13:18,855 INFO L175 Difference]: Start difference. First operand has 81 places, 83 transitions, 225 flow. Second operand 4 states and 204 transitions. [2025-01-10 01:13:18,855 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 84 places, 83 transitions, 327 flow [2025-01-10 01:13:18,856 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 82 places, 83 transitions, 321 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-10 01:13:18,857 INFO L231 Difference]: Finished difference. Result has 82 places, 81 transitions, 221 flow [2025-01-10 01:13:18,857 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=89, PETRI_DIFFERENCE_MINUEND_FLOW=209, PETRI_DIFFERENCE_MINUEND_PLACES=79, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=81, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=221, PETRI_PLACES=82, PETRI_TRANSITIONS=81} [2025-01-10 01:13:18,857 INFO L279 CegarLoopForPetriNet]: 86 programPoint places, -4 predicate places. [2025-01-10 01:13:18,858 INFO L471 AbstractCegarLoop]: Abstraction has has 82 places, 81 transitions, 221 flow [2025-01-10 01:13:18,858 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 38.5) internal successors, (154), 4 states have internal predecessors, (154), 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:13:18,858 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 01:13:18,858 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1] [2025-01-10 01:13:18,858 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-01-10 01:13:18,858 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 52 more)] === [2025-01-10 01:13:18,858 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:13:18,858 INFO L85 PathProgramCache]: Analyzing trace with hash 1613450598, now seen corresponding path program 1 times [2025-01-10 01:13:18,859 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:13:18,859 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1800348923] [2025-01-10 01:13:18,859 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:13:18,859 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:13:18,864 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-01-10 01:13:18,869 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-01-10 01:13:18,869 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:13:18,869 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:13:18,933 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 01:13:18,933 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:13:18,933 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1800348923] [2025-01-10 01:13:18,933 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1800348923] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 01:13:18,933 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [713740675] [2025-01-10 01:13:18,934 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:13:18,934 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:13:18,934 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 01:13:18,939 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:13:18,943 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:13:18,978 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-01-10 01:13:18,989 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-01-10 01:13:18,989 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:13:18,990 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:13:18,990 INFO L256 TraceCheckSpWp]: Trace formula consists of 116 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-01-10 01:13:18,991 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 01:13:19,044 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 01:13:19,044 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 01:13:19,094 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 01:13:19,094 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [713740675] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-10 01:13:19,095 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-10 01:13:19,095 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 12 [2025-01-10 01:13:19,095 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [988227521] [2025-01-10 01:13:19,095 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-10 01:13:19,095 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-01-10 01:13:19,095 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:13:19,095 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-01-10 01:13:19,096 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=114, Unknown=0, NotChecked=0, Total=156 [2025-01-10 01:13:19,177 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 37 out of 89 [2025-01-10 01:13:19,178 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 82 places, 81 transitions, 221 flow. Second operand has 13 states, 13 states have (on average 38.53846153846154) internal successors, (501), 13 states have internal predecessors, (501), 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:13:19,178 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 01:13:19,178 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 37 of 89 [2025-01-10 01:13:19,178 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 01:13:19,684 INFO L124 PetriNetUnfolderBase]: 5915/9273 cut-off events. [2025-01-10 01:13:19,684 INFO L125 PetriNetUnfolderBase]: For 113/113 co-relation queries the response was YES. [2025-01-10 01:13:19,696 INFO L83 FinitePrefix]: Finished finitePrefix Result has 17276 conditions, 9273 events. 5915/9273 cut-off events. For 113/113 co-relation queries the response was YES. Maximal size of possible extension queue 521. Compared 63909 event pairs, 4268 based on Foata normal form. 2/6508 useless extension candidates. Maximal degree in co-relation 8634. Up to 3889 conditions per place. [2025-01-10 01:13:19,724 INFO L140 encePairwiseOnDemand]: 79/89 looper letters, 85 selfloop transitions, 22 changer transitions 0/136 dead transitions. [2025-01-10 01:13:19,724 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 89 places, 136 transitions, 592 flow [2025-01-10 01:13:19,724 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-01-10 01:13:19,725 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2025-01-10 01:13:19,725 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 405 transitions. [2025-01-10 01:13:19,726 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5688202247191011 [2025-01-10 01:13:19,726 INFO L175 Difference]: Start difference. First operand has 82 places, 81 transitions, 221 flow. Second operand 8 states and 405 transitions. [2025-01-10 01:13:19,726 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 89 places, 136 transitions, 592 flow [2025-01-10 01:13:19,726 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 86 places, 136 transitions, 570 flow, removed 0 selfloop flow, removed 3 redundant places. [2025-01-10 01:13:19,728 INFO L231 Difference]: Finished difference. Result has 88 places, 94 transitions, 338 flow [2025-01-10 01:13:19,728 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=89, PETRI_DIFFERENCE_MINUEND_FLOW=209, PETRI_DIFFERENCE_MINUEND_PLACES=79, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=81, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=68, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=338, PETRI_PLACES=88, PETRI_TRANSITIONS=94} [2025-01-10 01:13:19,728 INFO L279 CegarLoopForPetriNet]: 86 programPoint places, 2 predicate places. [2025-01-10 01:13:19,728 INFO L471 AbstractCegarLoop]: Abstraction has has 88 places, 94 transitions, 338 flow [2025-01-10 01:13:19,729 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 38.53846153846154) internal successors, (501), 13 states have internal predecessors, (501), 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:13:19,729 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 01:13:19,729 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 1, 1, 1, 1] [2025-01-10 01:13:19,737 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-01-10 01:13:19,933 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:13:19,933 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 52 more)] === [2025-01-10 01:13:19,934 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:13:19,934 INFO L85 PathProgramCache]: Analyzing trace with hash -1125395644, now seen corresponding path program 2 times [2025-01-10 01:13:19,934 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:13:19,934 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [517573054] [2025-01-10 01:13:19,934 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-10 01:13:19,934 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:13:19,940 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 10 statements into 2 equivalence classes. [2025-01-10 01:13:19,950 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 10 of 10 statements. [2025-01-10 01:13:19,950 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-01-10 01:13:19,950 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:13:20,131 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-01-10 01:13:20,131 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:13:20,132 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [517573054] [2025-01-10 01:13:20,132 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [517573054] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 01:13:20,132 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2014753403] [2025-01-10 01:13:20,132 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-10 01:13:20,132 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:13:20,132 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 01:13:20,134 INFO L229 MonitoredProcess]: Starting monitored process 5 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:13:20,139 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-01-10 01:13:20,179 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 10 statements into 2 equivalence classes. [2025-01-10 01:13:20,192 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 10 of 10 statements. [2025-01-10 01:13:20,192 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-01-10 01:13:20,192 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:13:20,195 INFO L256 TraceCheckSpWp]: Trace formula consists of 129 conjuncts, 25 conjuncts are in the unsatisfiable core [2025-01-10 01:13:20,196 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 01:13:20,206 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:13:20,298 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2025-01-10 01:13:20,298 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 32 treesize of output 27 [2025-01-10 01:13:20,368 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 01:13:20,368 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 01:13:20,511 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 01:13:20,511 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2014753403] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-10 01:13:20,511 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-10 01:13:20,511 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 5, 5] total 14 [2025-01-10 01:13:20,511 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [73270385] [2025-01-10 01:13:20,511 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-10 01:13:20,512 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2025-01-10 01:13:20,512 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:13:20,512 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2025-01-10 01:13:20,512 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=197, Unknown=0, NotChecked=0, Total=240 [2025-01-10 01:13:21,280 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 34 out of 89 [2025-01-10 01:13:21,281 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 88 places, 94 transitions, 338 flow. Second operand has 16 states, 16 states have (on average 35.75) internal successors, (572), 16 states have internal predecessors, (572), 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:13:21,281 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 01:13:21,281 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 34 of 89 [2025-01-10 01:13:21,281 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 01:13:22,779 INFO L124 PetriNetUnfolderBase]: 8868/13887 cut-off events. [2025-01-10 01:13:22,779 INFO L125 PetriNetUnfolderBase]: For 166/166 co-relation queries the response was YES. [2025-01-10 01:13:22,799 INFO L83 FinitePrefix]: Finished finitePrefix Result has 25876 conditions, 13887 events. 8868/13887 cut-off events. For 166/166 co-relation queries the response was YES. Maximal size of possible extension queue 839. Compared 103039 event pairs, 6402 based on Foata normal form. 5/9744 useless extension candidates. Maximal degree in co-relation 17219. Up to 7764 conditions per place. [2025-01-10 01:13:22,841 INFO L140 encePairwiseOnDemand]: 77/89 looper letters, 81 selfloop transitions, 25 changer transitions 0/133 dead transitions. [2025-01-10 01:13:22,841 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 95 places, 133 transitions, 641 flow [2025-01-10 01:13:22,842 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-01-10 01:13:22,842 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2025-01-10 01:13:22,843 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 451 transitions. [2025-01-10 01:13:22,843 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5067415730337078 [2025-01-10 01:13:22,843 INFO L175 Difference]: Start difference. First operand has 88 places, 94 transitions, 338 flow. Second operand 10 states and 451 transitions. [2025-01-10 01:13:22,843 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 95 places, 133 transitions, 641 flow [2025-01-10 01:13:22,844 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 93 places, 133 transitions, 607 flow, removed 7 selfloop flow, removed 2 redundant places. [2025-01-10 01:13:22,846 INFO L231 Difference]: Finished difference. Result has 94 places, 93 transitions, 359 flow [2025-01-10 01:13:22,846 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=89, PETRI_DIFFERENCE_MINUEND_FLOW=289, PETRI_DIFFERENCE_MINUEND_PLACES=84, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=23, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=66, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=359, PETRI_PLACES=94, PETRI_TRANSITIONS=93} [2025-01-10 01:13:22,846 INFO L279 CegarLoopForPetriNet]: 86 programPoint places, 8 predicate places. [2025-01-10 01:13:22,846 INFO L471 AbstractCegarLoop]: Abstraction has has 94 places, 93 transitions, 359 flow [2025-01-10 01:13:22,847 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 35.75) internal successors, (572), 16 states have internal predecessors, (572), 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:13:22,847 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 01:13:22,847 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:13:22,855 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2025-01-10 01:13:23,047 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable7 [2025-01-10 01:13:23,048 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 52 more)] === [2025-01-10 01:13:23,048 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:13:23,048 INFO L85 PathProgramCache]: Analyzing trace with hash 1328416655, now seen corresponding path program 1 times [2025-01-10 01:13:23,048 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:13:23,048 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1319084193] [2025-01-10 01:13:23,048 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:13:23,049 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:13:23,056 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-01-10 01:13:23,071 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-01-10 01:13:23,071 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:13:23,075 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:13:23,412 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-01-10 01:13:23,412 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:13:23,412 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1319084193] [2025-01-10 01:13:23,412 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1319084193] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 01:13:23,412 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [739096206] [2025-01-10 01:13:23,412 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:13:23,412 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:13:23,413 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 01:13:23,414 INFO L229 MonitoredProcess]: Starting monitored process 6 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:13:23,419 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-01-10 01:13:23,469 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-01-10 01:13:23,487 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-01-10 01:13:23,488 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:13:23,488 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:13:23,489 INFO L256 TraceCheckSpWp]: Trace formula consists of 162 conjuncts, 33 conjuncts are in the unsatisfiable core [2025-01-10 01:13:23,490 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 01:13:23,496 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 6 treesize of output 5 [2025-01-10 01:13:23,503 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:13:23,543 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-01-10 01:13:23,543 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2025-01-10 01:13:23,552 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 13 [2025-01-10 01:13:23,635 INFO L349 Elim1Store]: treesize reduction 24, result has 44.2 percent of original size [2025-01-10 01:13:23,635 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 28 treesize of output 32 [2025-01-10 01:13:23,804 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-01-10 01:13:23,804 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 01:13:24,026 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-01-10 01:13:24,027 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [739096206] provided 1 perfect and 1 imperfect interpolant sequences [2025-01-10 01:13:24,027 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-01-10 01:13:24,027 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4, 4] total 12 [2025-01-10 01:13:24,027 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [224217871] [2025-01-10 01:13:24,027 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 01:13:24,027 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-10 01:13:24,027 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:13:24,028 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-10 01:13:24,028 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=141, Unknown=0, NotChecked=0, Total=182 [2025-01-10 01:13:24,228 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 34 out of 89 [2025-01-10 01:13:24,228 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 94 places, 93 transitions, 359 flow. Second operand has 6 states, 6 states have (on average 35.833333333333336) internal successors, (215), 6 states have internal predecessors, (215), 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:13:24,229 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 01:13:24,229 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 34 of 89 [2025-01-10 01:13:24,229 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 01:13:25,604 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.22s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-01-10 01:13:26,924 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.27s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-01-10 01:13:28,274 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.32s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-01-10 01:13:28,918 INFO L124 PetriNetUnfolderBase]: 8868/13881 cut-off events. [2025-01-10 01:13:28,918 INFO L125 PetriNetUnfolderBase]: For 169/169 co-relation queries the response was YES. [2025-01-10 01:13:28,938 INFO L83 FinitePrefix]: Finished finitePrefix Result has 25888 conditions, 13881 events. 8868/13881 cut-off events. For 169/169 co-relation queries the response was YES. Maximal size of possible extension queue 788. Compared 102244 event pairs, 6402 based on Foata normal form. 0/9725 useless extension candidates. Maximal degree in co-relation 17223. Up to 11649 conditions per place. [2025-01-10 01:13:28,980 INFO L140 encePairwiseOnDemand]: 83/89 looper letters, 60 selfloop transitions, 8 changer transitions 0/92 dead transitions. [2025-01-10 01:13:28,980 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 97 places, 92 transitions, 499 flow [2025-01-10 01:13:28,981 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-10 01:13:28,981 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-01-10 01:13:28,981 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 257 transitions. [2025-01-10 01:13:28,982 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4812734082397004 [2025-01-10 01:13:28,982 INFO L175 Difference]: Start difference. First operand has 94 places, 93 transitions, 359 flow. Second operand 6 states and 257 transitions. [2025-01-10 01:13:28,982 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 97 places, 92 transitions, 499 flow [2025-01-10 01:13:28,983 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 92 places, 92 transitions, 452 flow, removed 6 selfloop flow, removed 5 redundant places. [2025-01-10 01:13:28,985 INFO L231 Difference]: Finished difference. Result has 92 places, 91 transitions, 324 flow [2025-01-10 01:13:28,985 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=89, PETRI_DIFFERENCE_MINUEND_FLOW=308, PETRI_DIFFERENCE_MINUEND_PLACES=87, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=83, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=324, PETRI_PLACES=92, PETRI_TRANSITIONS=91} [2025-01-10 01:13:28,986 INFO L279 CegarLoopForPetriNet]: 86 programPoint places, 6 predicate places. [2025-01-10 01:13:28,986 INFO L471 AbstractCegarLoop]: Abstraction has has 92 places, 91 transitions, 324 flow [2025-01-10 01:13:28,986 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 35.833333333333336) internal successors, (215), 6 states have internal predecessors, (215), 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:13:28,987 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 01:13:28,987 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:13:28,997 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2025-01-10 01:13:29,191 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,6 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:13:29,191 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 52 more)] === [2025-01-10 01:13:29,193 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:13:29,193 INFO L85 PathProgramCache]: Analyzing trace with hash 1328416654, now seen corresponding path program 1 times [2025-01-10 01:13:29,193 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:13:29,193 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [173555715] [2025-01-10 01:13:29,193 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:13:29,193 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:13:29,198 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-01-10 01:13:29,207 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-01-10 01:13:29,208 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:13:29,208 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:13:29,284 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-01-10 01:13:29,284 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:13:29,284 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [173555715] [2025-01-10 01:13:29,284 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [173555715] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 01:13:29,284 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 01:13:29,284 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-10 01:13:29,284 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1378140619] [2025-01-10 01:13:29,284 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 01:13:29,284 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-10 01:13:29,285 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:13:29,285 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-10 01:13:29,285 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-01-10 01:13:29,340 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 28 out of 89 [2025-01-10 01:13:29,340 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 92 places, 91 transitions, 324 flow. Second operand has 5 states, 5 states have (on average 30.2) internal successors, (151), 5 states have internal predecessors, (151), 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:13:29,340 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 01:13:29,340 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 28 of 89 [2025-01-10 01:13:29,341 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 01:13:29,965 INFO L124 PetriNetUnfolderBase]: 8967/14379 cut-off events. [2025-01-10 01:13:29,966 INFO L125 PetriNetUnfolderBase]: For 156/156 co-relation queries the response was YES. [2025-01-10 01:13:29,978 INFO L83 FinitePrefix]: Finished finitePrefix Result has 26537 conditions, 14379 events. 8967/14379 cut-off events. For 156/156 co-relation queries the response was YES. Maximal size of possible extension queue 833. Compared 105933 event pairs, 6564 based on Foata normal form. 0/10220 useless extension candidates. Maximal degree in co-relation 17660. Up to 11808 conditions per place. [2025-01-10 01:13:30,009 INFO L140 encePairwiseOnDemand]: 81/89 looper letters, 61 selfloop transitions, 6 changer transitions 0/86 dead transitions. [2025-01-10 01:13:30,009 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 91 places, 86 transitions, 448 flow [2025-01-10 01:13:30,010 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-10 01:13:30,010 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-01-10 01:13:30,011 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 194 transitions. [2025-01-10 01:13:30,011 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.43595505617977526 [2025-01-10 01:13:30,011 INFO L175 Difference]: Start difference. First operand has 92 places, 91 transitions, 324 flow. Second operand 5 states and 194 transitions. [2025-01-10 01:13:30,011 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 91 places, 86 transitions, 448 flow [2025-01-10 01:13:30,012 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 88 places, 86 transitions, 439 flow, removed 0 selfloop flow, removed 3 redundant places. [2025-01-10 01:13:30,013 INFO L231 Difference]: Finished difference. Result has 88 places, 86 transitions, 317 flow [2025-01-10 01:13:30,017 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=89, PETRI_DIFFERENCE_MINUEND_FLOW=305, PETRI_DIFFERENCE_MINUEND_PLACES=84, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=86, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=80, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=317, PETRI_PLACES=88, PETRI_TRANSITIONS=86} [2025-01-10 01:13:30,017 INFO L279 CegarLoopForPetriNet]: 86 programPoint places, 2 predicate places. [2025-01-10 01:13:30,017 INFO L471 AbstractCegarLoop]: Abstraction has has 88 places, 86 transitions, 317 flow [2025-01-10 01:13:30,017 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 30.2) internal successors, (151), 5 states have internal predecessors, (151), 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:13:30,017 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 01:13:30,018 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:13:30,018 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-01-10 01:13:30,018 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 52 more)] === [2025-01-10 01:13:30,018 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:13:30,018 INFO L85 PathProgramCache]: Analyzing trace with hash -1768755762, now seen corresponding path program 1 times [2025-01-10 01:13:30,018 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:13:30,018 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1255014257] [2025-01-10 01:13:30,018 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:13:30,018 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:13:30,027 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-01-10 01:13:30,040 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-01-10 01:13:30,040 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:13:30,040 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:13:30,120 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-01-10 01:13:30,120 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:13:30,120 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1255014257] [2025-01-10 01:13:30,120 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1255014257] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 01:13:30,120 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 01:13:30,120 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-10 01:13:30,120 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1559297171] [2025-01-10 01:13:30,120 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 01:13:30,120 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-10 01:13:30,120 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:13:30,121 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-10 01:13:30,121 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-01-10 01:13:30,175 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 29 out of 89 [2025-01-10 01:13:30,175 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 88 places, 86 transitions, 317 flow. Second operand has 5 states, 5 states have (on average 31.4) internal successors, (157), 5 states have internal predecessors, (157), 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:13:30,175 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 01:13:30,175 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 29 of 89 [2025-01-10 01:13:30,175 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 01:13:30,909 INFO L124 PetriNetUnfolderBase]: 8124/12675 cut-off events. [2025-01-10 01:13:30,910 INFO L125 PetriNetUnfolderBase]: For 141/141 co-relation queries the response was YES. [2025-01-10 01:13:30,926 INFO L83 FinitePrefix]: Finished finitePrefix Result has 23756 conditions, 12675 events. 8124/12675 cut-off events. For 141/141 co-relation queries the response was YES. Maximal size of possible extension queue 728. Compared 89234 event pairs, 5934 based on Foata normal form. 0/9257 useless extension candidates. Maximal degree in co-relation 15805. Up to 10752 conditions per place. [2025-01-10 01:13:30,963 INFO L140 encePairwiseOnDemand]: 81/89 looper letters, 59 selfloop transitions, 6 changer transitions 0/81 dead transitions. [2025-01-10 01:13:30,964 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 87 places, 81 transitions, 437 flow [2025-01-10 01:13:30,964 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-10 01:13:30,964 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-01-10 01:13:30,965 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 197 transitions. [2025-01-10 01:13:30,965 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.44269662921348313 [2025-01-10 01:13:30,965 INFO L175 Difference]: Start difference. First operand has 88 places, 86 transitions, 317 flow. Second operand 5 states and 197 transitions. [2025-01-10 01:13:30,965 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 87 places, 81 transitions, 437 flow [2025-01-10 01:13:30,966 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 84 places, 81 transitions, 428 flow, removed 0 selfloop flow, removed 3 redundant places. [2025-01-10 01:13:30,967 INFO L231 Difference]: Finished difference. Result has 84 places, 81 transitions, 310 flow [2025-01-10 01:13:30,967 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=89, PETRI_DIFFERENCE_MINUEND_FLOW=298, PETRI_DIFFERENCE_MINUEND_PLACES=80, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=81, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=310, PETRI_PLACES=84, PETRI_TRANSITIONS=81} [2025-01-10 01:13:30,967 INFO L279 CegarLoopForPetriNet]: 86 programPoint places, -2 predicate places. [2025-01-10 01:13:30,968 INFO L471 AbstractCegarLoop]: Abstraction has has 84 places, 81 transitions, 310 flow [2025-01-10 01:13:30,968 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 31.4) internal successors, (157), 5 states have internal predecessors, (157), 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:13:30,968 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 01:13:30,968 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:13:30,968 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-01-10 01:13:30,968 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 52 more)] === [2025-01-10 01:13:30,968 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:13:30,968 INFO L85 PathProgramCache]: Analyzing trace with hash -1768755761, now seen corresponding path program 1 times [2025-01-10 01:13:30,968 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:13:30,968 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [139829797] [2025-01-10 01:13:30,969 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:13:30,969 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:13:30,975 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-01-10 01:13:30,981 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-01-10 01:13:30,981 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:13:30,981 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:13:31,134 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-01-10 01:13:31,134 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:13:31,134 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [139829797] [2025-01-10 01:13:31,134 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [139829797] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 01:13:31,134 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1288398760] [2025-01-10 01:13:31,134 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:13:31,134 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:13:31,134 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 01:13:31,138 INFO L229 MonitoredProcess]: Starting monitored process 7 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:13:31,142 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-01-10 01:13:31,188 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-01-10 01:13:31,206 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-01-10 01:13:31,207 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:13:31,207 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:13:31,207 INFO L256 TraceCheckSpWp]: Trace formula consists of 168 conjuncts, 14 conjuncts are in the unsatisfiable core [2025-01-10 01:13:31,208 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 01:13:31,213 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 6 treesize of output 5 [2025-01-10 01:13:31,252 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-10 01:13:31,253 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2025-01-10 01:13:31,259 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-01-10 01:13:31,259 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2025-01-10 01:13:31,284 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-01-10 01:13:31,284 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 01:13:31,354 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 48 [2025-01-10 01:13:31,403 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-01-10 01:13:31,403 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1288398760] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-10 01:13:31,403 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-10 01:13:31,403 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 9 [2025-01-10 01:13:31,403 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1227037982] [2025-01-10 01:13:31,403 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-10 01:13:31,403 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-01-10 01:13:31,403 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:13:31,403 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-01-10 01:13:31,404 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2025-01-10 01:13:31,767 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 32 out of 89 [2025-01-10 01:13:31,768 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 84 places, 81 transitions, 310 flow. Second operand has 10 states, 10 states have (on average 34.5) internal successors, (345), 10 states have internal predecessors, (345), 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:13:31,768 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 01:13:31,768 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 32 of 89 [2025-01-10 01:13:31,768 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 01:13:32,450 INFO L124 PetriNetUnfolderBase]: 7110/11127 cut-off events. [2025-01-10 01:13:32,451 INFO L125 PetriNetUnfolderBase]: For 141/141 co-relation queries the response was YES. [2025-01-10 01:13:32,473 INFO L83 FinitePrefix]: Finished finitePrefix Result has 20780 conditions, 11127 events. 7110/11127 cut-off events. For 141/141 co-relation queries the response was YES. Maximal size of possible extension queue 670. Compared 79135 event pairs, 5070 based on Foata normal form. 0/8057 useless extension candidates. Maximal degree in co-relation 13822. Up to 9348 conditions per place. [2025-01-10 01:13:32,513 INFO L140 encePairwiseOnDemand]: 80/89 looper letters, 53 selfloop transitions, 13 changer transitions 0/81 dead transitions. [2025-01-10 01:13:32,513 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 89 places, 81 transitions, 454 flow [2025-01-10 01:13:32,515 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-01-10 01:13:32,515 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2025-01-10 01:13:32,516 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 310 transitions. [2025-01-10 01:13:32,516 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4353932584269663 [2025-01-10 01:13:32,516 INFO L175 Difference]: Start difference. First operand has 84 places, 81 transitions, 310 flow. Second operand 8 states and 310 transitions. [2025-01-10 01:13:32,516 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 89 places, 81 transitions, 454 flow [2025-01-10 01:13:32,518 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 86 places, 81 transitions, 445 flow, removed 0 selfloop flow, removed 3 redundant places. [2025-01-10 01:13:32,519 INFO L231 Difference]: Finished difference. Result has 86 places, 79 transitions, 323 flow [2025-01-10 01:13:32,519 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=89, PETRI_DIFFERENCE_MINUEND_FLOW=297, PETRI_DIFFERENCE_MINUEND_PLACES=79, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=79, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=66, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=323, PETRI_PLACES=86, PETRI_TRANSITIONS=79} [2025-01-10 01:13:32,521 INFO L279 CegarLoopForPetriNet]: 86 programPoint places, 0 predicate places. [2025-01-10 01:13:32,522 INFO L471 AbstractCegarLoop]: Abstraction has has 86 places, 79 transitions, 323 flow [2025-01-10 01:13:32,522 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 34.5) internal successors, (345), 10 states have internal predecessors, (345), 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:13:32,522 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 01:13:32,523 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:13:32,530 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2025-01-10 01:13:32,723 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2025-01-10 01:13:32,723 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 52 more)] === [2025-01-10 01:13:32,723 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:13:32,724 INFO L85 PathProgramCache]: Analyzing trace with hash -82751334, now seen corresponding path program 1 times [2025-01-10 01:13:32,724 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:13:32,724 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [976081231] [2025-01-10 01:13:32,724 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:13:32,724 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:13:32,732 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-01-10 01:13:32,739 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-01-10 01:13:32,739 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:13:32,740 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:13:32,803 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-01-10 01:13:32,803 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:13:32,803 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [976081231] [2025-01-10 01:13:32,803 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [976081231] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 01:13:32,803 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1092534454] [2025-01-10 01:13:32,803 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:13:32,804 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:13:32,804 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 01:13:32,808 INFO L229 MonitoredProcess]: Starting monitored process 8 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:13:32,809 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2025-01-10 01:13:32,852 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-01-10 01:13:32,869 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-01-10 01:13:32,869 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:13:32,870 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:13:32,870 INFO L256 TraceCheckSpWp]: Trace formula consists of 213 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-01-10 01:13:32,871 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 01:13:32,913 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-01-10 01:13:32,913 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 01:13:32,957 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-01-10 01:13:32,958 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1092534454] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-10 01:13:32,958 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-10 01:13:32,958 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 11 [2025-01-10 01:13:32,958 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [51620602] [2025-01-10 01:13:32,958 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-10 01:13:32,958 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-01-10 01:13:32,958 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:13:32,958 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-01-10 01:13:32,958 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=88, Unknown=0, NotChecked=0, Total=132 [2025-01-10 01:13:33,039 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 36 out of 89 [2025-01-10 01:13:33,039 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 86 places, 79 transitions, 323 flow. Second operand has 12 states, 12 states have (on average 38.333333333333336) internal successors, (460), 12 states have internal predecessors, (460), 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:13:33,039 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 01:13:33,039 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 36 of 89 [2025-01-10 01:13:33,040 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 01:13:33,537 INFO L124 PetriNetUnfolderBase]: 4444/7101 cut-off events. [2025-01-10 01:13:33,537 INFO L125 PetriNetUnfolderBase]: For 102/102 co-relation queries the response was YES. [2025-01-10 01:13:33,544 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13381 conditions, 7101 events. 4444/7101 cut-off events. For 102/102 co-relation queries the response was YES. Maximal size of possible extension queue 368. Compared 47009 event pairs, 2594 based on Foata normal form. 0/5124 useless extension candidates. Maximal degree in co-relation 10557. Up to 3511 conditions per place. [2025-01-10 01:13:33,554 INFO L140 encePairwiseOnDemand]: 76/89 looper letters, 92 selfloop transitions, 23 changer transitions 0/129 dead transitions. [2025-01-10 01:13:33,555 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 94 places, 129 transitions, 673 flow [2025-01-10 01:13:33,555 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-01-10 01:13:33,555 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2025-01-10 01:13:33,556 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 440 transitions. [2025-01-10 01:13:33,556 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5493133583021224 [2025-01-10 01:13:33,556 INFO L175 Difference]: Start difference. First operand has 86 places, 79 transitions, 323 flow. Second operand 9 states and 440 transitions. [2025-01-10 01:13:33,556 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 94 places, 129 transitions, 673 flow [2025-01-10 01:13:33,557 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 91 places, 129 transitions, 666 flow, removed 0 selfloop flow, removed 3 redundant places. [2025-01-10 01:13:33,558 INFO L231 Difference]: Finished difference. Result has 93 places, 81 transitions, 378 flow [2025-01-10 01:13:33,559 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=89, PETRI_DIFFERENCE_MINUEND_FLOW=316, PETRI_DIFFERENCE_MINUEND_PLACES=83, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=79, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=21, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=56, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=378, PETRI_PLACES=93, PETRI_TRANSITIONS=81} [2025-01-10 01:13:33,559 INFO L279 CegarLoopForPetriNet]: 86 programPoint places, 7 predicate places. [2025-01-10 01:13:33,559 INFO L471 AbstractCegarLoop]: Abstraction has has 93 places, 81 transitions, 378 flow [2025-01-10 01:13:33,559 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 38.333333333333336) internal successors, (460), 12 states have internal predecessors, (460), 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:13:33,560 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 01:13:33,560 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:13:33,566 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2025-01-10 01:13:33,760 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,8 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:13:33,761 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting thread2Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 52 more)] === [2025-01-10 01:13:33,761 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:13:33,761 INFO L85 PathProgramCache]: Analyzing trace with hash 2008862125, now seen corresponding path program 1 times [2025-01-10 01:13:33,761 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:13:33,761 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2607956] [2025-01-10 01:13:33,761 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:13:33,761 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:13:33,767 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-01-10 01:13:33,771 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-01-10 01:13:33,772 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:13:33,772 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:13:33,873 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-01-10 01:13:33,873 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:13:33,874 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2607956] [2025-01-10 01:13:33,874 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2607956] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 01:13:33,874 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2036292421] [2025-01-10 01:13:33,874 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:13:33,874 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:13:33,874 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 01:13:33,877 INFO L229 MonitoredProcess]: Starting monitored process 9 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:13:33,884 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2025-01-10 01:13:33,930 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-01-10 01:13:33,948 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-01-10 01:13:33,948 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:13:33,948 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:13:33,949 INFO L256 TraceCheckSpWp]: Trace formula consists of 229 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-01-10 01:13:33,950 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 01:13:34,010 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-01-10 01:13:34,011 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 01:13:34,091 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-01-10 01:13:34,091 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2036292421] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-10 01:13:34,091 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-10 01:13:34,091 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 11 [2025-01-10 01:13:34,091 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2120726506] [2025-01-10 01:13:34,091 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-10 01:13:34,091 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-01-10 01:13:34,091 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:13:34,091 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-01-10 01:13:34,091 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=88, Unknown=0, NotChecked=0, Total=132 [2025-01-10 01:13:34,185 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 36 out of 89 [2025-01-10 01:13:34,185 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 93 places, 81 transitions, 378 flow. Second operand has 12 states, 12 states have (on average 38.583333333333336) internal successors, (463), 12 states have internal predecessors, (463), 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:13:34,185 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 01:13:34,185 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 36 of 89 [2025-01-10 01:13:34,185 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 01:13:34,554 INFO L124 PetriNetUnfolderBase]: 3247/5200 cut-off events. [2025-01-10 01:13:34,554 INFO L125 PetriNetUnfolderBase]: For 910/1036 co-relation queries the response was YES. [2025-01-10 01:13:34,561 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10448 conditions, 5200 events. 3247/5200 cut-off events. For 910/1036 co-relation queries the response was YES. Maximal size of possible extension queue 288. Compared 30902 event pairs, 2162 based on Foata normal form. 0/3886 useless extension candidates. Maximal degree in co-relation 9202. Up to 3506 conditions per place. [2025-01-10 01:13:34,571 INFO L140 encePairwiseOnDemand]: 76/89 looper letters, 79 selfloop transitions, 23 changer transitions 0/116 dead transitions. [2025-01-10 01:13:34,571 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 101 places, 116 transitions, 680 flow [2025-01-10 01:13:34,571 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-01-10 01:13:34,571 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2025-01-10 01:13:34,572 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 427 transitions. [2025-01-10 01:13:34,572 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.533083645443196 [2025-01-10 01:13:34,572 INFO L175 Difference]: Start difference. First operand has 93 places, 81 transitions, 378 flow. Second operand 9 states and 427 transitions. [2025-01-10 01:13:34,572 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 101 places, 116 transitions, 680 flow [2025-01-10 01:13:34,575 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 95 places, 116 transitions, 640 flow, removed 0 selfloop flow, removed 6 redundant places. [2025-01-10 01:13:34,576 INFO L231 Difference]: Finished difference. Result has 97 places, 83 transitions, 400 flow [2025-01-10 01:13:34,576 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=89, PETRI_DIFFERENCE_MINUEND_FLOW=338, PETRI_DIFFERENCE_MINUEND_PLACES=87, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=81, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=21, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=58, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=400, PETRI_PLACES=97, PETRI_TRANSITIONS=83} [2025-01-10 01:13:34,577 INFO L279 CegarLoopForPetriNet]: 86 programPoint places, 11 predicate places. [2025-01-10 01:13:34,577 INFO L471 AbstractCegarLoop]: Abstraction has has 97 places, 83 transitions, 400 flow [2025-01-10 01:13:34,577 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 38.583333333333336) internal successors, (463), 12 states have internal predecessors, (463), 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:13:34,577 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 01:13:34,577 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:13:34,591 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2025-01-10 01:13:34,777 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13,9 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:13:34,778 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting thread3Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 52 more)] === [2025-01-10 01:13:34,778 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:13:34,778 INFO L85 PathProgramCache]: Analyzing trace with hash -523800224, now seen corresponding path program 1 times [2025-01-10 01:13:34,779 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:13:34,779 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [933992694] [2025-01-10 01:13:34,779 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:13:34,779 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:13:34,787 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-01-10 01:13:34,792 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-01-10 01:13:34,792 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:13:34,792 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:13:34,836 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-01-10 01:13:34,836 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:13:34,836 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [933992694] [2025-01-10 01:13:34,836 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [933992694] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 01:13:34,836 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 01:13:34,836 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-10 01:13:34,836 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [964235286] [2025-01-10 01:13:34,836 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 01:13:34,836 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-10 01:13:34,837 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:13:34,837 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-10 01:13:34,837 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-10 01:13:34,874 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 34 out of 89 [2025-01-10 01:13:34,874 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 97 places, 83 transitions, 400 flow. Second operand has 4 states, 4 states have (on average 39.0) internal successors, (156), 4 states have internal predecessors, (156), 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:13:34,874 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 01:13:34,874 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 34 of 89 [2025-01-10 01:13:34,874 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 01:13:35,082 INFO L124 PetriNetUnfolderBase]: 2458/3867 cut-off events. [2025-01-10 01:13:35,082 INFO L125 PetriNetUnfolderBase]: For 1303/1404 co-relation queries the response was YES. [2025-01-10 01:13:35,088 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8592 conditions, 3867 events. 2458/3867 cut-off events. For 1303/1404 co-relation queries the response was YES. Maximal size of possible extension queue 251. Compared 22036 event pairs, 1866 based on Foata normal form. 0/3093 useless extension candidates. Maximal degree in co-relation 7333. Up to 3348 conditions per place. [2025-01-10 01:13:35,098 INFO L140 encePairwiseOnDemand]: 85/89 looper letters, 62 selfloop transitions, 4 changer transitions 0/81 dead transitions. [2025-01-10 01:13:35,098 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 98 places, 81 transitions, 528 flow [2025-01-10 01:13:35,099 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-10 01:13:35,099 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-01-10 01:13:35,099 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 182 transitions. [2025-01-10 01:13:35,100 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5112359550561798 [2025-01-10 01:13:35,100 INFO L175 Difference]: Start difference. First operand has 97 places, 83 transitions, 400 flow. Second operand 4 states and 182 transitions. [2025-01-10 01:13:35,100 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 98 places, 81 transitions, 528 flow [2025-01-10 01:13:35,103 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 92 places, 81 transitions, 488 flow, removed 0 selfloop flow, removed 6 redundant places. [2025-01-10 01:13:35,104 INFO L231 Difference]: Finished difference. Result has 92 places, 81 transitions, 364 flow [2025-01-10 01:13:35,104 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=89, PETRI_DIFFERENCE_MINUEND_FLOW=356, PETRI_DIFFERENCE_MINUEND_PLACES=89, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=81, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=77, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=364, PETRI_PLACES=92, PETRI_TRANSITIONS=81} [2025-01-10 01:13:35,104 INFO L279 CegarLoopForPetriNet]: 86 programPoint places, 6 predicate places. [2025-01-10 01:13:35,104 INFO L471 AbstractCegarLoop]: Abstraction has has 92 places, 81 transitions, 364 flow [2025-01-10 01:13:35,104 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 39.0) internal successors, (156), 4 states have internal predecessors, (156), 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:13:35,104 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 01:13:35,104 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:13:35,104 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-01-10 01:13:35,104 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 52 more)] === [2025-01-10 01:13:35,105 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:13:35,105 INFO L85 PathProgramCache]: Analyzing trace with hash -172419327, now seen corresponding path program 2 times [2025-01-10 01:13:35,105 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:13:35,105 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [968676223] [2025-01-10 01:13:35,105 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-10 01:13:35,105 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:13:35,114 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 24 statements into 2 equivalence classes. [2025-01-10 01:13:35,128 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 12 of 24 statements. [2025-01-10 01:13:35,128 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-01-10 01:13:35,129 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:13:35,342 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-01-10 01:13:35,342 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:13:35,342 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [968676223] [2025-01-10 01:13:35,342 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [968676223] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 01:13:35,342 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 01:13:35,342 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-10 01:13:35,342 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1257669080] [2025-01-10 01:13:35,342 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 01:13:35,342 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-01-10 01:13:35,342 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:13:35,343 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-01-10 01:13:35,343 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2025-01-10 01:13:35,557 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 23 out of 89 [2025-01-10 01:13:35,557 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 92 places, 81 transitions, 364 flow. Second operand has 8 states, 8 states have (on average 25.25) internal successors, (202), 8 states have internal predecessors, (202), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:13:35,557 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 01:13:35,557 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 23 of 89 [2025-01-10 01:13:35,557 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 01:13:36,100 INFO L124 PetriNetUnfolderBase]: 5216/8143 cut-off events. [2025-01-10 01:13:36,101 INFO L125 PetriNetUnfolderBase]: For 1568/1777 co-relation queries the response was YES. [2025-01-10 01:13:36,116 INFO L83 FinitePrefix]: Finished finitePrefix Result has 17442 conditions, 8143 events. 5216/8143 cut-off events. For 1568/1777 co-relation queries the response was YES. Maximal size of possible extension queue 368. Compared 51599 event pairs, 1650 based on Foata normal form. 0/6023 useless extension candidates. Maximal degree in co-relation 16168. Up to 4539 conditions per place. [2025-01-10 01:13:36,141 INFO L140 encePairwiseOnDemand]: 80/89 looper letters, 105 selfloop transitions, 12 changer transitions 0/127 dead transitions. [2025-01-10 01:13:36,142 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 98 places, 127 transitions, 714 flow [2025-01-10 01:13:36,142 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-01-10 01:13:36,142 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-01-10 01:13:36,143 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 256 transitions. [2025-01-10 01:13:36,143 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.41091492776886035 [2025-01-10 01:13:36,143 INFO L175 Difference]: Start difference. First operand has 92 places, 81 transitions, 364 flow. Second operand 7 states and 256 transitions. [2025-01-10 01:13:36,143 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 98 places, 127 transitions, 714 flow [2025-01-10 01:13:36,147 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 96 places, 127 transitions, 709 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-10 01:13:36,148 INFO L231 Difference]: Finished difference. Result has 98 places, 84 transitions, 410 flow [2025-01-10 01:13:36,148 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=89, PETRI_DIFFERENCE_MINUEND_FLOW=359, PETRI_DIFFERENCE_MINUEND_PLACES=90, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=81, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=69, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=410, PETRI_PLACES=98, PETRI_TRANSITIONS=84} [2025-01-10 01:13:36,148 INFO L279 CegarLoopForPetriNet]: 86 programPoint places, 12 predicate places. [2025-01-10 01:13:36,149 INFO L471 AbstractCegarLoop]: Abstraction has has 98 places, 84 transitions, 410 flow [2025-01-10 01:13:36,149 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 25.25) internal successors, (202), 8 states have internal predecessors, (202), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:13:36,149 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 01:13:36,149 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:13:36,149 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-01-10 01:13:36,149 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting thread3Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 52 more)] === [2025-01-10 01:13:36,150 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:13:36,150 INFO L85 PathProgramCache]: Analyzing trace with hash -523800223, now seen corresponding path program 1 times [2025-01-10 01:13:36,150 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:13:36,150 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [753129915] [2025-01-10 01:13:36,150 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:13:36,151 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:13:36,158 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-01-10 01:13:36,165 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-01-10 01:13:36,165 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:13:36,165 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:13:36,261 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-01-10 01:13:36,261 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:13:36,261 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [753129915] [2025-01-10 01:13:36,261 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [753129915] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 01:13:36,261 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1960534450] [2025-01-10 01:13:36,261 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:13:36,261 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:13:36,262 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 01:13:36,264 INFO L229 MonitoredProcess]: Starting monitored process 10 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:13:36,267 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2025-01-10 01:13:36,319 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-01-10 01:13:36,339 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-01-10 01:13:36,340 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:13:36,340 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:13:36,341 INFO L256 TraceCheckSpWp]: Trace formula consists of 250 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-01-10 01:13:36,342 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 01:13:36,427 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-01-10 01:13:36,428 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 01:13:36,516 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-01-10 01:13:36,516 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1960534450] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-10 01:13:36,516 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-10 01:13:36,516 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 11 [2025-01-10 01:13:36,517 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1779195605] [2025-01-10 01:13:36,517 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-10 01:13:36,517 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-01-10 01:13:36,518 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:13:36,518 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-01-10 01:13:36,519 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=88, Unknown=0, NotChecked=0, Total=132 [2025-01-10 01:13:36,631 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 36 out of 89 [2025-01-10 01:13:36,632 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 98 places, 84 transitions, 410 flow. Second operand has 12 states, 12 states have (on average 38.75) internal successors, (465), 12 states have internal predecessors, (465), 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:13:36,632 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 01:13:36,632 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 36 of 89 [2025-01-10 01:13:36,632 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 01:13:37,245 INFO L124 PetriNetUnfolderBase]: 4044/6506 cut-off events. [2025-01-10 01:13:37,245 INFO L125 PetriNetUnfolderBase]: For 2894/3387 co-relation queries the response was YES. [2025-01-10 01:13:37,254 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14504 conditions, 6506 events. 4044/6506 cut-off events. For 2894/3387 co-relation queries the response was YES. Maximal size of possible extension queue 275. Compared 40903 event pairs, 2375 based on Foata normal form. 98/5039 useless extension candidates. Maximal degree in co-relation 13665. Up to 4274 conditions per place. [2025-01-10 01:13:37,268 INFO L140 encePairwiseOnDemand]: 76/89 looper letters, 91 selfloop transitions, 23 changer transitions 0/129 dead transitions. [2025-01-10 01:13:37,268 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 107 places, 129 transitions, 795 flow [2025-01-10 01:13:37,269 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-01-10 01:13:37,269 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2025-01-10 01:13:37,270 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 471 transitions. [2025-01-10 01:13:37,270 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5292134831460674 [2025-01-10 01:13:37,270 INFO L175 Difference]: Start difference. First operand has 98 places, 84 transitions, 410 flow. Second operand 10 states and 471 transitions. [2025-01-10 01:13:37,270 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 107 places, 129 transitions, 795 flow [2025-01-10 01:13:37,274 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 103 places, 129 transitions, 767 flow, removed 3 selfloop flow, removed 4 redundant places. [2025-01-10 01:13:37,276 INFO L231 Difference]: Finished difference. Result has 106 places, 86 transitions, 462 flow [2025-01-10 01:13:37,276 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=89, PETRI_DIFFERENCE_MINUEND_FLOW=389, PETRI_DIFFERENCE_MINUEND_PLACES=94, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=84, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=21, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=61, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=462, PETRI_PLACES=106, PETRI_TRANSITIONS=86} [2025-01-10 01:13:37,276 INFO L279 CegarLoopForPetriNet]: 86 programPoint places, 20 predicate places. [2025-01-10 01:13:37,277 INFO L471 AbstractCegarLoop]: Abstraction has has 106 places, 86 transitions, 462 flow [2025-01-10 01:13:37,277 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 38.75) internal successors, (465), 12 states have internal predecessors, (465), 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:13:37,278 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 01:13:37,278 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:13:37,284 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2025-01-10 01:13:37,479 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16,10 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:13:37,480 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting thread1Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 52 more)] === [2025-01-10 01:13:37,480 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:13:37,480 INFO L85 PathProgramCache]: Analyzing trace with hash 1808778181, now seen corresponding path program 1 times [2025-01-10 01:13:37,480 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:13:37,480 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2055052410] [2025-01-10 01:13:37,480 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:13:37,480 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:13:37,498 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-01-10 01:13:37,509 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-01-10 01:13:37,509 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:13:37,509 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:13:37,794 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-01-10 01:13:37,795 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:13:37,795 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2055052410] [2025-01-10 01:13:37,795 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2055052410] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 01:13:37,795 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [690613864] [2025-01-10 01:13:37,795 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:13:37,795 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:13:37,795 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 01:13:37,800 INFO L229 MonitoredProcess]: Starting monitored process 11 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:13:37,802 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2025-01-10 01:13:37,886 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-01-10 01:13:37,928 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-01-10 01:13:37,929 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:13:37,929 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:13:37,931 INFO L256 TraceCheckSpWp]: Trace formula consists of 259 conjuncts, 37 conjuncts are in the unsatisfiable core [2025-01-10 01:13:37,936 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 01:13:37,961 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2025-01-10 01:13:38,005 INFO L349 Elim1Store]: treesize reduction 17, result has 22.7 percent of original size [2025-01-10 01:13:38,005 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 16 treesize of output 18 [2025-01-10 01:13:38,371 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-01-10 01:13:38,371 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 01:13:38,588 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2025-01-10 01:13:38,588 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [690613864] provided 1 perfect and 1 imperfect interpolant sequences [2025-01-10 01:13:38,588 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-01-10 01:13:38,588 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [8, 8] total 22 [2025-01-10 01:13:38,588 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [133051793] [2025-01-10 01:13:38,588 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 01:13:38,589 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-01-10 01:13:38,589 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:13:38,592 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-01-10 01:13:38,592 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=92, Invalid=414, Unknown=0, NotChecked=0, Total=506 [2025-01-10 01:13:38,817 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 34 out of 89 [2025-01-10 01:13:38,818 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 106 places, 86 transitions, 462 flow. Second operand has 8 states, 8 states have (on average 36.375) internal successors, (291), 8 states have internal predecessors, (291), 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:13:38,818 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 01:13:38,818 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 34 of 89 [2025-01-10 01:13:38,818 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 01:13:39,435 INFO L124 PetriNetUnfolderBase]: 4301/6472 cut-off events. [2025-01-10 01:13:39,435 INFO L125 PetriNetUnfolderBase]: For 2333/2639 co-relation queries the response was YES. [2025-01-10 01:13:39,445 INFO L83 FinitePrefix]: Finished finitePrefix Result has 15261 conditions, 6472 events. 4301/6472 cut-off events. For 2333/2639 co-relation queries the response was YES. Maximal size of possible extension queue 301. Compared 36771 event pairs, 1423 based on Foata normal form. 14/5036 useless extension candidates. Maximal degree in co-relation 14370. Up to 3206 conditions per place. [2025-01-10 01:13:39,461 INFO L140 encePairwiseOnDemand]: 78/89 looper letters, 92 selfloop transitions, 15 changer transitions 0/120 dead transitions. [2025-01-10 01:13:39,461 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 113 places, 120 transitions, 767 flow [2025-01-10 01:13:39,462 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-01-10 01:13:39,462 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2025-01-10 01:13:39,464 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 400 transitions. [2025-01-10 01:13:39,465 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4993757802746567 [2025-01-10 01:13:39,465 INFO L175 Difference]: Start difference. First operand has 106 places, 86 transitions, 462 flow. Second operand 9 states and 400 transitions. [2025-01-10 01:13:39,465 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 113 places, 120 transitions, 767 flow [2025-01-10 01:13:39,472 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 108 places, 120 transitions, 739 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-01-10 01:13:39,473 INFO L231 Difference]: Finished difference. Result has 111 places, 87 transitions, 485 flow [2025-01-10 01:13:39,473 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=89, PETRI_DIFFERENCE_MINUEND_FLOW=432, PETRI_DIFFERENCE_MINUEND_PLACES=100, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=85, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=70, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=485, PETRI_PLACES=111, PETRI_TRANSITIONS=87} [2025-01-10 01:13:39,474 INFO L279 CegarLoopForPetriNet]: 86 programPoint places, 25 predicate places. [2025-01-10 01:13:39,474 INFO L471 AbstractCegarLoop]: Abstraction has has 111 places, 87 transitions, 485 flow [2025-01-10 01:13:39,474 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 36.375) internal successors, (291), 8 states have internal predecessors, (291), 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:13:39,474 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 01:13:39,474 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:13:39,481 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2025-01-10 01:13:39,679 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2025-01-10 01:13:39,679 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting thread2Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 52 more)] === [2025-01-10 01:13:39,680 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:13:39,680 INFO L85 PathProgramCache]: Analyzing trace with hash 1737266772, now seen corresponding path program 2 times [2025-01-10 01:13:39,680 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:13:39,680 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1163696962] [2025-01-10 01:13:39,680 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-10 01:13:39,680 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:13:39,691 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 26 statements into 2 equivalence classes. [2025-01-10 01:13:39,708 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 14 of 26 statements. [2025-01-10 01:13:39,709 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-01-10 01:13:39,709 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:13:40,119 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-01-10 01:13:40,119 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:13:40,119 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1163696962] [2025-01-10 01:13:40,119 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1163696962] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 01:13:40,119 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 01:13:40,119 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-01-10 01:13:40,119 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1841660192] [2025-01-10 01:13:40,119 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 01:13:40,120 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-01-10 01:13:40,120 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:13:40,120 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-01-10 01:13:40,121 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2025-01-10 01:13:40,386 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 25 out of 89 [2025-01-10 01:13:40,386 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 111 places, 87 transitions, 485 flow. Second operand has 9 states, 9 states have (on average 27.22222222222222) internal successors, (245), 9 states have internal predecessors, (245), 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:13:40,386 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 01:13:40,386 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 25 of 89 [2025-01-10 01:13:40,386 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 01:13:41,482 INFO L124 PetriNetUnfolderBase]: 7548/10859 cut-off events. [2025-01-10 01:13:41,482 INFO L125 PetriNetUnfolderBase]: For 8317/8739 co-relation queries the response was YES. [2025-01-10 01:13:41,513 INFO L83 FinitePrefix]: Finished finitePrefix Result has 27171 conditions, 10859 events. 7548/10859 cut-off events. For 8317/8739 co-relation queries the response was YES. Maximal size of possible extension queue 421. Compared 61779 event pairs, 2983 based on Foata normal form. 172/8216 useless extension candidates. Maximal degree in co-relation 26278. Up to 6305 conditions per place. [2025-01-10 01:13:41,543 INFO L140 encePairwiseOnDemand]: 81/89 looper letters, 114 selfloop transitions, 12 changer transitions 0/139 dead transitions. [2025-01-10 01:13:41,543 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 117 places, 139 transitions, 937 flow [2025-01-10 01:13:41,544 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-01-10 01:13:41,544 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-01-10 01:13:41,544 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 267 transitions. [2025-01-10 01:13:41,544 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.42857142857142855 [2025-01-10 01:13:41,544 INFO L175 Difference]: Start difference. First operand has 111 places, 87 transitions, 485 flow. Second operand 7 states and 267 transitions. [2025-01-10 01:13:41,544 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 117 places, 139 transitions, 937 flow [2025-01-10 01:13:41,552 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 112 places, 139 transitions, 910 flow, removed 3 selfloop flow, removed 5 redundant places. [2025-01-10 01:13:41,553 INFO L231 Difference]: Finished difference. Result has 114 places, 90 transitions, 513 flow [2025-01-10 01:13:41,553 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=89, PETRI_DIFFERENCE_MINUEND_FLOW=464, PETRI_DIFFERENCE_MINUEND_PLACES=106, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=87, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=513, PETRI_PLACES=114, PETRI_TRANSITIONS=90} [2025-01-10 01:13:41,553 INFO L279 CegarLoopForPetriNet]: 86 programPoint places, 28 predicate places. [2025-01-10 01:13:41,553 INFO L471 AbstractCegarLoop]: Abstraction has has 114 places, 90 transitions, 513 flow [2025-01-10 01:13:41,554 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 27.22222222222222) internal successors, (245), 9 states have internal predecessors, (245), 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:13:41,554 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 01:13:41,554 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:13:41,554 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-01-10 01:13:41,554 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting thread2Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 52 more)] === [2025-01-10 01:13:41,554 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:13:41,554 INFO L85 PathProgramCache]: Analyzing trace with hash 1737266774, now seen corresponding path program 1 times [2025-01-10 01:13:41,555 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:13:41,555 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1737968058] [2025-01-10 01:13:41,555 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:13:41,555 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:13:41,564 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-01-10 01:13:41,575 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-01-10 01:13:41,575 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:13:41,575 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:13:41,797 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-01-10 01:13:41,797 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:13:41,798 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1737968058] [2025-01-10 01:13:41,798 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1737968058] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 01:13:41,798 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2053848537] [2025-01-10 01:13:41,798 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:13:41,798 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:13:41,799 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 01:13:41,801 INFO L229 MonitoredProcess]: Starting monitored process 12 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:13:41,801 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2025-01-10 01:13:41,860 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-01-10 01:13:41,884 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-01-10 01:13:41,885 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:13:41,885 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:13:41,886 INFO L256 TraceCheckSpWp]: Trace formula consists of 274 conjuncts, 16 conjuncts are in the unsatisfiable core [2025-01-10 01:13:41,889 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 01:13:41,894 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 6 treesize of output 5 [2025-01-10 01:13:41,953 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-10 01:13:41,953 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2025-01-10 01:13:41,960 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-01-10 01:13:41,961 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2025-01-10 01:13:42,029 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2025-01-10 01:13:42,029 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 01:13:42,146 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 29 [2025-01-10 01:13:42,213 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2025-01-10 01:13:42,214 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2053848537] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-10 01:13:42,214 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-10 01:13:42,214 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7, 7] total 21 [2025-01-10 01:13:42,214 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1857313858] [2025-01-10 01:13:42,214 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-10 01:13:42,214 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2025-01-10 01:13:42,214 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:13:42,214 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2025-01-10 01:13:42,215 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=72, Invalid=390, Unknown=0, NotChecked=0, Total=462 [2025-01-10 01:13:43,312 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 31 out of 89 [2025-01-10 01:13:43,313 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 114 places, 90 transitions, 513 flow. Second operand has 22 states, 22 states have (on average 33.68181818181818) internal successors, (741), 22 states have internal predecessors, (741), 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:13:43,313 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 01:13:43,313 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 31 of 89 [2025-01-10 01:13:43,313 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 01:13:44,520 INFO L124 PetriNetUnfolderBase]: 5853/8808 cut-off events. [2025-01-10 01:13:44,521 INFO L125 PetriNetUnfolderBase]: For 8293/9043 co-relation queries the response was YES. [2025-01-10 01:13:44,545 INFO L83 FinitePrefix]: Finished finitePrefix Result has 24103 conditions, 8808 events. 5853/8808 cut-off events. For 8293/9043 co-relation queries the response was YES. Maximal size of possible extension queue 380. Compared 53020 event pairs, 2155 based on Foata normal form. 148/7343 useless extension candidates. Maximal degree in co-relation 23155. Up to 3966 conditions per place. [2025-01-10 01:13:44,572 INFO L140 encePairwiseOnDemand]: 75/89 looper letters, 122 selfloop transitions, 24 changer transitions 0/161 dead transitions. [2025-01-10 01:13:44,572 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 128 places, 161 transitions, 1095 flow [2025-01-10 01:13:44,573 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-01-10 01:13:44,573 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2025-01-10 01:13:44,573 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 589 transitions. [2025-01-10 01:13:44,574 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4411985018726592 [2025-01-10 01:13:44,574 INFO L175 Difference]: Start difference. First operand has 114 places, 90 transitions, 513 flow. Second operand 15 states and 589 transitions. [2025-01-10 01:13:44,574 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 128 places, 161 transitions, 1095 flow [2025-01-10 01:13:44,597 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 124 places, 161 transitions, 1072 flow, removed 2 selfloop flow, removed 4 redundant places. [2025-01-10 01:13:44,598 INFO L231 Difference]: Finished difference. Result has 126 places, 94 transitions, 585 flow [2025-01-10 01:13:44,598 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=89, PETRI_DIFFERENCE_MINUEND_FLOW=492, PETRI_DIFFERENCE_MINUEND_PLACES=110, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=90, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=20, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=66, PETRI_DIFFERENCE_SUBTRAHEND_STATES=15, PETRI_FLOW=585, PETRI_PLACES=126, PETRI_TRANSITIONS=94} [2025-01-10 01:13:44,599 INFO L279 CegarLoopForPetriNet]: 86 programPoint places, 40 predicate places. [2025-01-10 01:13:44,599 INFO L471 AbstractCegarLoop]: Abstraction has has 126 places, 94 transitions, 585 flow [2025-01-10 01:13:44,599 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 22 states have (on average 33.68181818181818) internal successors, (741), 22 states have internal predecessors, (741), 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:13:44,599 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 01:13:44,599 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:13:44,605 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Ended with exit code 0 [2025-01-10 01:13:44,800 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,12 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:13:44,800 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting thread2Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 52 more)] === [2025-01-10 01:13:44,801 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:13:44,801 INFO L85 PathProgramCache]: Analyzing trace with hash 1737266776, now seen corresponding path program 1 times [2025-01-10 01:13:44,801 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:13:44,801 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1866532092] [2025-01-10 01:13:44,801 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:13:44,801 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:13:44,806 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-01-10 01:13:44,811 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-01-10 01:13:44,811 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:13:44,811 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:13:44,935 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2025-01-10 01:13:44,936 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:13:44,936 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1866532092] [2025-01-10 01:13:44,936 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1866532092] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 01:13:44,936 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [971739955] [2025-01-10 01:13:44,936 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:13:44,936 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:13:44,936 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 01:13:44,938 INFO L229 MonitoredProcess]: Starting monitored process 13 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:13:44,939 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2025-01-10 01:13:44,993 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-01-10 01:13:45,021 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-01-10 01:13:45,021 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:13:45,021 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:13:45,022 INFO L256 TraceCheckSpWp]: Trace formula consists of 288 conjuncts, 15 conjuncts are in the unsatisfiable core [2025-01-10 01:13:45,023 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 01:13:45,102 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2025-01-10 01:13:45,103 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 01:13:45,162 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 20 [2025-01-10 01:13:45,197 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2025-01-10 01:13:45,197 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [971739955] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-10 01:13:45,197 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-10 01:13:45,197 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 16 [2025-01-10 01:13:45,197 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [659783403] [2025-01-10 01:13:45,197 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-10 01:13:45,198 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2025-01-10 01:13:45,198 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:13:45,198 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2025-01-10 01:13:45,198 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=216, Unknown=0, NotChecked=0, Total=272 [2025-01-10 01:13:45,531 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 37 out of 89 [2025-01-10 01:13:45,532 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 126 places, 94 transitions, 585 flow. Second operand has 17 states, 17 states have (on average 39.8235294117647) internal successors, (677), 17 states have internal predecessors, (677), 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:13:45,532 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 01:13:45,532 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 37 of 89 [2025-01-10 01:13:45,532 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 01:13:46,294 INFO L124 PetriNetUnfolderBase]: 4686/7386 cut-off events. [2025-01-10 01:13:46,294 INFO L125 PetriNetUnfolderBase]: For 8492/8941 co-relation queries the response was YES. [2025-01-10 01:13:46,308 INFO L83 FinitePrefix]: Finished finitePrefix Result has 21670 conditions, 7386 events. 4686/7386 cut-off events. For 8492/8941 co-relation queries the response was YES. Maximal size of possible extension queue 310. Compared 45898 event pairs, 2200 based on Foata normal form. 141/6483 useless extension candidates. Maximal degree in co-relation 20687. Up to 3872 conditions per place. [2025-01-10 01:13:46,327 INFO L140 encePairwiseOnDemand]: 77/89 looper letters, 109 selfloop transitions, 21 changer transitions 0/147 dead transitions. [2025-01-10 01:13:46,327 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 133 places, 147 transitions, 1037 flow [2025-01-10 01:13:46,328 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-01-10 01:13:46,328 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2025-01-10 01:13:46,328 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 414 transitions. [2025-01-10 01:13:46,328 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5814606741573034 [2025-01-10 01:13:46,328 INFO L175 Difference]: Start difference. First operand has 126 places, 94 transitions, 585 flow. Second operand 8 states and 414 transitions. [2025-01-10 01:13:46,329 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 133 places, 147 transitions, 1037 flow [2025-01-10 01:13:46,344 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 128 places, 147 transitions, 1016 flow, removed 1 selfloop flow, removed 5 redundant places. [2025-01-10 01:13:46,346 INFO L231 Difference]: Finished difference. Result has 128 places, 93 transitions, 602 flow [2025-01-10 01:13:46,346 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=89, PETRI_DIFFERENCE_MINUEND_FLOW=560, PETRI_DIFFERENCE_MINUEND_PLACES=121, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=93, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=21, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=72, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=602, PETRI_PLACES=128, PETRI_TRANSITIONS=93} [2025-01-10 01:13:46,346 INFO L279 CegarLoopForPetriNet]: 86 programPoint places, 42 predicate places. [2025-01-10 01:13:46,346 INFO L471 AbstractCegarLoop]: Abstraction has has 128 places, 93 transitions, 602 flow [2025-01-10 01:13:46,346 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 39.8235294117647) internal successors, (677), 17 states have internal predecessors, (677), 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:13:46,346 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 01:13:46,347 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:13:46,352 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Ended with exit code 0 [2025-01-10 01:13:46,547 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,13 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:13:46,547 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting thread2Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 52 more)] === [2025-01-10 01:13:46,547 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:13:46,547 INFO L85 PathProgramCache]: Analyzing trace with hash 559553065, now seen corresponding path program 1 times [2025-01-10 01:13:46,547 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:13:46,548 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [464045866] [2025-01-10 01:13:46,548 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:13:46,548 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:13:46,554 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 29 statements into 1 equivalence classes. [2025-01-10 01:13:46,559 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 29 of 29 statements. [2025-01-10 01:13:46,559 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:13:46,559 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:13:46,666 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2025-01-10 01:13:46,667 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:13:46,667 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [464045866] [2025-01-10 01:13:46,667 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [464045866] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 01:13:46,667 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [115903276] [2025-01-10 01:13:46,667 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:13:46,667 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:13:46,667 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 01:13:46,669 INFO L229 MonitoredProcess]: Starting monitored process 14 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:13:46,671 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2025-01-10 01:13:46,722 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 29 statements into 1 equivalence classes. [2025-01-10 01:13:46,747 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 29 of 29 statements. [2025-01-10 01:13:46,747 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:13:46,747 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:13:46,750 INFO L256 TraceCheckSpWp]: Trace formula consists of 315 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-01-10 01:13:46,751 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 01:13:46,842 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2025-01-10 01:13:46,842 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 01:13:46,922 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2025-01-10 01:13:46,922 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [115903276] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-10 01:13:46,922 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-10 01:13:46,922 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 16 [2025-01-10 01:13:46,923 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1302255633] [2025-01-10 01:13:46,923 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-10 01:13:46,923 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2025-01-10 01:13:46,923 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:13:46,924 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2025-01-10 01:13:46,924 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=80, Invalid=192, Unknown=0, NotChecked=0, Total=272 [2025-01-10 01:13:47,005 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 36 out of 89 [2025-01-10 01:13:47,006 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 128 places, 93 transitions, 602 flow. Second operand has 17 states, 17 states have (on average 38.64705882352941) internal successors, (657), 17 states have internal predecessors, (657), 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:13:47,006 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 01:13:47,006 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 36 of 89 [2025-01-10 01:13:47,006 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 01:13:48,002 INFO L124 PetriNetUnfolderBase]: 8674/12828 cut-off events. [2025-01-10 01:13:48,002 INFO L125 PetriNetUnfolderBase]: For 21557/22135 co-relation queries the response was YES. [2025-01-10 01:13:48,049 INFO L83 FinitePrefix]: Finished finitePrefix Result has 39025 conditions, 12828 events. 8674/12828 cut-off events. For 21557/22135 co-relation queries the response was YES. Maximal size of possible extension queue 474. Compared 76798 event pairs, 4697 based on Foata normal form. 222/11291 useless extension candidates. Maximal degree in co-relation 23756. Up to 7126 conditions per place. [2025-01-10 01:13:48,095 INFO L140 encePairwiseOnDemand]: 75/89 looper letters, 137 selfloop transitions, 46 changer transitions 0/198 dead transitions. [2025-01-10 01:13:48,095 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 139 places, 198 transitions, 1555 flow [2025-01-10 01:13:48,095 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-01-10 01:13:48,095 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2025-01-10 01:13:48,096 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 584 transitions. [2025-01-10 01:13:48,096 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5468164794007491 [2025-01-10 01:13:48,096 INFO L175 Difference]: Start difference. First operand has 128 places, 93 transitions, 602 flow. Second operand 12 states and 584 transitions. [2025-01-10 01:13:48,096 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 139 places, 198 transitions, 1555 flow [2025-01-10 01:13:48,127 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 133 places, 198 transitions, 1492 flow, removed 2 selfloop flow, removed 6 redundant places. [2025-01-10 01:13:48,129 INFO L231 Difference]: Finished difference. Result has 137 places, 117 transitions, 934 flow [2025-01-10 01:13:48,129 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=89, PETRI_DIFFERENCE_MINUEND_FLOW=560, PETRI_DIFFERENCE_MINUEND_PLACES=122, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=93, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=25, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=63, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=934, PETRI_PLACES=137, PETRI_TRANSITIONS=117} [2025-01-10 01:13:48,129 INFO L279 CegarLoopForPetriNet]: 86 programPoint places, 51 predicate places. [2025-01-10 01:13:48,129 INFO L471 AbstractCegarLoop]: Abstraction has has 137 places, 117 transitions, 934 flow [2025-01-10 01:13:48,129 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 38.64705882352941) internal successors, (657), 17 states have internal predecessors, (657), 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:13:48,129 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 01:13:48,130 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:13:48,136 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Ended with exit code 0 [2025-01-10 01:13:48,334 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21,14 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:13:48,334 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting thread3Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 52 more)] === [2025-01-10 01:13:48,334 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:13:48,334 INFO L85 PathProgramCache]: Analyzing trace with hash 1554288264, now seen corresponding path program 2 times [2025-01-10 01:13:48,335 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:13:48,335 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1686506434] [2025-01-10 01:13:48,335 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-10 01:13:48,335 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:13:48,342 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 30 statements into 2 equivalence classes. [2025-01-10 01:13:48,347 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 18 of 30 statements. [2025-01-10 01:13:48,349 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-01-10 01:13:48,349 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:13:48,400 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-01-10 01:13:48,400 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:13:48,400 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1686506434] [2025-01-10 01:13:48,400 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1686506434] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 01:13:48,400 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 01:13:48,400 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-10 01:13:48,400 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [136753854] [2025-01-10 01:13:48,401 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 01:13:48,401 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-10 01:13:48,401 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:13:48,401 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-10 01:13:48,401 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-01-10 01:13:48,407 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 33 out of 89 [2025-01-10 01:13:48,407 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 137 places, 117 transitions, 934 flow. Second operand has 5 states, 5 states have (on average 37.4) internal successors, (187), 5 states have internal predecessors, (187), 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:13:48,407 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 01:13:48,407 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 33 of 89 [2025-01-10 01:13:48,407 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 01:13:49,447 INFO L124 PetriNetUnfolderBase]: 10622/15204 cut-off events. [2025-01-10 01:13:49,447 INFO L125 PetriNetUnfolderBase]: For 35600/37096 co-relation queries the response was YES. [2025-01-10 01:13:49,489 INFO L83 FinitePrefix]: Finished finitePrefix Result has 47897 conditions, 15204 events. 10622/15204 cut-off events. For 35600/37096 co-relation queries the response was YES. Maximal size of possible extension queue 520. Compared 87580 event pairs, 1536 based on Foata normal form. 724/14120 useless extension candidates. Maximal degree in co-relation 29159. Up to 8891 conditions per place. [2025-01-10 01:13:49,538 INFO L140 encePairwiseOnDemand]: 82/89 looper letters, 181 selfloop transitions, 15 changer transitions 0/209 dead transitions. [2025-01-10 01:13:49,538 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 142 places, 209 transitions, 1841 flow [2025-01-10 01:13:49,538 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-10 01:13:49,538 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-01-10 01:13:49,539 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 321 transitions. [2025-01-10 01:13:49,539 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.601123595505618 [2025-01-10 01:13:49,539 INFO L175 Difference]: Start difference. First operand has 137 places, 117 transitions, 934 flow. Second operand 6 states and 321 transitions. [2025-01-10 01:13:49,539 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 142 places, 209 transitions, 1841 flow [2025-01-10 01:13:49,572 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 141 places, 209 transitions, 1824 flow, removed 2 selfloop flow, removed 1 redundant places. [2025-01-10 01:13:49,574 INFO L231 Difference]: Finished difference. Result has 146 places, 124 transitions, 1011 flow [2025-01-10 01:13:49,575 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=89, PETRI_DIFFERENCE_MINUEND_FLOW=919, PETRI_DIFFERENCE_MINUEND_PLACES=136, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=117, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=105, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1011, PETRI_PLACES=146, PETRI_TRANSITIONS=124} [2025-01-10 01:13:49,575 INFO L279 CegarLoopForPetriNet]: 86 programPoint places, 60 predicate places. [2025-01-10 01:13:49,575 INFO L471 AbstractCegarLoop]: Abstraction has has 146 places, 124 transitions, 1011 flow [2025-01-10 01:13:49,575 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 37.4) internal successors, (187), 5 states have internal predecessors, (187), 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:13:49,575 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 01:13:49,575 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:13:49,576 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2025-01-10 01:13:49,576 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 52 more)] === [2025-01-10 01:13:49,576 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:13:49,576 INFO L85 PathProgramCache]: Analyzing trace with hash -1264797045, now seen corresponding path program 1 times [2025-01-10 01:13:49,576 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:13:49,576 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1021035786] [2025-01-10 01:13:49,576 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:13:49,576 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:13:49,582 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 30 statements into 1 equivalence classes. [2025-01-10 01:13:49,590 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 30 of 30 statements. [2025-01-10 01:13:49,590 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:13:49,590 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:13:49,666 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2025-01-10 01:13:49,667 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:13:49,667 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1021035786] [2025-01-10 01:13:49,667 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1021035786] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 01:13:49,667 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1892752671] [2025-01-10 01:13:49,667 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:13:49,667 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:13:49,667 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 01:13:49,669 INFO L229 MonitoredProcess]: Starting monitored process 15 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:13:49,670 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2025-01-10 01:13:49,724 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 30 statements into 1 equivalence classes. [2025-01-10 01:13:49,749 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 30 of 30 statements. [2025-01-10 01:13:49,750 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:13:49,750 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:13:49,753 INFO L256 TraceCheckSpWp]: Trace formula consists of 269 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-01-10 01:13:49,754 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 01:13:49,839 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2025-01-10 01:13:49,839 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 01:13:49,914 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2025-01-10 01:13:49,914 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1892752671] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-10 01:13:49,914 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-10 01:13:49,914 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 16 [2025-01-10 01:13:49,914 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1320901595] [2025-01-10 01:13:49,914 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-10 01:13:49,915 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2025-01-10 01:13:49,915 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:13:49,915 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2025-01-10 01:13:49,916 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=80, Invalid=192, Unknown=0, NotChecked=0, Total=272 [2025-01-10 01:13:50,048 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 36 out of 89 [2025-01-10 01:13:50,049 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 146 places, 124 transitions, 1011 flow. Second operand has 17 states, 17 states have (on average 38.64705882352941) internal successors, (657), 17 states have internal predecessors, (657), 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:13:50,049 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 01:13:50,049 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 36 of 89 [2025-01-10 01:13:50,049 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 01:13:51,055 INFO L124 PetriNetUnfolderBase]: 7291/11760 cut-off events. [2025-01-10 01:13:51,055 INFO L125 PetriNetUnfolderBase]: For 29082/29957 co-relation queries the response was YES. [2025-01-10 01:13:51,093 INFO L83 FinitePrefix]: Finished finitePrefix Result has 38676 conditions, 11760 events. 7291/11760 cut-off events. For 29082/29957 co-relation queries the response was YES. Maximal size of possible extension queue 398. Compared 76522 event pairs, 4404 based on Foata normal form. 322/10912 useless extension candidates. Maximal degree in co-relation 27371. Up to 7013 conditions per place. [2025-01-10 01:13:51,131 INFO L140 encePairwiseOnDemand]: 75/89 looper letters, 142 selfloop transitions, 44 changer transitions 0/205 dead transitions. [2025-01-10 01:13:51,131 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 157 places, 205 transitions, 1858 flow [2025-01-10 01:13:51,131 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-01-10 01:13:51,132 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2025-01-10 01:13:51,132 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 576 transitions. [2025-01-10 01:13:51,133 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5393258426966292 [2025-01-10 01:13:51,133 INFO L175 Difference]: Start difference. First operand has 146 places, 124 transitions, 1011 flow. Second operand 12 states and 576 transitions. [2025-01-10 01:13:51,133 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 157 places, 205 transitions, 1858 flow [2025-01-10 01:13:51,174 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 157 places, 205 transitions, 1850 flow, removed 4 selfloop flow, removed 0 redundant places. [2025-01-10 01:13:51,177 INFO L231 Difference]: Finished difference. Result has 160 places, 128 transitions, 1154 flow [2025-01-10 01:13:51,178 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=89, PETRI_DIFFERENCE_MINUEND_FLOW=1009, PETRI_DIFFERENCE_MINUEND_PLACES=146, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=124, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=40, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=80, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=1154, PETRI_PLACES=160, PETRI_TRANSITIONS=128} [2025-01-10 01:13:51,179 INFO L279 CegarLoopForPetriNet]: 86 programPoint places, 74 predicate places. [2025-01-10 01:13:51,179 INFO L471 AbstractCegarLoop]: Abstraction has has 160 places, 128 transitions, 1154 flow [2025-01-10 01:13:51,179 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 38.64705882352941) internal successors, (657), 17 states have internal predecessors, (657), 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:13:51,179 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 01:13:51,179 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:13:51,186 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Forceful destruction successful, exit code 0 [2025-01-10 01:13:51,384 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable23 [2025-01-10 01:13:51,384 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr14ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 52 more)] === [2025-01-10 01:13:51,385 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:13:51,385 INFO L85 PathProgramCache]: Analyzing trace with hash -351520305, now seen corresponding path program 1 times [2025-01-10 01:13:51,385 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:13:51,385 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1416828193] [2025-01-10 01:13:51,385 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:13:51,385 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:13:51,393 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 31 statements into 1 equivalence classes. [2025-01-10 01:13:51,397 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 31 of 31 statements. [2025-01-10 01:13:51,400 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:13:51,400 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:13:51,458 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-01-10 01:13:51,458 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:13:51,458 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1416828193] [2025-01-10 01:13:51,458 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1416828193] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 01:13:51,458 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 01:13:51,458 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-10 01:13:51,459 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1501825546] [2025-01-10 01:13:51,460 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 01:13:51,461 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-10 01:13:51,461 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:13:51,461 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-10 01:13:51,461 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-01-10 01:13:51,533 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 36 out of 89 [2025-01-10 01:13:51,534 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 160 places, 128 transitions, 1154 flow. Second operand has 6 states, 6 states have (on average 41.0) internal successors, (246), 6 states have internal predecessors, (246), 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:13:51,534 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 01:13:51,534 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 36 of 89 [2025-01-10 01:13:51,534 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 01:13:52,964 INFO L124 PetriNetUnfolderBase]: 10706/16983 cut-off events. [2025-01-10 01:13:52,964 INFO L125 PetriNetUnfolderBase]: For 48753/50716 co-relation queries the response was YES. [2025-01-10 01:13:53,021 INFO L83 FinitePrefix]: Finished finitePrefix Result has 58017 conditions, 16983 events. 10706/16983 cut-off events. For 48753/50716 co-relation queries the response was YES. Maximal size of possible extension queue 664. Compared 117759 event pairs, 1862 based on Foata normal form. 806/15991 useless extension candidates. Maximal degree in co-relation 40045. Up to 7497 conditions per place. [2025-01-10 01:13:53,072 INFO L140 encePairwiseOnDemand]: 79/89 looper letters, 166 selfloop transitions, 17 changer transitions 20/223 dead transitions. [2025-01-10 01:13:53,072 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 166 places, 223 transitions, 2145 flow [2025-01-10 01:13:53,072 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-01-10 01:13:53,072 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-01-10 01:13:53,073 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 368 transitions. [2025-01-10 01:13:53,073 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5906902086677368 [2025-01-10 01:13:53,073 INFO L175 Difference]: Start difference. First operand has 160 places, 128 transitions, 1154 flow. Second operand 7 states and 368 transitions. [2025-01-10 01:13:53,073 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 166 places, 223 transitions, 2145 flow [2025-01-10 01:13:53,128 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 158 places, 223 transitions, 2066 flow, removed 4 selfloop flow, removed 8 redundant places. [2025-01-10 01:13:53,131 INFO L231 Difference]: Finished difference. Result has 160 places, 122 transitions, 976 flow [2025-01-10 01:13:53,131 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=89, PETRI_DIFFERENCE_MINUEND_FLOW=1081, PETRI_DIFFERENCE_MINUEND_PLACES=152, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=128, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=117, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=976, PETRI_PLACES=160, PETRI_TRANSITIONS=122} [2025-01-10 01:13:53,132 INFO L279 CegarLoopForPetriNet]: 86 programPoint places, 74 predicate places. [2025-01-10 01:13:53,133 INFO L471 AbstractCegarLoop]: Abstraction has has 160 places, 122 transitions, 976 flow [2025-01-10 01:13:53,133 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 41.0) internal successors, (246), 6 states have internal predecessors, (246), 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:13:53,133 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 01:13:53,133 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:13:53,133 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2025-01-10 01:13:53,133 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting thread3Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 52 more)] === [2025-01-10 01:13:53,133 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:13:53,133 INFO L85 PathProgramCache]: Analyzing trace with hash 1106138593, now seen corresponding path program 1 times [2025-01-10 01:13:53,133 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:13:53,133 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1388663340] [2025-01-10 01:13:53,133 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:13:53,133 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:13:53,140 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 33 statements into 1 equivalence classes. [2025-01-10 01:13:53,147 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 33 of 33 statements. [2025-01-10 01:13:53,147 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:13:53,147 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:13:53,225 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-01-10 01:13:53,225 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:13:53,225 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1388663340] [2025-01-10 01:13:53,225 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1388663340] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 01:13:53,225 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 01:13:53,225 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-10 01:13:53,226 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [102443488] [2025-01-10 01:13:53,226 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 01:13:53,226 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-01-10 01:13:53,226 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:13:53,227 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-01-10 01:13:53,227 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-01-10 01:13:53,273 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 37 out of 89 [2025-01-10 01:13:53,274 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 160 places, 122 transitions, 976 flow. Second operand has 7 states, 7 states have (on average 40.142857142857146) internal successors, (281), 7 states have internal predecessors, (281), 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:13:53,274 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 01:13:53,274 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 37 of 89 [2025-01-10 01:13:53,274 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 01:13:55,245 INFO L124 PetriNetUnfolderBase]: 15398/24699 cut-off events. [2025-01-10 01:13:55,245 INFO L125 PetriNetUnfolderBase]: For 66778/68914 co-relation queries the response was YES. [2025-01-10 01:13:55,358 INFO L83 FinitePrefix]: Finished finitePrefix Result has 88643 conditions, 24699 events. 15398/24699 cut-off events. For 66778/68914 co-relation queries the response was YES. Maximal size of possible extension queue 1011. Compared 188915 event pairs, 4990 based on Foata normal form. 1063/23767 useless extension candidates. Maximal degree in co-relation 64372. Up to 11841 conditions per place. [2025-01-10 01:13:55,445 INFO L140 encePairwiseOnDemand]: 79/89 looper letters, 198 selfloop transitions, 28 changer transitions 0/247 dead transitions. [2025-01-10 01:13:55,446 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 157 places, 247 transitions, 2225 flow [2025-01-10 01:13:55,446 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-01-10 01:13:55,446 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2025-01-10 01:13:55,446 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 418 transitions. [2025-01-10 01:13:55,447 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5870786516853933 [2025-01-10 01:13:55,447 INFO L175 Difference]: Start difference. First operand has 160 places, 122 transitions, 976 flow. Second operand 8 states and 418 transitions. [2025-01-10 01:13:55,447 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 157 places, 247 transitions, 2225 flow [2025-01-10 01:13:55,690 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 135 places, 247 transitions, 1990 flow, removed 23 selfloop flow, removed 22 redundant places. [2025-01-10 01:13:55,692 INFO L231 Difference]: Finished difference. Result has 139 places, 140 transitions, 1087 flow [2025-01-10 01:13:55,693 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=89, PETRI_DIFFERENCE_MINUEND_FLOW=819, PETRI_DIFFERENCE_MINUEND_PLACES=128, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=122, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=101, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=1087, PETRI_PLACES=139, PETRI_TRANSITIONS=140} [2025-01-10 01:13:55,693 INFO L279 CegarLoopForPetriNet]: 86 programPoint places, 53 predicate places. [2025-01-10 01:13:55,693 INFO L471 AbstractCegarLoop]: Abstraction has has 139 places, 140 transitions, 1087 flow [2025-01-10 01:13:55,693 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 40.142857142857146) internal successors, (281), 7 states have internal predecessors, (281), 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:13:55,693 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 01:13:55,694 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:13:55,694 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2025-01-10 01:13:55,694 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting thread3Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 52 more)] === [2025-01-10 01:13:55,694 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:13:55,694 INFO L85 PathProgramCache]: Analyzing trace with hash -653830333, now seen corresponding path program 2 times [2025-01-10 01:13:55,694 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:13:55,694 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1712790985] [2025-01-10 01:13:55,694 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-10 01:13:55,694 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:13:55,701 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 33 statements into 2 equivalence classes. [2025-01-10 01:13:55,704 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 21 of 33 statements. [2025-01-10 01:13:55,705 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-01-10 01:13:55,705 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:13:55,762 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-01-10 01:13:55,763 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:13:55,763 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1712790985] [2025-01-10 01:13:55,763 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1712790985] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 01:13:55,763 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 01:13:55,763 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-10 01:13:55,763 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1171091652] [2025-01-10 01:13:55,763 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 01:13:55,763 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-01-10 01:13:55,763 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:13:55,764 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-01-10 01:13:55,764 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2025-01-10 01:13:55,841 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 37 out of 89 [2025-01-10 01:13:55,842 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 139 places, 140 transitions, 1087 flow. Second operand has 7 states, 7 states have (on average 40.142857142857146) internal successors, (281), 7 states have internal predecessors, (281), 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:13:55,842 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 01:13:55,842 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 37 of 89 [2025-01-10 01:13:55,842 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 01:13:58,574 INFO L124 PetriNetUnfolderBase]: 18769/29685 cut-off events. [2025-01-10 01:13:58,574 INFO L125 PetriNetUnfolderBase]: For 69490/71921 co-relation queries the response was YES. [2025-01-10 01:13:58,652 INFO L83 FinitePrefix]: Finished finitePrefix Result has 106439 conditions, 29685 events. 18769/29685 cut-off events. For 69490/71921 co-relation queries the response was YES. Maximal size of possible extension queue 1149. Compared 226788 event pairs, 4844 based on Foata normal form. 1503/27843 useless extension candidates. Maximal degree in co-relation 80234. Up to 10232 conditions per place. [2025-01-10 01:13:58,748 INFO L140 encePairwiseOnDemand]: 79/89 looper letters, 211 selfloop transitions, 28 changer transitions 0/260 dead transitions. [2025-01-10 01:13:58,749 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 146 places, 260 transitions, 2291 flow [2025-01-10 01:13:58,749 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-01-10 01:13:58,749 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2025-01-10 01:13:58,749 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 418 transitions. [2025-01-10 01:13:58,750 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5870786516853933 [2025-01-10 01:13:58,750 INFO L175 Difference]: Start difference. First operand has 139 places, 140 transitions, 1087 flow. Second operand 8 states and 418 transitions. [2025-01-10 01:13:58,750 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 146 places, 260 transitions, 2291 flow [2025-01-10 01:13:59,238 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 143 places, 260 transitions, 2254 flow, removed 6 selfloop flow, removed 3 redundant places. [2025-01-10 01:13:59,240 INFO L231 Difference]: Finished difference. Result has 147 places, 150 transitions, 1271 flow [2025-01-10 01:13:59,240 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=89, PETRI_DIFFERENCE_MINUEND_FLOW=1056, PETRI_DIFFERENCE_MINUEND_PLACES=136, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=140, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=19, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=113, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=1271, PETRI_PLACES=147, PETRI_TRANSITIONS=150} [2025-01-10 01:13:59,240 INFO L279 CegarLoopForPetriNet]: 86 programPoint places, 61 predicate places. [2025-01-10 01:13:59,240 INFO L471 AbstractCegarLoop]: Abstraction has has 147 places, 150 transitions, 1271 flow [2025-01-10 01:13:59,240 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 40.142857142857146) internal successors, (281), 7 states have internal predecessors, (281), 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:13:59,240 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 01:13:59,241 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:13:59,241 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2025-01-10 01:13:59,241 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting thread3Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 52 more)] === [2025-01-10 01:13:59,241 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:13:59,241 INFO L85 PathProgramCache]: Analyzing trace with hash -1736740529, now seen corresponding path program 3 times [2025-01-10 01:13:59,241 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:13:59,241 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1963288228] [2025-01-10 01:13:59,241 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-01-10 01:13:59,241 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:13:59,248 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 33 statements into 4 equivalence classes. [2025-01-10 01:13:59,249 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 14 of 33 statements. [2025-01-10 01:13:59,249 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-01-10 01:13:59,250 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:13:59,277 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2025-01-10 01:13:59,277 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:13:59,277 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1963288228] [2025-01-10 01:13:59,277 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1963288228] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 01:13:59,277 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 01:13:59,277 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-10 01:13:59,277 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1779301419] [2025-01-10 01:13:59,278 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 01:13:59,278 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-10 01:13:59,278 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:13:59,278 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-10 01:13:59,278 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-10 01:13:59,330 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 37 out of 89 [2025-01-10 01:13:59,331 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 147 places, 150 transitions, 1271 flow. Second operand has 5 states, 5 states have (on average 41.4) internal successors, (207), 5 states have internal predecessors, (207), 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:13:59,331 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 01:13:59,331 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 37 of 89 [2025-01-10 01:13:59,331 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 01:14:01,788 INFO L124 PetriNetUnfolderBase]: 17553/27204 cut-off events. [2025-01-10 01:14:01,788 INFO L125 PetriNetUnfolderBase]: For 90430/93143 co-relation queries the response was YES. [2025-01-10 01:14:01,888 INFO L83 FinitePrefix]: Finished finitePrefix Result has 104356 conditions, 27204 events. 17553/27204 cut-off events. For 90430/93143 co-relation queries the response was YES. Maximal size of possible extension queue 1020. Compared 198129 event pairs, 1370 based on Foata normal form. 1483/25692 useless extension candidates. Maximal degree in co-relation 81816. Up to 10913 conditions per place. [2025-01-10 01:14:01,981 INFO L140 encePairwiseOnDemand]: 81/89 looper letters, 206 selfloop transitions, 55 changer transitions 0/282 dead transitions. [2025-01-10 01:14:01,981 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 153 places, 282 transitions, 2600 flow [2025-01-10 01:14:01,982 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-01-10 01:14:01,982 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-01-10 01:14:01,982 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 395 transitions. [2025-01-10 01:14:01,982 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6340288924558587 [2025-01-10 01:14:01,982 INFO L175 Difference]: Start difference. First operand has 147 places, 150 transitions, 1271 flow. Second operand 7 states and 395 transitions. [2025-01-10 01:14:01,982 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 153 places, 282 transitions, 2600 flow [2025-01-10 01:14:02,594 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 151 places, 282 transitions, 2567 flow, removed 14 selfloop flow, removed 2 redundant places. [2025-01-10 01:14:02,596 INFO L231 Difference]: Finished difference. Result has 153 places, 163 transitions, 1543 flow [2025-01-10 01:14:02,596 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=89, PETRI_DIFFERENCE_MINUEND_FLOW=1238, PETRI_DIFFERENCE_MINUEND_PLACES=145, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=150, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=44, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=106, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=1543, PETRI_PLACES=153, PETRI_TRANSITIONS=163} [2025-01-10 01:14:02,596 INFO L279 CegarLoopForPetriNet]: 86 programPoint places, 67 predicate places. [2025-01-10 01:14:02,596 INFO L471 AbstractCegarLoop]: Abstraction has has 153 places, 163 transitions, 1543 flow [2025-01-10 01:14:02,597 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 41.4) internal successors, (207), 5 states have internal predecessors, (207), 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:14:02,597 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 01:14:02,597 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:14:02,597 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2025-01-10 01:14:02,597 INFO L396 AbstractCegarLoop]: === Iteration 29 === Targeting thread2Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 52 more)] === [2025-01-10 01:14:02,597 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:14:02,597 INFO L85 PathProgramCache]: Analyzing trace with hash 1354411874, now seen corresponding path program 2 times [2025-01-10 01:14:02,597 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:14:02,598 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1897289869] [2025-01-10 01:14:02,598 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-10 01:14:02,598 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:14:02,605 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 35 statements into 2 equivalence classes. [2025-01-10 01:14:02,617 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 35 of 35 statements. [2025-01-10 01:14:02,617 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-01-10 01:14:02,617 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:14:02,994 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2025-01-10 01:14:02,994 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:14:02,994 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1897289869] [2025-01-10 01:14:02,994 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1897289869] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 01:14:02,994 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [886688877] [2025-01-10 01:14:02,994 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-10 01:14:02,994 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:14:02,995 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 01:14:02,997 INFO L229 MonitoredProcess]: Starting monitored process 16 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:14:02,999 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2025-01-10 01:14:03,058 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 35 statements into 2 equivalence classes. [2025-01-10 01:14:03,093 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 35 of 35 statements. [2025-01-10 01:14:03,093 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-01-10 01:14:03,093 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:14:03,095 INFO L256 TraceCheckSpWp]: Trace formula consists of 354 conjuncts, 18 conjuncts are in the unsatisfiable core [2025-01-10 01:14:03,096 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 01:14:03,227 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 7 proven. 5 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2025-01-10 01:14:03,228 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 01:14:03,317 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 20 [2025-01-10 01:14:03,379 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 7 proven. 5 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2025-01-10 01:14:03,379 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [886688877] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-10 01:14:03,379 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-10 01:14:03,379 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 8, 8] total 21 [2025-01-10 01:14:03,379 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1579645277] [2025-01-10 01:14:03,379 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-10 01:14:03,380 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2025-01-10 01:14:03,381 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:14:03,381 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2025-01-10 01:14:03,382 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=397, Unknown=0, NotChecked=0, Total=462 [2025-01-10 01:14:04,300 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 36 out of 89 [2025-01-10 01:14:04,301 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 153 places, 163 transitions, 1543 flow. Second operand has 22 states, 22 states have (on average 38.86363636363637) internal successors, (855), 22 states have internal predecessors, (855), 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:14:04,301 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 01:14:04,301 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 36 of 89 [2025-01-10 01:14:04,301 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 01:14:09,830 INFO L124 PetriNetUnfolderBase]: 31641/46886 cut-off events. [2025-01-10 01:14:09,830 INFO L125 PetriNetUnfolderBase]: For 185677/190091 co-relation queries the response was YES. [2025-01-10 01:14:10,125 INFO L83 FinitePrefix]: Finished finitePrefix Result has 188530 conditions, 46886 events. 31641/46886 cut-off events. For 185677/190091 co-relation queries the response was YES. Maximal size of possible extension queue 1485. Compared 342095 event pairs, 4042 based on Foata normal form. 2127/44030 useless extension candidates. Maximal degree in co-relation 144186. Up to 12098 conditions per place. [2025-01-10 01:14:10,466 INFO L140 encePairwiseOnDemand]: 77/89 looper letters, 349 selfloop transitions, 70 changer transitions 0/438 dead transitions. [2025-01-10 01:14:10,466 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 166 places, 438 transitions, 4556 flow [2025-01-10 01:14:10,467 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-01-10 01:14:10,467 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2025-01-10 01:14:10,467 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 773 transitions. [2025-01-10 01:14:10,468 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5790262172284644 [2025-01-10 01:14:10,468 INFO L175 Difference]: Start difference. First operand has 153 places, 163 transitions, 1543 flow. Second operand 15 states and 773 transitions. [2025-01-10 01:14:10,468 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 166 places, 438 transitions, 4556 flow [2025-01-10 01:14:12,653 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 160 places, 438 transitions, 4221 flow, removed 78 selfloop flow, removed 6 redundant places. [2025-01-10 01:14:12,658 INFO L231 Difference]: Finished difference. Result has 163 places, 183 transitions, 1818 flow [2025-01-10 01:14:12,658 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=89, PETRI_DIFFERENCE_MINUEND_FLOW=1394, PETRI_DIFFERENCE_MINUEND_PLACES=146, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=162, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=49, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=109, PETRI_DIFFERENCE_SUBTRAHEND_STATES=15, PETRI_FLOW=1818, PETRI_PLACES=163, PETRI_TRANSITIONS=183} [2025-01-10 01:14:12,658 INFO L279 CegarLoopForPetriNet]: 86 programPoint places, 77 predicate places. [2025-01-10 01:14:12,659 INFO L471 AbstractCegarLoop]: Abstraction has has 163 places, 183 transitions, 1818 flow [2025-01-10 01:14:12,659 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 22 states have (on average 38.86363636363637) internal successors, (855), 22 states have internal predecessors, (855), 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:14:12,659 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 01:14:12,659 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:14:12,667 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Forceful destruction successful, exit code 0 [2025-01-10 01:14:12,859 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable28 [2025-01-10 01:14:12,860 INFO L396 AbstractCegarLoop]: === Iteration 30 === Targeting thread2Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 52 more)] === [2025-01-10 01:14:12,860 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:14:12,860 INFO L85 PathProgramCache]: Analyzing trace with hash 1354411872, now seen corresponding path program 1 times [2025-01-10 01:14:12,860 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:14:12,860 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [636202636] [2025-01-10 01:14:12,860 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:14:12,861 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:14:12,870 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 35 statements into 1 equivalence classes. [2025-01-10 01:14:12,881 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 35 of 35 statements. [2025-01-10 01:14:12,881 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:14:12,881 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:14:13,287 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 6 proven. 13 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2025-01-10 01:14:13,287 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:14:13,287 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [636202636] [2025-01-10 01:14:13,287 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [636202636] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 01:14:13,287 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1922111344] [2025-01-10 01:14:13,287 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:14:13,287 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:14:13,287 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 01:14:13,289 INFO L229 MonitoredProcess]: Starting monitored process 17 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:14:13,291 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2025-01-10 01:14:13,359 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 35 statements into 1 equivalence classes. [2025-01-10 01:14:13,391 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 35 of 35 statements. [2025-01-10 01:14:13,391 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:14:13,391 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:14:13,392 INFO L256 TraceCheckSpWp]: Trace formula consists of 340 conjuncts, 43 conjuncts are in the unsatisfiable core [2025-01-10 01:14:13,394 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 01:14:13,420 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2025-01-10 01:14:13,484 INFO L349 Elim1Store]: treesize reduction 17, result has 22.7 percent of original size [2025-01-10 01:14:13,485 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 16 treesize of output 18 [2025-01-10 01:14:14,001 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 1 proven. 19 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-01-10 01:14:14,002 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 01:14:14,295 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 10 proven. 2 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2025-01-10 01:14:14,295 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1922111344] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-10 01:14:14,296 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-10 01:14:14,296 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 11, 9] total 29 [2025-01-10 01:14:14,296 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1856344822] [2025-01-10 01:14:14,296 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-10 01:14:14,296 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2025-01-10 01:14:14,296 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:14:14,297 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2025-01-10 01:14:14,297 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=128, Invalid=742, Unknown=0, NotChecked=0, Total=870 [2025-01-10 01:14:15,829 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 29 out of 89 [2025-01-10 01:14:15,830 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 163 places, 183 transitions, 1818 flow. Second operand has 30 states, 30 states have (on average 31.566666666666666) internal successors, (947), 30 states have internal predecessors, (947), 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:14:15,830 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 01:14:15,830 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 29 of 89 [2025-01-10 01:14:15,830 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 01:14:22,248 INFO L124 PetriNetUnfolderBase]: 29151/46636 cut-off events. [2025-01-10 01:14:22,249 INFO L125 PetriNetUnfolderBase]: For 180767/185549 co-relation queries the response was YES. [2025-01-10 01:14:22,560 INFO L83 FinitePrefix]: Finished finitePrefix Result has 187544 conditions, 46636 events. 29151/46636 cut-off events. For 180767/185549 co-relation queries the response was YES. Maximal size of possible extension queue 1488. Compared 382799 event pairs, 8705 based on Foata normal form. 3058/45995 useless extension candidates. Maximal degree in co-relation 146061. Up to 13765 conditions per place. [2025-01-10 01:14:22,787 INFO L140 encePairwiseOnDemand]: 73/89 looper letters, 384 selfloop transitions, 96 changer transitions 0/503 dead transitions. [2025-01-10 01:14:22,787 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 191 places, 503 transitions, 5188 flow [2025-01-10 01:14:22,788 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2025-01-10 01:14:22,788 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2025-01-10 01:14:22,789 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 1105 transitions. [2025-01-10 01:14:22,789 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.428128632313057 [2025-01-10 01:14:22,789 INFO L175 Difference]: Start difference. First operand has 163 places, 183 transitions, 1818 flow. Second operand 29 states and 1105 transitions. [2025-01-10 01:14:22,789 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 191 places, 503 transitions, 5188 flow [2025-01-10 01:14:25,142 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 188 places, 503 transitions, 5151 flow, removed 4 selfloop flow, removed 3 redundant places. [2025-01-10 01:14:25,146 INFO L231 Difference]: Finished difference. Result has 194 places, 220 transitions, 2550 flow [2025-01-10 01:14:25,146 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=89, PETRI_DIFFERENCE_MINUEND_FLOW=1764, PETRI_DIFFERENCE_MINUEND_PLACES=160, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=182, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=58, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=105, PETRI_DIFFERENCE_SUBTRAHEND_STATES=29, PETRI_FLOW=2550, PETRI_PLACES=194, PETRI_TRANSITIONS=220} [2025-01-10 01:14:25,147 INFO L279 CegarLoopForPetriNet]: 86 programPoint places, 108 predicate places. [2025-01-10 01:14:25,147 INFO L471 AbstractCegarLoop]: Abstraction has has 194 places, 220 transitions, 2550 flow [2025-01-10 01:14:25,148 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 30 states have (on average 31.566666666666666) internal successors, (947), 30 states have internal predecessors, (947), 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:14:25,148 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 01:14:25,148 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:14:25,155 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Forceful destruction successful, exit code 0 [2025-01-10 01:14:25,352 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29,17 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:14:25,352 INFO L396 AbstractCegarLoop]: === Iteration 31 === Targeting thread2Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 52 more)] === [2025-01-10 01:14:25,353 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:14:25,353 INFO L85 PathProgramCache]: Analyzing trace with hash 1354411870, now seen corresponding path program 1 times [2025-01-10 01:14:25,353 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:14:25,353 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [123780380] [2025-01-10 01:14:25,353 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:14:25,353 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:14:25,468 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 35 statements into 1 equivalence classes. [2025-01-10 01:14:25,480 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 35 of 35 statements. [2025-01-10 01:14:25,480 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:14:25,480 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:14:26,067 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 8 proven. 13 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2025-01-10 01:14:26,067 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:14:26,067 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [123780380] [2025-01-10 01:14:26,068 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [123780380] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 01:14:26,068 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [901330451] [2025-01-10 01:14:26,068 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:14:26,068 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:14:26,068 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 01:14:26,070 INFO L229 MonitoredProcess]: Starting monitored process 18 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:14:26,071 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Waiting until timeout for monitored process [2025-01-10 01:14:26,136 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 35 statements into 1 equivalence classes. [2025-01-10 01:14:26,165 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 35 of 35 statements. [2025-01-10 01:14:26,165 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:14:26,165 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:14:26,166 INFO L256 TraceCheckSpWp]: Trace formula consists of 334 conjuncts, 54 conjuncts are in the unsatisfiable core [2025-01-10 01:14:26,169 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 01:14:26,174 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2025-01-10 01:14:26,246 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 6 treesize of output 5 [2025-01-10 01:14:26,258 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2025-01-10 01:14:26,259 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 20 treesize of output 22 [2025-01-10 01:14:26,334 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-10 01:14:26,344 INFO L349 Elim1Store]: treesize reduction 25, result has 16.7 percent of original size [2025-01-10 01:14:26,344 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 23 treesize of output 28 [2025-01-10 01:14:26,357 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-01-10 01:14:26,357 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2025-01-10 01:14:27,051 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 7 proven. 13 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-01-10 01:14:27,051 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 01:14:27,390 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2025-01-10 01:14:27,562 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 10 proven. 2 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2025-01-10 01:14:27,563 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [901330451] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-10 01:14:27,563 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-10 01:14:27,563 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 12, 9] total 32 [2025-01-10 01:14:27,563 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [116662556] [2025-01-10 01:14:27,563 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-10 01:14:27,564 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2025-01-10 01:14:27,564 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:14:27,564 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2025-01-10 01:14:27,564 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=174, Invalid=948, Unknown=0, NotChecked=0, Total=1122 [2025-01-10 01:14:30,266 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 27 out of 89 [2025-01-10 01:14:30,267 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 194 places, 220 transitions, 2550 flow. Second operand has 34 states, 34 states have (on average 29.441176470588236) internal successors, (1001), 34 states have internal predecessors, (1001), 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:14:30,267 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 01:14:30,267 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 27 of 89 [2025-01-10 01:14:30,267 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 01:14:37,004 INFO L124 PetriNetUnfolderBase]: 30240/47721 cut-off events. [2025-01-10 01:14:37,005 INFO L125 PetriNetUnfolderBase]: For 230190/234852 co-relation queries the response was YES. [2025-01-10 01:14:37,334 INFO L83 FinitePrefix]: Finished finitePrefix Result has 205512 conditions, 47721 events. 30240/47721 cut-off events. For 230190/234852 co-relation queries the response was YES. Maximal size of possible extension queue 1345. Compared 373105 event pairs, 8401 based on Foata normal form. 3758/48181 useless extension candidates. Maximal degree in co-relation 160333. Up to 15386 conditions per place. [2025-01-10 01:14:37,548 INFO L140 encePairwiseOnDemand]: 76/89 looper letters, 276 selfloop transitions, 93 changer transitions 0/390 dead transitions. [2025-01-10 01:14:37,548 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 211 places, 390 transitions, 4373 flow [2025-01-10 01:14:37,549 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2025-01-10 01:14:37,549 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2025-01-10 01:14:37,550 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 676 transitions. [2025-01-10 01:14:37,551 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.42197253433208487 [2025-01-10 01:14:37,552 INFO L175 Difference]: Start difference. First operand has 194 places, 220 transitions, 2550 flow. Second operand 18 states and 676 transitions. [2025-01-10 01:14:37,552 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 211 places, 390 transitions, 4373 flow [2025-01-10 01:14:40,833 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 203 places, 390 transitions, 4264 flow, removed 1 selfloop flow, removed 8 redundant places. [2025-01-10 01:14:40,836 INFO L231 Difference]: Finished difference. Result has 205 places, 221 transitions, 2674 flow [2025-01-10 01:14:40,836 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=89, PETRI_DIFFERENCE_MINUEND_FLOW=2441, PETRI_DIFFERENCE_MINUEND_PLACES=186, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=220, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=92, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=127, PETRI_DIFFERENCE_SUBTRAHEND_STATES=18, PETRI_FLOW=2674, PETRI_PLACES=205, PETRI_TRANSITIONS=221} [2025-01-10 01:14:40,837 INFO L279 CegarLoopForPetriNet]: 86 programPoint places, 119 predicate places. [2025-01-10 01:14:40,837 INFO L471 AbstractCegarLoop]: Abstraction has has 205 places, 221 transitions, 2674 flow [2025-01-10 01:14:40,838 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 34 states, 34 states have (on average 29.441176470588236) internal successors, (1001), 34 states have internal predecessors, (1001), 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:14:40,838 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 01:14:40,838 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:14:40,845 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Ended with exit code 0 [2025-01-10 01:14:41,038 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30,18 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:14:41,039 INFO L396 AbstractCegarLoop]: === Iteration 32 === Targeting thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 52 more)] === [2025-01-10 01:14:41,039 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:14:41,039 INFO L85 PathProgramCache]: Analyzing trace with hash 1900989554, now seen corresponding path program 2 times [2025-01-10 01:14:41,040 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:14:41,040 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [513296253] [2025-01-10 01:14:41,040 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-10 01:14:41,040 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:14:41,046 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 36 statements into 2 equivalence classes. [2025-01-10 01:14:41,065 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 36 of 36 statements. [2025-01-10 01:14:41,066 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-01-10 01:14:41,066 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:14:41,298 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2025-01-10 01:14:41,298 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:14:41,298 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [513296253] [2025-01-10 01:14:41,298 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [513296253] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 01:14:41,298 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [539902282] [2025-01-10 01:14:41,298 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-10 01:14:41,298 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:14:41,299 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 01:14:41,305 INFO L229 MonitoredProcess]: Starting monitored process 19 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:14:41,305 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Waiting until timeout for monitored process [2025-01-10 01:14:41,371 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 36 statements into 2 equivalence classes. [2025-01-10 01:14:41,399 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 36 of 36 statements. [2025-01-10 01:14:41,400 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-01-10 01:14:41,400 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:14:41,405 INFO L256 TraceCheckSpWp]: Trace formula consists of 308 conjuncts, 42 conjuncts are in the unsatisfiable core [2025-01-10 01:14:41,407 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 01:14:41,413 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:14:41,417 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 6 treesize of output 5 [2025-01-10 01:14:41,499 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-10 01:14:41,500 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 13 [2025-01-10 01:14:41,514 INFO L349 Elim1Store]: treesize reduction 20, result has 33.3 percent of original size [2025-01-10 01:14:41,514 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 16 [2025-01-10 01:14:41,579 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2025-01-10 01:14:41,579 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 31 treesize of output 28 [2025-01-10 01:14:41,598 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-01-10 01:14:41,599 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2025-01-10 01:14:42,010 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 7 proven. 13 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-01-10 01:14:42,011 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 01:14:42,491 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 10 proven. 2 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2025-01-10 01:14:42,491 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [539902282] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-10 01:14:42,492 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-10 01:14:42,492 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 11, 9] total 27 [2025-01-10 01:14:42,492 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [854869136] [2025-01-10 01:14:42,492 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-10 01:14:42,492 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2025-01-10 01:14:42,492 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:14:42,492 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2025-01-10 01:14:42,493 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=115, Invalid=697, Unknown=0, NotChecked=0, Total=812 [2025-01-10 01:14:44,087 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 20 out of 89 [2025-01-10 01:14:44,088 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 205 places, 221 transitions, 2674 flow. Second operand has 29 states, 29 states have (on average 22.82758620689655) internal successors, (662), 29 states have internal predecessors, (662), 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:14:44,088 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 01:14:44,088 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 20 of 89 [2025-01-10 01:14:44,088 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand