./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/weaver/unroll-cond-2.wvr.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 798a7b37 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../sv-benchmarks/c/weaver/unroll-cond-2.wvr.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/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 4f5c6e2b4939ff0e3b5a44ab7f8c3e5d18f7e9fd12beb8fad487ea501e8fa48b --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-04 10:17:39,482 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-04 10:17:39,539 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2025-03-04 10:17:39,542 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-04 10:17:39,545 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-04 10:17:39,567 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-04 10:17:39,568 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-04 10:17:39,568 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-04 10:17:39,569 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-04 10:17:39,569 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-04 10:17:39,569 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-04 10:17:39,570 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-04 10:17:39,570 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-04 10:17:39,570 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-04 10:17:39,570 INFO L153 SettingsManager]: * Use SBE=true [2025-03-04 10:17:39,570 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-04 10:17:39,571 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-04 10:17:39,571 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-04 10:17:39,571 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-04 10:17:39,571 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-04 10:17:39,571 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2025-03-04 10:17:39,571 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2025-03-04 10:17:39,571 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2025-03-04 10:17:39,571 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-04 10:17:39,571 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-03-04 10:17:39,571 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-03-04 10:17:39,572 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-04 10:17:39,572 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-04 10:17:39,572 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-04 10:17:39,572 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-04 10:17:39,572 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-04 10:17:39,572 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-04 10:17:39,572 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-04 10:17:39,573 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 10:17:39,573 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-04 10:17:39,573 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-04 10:17:39,573 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-04 10:17:39,573 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-04 10:17:39,573 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-04 10:17:39,573 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-04 10:17:39,573 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-04 10:17:39,573 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-04 10:17:39,573 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/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 -> 4f5c6e2b4939ff0e3b5a44ab7f8c3e5d18f7e9fd12beb8fad487ea501e8fa48b [2025-03-04 10:17:39,798 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-04 10:17:39,805 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-04 10:17:39,807 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-04 10:17:39,809 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-04 10:17:39,809 INFO L274 PluginConnector]: CDTParser initialized [2025-03-04 10:17:39,810 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/weaver/unroll-cond-2.wvr.c [2025-03-04 10:17:40,954 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9aee667cb/ddd2e9cbdf45482ab126156264e8addb/FLAG10421b4a4 [2025-03-04 10:17:41,201 INFO L384 CDTParser]: Found 1 translation units. [2025-03-04 10:17:41,201 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/weaver/unroll-cond-2.wvr.c [2025-03-04 10:17:41,207 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9aee667cb/ddd2e9cbdf45482ab126156264e8addb/FLAG10421b4a4 [2025-03-04 10:17:41,524 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9aee667cb/ddd2e9cbdf45482ab126156264e8addb [2025-03-04 10:17:41,526 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-04 10:17:41,528 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-04 10:17:41,529 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-04 10:17:41,529 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-04 10:17:41,533 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-04 10:17:41,534 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 10:17:41" (1/1) ... [2025-03-04 10:17:41,534 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@21a46283 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:17:41, skipping insertion in model container [2025-03-04 10:17:41,535 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 10:17:41" (1/1) ... [2025-03-04 10:17:41,548 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-04 10:17:41,673 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-03-04 10:17:41,675 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 10:17:41,685 INFO L200 MainTranslator]: Completed pre-run [2025-03-04 10:17:41,706 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 10:17:41,721 INFO L204 MainTranslator]: Completed translation [2025-03-04 10:17:41,722 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:17:41 WrapperNode [2025-03-04 10:17:41,722 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-04 10:17:41,723 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-04 10:17:41,723 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-04 10:17:41,723 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-04 10:17:41,728 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:17:41" (1/1) ... [2025-03-04 10:17:41,734 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:17:41" (1/1) ... [2025-03-04 10:17:41,750 INFO L138 Inliner]: procedures = 23, calls = 24, calls flagged for inlining = 12, calls inlined = 12, statements flattened = 127 [2025-03-04 10:17:41,750 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-04 10:17:41,751 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-04 10:17:41,751 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-04 10:17:41,751 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-04 10:17:41,757 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:17:41" (1/1) ... [2025-03-04 10:17:41,757 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:17:41" (1/1) ... [2025-03-04 10:17:41,759 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:17:41" (1/1) ... [2025-03-04 10:17:41,776 INFO L175 MemorySlicer]: Split 7 memory accesses to 2 slices as follows [2, 5]. 71 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0]. The 1 writes are split as follows [0, 1]. [2025-03-04 10:17:41,778 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:17:41" (1/1) ... [2025-03-04 10:17:41,779 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:17:41" (1/1) ... [2025-03-04 10:17:41,786 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:17:41" (1/1) ... [2025-03-04 10:17:41,787 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:17:41" (1/1) ... [2025-03-04 10:17:41,788 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:17:41" (1/1) ... [2025-03-04 10:17:41,792 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:17:41" (1/1) ... [2025-03-04 10:17:41,794 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-04 10:17:41,796 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-04 10:17:41,796 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-04 10:17:41,796 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-04 10:17:41,797 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:17:41" (1/1) ... [2025-03-04 10:17:41,803 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 10:17:41,811 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:17:41,821 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-04 10:17:41,823 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-04 10:17:41,839 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-04 10:17:41,840 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2025-03-04 10:17:41,840 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2025-03-04 10:17:41,840 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2025-03-04 10:17:41,840 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2025-03-04 10:17:41,840 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-04 10:17:41,840 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-03-04 10:17:41,840 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-03-04 10:17:41,840 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-03-04 10:17:41,840 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-03-04 10:17:41,840 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-04 10:17:41,840 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-04 10:17:41,841 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-03-04 10:17:41,841 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-03-04 10:17:41,842 WARN L225 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-03-04 10:17:41,907 INFO L256 CfgBuilder]: Building ICFG [2025-03-04 10:17:41,908 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-04 10:17:42,170 INFO L303 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-03-04 10:17:42,170 INFO L307 CfgBuilder]: Performing block encoding [2025-03-04 10:17:42,345 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-04 10:17:42,347 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-04 10:17:42,347 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 10:17:42 BoogieIcfgContainer [2025-03-04 10:17:42,347 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-04 10:17:42,350 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-04 10:17:42,350 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-04 10:17:42,353 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-04 10:17:42,354 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.03 10:17:41" (1/3) ... [2025-03-04 10:17:42,355 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6d13e9c5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 10:17:42, skipping insertion in model container [2025-03-04 10:17:42,355 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:17:41" (2/3) ... [2025-03-04 10:17:42,355 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6d13e9c5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 10:17:42, skipping insertion in model container [2025-03-04 10:17:42,355 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 10:17:42" (3/3) ... [2025-03-04 10:17:42,356 INFO L128 eAbstractionObserver]: Analyzing ICFG unroll-cond-2.wvr.c [2025-03-04 10:17:42,367 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-04 10:17:42,368 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG unroll-cond-2.wvr.c that has 3 procedures, 37 locations, 1 initial locations, 3 loop locations, and 12 error locations. [2025-03-04 10:17:42,369 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-03-04 10:17:42,424 INFO L143 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2025-03-04 10:17:42,451 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 43 places, 40 transitions, 94 flow [2025-03-04 10:17:42,479 INFO L124 PetriNetUnfolderBase]: 4/38 cut-off events. [2025-03-04 10:17:42,483 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2025-03-04 10:17:42,486 INFO L83 FinitePrefix]: Finished finitePrefix Result has 47 conditions, 38 events. 4/38 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 74 event pairs, 0 based on Foata normal form. 0/22 useless extension candidates. Maximal degree in co-relation 26. Up to 2 conditions per place. [2025-03-04 10:17:42,486 INFO L82 GeneralOperation]: Start removeDead. Operand has 43 places, 40 transitions, 94 flow [2025-03-04 10:17:42,489 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 40 places, 37 transitions, 86 flow [2025-03-04 10:17:42,498 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-04 10:17:42,511 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;@2a79ed9a, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-04 10:17:42,513 INFO L334 AbstractCegarLoop]: Starting to check reachability of 22 error locations. [2025-03-04 10:17:42,516 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-04 10:17:42,516 INFO L124 PetriNetUnfolderBase]: 1/4 cut-off events. [2025-03-04 10:17:42,516 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-04 10:17:42,516 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 10:17:42,517 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2025-03-04 10:17:42,517 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 19 more)] === [2025-03-04 10:17:42,521 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:17:42,523 INFO L85 PathProgramCache]: Analyzing trace with hash 369435, now seen corresponding path program 1 times [2025-03-04 10:17:42,528 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:17:42,530 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [452639250] [2025-03-04 10:17:42,530 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:17:42,531 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:17:42,634 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-03-04 10:17:42,653 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-03-04 10:17:42,653 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:17:42,653 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:17:42,741 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 10:17:42,742 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:17:42,742 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [452639250] [2025-03-04 10:17:42,742 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [452639250] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:17:42,742 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 10:17:42,742 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-03-04 10:17:42,743 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1183891109] [2025-03-04 10:17:42,744 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:17:42,748 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 10:17:42,754 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:17:42,767 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 10:17:42,767 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 10:17:42,783 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 15 out of 40 [2025-03-04 10:17:42,785 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 40 places, 37 transitions, 86 flow. Second operand has 3 states, 3 states have (on average 16.0) internal successors, (48), 3 states have internal predecessors, (48), 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-03-04 10:17:42,786 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 10:17:42,786 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 15 of 40 [2025-03-04 10:17:42,786 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 10:17:42,902 INFO L124 PetriNetUnfolderBase]: 97/237 cut-off events. [2025-03-04 10:17:42,902 INFO L125 PetriNetUnfolderBase]: For 20/20 co-relation queries the response was YES. [2025-03-04 10:17:42,903 INFO L83 FinitePrefix]: Finished finitePrefix Result has 423 conditions, 237 events. 97/237 cut-off events. For 20/20 co-relation queries the response was YES. Maximal size of possible extension queue 38. Compared 1095 event pairs, 64 based on Foata normal form. 1/195 useless extension candidates. Maximal degree in co-relation 366. Up to 163 conditions per place. [2025-03-04 10:17:42,906 INFO L140 encePairwiseOnDemand]: 36/40 looper letters, 20 selfloop transitions, 2 changer transitions 0/34 dead transitions. [2025-03-04 10:17:42,907 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 39 places, 34 transitions, 124 flow [2025-03-04 10:17:42,907 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 10:17:42,909 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 10:17:42,913 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 69 transitions. [2025-03-04 10:17:42,914 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.575 [2025-03-04 10:17:42,915 INFO L175 Difference]: Start difference. First operand has 40 places, 37 transitions, 86 flow. Second operand 3 states and 69 transitions. [2025-03-04 10:17:42,916 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 39 places, 34 transitions, 124 flow [2025-03-04 10:17:42,920 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 35 places, 34 transitions, 116 flow, removed 0 selfloop flow, removed 4 redundant places. [2025-03-04 10:17:42,923 INFO L231 Difference]: Finished difference. Result has 35 places, 34 transitions, 76 flow [2025-03-04 10:17:42,925 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=72, PETRI_DIFFERENCE_MINUEND_PLACES=33, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=34, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=32, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=76, PETRI_PLACES=35, PETRI_TRANSITIONS=34} [2025-03-04 10:17:42,928 INFO L279 CegarLoopForPetriNet]: 40 programPoint places, -5 predicate places. [2025-03-04 10:17:42,929 INFO L471 AbstractCegarLoop]: Abstraction has has 35 places, 34 transitions, 76 flow [2025-03-04 10:17:42,930 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 16.0) internal successors, (48), 3 states have internal predecessors, (48), 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-03-04 10:17:42,930 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 10:17:42,930 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2025-03-04 10:17:42,930 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-04 10:17:42,931 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 19 more)] === [2025-03-04 10:17:42,931 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:17:42,932 INFO L85 PathProgramCache]: Analyzing trace with hash 369436, now seen corresponding path program 1 times [2025-03-04 10:17:42,932 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:17:42,932 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [502939013] [2025-03-04 10:17:42,932 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:17:42,932 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:17:42,938 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-03-04 10:17:42,963 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-03-04 10:17:42,963 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:17:42,963 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:17:43,199 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 10:17:43,200 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:17:43,200 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [502939013] [2025-03-04 10:17:43,200 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [502939013] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:17:43,201 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 10:17:43,201 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 10:17:43,201 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2045957177] [2025-03-04 10:17:43,201 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:17:43,201 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 10:17:43,201 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:17:43,202 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 10:17:43,202 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-04 10:17:43,232 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 15 out of 40 [2025-03-04 10:17:43,232 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 35 places, 34 transitions, 76 flow. Second operand has 4 states, 4 states have (on average 15.75) internal successors, (63), 4 states have internal predecessors, (63), 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-03-04 10:17:43,232 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 10:17:43,232 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 15 of 40 [2025-03-04 10:17:43,232 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 10:17:43,340 INFO L124 PetriNetUnfolderBase]: 97/239 cut-off events. [2025-03-04 10:17:43,340 INFO L125 PetriNetUnfolderBase]: For 5/5 co-relation queries the response was YES. [2025-03-04 10:17:43,341 INFO L83 FinitePrefix]: Finished finitePrefix Result has 417 conditions, 239 events. 97/239 cut-off events. For 5/5 co-relation queries the response was YES. Maximal size of possible extension queue 38. Compared 1098 event pairs, 64 based on Foata normal form. 1/197 useless extension candidates. Maximal degree in co-relation 398. Up to 167 conditions per place. [2025-03-04 10:17:43,343 INFO L140 encePairwiseOnDemand]: 36/40 looper letters, 23 selfloop transitions, 2 changer transitions 0/36 dead transitions. [2025-03-04 10:17:43,343 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 37 places, 36 transitions, 130 flow [2025-03-04 10:17:43,347 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 10:17:43,347 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 10:17:43,347 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 72 transitions. [2025-03-04 10:17:43,347 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6 [2025-03-04 10:17:43,347 INFO L175 Difference]: Start difference. First operand has 35 places, 34 transitions, 76 flow. Second operand 3 states and 72 transitions. [2025-03-04 10:17:43,347 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 37 places, 36 transitions, 130 flow [2025-03-04 10:17:43,348 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 35 places, 36 transitions, 126 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-04 10:17:43,349 INFO L231 Difference]: Finished difference. Result has 36 places, 35 transitions, 86 flow [2025-03-04 10:17:43,350 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=72, PETRI_DIFFERENCE_MINUEND_PLACES=33, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=34, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=32, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=86, PETRI_PLACES=36, PETRI_TRANSITIONS=35} [2025-03-04 10:17:43,350 INFO L279 CegarLoopForPetriNet]: 40 programPoint places, -4 predicate places. [2025-03-04 10:17:43,351 INFO L471 AbstractCegarLoop]: Abstraction has has 36 places, 35 transitions, 86 flow [2025-03-04 10:17:43,351 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.75) internal successors, (63), 4 states have internal predecessors, (63), 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-03-04 10:17:43,351 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 10:17:43,351 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1] [2025-03-04 10:17:43,351 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-04 10:17:43,351 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 19 more)] === [2025-03-04 10:17:43,352 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:17:43,352 INFO L85 PathProgramCache]: Analyzing trace with hash 355039940, now seen corresponding path program 1 times [2025-03-04 10:17:43,352 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:17:43,353 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1038319212] [2025-03-04 10:17:43,353 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:17:43,353 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:17:43,364 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-03-04 10:17:43,376 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-03-04 10:17:43,377 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:17:43,377 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:17:43,628 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 10:17:43,628 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:17:43,628 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1038319212] [2025-03-04 10:17:43,628 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1038319212] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 10:17:43,628 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [113224445] [2025-03-04 10:17:43,628 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:17:43,629 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:17:43,629 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:17:43,632 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 10:17:43,632 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-04 10:17:43,673 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-03-04 10:17:43,682 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-03-04 10:17:43,682 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:17:43,682 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:17:43,684 INFO L256 TraceCheckSpWp]: Trace formula consists of 66 conjuncts, 16 conjuncts are in the unsatisfiable core [2025-03-04 10:17:43,687 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:17:43,734 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-03-04 10:17:43,889 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 10:17:43,890 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 10:17:43,974 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 10:17:43,974 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [113224445] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 10:17:43,974 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 10:17:43,975 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2025-03-04 10:17:43,975 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1271132912] [2025-03-04 10:17:43,975 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 10:17:43,975 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-04 10:17:43,975 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:17:43,975 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-04 10:17:43,976 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=76, Unknown=0, NotChecked=0, Total=110 [2025-03-04 10:17:44,093 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 15 out of 40 [2025-03-04 10:17:44,093 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 36 places, 35 transitions, 86 flow. Second operand has 11 states, 11 states have (on average 16.363636363636363) internal successors, (180), 11 states have internal predecessors, (180), 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-03-04 10:17:44,093 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 10:17:44,093 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 15 of 40 [2025-03-04 10:17:44,093 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 10:17:44,284 INFO L124 PetriNetUnfolderBase]: 98/241 cut-off events. [2025-03-04 10:17:44,285 INFO L125 PetriNetUnfolderBase]: For 5/5 co-relation queries the response was YES. [2025-03-04 10:17:44,285 INFO L83 FinitePrefix]: Finished finitePrefix Result has 427 conditions, 241 events. 98/241 cut-off events. For 5/5 co-relation queries the response was YES. Maximal size of possible extension queue 38. Compared 1102 event pairs, 64 based on Foata normal form. 0/199 useless extension candidates. Maximal degree in co-relation 414. Up to 164 conditions per place. [2025-03-04 10:17:44,286 INFO L140 encePairwiseOnDemand]: 35/40 looper letters, 19 selfloop transitions, 8 changer transitions 0/38 dead transitions. [2025-03-04 10:17:44,286 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 41 places, 38 transitions, 148 flow [2025-03-04 10:17:44,287 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-04 10:17:44,287 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-03-04 10:17:44,287 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 134 transitions. [2025-03-04 10:17:44,288 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4785714285714286 [2025-03-04 10:17:44,288 INFO L175 Difference]: Start difference. First operand has 36 places, 35 transitions, 86 flow. Second operand 7 states and 134 transitions. [2025-03-04 10:17:44,288 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 41 places, 38 transitions, 148 flow [2025-03-04 10:17:44,288 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 40 places, 38 transitions, 146 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-04 10:17:44,289 INFO L231 Difference]: Finished difference. Result has 40 places, 38 transitions, 110 flow [2025-03-04 10:17:44,289 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=80, PETRI_DIFFERENCE_MINUEND_PLACES=34, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=34, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=29, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=110, PETRI_PLACES=40, PETRI_TRANSITIONS=38} [2025-03-04 10:17:44,291 INFO L279 CegarLoopForPetriNet]: 40 programPoint places, 0 predicate places. [2025-03-04 10:17:44,291 INFO L471 AbstractCegarLoop]: Abstraction has has 40 places, 38 transitions, 110 flow [2025-03-04 10:17:44,291 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 16.363636363636363) internal successors, (180), 11 states have internal predecessors, (180), 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-03-04 10:17:44,292 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 10:17:44,292 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:17:44,301 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-03-04 10:17:44,496 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:17:44,496 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 19 more)] === [2025-03-04 10:17:44,496 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:17:44,497 INFO L85 PathProgramCache]: Analyzing trace with hash -1506934140, now seen corresponding path program 1 times [2025-03-04 10:17:44,497 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:17:44,497 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [329745403] [2025-03-04 10:17:44,497 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:17:44,497 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:17:44,501 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-03-04 10:17:44,505 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-03-04 10:17:44,505 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:17:44,505 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:17:44,536 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 10:17:44,536 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:17:44,536 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [329745403] [2025-03-04 10:17:44,536 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [329745403] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:17:44,536 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 10:17:44,536 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 10:17:44,536 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1968645827] [2025-03-04 10:17:44,536 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:17:44,536 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 10:17:44,536 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:17:44,537 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 10:17:44,537 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 10:17:44,552 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 40 [2025-03-04 10:17:44,553 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 40 places, 38 transitions, 110 flow. Second operand has 4 states, 4 states have (on average 13.0) internal successors, (52), 4 states have internal predecessors, (52), 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-03-04 10:17:44,553 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 10:17:44,553 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 40 [2025-03-04 10:17:44,553 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 10:17:44,605 INFO L124 PetriNetUnfolderBase]: 98/214 cut-off events. [2025-03-04 10:17:44,605 INFO L125 PetriNetUnfolderBase]: For 5/5 co-relation queries the response was YES. [2025-03-04 10:17:44,606 INFO L83 FinitePrefix]: Finished finitePrefix Result has 408 conditions, 214 events. 98/214 cut-off events. For 5/5 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 826 event pairs, 64 based on Foata normal form. 0/199 useless extension candidates. Maximal degree in co-relation 371. Up to 163 conditions per place. [2025-03-04 10:17:44,608 INFO L140 encePairwiseOnDemand]: 34/40 looper letters, 24 selfloop transitions, 3 changer transitions 0/34 dead transitions. [2025-03-04 10:17:44,608 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 39 places, 34 transitions, 156 flow [2025-03-04 10:17:44,608 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 10:17:44,608 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-04 10:17:44,609 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 70 transitions. [2025-03-04 10:17:44,609 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4375 [2025-03-04 10:17:44,610 INFO L175 Difference]: Start difference. First operand has 40 places, 38 transitions, 110 flow. Second operand 4 states and 70 transitions. [2025-03-04 10:17:44,610 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 39 places, 34 transitions, 156 flow [2025-03-04 10:17:44,610 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 36 places, 34 transitions, 141 flow, removed 4 selfloop flow, removed 3 redundant places. [2025-03-04 10:17:44,611 INFO L231 Difference]: Finished difference. Result has 36 places, 34 transitions, 93 flow [2025-03-04 10:17:44,612 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=87, PETRI_DIFFERENCE_MINUEND_PLACES=33, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=34, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=31, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=93, PETRI_PLACES=36, PETRI_TRANSITIONS=34} [2025-03-04 10:17:44,612 INFO L279 CegarLoopForPetriNet]: 40 programPoint places, -4 predicate places. [2025-03-04 10:17:44,612 INFO L471 AbstractCegarLoop]: Abstraction has has 36 places, 34 transitions, 93 flow [2025-03-04 10:17:44,613 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.0) internal successors, (52), 4 states have internal predecessors, (52), 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-03-04 10:17:44,613 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 10:17:44,613 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:17:44,613 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-04 10:17:44,613 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 19 more)] === [2025-03-04 10:17:44,614 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:17:44,614 INFO L85 PathProgramCache]: Analyzing trace with hash -1506934139, now seen corresponding path program 1 times [2025-03-04 10:17:44,614 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:17:44,614 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [788220307] [2025-03-04 10:17:44,614 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:17:44,614 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:17:44,618 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-03-04 10:17:44,624 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-03-04 10:17:44,625 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:17:44,625 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:17:44,782 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 10:17:44,782 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:17:44,782 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [788220307] [2025-03-04 10:17:44,782 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [788220307] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 10:17:44,782 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [438457434] [2025-03-04 10:17:44,782 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:17:44,784 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:17:44,784 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:17:44,786 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 10:17:44,788 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-04 10:17:44,822 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-03-04 10:17:44,832 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-03-04 10:17:44,832 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:17:44,832 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:17:44,833 INFO L256 TraceCheckSpWp]: Trace formula consists of 94 conjuncts, 14 conjuncts are in the unsatisfiable core [2025-03-04 10:17:44,834 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:17:44,897 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 10:17:44,897 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 10:17:44,949 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 29 treesize of output 25 [2025-03-04 10:17:44,970 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 10:17:44,971 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [438457434] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 10:17:44,971 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 10:17:44,971 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2025-03-04 10:17:44,971 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1085799148] [2025-03-04 10:17:44,971 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 10:17:44,971 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-04 10:17:44,972 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:17:44,972 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-04 10:17:44,972 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=82, Unknown=0, NotChecked=0, Total=110 [2025-03-04 10:17:45,082 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 15 out of 40 [2025-03-04 10:17:45,082 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 36 places, 34 transitions, 93 flow. Second operand has 11 states, 11 states have (on average 17.181818181818183) internal successors, (189), 11 states have internal predecessors, (189), 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-03-04 10:17:45,083 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 10:17:45,083 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 15 of 40 [2025-03-04 10:17:45,083 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 10:17:45,205 INFO L124 PetriNetUnfolderBase]: 206/393 cut-off events. [2025-03-04 10:17:45,205 INFO L125 PetriNetUnfolderBase]: For 6/6 co-relation queries the response was YES. [2025-03-04 10:17:45,205 INFO L83 FinitePrefix]: Finished finitePrefix Result has 766 conditions, 393 events. 206/393 cut-off events. For 6/6 co-relation queries the response was YES. Maximal size of possible extension queue 44. Compared 1700 event pairs, 71 based on Foata normal form. 0/342 useless extension candidates. Maximal degree in co-relation 735. Up to 196 conditions per place. [2025-03-04 10:17:45,207 INFO L140 encePairwiseOnDemand]: 35/40 looper letters, 39 selfloop transitions, 5 changer transitions 0/50 dead transitions. [2025-03-04 10:17:45,207 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 40 places, 50 transitions, 216 flow [2025-03-04 10:17:45,207 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 10:17:45,207 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-03-04 10:17:45,208 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 117 transitions. [2025-03-04 10:17:45,208 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.585 [2025-03-04 10:17:45,208 INFO L175 Difference]: Start difference. First operand has 36 places, 34 transitions, 93 flow. Second operand 5 states and 117 transitions. [2025-03-04 10:17:45,208 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 40 places, 50 transitions, 216 flow [2025-03-04 10:17:45,209 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 38 places, 50 transitions, 212 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-04 10:17:45,209 INFO L231 Difference]: Finished difference. Result has 39 places, 35 transitions, 108 flow [2025-03-04 10:17:45,210 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=89, PETRI_DIFFERENCE_MINUEND_PLACES=34, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=34, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=29, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=108, PETRI_PLACES=39, PETRI_TRANSITIONS=35} [2025-03-04 10:17:45,210 INFO L279 CegarLoopForPetriNet]: 40 programPoint places, -1 predicate places. [2025-03-04 10:17:45,210 INFO L471 AbstractCegarLoop]: Abstraction has has 39 places, 35 transitions, 108 flow [2025-03-04 10:17:45,211 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 17.181818181818183) internal successors, (189), 11 states have internal predecessors, (189), 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-03-04 10:17:45,211 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 10:17:45,212 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:17:45,218 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-03-04 10:17:45,416 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:17:45,416 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting thread2Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 19 more)] === [2025-03-04 10:17:45,416 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:17:45,416 INFO L85 PathProgramCache]: Analyzing trace with hash -784053988, now seen corresponding path program 1 times [2025-03-04 10:17:45,417 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:17:45,417 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [761699347] [2025-03-04 10:17:45,417 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:17:45,417 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:17:45,425 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-03-04 10:17:45,429 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-03-04 10:17:45,429 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:17:45,429 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:17:45,568 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 10:17:45,568 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:17:45,568 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [761699347] [2025-03-04 10:17:45,569 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [761699347] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 10:17:45,569 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [384955306] [2025-03-04 10:17:45,569 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:17:45,569 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:17:45,569 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:17:45,571 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 10:17:45,573 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-03-04 10:17:45,610 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-03-04 10:17:45,623 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-03-04 10:17:45,624 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:17:45,624 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:17:45,626 INFO L256 TraceCheckSpWp]: Trace formula consists of 110 conjuncts, 14 conjuncts are in the unsatisfiable core [2025-03-04 10:17:45,627 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:17:45,713 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 10:17:45,713 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 10:17:45,771 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 29 treesize of output 25 [2025-03-04 10:17:45,793 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 10:17:45,794 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [384955306] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 10:17:45,794 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 10:17:45,794 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2025-03-04 10:17:45,794 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [388894599] [2025-03-04 10:17:45,794 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 10:17:45,794 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-04 10:17:45,794 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:17:45,794 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-04 10:17:45,795 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=82, Unknown=0, NotChecked=0, Total=110 [2025-03-04 10:17:45,885 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 40 [2025-03-04 10:17:45,885 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 39 places, 35 transitions, 108 flow. Second operand has 11 states, 11 states have (on average 15.727272727272727) internal successors, (173), 11 states have internal predecessors, (173), 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-03-04 10:17:45,885 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 10:17:45,885 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 40 [2025-03-04 10:17:45,886 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 10:17:46,037 INFO L124 PetriNetUnfolderBase]: 371/670 cut-off events. [2025-03-04 10:17:46,037 INFO L125 PetriNetUnfolderBase]: For 71/89 co-relation queries the response was YES. [2025-03-04 10:17:46,039 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1403 conditions, 670 events. 371/670 cut-off events. For 71/89 co-relation queries the response was YES. Maximal size of possible extension queue 51. Compared 2981 event pairs, 102 based on Foata normal form. 0/553 useless extension candidates. Maximal degree in co-relation 1368. Up to 388 conditions per place. [2025-03-04 10:17:46,042 INFO L140 encePairwiseOnDemand]: 33/40 looper letters, 39 selfloop transitions, 6 changer transitions 0/49 dead transitions. [2025-03-04 10:17:46,042 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 43 places, 49 transitions, 233 flow [2025-03-04 10:17:46,042 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 10:17:46,042 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-03-04 10:17:46,043 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 107 transitions. [2025-03-04 10:17:46,043 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.535 [2025-03-04 10:17:46,043 INFO L175 Difference]: Start difference. First operand has 39 places, 35 transitions, 108 flow. Second operand 5 states and 107 transitions. [2025-03-04 10:17:46,043 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 43 places, 49 transitions, 233 flow [2025-03-04 10:17:46,044 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 40 places, 49 transitions, 225 flow, removed 0 selfloop flow, removed 3 redundant places. [2025-03-04 10:17:46,044 INFO L231 Difference]: Finished difference. Result has 41 places, 37 transitions, 129 flow [2025-03-04 10:17:46,044 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=101, PETRI_DIFFERENCE_MINUEND_PLACES=36, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=35, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=29, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=129, PETRI_PLACES=41, PETRI_TRANSITIONS=37} [2025-03-04 10:17:46,045 INFO L279 CegarLoopForPetriNet]: 40 programPoint places, 1 predicate places. [2025-03-04 10:17:46,045 INFO L471 AbstractCegarLoop]: Abstraction has has 41 places, 37 transitions, 129 flow [2025-03-04 10:17:46,045 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 15.727272727272727) internal successors, (173), 11 states have internal predecessors, (173), 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-03-04 10:17:46,045 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 10:17:46,045 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:17:46,053 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-03-04 10:17:46,245 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:17:46,246 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 19 more)] === [2025-03-04 10:17:46,246 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:17:46,246 INFO L85 PathProgramCache]: Analyzing trace with hash -759715896, now seen corresponding path program 1 times [2025-03-04 10:17:46,247 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:17:46,247 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1249516141] [2025-03-04 10:17:46,247 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:17:46,247 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:17:46,251 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-03-04 10:17:46,267 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-03-04 10:17:46,267 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:17:46,268 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:17:46,442 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 10:17:46,442 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:17:46,444 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1249516141] [2025-03-04 10:17:46,444 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1249516141] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 10:17:46,444 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [9352299] [2025-03-04 10:17:46,444 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:17:46,444 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:17:46,444 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:17:46,449 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 10:17:46,450 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-03-04 10:17:46,484 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-03-04 10:17:46,496 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-03-04 10:17:46,496 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:17:46,496 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:17:46,497 INFO L256 TraceCheckSpWp]: Trace formula consists of 104 conjuncts, 12 conjuncts are in the unsatisfiable core [2025-03-04 10:17:46,498 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:17:46,597 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 10:17:46,597 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 10:17:46,646 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 36 treesize of output 32 [2025-03-04 10:17:46,769 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 10:17:46,770 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [9352299] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 10:17:46,770 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 10:17:46,770 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 15 [2025-03-04 10:17:46,770 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1903648803] [2025-03-04 10:17:46,770 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 10:17:46,770 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2025-03-04 10:17:46,770 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:17:46,771 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2025-03-04 10:17:46,771 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=223, Unknown=0, NotChecked=0, Total=272 [2025-03-04 10:17:46,973 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 15 out of 40 [2025-03-04 10:17:46,973 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 41 places, 37 transitions, 129 flow. Second operand has 17 states, 17 states have (on average 16.764705882352942) internal successors, (285), 17 states have internal predecessors, (285), 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-03-04 10:17:46,973 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 10:17:46,973 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 15 of 40 [2025-03-04 10:17:46,974 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 10:17:47,287 INFO L124 PetriNetUnfolderBase]: 640/1238 cut-off events. [2025-03-04 10:17:47,288 INFO L125 PetriNetUnfolderBase]: For 131/131 co-relation queries the response was YES. [2025-03-04 10:17:47,290 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2701 conditions, 1238 events. 640/1238 cut-off events. For 131/131 co-relation queries the response was YES. Maximal size of possible extension queue 87. Compared 6838 event pairs, 332 based on Foata normal form. 0/1112 useless extension candidates. Maximal degree in co-relation 1417. Up to 547 conditions per place. [2025-03-04 10:17:47,295 INFO L140 encePairwiseOnDemand]: 31/40 looper letters, 73 selfloop transitions, 12 changer transitions 0/91 dead transitions. [2025-03-04 10:17:47,295 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 48 places, 91 transitions, 449 flow [2025-03-04 10:17:47,296 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-04 10:17:47,296 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2025-03-04 10:17:47,296 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 198 transitions. [2025-03-04 10:17:47,297 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.61875 [2025-03-04 10:17:47,297 INFO L175 Difference]: Start difference. First operand has 41 places, 37 transitions, 129 flow. Second operand 8 states and 198 transitions. [2025-03-04 10:17:47,297 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 48 places, 91 transitions, 449 flow [2025-03-04 10:17:47,298 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 45 places, 91 transitions, 435 flow, removed 0 selfloop flow, removed 3 redundant places. [2025-03-04 10:17:47,299 INFO L231 Difference]: Finished difference. Result has 48 places, 43 transitions, 192 flow [2025-03-04 10:17:47,299 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=121, PETRI_DIFFERENCE_MINUEND_PLACES=38, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=37, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=26, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=192, PETRI_PLACES=48, PETRI_TRANSITIONS=43} [2025-03-04 10:17:47,300 INFO L279 CegarLoopForPetriNet]: 40 programPoint places, 8 predicate places. [2025-03-04 10:17:47,300 INFO L471 AbstractCegarLoop]: Abstraction has has 48 places, 43 transitions, 192 flow [2025-03-04 10:17:47,300 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 16.764705882352942) internal successors, (285), 17 states have internal predecessors, (285), 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-03-04 10:17:47,300 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 10:17:47,300 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:17:47,306 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2025-03-04 10:17:47,504 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:17:47,504 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting thread2Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 19 more)] === [2025-03-04 10:17:47,504 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:17:47,504 INFO L85 PathProgramCache]: Analyzing trace with hash 1464130570, now seen corresponding path program 1 times [2025-03-04 10:17:47,504 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:17:47,504 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1431504951] [2025-03-04 10:17:47,505 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:17:47,505 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:17:47,508 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-03-04 10:17:47,512 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-03-04 10:17:47,512 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:17:47,512 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:17:47,624 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 10:17:47,625 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:17:47,625 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1431504951] [2025-03-04 10:17:47,625 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1431504951] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 10:17:47,625 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [764439720] [2025-03-04 10:17:47,625 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:17:47,625 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:17:47,625 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:17:47,627 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 10:17:47,629 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-03-04 10:17:47,658 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-03-04 10:17:47,669 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-03-04 10:17:47,669 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:17:47,669 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:17:47,670 INFO L256 TraceCheckSpWp]: Trace formula consists of 119 conjuncts, 12 conjuncts are in the unsatisfiable core [2025-03-04 10:17:47,671 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:17:47,748 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 10:17:47,748 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 10:17:47,767 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 29 treesize of output 25 [2025-03-04 10:17:47,894 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 10:17:47,895 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [764439720] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 10:17:47,895 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 10:17:47,895 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 12 [2025-03-04 10:17:47,895 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [842379757] [2025-03-04 10:17:47,895 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 10:17:47,895 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-03-04 10:17:47,896 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:17:47,896 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-03-04 10:17:47,896 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=141, Unknown=0, NotChecked=0, Total=182 [2025-03-04 10:17:47,982 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 40 [2025-03-04 10:17:47,983 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 48 places, 43 transitions, 192 flow. Second operand has 14 states, 14 states have (on average 15.357142857142858) internal successors, (215), 14 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-03-04 10:17:47,983 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 10:17:47,983 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 40 [2025-03-04 10:17:47,983 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 10:17:48,216 INFO L124 PetriNetUnfolderBase]: 762/1360 cut-off events. [2025-03-04 10:17:48,216 INFO L125 PetriNetUnfolderBase]: For 784/820 co-relation queries the response was YES. [2025-03-04 10:17:48,219 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3411 conditions, 1360 events. 762/1360 cut-off events. For 784/820 co-relation queries the response was YES. Maximal size of possible extension queue 89. Compared 6997 event pairs, 349 based on Foata normal form. 0/1256 useless extension candidates. Maximal degree in co-relation 2177. Up to 990 conditions per place. [2025-03-04 10:17:48,224 INFO L140 encePairwiseOnDemand]: 31/40 looper letters, 61 selfloop transitions, 11 changer transitions 0/76 dead transitions. [2025-03-04 10:17:48,225 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 54 places, 76 transitions, 437 flow [2025-03-04 10:17:48,225 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-04 10:17:48,225 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-03-04 10:17:48,225 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 156 transitions. [2025-03-04 10:17:48,226 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5571428571428572 [2025-03-04 10:17:48,226 INFO L175 Difference]: Start difference. First operand has 48 places, 43 transitions, 192 flow. Second operand 7 states and 156 transitions. [2025-03-04 10:17:48,226 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 54 places, 76 transitions, 437 flow [2025-03-04 10:17:48,228 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 51 places, 76 transitions, 430 flow, removed 0 selfloop flow, removed 3 redundant places. [2025-03-04 10:17:48,229 INFO L231 Difference]: Finished difference. Result has 52 places, 45 transitions, 225 flow [2025-03-04 10:17:48,229 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=185, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=43, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=32, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=225, PETRI_PLACES=52, PETRI_TRANSITIONS=45} [2025-03-04 10:17:48,230 INFO L279 CegarLoopForPetriNet]: 40 programPoint places, 12 predicate places. [2025-03-04 10:17:48,230 INFO L471 AbstractCegarLoop]: Abstraction has has 52 places, 45 transitions, 225 flow [2025-03-04 10:17:48,230 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 15.357142857142858) internal successors, (215), 14 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-03-04 10:17:48,230 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 10:17:48,230 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1] [2025-03-04 10:17:48,237 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2025-03-04 10:17:48,431 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:17:48,431 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 19 more)] === [2025-03-04 10:17:48,431 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:17:48,432 INFO L85 PathProgramCache]: Analyzing trace with hash -2002164960, now seen corresponding path program 2 times [2025-03-04 10:17:48,432 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:17:48,432 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [293502988] [2025-03-04 10:17:48,432 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 10:17:48,432 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:17:48,437 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 12 statements into 2 equivalence classes. [2025-03-04 10:17:48,445 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 6 of 12 statements. [2025-03-04 10:17:48,445 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-04 10:17:48,445 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:17:48,524 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-03-04 10:17:48,524 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:17:48,525 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [293502988] [2025-03-04 10:17:48,525 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [293502988] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 10:17:48,525 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1170292230] [2025-03-04 10:17:48,525 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 10:17:48,525 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:17:48,525 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:17:48,527 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 10:17:48,528 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-03-04 10:17:48,558 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 12 statements into 2 equivalence classes. [2025-03-04 10:17:48,565 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 6 of 12 statements. [2025-03-04 10:17:48,565 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-04 10:17:48,565 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:17:48,566 INFO L256 TraceCheckSpWp]: Trace formula consists of 81 conjuncts, 20 conjuncts are in the unsatisfiable core [2025-03-04 10:17:48,567 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:17:48,577 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-03-04 10:17:48,715 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-03-04 10:17:48,716 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 10:17:48,851 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-03-04 10:17:48,851 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1170292230] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 10:17:48,851 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 10:17:48,851 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2025-03-04 10:17:48,851 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1990716004] [2025-03-04 10:17:48,851 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 10:17:48,852 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-04 10:17:48,852 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:17:48,852 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-04 10:17:48,852 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2025-03-04 10:17:49,001 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 15 out of 40 [2025-03-04 10:17:49,002 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 52 places, 45 transitions, 225 flow. Second operand has 11 states, 11 states have (on average 17.727272727272727) internal successors, (195), 11 states have internal predecessors, (195), 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-03-04 10:17:49,002 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 10:17:49,002 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 15 of 40 [2025-03-04 10:17:49,002 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 10:17:49,168 INFO L124 PetriNetUnfolderBase]: 616/1180 cut-off events. [2025-03-04 10:17:49,168 INFO L125 PetriNetUnfolderBase]: For 653/653 co-relation queries the response was YES. [2025-03-04 10:17:49,170 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3024 conditions, 1180 events. 616/1180 cut-off events. For 653/653 co-relation queries the response was YES. Maximal size of possible extension queue 83. Compared 6524 event pairs, 325 based on Foata normal form. 0/1176 useless extension candidates. Maximal degree in co-relation 2003. Up to 751 conditions per place. [2025-03-04 10:17:49,173 INFO L140 encePairwiseOnDemand]: 35/40 looper letters, 44 selfloop transitions, 10 changer transitions 0/60 dead transitions. [2025-03-04 10:17:49,173 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 55 places, 60 transitions, 403 flow [2025-03-04 10:17:49,173 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 10:17:49,173 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-03-04 10:17:49,174 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 108 transitions. [2025-03-04 10:17:49,174 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.54 [2025-03-04 10:17:49,174 INFO L175 Difference]: Start difference. First operand has 52 places, 45 transitions, 225 flow. Second operand 5 states and 108 transitions. [2025-03-04 10:17:49,174 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 55 places, 60 transitions, 403 flow [2025-03-04 10:17:49,176 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 50 places, 60 transitions, 380 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-03-04 10:17:49,177 INFO L231 Difference]: Finished difference. Result has 50 places, 44 transitions, 221 flow [2025-03-04 10:17:49,177 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=201, PETRI_DIFFERENCE_MINUEND_PLACES=46, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=44, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=34, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=221, PETRI_PLACES=50, PETRI_TRANSITIONS=44} [2025-03-04 10:17:49,177 INFO L279 CegarLoopForPetriNet]: 40 programPoint places, 10 predicate places. [2025-03-04 10:17:49,177 INFO L471 AbstractCegarLoop]: Abstraction has has 50 places, 44 transitions, 221 flow [2025-03-04 10:17:49,177 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 17.727272727272727) internal successors, (195), 11 states have internal predecessors, (195), 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-03-04 10:17:49,178 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 10:17:49,178 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:17:49,194 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2025-03-04 10:17:49,382 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:17:49,382 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting thread2Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 19 more)] === [2025-03-04 10:17:49,383 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:17:49,383 INFO L85 PathProgramCache]: Analyzing trace with hash -1719782193, now seen corresponding path program 1 times [2025-03-04 10:17:49,383 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:17:49,383 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1679867858] [2025-03-04 10:17:49,383 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:17:49,383 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:17:49,388 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-03-04 10:17:49,395 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-03-04 10:17:49,396 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:17:49,396 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:17:49,506 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 10:17:49,507 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:17:49,507 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1679867858] [2025-03-04 10:17:49,507 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1679867858] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 10:17:49,507 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1350728113] [2025-03-04 10:17:49,507 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:17:49,507 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:17:49,507 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:17:49,509 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 10:17:49,510 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2025-03-04 10:17:49,545 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-03-04 10:17:49,557 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-03-04 10:17:49,557 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:17:49,557 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:17:49,558 INFO L256 TraceCheckSpWp]: Trace formula consists of 129 conjuncts, 12 conjuncts are in the unsatisfiable core [2025-03-04 10:17:49,559 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:17:49,663 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 10:17:49,663 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 10:17:49,715 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 36 treesize of output 32 [2025-03-04 10:17:49,837 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 10:17:49,837 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1350728113] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 10:17:49,837 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 10:17:49,837 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 15 [2025-03-04 10:17:49,837 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1733267088] [2025-03-04 10:17:49,837 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 10:17:49,837 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2025-03-04 10:17:49,838 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:17:49,838 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2025-03-04 10:17:49,838 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=223, Unknown=0, NotChecked=0, Total=272 [2025-03-04 10:17:50,077 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 40 [2025-03-04 10:17:50,077 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 50 places, 44 transitions, 221 flow. Second operand has 17 states, 17 states have (on average 15.294117647058824) internal successors, (260), 17 states have internal predecessors, (260), 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-03-04 10:17:50,077 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 10:17:50,077 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 40 [2025-03-04 10:17:50,077 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 10:17:50,361 INFO L124 PetriNetUnfolderBase]: 693/1233 cut-off events. [2025-03-04 10:17:50,361 INFO L125 PetriNetUnfolderBase]: For 1288/1288 co-relation queries the response was YES. [2025-03-04 10:17:50,363 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3395 conditions, 1233 events. 693/1233 cut-off events. For 1288/1288 co-relation queries the response was YES. Maximal size of possible extension queue 80. Compared 6128 event pairs, 364 based on Foata normal form. 0/1177 useless extension candidates. Maximal degree in co-relation 2296. Up to 603 conditions per place. [2025-03-04 10:17:50,367 INFO L140 encePairwiseOnDemand]: 27/40 looper letters, 70 selfloop transitions, 15 changer transitions 0/88 dead transitions. [2025-03-04 10:17:50,367 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 57 places, 88 transitions, 532 flow [2025-03-04 10:17:50,367 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-04 10:17:50,367 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2025-03-04 10:17:50,367 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 182 transitions. [2025-03-04 10:17:50,368 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.56875 [2025-03-04 10:17:50,368 INFO L175 Difference]: Start difference. First operand has 50 places, 44 transitions, 221 flow. Second operand 8 states and 182 transitions. [2025-03-04 10:17:50,368 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 57 places, 88 transitions, 532 flow [2025-03-04 10:17:50,370 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 53 places, 88 transitions, 500 flow, removed 0 selfloop flow, removed 4 redundant places. [2025-03-04 10:17:50,371 INFO L231 Difference]: Finished difference. Result has 55 places, 48 transitions, 272 flow [2025-03-04 10:17:50,371 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=201, PETRI_DIFFERENCE_MINUEND_PLACES=46, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=44, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=29, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=272, PETRI_PLACES=55, PETRI_TRANSITIONS=48} [2025-03-04 10:17:50,371 INFO L279 CegarLoopForPetriNet]: 40 programPoint places, 15 predicate places. [2025-03-04 10:17:50,371 INFO L471 AbstractCegarLoop]: Abstraction has has 55 places, 48 transitions, 272 flow [2025-03-04 10:17:50,372 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 15.294117647058824) internal successors, (260), 17 states have internal predecessors, (260), 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-03-04 10:17:50,372 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 10:17:50,372 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:17:50,377 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2025-03-04 10:17:50,572 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:17:50,572 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting thread2Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 19 more)] === [2025-03-04 10:17:50,573 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:17:50,573 INFO L85 PathProgramCache]: Analyzing trace with hash 1602915250, now seen corresponding path program 2 times [2025-03-04 10:17:50,573 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:17:50,573 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [980951287] [2025-03-04 10:17:50,573 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 10:17:50,573 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:17:50,577 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 13 statements into 2 equivalence classes. [2025-03-04 10:17:50,585 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 9 of 13 statements. [2025-03-04 10:17:50,587 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-04 10:17:50,587 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:17:50,736 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-04 10:17:50,736 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:17:50,736 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [980951287] [2025-03-04 10:17:50,736 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [980951287] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:17:50,736 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 10:17:50,736 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 10:17:50,736 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1524509651] [2025-03-04 10:17:50,736 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:17:50,737 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 10:17:50,737 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:17:50,737 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 10:17:50,737 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-04 10:17:50,770 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 40 [2025-03-04 10:17:50,770 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 55 places, 48 transitions, 272 flow. Second operand has 5 states, 5 states have (on average 15.2) internal successors, (76), 5 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:17:50,771 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 10:17:50,771 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 40 [2025-03-04 10:17:50,771 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 10:17:50,897 INFO L124 PetriNetUnfolderBase]: 669/1192 cut-off events. [2025-03-04 10:17:50,898 INFO L125 PetriNetUnfolderBase]: For 1310/1310 co-relation queries the response was YES. [2025-03-04 10:17:50,900 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3432 conditions, 1192 events. 669/1192 cut-off events. For 1310/1310 co-relation queries the response was YES. Maximal size of possible extension queue 77. Compared 5918 event pairs, 446 based on Foata normal form. 0/1160 useless extension candidates. Maximal degree in co-relation 2315. Up to 950 conditions per place. [2025-03-04 10:17:50,903 INFO L140 encePairwiseOnDemand]: 35/40 looper letters, 45 selfloop transitions, 9 changer transitions 0/57 dead transitions. [2025-03-04 10:17:50,903 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 58 places, 57 transitions, 421 flow [2025-03-04 10:17:50,904 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 10:17:50,904 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-03-04 10:17:50,904 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 96 transitions. [2025-03-04 10:17:50,904 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.48 [2025-03-04 10:17:50,904 INFO L175 Difference]: Start difference. First operand has 55 places, 48 transitions, 272 flow. Second operand 5 states and 96 transitions. [2025-03-04 10:17:50,904 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 58 places, 57 transitions, 421 flow [2025-03-04 10:17:50,906 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 53 places, 57 transitions, 406 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-03-04 10:17:50,907 INFO L231 Difference]: Finished difference. Result has 53 places, 47 transitions, 269 flow [2025-03-04 10:17:50,907 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=251, PETRI_DIFFERENCE_MINUEND_PLACES=49, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=47, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=38, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=269, PETRI_PLACES=53, PETRI_TRANSITIONS=47} [2025-03-04 10:17:50,908 INFO L279 CegarLoopForPetriNet]: 40 programPoint places, 13 predicate places. [2025-03-04 10:17:50,908 INFO L471 AbstractCegarLoop]: Abstraction has has 53 places, 47 transitions, 269 flow [2025-03-04 10:17:50,908 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 15.2) internal successors, (76), 5 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:17:50,908 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 10:17:50,908 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:17:50,908 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-04 10:17:50,908 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting thread2Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 19 more)] === [2025-03-04 10:17:50,909 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:17:50,909 INFO L85 PathProgramCache]: Analyzing trace with hash -1491690889, now seen corresponding path program 2 times [2025-03-04 10:17:50,909 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:17:50,909 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [891137357] [2025-03-04 10:17:50,909 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 10:17:50,909 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:17:50,914 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 15 statements into 2 equivalence classes. [2025-03-04 10:17:50,917 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 8 of 15 statements. [2025-03-04 10:17:50,917 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-04 10:17:50,917 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:17:51,011 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-03-04 10:17:51,011 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:17:51,011 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [891137357] [2025-03-04 10:17:51,011 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [891137357] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 10:17:51,011 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1670342052] [2025-03-04 10:17:51,011 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 10:17:51,011 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:17:51,011 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:17:51,013 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 10:17:51,015 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2025-03-04 10:17:51,050 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 15 statements into 2 equivalence classes. [2025-03-04 10:17:51,058 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 8 of 15 statements. [2025-03-04 10:17:51,058 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-04 10:17:51,058 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:17:51,060 INFO L256 TraceCheckSpWp]: Trace formula consists of 97 conjuncts, 20 conjuncts are in the unsatisfiable core [2025-03-04 10:17:51,061 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:17:51,074 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-03-04 10:17:51,226 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-03-04 10:17:51,226 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 10:17:51,365 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-03-04 10:17:51,365 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1670342052] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 10:17:51,365 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 10:17:51,365 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2025-03-04 10:17:51,366 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1004182199] [2025-03-04 10:17:51,366 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 10:17:51,367 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-04 10:17:51,367 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:17:51,367 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-04 10:17:51,368 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2025-03-04 10:17:51,471 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 40 [2025-03-04 10:17:51,472 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 53 places, 47 transitions, 269 flow. Second operand has 11 states, 11 states have (on average 16.545454545454547) internal successors, (182), 11 states have internal predecessors, (182), 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-03-04 10:17:51,472 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 10:17:51,472 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 40 [2025-03-04 10:17:51,472 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 10:17:51,656 INFO L124 PetriNetUnfolderBase]: 612/1092 cut-off events. [2025-03-04 10:17:51,656 INFO L125 PetriNetUnfolderBase]: For 1194/1194 co-relation queries the response was YES. [2025-03-04 10:17:51,657 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3275 conditions, 1092 events. 612/1092 cut-off events. For 1194/1194 co-relation queries the response was YES. Maximal size of possible extension queue 77. Compared 5414 event pairs, 240 based on Foata normal form. 16/1092 useless extension candidates. Maximal degree in co-relation 2134. Up to 560 conditions per place. [2025-03-04 10:17:51,660 INFO L140 encePairwiseOnDemand]: 32/40 looper letters, 38 selfloop transitions, 15 changer transitions 0/56 dead transitions. [2025-03-04 10:17:51,660 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 55 places, 56 transitions, 422 flow [2025-03-04 10:17:51,661 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 10:17:51,661 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-03-04 10:17:51,661 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 95 transitions. [2025-03-04 10:17:51,661 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.475 [2025-03-04 10:17:51,661 INFO L175 Difference]: Start difference. First operand has 53 places, 47 transitions, 269 flow. Second operand 5 states and 95 transitions. [2025-03-04 10:17:51,661 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 55 places, 56 transitions, 422 flow [2025-03-04 10:17:51,663 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 51 places, 56 transitions, 404 flow, removed 0 selfloop flow, removed 4 redundant places. [2025-03-04 10:17:51,664 INFO L231 Difference]: Finished difference. Result has 51 places, 45 transitions, 269 flow [2025-03-04 10:17:51,664 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=239, PETRI_DIFFERENCE_MINUEND_PLACES=47, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=45, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=269, PETRI_PLACES=51, PETRI_TRANSITIONS=45} [2025-03-04 10:17:51,665 INFO L279 CegarLoopForPetriNet]: 40 programPoint places, 11 predicate places. [2025-03-04 10:17:51,665 INFO L471 AbstractCegarLoop]: Abstraction has has 51 places, 45 transitions, 269 flow [2025-03-04 10:17:51,666 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 16.545454545454547) internal successors, (182), 11 states have internal predecessors, (182), 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-03-04 10:17:51,666 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 10:17:51,666 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:17:51,671 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2025-03-04 10:17:51,870 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2025-03-04 10:17:51,870 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 19 more)] === [2025-03-04 10:17:51,870 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:17:51,870 INFO L85 PathProgramCache]: Analyzing trace with hash -685772036, now seen corresponding path program 1 times [2025-03-04 10:17:51,870 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:17:51,870 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [22497504] [2025-03-04 10:17:51,870 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:17:51,870 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:17:51,874 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-03-04 10:17:51,877 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-03-04 10:17:51,877 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:17:51,877 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:17:51,903 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-04 10:17:51,904 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:17:51,904 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [22497504] [2025-03-04 10:17:51,904 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [22497504] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:17:51,904 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 10:17:51,904 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 10:17:51,904 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [107179360] [2025-03-04 10:17:51,904 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:17:51,904 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 10:17:51,905 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:17:51,905 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 10:17:51,905 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 10:17:51,910 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 16 out of 40 [2025-03-04 10:17:51,910 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 51 places, 45 transitions, 269 flow. Second operand has 3 states, 3 states have (on average 21.0) internal successors, (63), 3 states have internal predecessors, (63), 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-03-04 10:17:51,910 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 10:17:51,910 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 16 of 40 [2025-03-04 10:17:51,910 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 10:17:52,006 INFO L124 PetriNetUnfolderBase]: 624/1112 cut-off events. [2025-03-04 10:17:52,006 INFO L125 PetriNetUnfolderBase]: For 1485/1485 co-relation queries the response was YES. [2025-03-04 10:17:52,008 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3421 conditions, 1112 events. 624/1112 cut-off events. For 1485/1485 co-relation queries the response was YES. Maximal size of possible extension queue 77. Compared 5434 event pairs, 171 based on Foata normal form. 2/1108 useless extension candidates. Maximal degree in co-relation 2248. Up to 788 conditions per place. [2025-03-04 10:17:52,012 INFO L140 encePairwiseOnDemand]: 35/40 looper letters, 49 selfloop transitions, 7 changer transitions 1/60 dead transitions. [2025-03-04 10:17:52,012 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 60 transitions, 442 flow [2025-03-04 10:17:52,013 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 10:17:52,013 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 10:17:52,013 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 86 transitions. [2025-03-04 10:17:52,013 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7166666666666667 [2025-03-04 10:17:52,013 INFO L175 Difference]: Start difference. First operand has 51 places, 45 transitions, 269 flow. Second operand 3 states and 86 transitions. [2025-03-04 10:17:52,013 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 60 transitions, 442 flow [2025-03-04 10:17:52,017 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 60 transitions, 406 flow, removed 0 selfloop flow, removed 4 redundant places. [2025-03-04 10:17:52,019 INFO L231 Difference]: Finished difference. Result has 50 places, 48 transitions, 288 flow [2025-03-04 10:17:52,019 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=239, PETRI_DIFFERENCE_MINUEND_PLACES=47, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=45, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=38, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=288, PETRI_PLACES=50, PETRI_TRANSITIONS=48} [2025-03-04 10:17:52,019 INFO L279 CegarLoopForPetriNet]: 40 programPoint places, 10 predicate places. [2025-03-04 10:17:52,020 INFO L471 AbstractCegarLoop]: Abstraction has has 50 places, 48 transitions, 288 flow [2025-03-04 10:17:52,020 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 21.0) internal successors, (63), 3 states have internal predecessors, (63), 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-03-04 10:17:52,020 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 10:17:52,020 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:17:52,020 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-04 10:17:52,020 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 19 more)] === [2025-03-04 10:17:52,021 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:17:52,022 INFO L85 PathProgramCache]: Analyzing trace with hash 1438343004, now seen corresponding path program 1 times [2025-03-04 10:17:52,022 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:17:52,022 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1545614076] [2025-03-04 10:17:52,022 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:17:52,022 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:17:52,027 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-03-04 10:17:52,032 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-03-04 10:17:52,033 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:17:52,033 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:17:52,086 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-04 10:17:52,086 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:17:52,086 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1545614076] [2025-03-04 10:17:52,087 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1545614076] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:17:52,087 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 10:17:52,087 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-04 10:17:52,087 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [370815048] [2025-03-04 10:17:52,087 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:17:52,087 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 10:17:52,087 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:17:52,088 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 10:17:52,088 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-04 10:17:52,094 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 15 out of 40 [2025-03-04 10:17:52,094 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 50 places, 48 transitions, 288 flow. Second operand has 5 states, 5 states have (on average 18.6) internal successors, (93), 5 states have internal predecessors, (93), 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-03-04 10:17:52,094 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 10:17:52,094 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 15 of 40 [2025-03-04 10:17:52,094 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 10:17:52,238 INFO L124 PetriNetUnfolderBase]: 698/1206 cut-off events. [2025-03-04 10:17:52,238 INFO L125 PetriNetUnfolderBase]: For 1555/1555 co-relation queries the response was YES. [2025-03-04 10:17:52,240 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3695 conditions, 1206 events. 698/1206 cut-off events. For 1555/1555 co-relation queries the response was YES. Maximal size of possible extension queue 75. Compared 6126 event pairs, 263 based on Foata normal form. 18/1218 useless extension candidates. Maximal degree in co-relation 2439. Up to 664 conditions per place. [2025-03-04 10:17:52,244 INFO L140 encePairwiseOnDemand]: 33/40 looper letters, 85 selfloop transitions, 9 changer transitions 0/96 dead transitions. [2025-03-04 10:17:52,244 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 54 places, 96 transitions, 757 flow [2025-03-04 10:17:52,244 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 10:17:52,244 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-03-04 10:17:52,244 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 131 transitions. [2025-03-04 10:17:52,244 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.655 [2025-03-04 10:17:52,244 INFO L175 Difference]: Start difference. First operand has 50 places, 48 transitions, 288 flow. Second operand 5 states and 131 transitions. [2025-03-04 10:17:52,244 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 54 places, 96 transitions, 757 flow [2025-03-04 10:17:52,247 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 53 places, 96 transitions, 734 flow, removed 3 selfloop flow, removed 1 redundant places. [2025-03-04 10:17:52,248 INFO L231 Difference]: Finished difference. Result has 56 places, 52 transitions, 350 flow [2025-03-04 10:17:52,248 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=279, PETRI_DIFFERENCE_MINUEND_PLACES=49, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=48, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=39, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=350, PETRI_PLACES=56, PETRI_TRANSITIONS=52} [2025-03-04 10:17:52,248 INFO L279 CegarLoopForPetriNet]: 40 programPoint places, 16 predicate places. [2025-03-04 10:17:52,249 INFO L471 AbstractCegarLoop]: Abstraction has has 56 places, 52 transitions, 350 flow [2025-03-04 10:17:52,249 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 18.6) internal successors, (93), 5 states have internal predecessors, (93), 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-03-04 10:17:52,249 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 10:17:52,249 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:17:52,249 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-04 10:17:52,249 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 19 more)] === [2025-03-04 10:17:52,249 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:17:52,249 INFO L85 PathProgramCache]: Analyzing trace with hash 1533619170, now seen corresponding path program 2 times [2025-03-04 10:17:52,250 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:17:52,250 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1868857959] [2025-03-04 10:17:52,250 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 10:17:52,250 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:17:52,253 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 19 statements into 2 equivalence classes. [2025-03-04 10:17:52,257 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 17 of 19 statements. [2025-03-04 10:17:52,257 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-04 10:17:52,257 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:17:52,341 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-04 10:17:52,341 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:17:52,341 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1868857959] [2025-03-04 10:17:52,341 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1868857959] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:17:52,342 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 10:17:52,342 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-04 10:17:52,342 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1852192940] [2025-03-04 10:17:52,342 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:17:52,342 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-04 10:17:52,342 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:17:52,342 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-04 10:17:52,342 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-03-04 10:17:52,344 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 40 [2025-03-04 10:17:52,344 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 56 places, 52 transitions, 350 flow. Second operand has 7 states, 7 states have (on average 16.571428571428573) internal successors, (116), 7 states have internal predecessors, (116), 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-03-04 10:17:52,344 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 10:17:52,344 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 40 [2025-03-04 10:17:52,344 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 10:17:52,541 INFO L124 PetriNetUnfolderBase]: 744/1278 cut-off events. [2025-03-04 10:17:52,542 INFO L125 PetriNetUnfolderBase]: For 2686/2686 co-relation queries the response was YES. [2025-03-04 10:17:52,544 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4491 conditions, 1278 events. 744/1278 cut-off events. For 2686/2686 co-relation queries the response was YES. Maximal size of possible extension queue 76. Compared 6164 event pairs, 150 based on Foata normal form. 60/1338 useless extension candidates. Maximal degree in co-relation 2711. Up to 594 conditions per place. [2025-03-04 10:17:52,548 INFO L140 encePairwiseOnDemand]: 30/40 looper letters, 90 selfloop transitions, 28 changer transitions 0/119 dead transitions. [2025-03-04 10:17:52,549 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 63 places, 119 transitions, 985 flow [2025-03-04 10:17:52,549 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-04 10:17:52,549 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2025-03-04 10:17:52,549 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 191 transitions. [2025-03-04 10:17:52,550 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.596875 [2025-03-04 10:17:52,550 INFO L175 Difference]: Start difference. First operand has 56 places, 52 transitions, 350 flow. Second operand 8 states and 191 transitions. [2025-03-04 10:17:52,550 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 63 places, 119 transitions, 985 flow [2025-03-04 10:17:52,554 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 61 places, 119 transitions, 951 flow, removed 2 selfloop flow, removed 2 redundant places. [2025-03-04 10:17:52,555 INFO L231 Difference]: Finished difference. Result has 68 places, 69 transitions, 611 flow [2025-03-04 10:17:52,555 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=337, PETRI_DIFFERENCE_MINUEND_PLACES=54, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=52, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=32, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=611, PETRI_PLACES=68, PETRI_TRANSITIONS=69} [2025-03-04 10:17:52,556 INFO L279 CegarLoopForPetriNet]: 40 programPoint places, 28 predicate places. [2025-03-04 10:17:52,556 INFO L471 AbstractCegarLoop]: Abstraction has has 68 places, 69 transitions, 611 flow [2025-03-04 10:17:52,556 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 16.571428571428573) internal successors, (116), 7 states have internal predecessors, (116), 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-03-04 10:17:52,556 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 10:17:52,556 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:17:52,557 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-03-04 10:17:52,557 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 19 more)] === [2025-03-04 10:17:52,558 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:17:52,558 INFO L85 PathProgramCache]: Analyzing trace with hash 1198952388, now seen corresponding path program 3 times [2025-03-04 10:17:52,558 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:17:52,558 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1813487681] [2025-03-04 10:17:52,558 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-04 10:17:52,558 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:17:52,562 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 19 statements into 2 equivalence classes. [2025-03-04 10:17:52,567 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 17 of 19 statements. [2025-03-04 10:17:52,567 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-03-04 10:17:52,567 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:17:52,639 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-04 10:17:52,639 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:17:52,639 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1813487681] [2025-03-04 10:17:52,639 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1813487681] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:17:52,639 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 10:17:52,639 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-04 10:17:52,639 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1466812252] [2025-03-04 10:17:52,639 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:17:52,640 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 10:17:52,640 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:17:52,640 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 10:17:52,640 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2025-03-04 10:17:52,643 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 40 [2025-03-04 10:17:52,643 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 68 places, 69 transitions, 611 flow. Second operand has 5 states, 5 states have (on average 17.6) internal successors, (88), 5 states have internal predecessors, (88), 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-03-04 10:17:52,643 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 10:17:52,643 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 40 [2025-03-04 10:17:52,643 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 10:17:52,826 INFO L124 PetriNetUnfolderBase]: 836/1428 cut-off events. [2025-03-04 10:17:52,827 INFO L125 PetriNetUnfolderBase]: For 5934/5934 co-relation queries the response was YES. [2025-03-04 10:17:52,829 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6268 conditions, 1428 events. 836/1428 cut-off events. For 5934/5934 co-relation queries the response was YES. Maximal size of possible extension queue 82. Compared 7196 event pairs, 254 based on Foata normal form. 8/1436 useless extension candidates. Maximal degree in co-relation 4062. Up to 686 conditions per place. [2025-03-04 10:17:52,834 INFO L140 encePairwiseOnDemand]: 32/40 looper letters, 91 selfloop transitions, 31 changer transitions 1/124 dead transitions. [2025-03-04 10:17:52,834 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 72 places, 124 transitions, 1342 flow [2025-03-04 10:17:52,834 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 10:17:52,834 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-03-04 10:17:52,835 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 130 transitions. [2025-03-04 10:17:52,835 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.65 [2025-03-04 10:17:52,835 INFO L175 Difference]: Start difference. First operand has 68 places, 69 transitions, 611 flow. Second operand 5 states and 130 transitions. [2025-03-04 10:17:52,835 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 72 places, 124 transitions, 1342 flow [2025-03-04 10:17:52,842 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 71 places, 124 transitions, 1287 flow, removed 14 selfloop flow, removed 1 redundant places. [2025-03-04 10:17:52,843 INFO L231 Difference]: Finished difference. Result has 74 places, 86 transitions, 923 flow [2025-03-04 10:17:52,843 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=584, PETRI_DIFFERENCE_MINUEND_PLACES=67, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=69, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=16, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=44, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=923, PETRI_PLACES=74, PETRI_TRANSITIONS=86} [2025-03-04 10:17:52,844 INFO L279 CegarLoopForPetriNet]: 40 programPoint places, 34 predicate places. [2025-03-04 10:17:52,844 INFO L471 AbstractCegarLoop]: Abstraction has has 74 places, 86 transitions, 923 flow [2025-03-04 10:17:52,844 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 17.6) internal successors, (88), 5 states have internal predecessors, (88), 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-03-04 10:17:52,844 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 10:17:52,844 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:17:52,844 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-03-04 10:17:52,845 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 19 more)] === [2025-03-04 10:17:52,846 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:17:52,846 INFO L85 PathProgramCache]: Analyzing trace with hash -1761964446, now seen corresponding path program 4 times [2025-03-04 10:17:52,846 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:17:52,846 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2073042455] [2025-03-04 10:17:52,846 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-04 10:17:52,846 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:17:52,850 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 19 statements into 2 equivalence classes. [2025-03-04 10:17:52,859 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 19 of 19 statements. [2025-03-04 10:17:52,859 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-03-04 10:17:52,859 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:17:52,966 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-04 10:17:52,966 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:17:52,966 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2073042455] [2025-03-04 10:17:52,966 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2073042455] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:17:52,966 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 10:17:52,966 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-04 10:17:52,967 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [830274107] [2025-03-04 10:17:52,967 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:17:52,967 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 10:17:52,967 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:17:52,967 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 10:17:52,967 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-04 10:17:52,974 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 15 out of 40 [2025-03-04 10:17:52,974 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 74 places, 86 transitions, 923 flow. Second operand has 6 states, 6 states have (on average 18.0) internal successors, (108), 6 states have internal predecessors, (108), 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-03-04 10:17:52,974 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 10:17:52,974 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 15 of 40 [2025-03-04 10:17:52,975 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 10:17:53,189 INFO L124 PetriNetUnfolderBase]: 842/1468 cut-off events. [2025-03-04 10:17:53,189 INFO L125 PetriNetUnfolderBase]: For 7912/7912 co-relation queries the response was YES. [2025-03-04 10:17:53,193 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6920 conditions, 1468 events. 842/1468 cut-off events. For 7912/7912 co-relation queries the response was YES. Maximal size of possible extension queue 92. Compared 7456 event pairs, 332 based on Foata normal form. 16/1484 useless extension candidates. Maximal degree in co-relation 4546. Up to 905 conditions per place. [2025-03-04 10:17:53,198 INFO L140 encePairwiseOnDemand]: 30/40 looper letters, 76 selfloop transitions, 48 changer transitions 1/127 dead transitions. [2025-03-04 10:17:53,198 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 79 places, 127 transitions, 1535 flow [2025-03-04 10:17:53,200 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 10:17:53,200 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-04 10:17:53,201 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 149 transitions. [2025-03-04 10:17:53,201 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6208333333333333 [2025-03-04 10:17:53,201 INFO L175 Difference]: Start difference. First operand has 74 places, 86 transitions, 923 flow. Second operand 6 states and 149 transitions. [2025-03-04 10:17:53,201 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 79 places, 127 transitions, 1535 flow [2025-03-04 10:17:53,215 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 78 places, 127 transitions, 1507 flow, removed 3 selfloop flow, removed 1 redundant places. [2025-03-04 10:17:53,216 INFO L231 Difference]: Finished difference. Result has 82 places, 104 transitions, 1318 flow [2025-03-04 10:17:53,217 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=902, PETRI_DIFFERENCE_MINUEND_PLACES=73, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=86, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=30, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=44, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1318, PETRI_PLACES=82, PETRI_TRANSITIONS=104} [2025-03-04 10:17:53,217 INFO L279 CegarLoopForPetriNet]: 40 programPoint places, 42 predicate places. [2025-03-04 10:17:53,217 INFO L471 AbstractCegarLoop]: Abstraction has has 82 places, 104 transitions, 1318 flow [2025-03-04 10:17:53,217 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 18.0) internal successors, (108), 6 states have internal predecessors, (108), 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-03-04 10:17:53,217 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 10:17:53,217 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:17:53,217 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-03-04 10:17:53,217 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 19 more)] === [2025-03-04 10:17:53,218 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:17:53,218 INFO L85 PathProgramCache]: Analyzing trace with hash 2066767740, now seen corresponding path program 5 times [2025-03-04 10:17:53,218 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:17:53,218 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2141923331] [2025-03-04 10:17:53,218 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-04 10:17:53,218 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:17:53,229 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 19 statements into 2 equivalence classes. [2025-03-04 10:17:53,237 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 19 of 19 statements. [2025-03-04 10:17:53,241 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 10:17:53,241 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:17:53,319 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-04 10:17:53,319 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:17:53,319 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2141923331] [2025-03-04 10:17:53,319 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2141923331] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:17:53,319 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 10:17:53,319 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-04 10:17:53,319 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [763893842] [2025-03-04 10:17:53,319 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:17:53,320 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 10:17:53,320 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:17:53,321 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 10:17:53,321 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2025-03-04 10:17:53,325 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 40 [2025-03-04 10:17:53,325 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 82 places, 104 transitions, 1318 flow. Second operand has 6 states, 6 states have (on average 17.0) internal successors, (102), 6 states have internal predecessors, (102), 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-03-04 10:17:53,325 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 10:17:53,325 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 40 [2025-03-04 10:17:53,325 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 10:17:53,524 INFO L124 PetriNetUnfolderBase]: 850/1452 cut-off events. [2025-03-04 10:17:53,524 INFO L125 PetriNetUnfolderBase]: For 9874/9874 co-relation queries the response was YES. [2025-03-04 10:17:53,528 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7484 conditions, 1452 events. 850/1452 cut-off events. For 9874/9874 co-relation queries the response was YES. Maximal size of possible extension queue 88. Compared 7334 event pairs, 226 based on Foata normal form. 12/1464 useless extension candidates. Maximal degree in co-relation 4963. Up to 706 conditions per place. [2025-03-04 10:17:53,537 INFO L140 encePairwiseOnDemand]: 31/40 looper letters, 106 selfloop transitions, 45 changer transitions 1/153 dead transitions. [2025-03-04 10:17:53,537 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 87 places, 153 transitions, 1922 flow [2025-03-04 10:17:53,538 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 10:17:53,538 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-04 10:17:53,538 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 156 transitions. [2025-03-04 10:17:53,538 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.65 [2025-03-04 10:17:53,538 INFO L175 Difference]: Start difference. First operand has 82 places, 104 transitions, 1318 flow. Second operand 6 states and 156 transitions. [2025-03-04 10:17:53,538 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 87 places, 153 transitions, 1922 flow [2025-03-04 10:17:53,559 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 86 places, 153 transitions, 1852 flow, removed 19 selfloop flow, removed 1 redundant places. [2025-03-04 10:17:53,560 INFO L231 Difference]: Finished difference. Result has 88 places, 108 transitions, 1437 flow [2025-03-04 10:17:53,561 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=1248, PETRI_DIFFERENCE_MINUEND_PLACES=81, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=104, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=41, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=59, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1437, PETRI_PLACES=88, PETRI_TRANSITIONS=108} [2025-03-04 10:17:53,561 INFO L279 CegarLoopForPetriNet]: 40 programPoint places, 48 predicate places. [2025-03-04 10:17:53,561 INFO L471 AbstractCegarLoop]: Abstraction has has 88 places, 108 transitions, 1437 flow [2025-03-04 10:17:53,561 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 17.0) internal successors, (102), 6 states have internal predecessors, (102), 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-03-04 10:17:53,561 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 10:17:53,561 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] [2025-03-04 10:17:53,561 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-03-04 10:17:53,562 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 19 more)] === [2025-03-04 10:17:53,563 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:17:53,563 INFO L85 PathProgramCache]: Analyzing trace with hash 1340356797, now seen corresponding path program 1 times [2025-03-04 10:17:53,563 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:17:53,563 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [993165123] [2025-03-04 10:17:53,563 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:17:53,563 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:17:53,571 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 21 statements into 1 equivalence classes. [2025-03-04 10:17:53,578 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 21 of 21 statements. [2025-03-04 10:17:53,578 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:17:53,578 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:17:53,686 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-04 10:17:53,687 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:17:53,687 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [993165123] [2025-03-04 10:17:53,687 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [993165123] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 10:17:53,687 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [954005635] [2025-03-04 10:17:53,687 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:17:53,687 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:17:53,687 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:17:53,690 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 10:17:53,691 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2025-03-04 10:17:53,724 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 21 statements into 1 equivalence classes. [2025-03-04 10:17:53,737 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 21 of 21 statements. [2025-03-04 10:17:53,737 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:17:53,737 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:17:53,739 INFO L256 TraceCheckSpWp]: Trace formula consists of 156 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-03-04 10:17:53,739 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:17:53,788 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 15 treesize of output 7 [2025-03-04 10:17:53,792 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-04 10:17:53,792 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 10:17:53,831 INFO L349 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2025-03-04 10:17:53,831 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 19 treesize of output 7 [2025-03-04 10:17:53,839 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-04 10:17:53,839 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [954005635] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 10:17:53,839 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 10:17:53,839 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4, 3] total 8 [2025-03-04 10:17:53,839 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [249696375] [2025-03-04 10:17:53,839 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 10:17:53,840 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-04 10:17:53,840 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:17:53,840 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-04 10:17:53,840 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2025-03-04 10:17:53,891 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 16 out of 40 [2025-03-04 10:17:53,892 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 88 places, 108 transitions, 1437 flow. Second operand has 9 states, 9 states have (on average 21.666666666666668) internal successors, (195), 9 states have internal predecessors, (195), 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-03-04 10:17:53,892 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 10:17:53,892 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 16 of 40 [2025-03-04 10:17:53,892 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 10:17:54,110 INFO L124 PetriNetUnfolderBase]: 1146/2019 cut-off events. [2025-03-04 10:17:54,110 INFO L125 PetriNetUnfolderBase]: For 14581/14581 co-relation queries the response was YES. [2025-03-04 10:17:54,114 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10096 conditions, 2019 events. 1146/2019 cut-off events. For 14581/14581 co-relation queries the response was YES. Maximal size of possible extension queue 108. Compared 10836 event pairs, 165 based on Foata normal form. 2/2017 useless extension candidates. Maximal degree in co-relation 8777. Up to 1001 conditions per place. [2025-03-04 10:17:54,118 INFO L140 encePairwiseOnDemand]: 33/40 looper letters, 106 selfloop transitions, 58 changer transitions 1/173 dead transitions. [2025-03-04 10:17:54,118 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 94 places, 173 transitions, 2227 flow [2025-03-04 10:17:54,118 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-04 10:17:54,118 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-03-04 10:17:54,119 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 185 transitions. [2025-03-04 10:17:54,119 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6607142857142857 [2025-03-04 10:17:54,119 INFO L175 Difference]: Start difference. First operand has 88 places, 108 transitions, 1437 flow. Second operand 7 states and 185 transitions. [2025-03-04 10:17:54,119 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 94 places, 173 transitions, 2227 flow [2025-03-04 10:17:54,139 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 92 places, 173 transitions, 2164 flow, removed 4 selfloop flow, removed 2 redundant places. [2025-03-04 10:17:54,140 INFO L231 Difference]: Finished difference. Result has 94 places, 129 transitions, 1725 flow [2025-03-04 10:17:54,141 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=1378, PETRI_DIFFERENCE_MINUEND_PLACES=86, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=108, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=45, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=60, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=1725, PETRI_PLACES=94, PETRI_TRANSITIONS=129} [2025-03-04 10:17:54,141 INFO L279 CegarLoopForPetriNet]: 40 programPoint places, 54 predicate places. [2025-03-04 10:17:54,141 INFO L471 AbstractCegarLoop]: Abstraction has has 94 places, 129 transitions, 1725 flow [2025-03-04 10:17:54,141 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 21.666666666666668) internal successors, (195), 9 states have internal predecessors, (195), 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-03-04 10:17:54,141 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 10:17:54,141 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] [2025-03-04 10:17:54,147 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2025-03-04 10:17:54,345 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:17:54,345 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 19 more)] === [2025-03-04 10:17:54,345 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:17:54,345 INFO L85 PathProgramCache]: Analyzing trace with hash -1177761947, now seen corresponding path program 2 times [2025-03-04 10:17:54,345 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:17:54,345 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [827614881] [2025-03-04 10:17:54,345 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 10:17:54,345 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:17:54,349 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 21 statements into 2 equivalence classes. [2025-03-04 10:17:54,354 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 19 of 21 statements. [2025-03-04 10:17:54,354 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-04 10:17:54,354 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:17:54,450 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-04 10:17:54,450 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:17:54,450 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [827614881] [2025-03-04 10:17:54,450 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [827614881] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:17:54,450 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 10:17:54,450 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-04 10:17:54,450 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [136926141] [2025-03-04 10:17:54,450 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:17:54,450 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 10:17:54,450 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:17:54,450 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 10:17:54,450 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-04 10:17:54,479 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 16 out of 40 [2025-03-04 10:17:54,480 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 94 places, 129 transitions, 1725 flow. Second operand has 6 states, 6 states have (on average 19.166666666666668) internal successors, (115), 6 states have internal predecessors, (115), 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-03-04 10:17:54,480 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 10:17:54,480 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 16 of 40 [2025-03-04 10:17:54,480 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 10:17:54,746 INFO L124 PetriNetUnfolderBase]: 1235/2210 cut-off events. [2025-03-04 10:17:54,746 INFO L125 PetriNetUnfolderBase]: For 16991/16991 co-relation queries the response was YES. [2025-03-04 10:17:54,753 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11367 conditions, 2210 events. 1235/2210 cut-off events. For 16991/16991 co-relation queries the response was YES. Maximal size of possible extension queue 116. Compared 12319 event pairs, 337 based on Foata normal form. 2/2206 useless extension candidates. Maximal degree in co-relation 9875. Up to 1456 conditions per place. [2025-03-04 10:17:54,761 INFO L140 encePairwiseOnDemand]: 33/40 looper letters, 104 selfloop transitions, 53 changer transitions 1/166 dead transitions. [2025-03-04 10:17:54,761 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 99 places, 166 transitions, 2375 flow [2025-03-04 10:17:54,761 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 10:17:54,761 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-04 10:17:54,762 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 148 transitions. [2025-03-04 10:17:54,762 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6166666666666667 [2025-03-04 10:17:54,762 INFO L175 Difference]: Start difference. First operand has 94 places, 129 transitions, 1725 flow. Second operand 6 states and 148 transitions. [2025-03-04 10:17:54,762 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 99 places, 166 transitions, 2375 flow [2025-03-04 10:17:54,794 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 97 places, 166 transitions, 2295 flow, removed 21 selfloop flow, removed 2 redundant places. [2025-03-04 10:17:54,797 INFO L231 Difference]: Finished difference. Result has 99 places, 139 transitions, 1945 flow [2025-03-04 10:17:54,798 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=1645, PETRI_DIFFERENCE_MINUEND_PLACES=92, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=129, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=45, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=78, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1945, PETRI_PLACES=99, PETRI_TRANSITIONS=139} [2025-03-04 10:17:54,798 INFO L279 CegarLoopForPetriNet]: 40 programPoint places, 59 predicate places. [2025-03-04 10:17:54,798 INFO L471 AbstractCegarLoop]: Abstraction has has 99 places, 139 transitions, 1945 flow [2025-03-04 10:17:54,798 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 19.166666666666668) internal successors, (115), 6 states have internal predecessors, (115), 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-03-04 10:17:54,798 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 10:17:54,798 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] [2025-03-04 10:17:54,799 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-03-04 10:17:54,799 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 19 more)] === [2025-03-04 10:17:54,799 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:17:54,799 INFO L85 PathProgramCache]: Analyzing trace with hash -714338479, now seen corresponding path program 1 times [2025-03-04 10:17:54,799 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:17:54,799 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1100591590] [2025-03-04 10:17:54,799 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:17:54,799 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:17:54,804 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 21 statements into 1 equivalence classes. [2025-03-04 10:17:54,817 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 21 of 21 statements. [2025-03-04 10:17:54,817 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:17:54,817 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:17:54,910 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-04 10:17:54,911 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:17:54,911 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1100591590] [2025-03-04 10:17:54,911 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1100591590] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:17:54,911 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 10:17:54,911 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-04 10:17:54,911 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [468379607] [2025-03-04 10:17:54,911 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:17:54,911 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-04 10:17:54,912 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:17:54,912 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-04 10:17:54,912 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2025-03-04 10:17:54,915 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 40 [2025-03-04 10:17:54,916 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 139 transitions, 1945 flow. Second operand has 7 states, 7 states have (on average 16.857142857142858) internal successors, (118), 7 states have internal predecessors, (118), 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-03-04 10:17:54,916 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 10:17:54,916 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 40 [2025-03-04 10:17:54,916 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 10:17:55,241 INFO L124 PetriNetUnfolderBase]: 1411/2418 cut-off events. [2025-03-04 10:17:55,241 INFO L125 PetriNetUnfolderBase]: For 17755/17755 co-relation queries the response was YES. [2025-03-04 10:17:55,248 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12547 conditions, 2418 events. 1411/2418 cut-off events. For 17755/17755 co-relation queries the response was YES. Maximal size of possible extension queue 121. Compared 13255 event pairs, 560 based on Foata normal form. 12/2430 useless extension candidates. Maximal degree in co-relation 11804. Up to 1577 conditions per place. [2025-03-04 10:17:55,256 INFO L140 encePairwiseOnDemand]: 32/40 looper letters, 136 selfloop transitions, 45 changer transitions 0/182 dead transitions. [2025-03-04 10:17:55,256 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 105 places, 182 transitions, 2644 flow [2025-03-04 10:17:55,256 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-04 10:17:55,257 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-03-04 10:17:55,257 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 163 transitions. [2025-03-04 10:17:55,257 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5821428571428572 [2025-03-04 10:17:55,257 INFO L175 Difference]: Start difference. First operand has 99 places, 139 transitions, 1945 flow. Second operand 7 states and 163 transitions. [2025-03-04 10:17:55,257 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 105 places, 182 transitions, 2644 flow [2025-03-04 10:17:55,289 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 103 places, 182 transitions, 2573 flow, removed 15 selfloop flow, removed 2 redundant places. [2025-03-04 10:17:55,293 INFO L231 Difference]: Finished difference. Result has 107 places, 145 transitions, 2116 flow [2025-03-04 10:17:55,293 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=1884, PETRI_DIFFERENCE_MINUEND_PLACES=97, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=139, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=39, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=96, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=2116, PETRI_PLACES=107, PETRI_TRANSITIONS=145} [2025-03-04 10:17:55,293 INFO L279 CegarLoopForPetriNet]: 40 programPoint places, 67 predicate places. [2025-03-04 10:17:55,294 INFO L471 AbstractCegarLoop]: Abstraction has has 107 places, 145 transitions, 2116 flow [2025-03-04 10:17:55,294 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 16.857142857142858) internal successors, (118), 7 states have internal predecessors, (118), 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-03-04 10:17:55,294 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 10:17:55,294 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] [2025-03-04 10:17:55,294 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-03-04 10:17:55,294 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 19 more)] === [2025-03-04 10:17:55,295 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:17:55,295 INFO L85 PathProgramCache]: Analyzing trace with hash 60557363, now seen corresponding path program 2 times [2025-03-04 10:17:55,295 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:17:55,295 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1980246326] [2025-03-04 10:17:55,295 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 10:17:55,295 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:17:55,300 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 21 statements into 2 equivalence classes. [2025-03-04 10:17:55,311 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 21 of 21 statements. [2025-03-04 10:17:55,312 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 10:17:55,312 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:17:55,464 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-04 10:17:55,464 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:17:55,464 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1980246326] [2025-03-04 10:17:55,464 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1980246326] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 10:17:55,464 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [433536394] [2025-03-04 10:17:55,464 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 10:17:55,464 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:17:55,464 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:17:55,466 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 10:17:55,467 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2025-03-04 10:17:55,502 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 21 statements into 2 equivalence classes. [2025-03-04 10:17:55,522 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 21 of 21 statements. [2025-03-04 10:17:55,522 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 10:17:55,522 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:17:55,523 INFO L256 TraceCheckSpWp]: Trace formula consists of 156 conjuncts, 28 conjuncts are in the unsatisfiable core [2025-03-04 10:17:55,524 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:17:55,560 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 15 treesize of output 1 [2025-03-04 10:17:55,666 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 10:17:55,666 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 10:17:55,792 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 72 treesize of output 64 [2025-03-04 10:17:55,810 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-04 10:17:55,810 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 118 treesize of output 116 [2025-03-04 10:17:56,293 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 10:17:56,293 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [433536394] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 10:17:56,293 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 10:17:56,293 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 6, 6] total 19 [2025-03-04 10:17:56,293 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [502758925] [2025-03-04 10:17:56,293 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 10:17:56,294 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2025-03-04 10:17:56,294 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:17:56,295 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2025-03-04 10:17:56,295 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=282, Unknown=0, NotChecked=0, Total=342 [2025-03-04 10:17:56,586 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 40 [2025-03-04 10:17:56,587 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 107 places, 145 transitions, 2116 flow. Second operand has 19 states, 19 states have (on average 17.157894736842106) internal successors, (326), 19 states have internal predecessors, (326), 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-03-04 10:17:56,587 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 10:17:56,587 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 40 [2025-03-04 10:17:56,587 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 10:17:58,765 INFO L124 PetriNetUnfolderBase]: 4031/6740 cut-off events. [2025-03-04 10:17:58,766 INFO L125 PetriNetUnfolderBase]: For 39645/39645 co-relation queries the response was YES. [2025-03-04 10:17:58,786 INFO L83 FinitePrefix]: Finished finitePrefix Result has 32352 conditions, 6740 events. 4031/6740 cut-off events. For 39645/39645 co-relation queries the response was YES. Maximal size of possible extension queue 275. Compared 40855 event pairs, 164 based on Foata normal form. 23/6763 useless extension candidates. Maximal degree in co-relation 31683. Up to 1371 conditions per place. [2025-03-04 10:17:58,804 INFO L140 encePairwiseOnDemand]: 25/40 looper letters, 354 selfloop transitions, 217 changer transitions 196/768 dead transitions. [2025-03-04 10:17:58,804 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 162 places, 768 transitions, 9003 flow [2025-03-04 10:17:58,804 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 56 states. [2025-03-04 10:17:58,804 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56 states. [2025-03-04 10:17:58,807 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 1277 transitions. [2025-03-04 10:17:58,808 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5700892857142857 [2025-03-04 10:17:58,808 INFO L175 Difference]: Start difference. First operand has 107 places, 145 transitions, 2116 flow. Second operand 56 states and 1277 transitions. [2025-03-04 10:17:58,808 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 162 places, 768 transitions, 9003 flow [2025-03-04 10:17:58,890 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 161 places, 768 transitions, 8877 flow, removed 28 selfloop flow, removed 1 redundant places. [2025-03-04 10:17:58,898 INFO L231 Difference]: Finished difference. Result has 199 places, 301 transitions, 4500 flow [2025-03-04 10:17:58,899 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=2068, PETRI_DIFFERENCE_MINUEND_PLACES=106, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=145, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=67, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=64, PETRI_DIFFERENCE_SUBTRAHEND_STATES=56, PETRI_FLOW=4500, PETRI_PLACES=199, PETRI_TRANSITIONS=301} [2025-03-04 10:17:58,899 INFO L279 CegarLoopForPetriNet]: 40 programPoint places, 159 predicate places. [2025-03-04 10:17:58,899 INFO L471 AbstractCegarLoop]: Abstraction has has 199 places, 301 transitions, 4500 flow [2025-03-04 10:17:58,899 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 17.157894736842106) internal successors, (326), 19 states have internal predecessors, (326), 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-03-04 10:17:58,899 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 10:17:58,899 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:17:58,906 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2025-03-04 10:17:59,100 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable21 [2025-03-04 10:17:59,100 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 19 more)] === [2025-03-04 10:17:59,100 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:17:59,100 INFO L85 PathProgramCache]: Analyzing trace with hash 356270278, now seen corresponding path program 3 times [2025-03-04 10:17:59,100 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:17:59,100 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1582610538] [2025-03-04 10:17:59,101 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-04 10:17:59,101 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:17:59,105 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 23 statements into 2 equivalence classes. [2025-03-04 10:17:59,112 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 23 of 23 statements. [2025-03-04 10:17:59,112 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-03-04 10:17:59,112 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:17:59,285 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 10:17:59,286 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:17:59,286 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1582610538] [2025-03-04 10:17:59,286 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1582610538] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 10:17:59,286 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [132114456] [2025-03-04 10:17:59,286 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-04 10:17:59,286 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:17:59,286 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:17:59,288 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 10:17:59,289 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2025-03-04 10:17:59,322 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 23 statements into 2 equivalence classes. [2025-03-04 10:17:59,337 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 23 of 23 statements. [2025-03-04 10:17:59,337 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-03-04 10:17:59,337 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:17:59,338 INFO L256 TraceCheckSpWp]: Trace formula consists of 166 conjuncts, 28 conjuncts are in the unsatisfiable core [2025-03-04 10:17:59,339 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:17:59,363 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 15 treesize of output 1 [2025-03-04 10:17:59,430 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 15 treesize of output 7 [2025-03-04 10:17:59,433 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 10:17:59,433 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 10:17:59,572 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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-03-04 10:17:59,578 INFO L349 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2025-03-04 10:17:59,578 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 62 treesize of output 41 [2025-03-04 10:17:59,617 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 10:17:59,617 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [132114456] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 10:17:59,617 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 10:17:59,617 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 16 [2025-03-04 10:17:59,617 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1679096597] [2025-03-04 10:17:59,618 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 10:17:59,618 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2025-03-04 10:17:59,618 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:17:59,618 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2025-03-04 10:17:59,618 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=226, Unknown=0, NotChecked=0, Total=272 [2025-03-04 10:17:59,833 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 40 [2025-03-04 10:17:59,833 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 199 places, 301 transitions, 4500 flow. Second operand has 17 states, 17 states have (on average 15.058823529411764) internal successors, (256), 17 states have internal predecessors, (256), 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-03-04 10:17:59,834 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 10:17:59,834 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 40 [2025-03-04 10:17:59,834 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 10:18:00,695 INFO L124 PetriNetUnfolderBase]: 2674/4717 cut-off events. [2025-03-04 10:18:00,695 INFO L125 PetriNetUnfolderBase]: For 89236/89295 co-relation queries the response was YES. [2025-03-04 10:18:00,717 INFO L83 FinitePrefix]: Finished finitePrefix Result has 31638 conditions, 4717 events. 2674/4717 cut-off events. For 89236/89295 co-relation queries the response was YES. Maximal size of possible extension queue 210. Compared 28820 event pairs, 704 based on Foata normal form. 7/4694 useless extension candidates. Maximal degree in co-relation 31415. Up to 2122 conditions per place. [2025-03-04 10:18:00,727 INFO L140 encePairwiseOnDemand]: 30/40 looper letters, 196 selfloop transitions, 70 changer transitions 114/395 dead transitions. [2025-03-04 10:18:00,727 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 198 places, 395 transitions, 6350 flow [2025-03-04 10:18:00,727 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-04 10:18:00,727 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2025-03-04 10:18:00,728 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 230 transitions. [2025-03-04 10:18:00,728 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5227272727272727 [2025-03-04 10:18:00,728 INFO L175 Difference]: Start difference. First operand has 199 places, 301 transitions, 4500 flow. Second operand 11 states and 230 transitions. [2025-03-04 10:18:00,728 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 198 places, 395 transitions, 6350 flow [2025-03-04 10:18:00,891 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 181 places, 395 transitions, 5416 flow, removed 431 selfloop flow, removed 17 redundant places. [2025-03-04 10:18:00,895 INFO L231 Difference]: Finished difference. Result has 183 places, 233 transitions, 3071 flow [2025-03-04 10:18:00,895 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=3727, PETRI_DIFFERENCE_MINUEND_PLACES=171, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=301, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=70, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=231, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=3071, PETRI_PLACES=183, PETRI_TRANSITIONS=233} [2025-03-04 10:18:00,895 INFO L279 CegarLoopForPetriNet]: 40 programPoint places, 143 predicate places. [2025-03-04 10:18:00,896 INFO L471 AbstractCegarLoop]: Abstraction has has 183 places, 233 transitions, 3071 flow [2025-03-04 10:18:00,896 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 15.058823529411764) internal successors, (256), 17 states have internal predecessors, (256), 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-03-04 10:18:00,896 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 10:18:00,896 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:18:00,902 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Ended with exit code 0 [2025-03-04 10:18:01,096 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable22 [2025-03-04 10:18:01,096 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 19 more)] === [2025-03-04 10:18:01,097 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:18:01,097 INFO L85 PathProgramCache]: Analyzing trace with hash -2024015002, now seen corresponding path program 4 times [2025-03-04 10:18:01,097 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:18:01,097 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1922249451] [2025-03-04 10:18:01,097 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-04 10:18:01,097 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:18:01,100 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 23 statements into 2 equivalence classes. [2025-03-04 10:18:01,106 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 23 of 23 statements. [2025-03-04 10:18:01,107 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-03-04 10:18:01,107 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:18:01,355 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 10:18:01,355 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:18:01,355 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1922249451] [2025-03-04 10:18:01,355 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1922249451] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 10:18:01,355 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1143400480] [2025-03-04 10:18:01,355 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-04 10:18:01,355 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:18:01,355 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:18:01,357 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 10:18:01,358 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2025-03-04 10:18:01,393 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 23 statements into 2 equivalence classes. [2025-03-04 10:18:01,408 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 23 of 23 statements. [2025-03-04 10:18:01,409 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-03-04 10:18:01,409 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:18:01,410 INFO L256 TraceCheckSpWp]: Trace formula consists of 166 conjuncts, 30 conjuncts are in the unsatisfiable core [2025-03-04 10:18:01,411 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:18:01,486 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 15 treesize of output 1 [2025-03-04 10:18:01,651 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 10:18:01,651 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 10:18:01,788 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 87 treesize of output 77 [2025-03-04 10:18:01,817 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-04 10:18:01,817 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 6 case distinctions, treesize of input 216 treesize of output 188 [2025-03-04 10:18:02,861 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 10:18:02,861 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1143400480] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 10:18:02,861 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 10:18:02,861 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 21 [2025-03-04 10:18:02,861 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [633106571] [2025-03-04 10:18:02,861 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 10:18:02,862 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2025-03-04 10:18:02,862 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:18:02,862 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2025-03-04 10:18:02,862 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=101, Invalid=361, Unknown=0, NotChecked=0, Total=462 [2025-03-04 10:18:03,079 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 16 out of 40 [2025-03-04 10:18:03,080 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 183 places, 233 transitions, 3071 flow. Second operand has 22 states, 22 states have (on average 18.681818181818183) internal successors, (411), 22 states have internal predecessors, (411), 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-03-04 10:18:03,080 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 10:18:03,080 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 16 of 40 [2025-03-04 10:18:03,080 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 10:18:03,695 INFO L124 PetriNetUnfolderBase]: 1957/3489 cut-off events. [2025-03-04 10:18:03,695 INFO L125 PetriNetUnfolderBase]: For 58266/58293 co-relation queries the response was YES. [2025-03-04 10:18:03,720 INFO L83 FinitePrefix]: Finished finitePrefix Result has 21804 conditions, 3489 events. 1957/3489 cut-off events. For 58266/58293 co-relation queries the response was YES. Maximal size of possible extension queue 164. Compared 20275 event pairs, 476 based on Foata normal form. 4/3474 useless extension candidates. Maximal degree in co-relation 21638. Up to 2280 conditions per place. [2025-03-04 10:18:03,731 INFO L140 encePairwiseOnDemand]: 30/40 looper letters, 208 selfloop transitions, 68 changer transitions 32/323 dead transitions. [2025-03-04 10:18:03,731 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 191 places, 323 transitions, 4599 flow [2025-03-04 10:18:03,731 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-03-04 10:18:03,731 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2025-03-04 10:18:03,731 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 330 transitions. [2025-03-04 10:18:03,732 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5892857142857143 [2025-03-04 10:18:03,732 INFO L175 Difference]: Start difference. First operand has 183 places, 233 transitions, 3071 flow. Second operand 14 states and 330 transitions. [2025-03-04 10:18:03,732 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 191 places, 323 transitions, 4599 flow [2025-03-04 10:18:03,866 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 176 places, 323 transitions, 4246 flow, removed 130 selfloop flow, removed 15 redundant places. [2025-03-04 10:18:03,870 INFO L231 Difference]: Finished difference. Result has 180 places, 237 transitions, 2954 flow [2025-03-04 10:18:03,870 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=2816, PETRI_DIFFERENCE_MINUEND_PLACES=163, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=233, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=61, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=171, PETRI_DIFFERENCE_SUBTRAHEND_STATES=14, PETRI_FLOW=2954, PETRI_PLACES=180, PETRI_TRANSITIONS=237} [2025-03-04 10:18:03,870 INFO L279 CegarLoopForPetriNet]: 40 programPoint places, 140 predicate places. [2025-03-04 10:18:03,870 INFO L471 AbstractCegarLoop]: Abstraction has has 180 places, 237 transitions, 2954 flow [2025-03-04 10:18:03,870 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 22 states have (on average 18.681818181818183) internal successors, (411), 22 states have internal predecessors, (411), 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-03-04 10:18:03,870 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 10:18:03,871 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:18:03,877 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2025-03-04 10:18:04,071 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable23 [2025-03-04 10:18:04,071 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 19 more)] === [2025-03-04 10:18:04,072 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:18:04,072 INFO L85 PathProgramCache]: Analyzing trace with hash -364099088, now seen corresponding path program 5 times [2025-03-04 10:18:04,072 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:18:04,072 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1445526516] [2025-03-04 10:18:04,072 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-04 10:18:04,072 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:18:04,075 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 23 statements into 2 equivalence classes. [2025-03-04 10:18:04,080 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 23 of 23 statements. [2025-03-04 10:18:04,080 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 10:18:04,080 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:18:04,193 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-04 10:18:04,194 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:18:04,194 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1445526516] [2025-03-04 10:18:04,194 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1445526516] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:18:04,194 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 10:18:04,194 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-04 10:18:04,194 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2147268606] [2025-03-04 10:18:04,194 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:18:04,194 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-04 10:18:04,194 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:18:04,194 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-04 10:18:04,194 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2025-03-04 10:18:04,197 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 40 [2025-03-04 10:18:04,197 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 180 places, 237 transitions, 2954 flow. Second operand has 8 states, 8 states have (on average 16.75) internal successors, (134), 8 states have internal predecessors, (134), 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-03-04 10:18:04,197 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 10:18:04,197 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 40 [2025-03-04 10:18:04,197 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 10:18:04,706 INFO L124 PetriNetUnfolderBase]: 2149/3661 cut-off events. [2025-03-04 10:18:04,706 INFO L125 PetriNetUnfolderBase]: For 61010/61010 co-relation queries the response was YES. [2025-03-04 10:18:04,725 INFO L83 FinitePrefix]: Finished finitePrefix Result has 22385 conditions, 3661 events. 2149/3661 cut-off events. For 61010/61010 co-relation queries the response was YES. Maximal size of possible extension queue 156. Compared 20560 event pairs, 555 based on Foata normal form. 16/3677 useless extension candidates. Maximal degree in co-relation 22209. Up to 1711 conditions per place. [2025-03-04 10:18:04,734 INFO L140 encePairwiseOnDemand]: 32/40 looper letters, 312 selfloop transitions, 39 changer transitions 24/376 dead transitions. [2025-03-04 10:18:04,735 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 185 places, 376 transitions, 4986 flow [2025-03-04 10:18:04,735 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-04 10:18:04,735 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2025-03-04 10:18:04,735 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 212 transitions. [2025-03-04 10:18:04,735 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5888888888888889 [2025-03-04 10:18:04,735 INFO L175 Difference]: Start difference. First operand has 180 places, 237 transitions, 2954 flow. Second operand 9 states and 212 transitions. [2025-03-04 10:18:04,735 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 185 places, 376 transitions, 4986 flow [2025-03-04 10:18:04,852 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 176 places, 376 transitions, 4834 flow, removed 19 selfloop flow, removed 9 redundant places. [2025-03-04 10:18:04,855 INFO L231 Difference]: Finished difference. Result has 178 places, 229 transitions, 2752 flow [2025-03-04 10:18:04,855 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=2827, PETRI_DIFFERENCE_MINUEND_PLACES=168, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=237, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=39, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=198, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=2752, PETRI_PLACES=178, PETRI_TRANSITIONS=229} [2025-03-04 10:18:04,856 INFO L279 CegarLoopForPetriNet]: 40 programPoint places, 138 predicate places. [2025-03-04 10:18:04,856 INFO L471 AbstractCegarLoop]: Abstraction has has 178 places, 229 transitions, 2752 flow [2025-03-04 10:18:04,856 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 16.75) internal successors, (134), 8 states have internal predecessors, (134), 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-03-04 10:18:04,856 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 10:18:04,856 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:18:04,856 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2025-03-04 10:18:04,856 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 19 more)] === [2025-03-04 10:18:04,856 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:18:04,856 INFO L85 PathProgramCache]: Analyzing trace with hash 1156190152, now seen corresponding path program 6 times [2025-03-04 10:18:04,856 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:18:04,856 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [455009939] [2025-03-04 10:18:04,856 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-03-04 10:18:04,856 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:18:04,860 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 23 statements into 2 equivalence classes. [2025-03-04 10:18:04,869 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) and asserted 23 of 23 statements. [2025-03-04 10:18:04,870 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) [2025-03-04 10:18:04,870 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:18:04,957 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-04 10:18:04,958 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:18:04,958 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [455009939] [2025-03-04 10:18:04,958 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [455009939] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:18:04,958 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 10:18:04,958 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-04 10:18:04,958 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [954414543] [2025-03-04 10:18:04,958 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:18:04,958 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-04 10:18:04,958 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:18:04,959 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-04 10:18:04,959 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-03-04 10:18:04,965 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 40 [2025-03-04 10:18:04,965 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 178 places, 229 transitions, 2752 flow. Second operand has 7 states, 7 states have (on average 17.142857142857142) internal successors, (120), 7 states have internal predecessors, (120), 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-03-04 10:18:04,965 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 10:18:04,965 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 40 [2025-03-04 10:18:04,965 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 10:18:05,417 INFO L124 PetriNetUnfolderBase]: 2073/3519 cut-off events. [2025-03-04 10:18:05,417 INFO L125 PetriNetUnfolderBase]: For 63238/63238 co-relation queries the response was YES. [2025-03-04 10:18:05,431 INFO L83 FinitePrefix]: Finished finitePrefix Result has 21995 conditions, 3519 events. 2073/3519 cut-off events. For 63238/63238 co-relation queries the response was YES. Maximal size of possible extension queue 157. Compared 19541 event pairs, 649 based on Foata normal form. 22/3541 useless extension candidates. Maximal degree in co-relation 21769. Up to 1901 conditions per place. [2025-03-04 10:18:05,439 INFO L140 encePairwiseOnDemand]: 32/40 looper letters, 264 selfloop transitions, 56 changer transitions 21/342 dead transitions. [2025-03-04 10:18:05,440 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 182 places, 342 transitions, 4531 flow [2025-03-04 10:18:05,440 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-04 10:18:05,440 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2025-03-04 10:18:05,440 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 206 transitions. [2025-03-04 10:18:05,440 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5722222222222222 [2025-03-04 10:18:05,440 INFO L175 Difference]: Start difference. First operand has 178 places, 229 transitions, 2752 flow. Second operand 9 states and 206 transitions. [2025-03-04 10:18:05,440 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 182 places, 342 transitions, 4531 flow [2025-03-04 10:18:05,551 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 169 places, 342 transitions, 4335 flow, removed 21 selfloop flow, removed 13 redundant places. [2025-03-04 10:18:05,555 INFO L231 Difference]: Finished difference. Result has 173 places, 238 transitions, 2861 flow [2025-03-04 10:18:05,555 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=2595, PETRI_DIFFERENCE_MINUEND_PLACES=161, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=229, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=42, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=187, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=2861, PETRI_PLACES=173, PETRI_TRANSITIONS=238} [2025-03-04 10:18:05,555 INFO L279 CegarLoopForPetriNet]: 40 programPoint places, 133 predicate places. [2025-03-04 10:18:05,555 INFO L471 AbstractCegarLoop]: Abstraction has has 173 places, 238 transitions, 2861 flow [2025-03-04 10:18:05,555 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 17.142857142857142) internal successors, (120), 7 states have internal predecessors, (120), 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-03-04 10:18:05,555 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 10:18:05,556 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:18:05,556 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2025-03-04 10:18:05,556 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 19 more)] === [2025-03-04 10:18:05,556 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:18:05,556 INFO L85 PathProgramCache]: Analyzing trace with hash 572228072, now seen corresponding path program 7 times [2025-03-04 10:18:05,556 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:18:05,556 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [174254753] [2025-03-04 10:18:05,556 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-03-04 10:18:05,556 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:18:05,560 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-03-04 10:18:05,567 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-03-04 10:18:05,567 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:18:05,567 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:18:05,659 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-04 10:18:05,660 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:18:05,660 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [174254753] [2025-03-04 10:18:05,660 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [174254753] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:18:05,660 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 10:18:05,660 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-04 10:18:05,660 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [952846146] [2025-03-04 10:18:05,660 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:18:05,660 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-04 10:18:05,660 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:18:05,661 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-04 10:18:05,661 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-03-04 10:18:05,664 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 40 [2025-03-04 10:18:05,664 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 173 places, 238 transitions, 2861 flow. Second operand has 7 states, 7 states have (on average 17.142857142857142) internal successors, (120), 7 states have internal predecessors, (120), 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-03-04 10:18:05,664 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 10:18:05,664 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 40 [2025-03-04 10:18:05,664 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 10:18:06,163 INFO L124 PetriNetUnfolderBase]: 2042/3472 cut-off events. [2025-03-04 10:18:06,163 INFO L125 PetriNetUnfolderBase]: For 63614/63614 co-relation queries the response was YES. [2025-03-04 10:18:06,181 INFO L83 FinitePrefix]: Finished finitePrefix Result has 21418 conditions, 3472 events. 2042/3472 cut-off events. For 63614/63614 co-relation queries the response was YES. Maximal size of possible extension queue 157. Compared 19307 event pairs, 651 based on Foata normal form. 16/3488 useless extension candidates. Maximal degree in co-relation 21300. Up to 1857 conditions per place. [2025-03-04 10:18:06,191 INFO L140 encePairwiseOnDemand]: 32/40 looper letters, 261 selfloop transitions, 50 changer transitions 25/337 dead transitions. [2025-03-04 10:18:06,191 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 179 places, 337 transitions, 4428 flow [2025-03-04 10:18:06,192 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-04 10:18:06,192 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2025-03-04 10:18:06,192 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 199 transitions. [2025-03-04 10:18:06,192 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5527777777777778 [2025-03-04 10:18:06,192 INFO L175 Difference]: Start difference. First operand has 173 places, 238 transitions, 2861 flow. Second operand 9 states and 199 transitions. [2025-03-04 10:18:06,192 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 179 places, 337 transitions, 4428 flow [2025-03-04 10:18:06,335 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 175 places, 337 transitions, 4314 flow, removed 17 selfloop flow, removed 4 redundant places. [2025-03-04 10:18:06,338 INFO L231 Difference]: Finished difference. Result has 178 places, 230 transitions, 2703 flow [2025-03-04 10:18:06,338 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=2767, PETRI_DIFFERENCE_MINUEND_PLACES=167, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=238, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=48, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=190, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=2703, PETRI_PLACES=178, PETRI_TRANSITIONS=230} [2025-03-04 10:18:06,339 INFO L279 CegarLoopForPetriNet]: 40 programPoint places, 138 predicate places. [2025-03-04 10:18:06,339 INFO L471 AbstractCegarLoop]: Abstraction has has 178 places, 230 transitions, 2703 flow [2025-03-04 10:18:06,339 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 17.142857142857142) internal successors, (120), 7 states have internal predecessors, (120), 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-03-04 10:18:06,339 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 10:18:06,339 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:18:06,339 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2025-03-04 10:18:06,339 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 19 more)] === [2025-03-04 10:18:06,339 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:18:06,339 INFO L85 PathProgramCache]: Analyzing trace with hash -897461908, now seen corresponding path program 8 times [2025-03-04 10:18:06,339 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:18:06,339 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [438629741] [2025-03-04 10:18:06,340 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 10:18:06,340 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:18:06,343 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 23 statements into 2 equivalence classes. [2025-03-04 10:18:06,347 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 23 of 23 statements. [2025-03-04 10:18:06,347 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 10:18:06,347 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:18:06,424 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-04 10:18:06,425 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:18:06,425 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [438629741] [2025-03-04 10:18:06,425 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [438629741] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 10:18:06,425 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1325821173] [2025-03-04 10:18:06,425 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 10:18:06,425 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:18:06,425 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:18:06,427 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 10:18:06,428 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2025-03-04 10:18:06,464 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 23 statements into 2 equivalence classes. [2025-03-04 10:18:06,480 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 23 of 23 statements. [2025-03-04 10:18:06,480 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 10:18:06,480 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:18:06,481 INFO L256 TraceCheckSpWp]: Trace formula consists of 166 conjuncts, 28 conjuncts are in the unsatisfiable core [2025-03-04 10:18:06,482 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:18:06,503 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 15 treesize of output 1 [2025-03-04 10:18:06,593 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 15 treesize of output 7 [2025-03-04 10:18:06,605 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-04 10:18:06,606 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 10:18:06,777 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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-03-04 10:18:06,786 INFO L349 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2025-03-04 10:18:06,786 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 62 treesize of output 41 [2025-03-04 10:18:06,827 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-04 10:18:06,827 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1325821173] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 10:18:06,827 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 10:18:06,827 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 18 [2025-03-04 10:18:06,827 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [31380957] [2025-03-04 10:18:06,828 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 10:18:06,828 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2025-03-04 10:18:06,828 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:18:06,828 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2025-03-04 10:18:06,828 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=260, Unknown=0, NotChecked=0, Total=306 [2025-03-04 10:18:07,212 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 40 [2025-03-04 10:18:07,213 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 178 places, 230 transitions, 2703 flow. Second operand has 18 states, 18 states have (on average 17.444444444444443) internal successors, (314), 18 states have internal predecessors, (314), 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-03-04 10:18:07,213 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 10:18:07,213 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 40 [2025-03-04 10:18:07,213 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 10:18:08,239 INFO L124 PetriNetUnfolderBase]: 1955/3326 cut-off events. [2025-03-04 10:18:08,239 INFO L125 PetriNetUnfolderBase]: For 60394/60394 co-relation queries the response was YES. [2025-03-04 10:18:08,253 INFO L83 FinitePrefix]: Finished finitePrefix Result has 20657 conditions, 3326 events. 1955/3326 cut-off events. For 60394/60394 co-relation queries the response was YES. Maximal size of possible extension queue 151. Compared 18114 event pairs, 231 based on Foata normal form. 8/3334 useless extension candidates. Maximal degree in co-relation 20386. Up to 1459 conditions per place. [2025-03-04 10:18:08,261 INFO L140 encePairwiseOnDemand]: 27/40 looper letters, 262 selfloop transitions, 99 changer transitions 57/419 dead transitions. [2025-03-04 10:18:08,261 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 204 places, 419 transitions, 5049 flow [2025-03-04 10:18:08,261 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2025-03-04 10:18:08,261 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2025-03-04 10:18:08,262 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 611 transitions. [2025-03-04 10:18:08,263 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5091666666666667 [2025-03-04 10:18:08,263 INFO L175 Difference]: Start difference. First operand has 178 places, 230 transitions, 2703 flow. Second operand 30 states and 611 transitions. [2025-03-04 10:18:08,263 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 204 places, 419 transitions, 5049 flow [2025-03-04 10:18:08,332 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 196 places, 419 transitions, 4884 flow, removed 27 selfloop flow, removed 8 redundant places. [2025-03-04 10:18:08,336 INFO L231 Difference]: Finished difference. Result has 199 places, 236 transitions, 2808 flow [2025-03-04 10:18:08,336 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=2556, PETRI_DIFFERENCE_MINUEND_PLACES=167, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=227, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=83, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=144, PETRI_DIFFERENCE_SUBTRAHEND_STATES=30, PETRI_FLOW=2808, PETRI_PLACES=199, PETRI_TRANSITIONS=236} [2025-03-04 10:18:08,336 INFO L279 CegarLoopForPetriNet]: 40 programPoint places, 159 predicate places. [2025-03-04 10:18:08,336 INFO L471 AbstractCegarLoop]: Abstraction has has 199 places, 236 transitions, 2808 flow [2025-03-04 10:18:08,336 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 17.444444444444443) internal successors, (314), 18 states have internal predecessors, (314), 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-03-04 10:18:08,336 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 10:18:08,336 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:18:08,342 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Forceful destruction successful, exit code 0 [2025-03-04 10:18:08,537 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable27 [2025-03-04 10:18:08,537 INFO L396 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 19 more)] === [2025-03-04 10:18:08,538 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:18:08,538 INFO L85 PathProgramCache]: Analyzing trace with hash 640865959, now seen corresponding path program 3 times [2025-03-04 10:18:08,538 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:18:08,538 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [635385135] [2025-03-04 10:18:08,538 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-04 10:18:08,538 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:18:08,542 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 23 statements into 3 equivalence classes. [2025-03-04 10:18:08,547 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 21 of 23 statements. [2025-03-04 10:18:08,547 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-03-04 10:18:08,547 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:18:08,613 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-04 10:18:08,613 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:18:08,613 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [635385135] [2025-03-04 10:18:08,613 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [635385135] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 10:18:08,613 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1430992640] [2025-03-04 10:18:08,613 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-04 10:18:08,613 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:18:08,613 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:18:08,615 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 10:18:08,617 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2025-03-04 10:18:08,652 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 23 statements into 3 equivalence classes. [2025-03-04 10:18:08,673 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 21 of 23 statements. [2025-03-04 10:18:08,673 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-03-04 10:18:08,673 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:18:08,674 INFO L256 TraceCheckSpWp]: Trace formula consists of 156 conjuncts, 11 conjuncts are in the unsatisfiable core [2025-03-04 10:18:08,675 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:18:08,716 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-04 10:18:08,716 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 10:18:08,806 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-04 10:18:08,806 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1430992640] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 10:18:08,806 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 10:18:08,806 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 8] total 15 [2025-03-04 10:18:08,806 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2036782672] [2025-03-04 10:18:08,806 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 10:18:08,807 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-03-04 10:18:08,807 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:18:08,807 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-03-04 10:18:08,807 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=64, Invalid=146, Unknown=0, NotChecked=0, Total=210 [2025-03-04 10:18:08,812 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 40 [2025-03-04 10:18:08,812 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 199 places, 236 transitions, 2808 flow. Second operand has 15 states, 15 states have (on average 16.2) internal successors, (243), 15 states have internal predecessors, (243), 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-03-04 10:18:08,812 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 10:18:08,812 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 40 [2025-03-04 10:18:08,813 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 10:18:09,875 INFO L124 PetriNetUnfolderBase]: 2453/4292 cut-off events. [2025-03-04 10:18:09,875 INFO L125 PetriNetUnfolderBase]: For 71669/71669 co-relation queries the response was YES. [2025-03-04 10:18:09,894 INFO L83 FinitePrefix]: Finished finitePrefix Result has 25870 conditions, 4292 events. 2453/4292 cut-off events. For 71669/71669 co-relation queries the response was YES. Maximal size of possible extension queue 200. Compared 25384 event pairs, 427 based on Foata normal form. 15/4307 useless extension candidates. Maximal degree in co-relation 25770. Up to 1336 conditions per place. [2025-03-04 10:18:09,907 INFO L140 encePairwiseOnDemand]: 30/40 looper letters, 273 selfloop transitions, 223 changer transitions 4/501 dead transitions. [2025-03-04 10:18:09,907 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 208 places, 501 transitions, 6126 flow [2025-03-04 10:18:09,908 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2025-03-04 10:18:09,908 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2025-03-04 10:18:09,908 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 556 transitions. [2025-03-04 10:18:09,909 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5148148148148148 [2025-03-04 10:18:09,909 INFO L175 Difference]: Start difference. First operand has 199 places, 236 transitions, 2808 flow. Second operand 27 states and 556 transitions. [2025-03-04 10:18:09,909 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 208 places, 501 transitions, 6126 flow [2025-03-04 10:18:09,993 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 186 places, 501 transitions, 5612 flow, removed 101 selfloop flow, removed 22 redundant places. [2025-03-04 10:18:09,998 INFO L231 Difference]: Finished difference. Result has 194 places, 340 transitions, 4178 flow [2025-03-04 10:18:09,998 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=2525, PETRI_DIFFERENCE_MINUEND_PLACES=160, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=236, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=123, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=100, PETRI_DIFFERENCE_SUBTRAHEND_STATES=27, PETRI_FLOW=4178, PETRI_PLACES=194, PETRI_TRANSITIONS=340} [2025-03-04 10:18:09,999 INFO L279 CegarLoopForPetriNet]: 40 programPoint places, 154 predicate places. [2025-03-04 10:18:09,999 INFO L471 AbstractCegarLoop]: Abstraction has has 194 places, 340 transitions, 4178 flow [2025-03-04 10:18:09,999 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 16.2) internal successors, (243), 15 states have internal predecessors, (243), 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-03-04 10:18:09,999 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 10:18:09,999 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:18:10,005 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Ended with exit code 0 [2025-03-04 10:18:10,200 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28,15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:18:10,200 INFO L396 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 19 more)] === [2025-03-04 10:18:10,200 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:18:10,200 INFO L85 PathProgramCache]: Analyzing trace with hash 1622071905, now seen corresponding path program 4 times [2025-03-04 10:18:10,200 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:18:10,200 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [870105164] [2025-03-04 10:18:10,201 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-04 10:18:10,201 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:18:10,205 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 23 statements into 2 equivalence classes. [2025-03-04 10:18:10,214 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 23 of 23 statements. [2025-03-04 10:18:10,214 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-03-04 10:18:10,214 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:18:10,387 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-04 10:18:10,387 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:18:10,387 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [870105164] [2025-03-04 10:18:10,387 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [870105164] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 10:18:10,387 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [738674033] [2025-03-04 10:18:10,387 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-04 10:18:10,387 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:18:10,387 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:18:10,393 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 10:18:10,395 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2025-03-04 10:18:10,439 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 23 statements into 2 equivalence classes. [2025-03-04 10:18:10,496 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 23 of 23 statements. [2025-03-04 10:18:10,496 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-03-04 10:18:10,496 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:18:10,497 INFO L256 TraceCheckSpWp]: Trace formula consists of 169 conjuncts, 11 conjuncts are in the unsatisfiable core [2025-03-04 10:18:10,498 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:18:10,548 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-04 10:18:10,548 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 10:18:10,645 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-04 10:18:10,645 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [738674033] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 10:18:10,645 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 10:18:10,645 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 17 [2025-03-04 10:18:10,645 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [26316454] [2025-03-04 10:18:10,645 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 10:18:10,645 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2025-03-04 10:18:10,646 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:18:10,646 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2025-03-04 10:18:10,646 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=90, Invalid=182, Unknown=0, NotChecked=0, Total=272 [2025-03-04 10:18:10,667 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 40 [2025-03-04 10:18:10,667 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 194 places, 340 transitions, 4178 flow. Second operand has 17 states, 17 states have (on average 15.941176470588236) internal successors, (271), 17 states have internal predecessors, (271), 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-03-04 10:18:10,667 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 10:18:10,667 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 40 [2025-03-04 10:18:10,667 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 10:18:12,739 INFO L124 PetriNetUnfolderBase]: 5024/8741 cut-off events. [2025-03-04 10:18:12,739 INFO L125 PetriNetUnfolderBase]: For 131019/131019 co-relation queries the response was YES. [2025-03-04 10:18:12,785 INFO L83 FinitePrefix]: Finished finitePrefix Result has 54169 conditions, 8741 events. 5024/8741 cut-off events. For 131019/131019 co-relation queries the response was YES. Maximal size of possible extension queue 278. Compared 57165 event pairs, 379 based on Foata normal form. 15/8756 useless extension candidates. Maximal degree in co-relation 54075. Up to 1543 conditions per place. [2025-03-04 10:18:12,811 INFO L140 encePairwiseOnDemand]: 27/40 looper letters, 420 selfloop transitions, 566 changer transitions 0/987 dead transitions. [2025-03-04 10:18:12,811 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 227 places, 987 transitions, 13606 flow [2025-03-04 10:18:12,812 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2025-03-04 10:18:12,812 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2025-03-04 10:18:12,812 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 760 transitions. [2025-03-04 10:18:12,813 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5588235294117647 [2025-03-04 10:18:12,813 INFO L175 Difference]: Start difference. First operand has 194 places, 340 transitions, 4178 flow. Second operand 34 states and 760 transitions. [2025-03-04 10:18:12,813 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 227 places, 987 transitions, 13606 flow [2025-03-04 10:18:13,229 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 224 places, 987 transitions, 12438 flow, removed 572 selfloop flow, removed 3 redundant places. [2025-03-04 10:18:13,238 INFO L231 Difference]: Finished difference. Result has 249 places, 740 transitions, 10708 flow [2025-03-04 10:18:13,239 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=3841, PETRI_DIFFERENCE_MINUEND_PLACES=191, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=340, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=203, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=34, PETRI_FLOW=10708, PETRI_PLACES=249, PETRI_TRANSITIONS=740} [2025-03-04 10:18:13,239 INFO L279 CegarLoopForPetriNet]: 40 programPoint places, 209 predicate places. [2025-03-04 10:18:13,239 INFO L471 AbstractCegarLoop]: Abstraction has has 249 places, 740 transitions, 10708 flow [2025-03-04 10:18:13,239 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 15.941176470588236) internal successors, (271), 17 states have internal predecessors, (271), 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-03-04 10:18:13,239 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 10:18:13,239 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:18:13,245 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Ended with exit code 0 [2025-03-04 10:18:13,444 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29,16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:18:13,444 INFO L396 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 19 more)] === [2025-03-04 10:18:13,444 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:18:13,444 INFO L85 PathProgramCache]: Analyzing trace with hash 116341433, now seen corresponding path program 5 times [2025-03-04 10:18:13,444 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:18:13,444 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1527309578] [2025-03-04 10:18:13,444 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-04 10:18:13,444 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:18:13,448 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 23 statements into 3 equivalence classes. [2025-03-04 10:18:13,453 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) and asserted 23 of 23 statements. [2025-03-04 10:18:13,453 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) [2025-03-04 10:18:13,453 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:18:13,580 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-04 10:18:13,580 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:18:13,580 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1527309578] [2025-03-04 10:18:13,580 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1527309578] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 10:18:13,580 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [77241648] [2025-03-04 10:18:13,580 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-04 10:18:13,581 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:18:13,581 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:18:13,583 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 10:18:13,585 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2025-03-04 10:18:13,622 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 23 statements into 3 equivalence classes. [2025-03-04 10:18:13,691 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) and asserted 23 of 23 statements. [2025-03-04 10:18:13,691 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) [2025-03-04 10:18:13,691 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:18:13,692 INFO L256 TraceCheckSpWp]: Trace formula consists of 169 conjuncts, 11 conjuncts are in the unsatisfiable core [2025-03-04 10:18:13,692 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:18:13,751 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-04 10:18:13,751 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 10:18:13,885 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-04 10:18:13,886 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [77241648] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 10:18:13,886 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 10:18:13,886 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 18 [2025-03-04 10:18:13,886 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1070490269] [2025-03-04 10:18:13,886 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 10:18:13,886 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2025-03-04 10:18:13,886 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:18:13,886 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2025-03-04 10:18:13,886 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=101, Invalid=205, Unknown=0, NotChecked=0, Total=306 [2025-03-04 10:18:13,912 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 40 [2025-03-04 10:18:13,912 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 249 places, 740 transitions, 10708 flow. Second operand has 18 states, 18 states have (on average 16.055555555555557) internal successors, (289), 18 states have internal predecessors, (289), 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-03-04 10:18:13,912 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 10:18:13,912 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 40 [2025-03-04 10:18:13,912 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 10:18:16,422 INFO L124 PetriNetUnfolderBase]: 5890/10247 cut-off events. [2025-03-04 10:18:16,422 INFO L125 PetriNetUnfolderBase]: For 191713/191713 co-relation queries the response was YES. [2025-03-04 10:18:16,487 INFO L83 FinitePrefix]: Finished finitePrefix Result has 72124 conditions, 10247 events. 5890/10247 cut-off events. For 191713/191713 co-relation queries the response was YES. Maximal size of possible extension queue 344. Compared 69331 event pairs, 1200 based on Foata normal form. 168/10415 useless extension candidates. Maximal degree in co-relation 72007. Up to 3968 conditions per place. [2025-03-04 10:18:16,522 INFO L140 encePairwiseOnDemand]: 29/40 looper letters, 729 selfloop transitions, 545 changer transitions 0/1275 dead transitions. [2025-03-04 10:18:16,522 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 279 places, 1275 transitions, 20681 flow [2025-03-04 10:18:16,523 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2025-03-04 10:18:16,523 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2025-03-04 10:18:16,523 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 684 transitions. [2025-03-04 10:18:16,524 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5516129032258065 [2025-03-04 10:18:16,524 INFO L175 Difference]: Start difference. First operand has 249 places, 740 transitions, 10708 flow. Second operand 31 states and 684 transitions. [2025-03-04 10:18:16,524 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 279 places, 1275 transitions, 20681 flow [2025-03-04 10:18:18,035 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 276 places, 1275 transitions, 18104 flow, removed 1256 selfloop flow, removed 3 redundant places. [2025-03-04 10:18:18,049 INFO L231 Difference]: Finished difference. Result has 297 places, 985 transitions, 15115 flow [2025-03-04 10:18:18,050 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=9551, PETRI_DIFFERENCE_MINUEND_PLACES=246, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=737, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=319, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=300, PETRI_DIFFERENCE_SUBTRAHEND_STATES=31, PETRI_FLOW=15115, PETRI_PLACES=297, PETRI_TRANSITIONS=985} [2025-03-04 10:18:18,050 INFO L279 CegarLoopForPetriNet]: 40 programPoint places, 257 predicate places. [2025-03-04 10:18:18,050 INFO L471 AbstractCegarLoop]: Abstraction has has 297 places, 985 transitions, 15115 flow [2025-03-04 10:18:18,050 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 16.055555555555557) internal successors, (289), 18 states have internal predecessors, (289), 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-03-04 10:18:18,050 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 10:18:18,050 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:18:18,059 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Forceful destruction successful, exit code 0 [2025-03-04 10:18:18,251 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30,17 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:18:18,251 INFO L396 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 19 more)] === [2025-03-04 10:18:18,251 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:18:18,251 INFO L85 PathProgramCache]: Analyzing trace with hash -1617149887, now seen corresponding path program 6 times [2025-03-04 10:18:18,251 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:18:18,251 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1771674377] [2025-03-04 10:18:18,251 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-03-04 10:18:18,252 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:18:18,255 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 23 statements into 3 equivalence classes. [2025-03-04 10:18:18,258 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) and asserted 19 of 23 statements. [2025-03-04 10:18:18,258 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) [2025-03-04 10:18:18,258 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:18:18,330 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-04 10:18:18,330 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:18:18,330 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1771674377] [2025-03-04 10:18:18,330 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1771674377] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:18:18,331 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 10:18:18,331 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-04 10:18:18,331 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1067051327] [2025-03-04 10:18:18,331 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:18:18,331 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-04 10:18:18,331 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:18:18,332 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-04 10:18:18,332 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2025-03-04 10:18:18,336 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 40 [2025-03-04 10:18:18,336 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 297 places, 985 transitions, 15115 flow. Second operand has 8 states, 8 states have (on average 16.5) internal successors, (132), 8 states have internal predecessors, (132), 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-03-04 10:18:18,336 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 10:18:18,336 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 40 [2025-03-04 10:18:18,336 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 10:18:20,836 INFO L124 PetriNetUnfolderBase]: 5894/10257 cut-off events. [2025-03-04 10:18:20,836 INFO L125 PetriNetUnfolderBase]: For 118669/118669 co-relation queries the response was YES. [2025-03-04 10:18:20,896 INFO L83 FinitePrefix]: Finished finitePrefix Result has 66645 conditions, 10257 events. 5894/10257 cut-off events. For 118669/118669 co-relation queries the response was YES. Maximal size of possible extension queue 341. Compared 69282 event pairs, 2511 based on Foata normal form. 3/10260 useless extension candidates. Maximal degree in co-relation 66510. Up to 8637 conditions per place. [2025-03-04 10:18:20,926 INFO L140 encePairwiseOnDemand]: 32/40 looper letters, 926 selfloop transitions, 100 changer transitions 0/1027 dead transitions. [2025-03-04 10:18:20,926 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 305 places, 1027 transitions, 17539 flow [2025-03-04 10:18:20,927 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-04 10:18:20,927 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2025-03-04 10:18:20,927 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 198 transitions. [2025-03-04 10:18:20,927 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.55 [2025-03-04 10:18:20,927 INFO L175 Difference]: Start difference. First operand has 297 places, 985 transitions, 15115 flow. Second operand 9 states and 198 transitions. [2025-03-04 10:18:20,927 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 305 places, 1027 transitions, 17539 flow [2025-03-04 10:18:21,857 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 299 places, 1027 transitions, 16925 flow, removed 189 selfloop flow, removed 6 redundant places. [2025-03-04 10:18:21,870 INFO L231 Difference]: Finished difference. Result has 301 places, 987 transitions, 14755 flow [2025-03-04 10:18:21,871 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=14501, PETRI_DIFFERENCE_MINUEND_PLACES=291, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=985, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=98, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=885, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=14755, PETRI_PLACES=301, PETRI_TRANSITIONS=987} [2025-03-04 10:18:21,871 INFO L279 CegarLoopForPetriNet]: 40 programPoint places, 261 predicate places. [2025-03-04 10:18:21,871 INFO L471 AbstractCegarLoop]: Abstraction has has 301 places, 987 transitions, 14755 flow [2025-03-04 10:18:21,871 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 16.5) internal successors, (132), 8 states have internal predecessors, (132), 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-03-04 10:18:21,871 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 10:18:21,871 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:18:21,871 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2025-03-04 10:18:21,871 INFO L396 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 19 more)] === [2025-03-04 10:18:21,872 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:18:21,872 INFO L85 PathProgramCache]: Analyzing trace with hash -1189576941, now seen corresponding path program 7 times [2025-03-04 10:18:21,872 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:18:21,872 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2015235590] [2025-03-04 10:18:21,872 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-03-04 10:18:21,872 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:18:21,875 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-03-04 10:18:21,879 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-03-04 10:18:21,879 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:18:21,879 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:18:21,978 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-04 10:18:21,978 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:18:21,978 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2015235590] [2025-03-04 10:18:21,978 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2015235590] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 10:18:21,978 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1027920384] [2025-03-04 10:18:21,978 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-03-04 10:18:21,978 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:18:21,979 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:18:21,980 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 10:18:21,982 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Waiting until timeout for monitored process [2025-03-04 10:18:22,018 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-03-04 10:18:22,060 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-03-04 10:18:22,060 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:18:22,060 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:18:22,061 INFO L256 TraceCheckSpWp]: Trace formula consists of 169 conjuncts, 11 conjuncts are in the unsatisfiable core [2025-03-04 10:18:22,062 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:18:22,106 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-04 10:18:22,107 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 10:18:22,231 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-04 10:18:22,231 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1027920384] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 10:18:22,231 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 10:18:22,231 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 16 [2025-03-04 10:18:22,231 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2087746108] [2025-03-04 10:18:22,231 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 10:18:22,232 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2025-03-04 10:18:22,232 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:18:22,232 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2025-03-04 10:18:22,232 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=74, Invalid=166, Unknown=0, NotChecked=0, Total=240 [2025-03-04 10:18:22,255 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 40 [2025-03-04 10:18:22,256 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 301 places, 987 transitions, 14755 flow. Second operand has 16 states, 16 states have (on average 16.0) internal successors, (256), 16 states have internal predecessors, (256), 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-03-04 10:18:22,256 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 10:18:22,256 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 40 [2025-03-04 10:18:22,256 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 10:18:27,348 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-03-04 10:18:30,421 INFO L124 PetriNetUnfolderBase]: 6560/11471 cut-off events. [2025-03-04 10:18:30,421 INFO L125 PetriNetUnfolderBase]: For 119845/119845 co-relation queries the response was YES. [2025-03-04 10:18:30,525 INFO L83 FinitePrefix]: Finished finitePrefix Result has 72256 conditions, 11471 events. 6560/11471 cut-off events. For 119845/119845 co-relation queries the response was YES. Maximal size of possible extension queue 412. Compared 80238 event pairs, 1160 based on Foata normal form. 18/11489 useless extension candidates. Maximal degree in co-relation 72121. Up to 3984 conditions per place. [2025-03-04 10:18:30,562 INFO L140 encePairwiseOnDemand]: 28/40 looper letters, 446 selfloop transitions, 998 changer transitions 0/1445 dead transitions. [2025-03-04 10:18:30,562 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 340 places, 1445 transitions, 22871 flow [2025-03-04 10:18:30,563 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2025-03-04 10:18:30,563 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2025-03-04 10:18:30,563 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 883 transitions. [2025-03-04 10:18:30,564 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.551875 [2025-03-04 10:18:30,564 INFO L175 Difference]: Start difference. First operand has 301 places, 987 transitions, 14755 flow. Second operand 40 states and 883 transitions. [2025-03-04 10:18:30,564 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 340 places, 1445 transitions, 22871 flow [2025-03-04 10:18:31,743 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 333 places, 1445 transitions, 22615 flow, removed 18 selfloop flow, removed 7 redundant places. [2025-03-04 10:18:31,760 INFO L231 Difference]: Finished difference. Result has 349 places, 1273 transitions, 21938 flow [2025-03-04 10:18:31,760 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=14529, PETRI_DIFFERENCE_MINUEND_PLACES=294, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=986, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=739, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=179, PETRI_DIFFERENCE_SUBTRAHEND_STATES=40, PETRI_FLOW=21938, PETRI_PLACES=349, PETRI_TRANSITIONS=1273} [2025-03-04 10:18:31,761 INFO L279 CegarLoopForPetriNet]: 40 programPoint places, 309 predicate places. [2025-03-04 10:18:31,761 INFO L471 AbstractCegarLoop]: Abstraction has has 349 places, 1273 transitions, 21938 flow [2025-03-04 10:18:31,761 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 16.0) internal successors, (256), 16 states have internal predecessors, (256), 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-03-04 10:18:31,761 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 10:18:31,761 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:18:31,767 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Forceful destruction successful, exit code 0 [2025-03-04 10:18:31,961 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32,18 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:18:31,961 INFO L396 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 19 more)] === [2025-03-04 10:18:31,962 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:18:31,962 INFO L85 PathProgramCache]: Analyzing trace with hash 1155996289, now seen corresponding path program 8 times [2025-03-04 10:18:31,962 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:18:31,962 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2055746221] [2025-03-04 10:18:31,962 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 10:18:31,962 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:18:31,966 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 23 statements into 2 equivalence classes. [2025-03-04 10:18:31,970 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 23 of 23 statements. [2025-03-04 10:18:31,970 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 10:18:31,971 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:18:32,040 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-04 10:18:32,040 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:18:32,040 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2055746221] [2025-03-04 10:18:32,040 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2055746221] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 10:18:32,041 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [158557548] [2025-03-04 10:18:32,041 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 10:18:32,041 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:18:32,041 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:18:32,043 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 10:18:32,045 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Waiting until timeout for monitored process [2025-03-04 10:18:32,080 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 23 statements into 2 equivalence classes. [2025-03-04 10:18:32,157 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 23 of 23 statements. [2025-03-04 10:18:32,157 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 10:18:32,157 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:18:32,158 INFO L256 TraceCheckSpWp]: Trace formula consists of 169 conjuncts, 11 conjuncts are in the unsatisfiable core [2025-03-04 10:18:32,158 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:18:32,189 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-04 10:18:32,189 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 10:18:32,312 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-04 10:18:32,313 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [158557548] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 10:18:32,313 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 10:18:32,313 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 8] total 15 [2025-03-04 10:18:32,313 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1401351764] [2025-03-04 10:18:32,313 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 10:18:32,313 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-03-04 10:18:32,313 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:18:32,313 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-03-04 10:18:32,313 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=145, Unknown=0, NotChecked=0, Total=210 [2025-03-04 10:18:32,321 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 40 [2025-03-04 10:18:32,322 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 349 places, 1273 transitions, 21938 flow. Second operand has 15 states, 15 states have (on average 16.133333333333333) internal successors, (242), 15 states have internal predecessors, (242), 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-03-04 10:18:32,322 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 10:18:32,322 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 40 [2025-03-04 10:18:32,322 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 10:18:36,051 INFO L124 PetriNetUnfolderBase]: 6618/11594 cut-off events. [2025-03-04 10:18:36,051 INFO L125 PetriNetUnfolderBase]: For 151962/151962 co-relation queries the response was YES. [2025-03-04 10:18:36,150 INFO L83 FinitePrefix]: Finished finitePrefix Result has 81864 conditions, 11594 events. 6618/11594 cut-off events. For 151962/151962 co-relation queries the response was YES. Maximal size of possible extension queue 416. Compared 81182 event pairs, 1417 based on Foata normal form. 21/11615 useless extension candidates. Maximal degree in co-relation 81716. Up to 4843 conditions per place. [2025-03-04 10:18:36,186 INFO L140 encePairwiseOnDemand]: 31/40 looper letters, 742 selfloop transitions, 668 changer transitions 0/1411 dead transitions. [2025-03-04 10:18:36,187 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 371 places, 1411 transitions, 26440 flow [2025-03-04 10:18:36,187 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2025-03-04 10:18:36,187 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2025-03-04 10:18:36,188 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 462 transitions. [2025-03-04 10:18:36,188 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5021739130434782 [2025-03-04 10:18:36,188 INFO L175 Difference]: Start difference. First operand has 349 places, 1273 transitions, 21938 flow. Second operand 23 states and 462 transitions. [2025-03-04 10:18:36,188 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 371 places, 1411 transitions, 26440 flow [2025-03-04 10:18:37,832 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 362 places, 1411 transitions, 25220 flow, removed 498 selfloop flow, removed 9 redundant places. [2025-03-04 10:18:37,852 INFO L231 Difference]: Finished difference. Result has 368 places, 1308 transitions, 23649 flow [2025-03-04 10:18:37,853 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=20732, PETRI_DIFFERENCE_MINUEND_PLACES=340, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1271, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=631, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=621, PETRI_DIFFERENCE_SUBTRAHEND_STATES=23, PETRI_FLOW=23649, PETRI_PLACES=368, PETRI_TRANSITIONS=1308} [2025-03-04 10:18:37,854 INFO L279 CegarLoopForPetriNet]: 40 programPoint places, 328 predicate places. [2025-03-04 10:18:37,854 INFO L471 AbstractCegarLoop]: Abstraction has has 368 places, 1308 transitions, 23649 flow [2025-03-04 10:18:37,854 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 16.133333333333333) internal successors, (242), 15 states have internal predecessors, (242), 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-03-04 10:18:37,854 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 10:18:37,854 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:18:37,862 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Forceful destruction successful, exit code 0 [2025-03-04 10:18:38,054 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33,19 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:18:38,055 INFO L396 AbstractCegarLoop]: === Iteration 35 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 19 more)] === [2025-03-04 10:18:38,055 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:18:38,055 INFO L85 PathProgramCache]: Analyzing trace with hash -939867947, now seen corresponding path program 9 times [2025-03-04 10:18:38,055 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:18:38,055 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1687180249] [2025-03-04 10:18:38,055 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-04 10:18:38,055 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:18:38,060 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 23 statements into 3 equivalence classes. [2025-03-04 10:18:38,064 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 21 of 23 statements. [2025-03-04 10:18:38,065 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-03-04 10:18:38,065 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:18:38,191 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-04 10:18:38,191 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:18:38,191 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1687180249] [2025-03-04 10:18:38,191 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1687180249] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 10:18:38,191 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1378147388] [2025-03-04 10:18:38,191 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-04 10:18:38,191 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:18:38,191 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:18:38,193 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 10:18:38,195 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Waiting until timeout for monitored process [2025-03-04 10:18:38,234 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 23 statements into 3 equivalence classes. [2025-03-04 10:18:38,302 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 21 of 23 statements. [2025-03-04 10:18:38,303 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-03-04 10:18:38,303 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:18:38,303 INFO L256 TraceCheckSpWp]: Trace formula consists of 156 conjuncts, 11 conjuncts are in the unsatisfiable core [2025-03-04 10:18:38,304 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:18:38,350 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-04 10:18:38,350 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 10:18:38,500 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-04 10:18:38,500 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1378147388] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 10:18:38,500 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 10:18:38,500 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 17 [2025-03-04 10:18:38,500 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [454145950] [2025-03-04 10:18:38,500 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 10:18:38,500 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2025-03-04 10:18:38,500 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:18:38,500 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2025-03-04 10:18:38,500 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=80, Invalid=192, Unknown=0, NotChecked=0, Total=272 [2025-03-04 10:18:38,506 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 40 [2025-03-04 10:18:38,507 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 368 places, 1308 transitions, 23649 flow. Second operand has 17 states, 17 states have (on average 16.058823529411764) internal successors, (273), 17 states have internal predecessors, (273), 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-03-04 10:18:38,507 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 10:18:38,507 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 40 [2025-03-04 10:18:38,507 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 10:18:43,325 INFO L124 PetriNetUnfolderBase]: 7899/13940 cut-off events. [2025-03-04 10:18:43,325 INFO L125 PetriNetUnfolderBase]: For 192052/192052 co-relation queries the response was YES. [2025-03-04 10:18:43,496 INFO L83 FinitePrefix]: Finished finitePrefix Result has 101288 conditions, 13940 events. 7899/13940 cut-off events. For 192052/192052 co-relation queries the response was YES. Maximal size of possible extension queue 579. Compared 102803 event pairs, 1653 based on Foata normal form. 42/13982 useless extension candidates. Maximal degree in co-relation 101137. Up to 6247 conditions per place. [2025-03-04 10:18:43,544 INFO L140 encePairwiseOnDemand]: 28/40 looper letters, 544 selfloop transitions, 1342 changer transitions 0/1887 dead transitions. [2025-03-04 10:18:43,544 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 409 places, 1887 transitions, 36645 flow [2025-03-04 10:18:43,545 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2025-03-04 10:18:43,545 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2025-03-04 10:18:43,545 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 892 transitions. [2025-03-04 10:18:43,546 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.530952380952381 [2025-03-04 10:18:43,546 INFO L175 Difference]: Start difference. First operand has 368 places, 1308 transitions, 23649 flow. Second operand 42 states and 892 transitions. [2025-03-04 10:18:43,546 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 409 places, 1887 transitions, 36645 flow [2025-03-04 10:18:46,169 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 402 places, 1887 transitions, 36313 flow, removed 74 selfloop flow, removed 7 redundant places. [2025-03-04 10:18:46,199 INFO L231 Difference]: Finished difference. Result has 424 places, 1732 transitions, 36798 flow [2025-03-04 10:18:46,201 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=23344, PETRI_DIFFERENCE_MINUEND_PLACES=361, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1306, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=960, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=244, PETRI_DIFFERENCE_SUBTRAHEND_STATES=42, PETRI_FLOW=36798, PETRI_PLACES=424, PETRI_TRANSITIONS=1732} [2025-03-04 10:18:46,201 INFO L279 CegarLoopForPetriNet]: 40 programPoint places, 384 predicate places. [2025-03-04 10:18:46,201 INFO L471 AbstractCegarLoop]: Abstraction has has 424 places, 1732 transitions, 36798 flow [2025-03-04 10:18:46,201 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 16.058823529411764) internal successors, (273), 17 states have internal predecessors, (273), 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-03-04 10:18:46,201 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 10:18:46,201 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:18:46,208 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Forceful destruction successful, exit code 0 [2025-03-04 10:18:46,403 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34,20 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:18:46,404 INFO L396 AbstractCegarLoop]: === Iteration 36 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 19 more)] === [2025-03-04 10:18:46,404 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:18:46,404 INFO L85 PathProgramCache]: Analyzing trace with hash 1441971073, now seen corresponding path program 10 times [2025-03-04 10:18:46,404 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:18:46,404 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1369688106] [2025-03-04 10:18:46,404 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-04 10:18:46,405 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:18:46,409 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 23 statements into 2 equivalence classes. [2025-03-04 10:18:46,414 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 23 of 23 statements. [2025-03-04 10:18:46,414 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-03-04 10:18:46,414 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:18:46,542 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-04 10:18:46,542 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:18:46,542 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1369688106] [2025-03-04 10:18:46,542 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1369688106] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 10:18:46,542 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2083613977] [2025-03-04 10:18:46,542 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-04 10:18:46,542 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:18:46,542 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:18:46,544 INFO L229 MonitoredProcess]: Starting monitored process 21 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 10:18:46,546 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Waiting until timeout for monitored process [2025-03-04 10:18:46,584 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 23 statements into 2 equivalence classes. [2025-03-04 10:18:46,609 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 23 of 23 statements. [2025-03-04 10:18:46,609 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-03-04 10:18:46,609 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:18:46,610 INFO L256 TraceCheckSpWp]: Trace formula consists of 169 conjuncts, 11 conjuncts are in the unsatisfiable core [2025-03-04 10:18:46,611 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:18:46,676 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-04 10:18:46,676 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 10:18:46,780 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-04 10:18:46,780 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2083613977] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 10:18:46,780 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 10:18:46,780 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 17 [2025-03-04 10:18:46,780 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1287429814] [2025-03-04 10:18:46,780 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 10:18:46,780 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2025-03-04 10:18:46,781 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:18:46,781 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2025-03-04 10:18:46,781 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=86, Invalid=186, Unknown=0, NotChecked=0, Total=272 [2025-03-04 10:18:46,802 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 40 [2025-03-04 10:18:46,803 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 424 places, 1732 transitions, 36798 flow. Second operand has 17 states, 17 states have (on average 16.176470588235293) internal successors, (275), 17 states have internal predecessors, (275), 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-03-04 10:18:46,803 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 10:18:46,803 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 40 [2025-03-04 10:18:46,803 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 10:18:53,594 INFO L124 PetriNetUnfolderBase]: 9224/16107 cut-off events. [2025-03-04 10:18:53,595 INFO L125 PetriNetUnfolderBase]: For 281278/281278 co-relation queries the response was YES. [2025-03-04 10:18:53,787 INFO L83 FinitePrefix]: Finished finitePrefix Result has 130660 conditions, 16107 events. 9224/16107 cut-off events. For 281278/281278 co-relation queries the response was YES. Maximal size of possible extension queue 640. Compared 120151 event pairs, 538 based on Foata normal form. 226/16333 useless extension candidates. Maximal degree in co-relation 130492. Up to 3141 conditions per place. [2025-03-04 10:18:53,855 INFO L140 encePairwiseOnDemand]: 27/40 looper letters, 706 selfloop transitions, 1613 changer transitions 0/2320 dead transitions. [2025-03-04 10:18:53,856 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 459 places, 2320 transitions, 51845 flow [2025-03-04 10:18:53,856 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2025-03-04 10:18:53,856 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2025-03-04 10:18:53,857 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 811 transitions. [2025-03-04 10:18:53,857 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.547972972972973 [2025-03-04 10:18:53,857 INFO L175 Difference]: Start difference. First operand has 424 places, 1732 transitions, 36798 flow. Second operand 37 states and 811 transitions. [2025-03-04 10:18:53,857 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 459 places, 2320 transitions, 51845 flow [2025-03-04 10:18:58,563 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 449 places, 2320 transitions, 50657 flow, removed 454 selfloop flow, removed 10 redundant places. [2025-03-04 10:18:58,598 INFO L231 Difference]: Finished difference. Result has 470 places, 2111 transitions, 50078 flow [2025-03-04 10:18:58,600 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=35114, PETRI_DIFFERENCE_MINUEND_PLACES=413, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1691, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1230, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=352, PETRI_DIFFERENCE_SUBTRAHEND_STATES=37, PETRI_FLOW=50078, PETRI_PLACES=470, PETRI_TRANSITIONS=2111} [2025-03-04 10:18:58,600 INFO L279 CegarLoopForPetriNet]: 40 programPoint places, 430 predicate places. [2025-03-04 10:18:58,600 INFO L471 AbstractCegarLoop]: Abstraction has has 470 places, 2111 transitions, 50078 flow [2025-03-04 10:18:58,600 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 16.176470588235293) internal successors, (275), 17 states have internal predecessors, (275), 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-03-04 10:18:58,600 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 10:18:58,600 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:18:58,607 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Ended with exit code 0 [2025-03-04 10:18:58,801 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable35 [2025-03-04 10:18:58,801 INFO L396 AbstractCegarLoop]: === Iteration 37 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 19 more)] === [2025-03-04 10:18:58,802 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:18:58,802 INFO L85 PathProgramCache]: Analyzing trace with hash -1912654782, now seen corresponding path program 9 times [2025-03-04 10:18:58,802 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:18:58,802 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1295266086] [2025-03-04 10:18:58,802 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-04 10:18:58,802 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:18:58,810 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 25 statements into 3 equivalence classes. [2025-03-04 10:18:58,819 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) and asserted 25 of 25 statements. [2025-03-04 10:18:58,820 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2025-03-04 10:18:58,820 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:18:58,912 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-04 10:18:58,912 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:18:58,912 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1295266086] [2025-03-04 10:18:58,912 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1295266086] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 10:18:58,912 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2035313253] [2025-03-04 10:18:58,912 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-04 10:18:58,912 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:18:58,912 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:18:58,914 INFO L229 MonitoredProcess]: Starting monitored process 22 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 10:18:58,915 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Waiting until timeout for monitored process [2025-03-04 10:18:58,950 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 25 statements into 3 equivalence classes. [2025-03-04 10:18:59,052 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) and asserted 25 of 25 statements. [2025-03-04 10:18:59,053 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2025-03-04 10:18:59,053 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:18:59,053 INFO L256 TraceCheckSpWp]: Trace formula consists of 179 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-03-04 10:18:59,054 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:18:59,102 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-04 10:18:59,102 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 10:18:59,183 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-04 10:18:59,183 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2035313253] provided 1 perfect and 1 imperfect interpolant sequences [2025-03-04 10:18:59,183 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-03-04 10:18:59,183 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [9, 7] total 17 [2025-03-04 10:18:59,183 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1051870292] [2025-03-04 10:18:59,183 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:18:59,184 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 10:18:59,184 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:18:59,184 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 10:18:59,184 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=74, Invalid=198, Unknown=0, NotChecked=0, Total=272 [2025-03-04 10:18:59,191 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 15 out of 40 [2025-03-04 10:18:59,191 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 470 places, 2111 transitions, 50078 flow. Second operand has 6 states, 6 states have (on average 18.666666666666668) internal successors, (112), 6 states have internal predecessors, (112), 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-03-04 10:18:59,191 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 10:18:59,191 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 15 of 40 [2025-03-04 10:18:59,191 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 10:19:05,883 INFO L124 PetriNetUnfolderBase]: 8524/15269 cut-off events. [2025-03-04 10:19:05,883 INFO L125 PetriNetUnfolderBase]: For 304831/304831 co-relation queries the response was YES. [2025-03-04 10:19:06,048 INFO L83 FinitePrefix]: Finished finitePrefix Result has 135883 conditions, 15269 events. 8524/15269 cut-off events. For 304831/304831 co-relation queries the response was YES. Maximal size of possible extension queue 642. Compared 117423 event pairs, 941 based on Foata normal form. 22/15278 useless extension candidates. Maximal degree in co-relation 135695. Up to 12002 conditions per place. [2025-03-04 10:19:06,111 INFO L140 encePairwiseOnDemand]: 32/40 looper letters, 1521 selfloop transitions, 619 changer transitions 0/2144 dead transitions. [2025-03-04 10:19:06,111 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 476 places, 2144 transitions, 54709 flow [2025-03-04 10:19:06,111 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-04 10:19:06,111 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-03-04 10:19:06,111 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 168 transitions. [2025-03-04 10:19:06,111 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6 [2025-03-04 10:19:06,112 INFO L175 Difference]: Start difference. First operand has 470 places, 2111 transitions, 50078 flow. Second operand 7 states and 168 transitions. [2025-03-04 10:19:06,112 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 476 places, 2144 transitions, 54709 flow