./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/weaver/chl-word-symm.wvr.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version e2fb8bed 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/chl-word-symm.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 bf81f7b3bd1ceac2bf46c7c37f69effc0af9de17b18c7565156301fb49a6164e --- Real Ultimate output --- This is Ultimate 0.3.0-?-e2fb8be-m [2025-03-09 01:21:16,555 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-09 01:21:16,621 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2025-03-09 01:21:16,628 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-09 01:21:16,629 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-09 01:21:16,658 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-09 01:21:16,659 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-09 01:21:16,659 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-09 01:21:16,660 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-09 01:21:16,660 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-09 01:21:16,660 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-09 01:21:16,660 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-09 01:21:16,660 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-09 01:21:16,660 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-09 01:21:16,661 INFO L153 SettingsManager]: * Use SBE=true [2025-03-09 01:21:16,661 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-09 01:21:16,661 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-09 01:21:16,661 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-09 01:21:16,661 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-09 01:21:16,661 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-09 01:21:16,661 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2025-03-09 01:21:16,661 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2025-03-09 01:21:16,662 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2025-03-09 01:21:16,662 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-09 01:21:16,662 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-03-09 01:21:16,662 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-03-09 01:21:16,662 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-09 01:21:16,662 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-09 01:21:16,662 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-09 01:21:16,662 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-09 01:21:16,663 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-09 01:21:16,663 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-09 01:21:16,663 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-09 01:21:16,663 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-09 01:21:16,663 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-09 01:21:16,663 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-09 01:21:16,663 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-09 01:21:16,663 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-09 01:21:16,664 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-09 01:21:16,664 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-09 01:21:16,664 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-09 01:21:16,664 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-09 01:21:16,664 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 -> bf81f7b3bd1ceac2bf46c7c37f69effc0af9de17b18c7565156301fb49a6164e [2025-03-09 01:21:16,893 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-09 01:21:16,899 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-09 01:21:16,901 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-09 01:21:16,903 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-09 01:21:16,903 INFO L274 PluginConnector]: CDTParser initialized [2025-03-09 01:21:16,904 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/weaver/chl-word-symm.wvr.c [2025-03-09 01:21:18,182 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2cde33ada/2594353142714a0dab4eb0c6d6786d22/FLAG1beece59b [2025-03-09 01:21:18,412 INFO L384 CDTParser]: Found 1 translation units. [2025-03-09 01:21:18,412 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/weaver/chl-word-symm.wvr.c [2025-03-09 01:21:18,417 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2cde33ada/2594353142714a0dab4eb0c6d6786d22/FLAG1beece59b [2025-03-09 01:21:18,427 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2cde33ada/2594353142714a0dab4eb0c6d6786d22 [2025-03-09 01:21:18,428 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-09 01:21:18,429 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-09 01:21:18,430 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-09 01:21:18,430 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-09 01:21:18,433 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-09 01:21:18,433 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.03 01:21:18" (1/1) ... [2025-03-09 01:21:18,434 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@75fa345a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:21:18, skipping insertion in model container [2025-03-09 01:21:18,434 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.03 01:21:18" (1/1) ... [2025-03-09 01:21:18,447 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-09 01:21:18,559 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-09 01:21:18,561 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-09 01:21:18,572 INFO L200 MainTranslator]: Completed pre-run [2025-03-09 01:21:18,594 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-09 01:21:18,611 INFO L204 MainTranslator]: Completed translation [2025-03-09 01:21:18,611 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:21:18 WrapperNode [2025-03-09 01:21:18,611 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-09 01:21:18,612 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-09 01:21:18,612 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-09 01:21:18,612 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-09 01:21:18,616 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:21:18" (1/1) ... [2025-03-09 01:21:18,621 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:21:18" (1/1) ... [2025-03-09 01:21:18,634 INFO L138 Inliner]: procedures = 23, calls = 26, calls flagged for inlining = 10, calls inlined = 12, statements flattened = 119 [2025-03-09 01:21:18,634 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-09 01:21:18,635 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-09 01:21:18,635 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-09 01:21:18,635 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-09 01:21:18,640 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:21:18" (1/1) ... [2025-03-09 01:21:18,640 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:21:18" (1/1) ... [2025-03-09 01:21:18,642 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:21:18" (1/1) ... [2025-03-09 01:21:18,653 INFO L175 MemorySlicer]: Split 12 memory accesses to 2 slices as follows [2, 10]. 83 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0]. The 2 writes are split as follows [0, 2]. [2025-03-09 01:21:18,653 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:21:18" (1/1) ... [2025-03-09 01:21:18,653 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:21:18" (1/1) ... [2025-03-09 01:21:18,658 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:21:18" (1/1) ... [2025-03-09 01:21:18,659 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:21:18" (1/1) ... [2025-03-09 01:21:18,659 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:21:18" (1/1) ... [2025-03-09 01:21:18,660 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:21:18" (1/1) ... [2025-03-09 01:21:18,661 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-09 01:21:18,663 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-09 01:21:18,663 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-09 01:21:18,663 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-09 01:21:18,664 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:21:18" (1/1) ... [2025-03-09 01:21:18,668 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-09 01:21:18,679 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 01:21:18,690 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-09 01:21:18,691 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-09 01:21:18,707 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-09 01:21:18,707 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2025-03-09 01:21:18,707 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2025-03-09 01:21:18,707 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2025-03-09 01:21:18,707 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2025-03-09 01:21:18,707 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-09 01:21:18,707 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-03-09 01:21:18,707 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-03-09 01:21:18,707 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-03-09 01:21:18,707 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-03-09 01:21:18,707 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-09 01:21:18,707 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-09 01:21:18,707 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-03-09 01:21:18,708 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-03-09 01:21:18,708 WARN L225 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-03-09 01:21:18,788 INFO L256 CfgBuilder]: Building ICFG [2025-03-09 01:21:18,789 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-09 01:21:19,137 INFO L303 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-03-09 01:21:19,137 INFO L307 CfgBuilder]: Performing block encoding [2025-03-09 01:21:19,343 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-09 01:21:19,343 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-09 01:21:19,344 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 09.03 01:21:19 BoogieIcfgContainer [2025-03-09 01:21:19,344 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-09 01:21:19,345 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-09 01:21:19,345 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-09 01:21:19,349 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-09 01:21:19,349 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.03 01:21:18" (1/3) ... [2025-03-09 01:21:19,350 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@326c6cd1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.03 01:21:19, skipping insertion in model container [2025-03-09 01:21:19,351 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:21:18" (2/3) ... [2025-03-09 01:21:19,351 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@326c6cd1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.03 01:21:19, skipping insertion in model container [2025-03-09 01:21:19,351 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 09.03 01:21:19" (3/3) ... [2025-03-09 01:21:19,352 INFO L128 eAbstractionObserver]: Analyzing ICFG chl-word-symm.wvr.c [2025-03-09 01:21:19,364 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-09 01:21:19,365 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG chl-word-symm.wvr.c that has 3 procedures, 59 locations, 1 initial locations, 4 loop locations, and 22 error locations. [2025-03-09 01:21:19,366 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-03-09 01:21:19,432 INFO L143 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2025-03-09 01:21:19,459 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 65 places, 66 transitions, 146 flow [2025-03-09 01:21:19,493 INFO L124 PetriNetUnfolderBase]: 8/64 cut-off events. [2025-03-09 01:21:19,495 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2025-03-09 01:21:19,497 INFO L83 FinitePrefix]: Finished finitePrefix Result has 73 conditions, 64 events. 8/64 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 175 event pairs, 0 based on Foata normal form. 0/34 useless extension candidates. Maximal degree in co-relation 47. Up to 2 conditions per place. [2025-03-09 01:21:19,497 INFO L82 GeneralOperation]: Start removeDead. Operand has 65 places, 66 transitions, 146 flow [2025-03-09 01:21:19,501 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 62 places, 63 transitions, 138 flow [2025-03-09 01:21:19,506 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-09 01:21:19,519 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;@389ba286, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-09 01:21:19,519 INFO L334 AbstractCegarLoop]: Starting to check reachability of 40 error locations. [2025-03-09 01:21:19,522 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-09 01:21:19,523 INFO L124 PetriNetUnfolderBase]: 1/4 cut-off events. [2025-03-09 01:21:19,523 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-09 01:21:19,523 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 01:21:19,524 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2025-03-09 01:21:19,524 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 37 more)] === [2025-03-09 01:21:19,528 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:21:19,529 INFO L85 PathProgramCache]: Analyzing trace with hash 504266, now seen corresponding path program 1 times [2025-03-09 01:21:19,534 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:21:19,534 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1642104805] [2025-03-09 01:21:19,534 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:21:19,537 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:21:19,586 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-03-09 01:21:19,604 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-03-09 01:21:19,604 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:21:19,605 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:21:19,720 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-09 01:21:19,722 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:21:19,722 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1642104805] [2025-03-09 01:21:19,723 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1642104805] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 01:21:19,723 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 01:21:19,723 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-03-09 01:21:19,724 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1631369908] [2025-03-09 01:21:19,725 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 01:21:19,729 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-09 01:21:19,733 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:21:19,749 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-09 01:21:19,749 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-09 01:21:19,797 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 32 out of 66 [2025-03-09 01:21:19,799 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 62 places, 63 transitions, 138 flow. Second operand has 3 states, 3 states have (on average 33.0) internal successors, (99), 3 states have internal predecessors, (99), 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-09 01:21:19,799 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 01:21:19,800 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 32 of 66 [2025-03-09 01:21:19,800 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 01:21:19,958 INFO L124 PetriNetUnfolderBase]: 206/515 cut-off events. [2025-03-09 01:21:19,959 INFO L125 PetriNetUnfolderBase]: For 20/20 co-relation queries the response was YES. [2025-03-09 01:21:19,960 INFO L83 FinitePrefix]: Finished finitePrefix Result has 857 conditions, 515 events. 206/515 cut-off events. For 20/20 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 2822 event pairs, 115 based on Foata normal form. 1/320 useless extension candidates. Maximal degree in co-relation 791. Up to 312 conditions per place. [2025-03-09 01:21:19,964 INFO L140 encePairwiseOnDemand]: 61/66 looper letters, 28 selfloop transitions, 2 changer transitions 0/59 dead transitions. [2025-03-09 01:21:19,964 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 60 places, 59 transitions, 190 flow [2025-03-09 01:21:19,965 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-09 01:21:19,967 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-09 01:21:19,973 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 129 transitions. [2025-03-09 01:21:19,974 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6515151515151515 [2025-03-09 01:21:19,976 INFO L175 Difference]: Start difference. First operand has 62 places, 63 transitions, 138 flow. Second operand 3 states and 129 transitions. [2025-03-09 01:21:19,976 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 60 places, 59 transitions, 190 flow [2025-03-09 01:21:19,980 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 56 places, 59 transitions, 182 flow, removed 0 selfloop flow, removed 4 redundant places. [2025-03-09 01:21:19,982 INFO L231 Difference]: Finished difference. Result has 56 places, 59 transitions, 126 flow [2025-03-09 01:21:19,985 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=66, PETRI_DIFFERENCE_MINUEND_FLOW=122, PETRI_DIFFERENCE_MINUEND_PLACES=54, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=59, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=57, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=126, PETRI_PLACES=56, PETRI_TRANSITIONS=59} [2025-03-09 01:21:19,987 INFO L279 CegarLoopForPetriNet]: 62 programPoint places, -6 predicate places. [2025-03-09 01:21:19,987 INFO L471 AbstractCegarLoop]: Abstraction has has 56 places, 59 transitions, 126 flow [2025-03-09 01:21:19,988 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 33.0) internal successors, (99), 3 states have internal predecessors, (99), 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-09 01:21:19,988 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 01:21:19,988 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2025-03-09 01:21:19,988 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-09 01:21:19,988 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 37 more)] === [2025-03-09 01:21:19,988 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:21:19,988 INFO L85 PathProgramCache]: Analyzing trace with hash 504267, now seen corresponding path program 1 times [2025-03-09 01:21:19,988 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:21:19,988 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [966042772] [2025-03-09 01:21:19,989 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:21:19,989 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:21:19,994 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-03-09 01:21:20,017 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-03-09 01:21:20,018 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:21:20,018 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:21:20,257 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-09 01:21:20,257 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:21:20,258 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [966042772] [2025-03-09 01:21:20,258 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [966042772] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 01:21:20,258 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 01:21:20,258 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-09 01:21:20,258 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [449208567] [2025-03-09 01:21:20,258 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 01:21:20,259 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-09 01:21:20,259 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:21:20,259 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-09 01:21:20,259 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-09 01:21:20,334 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 32 out of 66 [2025-03-09 01:21:20,335 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 56 places, 59 transitions, 126 flow. Second operand has 4 states, 4 states have (on average 32.75) internal successors, (131), 4 states have internal predecessors, (131), 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-09 01:21:20,335 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 01:21:20,335 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 32 of 66 [2025-03-09 01:21:20,335 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 01:21:20,473 INFO L124 PetriNetUnfolderBase]: 206/514 cut-off events. [2025-03-09 01:21:20,474 INFO L125 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2025-03-09 01:21:20,476 INFO L83 FinitePrefix]: Finished finitePrefix Result has 844 conditions, 514 events. 206/514 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 2797 event pairs, 115 based on Foata normal form. 0/318 useless extension candidates. Maximal degree in co-relation 823. Up to 316 conditions per place. [2025-03-09 01:21:20,480 INFO L140 encePairwiseOnDemand]: 61/66 looper letters, 27 selfloop transitions, 4 changer transitions 0/58 dead transitions. [2025-03-09 01:21:20,480 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 58 places, 58 transitions, 186 flow [2025-03-09 01:21:20,481 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-09 01:21:20,481 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-09 01:21:20,481 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 160 transitions. [2025-03-09 01:21:20,482 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6060606060606061 [2025-03-09 01:21:20,483 INFO L175 Difference]: Start difference. First operand has 56 places, 59 transitions, 126 flow. Second operand 4 states and 160 transitions. [2025-03-09 01:21:20,483 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 58 places, 58 transitions, 186 flow [2025-03-09 01:21:20,483 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 56 places, 58 transitions, 182 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-09 01:21:20,484 INFO L231 Difference]: Finished difference. Result has 56 places, 58 transitions, 128 flow [2025-03-09 01:21:20,484 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=66, PETRI_DIFFERENCE_MINUEND_FLOW=120, PETRI_DIFFERENCE_MINUEND_PLACES=53, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=58, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=54, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=128, PETRI_PLACES=56, PETRI_TRANSITIONS=58} [2025-03-09 01:21:20,484 INFO L279 CegarLoopForPetriNet]: 62 programPoint places, -6 predicate places. [2025-03-09 01:21:20,484 INFO L471 AbstractCegarLoop]: Abstraction has has 56 places, 58 transitions, 128 flow [2025-03-09 01:21:20,485 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 32.75) internal successors, (131), 4 states have internal predecessors, (131), 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-09 01:21:20,485 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 01:21:20,485 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1] [2025-03-09 01:21:20,485 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-09 01:21:20,485 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 37 more)] === [2025-03-09 01:21:20,486 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:21:20,487 INFO L85 PathProgramCache]: Analyzing trace with hash 15633789, now seen corresponding path program 1 times [2025-03-09 01:21:20,487 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:21:20,487 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1400120250] [2025-03-09 01:21:20,487 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:21:20,487 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:21:20,494 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-03-09 01:21:20,508 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-03-09 01:21:20,508 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:21:20,508 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:21:20,668 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-09 01:21:20,668 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:21:20,668 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1400120250] [2025-03-09 01:21:20,669 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1400120250] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 01:21:20,669 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 01:21:20,669 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-09 01:21:20,669 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [5978273] [2025-03-09 01:21:20,669 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 01:21:20,670 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-09 01:21:20,670 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:21:20,670 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-09 01:21:20,670 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-09 01:21:20,823 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 32 out of 66 [2025-03-09 01:21:20,824 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 56 places, 58 transitions, 128 flow. Second operand has 5 states, 5 states have (on average 32.8) internal successors, (164), 5 states have internal predecessors, (164), 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-09 01:21:20,825 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 01:21:20,825 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 32 of 66 [2025-03-09 01:21:20,825 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 01:21:20,948 INFO L124 PetriNetUnfolderBase]: 208/520 cut-off events. [2025-03-09 01:21:20,948 INFO L125 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2025-03-09 01:21:20,949 INFO L83 FinitePrefix]: Finished finitePrefix Result has 861 conditions, 520 events. 208/520 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 47. Compared 2814 event pairs, 115 based on Foata normal form. 0/321 useless extension candidates. Maximal degree in co-relation 837. Up to 319 conditions per place. [2025-03-09 01:21:20,951 INFO L140 encePairwiseOnDemand]: 58/66 looper letters, 30 selfloop transitions, 7 changer transitions 0/64 dead transitions. [2025-03-09 01:21:20,951 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 60 places, 64 transitions, 220 flow [2025-03-09 01:21:20,952 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-09 01:21:20,952 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-03-09 01:21:20,952 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 198 transitions. [2025-03-09 01:21:20,953 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6 [2025-03-09 01:21:20,953 INFO L175 Difference]: Start difference. First operand has 56 places, 58 transitions, 128 flow. Second operand 5 states and 198 transitions. [2025-03-09 01:21:20,953 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 60 places, 64 transitions, 220 flow [2025-03-09 01:21:20,953 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 57 places, 64 transitions, 206 flow, removed 0 selfloop flow, removed 3 redundant places. [2025-03-09 01:21:20,957 INFO L231 Difference]: Finished difference. Result has 60 places, 64 transitions, 173 flow [2025-03-09 01:21:20,958 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=66, PETRI_DIFFERENCE_MINUEND_FLOW=120, PETRI_DIFFERENCE_MINUEND_PLACES=53, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=58, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=51, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=173, PETRI_PLACES=60, PETRI_TRANSITIONS=64} [2025-03-09 01:21:20,958 INFO L279 CegarLoopForPetriNet]: 62 programPoint places, -2 predicate places. [2025-03-09 01:21:20,959 INFO L471 AbstractCegarLoop]: Abstraction has has 60 places, 64 transitions, 173 flow [2025-03-09 01:21:20,959 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 32.8) internal successors, (164), 5 states have internal predecessors, (164), 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-09 01:21:20,959 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 01:21:20,959 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1] [2025-03-09 01:21:20,959 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-09 01:21:20,959 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 37 more)] === [2025-03-09 01:21:20,960 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:21:20,960 INFO L85 PathProgramCache]: Analyzing trace with hash 2139185919, now seen corresponding path program 1 times [2025-03-09 01:21:20,960 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:21:20,960 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [203909704] [2025-03-09 01:21:20,960 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:21:20,960 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:21:20,969 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-03-09 01:21:20,983 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-03-09 01:21:20,985 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:21:20,985 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:21:21,192 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-09 01:21:21,192 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:21:21,192 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [203909704] [2025-03-09 01:21:21,193 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [203909704] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 01:21:21,193 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [781689782] [2025-03-09 01:21:21,193 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:21:21,193 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 01:21:21,193 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 01:21:21,199 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-09 01:21:21,200 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-09 01:21:21,239 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-03-09 01:21:21,252 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-03-09 01:21:21,252 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:21:21,252 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:21:21,258 INFO L256 TraceCheckSpWp]: Trace formula consists of 100 conjuncts, 16 conjuncts are in the unsatisfiable core [2025-03-09 01:21:21,264 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 01:21:21,327 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-09 01:21:21,490 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-09 01:21:21,490 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 01:21:21,640 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-09 01:21:21,640 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [781689782] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-09 01:21:21,640 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-09 01:21:21,640 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 11 [2025-03-09 01:21:21,640 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1263127387] [2025-03-09 01:21:21,640 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-09 01:21:21,641 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-03-09 01:21:21,641 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:21:21,641 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-03-09 01:21:21,641 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=117, Unknown=0, NotChecked=0, Total=156 [2025-03-09 01:21:22,087 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 32 out of 66 [2025-03-09 01:21:22,089 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 60 places, 64 transitions, 173 flow. Second operand has 13 states, 13 states have (on average 33.30769230769231) internal successors, (433), 13 states have internal predecessors, (433), 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-09 01:21:22,089 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 01:21:22,089 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 32 of 66 [2025-03-09 01:21:22,089 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 01:21:22,376 INFO L124 PetriNetUnfolderBase]: 210/525 cut-off events. [2025-03-09 01:21:22,376 INFO L125 PetriNetUnfolderBase]: For 6/6 co-relation queries the response was YES. [2025-03-09 01:21:22,378 INFO L83 FinitePrefix]: Finished finitePrefix Result has 893 conditions, 525 events. 210/525 cut-off events. For 6/6 co-relation queries the response was YES. Maximal size of possible extension queue 47. Compared 2839 event pairs, 115 based on Foata normal form. 0/329 useless extension candidates. Maximal degree in co-relation 833. Up to 313 conditions per place. [2025-03-09 01:21:22,380 INFO L140 encePairwiseOnDemand]: 58/66 looper letters, 24 selfloop transitions, 18 changer transitions 0/69 dead transitions. [2025-03-09 01:21:22,381 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 67 places, 69 transitions, 279 flow [2025-03-09 01:21:22,381 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-09 01:21:22,381 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2025-03-09 01:21:22,382 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 332 transitions. [2025-03-09 01:21:22,383 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5589225589225589 [2025-03-09 01:21:22,383 INFO L175 Difference]: Start difference. First operand has 60 places, 64 transitions, 173 flow. Second operand 9 states and 332 transitions. [2025-03-09 01:21:22,383 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 67 places, 69 transitions, 279 flow [2025-03-09 01:21:22,383 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 66 places, 69 transitions, 278 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-09 01:21:22,384 INFO L231 Difference]: Finished difference. Result has 66 places, 69 transitions, 230 flow [2025-03-09 01:21:22,386 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=66, PETRI_DIFFERENCE_MINUEND_FLOW=168, PETRI_DIFFERENCE_MINUEND_PLACES=58, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=63, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=51, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=230, PETRI_PLACES=66, PETRI_TRANSITIONS=69} [2025-03-09 01:21:22,387 INFO L279 CegarLoopForPetriNet]: 62 programPoint places, 4 predicate places. [2025-03-09 01:21:22,387 INFO L471 AbstractCegarLoop]: Abstraction has has 66 places, 69 transitions, 230 flow [2025-03-09 01:21:22,388 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 33.30769230769231) internal successors, (433), 13 states have internal predecessors, (433), 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-09 01:21:22,388 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 01:21:22,388 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 01:21:22,395 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-09 01:21:22,588 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 01:21:22,589 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting thread1Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 37 more)] === [2025-03-09 01:21:22,589 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:21:22,590 INFO L85 PathProgramCache]: Analyzing trace with hash -1483349769, now seen corresponding path program 1 times [2025-03-09 01:21:22,590 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:21:22,590 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1162989606] [2025-03-09 01:21:22,590 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:21:22,590 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:21:22,596 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-03-09 01:21:22,602 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-03-09 01:21:22,602 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:21:22,602 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:21:22,662 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-09 01:21:22,662 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:21:22,663 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1162989606] [2025-03-09 01:21:22,663 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1162989606] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 01:21:22,663 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 01:21:22,664 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-09 01:21:22,664 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [378774995] [2025-03-09 01:21:22,665 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 01:21:22,665 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-09 01:21:22,665 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:21:22,665 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-09 01:21:22,665 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-09 01:21:22,691 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 33 out of 66 [2025-03-09 01:21:22,691 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 66 places, 69 transitions, 230 flow. Second operand has 5 states, 5 states have (on average 34.4) internal successors, (172), 5 states have internal predecessors, (172), 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-09 01:21:22,692 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 01:21:22,692 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 33 of 66 [2025-03-09 01:21:22,692 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 01:21:22,863 INFO L124 PetriNetUnfolderBase]: 365/981 cut-off events. [2025-03-09 01:21:22,863 INFO L125 PetriNetUnfolderBase]: For 13/13 co-relation queries the response was YES. [2025-03-09 01:21:22,865 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1650 conditions, 981 events. 365/981 cut-off events. For 13/13 co-relation queries the response was YES. Maximal size of possible extension queue 77. Compared 6425 event pairs, 196 based on Foata normal form. 16/647 useless extension candidates. Maximal degree in co-relation 986. Up to 360 conditions per place. [2025-03-09 01:21:22,868 INFO L140 encePairwiseOnDemand]: 57/66 looper letters, 72 selfloop transitions, 11 changer transitions 0/109 dead transitions. [2025-03-09 01:21:22,868 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 71 places, 109 transitions, 523 flow [2025-03-09 01:21:22,868 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-09 01:21:22,868 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-09 01:21:22,869 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 269 transitions. [2025-03-09 01:21:22,869 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6792929292929293 [2025-03-09 01:21:22,869 INFO L175 Difference]: Start difference. First operand has 66 places, 69 transitions, 230 flow. Second operand 6 states and 269 transitions. [2025-03-09 01:21:22,869 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 71 places, 109 transitions, 523 flow [2025-03-09 01:21:22,871 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 65 places, 109 transitions, 455 flow, removed 16 selfloop flow, removed 6 redundant places. [2025-03-09 01:21:22,872 INFO L231 Difference]: Finished difference. Result has 68 places, 77 transitions, 271 flow [2025-03-09 01:21:22,872 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=66, PETRI_DIFFERENCE_MINUEND_FLOW=184, PETRI_DIFFERENCE_MINUEND_PLACES=60, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=69, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=58, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=271, PETRI_PLACES=68, PETRI_TRANSITIONS=77} [2025-03-09 01:21:22,875 INFO L279 CegarLoopForPetriNet]: 62 programPoint places, 6 predicate places. [2025-03-09 01:21:22,875 INFO L471 AbstractCegarLoop]: Abstraction has has 68 places, 77 transitions, 271 flow [2025-03-09 01:21:22,875 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 34.4) internal successors, (172), 5 states have internal predecessors, (172), 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-09 01:21:22,875 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 01:21:22,875 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 01:21:22,875 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-09 01:21:22,875 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting thread1Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 37 more)] === [2025-03-09 01:21:22,876 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:21:22,876 INFO L85 PathProgramCache]: Analyzing trace with hash -831612344, now seen corresponding path program 1 times [2025-03-09 01:21:22,876 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:21:22,876 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1817326228] [2025-03-09 01:21:22,876 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:21:22,876 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:21:22,882 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-03-09 01:21:22,888 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-03-09 01:21:22,888 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:21:22,888 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:21:22,947 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-09 01:21:22,947 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:21:22,948 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1817326228] [2025-03-09 01:21:22,948 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1817326228] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 01:21:22,948 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 01:21:22,948 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-09 01:21:22,948 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2037336444] [2025-03-09 01:21:22,948 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 01:21:22,948 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-09 01:21:22,948 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:21:22,949 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-09 01:21:22,949 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-09 01:21:22,979 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 33 out of 66 [2025-03-09 01:21:22,979 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 68 places, 77 transitions, 271 flow. Second operand has 5 states, 5 states have (on average 34.8) internal successors, (174), 5 states have internal predecessors, (174), 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-09 01:21:22,979 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 01:21:22,979 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 33 of 66 [2025-03-09 01:21:22,980 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 01:21:23,208 INFO L124 PetriNetUnfolderBase]: 629/1654 cut-off events. [2025-03-09 01:21:23,208 INFO L125 PetriNetUnfolderBase]: For 257/257 co-relation queries the response was YES. [2025-03-09 01:21:23,210 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2949 conditions, 1654 events. 629/1654 cut-off events. For 257/257 co-relation queries the response was YES. Maximal size of possible extension queue 128. Compared 12360 event pairs, 343 based on Foata normal form. 16/1168 useless extension candidates. Maximal degree in co-relation 2029. Up to 581 conditions per place. [2025-03-09 01:21:23,214 INFO L140 encePairwiseOnDemand]: 60/66 looper letters, 73 selfloop transitions, 11 changer transitions 0/110 dead transitions. [2025-03-09 01:21:23,214 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 72 places, 110 transitions, 522 flow [2025-03-09 01:21:23,214 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-09 01:21:23,215 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-03-09 01:21:23,215 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 231 transitions. [2025-03-09 01:21:23,215 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7 [2025-03-09 01:21:23,215 INFO L175 Difference]: Start difference. First operand has 68 places, 77 transitions, 271 flow. Second operand 5 states and 231 transitions. [2025-03-09 01:21:23,215 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 72 places, 110 transitions, 522 flow [2025-03-09 01:21:23,217 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 71 places, 110 transitions, 518 flow, removed 1 selfloop flow, removed 1 redundant places. [2025-03-09 01:21:23,218 INFO L231 Difference]: Finished difference. Result has 73 places, 81 transitions, 329 flow [2025-03-09 01:21:23,218 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=66, PETRI_DIFFERENCE_MINUEND_FLOW=267, PETRI_DIFFERENCE_MINUEND_PLACES=67, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=77, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=66, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=329, PETRI_PLACES=73, PETRI_TRANSITIONS=81} [2025-03-09 01:21:23,218 INFO L279 CegarLoopForPetriNet]: 62 programPoint places, 11 predicate places. [2025-03-09 01:21:23,219 INFO L471 AbstractCegarLoop]: Abstraction has has 73 places, 81 transitions, 329 flow [2025-03-09 01:21:23,219 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 34.8) internal successors, (174), 5 states have internal predecessors, (174), 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-09 01:21:23,219 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 01:21:23,219 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 01:21:23,219 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-09 01:21:23,219 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting thread2Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 37 more)] === [2025-03-09 01:21:23,219 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:21:23,219 INFO L85 PathProgramCache]: Analyzing trace with hash -1020299690, now seen corresponding path program 1 times [2025-03-09 01:21:23,219 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:21:23,219 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [106838550] [2025-03-09 01:21:23,219 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:21:23,219 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:21:23,223 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-03-09 01:21:23,226 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-03-09 01:21:23,226 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:21:23,226 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:21:23,262 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-09 01:21:23,263 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:21:23,263 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [106838550] [2025-03-09 01:21:23,263 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [106838550] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 01:21:23,263 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 01:21:23,263 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-09 01:21:23,263 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [919082590] [2025-03-09 01:21:23,263 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 01:21:23,263 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-09 01:21:23,264 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:21:23,264 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-09 01:21:23,264 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-09 01:21:23,318 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 25 out of 66 [2025-03-09 01:21:23,319 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 73 places, 81 transitions, 329 flow. Second operand has 4 states, 4 states have (on average 27.25) internal successors, (109), 4 states have internal predecessors, (109), 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-09 01:21:23,319 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 01:21:23,319 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 25 of 66 [2025-03-09 01:21:23,319 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 01:21:23,461 INFO L124 PetriNetUnfolderBase]: 768/1781 cut-off events. [2025-03-09 01:21:23,462 INFO L125 PetriNetUnfolderBase]: For 960/968 co-relation queries the response was YES. [2025-03-09 01:21:23,464 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3596 conditions, 1781 events. 768/1781 cut-off events. For 960/968 co-relation queries the response was YES. Maximal size of possible extension queue 116. Compared 12085 event pairs, 500 based on Foata normal form. 0/1425 useless extension candidates. Maximal degree in co-relation 2334. Up to 1220 conditions per place. [2025-03-09 01:21:23,470 INFO L140 encePairwiseOnDemand]: 60/66 looper letters, 52 selfloop transitions, 5 changer transitions 0/77 dead transitions. [2025-03-09 01:21:23,471 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 72 places, 77 transitions, 435 flow [2025-03-09 01:21:23,471 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-09 01:21:23,471 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-09 01:21:23,471 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 137 transitions. [2025-03-09 01:21:23,472 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5189393939393939 [2025-03-09 01:21:23,472 INFO L175 Difference]: Start difference. First operand has 73 places, 81 transitions, 329 flow. Second operand 4 states and 137 transitions. [2025-03-09 01:21:23,472 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 72 places, 77 transitions, 435 flow [2025-03-09 01:21:23,474 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 70 places, 77 transitions, 423 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-09 01:21:23,475 INFO L231 Difference]: Finished difference. Result has 70 places, 77 transitions, 319 flow [2025-03-09 01:21:23,475 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=66, PETRI_DIFFERENCE_MINUEND_FLOW=309, PETRI_DIFFERENCE_MINUEND_PLACES=67, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=77, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=72, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=319, PETRI_PLACES=70, PETRI_TRANSITIONS=77} [2025-03-09 01:21:23,476 INFO L279 CegarLoopForPetriNet]: 62 programPoint places, 8 predicate places. [2025-03-09 01:21:23,476 INFO L471 AbstractCegarLoop]: Abstraction has has 70 places, 77 transitions, 319 flow [2025-03-09 01:21:23,476 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 27.25) internal successors, (109), 4 states have internal predecessors, (109), 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-09 01:21:23,476 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 01:21:23,476 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 01:21:23,476 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-09 01:21:23,477 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting thread2Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 37 more)] === [2025-03-09 01:21:23,478 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:21:23,478 INFO L85 PathProgramCache]: Analyzing trace with hash -1020299689, now seen corresponding path program 1 times [2025-03-09 01:21:23,478 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:21:23,478 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [768478257] [2025-03-09 01:21:23,478 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:21:23,478 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:21:23,486 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-03-09 01:21:23,493 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-03-09 01:21:23,494 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:21:23,494 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:21:23,552 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-09 01:21:23,552 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:21:23,552 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [768478257] [2025-03-09 01:21:23,552 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [768478257] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 01:21:23,552 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 01:21:23,552 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-09 01:21:23,552 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [879715205] [2025-03-09 01:21:23,552 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 01:21:23,553 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-09 01:21:23,553 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:21:23,553 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-09 01:21:23,553 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-09 01:21:23,591 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 33 out of 66 [2025-03-09 01:21:23,591 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 70 places, 77 transitions, 319 flow. Second operand has 5 states, 5 states have (on average 34.8) internal successors, (174), 5 states have internal predecessors, (174), 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-09 01:21:23,591 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 01:21:23,591 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 33 of 66 [2025-03-09 01:21:23,591 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 01:21:23,739 INFO L124 PetriNetUnfolderBase]: 557/1247 cut-off events. [2025-03-09 01:21:23,739 INFO L125 PetriNetUnfolderBase]: For 699/711 co-relation queries the response was YES. [2025-03-09 01:21:23,741 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2624 conditions, 1247 events. 557/1247 cut-off events. For 699/711 co-relation queries the response was YES. Maximal size of possible extension queue 78. Compared 7482 event pairs, 333 based on Foata normal form. 22/1021 useless extension candidates. Maximal degree in co-relation 1792. Up to 594 conditions per place. [2025-03-09 01:21:23,746 INFO L140 encePairwiseOnDemand]: 57/66 looper letters, 71 selfloop transitions, 11 changer transitions 0/104 dead transitions. [2025-03-09 01:21:23,746 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 75 places, 104 transitions, 580 flow [2025-03-09 01:21:23,746 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-09 01:21:23,746 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-09 01:21:23,747 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 262 transitions. [2025-03-09 01:21:23,747 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6616161616161617 [2025-03-09 01:21:23,747 INFO L175 Difference]: Start difference. First operand has 70 places, 77 transitions, 319 flow. Second operand 6 states and 262 transitions. [2025-03-09 01:21:23,747 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 75 places, 104 transitions, 580 flow [2025-03-09 01:21:23,749 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 73 places, 104 transitions, 572 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-09 01:21:23,750 INFO L231 Difference]: Finished difference. Result has 75 places, 79 transitions, 355 flow [2025-03-09 01:21:23,750 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=66, PETRI_DIFFERENCE_MINUEND_FLOW=313, PETRI_DIFFERENCE_MINUEND_PLACES=68, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=77, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=66, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=355, PETRI_PLACES=75, PETRI_TRANSITIONS=79} [2025-03-09 01:21:23,753 INFO L279 CegarLoopForPetriNet]: 62 programPoint places, 13 predicate places. [2025-03-09 01:21:23,753 INFO L471 AbstractCegarLoop]: Abstraction has has 75 places, 79 transitions, 355 flow [2025-03-09 01:21:23,754 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 34.8) internal successors, (174), 5 states have internal predecessors, (174), 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-09 01:21:23,754 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 01:21:23,754 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 01:21:23,754 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-09 01:21:23,754 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting thread1Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 37 more)] === [2025-03-09 01:21:23,754 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:21:23,754 INFO L85 PathProgramCache]: Analyzing trace with hash 560844426, now seen corresponding path program 1 times [2025-03-09 01:21:23,754 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:21:23,754 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1266482865] [2025-03-09 01:21:23,754 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:21:23,754 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:21:23,759 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-03-09 01:21:23,765 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-03-09 01:21:23,766 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:21:23,766 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:21:23,858 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-09 01:21:23,858 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:21:23,858 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1266482865] [2025-03-09 01:21:23,858 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1266482865] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 01:21:23,858 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 01:21:23,859 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-09 01:21:23,859 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1475635236] [2025-03-09 01:21:23,859 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 01:21:23,859 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-09 01:21:23,859 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:21:23,859 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-09 01:21:23,859 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-09 01:21:23,915 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 25 out of 66 [2025-03-09 01:21:23,916 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 75 places, 79 transitions, 355 flow. Second operand has 5 states, 5 states have (on average 27.2) internal successors, (136), 5 states have internal predecessors, (136), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:21:23,916 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 01:21:23,916 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 25 of 66 [2025-03-09 01:21:23,916 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 01:21:24,043 INFO L124 PetriNetUnfolderBase]: 610/1319 cut-off events. [2025-03-09 01:21:24,043 INFO L125 PetriNetUnfolderBase]: For 855/869 co-relation queries the response was YES. [2025-03-09 01:21:24,046 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2969 conditions, 1319 events. 610/1319 cut-off events. For 855/869 co-relation queries the response was YES. Maximal size of possible extension queue 74. Compared 7648 event pairs, 402 based on Foata normal form. 0/1197 useless extension candidates. Maximal degree in co-relation 1958. Up to 982 conditions per place. [2025-03-09 01:21:24,050 INFO L140 encePairwiseOnDemand]: 59/66 looper letters, 51 selfloop transitions, 8 changer transitions 0/75 dead transitions. [2025-03-09 01:21:24,050 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 75 places, 75 transitions, 465 flow [2025-03-09 01:21:24,051 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-09 01:21:24,051 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-03-09 01:21:24,051 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 162 transitions. [2025-03-09 01:21:24,051 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4909090909090909 [2025-03-09 01:21:24,051 INFO L175 Difference]: Start difference. First operand has 75 places, 79 transitions, 355 flow. Second operand 5 states and 162 transitions. [2025-03-09 01:21:24,051 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 75 places, 75 transitions, 465 flow [2025-03-09 01:21:24,054 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 72 places, 75 transitions, 453 flow, removed 0 selfloop flow, removed 3 redundant places. [2025-03-09 01:21:24,056 INFO L231 Difference]: Finished difference. Result has 72 places, 75 transitions, 351 flow [2025-03-09 01:21:24,056 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=66, PETRI_DIFFERENCE_MINUEND_FLOW=335, PETRI_DIFFERENCE_MINUEND_PLACES=68, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=75, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=67, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=351, PETRI_PLACES=72, PETRI_TRANSITIONS=75} [2025-03-09 01:21:24,058 INFO L279 CegarLoopForPetriNet]: 62 programPoint places, 10 predicate places. [2025-03-09 01:21:24,058 INFO L471 AbstractCegarLoop]: Abstraction has has 72 places, 75 transitions, 351 flow [2025-03-09 01:21:24,058 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 27.2) internal successors, (136), 5 states have internal predecessors, (136), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:21:24,058 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 01:21:24,058 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 01:21:24,058 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-09 01:21:24,059 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting thread1Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 37 more)] === [2025-03-09 01:21:24,059 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:21:24,059 INFO L85 PathProgramCache]: Analyzing trace with hash 560844427, now seen corresponding path program 1 times [2025-03-09 01:21:24,059 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:21:24,059 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [67261696] [2025-03-09 01:21:24,059 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:21:24,059 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:21:24,065 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-03-09 01:21:24,074 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-03-09 01:21:24,074 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:21:24,074 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:21:24,217 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-09 01:21:24,218 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:21:24,218 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [67261696] [2025-03-09 01:21:24,218 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [67261696] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 01:21:24,218 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1447389876] [2025-03-09 01:21:24,218 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:21:24,218 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 01:21:24,218 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 01:21:24,220 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-09 01:21:24,222 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-09 01:21:24,261 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-03-09 01:21:24,276 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-03-09 01:21:24,276 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:21:24,276 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:21:24,277 INFO L256 TraceCheckSpWp]: Trace formula consists of 145 conjuncts, 16 conjuncts are in the unsatisfiable core [2025-03-09 01:21:24,279 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 01:21:24,285 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2025-03-09 01:21:24,331 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-09 01:21:24,332 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2025-03-09 01:21:24,344 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-03-09 01:21:24,345 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2025-03-09 01:21:24,372 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-09 01:21:24,373 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 01:21:24,478 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 48 [2025-03-09 01:21:24,523 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-09 01:21:24,523 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1447389876] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-09 01:21:24,523 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-09 01:21:24,523 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 9 [2025-03-09 01:21:24,523 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1467769369] [2025-03-09 01:21:24,523 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-09 01:21:24,524 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-09 01:21:24,524 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:21:24,524 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-09 01:21:24,524 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2025-03-09 01:21:28,711 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 [1] [2025-03-09 01:21:32,729 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 [1] [2025-03-09 01:21:36,997 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 [1] [2025-03-09 01:21:37,022 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 25 out of 66 [2025-03-09 01:21:37,023 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 72 places, 75 transitions, 351 flow. Second operand has 11 states, 11 states have (on average 26.90909090909091) internal successors, (296), 11 states have internal predecessors, (296), 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-09 01:21:37,023 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 01:21:37,023 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 25 of 66 [2025-03-09 01:21:37,023 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 01:21:37,443 INFO L124 PetriNetUnfolderBase]: 829/1674 cut-off events. [2025-03-09 01:21:37,443 INFO L125 PetriNetUnfolderBase]: For 982/1010 co-relation queries the response was YES. [2025-03-09 01:21:37,446 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3808 conditions, 1674 events. 829/1674 cut-off events. For 982/1010 co-relation queries the response was YES. Maximal size of possible extension queue 71. Compared 9402 event pairs, 338 based on Foata normal form. 0/1500 useless extension candidates. Maximal degree in co-relation 2364. Up to 543 conditions per place. [2025-03-09 01:21:37,452 INFO L140 encePairwiseOnDemand]: 55/66 looper letters, 87 selfloop transitions, 20 changer transitions 0/121 dead transitions. [2025-03-09 01:21:37,452 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 79 places, 121 transitions, 691 flow [2025-03-09 01:21:37,452 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-09 01:21:37,452 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2025-03-09 01:21:37,454 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 322 transitions. [2025-03-09 01:21:37,455 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5420875420875421 [2025-03-09 01:21:37,455 INFO L175 Difference]: Start difference. First operand has 72 places, 75 transitions, 351 flow. Second operand 9 states and 322 transitions. [2025-03-09 01:21:37,455 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 79 places, 121 transitions, 691 flow [2025-03-09 01:21:37,458 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 76 places, 121 transitions, 677 flow, removed 0 selfloop flow, removed 3 redundant places. [2025-03-09 01:21:37,459 INFO L231 Difference]: Finished difference. Result has 78 places, 80 transitions, 427 flow [2025-03-09 01:21:37,459 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=66, PETRI_DIFFERENCE_MINUEND_FLOW=337, PETRI_DIFFERENCE_MINUEND_PLACES=68, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=74, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=58, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=427, PETRI_PLACES=78, PETRI_TRANSITIONS=80} [2025-03-09 01:21:37,460 INFO L279 CegarLoopForPetriNet]: 62 programPoint places, 16 predicate places. [2025-03-09 01:21:37,460 INFO L471 AbstractCegarLoop]: Abstraction has has 78 places, 80 transitions, 427 flow [2025-03-09 01:21:37,460 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 26.90909090909091) internal successors, (296), 11 states have internal predecessors, (296), 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-09 01:21:37,460 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 01:21:37,460 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 01:21:37,468 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-09 01:21:37,660 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2025-03-09 01:21:37,661 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting thread2Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 37 more)] === [2025-03-09 01:21:37,661 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:21:37,662 INFO L85 PathProgramCache]: Analyzing trace with hash -1765859480, now seen corresponding path program 1 times [2025-03-09 01:21:37,662 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:21:37,662 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [756035466] [2025-03-09 01:21:37,662 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:21:37,662 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:21:37,668 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-03-09 01:21:37,675 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-03-09 01:21:37,675 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:21:37,675 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:21:37,720 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-09 01:21:37,720 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:21:37,720 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [756035466] [2025-03-09 01:21:37,720 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [756035466] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 01:21:37,720 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 01:21:37,720 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-09 01:21:37,720 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [402451367] [2025-03-09 01:21:37,720 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 01:21:37,721 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-09 01:21:37,721 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:21:37,721 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-09 01:21:37,721 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-09 01:21:37,749 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 33 out of 66 [2025-03-09 01:21:37,749 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 78 places, 80 transitions, 427 flow. Second operand has 5 states, 5 states have (on average 35.2) internal successors, (176), 5 states have internal predecessors, (176), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:21:37,749 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 01:21:37,750 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 33 of 66 [2025-03-09 01:21:37,750 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 01:21:37,907 INFO L124 PetriNetUnfolderBase]: 613/1321 cut-off events. [2025-03-09 01:21:37,908 INFO L125 PetriNetUnfolderBase]: For 1649/1683 co-relation queries the response was YES. [2025-03-09 01:21:37,910 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3281 conditions, 1321 events. 613/1321 cut-off events. For 1649/1683 co-relation queries the response was YES. Maximal size of possible extension queue 57. Compared 7269 event pairs, 365 based on Foata normal form. 15/1208 useless extension candidates. Maximal degree in co-relation 2299. Up to 678 conditions per place. [2025-03-09 01:21:37,914 INFO L140 encePairwiseOnDemand]: 60/66 looper letters, 77 selfloop transitions, 11 changer transitions 0/106 dead transitions. [2025-03-09 01:21:37,915 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 82 places, 106 transitions, 708 flow [2025-03-09 01:21:37,915 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-09 01:21:37,915 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-03-09 01:21:37,916 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 224 transitions. [2025-03-09 01:21:37,916 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6787878787878788 [2025-03-09 01:21:37,916 INFO L175 Difference]: Start difference. First operand has 78 places, 80 transitions, 427 flow. Second operand 5 states and 224 transitions. [2025-03-09 01:21:37,916 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 82 places, 106 transitions, 708 flow [2025-03-09 01:21:37,919 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 81 places, 106 transitions, 690 flow, removed 7 selfloop flow, removed 1 redundant places. [2025-03-09 01:21:37,920 INFO L231 Difference]: Finished difference. Result has 83 places, 84 transitions, 473 flow [2025-03-09 01:21:37,920 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=66, PETRI_DIFFERENCE_MINUEND_FLOW=411, PETRI_DIFFERENCE_MINUEND_PLACES=77, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=80, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=69, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=473, PETRI_PLACES=83, PETRI_TRANSITIONS=84} [2025-03-09 01:21:37,920 INFO L279 CegarLoopForPetriNet]: 62 programPoint places, 21 predicate places. [2025-03-09 01:21:37,920 INFO L471 AbstractCegarLoop]: Abstraction has has 83 places, 84 transitions, 473 flow [2025-03-09 01:21:37,921 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 35.2) internal successors, (176), 5 states have internal predecessors, (176), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:21:37,921 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 01:21:37,921 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 01:21:37,921 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-09 01:21:37,921 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting thread1Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 37 more)] === [2025-03-09 01:21:37,921 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:21:37,921 INFO L85 PathProgramCache]: Analyzing trace with hash 206308500, now seen corresponding path program 1 times [2025-03-09 01:21:37,921 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:21:37,922 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [283780181] [2025-03-09 01:21:37,922 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:21:37,922 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:21:37,927 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-03-09 01:21:37,931 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-03-09 01:21:37,932 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:21:37,932 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:21:38,047 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-09 01:21:38,047 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:21:38,047 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [283780181] [2025-03-09 01:21:38,047 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [283780181] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 01:21:38,047 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [264640534] [2025-03-09 01:21:38,047 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:21:38,047 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 01:21:38,047 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 01:21:38,049 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-09 01:21:38,051 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-09 01:21:38,089 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-03-09 01:21:38,105 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-03-09 01:21:38,105 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:21:38,105 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:21:38,108 INFO L256 TraceCheckSpWp]: Trace formula consists of 151 conjuncts, 14 conjuncts are in the unsatisfiable core [2025-03-09 01:21:38,109 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 01:21:38,173 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-09 01:21:38,173 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 01:21:38,208 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 22 treesize of output 18 [2025-03-09 01:21:38,218 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-09 01:21:38,219 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [264640534] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-09 01:21:38,219 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-09 01:21:38,219 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 10 [2025-03-09 01:21:38,219 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2126000400] [2025-03-09 01:21:38,219 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-09 01:21:38,219 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-09 01:21:38,219 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:21:38,220 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-09 01:21:38,220 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=82, Unknown=0, NotChecked=0, Total=110 [2025-03-09 01:21:38,474 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 31 out of 66 [2025-03-09 01:21:38,475 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 83 places, 84 transitions, 473 flow. Second operand has 11 states, 11 states have (on average 32.90909090909091) internal successors, (362), 11 states have internal predecessors, (362), 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-09 01:21:38,475 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 01:21:38,475 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 31 of 66 [2025-03-09 01:21:38,475 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 01:21:38,749 INFO L124 PetriNetUnfolderBase]: 659/1328 cut-off events. [2025-03-09 01:21:38,749 INFO L125 PetriNetUnfolderBase]: For 1720/1762 co-relation queries the response was YES. [2025-03-09 01:21:38,751 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3472 conditions, 1328 events. 659/1328 cut-off events. For 1720/1762 co-relation queries the response was YES. Maximal size of possible extension queue 63. Compared 7001 event pairs, 297 based on Foata normal form. 2/1245 useless extension candidates. Maximal degree in co-relation 2407. Up to 431 conditions per place. [2025-03-09 01:21:38,755 INFO L140 encePairwiseOnDemand]: 55/66 looper letters, 87 selfloop transitions, 20 changer transitions 0/123 dead transitions. [2025-03-09 01:21:38,756 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 88 places, 123 transitions, 799 flow [2025-03-09 01:21:38,756 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-09 01:21:38,756 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-03-09 01:21:38,757 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 303 transitions. [2025-03-09 01:21:38,757 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6558441558441559 [2025-03-09 01:21:38,757 INFO L175 Difference]: Start difference. First operand has 83 places, 84 transitions, 473 flow. Second operand 7 states and 303 transitions. [2025-03-09 01:21:38,757 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 88 places, 123 transitions, 799 flow [2025-03-09 01:21:38,760 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 86 places, 123 transitions, 787 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-09 01:21:38,762 INFO L231 Difference]: Finished difference. Result has 88 places, 84 transitions, 522 flow [2025-03-09 01:21:38,762 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=66, PETRI_DIFFERENCE_MINUEND_FLOW=459, PETRI_DIFFERENCE_MINUEND_PLACES=80, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=83, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=19, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=63, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=522, PETRI_PLACES=88, PETRI_TRANSITIONS=84} [2025-03-09 01:21:38,762 INFO L279 CegarLoopForPetriNet]: 62 programPoint places, 26 predicate places. [2025-03-09 01:21:38,762 INFO L471 AbstractCegarLoop]: Abstraction has has 88 places, 84 transitions, 522 flow [2025-03-09 01:21:38,762 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 32.90909090909091) internal successors, (362), 11 states have internal predecessors, (362), 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-09 01:21:38,762 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 01:21:38,762 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 01:21:38,768 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-03-09 01:21:38,966 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 01:21:38,967 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting thread2Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 37 more)] === [2025-03-09 01:21:38,970 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:21:38,970 INFO L85 PathProgramCache]: Analyzing trace with hash 650267434, now seen corresponding path program 1 times [2025-03-09 01:21:38,970 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:21:38,970 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [217186795] [2025-03-09 01:21:38,970 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:21:38,970 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:21:38,978 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-03-09 01:21:38,987 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-03-09 01:21:38,987 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:21:38,987 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:21:39,130 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-09 01:21:39,130 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:21:39,130 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [217186795] [2025-03-09 01:21:39,130 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [217186795] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 01:21:39,130 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1810675188] [2025-03-09 01:21:39,130 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:21:39,130 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 01:21:39,130 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 01:21:39,132 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-09 01:21:39,134 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-09 01:21:39,172 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-03-09 01:21:39,185 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-03-09 01:21:39,185 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:21:39,185 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:21:39,186 INFO L256 TraceCheckSpWp]: Trace formula consists of 161 conjuncts, 14 conjuncts are in the unsatisfiable core [2025-03-09 01:21:39,187 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 01:21:39,244 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-09 01:21:39,245 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 01:21:39,285 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 22 treesize of output 18 [2025-03-09 01:21:39,293 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-09 01:21:39,293 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1810675188] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-09 01:21:39,293 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-09 01:21:39,293 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 10 [2025-03-09 01:21:39,294 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1848376057] [2025-03-09 01:21:39,294 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-09 01:21:39,295 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-09 01:21:39,295 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:21:39,295 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-09 01:21:39,295 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=82, Unknown=0, NotChecked=0, Total=110 [2025-03-09 01:21:39,548 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 30 out of 66 [2025-03-09 01:21:39,550 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 88 places, 84 transitions, 522 flow. Second operand has 11 states, 11 states have (on average 32.27272727272727) internal successors, (355), 11 states have internal predecessors, (355), 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-09 01:21:39,550 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 01:21:39,550 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 30 of 66 [2025-03-09 01:21:39,550 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 01:21:39,945 INFO L124 PetriNetUnfolderBase]: 928/1800 cut-off events. [2025-03-09 01:21:39,945 INFO L125 PetriNetUnfolderBase]: For 4472/4686 co-relation queries the response was YES. [2025-03-09 01:21:39,949 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5082 conditions, 1800 events. 928/1800 cut-off events. For 4472/4686 co-relation queries the response was YES. Maximal size of possible extension queue 71. Compared 9670 event pairs, 355 based on Foata normal form. 18/1700 useless extension candidates. Maximal degree in co-relation 3945. Up to 592 conditions per place. [2025-03-09 01:21:39,957 INFO L140 encePairwiseOnDemand]: 55/66 looper letters, 96 selfloop transitions, 20 changer transitions 0/131 dead transitions. [2025-03-09 01:21:39,957 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 93 places, 131 transitions, 978 flow [2025-03-09 01:21:39,958 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-09 01:21:39,958 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-03-09 01:21:39,958 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 296 transitions. [2025-03-09 01:21:39,959 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6406926406926406 [2025-03-09 01:21:39,959 INFO L175 Difference]: Start difference. First operand has 88 places, 84 transitions, 522 flow. Second operand 7 states and 296 transitions. [2025-03-09 01:21:39,959 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 93 places, 131 transitions, 978 flow [2025-03-09 01:21:39,964 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 88 places, 131 transitions, 935 flow, removed 5 selfloop flow, removed 5 redundant places. [2025-03-09 01:21:39,965 INFO L231 Difference]: Finished difference. Result has 90 places, 87 transitions, 566 flow [2025-03-09 01:21:39,965 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=66, PETRI_DIFFERENCE_MINUEND_FLOW=487, PETRI_DIFFERENCE_MINUEND_PLACES=82, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=83, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=65, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=566, PETRI_PLACES=90, PETRI_TRANSITIONS=87} [2025-03-09 01:21:39,966 INFO L279 CegarLoopForPetriNet]: 62 programPoint places, 28 predicate places. [2025-03-09 01:21:39,966 INFO L471 AbstractCegarLoop]: Abstraction has has 90 places, 87 transitions, 566 flow [2025-03-09 01:21:39,966 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 32.27272727272727) internal successors, (355), 11 states have internal predecessors, (355), 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-09 01:21:39,966 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 01:21:39,966 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 01:21:39,972 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2025-03-09 01:21:40,166 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 01:21:40,167 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting thread2Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 37 more)] === [2025-03-09 01:21:40,167 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:21:40,167 INFO L85 PathProgramCache]: Analyzing trace with hash -1316545558, now seen corresponding path program 1 times [2025-03-09 01:21:40,167 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:21:40,167 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1619724931] [2025-03-09 01:21:40,167 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:21:40,167 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:21:40,172 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-03-09 01:21:40,179 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-03-09 01:21:40,179 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:21:40,179 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:21:40,320 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-09 01:21:40,320 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:21:40,320 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1619724931] [2025-03-09 01:21:40,320 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1619724931] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 01:21:40,320 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [367505771] [2025-03-09 01:21:40,320 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:21:40,320 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 01:21:40,321 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 01:21:40,322 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-09 01:21:40,324 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-09 01:21:40,361 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-03-09 01:21:40,375 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-03-09 01:21:40,376 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:21:40,376 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:21:40,379 INFO L256 TraceCheckSpWp]: Trace formula consists of 167 conjuncts, 16 conjuncts are in the unsatisfiable core [2025-03-09 01:21:40,380 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 01:21:40,384 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2025-03-09 01:21:40,416 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-09 01:21:40,417 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2025-03-09 01:21:40,424 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-03-09 01:21:40,424 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2025-03-09 01:21:40,455 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-09 01:21:40,455 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 01:21:40,542 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 48 [2025-03-09 01:21:40,595 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-09 01:21:40,596 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [367505771] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-09 01:21:40,596 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-09 01:21:40,596 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 9 [2025-03-09 01:21:40,596 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1570250275] [2025-03-09 01:21:40,596 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-09 01:21:40,596 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-09 01:21:40,596 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:21:40,597 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-09 01:21:40,597 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2025-03-09 01:21:41,068 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 29 out of 66 [2025-03-09 01:21:41,069 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 90 places, 87 transitions, 566 flow. Second operand has 11 states, 11 states have (on average 31.09090909090909) internal successors, (342), 11 states have internal predecessors, (342), 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-09 01:21:41,069 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 01:21:41,069 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 29 of 66 [2025-03-09 01:21:41,069 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 01:21:41,502 INFO L124 PetriNetUnfolderBase]: 850/1655 cut-off events. [2025-03-09 01:21:41,502 INFO L125 PetriNetUnfolderBase]: For 4198/4376 co-relation queries the response was YES. [2025-03-09 01:21:41,506 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4946 conditions, 1655 events. 850/1655 cut-off events. For 4198/4376 co-relation queries the response was YES. Maximal size of possible extension queue 65. Compared 8674 event pairs, 353 based on Foata normal form. 16/1635 useless extension candidates. Maximal degree in co-relation 3781. Up to 591 conditions per place. [2025-03-09 01:21:41,511 INFO L140 encePairwiseOnDemand]: 55/66 looper letters, 95 selfloop transitions, 20 changer transitions 0/131 dead transitions. [2025-03-09 01:21:41,512 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 97 places, 131 transitions, 996 flow [2025-03-09 01:21:41,513 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-09 01:21:41,513 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2025-03-09 01:21:41,513 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 351 transitions. [2025-03-09 01:21:41,514 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5909090909090909 [2025-03-09 01:21:41,514 INFO L175 Difference]: Start difference. First operand has 90 places, 87 transitions, 566 flow. Second operand 9 states and 351 transitions. [2025-03-09 01:21:41,514 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 97 places, 131 transitions, 996 flow [2025-03-09 01:21:41,519 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 93 places, 131 transitions, 962 flow, removed 4 selfloop flow, removed 4 redundant places. [2025-03-09 01:21:41,520 INFO L231 Difference]: Finished difference. Result has 95 places, 87 transitions, 592 flow [2025-03-09 01:21:41,521 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=66, PETRI_DIFFERENCE_MINUEND_FLOW=530, PETRI_DIFFERENCE_MINUEND_PLACES=85, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=86, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=19, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=66, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=592, PETRI_PLACES=95, PETRI_TRANSITIONS=87} [2025-03-09 01:21:41,522 INFO L279 CegarLoopForPetriNet]: 62 programPoint places, 33 predicate places. [2025-03-09 01:21:41,522 INFO L471 AbstractCegarLoop]: Abstraction has has 95 places, 87 transitions, 592 flow [2025-03-09 01:21:41,522 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 31.09090909090909) internal successors, (342), 11 states have internal predecessors, (342), 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-09 01:21:41,522 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 01:21:41,522 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 01:21:41,528 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-09 01:21:41,727 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2025-03-09 01:21:41,727 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting thread1Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 37 more)] === [2025-03-09 01:21:41,727 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:21:41,728 INFO L85 PathProgramCache]: Analyzing trace with hash 38770449, now seen corresponding path program 1 times [2025-03-09 01:21:41,728 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:21:41,728 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2012136041] [2025-03-09 01:21:41,728 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:21:41,728 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:21:41,733 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-03-09 01:21:41,739 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-03-09 01:21:41,739 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:21:41,739 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:21:41,809 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-09 01:21:41,809 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:21:41,809 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2012136041] [2025-03-09 01:21:41,809 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2012136041] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 01:21:41,809 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1066007553] [2025-03-09 01:21:41,809 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:21:41,809 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 01:21:41,809 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 01:21:41,812 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-09 01:21:41,813 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-09 01:21:41,857 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-03-09 01:21:41,873 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-03-09 01:21:41,873 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:21:41,873 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:21:41,874 INFO L256 TraceCheckSpWp]: Trace formula consists of 163 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-03-09 01:21:41,875 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 01:21:41,940 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-09 01:21:41,940 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 01:21:42,002 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-09 01:21:42,002 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1066007553] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-09 01:21:42,002 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-09 01:21:42,002 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6, 6] total 16 [2025-03-09 01:21:42,002 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [460920911] [2025-03-09 01:21:42,002 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-09 01:21:42,003 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2025-03-09 01:21:42,003 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:21:42,003 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2025-03-09 01:21:42,003 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=191, Unknown=0, NotChecked=0, Total=240 [2025-03-09 01:21:42,258 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 33 out of 66 [2025-03-09 01:21:42,259 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 95 places, 87 transitions, 592 flow. Second operand has 16 states, 16 states have (on average 35.125) internal successors, (562), 16 states have internal predecessors, (562), 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-09 01:21:42,259 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 01:21:42,259 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 33 of 66 [2025-03-09 01:21:42,259 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 01:21:42,835 INFO L124 PetriNetUnfolderBase]: 2100/4322 cut-off events. [2025-03-09 01:21:42,835 INFO L125 PetriNetUnfolderBase]: For 12824/13052 co-relation queries the response was YES. [2025-03-09 01:21:42,844 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13256 conditions, 4322 events. 2100/4322 cut-off events. For 12824/13052 co-relation queries the response was YES. Maximal size of possible extension queue 169. Compared 29913 event pairs, 877 based on Foata normal form. 78/4340 useless extension candidates. Maximal degree in co-relation 6724. Up to 789 conditions per place. [2025-03-09 01:21:42,855 INFO L140 encePairwiseOnDemand]: 55/66 looper letters, 218 selfloop transitions, 47 changer transitions 0/283 dead transitions. [2025-03-09 01:21:42,856 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 115 places, 283 transitions, 2302 flow [2025-03-09 01:21:42,857 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2025-03-09 01:21:42,857 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2025-03-09 01:21:42,858 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 891 transitions. [2025-03-09 01:21:42,858 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6428571428571429 [2025-03-09 01:21:42,859 INFO L175 Difference]: Start difference. First operand has 95 places, 87 transitions, 592 flow. Second operand 21 states and 891 transitions. [2025-03-09 01:21:42,859 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 115 places, 283 transitions, 2302 flow [2025-03-09 01:21:42,870 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 108 places, 283 transitions, 2209 flow, removed 14 selfloop flow, removed 7 redundant places. [2025-03-09 01:21:42,872 INFO L231 Difference]: Finished difference. Result has 114 places, 112 transitions, 927 flow [2025-03-09 01:21:42,873 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=66, PETRI_DIFFERENCE_MINUEND_FLOW=554, PETRI_DIFFERENCE_MINUEND_PLACES=88, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=87, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=27, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=57, PETRI_DIFFERENCE_SUBTRAHEND_STATES=21, PETRI_FLOW=927, PETRI_PLACES=114, PETRI_TRANSITIONS=112} [2025-03-09 01:21:42,873 INFO L279 CegarLoopForPetriNet]: 62 programPoint places, 52 predicate places. [2025-03-09 01:21:42,873 INFO L471 AbstractCegarLoop]: Abstraction has has 114 places, 112 transitions, 927 flow [2025-03-09 01:21:42,874 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 35.125) internal successors, (562), 16 states have internal predecessors, (562), 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-09 01:21:42,874 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 01:21:42,874 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 01:21:42,880 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2025-03-09 01:21:43,074 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2025-03-09 01:21:43,074 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 37 more)] === [2025-03-09 01:21:43,075 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:21:43,075 INFO L85 PathProgramCache]: Analyzing trace with hash -78544790, now seen corresponding path program 1 times [2025-03-09 01:21:43,075 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:21:43,075 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1105641848] [2025-03-09 01:21:43,075 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:21:43,075 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:21:43,079 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-03-09 01:21:43,083 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-03-09 01:21:43,083 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:21:43,083 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:21:43,149 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-09 01:21:43,149 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:21:43,149 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1105641848] [2025-03-09 01:21:43,149 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1105641848] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 01:21:43,149 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 01:21:43,149 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-09 01:21:43,149 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1846219363] [2025-03-09 01:21:43,149 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 01:21:43,149 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-09 01:21:43,149 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:21:43,150 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-09 01:21:43,150 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-09 01:21:43,150 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 34 out of 66 [2025-03-09 01:21:43,150 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 114 places, 112 transitions, 927 flow. Second operand has 4 states, 4 states have (on average 38.0) internal successors, (152), 4 states have internal predecessors, (152), 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-09 01:21:43,150 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 01:21:43,150 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 34 of 66 [2025-03-09 01:21:43,150 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 01:21:43,483 INFO L124 PetriNetUnfolderBase]: 2352/4909 cut-off events. [2025-03-09 01:21:43,483 INFO L125 PetriNetUnfolderBase]: For 17560/18096 co-relation queries the response was YES. [2025-03-09 01:21:43,496 INFO L83 FinitePrefix]: Finished finitePrefix Result has 15412 conditions, 4909 events. 2352/4909 cut-off events. For 17560/18096 co-relation queries the response was YES. Maximal size of possible extension queue 215. Compared 37032 event pairs, 1182 based on Foata normal form. 72/4839 useless extension candidates. Maximal degree in co-relation 15363. Up to 2858 conditions per place. [2025-03-09 01:21:43,509 INFO L140 encePairwiseOnDemand]: 62/66 looper letters, 108 selfloop transitions, 1 changer transitions 9/137 dead transitions. [2025-03-09 01:21:43,509 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 117 places, 137 transitions, 1278 flow [2025-03-09 01:21:43,510 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-09 01:21:43,510 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-09 01:21:43,511 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 187 transitions. [2025-03-09 01:21:43,511 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7083333333333334 [2025-03-09 01:21:43,511 INFO L175 Difference]: Start difference. First operand has 114 places, 112 transitions, 927 flow. Second operand 4 states and 187 transitions. [2025-03-09 01:21:43,511 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 117 places, 137 transitions, 1278 flow [2025-03-09 01:21:43,525 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 115 places, 137 transitions, 1240 flow, removed 13 selfloop flow, removed 2 redundant places. [2025-03-09 01:21:43,526 INFO L231 Difference]: Finished difference. Result has 117 places, 112 transitions, 904 flow [2025-03-09 01:21:43,527 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=66, PETRI_DIFFERENCE_MINUEND_FLOW=889, PETRI_DIFFERENCE_MINUEND_PLACES=112, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=112, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=111, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=904, PETRI_PLACES=117, PETRI_TRANSITIONS=112} [2025-03-09 01:21:43,527 INFO L279 CegarLoopForPetriNet]: 62 programPoint places, 55 predicate places. [2025-03-09 01:21:43,527 INFO L471 AbstractCegarLoop]: Abstraction has has 117 places, 112 transitions, 904 flow [2025-03-09 01:21:43,527 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 38.0) internal successors, (152), 4 states have internal predecessors, (152), 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-09 01:21:43,527 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 01:21:43,527 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 01:21:43,527 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-03-09 01:21:43,527 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 37 more)] === [2025-03-09 01:21:43,528 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:21:43,528 INFO L85 PathProgramCache]: Analyzing trace with hash -1724930524, now seen corresponding path program 2 times [2025-03-09 01:21:43,528 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:21:43,528 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1358685953] [2025-03-09 01:21:43,528 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-09 01:21:43,528 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:21:43,535 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 17 statements into 1 equivalence classes. [2025-03-09 01:21:43,539 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-03-09 01:21:43,539 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-09 01:21:43,540 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:21:43,623 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-09 01:21:43,624 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:21:43,624 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1358685953] [2025-03-09 01:21:43,624 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1358685953] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 01:21:43,624 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 01:21:43,624 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-09 01:21:43,624 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1167022060] [2025-03-09 01:21:43,624 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 01:21:43,624 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-09 01:21:43,624 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:21:43,624 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-09 01:21:43,625 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-09 01:21:43,625 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 34 out of 66 [2025-03-09 01:21:43,625 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 117 places, 112 transitions, 904 flow. Second operand has 4 states, 4 states have (on average 38.0) internal successors, (152), 4 states have internal predecessors, (152), 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-09 01:21:43,625 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 01:21:43,625 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 34 of 66 [2025-03-09 01:21:43,625 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 01:21:44,051 INFO L124 PetriNetUnfolderBase]: 2564/5378 cut-off events. [2025-03-09 01:21:44,052 INFO L125 PetriNetUnfolderBase]: For 19875/20479 co-relation queries the response was YES. [2025-03-09 01:21:44,069 INFO L83 FinitePrefix]: Finished finitePrefix Result has 17107 conditions, 5378 events. 2564/5378 cut-off events. For 19875/20479 co-relation queries the response was YES. Maximal size of possible extension queue 275. Compared 42145 event pairs, 1583 based on Foata normal form. 63/5209 useless extension candidates. Maximal degree in co-relation 17057. Up to 3605 conditions per place. [2025-03-09 01:21:44,084 INFO L140 encePairwiseOnDemand]: 62/66 looper letters, 119 selfloop transitions, 1 changer transitions 7/146 dead transitions. [2025-03-09 01:21:44,084 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 119 places, 146 transitions, 1416 flow [2025-03-09 01:21:44,085 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-09 01:21:44,085 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-09 01:21:44,085 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 185 transitions. [2025-03-09 01:21:44,085 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7007575757575758 [2025-03-09 01:21:44,085 INFO L175 Difference]: Start difference. First operand has 117 places, 112 transitions, 904 flow. Second operand 4 states and 185 transitions. [2025-03-09 01:21:44,085 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 119 places, 146 transitions, 1416 flow [2025-03-09 01:21:44,104 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 117 places, 146 transitions, 1410 flow, removed 2 selfloop flow, removed 2 redundant places. [2025-03-09 01:21:44,144 INFO L231 Difference]: Finished difference. Result has 119 places, 112 transitions, 926 flow [2025-03-09 01:21:44,144 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=66, PETRI_DIFFERENCE_MINUEND_FLOW=901, PETRI_DIFFERENCE_MINUEND_PLACES=114, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=112, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=111, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=926, PETRI_PLACES=119, PETRI_TRANSITIONS=112} [2025-03-09 01:21:44,145 INFO L279 CegarLoopForPetriNet]: 62 programPoint places, 57 predicate places. [2025-03-09 01:21:44,145 INFO L471 AbstractCegarLoop]: Abstraction has has 119 places, 112 transitions, 926 flow [2025-03-09 01:21:44,145 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 38.0) internal successors, (152), 4 states have internal predecessors, (152), 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-09 01:21:44,145 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 01:21:44,145 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 01:21:44,145 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-03-09 01:21:44,145 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting thread2Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 37 more)] === [2025-03-09 01:21:44,145 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:21:44,145 INFO L85 PathProgramCache]: Analyzing trace with hash 433097041, now seen corresponding path program 1 times [2025-03-09 01:21:44,145 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:21:44,146 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1921255741] [2025-03-09 01:21:44,146 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:21:44,146 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:21:44,151 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-03-09 01:21:44,155 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-03-09 01:21:44,155 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:21:44,155 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:21:44,202 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-09 01:21:44,202 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:21:44,203 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1921255741] [2025-03-09 01:21:44,203 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1921255741] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 01:21:44,203 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2120046170] [2025-03-09 01:21:44,203 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:21:44,203 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 01:21:44,203 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 01:21:44,205 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-09 01:21:44,207 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-09 01:21:44,247 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-03-09 01:21:44,262 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-03-09 01:21:44,262 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:21:44,262 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:21:44,263 INFO L256 TraceCheckSpWp]: Trace formula consists of 179 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-03-09 01:21:44,264 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 01:21:44,325 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-09 01:21:44,325 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 01:21:44,387 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-09 01:21:44,387 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2120046170] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-09 01:21:44,387 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-09 01:21:44,387 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 7, 7] total 16 [2025-03-09 01:21:44,387 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1817989799] [2025-03-09 01:21:44,387 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-09 01:21:44,387 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2025-03-09 01:21:44,388 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:21:44,388 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2025-03-09 01:21:44,388 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=191, Unknown=0, NotChecked=0, Total=240 [2025-03-09 01:21:44,603 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 33 out of 66 [2025-03-09 01:21:44,604 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 119 places, 112 transitions, 926 flow. Second operand has 16 states, 16 states have (on average 35.375) internal successors, (566), 16 states have internal predecessors, (566), 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-09 01:21:44,604 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 01:21:44,604 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 33 of 66 [2025-03-09 01:21:44,604 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 01:21:45,349 INFO L124 PetriNetUnfolderBase]: 2351/4807 cut-off events. [2025-03-09 01:21:45,349 INFO L125 PetriNetUnfolderBase]: For 19482/20013 co-relation queries the response was YES. [2025-03-09 01:21:45,363 INFO L83 FinitePrefix]: Finished finitePrefix Result has 16058 conditions, 4807 events. 2351/4807 cut-off events. For 19482/20013 co-relation queries the response was YES. Maximal size of possible extension queue 259. Compared 35942 event pairs, 1427 based on Foata normal form. 86/4789 useless extension candidates. Maximal degree in co-relation 16007. Up to 1031 conditions per place. [2025-03-09 01:21:45,378 INFO L140 encePairwiseOnDemand]: 55/66 looper letters, 186 selfloop transitions, 55 changer transitions 0/259 dead transitions. [2025-03-09 01:21:45,379 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 141 places, 259 transitions, 2298 flow [2025-03-09 01:21:45,379 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2025-03-09 01:21:45,379 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2025-03-09 01:21:45,380 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 984 transitions. [2025-03-09 01:21:45,381 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6212121212121212 [2025-03-09 01:21:45,381 INFO L175 Difference]: Start difference. First operand has 119 places, 112 transitions, 926 flow. Second operand 24 states and 984 transitions. [2025-03-09 01:21:45,381 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 141 places, 259 transitions, 2298 flow [2025-03-09 01:21:45,404 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 139 places, 259 transitions, 2286 flow, removed 4 selfloop flow, removed 2 redundant places. [2025-03-09 01:21:45,406 INFO L231 Difference]: Finished difference. Result has 143 places, 129 transitions, 1254 flow [2025-03-09 01:21:45,406 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=66, PETRI_DIFFERENCE_MINUEND_FLOW=923, PETRI_DIFFERENCE_MINUEND_PLACES=116, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=112, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=42, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=69, PETRI_DIFFERENCE_SUBTRAHEND_STATES=24, PETRI_FLOW=1254, PETRI_PLACES=143, PETRI_TRANSITIONS=129} [2025-03-09 01:21:45,406 INFO L279 CegarLoopForPetriNet]: 62 programPoint places, 81 predicate places. [2025-03-09 01:21:45,406 INFO L471 AbstractCegarLoop]: Abstraction has has 143 places, 129 transitions, 1254 flow [2025-03-09 01:21:45,407 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 35.375) internal successors, (566), 16 states have internal predecessors, (566), 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-09 01:21:45,407 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 01:21:45,407 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-09 01:21:45,415 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-09 01:21:45,607 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 01:21:45,608 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 37 more)] === [2025-03-09 01:21:45,608 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:21:45,608 INFO L85 PathProgramCache]: Analyzing trace with hash -1846448676, now seen corresponding path program 1 times [2025-03-09 01:21:45,608 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:21:45,608 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [963775387] [2025-03-09 01:21:45,608 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:21:45,608 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:21:45,613 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-03-09 01:21:45,618 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-03-09 01:21:45,618 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:21:45,619 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:21:45,632 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-09 01:21:45,632 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:21:45,632 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [963775387] [2025-03-09 01:21:45,632 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [963775387] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 01:21:45,632 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 01:21:45,632 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-09 01:21:45,632 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [507623585] [2025-03-09 01:21:45,632 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 01:21:45,633 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-09 01:21:45,633 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:21:45,633 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-09 01:21:45,634 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-09 01:21:45,634 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 34 out of 66 [2025-03-09 01:21:45,634 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 143 places, 129 transitions, 1254 flow. Second operand has 3 states, 3 states have (on average 39.666666666666664) internal successors, (119), 3 states have internal predecessors, (119), 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-09 01:21:45,634 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 01:21:45,634 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 34 of 66 [2025-03-09 01:21:45,634 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 01:21:45,890 INFO L124 PetriNetUnfolderBase]: 1611/3552 cut-off events. [2025-03-09 01:21:45,890 INFO L125 PetriNetUnfolderBase]: For 18331/18723 co-relation queries the response was YES. [2025-03-09 01:21:45,899 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12505 conditions, 3552 events. 1611/3552 cut-off events. For 18331/18723 co-relation queries the response was YES. Maximal size of possible extension queue 155. Compared 25622 event pairs, 589 based on Foata normal form. 167/3657 useless extension candidates. Maximal degree in co-relation 12446. Up to 2188 conditions per place. [2025-03-09 01:21:45,905 INFO L140 encePairwiseOnDemand]: 62/66 looper letters, 113 selfloop transitions, 18 changer transitions 5/155 dead transitions. [2025-03-09 01:21:45,905 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 145 places, 155 transitions, 1787 flow [2025-03-09 01:21:45,905 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-09 01:21:45,905 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-09 01:21:45,905 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 144 transitions. [2025-03-09 01:21:45,906 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7272727272727273 [2025-03-09 01:21:45,906 INFO L175 Difference]: Start difference. First operand has 143 places, 129 transitions, 1254 flow. Second operand 3 states and 144 transitions. [2025-03-09 01:21:45,906 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 145 places, 155 transitions, 1787 flow [2025-03-09 01:21:45,920 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 131 places, 155 transitions, 1690 flow, removed 12 selfloop flow, removed 14 redundant places. [2025-03-09 01:21:45,921 INFO L231 Difference]: Finished difference. Result has 132 places, 145 transitions, 1478 flow [2025-03-09 01:21:45,921 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=66, PETRI_DIFFERENCE_MINUEND_FLOW=1157, PETRI_DIFFERENCE_MINUEND_PLACES=129, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=129, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=111, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1478, PETRI_PLACES=132, PETRI_TRANSITIONS=145} [2025-03-09 01:21:45,922 INFO L279 CegarLoopForPetriNet]: 62 programPoint places, 70 predicate places. [2025-03-09 01:21:45,922 INFO L471 AbstractCegarLoop]: Abstraction has has 132 places, 145 transitions, 1478 flow [2025-03-09 01:21:45,922 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 39.666666666666664) internal successors, (119), 3 states have internal predecessors, (119), 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-09 01:21:45,922 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 01:21:45,922 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 01:21:45,922 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-03-09 01:21:45,922 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting thread1Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 37 more)] === [2025-03-09 01:21:45,922 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:21:45,923 INFO L85 PathProgramCache]: Analyzing trace with hash 466950628, now seen corresponding path program 2 times [2025-03-09 01:21:45,923 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:21:45,923 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1858725110] [2025-03-09 01:21:45,923 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-09 01:21:45,923 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:21:45,928 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 20 statements into 2 equivalence classes. [2025-03-09 01:21:45,937 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 20 of 20 statements. [2025-03-09 01:21:45,937 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-09 01:21:45,937 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:21:46,105 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-03-09 01:21:46,105 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:21:46,105 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1858725110] [2025-03-09 01:21:46,105 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1858725110] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 01:21:46,105 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2056553702] [2025-03-09 01:21:46,105 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-09 01:21:46,105 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 01:21:46,105 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 01:21:46,107 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-09 01:21:46,109 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-09 01:21:46,150 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 20 statements into 2 equivalence classes. [2025-03-09 01:21:46,168 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 20 of 20 statements. [2025-03-09 01:21:46,168 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-09 01:21:46,168 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:21:46,169 INFO L256 TraceCheckSpWp]: Trace formula consists of 189 conjuncts, 23 conjuncts are in the unsatisfiable core [2025-03-09 01:21:46,172 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 01:21:46,176 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2025-03-09 01:21:46,235 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2025-03-09 01:21:46,236 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 16 treesize of output 15 [2025-03-09 01:21:46,246 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-03-09 01:21:46,247 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2025-03-09 01:21:46,338 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-09 01:21:46,338 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 01:21:46,477 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 48 [2025-03-09 01:21:46,563 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-09 01:21:46,563 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2056553702] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-09 01:21:46,563 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-09 01:21:46,563 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 7, 6] total 19 [2025-03-09 01:21:46,563 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2127144588] [2025-03-09 01:21:46,563 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-09 01:21:46,564 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2025-03-09 01:21:46,564 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:21:46,564 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2025-03-09 01:21:46,564 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=361, Unknown=0, NotChecked=0, Total=420 [2025-03-09 01:21:47,807 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 27 out of 66 [2025-03-09 01:21:47,808 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 132 places, 145 transitions, 1478 flow. Second operand has 21 states, 21 states have (on average 29.428571428571427) internal successors, (618), 21 states have internal predecessors, (618), 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-09 01:21:47,808 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 01:21:47,808 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 27 of 66 [2025-03-09 01:21:47,808 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 01:21:48,896 INFO L124 PetriNetUnfolderBase]: 2227/4322 cut-off events. [2025-03-09 01:21:48,896 INFO L125 PetriNetUnfolderBase]: For 26875/27464 co-relation queries the response was YES. [2025-03-09 01:21:48,909 INFO L83 FinitePrefix]: Finished finitePrefix Result has 16375 conditions, 4322 events. 2227/4322 cut-off events. For 26875/27464 co-relation queries the response was YES. Maximal size of possible extension queue 188. Compared 29022 event pairs, 650 based on Foata normal form. 66/4330 useless extension candidates. Maximal degree in co-relation 12145. Up to 862 conditions per place. [2025-03-09 01:21:48,919 INFO L140 encePairwiseOnDemand]: 56/66 looper letters, 212 selfloop transitions, 65 changer transitions 0/291 dead transitions. [2025-03-09 01:21:48,919 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 148 places, 291 transitions, 3089 flow [2025-03-09 01:21:48,920 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2025-03-09 01:21:48,920 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2025-03-09 01:21:48,920 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 705 transitions. [2025-03-09 01:21:48,921 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5340909090909091 [2025-03-09 01:21:48,921 INFO L175 Difference]: Start difference. First operand has 132 places, 145 transitions, 1478 flow. Second operand 20 states and 705 transitions. [2025-03-09 01:21:48,921 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 148 places, 291 transitions, 3089 flow [2025-03-09 01:21:48,942 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 145 places, 291 transitions, 2959 flow, removed 53 selfloop flow, removed 3 redundant places. [2025-03-09 01:21:48,944 INFO L231 Difference]: Finished difference. Result has 147 places, 151 transitions, 1615 flow [2025-03-09 01:21:48,944 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=66, PETRI_DIFFERENCE_MINUEND_FLOW=1380, PETRI_DIFFERENCE_MINUEND_PLACES=126, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=144, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=58, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=85, PETRI_DIFFERENCE_SUBTRAHEND_STATES=20, PETRI_FLOW=1615, PETRI_PLACES=147, PETRI_TRANSITIONS=151} [2025-03-09 01:21:48,944 INFO L279 CegarLoopForPetriNet]: 62 programPoint places, 85 predicate places. [2025-03-09 01:21:48,945 INFO L471 AbstractCegarLoop]: Abstraction has has 147 places, 151 transitions, 1615 flow [2025-03-09 01:21:48,945 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 21 states have (on average 29.428571428571427) internal successors, (618), 21 states have internal predecessors, (618), 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-09 01:21:48,945 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 01:21:48,945 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 01:21:48,951 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-09 01:21:49,145 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 01:21:49,146 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting thread1Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 37 more)] === [2025-03-09 01:21:49,146 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:21:49,146 INFO L85 PathProgramCache]: Analyzing trace with hash 1590568027, now seen corresponding path program 1 times [2025-03-09 01:21:49,146 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:21:49,146 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1790137586] [2025-03-09 01:21:49,146 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:21:49,146 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:21:49,151 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 21 statements into 1 equivalence classes. [2025-03-09 01:21:49,156 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 21 of 21 statements. [2025-03-09 01:21:49,156 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:21:49,156 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:21:49,299 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-09 01:21:49,299 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:21:49,299 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1790137586] [2025-03-09 01:21:49,299 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1790137586] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 01:21:49,299 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [709048296] [2025-03-09 01:21:49,299 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:21:49,300 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 01:21:49,300 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 01:21:49,302 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-09 01:21:49,303 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-09 01:21:49,344 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 21 statements into 1 equivalence classes. [2025-03-09 01:21:49,359 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 21 of 21 statements. [2025-03-09 01:21:49,360 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:21:49,360 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:21:49,361 INFO L256 TraceCheckSpWp]: Trace formula consists of 195 conjuncts, 17 conjuncts are in the unsatisfiable core [2025-03-09 01:21:49,362 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 01:21:49,463 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-09 01:21:49,463 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 01:21:49,540 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 20 [2025-03-09 01:21:49,569 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-09 01:21:49,569 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [709048296] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-09 01:21:49,569 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-09 01:21:49,569 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 19 [2025-03-09 01:21:49,569 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1174256760] [2025-03-09 01:21:49,569 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-09 01:21:49,569 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2025-03-09 01:21:49,569 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:21:49,570 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2025-03-09 01:21:49,570 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=309, Unknown=0, NotChecked=0, Total=380 [2025-03-09 01:21:50,050 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 31 out of 66 [2025-03-09 01:21:50,050 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 147 places, 151 transitions, 1615 flow. Second operand has 20 states, 20 states have (on average 32.95) internal successors, (659), 20 states have internal predecessors, (659), 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-09 01:21:50,051 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 01:21:50,051 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 31 of 66 [2025-03-09 01:21:50,051 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 01:21:50,613 INFO L124 PetriNetUnfolderBase]: 1873/3830 cut-off events. [2025-03-09 01:21:50,613 INFO L125 PetriNetUnfolderBase]: For 24630/25195 co-relation queries the response was YES. [2025-03-09 01:21:50,627 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14617 conditions, 3830 events. 1873/3830 cut-off events. For 24630/25195 co-relation queries the response was YES. Maximal size of possible extension queue 155. Compared 26010 event pairs, 786 based on Foata normal form. 54/3836 useless extension candidates. Maximal degree in co-relation 10675. Up to 1115 conditions per place. [2025-03-09 01:21:50,637 INFO L140 encePairwiseOnDemand]: 56/66 looper letters, 176 selfloop transitions, 44 changer transitions 0/237 dead transitions. [2025-03-09 01:21:50,638 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 156 places, 237 transitions, 2599 flow [2025-03-09 01:21:50,638 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-09 01:21:50,638 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2025-03-09 01:21:50,638 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 427 transitions. [2025-03-09 01:21:50,639 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.646969696969697 [2025-03-09 01:21:50,639 INFO L175 Difference]: Start difference. First operand has 147 places, 151 transitions, 1615 flow. Second operand 10 states and 427 transitions. [2025-03-09 01:21:50,639 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 156 places, 237 transitions, 2599 flow [2025-03-09 01:21:50,660 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 146 places, 237 transitions, 2524 flow, removed 17 selfloop flow, removed 10 redundant places. [2025-03-09 01:21:50,662 INFO L231 Difference]: Finished difference. Result has 150 places, 154 transitions, 1705 flow [2025-03-09 01:21:50,662 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=66, PETRI_DIFFERENCE_MINUEND_FLOW=1540, PETRI_DIFFERENCE_MINUEND_PLACES=137, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=151, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=41, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=107, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=1705, PETRI_PLACES=150, PETRI_TRANSITIONS=154} [2025-03-09 01:21:50,662 INFO L279 CegarLoopForPetriNet]: 62 programPoint places, 88 predicate places. [2025-03-09 01:21:50,663 INFO L471 AbstractCegarLoop]: Abstraction has has 150 places, 154 transitions, 1705 flow [2025-03-09 01:21:50,663 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 32.95) internal successors, (659), 20 states have internal predecessors, (659), 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-09 01:21:50,663 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 01:21:50,663 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-09 01:21:50,669 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2025-03-09 01:21:50,863 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 01:21:50,863 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 37 more)] === [2025-03-09 01:21:50,864 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:21:50,864 INFO L85 PathProgramCache]: Analyzing trace with hash -1816358911, now seen corresponding path program 1 times [2025-03-09 01:21:50,864 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:21:50,864 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1024362502] [2025-03-09 01:21:50,864 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:21:50,864 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:21:50,868 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 21 statements into 1 equivalence classes. [2025-03-09 01:21:50,872 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 21 of 21 statements. [2025-03-09 01:21:50,873 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:21:50,873 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:21:51,016 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-09 01:21:51,017 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:21:51,017 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1024362502] [2025-03-09 01:21:51,017 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1024362502] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 01:21:51,017 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 01:21:51,017 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-09 01:21:51,017 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [345610372] [2025-03-09 01:21:51,017 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 01:21:51,018 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-09 01:21:51,018 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:21:51,018 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-09 01:21:51,018 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2025-03-09 01:21:51,038 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 34 out of 66 [2025-03-09 01:21:51,038 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 150 places, 154 transitions, 1705 flow. Second operand has 6 states, 6 states have (on average 37.0) internal successors, (222), 6 states have internal predecessors, (222), 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-09 01:21:51,038 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 01:21:51,038 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 34 of 66 [2025-03-09 01:21:51,038 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 01:21:51,338 INFO L124 PetriNetUnfolderBase]: 1718/3484 cut-off events. [2025-03-09 01:21:51,338 INFO L125 PetriNetUnfolderBase]: For 30112/30816 co-relation queries the response was YES. [2025-03-09 01:21:51,350 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14279 conditions, 3484 events. 1718/3484 cut-off events. For 30112/30816 co-relation queries the response was YES. Maximal size of possible extension queue 182. Compared 23893 event pairs, 500 based on Foata normal form. 54/3490 useless extension candidates. Maximal degree in co-relation 11913. Up to 1854 conditions per place. [2025-03-09 01:21:51,359 INFO L140 encePairwiseOnDemand]: 56/66 looper letters, 155 selfloop transitions, 31 changer transitions 17/225 dead transitions. [2025-03-09 01:21:51,359 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 155 places, 225 transitions, 2877 flow [2025-03-09 01:21:51,359 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-09 01:21:51,359 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-09 01:21:51,360 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 268 transitions. [2025-03-09 01:21:51,360 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6767676767676768 [2025-03-09 01:21:51,360 INFO L175 Difference]: Start difference. First operand has 150 places, 154 transitions, 1705 flow. Second operand 6 states and 268 transitions. [2025-03-09 01:21:51,360 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 155 places, 225 transitions, 2877 flow [2025-03-09 01:21:51,380 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 151 places, 225 transitions, 2839 flow, removed 2 selfloop flow, removed 4 redundant places. [2025-03-09 01:21:51,382 INFO L231 Difference]: Finished difference. Result has 153 places, 174 transitions, 2046 flow [2025-03-09 01:21:51,382 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=66, PETRI_DIFFERENCE_MINUEND_FLOW=1668, PETRI_DIFFERENCE_MINUEND_PLACES=146, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=154, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=123, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=2046, PETRI_PLACES=153, PETRI_TRANSITIONS=174} [2025-03-09 01:21:51,383 INFO L279 CegarLoopForPetriNet]: 62 programPoint places, 91 predicate places. [2025-03-09 01:21:51,383 INFO L471 AbstractCegarLoop]: Abstraction has has 153 places, 174 transitions, 2046 flow [2025-03-09 01:21:51,383 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 37.0) internal successors, (222), 6 states have internal predecessors, (222), 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-09 01:21:51,383 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 01:21:51,383 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 01:21:51,383 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2025-03-09 01:21:51,383 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting thread2Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 37 more)] === [2025-03-09 01:21:51,383 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:21:51,383 INFO L85 PathProgramCache]: Analyzing trace with hash -402611356, now seen corresponding path program 2 times [2025-03-09 01:21:51,383 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:21:51,383 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [82055827] [2025-03-09 01:21:51,383 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-09 01:21:51,384 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:21:51,388 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 22 statements into 2 equivalence classes. [2025-03-09 01:21:51,400 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 22 of 22 statements. [2025-03-09 01:21:51,400 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-09 01:21:51,400 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:21:51,535 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2025-03-09 01:21:51,536 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:21:51,536 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [82055827] [2025-03-09 01:21:51,536 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [82055827] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 01:21:51,536 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1132123311] [2025-03-09 01:21:51,536 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-09 01:21:51,536 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 01:21:51,536 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 01:21:51,538 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-09 01:21:51,539 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-09 01:21:51,579 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 22 statements into 2 equivalence classes. [2025-03-09 01:21:51,597 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 22 of 22 statements. [2025-03-09 01:21:51,597 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-09 01:21:51,597 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:21:51,598 INFO L256 TraceCheckSpWp]: Trace formula consists of 205 conjuncts, 17 conjuncts are in the unsatisfiable core [2025-03-09 01:21:51,599 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 01:21:51,696 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-09 01:21:51,696 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 01:21:51,777 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 20 [2025-03-09 01:21:51,813 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-09 01:21:51,814 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1132123311] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-09 01:21:51,814 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-09 01:21:51,814 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 7, 7] total 19 [2025-03-09 01:21:51,814 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1764846157] [2025-03-09 01:21:51,814 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-09 01:21:51,815 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2025-03-09 01:21:51,815 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:21:51,815 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2025-03-09 01:21:51,815 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=325, Unknown=0, NotChecked=0, Total=380 [2025-03-09 01:21:52,667 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 29 out of 66 [2025-03-09 01:21:52,667 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 153 places, 174 transitions, 2046 flow. Second operand has 20 states, 20 states have (on average 31.6) internal successors, (632), 20 states have internal predecessors, (632), 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-09 01:21:52,667 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 01:21:52,667 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 29 of 66 [2025-03-09 01:21:52,667 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 01:21:53,711 INFO L124 PetriNetUnfolderBase]: 2525/4684 cut-off events. [2025-03-09 01:21:53,711 INFO L125 PetriNetUnfolderBase]: For 43919/44969 co-relation queries the response was YES. [2025-03-09 01:21:53,727 INFO L83 FinitePrefix]: Finished finitePrefix Result has 20548 conditions, 4684 events. 2525/4684 cut-off events. For 43919/44969 co-relation queries the response was YES. Maximal size of possible extension queue 201. Compared 31217 event pairs, 560 based on Foata normal form. 162/4798 useless extension candidates. Maximal degree in co-relation 20483. Up to 1004 conditions per place. [2025-03-09 01:21:53,740 INFO L140 encePairwiseOnDemand]: 55/66 looper letters, 265 selfloop transitions, 74 changer transitions 0/356 dead transitions. [2025-03-09 01:21:53,740 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 167 places, 356 transitions, 4643 flow [2025-03-09 01:21:53,741 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2025-03-09 01:21:53,741 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2025-03-09 01:21:53,741 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 641 transitions. [2025-03-09 01:21:53,742 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.571301247771836 [2025-03-09 01:21:53,742 INFO L175 Difference]: Start difference. First operand has 153 places, 174 transitions, 2046 flow. Second operand 17 states and 641 transitions. [2025-03-09 01:21:53,742 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 167 places, 356 transitions, 4643 flow [2025-03-09 01:21:53,769 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 162 places, 356 transitions, 4491 flow, removed 22 selfloop flow, removed 5 redundant places. [2025-03-09 01:21:53,772 INFO L231 Difference]: Finished difference. Result has 164 places, 181 transitions, 2220 flow [2025-03-09 01:21:53,772 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=66, PETRI_DIFFERENCE_MINUEND_FLOW=1946, PETRI_DIFFERENCE_MINUEND_PLACES=146, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=173, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=66, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=106, PETRI_DIFFERENCE_SUBTRAHEND_STATES=17, PETRI_FLOW=2220, PETRI_PLACES=164, PETRI_TRANSITIONS=181} [2025-03-09 01:21:53,772 INFO L279 CegarLoopForPetriNet]: 62 programPoint places, 102 predicate places. [2025-03-09 01:21:53,773 INFO L471 AbstractCegarLoop]: Abstraction has has 164 places, 181 transitions, 2220 flow [2025-03-09 01:21:53,773 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 31.6) internal successors, (632), 20 states have internal predecessors, (632), 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-09 01:21:53,773 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 01:21:53,773 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 01:21:53,779 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-09 01:21:53,973 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,SelfDestructingSolverStorable22 [2025-03-09 01:21:53,973 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting thread2Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 37 more)] === [2025-03-09 01:21:53,974 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:21:53,974 INFO L85 PathProgramCache]: Analyzing trace with hash 403950320, now seen corresponding path program 1 times [2025-03-09 01:21:53,974 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:21:53,974 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [819534497] [2025-03-09 01:21:53,974 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:21:53,974 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:21:53,980 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-03-09 01:21:53,984 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-03-09 01:21:53,984 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:21:53,984 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:21:54,101 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-09 01:21:54,101 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:21:54,101 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [819534497] [2025-03-09 01:21:54,101 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [819534497] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 01:21:54,101 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [922843335] [2025-03-09 01:21:54,101 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:21:54,101 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 01:21:54,101 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 01:21:54,104 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-09 01:21:54,105 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-09 01:21:54,150 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-03-09 01:21:54,169 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-03-09 01:21:54,169 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:21:54,169 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:21:54,170 INFO L256 TraceCheckSpWp]: Trace formula consists of 211 conjuncts, 19 conjuncts are in the unsatisfiable core [2025-03-09 01:21:54,172 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 01:21:54,177 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2025-03-09 01:21:54,209 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-09 01:21:54,209 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2025-03-09 01:21:54,217 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-03-09 01:21:54,217 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2025-03-09 01:21:54,273 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-09 01:21:54,273 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 01:21:54,377 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 48 [2025-03-09 01:21:54,481 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-09 01:21:54,481 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [922843335] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-09 01:21:54,481 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-09 01:21:54,481 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 14 [2025-03-09 01:21:54,481 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [753999808] [2025-03-09 01:21:54,481 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-09 01:21:54,482 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2025-03-09 01:21:54,482 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:21:54,482 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2025-03-09 01:21:54,482 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=193, Unknown=0, NotChecked=0, Total=240 [2025-03-09 01:21:55,133 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 29 out of 66 [2025-03-09 01:21:55,134 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 164 places, 181 transitions, 2220 flow. Second operand has 16 states, 16 states have (on average 31.4375) internal successors, (503), 16 states have internal predecessors, (503), 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-09 01:21:55,134 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 01:21:55,134 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 29 of 66 [2025-03-09 01:21:55,134 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 01:21:55,825 INFO L124 PetriNetUnfolderBase]: 2121/4253 cut-off events. [2025-03-09 01:21:55,826 INFO L125 PetriNetUnfolderBase]: For 41358/42186 co-relation queries the response was YES. [2025-03-09 01:21:55,840 INFO L83 FinitePrefix]: Finished finitePrefix Result has 18455 conditions, 4253 events. 2121/4253 cut-off events. For 41358/42186 co-relation queries the response was YES. Maximal size of possible extension queue 190. Compared 29443 event pairs, 752 based on Foata normal form. 114/4328 useless extension candidates. Maximal degree in co-relation 15587. Up to 1047 conditions per place. [2025-03-09 01:21:55,850 INFO L140 encePairwiseOnDemand]: 56/66 looper letters, 231 selfloop transitions, 48 changer transitions 0/299 dead transitions. [2025-03-09 01:21:55,850 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 176 places, 299 transitions, 3927 flow [2025-03-09 01:21:55,850 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-09 01:21:55,850 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2025-03-09 01:21:55,851 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 499 transitions. [2025-03-09 01:21:55,851 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5815850815850816 [2025-03-09 01:21:55,851 INFO L175 Difference]: Start difference. First operand has 164 places, 181 transitions, 2220 flow. Second operand 13 states and 499 transitions. [2025-03-09 01:21:55,851 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 176 places, 299 transitions, 3927 flow [2025-03-09 01:21:55,910 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 167 places, 299 transitions, 3818 flow, removed 20 selfloop flow, removed 9 redundant places. [2025-03-09 01:21:55,913 INFO L231 Difference]: Finished difference. Result has 171 places, 184 transitions, 2292 flow [2025-03-09 01:21:55,913 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=66, PETRI_DIFFERENCE_MINUEND_FLOW=2111, PETRI_DIFFERENCE_MINUEND_PLACES=155, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=181, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=45, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=133, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=2292, PETRI_PLACES=171, PETRI_TRANSITIONS=184} [2025-03-09 01:21:55,913 INFO L279 CegarLoopForPetriNet]: 62 programPoint places, 109 predicate places. [2025-03-09 01:21:55,913 INFO L471 AbstractCegarLoop]: Abstraction has has 171 places, 184 transitions, 2292 flow [2025-03-09 01:21:55,914 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 31.4375) internal successors, (503), 16 states have internal predecessors, (503), 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-09 01:21:55,914 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 01:21:55,914 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 01:21:55,920 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2025-03-09 01:21:56,114 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,SelfDestructingSolverStorable23 [2025-03-09 01:21:56,114 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 37 more)] === [2025-03-09 01:21:56,115 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:21:56,115 INFO L85 PathProgramCache]: Analyzing trace with hash -22860097, now seen corresponding path program 1 times [2025-03-09 01:21:56,115 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:21:56,115 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [851979259] [2025-03-09 01:21:56,115 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:21:56,115 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:21:56,119 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-03-09 01:21:56,122 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-03-09 01:21:56,122 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:21:56,122 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:21:56,238 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-09 01:21:56,238 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:21:56,238 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [851979259] [2025-03-09 01:21:56,238 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [851979259] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 01:21:56,238 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [328122653] [2025-03-09 01:21:56,238 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:21:56,238 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 01:21:56,239 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 01:21:56,241 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-09 01:21:56,242 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-09 01:21:56,285 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-03-09 01:21:56,300 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-03-09 01:21:56,301 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:21:56,301 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:21:56,302 INFO L256 TraceCheckSpWp]: Trace formula consists of 182 conjuncts, 20 conjuncts are in the unsatisfiable core [2025-03-09 01:21:56,303 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 01:21:56,503 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-09 01:21:56,504 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 01:21:56,817 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-09 01:21:56,817 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [328122653] provided 1 perfect and 1 imperfect interpolant sequences [2025-03-09 01:21:56,817 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-03-09 01:21:56,817 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [9, 8] total 23 [2025-03-09 01:21:56,817 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [363815434] [2025-03-09 01:21:56,817 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 01:21:56,817 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-09 01:21:56,818 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:21:56,818 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-09 01:21:56,818 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=113, Invalid=439, Unknown=0, NotChecked=0, Total=552 [2025-03-09 01:21:56,861 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 34 out of 66 [2025-03-09 01:21:56,862 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 171 places, 184 transitions, 2292 flow. Second operand has 9 states, 9 states have (on average 36.22222222222222) internal successors, (326), 9 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-09 01:21:56,862 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 01:21:56,862 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 34 of 66 [2025-03-09 01:21:56,862 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 01:21:57,423 INFO L124 PetriNetUnfolderBase]: 1884/3766 cut-off events. [2025-03-09 01:21:57,423 INFO L125 PetriNetUnfolderBase]: For 41436/42247 co-relation queries the response was YES. [2025-03-09 01:21:57,436 INFO L83 FinitePrefix]: Finished finitePrefix Result has 16923 conditions, 3766 events. 1884/3766 cut-off events. For 41436/42247 co-relation queries the response was YES. Maximal size of possible extension queue 177. Compared 25544 event pairs, 447 based on Foata normal form. 77/3791 useless extension candidates. Maximal degree in co-relation 14902. Up to 1877 conditions per place. [2025-03-09 01:21:57,446 INFO L140 encePairwiseOnDemand]: 53/66 looper letters, 160 selfloop transitions, 59 changer transitions 15/259 dead transitions. [2025-03-09 01:21:57,446 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 183 places, 259 transitions, 3410 flow [2025-03-09 01:21:57,447 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-09 01:21:57,447 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2025-03-09 01:21:57,447 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 536 transitions. [2025-03-09 01:21:57,447 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6247086247086248 [2025-03-09 01:21:57,447 INFO L175 Difference]: Start difference. First operand has 171 places, 184 transitions, 2292 flow. Second operand 13 states and 536 transitions. [2025-03-09 01:21:57,447 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 183 places, 259 transitions, 3410 flow [2025-03-09 01:21:57,476 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 176 places, 259 transitions, 3373 flow, removed 2 selfloop flow, removed 7 redundant places. [2025-03-09 01:21:57,479 INFO L231 Difference]: Finished difference. Result has 181 places, 188 transitions, 2433 flow [2025-03-09 01:21:57,479 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=66, PETRI_DIFFERENCE_MINUEND_FLOW=2256, PETRI_DIFFERENCE_MINUEND_PLACES=164, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=184, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=55, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=128, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=2433, PETRI_PLACES=181, PETRI_TRANSITIONS=188} [2025-03-09 01:21:57,480 INFO L279 CegarLoopForPetriNet]: 62 programPoint places, 119 predicate places. [2025-03-09 01:21:57,480 INFO L471 AbstractCegarLoop]: Abstraction has has 181 places, 188 transitions, 2433 flow [2025-03-09 01:21:57,480 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 36.22222222222222) internal successors, (326), 9 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-09 01:21:57,480 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 01:21:57,480 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 01:21:57,486 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Ended with exit code 0 [2025-03-09 01:21:57,680 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,SelfDestructingSolverStorable24 [2025-03-09 01:21:57,681 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 37 more)] === [2025-03-09 01:21:57,681 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:21:57,681 INFO L85 PathProgramCache]: Analyzing trace with hash 859202866, now seen corresponding path program 1 times [2025-03-09 01:21:57,681 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:21:57,682 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [573746457] [2025-03-09 01:21:57,682 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:21:57,682 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:21:57,692 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-03-09 01:21:57,697 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-03-09 01:21:57,700 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:21:57,700 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:21:57,866 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-09 01:21:57,866 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:21:57,866 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [573746457] [2025-03-09 01:21:57,867 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [573746457] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 01:21:57,867 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1757900794] [2025-03-09 01:21:57,867 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:21:57,867 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 01:21:57,867 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 01:21:57,874 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-09 01:21:57,876 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-09 01:21:57,934 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-03-09 01:21:57,961 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-03-09 01:21:57,961 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:21:57,962 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:21:57,963 INFO L256 TraceCheckSpWp]: Trace formula consists of 182 conjuncts, 20 conjuncts are in the unsatisfiable core [2025-03-09 01:21:57,964 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 01:21:58,181 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-09 01:21:58,182 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 01:21:58,634 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-09 01:21:58,635 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1757900794] provided 1 perfect and 1 imperfect interpolant sequences [2025-03-09 01:21:58,635 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-03-09 01:21:58,635 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [9, 9] total 25 [2025-03-09 01:21:58,635 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [420969788] [2025-03-09 01:21:58,635 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 01:21:58,635 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-09 01:21:58,635 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:21:58,635 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-09 01:21:58,635 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=134, Invalid=516, Unknown=0, NotChecked=0, Total=650 [2025-03-09 01:21:58,707 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 34 out of 66 [2025-03-09 01:21:58,708 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 181 places, 188 transitions, 2433 flow. Second operand has 10 states, 10 states have (on average 36.0) internal successors, (360), 10 states have internal predecessors, (360), 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-09 01:21:58,708 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 01:21:58,708 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 34 of 66 [2025-03-09 01:21:58,708 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 01:21:59,462 INFO L124 PetriNetUnfolderBase]: 1954/3947 cut-off events. [2025-03-09 01:21:59,462 INFO L125 PetriNetUnfolderBase]: For 46562/47388 co-relation queries the response was YES. [2025-03-09 01:21:59,475 INFO L83 FinitePrefix]: Finished finitePrefix Result has 18620 conditions, 3947 events. 1954/3947 cut-off events. For 46562/47388 co-relation queries the response was YES. Maximal size of possible extension queue 184. Compared 27382 event pairs, 449 based on Foata normal form. 77/3973 useless extension candidates. Maximal degree in co-relation 18530. Up to 1866 conditions per place. [2025-03-09 01:21:59,484 INFO L140 encePairwiseOnDemand]: 52/66 looper letters, 188 selfloop transitions, 67 changer transitions 11/291 dead transitions. [2025-03-09 01:21:59,484 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 191 places, 291 transitions, 4005 flow [2025-03-09 01:21:59,485 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-09 01:21:59,485 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2025-03-09 01:21:59,485 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 548 transitions. [2025-03-09 01:21:59,486 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6386946386946387 [2025-03-09 01:21:59,486 INFO L175 Difference]: Start difference. First operand has 181 places, 188 transitions, 2433 flow. Second operand 13 states and 548 transitions. [2025-03-09 01:21:59,486 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 191 places, 291 transitions, 4005 flow [2025-03-09 01:21:59,522 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 183 places, 291 transitions, 3874 flow, removed 13 selfloop flow, removed 8 redundant places. [2025-03-09 01:21:59,525 INFO L231 Difference]: Finished difference. Result has 190 places, 198 transitions, 2616 flow [2025-03-09 01:21:59,526 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=66, PETRI_DIFFERENCE_MINUEND_FLOW=2322, PETRI_DIFFERENCE_MINUEND_PLACES=171, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=188, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=57, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=127, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=2616, PETRI_PLACES=190, PETRI_TRANSITIONS=198} [2025-03-09 01:21:59,526 INFO L279 CegarLoopForPetriNet]: 62 programPoint places, 128 predicate places. [2025-03-09 01:21:59,526 INFO L471 AbstractCegarLoop]: Abstraction has has 190 places, 198 transitions, 2616 flow [2025-03-09 01:21:59,526 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 36.0) internal successors, (360), 10 states have internal predecessors, (360), 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-09 01:21:59,526 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 01:21:59,526 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 01:21:59,533 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Ended with exit code 0 [2025-03-09 01:21:59,727 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,SelfDestructingSolverStorable25 [2025-03-09 01:21:59,727 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 37 more)] === [2025-03-09 01:21:59,727 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:21:59,727 INFO L85 PathProgramCache]: Analyzing trace with hash 687182077, now seen corresponding path program 2 times [2025-03-09 01:21:59,727 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:21:59,727 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2043598391] [2025-03-09 01:21:59,727 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-09 01:21:59,727 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:21:59,731 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 23 statements into 2 equivalence classes. [2025-03-09 01:21:59,735 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 21 of 23 statements. [2025-03-09 01:21:59,735 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-09 01:21:59,735 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:21:59,863 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-09 01:21:59,863 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:21:59,863 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2043598391] [2025-03-09 01:21:59,863 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2043598391] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 01:21:59,863 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 01:21:59,863 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-09 01:21:59,863 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1977293882] [2025-03-09 01:21:59,864 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 01:21:59,864 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-09 01:21:59,864 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:21:59,864 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-09 01:21:59,864 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2025-03-09 01:21:59,900 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 34 out of 66 [2025-03-09 01:21:59,901 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 190 places, 198 transitions, 2616 flow. Second operand has 8 states, 8 states have (on average 36.5) internal successors, (292), 8 states have internal predecessors, (292), 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-09 01:21:59,901 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 01:21:59,901 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 34 of 66 [2025-03-09 01:21:59,901 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 01:22:00,487 INFO L124 PetriNetUnfolderBase]: 1970/3988 cut-off events. [2025-03-09 01:22:00,487 INFO L125 PetriNetUnfolderBase]: For 48757/49591 co-relation queries the response was YES. [2025-03-09 01:22:00,501 INFO L83 FinitePrefix]: Finished finitePrefix Result has 19374 conditions, 3988 events. 1970/3988 cut-off events. For 48757/49591 co-relation queries the response was YES. Maximal size of possible extension queue 179. Compared 27742 event pairs, 473 based on Foata normal form. 85/4023 useless extension candidates. Maximal degree in co-relation 19281. Up to 2137 conditions per place. [2025-03-09 01:22:00,511 INFO L140 encePairwiseOnDemand]: 55/66 looper letters, 189 selfloop transitions, 44 changer transitions 15/273 dead transitions. [2025-03-09 01:22:00,511 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 198 places, 273 transitions, 3943 flow [2025-03-09 01:22:00,511 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-09 01:22:00,512 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2025-03-09 01:22:00,512 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 429 transitions. [2025-03-09 01:22:00,512 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.65 [2025-03-09 01:22:00,512 INFO L175 Difference]: Start difference. First operand has 190 places, 198 transitions, 2616 flow. Second operand 10 states and 429 transitions. [2025-03-09 01:22:00,512 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 198 places, 273 transitions, 3943 flow [2025-03-09 01:22:00,549 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 194 places, 273 transitions, 3896 flow, removed 9 selfloop flow, removed 4 redundant places. [2025-03-09 01:22:00,552 INFO L231 Difference]: Finished difference. Result has 196 places, 201 transitions, 2738 flow [2025-03-09 01:22:00,553 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=66, PETRI_DIFFERENCE_MINUEND_FLOW=2569, PETRI_DIFFERENCE_MINUEND_PLACES=185, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=198, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=41, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=156, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=2738, PETRI_PLACES=196, PETRI_TRANSITIONS=201} [2025-03-09 01:22:00,553 INFO L279 CegarLoopForPetriNet]: 62 programPoint places, 134 predicate places. [2025-03-09 01:22:00,553 INFO L471 AbstractCegarLoop]: Abstraction has has 196 places, 201 transitions, 2738 flow [2025-03-09 01:22:00,553 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 36.5) internal successors, (292), 8 states have internal predecessors, (292), 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-09 01:22:00,553 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 01:22:00,553 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 01:22:00,553 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2025-03-09 01:22:00,554 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 37 more)] === [2025-03-09 01:22:00,554 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:22:00,554 INFO L85 PathProgramCache]: Analyzing trace with hash 2131318405, now seen corresponding path program 3 times [2025-03-09 01:22:00,554 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:22:00,554 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1412253207] [2025-03-09 01:22:00,554 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-09 01:22:00,554 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:22:00,558 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 23 statements into 2 equivalence classes. [2025-03-09 01:22:00,561 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 21 of 23 statements. [2025-03-09 01:22:00,562 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-03-09 01:22:00,562 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:22:00,736 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-09 01:22:00,736 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:22:00,736 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1412253207] [2025-03-09 01:22:00,736 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1412253207] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 01:22:00,736 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 01:22:00,737 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-09 01:22:00,737 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [488062223] [2025-03-09 01:22:00,737 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 01:22:00,737 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-09 01:22:00,738 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:22:00,738 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-09 01:22:00,738 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2025-03-09 01:22:00,852 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 33 out of 66 [2025-03-09 01:22:00,852 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 196 places, 201 transitions, 2738 flow. Second operand has 10 states, 10 states have (on average 35.1) internal successors, (351), 10 states have internal predecessors, (351), 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-09 01:22:00,852 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 01:22:00,853 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 33 of 66 [2025-03-09 01:22:00,853 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 01:22:01,630 INFO L124 PetriNetUnfolderBase]: 2231/4369 cut-off events. [2025-03-09 01:22:01,630 INFO L125 PetriNetUnfolderBase]: For 55735/56550 co-relation queries the response was YES. [2025-03-09 01:22:01,650 INFO L83 FinitePrefix]: Finished finitePrefix Result has 22468 conditions, 4369 events. 2231/4369 cut-off events. For 55735/56550 co-relation queries the response was YES. Maximal size of possible extension queue 195. Compared 30200 event pairs, 586 based on Foata normal form. 84/4400 useless extension candidates. Maximal degree in co-relation 21649. Up to 2199 conditions per place. [2025-03-09 01:22:01,665 INFO L140 encePairwiseOnDemand]: 53/66 looper letters, 198 selfloop transitions, 54 changer transitions 30/304 dead transitions. [2025-03-09 01:22:01,665 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 210 places, 304 transitions, 4391 flow [2025-03-09 01:22:01,666 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-03-09 01:22:01,666 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2025-03-09 01:22:01,666 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 642 transitions. [2025-03-09 01:22:01,667 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6079545454545454 [2025-03-09 01:22:01,667 INFO L175 Difference]: Start difference. First operand has 196 places, 201 transitions, 2738 flow. Second operand 16 states and 642 transitions. [2025-03-09 01:22:01,667 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 210 places, 304 transitions, 4391 flow [2025-03-09 01:22:01,712 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 203 places, 304 transitions, 4242 flow, removed 12 selfloop flow, removed 7 redundant places. [2025-03-09 01:22:01,715 INFO L231 Difference]: Finished difference. Result has 209 places, 207 transitions, 2849 flow [2025-03-09 01:22:01,716 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=66, PETRI_DIFFERENCE_MINUEND_FLOW=2615, PETRI_DIFFERENCE_MINUEND_PLACES=188, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=201, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=44, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=149, PETRI_DIFFERENCE_SUBTRAHEND_STATES=16, PETRI_FLOW=2849, PETRI_PLACES=209, PETRI_TRANSITIONS=207} [2025-03-09 01:22:01,716 INFO L279 CegarLoopForPetriNet]: 62 programPoint places, 147 predicate places. [2025-03-09 01:22:01,716 INFO L471 AbstractCegarLoop]: Abstraction has has 209 places, 207 transitions, 2849 flow [2025-03-09 01:22:01,716 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 35.1) internal successors, (351), 10 states have internal predecessors, (351), 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-09 01:22:01,716 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 01:22:01,716 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 01:22:01,716 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2025-03-09 01:22:01,717 INFO L396 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 37 more)] === [2025-03-09 01:22:01,717 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:22:01,717 INFO L85 PathProgramCache]: Analyzing trace with hash 1049419658, now seen corresponding path program 2 times [2025-03-09 01:22:01,717 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:22:01,717 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1959909173] [2025-03-09 01:22:01,717 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-09 01:22:01,717 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:22:01,722 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 23 statements into 2 equivalence classes. [2025-03-09 01:22:01,727 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 21 of 23 statements. [2025-03-09 01:22:01,727 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-09 01:22:01,727 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:22:01,944 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-09 01:22:01,945 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:22:01,945 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1959909173] [2025-03-09 01:22:01,945 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1959909173] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 01:22:01,945 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 01:22:01,945 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-03-09 01:22:01,945 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [578441564] [2025-03-09 01:22:01,945 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 01:22:01,945 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-09 01:22:01,945 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:22:01,946 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-09 01:22:01,946 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=82, Unknown=0, NotChecked=0, Total=110 [2025-03-09 01:22:02,050 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 33 out of 66 [2025-03-09 01:22:02,051 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 209 places, 207 transitions, 2849 flow. Second operand has 11 states, 11 states have (on average 34.90909090909091) internal successors, (384), 11 states have internal predecessors, (384), 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-09 01:22:02,051 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 01:22:02,051 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 33 of 66 [2025-03-09 01:22:02,051 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 01:22:02,748 INFO L124 PetriNetUnfolderBase]: 2199/4301 cut-off events. [2025-03-09 01:22:02,748 INFO L125 PetriNetUnfolderBase]: For 55840/56681 co-relation queries the response was YES. [2025-03-09 01:22:02,767 INFO L83 FinitePrefix]: Finished finitePrefix Result has 21787 conditions, 4301 events. 2199/4301 cut-off events. For 55840/56681 co-relation queries the response was YES. Maximal size of possible extension queue 191. Compared 29597 event pairs, 558 based on Foata normal form. 86/4332 useless extension candidates. Maximal degree in co-relation 21681. Up to 2044 conditions per place. [2025-03-09 01:22:02,780 INFO L140 encePairwiseOnDemand]: 54/66 looper letters, 207 selfloop transitions, 58 changer transitions 23/310 dead transitions. [2025-03-09 01:22:02,780 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 219 places, 310 transitions, 4488 flow [2025-03-09 01:22:02,781 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-03-09 01:22:02,781 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2025-03-09 01:22:02,781 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 641 transitions. [2025-03-09 01:22:02,781 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6070075757575758 [2025-03-09 01:22:02,781 INFO L175 Difference]: Start difference. First operand has 209 places, 207 transitions, 2849 flow. Second operand 16 states and 641 transitions. [2025-03-09 01:22:02,781 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 219 places, 310 transitions, 4488 flow [2025-03-09 01:22:02,827 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 211 places, 310 transitions, 4376 flow, removed 11 selfloop flow, removed 8 redundant places. [2025-03-09 01:22:02,830 INFO L231 Difference]: Finished difference. Result has 218 places, 215 transitions, 3050 flow [2025-03-09 01:22:02,831 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=66, PETRI_DIFFERENCE_MINUEND_FLOW=2757, PETRI_DIFFERENCE_MINUEND_PLACES=196, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=207, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=50, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=151, PETRI_DIFFERENCE_SUBTRAHEND_STATES=16, PETRI_FLOW=3050, PETRI_PLACES=218, PETRI_TRANSITIONS=215} [2025-03-09 01:22:02,831 INFO L279 CegarLoopForPetriNet]: 62 programPoint places, 156 predicate places. [2025-03-09 01:22:02,831 INFO L471 AbstractCegarLoop]: Abstraction has has 218 places, 215 transitions, 3050 flow [2025-03-09 01:22:02,832 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 34.90909090909091) internal successors, (384), 11 states have internal predecessors, (384), 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-09 01:22:02,832 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 01:22:02,832 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 01:22:02,832 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2025-03-09 01:22:02,832 INFO L396 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 37 more)] === [2025-03-09 01:22:02,832 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:22:02,832 INFO L85 PathProgramCache]: Analyzing trace with hash -1151690958, now seen corresponding path program 3 times [2025-03-09 01:22:02,832 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:22:02,832 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1102310462] [2025-03-09 01:22:02,832 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-09 01:22:02,832 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:22:02,836 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 23 statements into 2 equivalence classes. [2025-03-09 01:22:02,840 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 21 of 23 statements. [2025-03-09 01:22:02,840 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-03-09 01:22:02,840 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:22:02,912 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-09 01:22:02,913 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:22:02,913 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1102310462] [2025-03-09 01:22:02,913 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1102310462] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 01:22:02,913 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 01:22:02,913 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-09 01:22:02,913 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1919380983] [2025-03-09 01:22:02,913 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 01:22:02,913 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-09 01:22:02,913 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:22:02,913 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-09 01:22:02,913 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-09 01:22:02,923 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 34 out of 66 [2025-03-09 01:22:02,923 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 218 places, 215 transitions, 3050 flow. Second operand has 6 states, 6 states have (on average 37.333333333333336) internal successors, (224), 6 states have internal predecessors, (224), 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-09 01:22:02,923 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 01:22:02,923 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 34 of 66 [2025-03-09 01:22:02,923 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 01:22:03,587 INFO L124 PetriNetUnfolderBase]: 3013/6072 cut-off events. [2025-03-09 01:22:03,587 INFO L125 PetriNetUnfolderBase]: For 82147/83873 co-relation queries the response was YES. [2025-03-09 01:22:03,616 INFO L83 FinitePrefix]: Finished finitePrefix Result has 29697 conditions, 6072 events. 3013/6072 cut-off events. For 82147/83873 co-relation queries the response was YES. Maximal size of possible extension queue 313. Compared 46397 event pairs, 245 based on Foata normal form. 180/6174 useless extension candidates. Maximal degree in co-relation 29571. Up to 1403 conditions per place. [2025-03-09 01:22:03,633 INFO L140 encePairwiseOnDemand]: 58/66 looper letters, 270 selfloop transitions, 89 changer transitions 48/432 dead transitions. [2025-03-09 01:22:03,633 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 223 places, 432 transitions, 6860 flow [2025-03-09 01:22:03,633 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-09 01:22:03,633 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2025-03-09 01:22:03,634 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 409 transitions. [2025-03-09 01:22:03,634 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6885521885521886 [2025-03-09 01:22:03,634 INFO L175 Difference]: Start difference. First operand has 218 places, 215 transitions, 3050 flow. Second operand 9 states and 409 transitions. [2025-03-09 01:22:03,634 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 223 places, 432 transitions, 6860 flow [2025-03-09 01:22:03,704 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 213 places, 432 transitions, 6725 flow, removed 20 selfloop flow, removed 10 redundant places. [2025-03-09 01:22:03,708 INFO L231 Difference]: Finished difference. Result has 218 places, 246 transitions, 3768 flow [2025-03-09 01:22:03,709 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=66, PETRI_DIFFERENCE_MINUEND_FLOW=2953, PETRI_DIFFERENCE_MINUEND_PLACES=205, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=215, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=45, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=159, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=3768, PETRI_PLACES=218, PETRI_TRANSITIONS=246} [2025-03-09 01:22:03,709 INFO L279 CegarLoopForPetriNet]: 62 programPoint places, 156 predicate places. [2025-03-09 01:22:03,709 INFO L471 AbstractCegarLoop]: Abstraction has has 218 places, 246 transitions, 3768 flow [2025-03-09 01:22:03,709 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 37.333333333333336) internal successors, (224), 6 states have internal predecessors, (224), 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-09 01:22:03,709 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 01:22:03,709 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 01:22:03,709 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2025-03-09 01:22:03,709 INFO L396 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 37 more)] === [2025-03-09 01:22:03,710 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:22:03,710 INFO L85 PathProgramCache]: Analyzing trace with hash 1226317477, now seen corresponding path program 4 times [2025-03-09 01:22:03,710 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:22:03,710 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1128168579] [2025-03-09 01:22:03,710 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-09 01:22:03,710 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:22:03,715 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 23 statements into 2 equivalence classes. [2025-03-09 01:22:03,718 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 23 of 23 statements. [2025-03-09 01:22:03,718 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-03-09 01:22:03,718 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:22:03,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-09 01:22:03,897 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:22:03,897 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1128168579] [2025-03-09 01:22:03,897 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1128168579] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 01:22:03,897 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [522239012] [2025-03-09 01:22:03,897 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-09 01:22:03,897 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 01:22:03,897 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 01:22:03,899 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-09 01:22:03,900 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-09 01:22:03,940 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 23 statements into 2 equivalence classes. [2025-03-09 01:22:03,956 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 23 of 23 statements. [2025-03-09 01:22:03,956 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-03-09 01:22:03,956 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:22:03,958 INFO L256 TraceCheckSpWp]: Trace formula consists of 182 conjuncts, 18 conjuncts are in the unsatisfiable core [2025-03-09 01:22:03,958 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 01:22:04,160 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-09 01:22:04,160 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 01:22:04,564 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-09 01:22:04,564 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [522239012] provided 1 perfect and 1 imperfect interpolant sequences [2025-03-09 01:22:04,564 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-03-09 01:22:04,564 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [10, 10] total 26 [2025-03-09 01:22:04,564 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [437145115] [2025-03-09 01:22:04,564 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 01:22:04,564 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-09 01:22:04,564 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:22:04,565 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-09 01:22:04,565 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=123, Invalid=527, Unknown=0, NotChecked=0, Total=650 [2025-03-09 01:22:04,703 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 32 out of 66 [2025-03-09 01:22:04,704 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 218 places, 246 transitions, 3768 flow. Second operand has 10 states, 10 states have (on average 34.1) internal successors, (341), 10 states have internal predecessors, (341), 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-09 01:22:04,704 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 01:22:04,704 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 32 of 66 [2025-03-09 01:22:04,704 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 01:22:06,310 INFO L124 PetriNetUnfolderBase]: 5038/9676 cut-off events. [2025-03-09 01:22:06,311 INFO L125 PetriNetUnfolderBase]: For 128468/130333 co-relation queries the response was YES. [2025-03-09 01:22:06,360 INFO L83 FinitePrefix]: Finished finitePrefix Result has 48618 conditions, 9676 events. 5038/9676 cut-off events. For 128468/130333 co-relation queries the response was YES. Maximal size of possible extension queue 496. Compared 77174 event pairs, 334 based on Foata normal form. 206/9757 useless extension candidates. Maximal degree in co-relation 48444. Up to 2122 conditions per place. [2025-03-09 01:22:06,388 INFO L140 encePairwiseOnDemand]: 51/66 looper letters, 335 selfloop transitions, 157 changer transitions 36/549 dead transitions. [2025-03-09 01:22:06,389 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 229 places, 549 transitions, 8940 flow [2025-03-09 01:22:06,389 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-03-09 01:22:06,389 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2025-03-09 01:22:06,389 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 685 transitions. [2025-03-09 01:22:06,390 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6486742424242424 [2025-03-09 01:22:06,390 INFO L175 Difference]: Start difference. First operand has 218 places, 246 transitions, 3768 flow. Second operand 16 states and 685 transitions. [2025-03-09 01:22:06,390 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 229 places, 549 transitions, 8940 flow [2025-03-09 01:22:06,573 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 222 places, 549 transitions, 8828 flow, removed 36 selfloop flow, removed 7 redundant places. [2025-03-09 01:22:06,579 INFO L231 Difference]: Finished difference. Result has 231 places, 316 transitions, 5535 flow [2025-03-09 01:22:06,579 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=66, PETRI_DIFFERENCE_MINUEND_FLOW=3678, PETRI_DIFFERENCE_MINUEND_PLACES=207, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=246, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=80, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=142, PETRI_DIFFERENCE_SUBTRAHEND_STATES=16, PETRI_FLOW=5535, PETRI_PLACES=231, PETRI_TRANSITIONS=316} [2025-03-09 01:22:06,579 INFO L279 CegarLoopForPetriNet]: 62 programPoint places, 169 predicate places. [2025-03-09 01:22:06,579 INFO L471 AbstractCegarLoop]: Abstraction has has 231 places, 316 transitions, 5535 flow [2025-03-09 01:22:06,579 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 34.1) internal successors, (341), 10 states have internal predecessors, (341), 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-09 01:22:06,579 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 01:22:06,580 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 01:22:06,586 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-09 01:22:06,780 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30,15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 01:22:06,780 INFO L396 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 37 more)] === [2025-03-09 01:22:06,781 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:22:06,781 INFO L85 PathProgramCache]: Analyzing trace with hash -1547259349, now seen corresponding path program 5 times [2025-03-09 01:22:06,781 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:22:06,781 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [106733820] [2025-03-09 01:22:06,781 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-09 01:22:06,781 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:22:06,786 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 23 statements into 2 equivalence classes. [2025-03-09 01:22:06,789 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 23 of 23 statements. [2025-03-09 01:22:06,789 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-09 01:22:06,789 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:22:06,896 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-09 01:22:06,896 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:22:06,896 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [106733820] [2025-03-09 01:22:06,896 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [106733820] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 01:22:06,896 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [99219734] [2025-03-09 01:22:06,897 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-09 01:22:06,897 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 01:22:06,897 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 01:22:06,899 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-09 01:22:06,900 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-09 01:22:06,946 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 23 statements into 2 equivalence classes. [2025-03-09 01:22:06,965 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 23 of 23 statements. [2025-03-09 01:22:06,965 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-09 01:22:06,965 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:22:06,966 INFO L256 TraceCheckSpWp]: Trace formula consists of 182 conjuncts, 20 conjuncts are in the unsatisfiable core [2025-03-09 01:22:06,969 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 01:22:07,168 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-09 01:22:07,168 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 01:22:07,522 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-09 01:22:07,522 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [99219734] provided 1 perfect and 1 imperfect interpolant sequences [2025-03-09 01:22:07,522 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-03-09 01:22:07,522 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [8, 8] total 22 [2025-03-09 01:22:07,522 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1254322143] [2025-03-09 01:22:07,522 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 01:22:07,522 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-09 01:22:07,522 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:22:07,522 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-09 01:22:07,523 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=108, Invalid=398, Unknown=0, NotChecked=0, Total=506 [2025-03-09 01:22:07,592 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 34 out of 66 [2025-03-09 01:22:07,592 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 231 places, 316 transitions, 5535 flow. Second operand has 9 states, 9 states have (on average 36.22222222222222) internal successors, (326), 9 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-09 01:22:07,593 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 01:22:07,593 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 34 of 66 [2025-03-09 01:22:07,593 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 01:22:08,818 INFO L124 PetriNetUnfolderBase]: 4038/8008 cut-off events. [2025-03-09 01:22:08,818 INFO L125 PetriNetUnfolderBase]: For 153286/155833 co-relation queries the response was YES. [2025-03-09 01:22:08,866 INFO L83 FinitePrefix]: Finished finitePrefix Result has 45323 conditions, 8008 events. 4038/8008 cut-off events. For 153286/155833 co-relation queries the response was YES. Maximal size of possible extension queue 427. Compared 64427 event pairs, 921 based on Foata normal form. 259/8076 useless extension candidates. Maximal degree in co-relation 45143. Up to 4612 conditions per place. [2025-03-09 01:22:08,896 INFO L140 encePairwiseOnDemand]: 53/66 looper letters, 198 selfloop transitions, 122 changer transitions 17/370 dead transitions. [2025-03-09 01:22:08,896 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 241 places, 370 transitions, 6770 flow [2025-03-09 01:22:08,897 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-09 01:22:08,897 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2025-03-09 01:22:08,897 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 524 transitions. [2025-03-09 01:22:08,897 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6107226107226107 [2025-03-09 01:22:08,898 INFO L175 Difference]: Start difference. First operand has 231 places, 316 transitions, 5535 flow. Second operand 13 states and 524 transitions. [2025-03-09 01:22:08,898 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 241 places, 370 transitions, 6770 flow [2025-03-09 01:22:09,187 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 235 places, 370 transitions, 6614 flow, removed 56 selfloop flow, removed 6 redundant places. [2025-03-09 01:22:09,192 INFO L231 Difference]: Finished difference. Result has 237 places, 313 transitions, 5568 flow [2025-03-09 01:22:09,193 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=66, PETRI_DIFFERENCE_MINUEND_FLOW=5385, PETRI_DIFFERENCE_MINUEND_PLACES=223, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=316, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=122, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=194, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=5568, PETRI_PLACES=237, PETRI_TRANSITIONS=313} [2025-03-09 01:22:09,193 INFO L279 CegarLoopForPetriNet]: 62 programPoint places, 175 predicate places. [2025-03-09 01:22:09,193 INFO L471 AbstractCegarLoop]: Abstraction has has 237 places, 313 transitions, 5568 flow [2025-03-09 01:22:09,193 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 36.22222222222222) internal successors, (326), 9 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-09 01:22:09,193 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 01:22:09,193 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 01:22:09,199 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Forceful destruction successful, exit code 0 [2025-03-09 01:22:09,394 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31,16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 01:22:09,394 INFO L396 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 37 more)] === [2025-03-09 01:22:09,394 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:22:09,394 INFO L85 PathProgramCache]: Analyzing trace with hash 593592854, now seen corresponding path program 4 times [2025-03-09 01:22:09,394 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:22:09,394 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1233734449] [2025-03-09 01:22:09,394 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-09 01:22:09,394 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:22:09,398 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 23 statements into 2 equivalence classes. [2025-03-09 01:22:09,401 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 23 of 23 statements. [2025-03-09 01:22:09,401 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-03-09 01:22:09,401 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:22:09,532 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-09 01:22:09,532 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:22:09,532 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1233734449] [2025-03-09 01:22:09,532 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1233734449] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 01:22:09,532 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1364871826] [2025-03-09 01:22:09,532 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-09 01:22:09,532 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 01:22:09,532 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 01:22:09,534 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-09 01:22:09,535 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-09 01:22:09,573 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 23 statements into 2 equivalence classes. [2025-03-09 01:22:09,589 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 23 of 23 statements. [2025-03-09 01:22:09,589 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-03-09 01:22:09,589 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:22:09,590 INFO L256 TraceCheckSpWp]: Trace formula consists of 182 conjuncts, 20 conjuncts are in the unsatisfiable core [2025-03-09 01:22:09,591 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 01:22:09,772 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-09 01:22:09,772 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 01:22:10,003 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-09 01:22:10,003 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1364871826] provided 1 perfect and 1 imperfect interpolant sequences [2025-03-09 01:22:10,003 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-03-09 01:22:10,003 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [9, 9] total 25 [2025-03-09 01:22:10,003 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1339831448] [2025-03-09 01:22:10,003 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 01:22:10,004 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-09 01:22:10,004 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:22:10,004 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-09 01:22:10,004 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=128, Invalid=522, Unknown=0, NotChecked=0, Total=650 [2025-03-09 01:22:10,063 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 34 out of 66 [2025-03-09 01:22:10,063 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 237 places, 313 transitions, 5568 flow. Second operand has 10 states, 10 states have (on average 36.0) internal successors, (360), 10 states have internal predecessors, (360), 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-09 01:22:10,063 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 01:22:10,063 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 34 of 66 [2025-03-09 01:22:10,063 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 01:22:11,124 INFO L124 PetriNetUnfolderBase]: 3998/7900 cut-off events. [2025-03-09 01:22:11,125 INFO L125 PetriNetUnfolderBase]: For 156351/158844 co-relation queries the response was YES. [2025-03-09 01:22:11,179 INFO L83 FinitePrefix]: Finished finitePrefix Result has 45114 conditions, 7900 events. 3998/7900 cut-off events. For 156351/158844 co-relation queries the response was YES. Maximal size of possible extension queue 441. Compared 63263 event pairs, 890 based on Foata normal form. 259/7957 useless extension candidates. Maximal degree in co-relation 44943. Up to 4481 conditions per place. [2025-03-09 01:22:11,207 INFO L140 encePairwiseOnDemand]: 52/66 looper letters, 190 selfloop transitions, 124 changer transitions 20/367 dead transitions. [2025-03-09 01:22:11,207 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 244 places, 367 transitions, 6701 flow [2025-03-09 01:22:11,207 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-09 01:22:11,208 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2025-03-09 01:22:11,208 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 495 transitions. [2025-03-09 01:22:11,208 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.625 [2025-03-09 01:22:11,208 INFO L175 Difference]: Start difference. First operand has 237 places, 313 transitions, 5568 flow. Second operand 12 states and 495 transitions. [2025-03-09 01:22:11,208 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 244 places, 367 transitions, 6701 flow [2025-03-09 01:22:11,671 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 231 places, 367 transitions, 6426 flow, removed 13 selfloop flow, removed 13 redundant places. [2025-03-09 01:22:11,675 INFO L231 Difference]: Finished difference. Result has 232 places, 305 transitions, 5407 flow [2025-03-09 01:22:11,675 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=66, PETRI_DIFFERENCE_MINUEND_FLOW=5295, PETRI_DIFFERENCE_MINUEND_PLACES=220, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=313, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=124, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=189, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=5407, PETRI_PLACES=232, PETRI_TRANSITIONS=305} [2025-03-09 01:22:11,676 INFO L279 CegarLoopForPetriNet]: 62 programPoint places, 170 predicate places. [2025-03-09 01:22:11,676 INFO L471 AbstractCegarLoop]: Abstraction has has 232 places, 305 transitions, 5407 flow [2025-03-09 01:22:11,676 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 36.0) internal successors, (360), 10 states have internal predecessors, (360), 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-09 01:22:11,676 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 01:22:11,676 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 01:22:11,681 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Ended with exit code 0 [2025-03-09 01:22:11,876 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable32 [2025-03-09 01:22:11,876 INFO L396 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 37 more)] === [2025-03-09 01:22:11,877 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:22:11,877 INFO L85 PathProgramCache]: Analyzing trace with hash 1413100086, now seen corresponding path program 5 times [2025-03-09 01:22:11,877 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:22:11,877 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1717855140] [2025-03-09 01:22:11,877 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-09 01:22:11,877 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:22:11,882 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 23 statements into 2 equivalence classes. [2025-03-09 01:22:11,885 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 23 of 23 statements. [2025-03-09 01:22:11,885 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-09 01:22:11,886 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:22:12,016 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-09 01:22:12,016 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:22:12,016 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1717855140] [2025-03-09 01:22:12,016 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1717855140] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 01:22:12,016 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [976919987] [2025-03-09 01:22:12,017 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-09 01:22:12,017 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 01:22:12,017 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 01:22:12,019 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-09 01:22:12,020 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-09 01:22:12,059 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 23 statements into 2 equivalence classes. [2025-03-09 01:22:12,072 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 23 of 23 statements. [2025-03-09 01:22:12,072 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-09 01:22:12,072 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:22:12,072 INFO L256 TraceCheckSpWp]: Trace formula consists of 182 conjuncts, 20 conjuncts are in the unsatisfiable core [2025-03-09 01:22:12,073 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 01:22:12,236 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-09 01:22:12,237 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 01:22:12,590 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-09 01:22:12,590 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [976919987] provided 1 perfect and 1 imperfect interpolant sequences [2025-03-09 01:22:12,590 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-03-09 01:22:12,590 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [9, 9] total 25 [2025-03-09 01:22:12,590 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1525092360] [2025-03-09 01:22:12,590 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 01:22:12,591 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-09 01:22:12,591 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:22:12,591 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-09 01:22:12,591 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=134, Invalid=516, Unknown=0, NotChecked=0, Total=650 [2025-03-09 01:22:12,680 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 34 out of 66 [2025-03-09 01:22:12,681 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 232 places, 305 transitions, 5407 flow. Second operand has 10 states, 10 states have (on average 36.0) internal successors, (360), 10 states have internal predecessors, (360), 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-09 01:22:12,681 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 01:22:12,681 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 34 of 66 [2025-03-09 01:22:12,681 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 01:22:13,834 INFO L124 PetriNetUnfolderBase]: 3960/7826 cut-off events. [2025-03-09 01:22:13,834 INFO L125 PetriNetUnfolderBase]: For 155689/158196 co-relation queries the response was YES. [2025-03-09 01:22:13,883 INFO L83 FinitePrefix]: Finished finitePrefix Result has 44609 conditions, 7826 events. 3960/7826 cut-off events. For 155689/158196 co-relation queries the response was YES. Maximal size of possible extension queue 430. Compared 62662 event pairs, 881 based on Foata normal form. 259/7895 useless extension candidates. Maximal degree in co-relation 44440. Up to 4481 conditions per place. [2025-03-09 01:22:13,909 INFO L140 encePairwiseOnDemand]: 52/66 looper letters, 181 selfloop transitions, 118 changer transitions 25/357 dead transitions. [2025-03-09 01:22:13,909 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 239 places, 357 transitions, 6567 flow [2025-03-09 01:22:13,910 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-09 01:22:13,910 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2025-03-09 01:22:13,910 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 487 transitions. [2025-03-09 01:22:13,910 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.61489898989899 [2025-03-09 01:22:13,910 INFO L175 Difference]: Start difference. First operand has 232 places, 305 transitions, 5407 flow. Second operand 12 states and 487 transitions. [2025-03-09 01:22:13,910 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 239 places, 357 transitions, 6567 flow [2025-03-09 01:22:14,233 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 227 places, 357 transitions, 6381 flow, removed 3 selfloop flow, removed 12 redundant places. [2025-03-09 01:22:14,237 INFO L231 Difference]: Finished difference. Result has 229 places, 294 transitions, 5255 flow [2025-03-09 01:22:14,237 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=66, PETRI_DIFFERENCE_MINUEND_FLOW=5225, PETRI_DIFFERENCE_MINUEND_PLACES=216, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=305, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=118, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=187, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=5255, PETRI_PLACES=229, PETRI_TRANSITIONS=294} [2025-03-09 01:22:14,238 INFO L279 CegarLoopForPetriNet]: 62 programPoint places, 167 predicate places. [2025-03-09 01:22:14,238 INFO L471 AbstractCegarLoop]: Abstraction has has 229 places, 294 transitions, 5255 flow [2025-03-09 01:22:14,238 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 36.0) internal successors, (360), 10 states have internal predecessors, (360), 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-09 01:22:14,238 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 01:22:14,238 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 01:22:14,243 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Ended with exit code 0 [2025-03-09 01:22:14,438 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33,18 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 01:22:14,438 INFO L396 AbstractCegarLoop]: === Iteration 35 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 37 more)] === [2025-03-09 01:22:14,439 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:22:14,439 INFO L85 PathProgramCache]: Analyzing trace with hash -344515524, now seen corresponding path program 6 times [2025-03-09 01:22:14,439 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:22:14,439 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [561902893] [2025-03-09 01:22:14,439 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-03-09 01:22:14,439 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:22:14,444 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 23 statements into 2 equivalence classes. [2025-03-09 01:22:14,447 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) and asserted 21 of 23 statements. [2025-03-09 01:22:14,447 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) [2025-03-09 01:22:14,447 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:22:14,570 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-09 01:22:14,570 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:22:14,570 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [561902893] [2025-03-09 01:22:14,570 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [561902893] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 01:22:14,570 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 01:22:14,570 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-09 01:22:14,570 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [434102422] [2025-03-09 01:22:14,570 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 01:22:14,571 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-09 01:22:14,571 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:22:14,571 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-09 01:22:14,571 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2025-03-09 01:22:14,612 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 34 out of 66 [2025-03-09 01:22:14,612 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 229 places, 294 transitions, 5255 flow. Second operand has 9 states, 9 states have (on average 36.22222222222222) internal successors, (326), 9 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-09 01:22:14,612 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 01:22:14,612 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 34 of 66 [2025-03-09 01:22:14,612 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 01:22:15,485 INFO L124 PetriNetUnfolderBase]: 3902/7674 cut-off events. [2025-03-09 01:22:15,485 INFO L125 PetriNetUnfolderBase]: For 152828/155351 co-relation queries the response was YES. [2025-03-09 01:22:15,535 INFO L83 FinitePrefix]: Finished finitePrefix Result has 44810 conditions, 7674 events. 3902/7674 cut-off events. For 152828/155351 co-relation queries the response was YES. Maximal size of possible extension queue 452. Compared 61444 event pairs, 798 based on Foata normal form. 253/7733 useless extension candidates. Maximal degree in co-relation 44650. Up to 3179 conditions per place. [2025-03-09 01:22:15,565 INFO L140 encePairwiseOnDemand]: 55/66 looper letters, 174 selfloop transitions, 109 changer transitions 26/342 dead transitions. [2025-03-09 01:22:15,565 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 233 places, 342 transitions, 6410 flow [2025-03-09 01:22:15,566 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-09 01:22:15,566 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2025-03-09 01:22:15,566 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 411 transitions. [2025-03-09 01:22:15,566 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6227272727272727 [2025-03-09 01:22:15,566 INFO L175 Difference]: Start difference. First operand has 229 places, 294 transitions, 5255 flow. Second operand 10 states and 411 transitions. [2025-03-09 01:22:15,566 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 233 places, 342 transitions, 6410 flow [2025-03-09 01:22:15,896 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 221 places, 342 transitions, 6134 flow, removed 5 selfloop flow, removed 12 redundant places. [2025-03-09 01:22:15,900 INFO L231 Difference]: Finished difference. Result has 223 places, 283 transitions, 5088 flow [2025-03-09 01:22:15,900 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=66, PETRI_DIFFERENCE_MINUEND_FLOW=4979, PETRI_DIFFERENCE_MINUEND_PLACES=212, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=294, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=108, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=185, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=5088, PETRI_PLACES=223, PETRI_TRANSITIONS=283} [2025-03-09 01:22:15,901 INFO L279 CegarLoopForPetriNet]: 62 programPoint places, 161 predicate places. [2025-03-09 01:22:15,901 INFO L471 AbstractCegarLoop]: Abstraction has has 223 places, 283 transitions, 5088 flow [2025-03-09 01:22:15,901 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 36.22222222222222) internal successors, (326), 9 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-09 01:22:15,901 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 01:22:15,901 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 01:22:15,901 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2025-03-09 01:22:15,901 INFO L396 AbstractCegarLoop]: === Iteration 36 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 37 more)] === [2025-03-09 01:22:15,901 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:22:15,901 INFO L85 PathProgramCache]: Analyzing trace with hash 924590681, now seen corresponding path program 6 times [2025-03-09 01:22:15,902 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:22:15,902 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2080938823] [2025-03-09 01:22:15,902 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-03-09 01:22:15,902 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:22:15,905 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 23 statements into 2 equivalence classes. [2025-03-09 01:22:15,907 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) and asserted 21 of 23 statements. [2025-03-09 01:22:15,908 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) [2025-03-09 01:22:15,908 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:22:15,986 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-09 01:22:15,986 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:22:15,986 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2080938823] [2025-03-09 01:22:15,986 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2080938823] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 01:22:15,986 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 01:22:15,986 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-09 01:22:15,987 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [111477332] [2025-03-09 01:22:15,987 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 01:22:15,987 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-09 01:22:15,987 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:22:15,987 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-09 01:22:15,987 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-03-09 01:22:16,007 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 34 out of 66 [2025-03-09 01:22:16,008 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 223 places, 283 transitions, 5088 flow. Second operand has 7 states, 7 states have (on average 36.857142857142854) internal successors, (258), 7 states have internal predecessors, (258), 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-09 01:22:16,008 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 01:22:16,008 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 34 of 66 [2025-03-09 01:22:16,008 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 01:22:16,923 INFO L124 PetriNetUnfolderBase]: 4004/7934 cut-off events. [2025-03-09 01:22:16,923 INFO L125 PetriNetUnfolderBase]: For 150507/152894 co-relation queries the response was YES. [2025-03-09 01:22:16,990 INFO L83 FinitePrefix]: Finished finitePrefix Result has 47386 conditions, 7934 events. 4004/7934 cut-off events. For 150507/152894 co-relation queries the response was YES. Maximal size of possible extension queue 459. Compared 64340 event pairs, 412 based on Foata normal form. 269/8005 useless extension candidates. Maximal degree in co-relation 47235. Up to 3161 conditions per place. [2025-03-09 01:22:17,021 INFO L140 encePairwiseOnDemand]: 58/66 looper letters, 197 selfloop transitions, 112 changer transitions 36/378 dead transitions. [2025-03-09 01:22:17,022 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 216 places, 378 transitions, 7192 flow [2025-03-09 01:22:17,022 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-09 01:22:17,022 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2025-03-09 01:22:17,022 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 347 transitions. [2025-03-09 01:22:17,022 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6571969696969697 [2025-03-09 01:22:17,022 INFO L175 Difference]: Start difference. First operand has 223 places, 283 transitions, 5088 flow. Second operand 8 states and 347 transitions. [2025-03-09 01:22:17,022 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 216 places, 378 transitions, 7192 flow [2025-03-09 01:22:17,394 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 206 places, 378 transitions, 6702 flow, removed 71 selfloop flow, removed 10 redundant places. [2025-03-09 01:22:17,398 INFO L231 Difference]: Finished difference. Result has 207 places, 274 transitions, 4831 flow [2025-03-09 01:22:17,398 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=66, PETRI_DIFFERENCE_MINUEND_FLOW=4691, PETRI_DIFFERENCE_MINUEND_PLACES=199, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=283, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=102, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=181, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=4831, PETRI_PLACES=207, PETRI_TRANSITIONS=274} [2025-03-09 01:22:17,399 INFO L279 CegarLoopForPetriNet]: 62 programPoint places, 145 predicate places. [2025-03-09 01:22:17,399 INFO L471 AbstractCegarLoop]: Abstraction has has 207 places, 274 transitions, 4831 flow [2025-03-09 01:22:17,399 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 36.857142857142854) internal successors, (258), 7 states have internal predecessors, (258), 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-09 01:22:17,399 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 01:22:17,399 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 01:22:17,399 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35 [2025-03-09 01:22:17,399 INFO L396 AbstractCegarLoop]: === Iteration 37 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 37 more)] === [2025-03-09 01:22:17,400 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:22:17,400 INFO L85 PathProgramCache]: Analyzing trace with hash -825899220, now seen corresponding path program 1 times [2025-03-09 01:22:17,400 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:22:17,400 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1155113258] [2025-03-09 01:22:17,400 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:22:17,400 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:22:17,403 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-03-09 01:22:17,406 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-03-09 01:22:17,406 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:22:17,406 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:22:17,470 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-09 01:22:17,470 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:22:17,470 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1155113258] [2025-03-09 01:22:17,470 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1155113258] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 01:22:17,470 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [554768058] [2025-03-09 01:22:17,470 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:22:17,470 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 01:22:17,470 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 01:22:17,472 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-09 01:22:17,474 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-09 01:22:17,517 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-03-09 01:22:17,531 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-03-09 01:22:17,531 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:22:17,531 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:22:17,532 INFO L256 TraceCheckSpWp]: Trace formula consists of 195 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-03-09 01:22:17,532 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 01:22:17,584 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-09 01:22:17,584 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 01:22:17,636 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 01:22:17,636 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [554768058] provided 1 perfect and 1 imperfect interpolant sequences [2025-03-09 01:22:17,636 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-03-09 01:22:17,636 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [7, 6] total 13 [2025-03-09 01:22:17,636 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [10041929] [2025-03-09 01:22:17,636 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 01:22:17,636 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-09 01:22:17,637 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:22:17,637 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-09 01:22:17,637 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=129, Unknown=0, NotChecked=0, Total=182 [2025-03-09 01:22:17,674 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 32 out of 66 [2025-03-09 01:22:17,674 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 207 places, 274 transitions, 4831 flow. Second operand has 7 states, 7 states have (on average 35.285714285714285) internal successors, (247), 7 states have internal predecessors, (247), 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-09 01:22:17,674 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 01:22:17,674 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 32 of 66 [2025-03-09 01:22:17,674 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 01:22:18,697 INFO L124 PetriNetUnfolderBase]: 4102/8103 cut-off events. [2025-03-09 01:22:18,698 INFO L125 PetriNetUnfolderBase]: For 110554/112477 co-relation queries the response was YES. [2025-03-09 01:22:18,745 INFO L83 FinitePrefix]: Finished finitePrefix Result has 46067 conditions, 8103 events. 4102/8103 cut-off events. For 110554/112477 co-relation queries the response was YES. Maximal size of possible extension queue 417. Compared 65852 event pairs, 1422 based on Foata normal form. 423/8407 useless extension candidates. Maximal degree in co-relation 45936. Up to 3557 conditions per place. [2025-03-09 01:22:18,780 INFO L140 encePairwiseOnDemand]: 57/66 looper letters, 212 selfloop transitions, 56 changer transitions 0/289 dead transitions. [2025-03-09 01:22:18,780 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 197 places, 289 transitions, 5432 flow [2025-03-09 01:22:18,781 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-09 01:22:18,781 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-03-09 01:22:18,781 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 268 transitions. [2025-03-09 01:22:18,781 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5800865800865801 [2025-03-09 01:22:18,781 INFO L175 Difference]: Start difference. First operand has 207 places, 274 transitions, 4831 flow. Second operand 7 states and 268 transitions. [2025-03-09 01:22:18,781 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 197 places, 289 transitions, 5432 flow [2025-03-09 01:22:19,033 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 176 places, 289 transitions, 4708 flow, removed 127 selfloop flow, removed 21 redundant places. [2025-03-09 01:22:19,036 INFO L231 Difference]: Finished difference. Result has 178 places, 237 transitions, 3557 flow [2025-03-09 01:22:19,037 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=66, PETRI_DIFFERENCE_MINUEND_FLOW=3287, PETRI_DIFFERENCE_MINUEND_PLACES=170, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=234, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=53, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=178, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=3557, PETRI_PLACES=178, PETRI_TRANSITIONS=237} [2025-03-09 01:22:19,037 INFO L279 CegarLoopForPetriNet]: 62 programPoint places, 116 predicate places. [2025-03-09 01:22:19,037 INFO L471 AbstractCegarLoop]: Abstraction has has 178 places, 237 transitions, 3557 flow [2025-03-09 01:22:19,038 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 35.285714285714285) internal successors, (247), 7 states have internal predecessors, (247), 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-09 01:22:19,038 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 01:22:19,038 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 01:22:19,044 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-09 01:22:19,238 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36,19 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 01:22:19,238 INFO L396 AbstractCegarLoop]: === Iteration 38 === Targeting thread1Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 37 more)] === [2025-03-09 01:22:19,239 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:22:19,239 INFO L85 PathProgramCache]: Analyzing trace with hash 1223831829, now seen corresponding path program 2 times [2025-03-09 01:22:19,239 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:22:19,239 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [360171739] [2025-03-09 01:22:19,239 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-09 01:22:19,239 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:22:19,244 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 25 statements into 2 equivalence classes. [2025-03-09 01:22:19,248 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 9 of 25 statements. [2025-03-09 01:22:19,249 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-09 01:22:19,249 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:22:19,342 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2025-03-09 01:22:19,342 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:22:19,342 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [360171739] [2025-03-09 01:22:19,342 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [360171739] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 01:22:19,342 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [793006617] [2025-03-09 01:22:19,342 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-09 01:22:19,342 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 01:22:19,342 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 01:22:19,344 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-09 01:22:19,344 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-09 01:22:19,386 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 25 statements into 2 equivalence classes. [2025-03-09 01:22:19,400 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 9 of 25 statements. [2025-03-09 01:22:19,400 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-09 01:22:19,400 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:22:19,401 INFO L256 TraceCheckSpWp]: Trace formula consists of 125 conjuncts, 23 conjuncts are in the unsatisfiable core [2025-03-09 01:22:19,402 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 01:22:19,420 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2025-03-09 01:22:19,594 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2025-03-09 01:22:19,594 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 01:22:19,876 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2025-03-09 01:22:19,877 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [793006617] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-09 01:22:19,877 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-09 01:22:19,877 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 13 [2025-03-09 01:22:19,877 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [867246378] [2025-03-09 01:22:19,877 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-09 01:22:19,877 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-03-09 01:22:19,877 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:22:19,877 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-03-09 01:22:19,877 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=167, Unknown=0, NotChecked=0, Total=210 [2025-03-09 01:22:20,433 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 28 out of 66 [2025-03-09 01:22:20,434 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 178 places, 237 transitions, 3557 flow. Second operand has 15 states, 15 states have (on average 31.133333333333333) internal successors, (467), 15 states have internal predecessors, (467), 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-09 01:22:20,434 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 01:22:20,434 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 28 of 66 [2025-03-09 01:22:20,434 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 01:22:21,623 INFO L124 PetriNetUnfolderBase]: 5613/9947 cut-off events. [2025-03-09 01:22:21,623 INFO L125 PetriNetUnfolderBase]: For 109883/110999 co-relation queries the response was YES. [2025-03-09 01:22:21,660 INFO L83 FinitePrefix]: Finished finitePrefix Result has 56194 conditions, 9947 events. 5613/9947 cut-off events. For 109883/110999 co-relation queries the response was YES. Maximal size of possible extension queue 438. Compared 74771 event pairs, 1310 based on Foata normal form. 218/9936 useless extension candidates. Maximal degree in co-relation 51069. Up to 4173 conditions per place. [2025-03-09 01:22:21,689 INFO L140 encePairwiseOnDemand]: 58/66 looper letters, 286 selfloop transitions, 24 changer transitions 0/333 dead transitions. [2025-03-09 01:22:21,689 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 183 places, 333 transitions, 5927 flow [2025-03-09 01:22:21,689 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-09 01:22:21,689 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-03-09 01:22:21,689 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 250 transitions. [2025-03-09 01:22:21,690 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5411255411255411 [2025-03-09 01:22:21,690 INFO L175 Difference]: Start difference. First operand has 178 places, 237 transitions, 3557 flow. Second operand 7 states and 250 transitions. [2025-03-09 01:22:21,690 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 183 places, 333 transitions, 5927 flow [2025-03-09 01:22:21,896 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 176 places, 333 transitions, 5725 flow, removed 17 selfloop flow, removed 7 redundant places. [2025-03-09 01:22:21,899 INFO L231 Difference]: Finished difference. Result has 176 places, 236 transitions, 3449 flow [2025-03-09 01:22:21,899 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=66, PETRI_DIFFERENCE_MINUEND_FLOW=3401, PETRI_DIFFERENCE_MINUEND_PLACES=170, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=236, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=24, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=212, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=3449, PETRI_PLACES=176, PETRI_TRANSITIONS=236} [2025-03-09 01:22:21,899 INFO L279 CegarLoopForPetriNet]: 62 programPoint places, 114 predicate places. [2025-03-09 01:22:21,900 INFO L471 AbstractCegarLoop]: Abstraction has has 176 places, 236 transitions, 3449 flow [2025-03-09 01:22:21,900 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 31.133333333333333) internal successors, (467), 15 states have internal predecessors, (467), 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-09 01:22:21,900 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 01:22:21,900 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 01:22:21,905 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Ended with exit code 0 [2025-03-09 01:22:22,100 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable37,20 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 01:22:22,100 INFO L396 AbstractCegarLoop]: === Iteration 39 === Targeting thread2Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 37 more)] === [2025-03-09 01:22:22,101 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:22:22,101 INFO L85 PathProgramCache]: Analyzing trace with hash 53632681, now seen corresponding path program 2 times [2025-03-09 01:22:22,101 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:22:22,101 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1272253864] [2025-03-09 01:22:22,101 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-09 01:22:22,101 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:22:22,105 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 27 statements into 2 equivalence classes. [2025-03-09 01:22:22,110 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 11 of 27 statements. [2025-03-09 01:22:22,110 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-09 01:22:22,110 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:22:22,208 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2025-03-09 01:22:22,208 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:22:22,208 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1272253864] [2025-03-09 01:22:22,208 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1272253864] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 01:22:22,208 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [150262652] [2025-03-09 01:22:22,208 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-09 01:22:22,208 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 01:22:22,208 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 01:22:22,210 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-09 01:22:22,211 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-09 01:22:22,257 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 27 statements into 2 equivalence classes. [2025-03-09 01:22:22,306 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 11 of 27 statements. [2025-03-09 01:22:22,306 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-09 01:22:22,306 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:22:22,307 INFO L256 TraceCheckSpWp]: Trace formula consists of 141 conjuncts, 26 conjuncts are in the unsatisfiable core [2025-03-09 01:22:22,308 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 01:22:22,317 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-09 01:22:22,321 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2025-03-09 01:22:22,371 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-09 01:22:22,371 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 13 [2025-03-09 01:22:22,376 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-03-09 01:22:22,376 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2025-03-09 01:22:22,561 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2025-03-09 01:22:22,561 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 01:22:22,821 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2025-03-09 01:22:22,822 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [150262652] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-09 01:22:22,822 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-09 01:22:22,822 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 14 [2025-03-09 01:22:22,822 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [590335575] [2025-03-09 01:22:22,822 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-09 01:22:22,822 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2025-03-09 01:22:22,822 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:22:22,822 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2025-03-09 01:22:22,823 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=198, Unknown=0, NotChecked=0, Total=240 [2025-03-09 01:22:23,604 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 26 out of 66 [2025-03-09 01:22:23,604 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 176 places, 236 transitions, 3449 flow. Second operand has 16 states, 16 states have (on average 29.5) internal successors, (472), 16 states have internal predecessors, (472), 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-09 01:22:23,604 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 01:22:23,604 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 26 of 66 [2025-03-09 01:22:23,604 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 01:22:24,663 INFO L124 PetriNetUnfolderBase]: 5602/9592 cut-off events. [2025-03-09 01:22:24,663 INFO L125 PetriNetUnfolderBase]: For 95824/98129 co-relation queries the response was YES. [2025-03-09 01:22:24,724 INFO L83 FinitePrefix]: Finished finitePrefix Result has 53761 conditions, 9592 events. 5602/9592 cut-off events. For 95824/98129 co-relation queries the response was YES. Maximal size of possible extension queue 456. Compared 70203 event pairs, 1242 based on Foata normal form. 371/9816 useless extension candidates. Maximal degree in co-relation 49953. Up to 4491 conditions per place. [2025-03-09 01:22:24,761 INFO L140 encePairwiseOnDemand]: 58/66 looper letters, 290 selfloop transitions, 45 changer transitions 0/348 dead transitions. [2025-03-09 01:22:24,762 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 181 places, 348 transitions, 6065 flow [2025-03-09 01:22:24,762 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-09 01:22:24,762 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-03-09 01:22:24,762 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 234 transitions. [2025-03-09 01:22:24,763 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5064935064935064 [2025-03-09 01:22:24,763 INFO L175 Difference]: Start difference. First operand has 176 places, 236 transitions, 3449 flow. Second operand 7 states and 234 transitions. [2025-03-09 01:22:24,763 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 181 places, 348 transitions, 6065 flow [2025-03-09 01:22:24,987 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 174 places, 348 transitions, 5951 flow, removed 0 selfloop flow, removed 7 redundant places. [2025-03-09 01:22:24,990 INFO L231 Difference]: Finished difference. Result has 174 places, 235 transitions, 3443 flow [2025-03-09 01:22:24,991 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=66, PETRI_DIFFERENCE_MINUEND_FLOW=3353, PETRI_DIFFERENCE_MINUEND_PLACES=168, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=235, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=45, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=190, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=3443, PETRI_PLACES=174, PETRI_TRANSITIONS=235} [2025-03-09 01:22:24,992 INFO L279 CegarLoopForPetriNet]: 62 programPoint places, 112 predicate places. [2025-03-09 01:22:24,992 INFO L471 AbstractCegarLoop]: Abstraction has has 174 places, 235 transitions, 3443 flow [2025-03-09 01:22:24,992 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 29.5) internal successors, (472), 16 states have internal predecessors, (472), 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-09 01:22:24,992 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 01:22:24,992 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 01:22:24,998 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-09 01:22:25,192 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,SelfDestructingSolverStorable38 [2025-03-09 01:22:25,193 INFO L396 AbstractCegarLoop]: === Iteration 40 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 37 more)] === [2025-03-09 01:22:25,193 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:22:25,193 INFO L85 PathProgramCache]: Analyzing trace with hash 2110786823, now seen corresponding path program 1 times [2025-03-09 01:22:25,193 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:22:25,193 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1485613155] [2025-03-09 01:22:25,193 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:22:25,193 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:22:25,198 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 29 statements into 1 equivalence classes. [2025-03-09 01:22:25,201 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 29 of 29 statements. [2025-03-09 01:22:25,201 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:22:25,201 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:22:25,281 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-09 01:22:25,281 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:22:25,281 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1485613155] [2025-03-09 01:22:25,281 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1485613155] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 01:22:25,281 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1741040604] [2025-03-09 01:22:25,281 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:22:25,281 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 01:22:25,282 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 01:22:25,283 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-09 01:22:25,285 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-09 01:22:25,332 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 29 statements into 1 equivalence classes. [2025-03-09 01:22:25,346 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 29 of 29 statements. [2025-03-09 01:22:25,346 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:22:25,346 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:22:25,347 INFO L256 TraceCheckSpWp]: Trace formula consists of 213 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-03-09 01:22:25,348 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 01:22:25,400 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-09 01:22:25,400 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 01:22:25,441 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-09 01:22:25,441 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1741040604] provided 1 perfect and 1 imperfect interpolant sequences [2025-03-09 01:22:25,441 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-03-09 01:22:25,441 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [7, 6] total 13 [2025-03-09 01:22:25,441 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [427199689] [2025-03-09 01:22:25,441 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 01:22:25,441 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-09 01:22:25,442 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:22:25,442 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-09 01:22:25,442 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=127, Unknown=0, NotChecked=0, Total=182 [2025-03-09 01:22:25,476 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 32 out of 66 [2025-03-09 01:22:25,477 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 174 places, 235 transitions, 3443 flow. Second operand has 7 states, 7 states have (on average 35.42857142857143) internal successors, (248), 7 states have internal predecessors, (248), 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-09 01:22:25,477 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 01:22:25,477 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 32 of 66 [2025-03-09 01:22:25,477 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 01:22:26,203 INFO L124 PetriNetUnfolderBase]: 4178/8194 cut-off events. [2025-03-09 01:22:26,203 INFO L125 PetriNetUnfolderBase]: For 80735/81735 co-relation queries the response was YES. [2025-03-09 01:22:26,256 INFO L83 FinitePrefix]: Finished finitePrefix Result has 43169 conditions, 8194 events. 4178/8194 cut-off events. For 80735/81735 co-relation queries the response was YES. Maximal size of possible extension queue 400. Compared 65361 event pairs, 1456 based on Foata normal form. 258/8296 useless extension candidates. Maximal degree in co-relation 39335. Up to 3932 conditions per place. [2025-03-09 01:22:26,292 INFO L140 encePairwiseOnDemand]: 57/66 looper letters, 208 selfloop transitions, 28 changer transitions 0/264 dead transitions. [2025-03-09 01:22:26,292 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 180 places, 264 transitions, 4291 flow [2025-03-09 01:22:26,292 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-09 01:22:26,292 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-03-09 01:22:26,293 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 269 transitions. [2025-03-09 01:22:26,293 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5822510822510822 [2025-03-09 01:22:26,293 INFO L175 Difference]: Start difference. First operand has 174 places, 235 transitions, 3443 flow. Second operand 7 states and 269 transitions. [2025-03-09 01:22:26,293 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 180 places, 264 transitions, 4291 flow [2025-03-09 01:22:26,558 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 174 places, 264 transitions, 4204 flow, removed 0 selfloop flow, removed 6 redundant places. [2025-03-09 01:22:26,561 INFO L231 Difference]: Finished difference. Result has 176 places, 212 transitions, 2964 flow [2025-03-09 01:22:26,561 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=66, PETRI_DIFFERENCE_MINUEND_FLOW=2846, PETRI_DIFFERENCE_MINUEND_PLACES=168, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=211, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=27, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=183, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=2964, PETRI_PLACES=176, PETRI_TRANSITIONS=212} [2025-03-09 01:22:26,561 INFO L279 CegarLoopForPetriNet]: 62 programPoint places, 114 predicate places. [2025-03-09 01:22:26,561 INFO L471 AbstractCegarLoop]: Abstraction has has 176 places, 212 transitions, 2964 flow [2025-03-09 01:22:26,561 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 35.42857142857143) internal successors, (248), 7 states have internal predecessors, (248), 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-09 01:22:26,561 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 01:22:26,562 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 01:22:26,568 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Ended with exit code 0 [2025-03-09 01:22:26,762 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 22 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable39 [2025-03-09 01:22:26,762 INFO L396 AbstractCegarLoop]: === Iteration 41 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 37 more)] === [2025-03-09 01:22:26,762 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:22:26,763 INFO L85 PathProgramCache]: Analyzing trace with hash -1035306123, now seen corresponding path program 1 times [2025-03-09 01:22:26,763 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:22:26,763 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1068472874] [2025-03-09 01:22:26,763 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:22:26,763 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:22:26,766 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 33 statements into 1 equivalence classes. [2025-03-09 01:22:26,771 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 33 of 33 statements. [2025-03-09 01:22:26,771 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:22:26,771 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:22:26,977 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-09 01:22:26,977 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:22:26,977 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1068472874] [2025-03-09 01:22:26,977 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1068472874] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 01:22:26,977 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [955495366] [2025-03-09 01:22:26,977 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:22:26,977 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 01:22:26,977 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 01:22:26,979 INFO L229 MonitoredProcess]: Starting monitored process 23 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-09 01:22:26,980 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Waiting until timeout for monitored process [2025-03-09 01:22:27,023 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 33 statements into 1 equivalence classes. [2025-03-09 01:22:27,039 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 33 of 33 statements. [2025-03-09 01:22:27,039 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:22:27,039 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:22:27,040 INFO L256 TraceCheckSpWp]: Trace formula consists of 231 conjuncts, 29 conjuncts are in the unsatisfiable core [2025-03-09 01:22:27,041 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 01:22:27,303 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-09 01:22:27,303 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 01:22:27,735 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-09 01:22:27,735 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [955495366] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-09 01:22:27,735 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-09 01:22:27,735 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 12, 12] total 34 [2025-03-09 01:22:27,735 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2046884145] [2025-03-09 01:22:27,735 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-09 01:22:27,736 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2025-03-09 01:22:27,736 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:22:27,737 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2025-03-09 01:22:27,737 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=239, Invalid=951, Unknown=0, NotChecked=0, Total=1190 [2025-03-09 01:22:28,043 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 32 out of 66 [2025-03-09 01:22:28,044 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 176 places, 212 transitions, 2964 flow. Second operand has 35 states, 35 states have (on average 34.05714285714286) internal successors, (1192), 35 states have internal predecessors, (1192), 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-09 01:22:28,044 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 01:22:28,044 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 32 of 66 [2025-03-09 01:22:28,044 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 01:22:29,520 INFO L124 PetriNetUnfolderBase]: 4930/9545 cut-off events. [2025-03-09 01:22:29,521 INFO L125 PetriNetUnfolderBase]: For 111549/112860 co-relation queries the response was YES. [2025-03-09 01:22:29,570 INFO L83 FinitePrefix]: Finished finitePrefix Result has 51502 conditions, 9545 events. 4930/9545 cut-off events. For 111549/112860 co-relation queries the response was YES. Maximal size of possible extension queue 491. Compared 78348 event pairs, 1441 based on Foata normal form. 140/9471 useless extension candidates. Maximal degree in co-relation 46851. Up to 3692 conditions per place. [2025-03-09 01:22:29,600 INFO L140 encePairwiseOnDemand]: 50/66 looper letters, 273 selfloop transitions, 108 changer transitions 5/414 dead transitions. [2025-03-09 01:22:29,600 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 201 places, 414 transitions, 5751 flow [2025-03-09 01:22:29,601 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2025-03-09 01:22:29,601 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2025-03-09 01:22:29,601 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 1028 transitions. [2025-03-09 01:22:29,602 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5990675990675991 [2025-03-09 01:22:29,602 INFO L175 Difference]: Start difference. First operand has 176 places, 212 transitions, 2964 flow. Second operand 26 states and 1028 transitions. [2025-03-09 01:22:29,602 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 201 places, 414 transitions, 5751 flow [2025-03-09 01:22:29,890 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 196 places, 414 transitions, 5678 flow, removed 10 selfloop flow, removed 5 redundant places. [2025-03-09 01:22:29,894 INFO L231 Difference]: Finished difference. Result has 204 places, 259 transitions, 3875 flow [2025-03-09 01:22:29,894 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=66, PETRI_DIFFERENCE_MINUEND_FLOW=2922, PETRI_DIFFERENCE_MINUEND_PLACES=171, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=212, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=60, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=137, PETRI_DIFFERENCE_SUBTRAHEND_STATES=26, PETRI_FLOW=3875, PETRI_PLACES=204, PETRI_TRANSITIONS=259} [2025-03-09 01:22:29,894 INFO L279 CegarLoopForPetriNet]: 62 programPoint places, 142 predicate places. [2025-03-09 01:22:29,894 INFO L471 AbstractCegarLoop]: Abstraction has has 204 places, 259 transitions, 3875 flow [2025-03-09 01:22:29,895 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 35 states, 35 states have (on average 34.05714285714286) internal successors, (1192), 35 states have internal predecessors, (1192), 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-09 01:22:29,895 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 01:22:29,895 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 01:22:29,900 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Ended with exit code 0 [2025-03-09 01:22:30,095 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable40,23 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 01:22:30,095 INFO L396 AbstractCegarLoop]: === Iteration 42 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 37 more)] === [2025-03-09 01:22:30,096 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:22:30,096 INFO L85 PathProgramCache]: Analyzing trace with hash -765781971, now seen corresponding path program 1 times [2025-03-09 01:22:30,096 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:22:30,096 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [638971032] [2025-03-09 01:22:30,096 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:22:30,096 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:22:30,100 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 34 statements into 1 equivalence classes. [2025-03-09 01:22:30,109 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 34 of 34 statements. [2025-03-09 01:22:30,110 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:22:30,110 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:22:30,296 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-09 01:22:30,296 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:22:30,296 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [638971032] [2025-03-09 01:22:30,296 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [638971032] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 01:22:30,296 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1580532558] [2025-03-09 01:22:30,296 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:22:30,296 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 01:22:30,296 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 01:22:30,300 INFO L229 MonitoredProcess]: Starting monitored process 24 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-09 01:22:30,301 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Waiting until timeout for monitored process [2025-03-09 01:22:30,345 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 34 statements into 1 equivalence classes. [2025-03-09 01:22:30,361 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 34 of 34 statements. [2025-03-09 01:22:30,361 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:22:30,361 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:22:30,362 INFO L256 TraceCheckSpWp]: Trace formula consists of 241 conjuncts, 15 conjuncts are in the unsatisfiable core [2025-03-09 01:22:30,363 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 01:22:30,428 INFO L349 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2025-03-09 01:22:30,428 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 26 treesize of output 10 [2025-03-09 01:22:30,439 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-09 01:22:30,439 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 01:22:30,529 INFO L349 Elim1Store]: treesize reduction 28, result has 59.4 percent of original size [2025-03-09 01:22:30,530 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 32 treesize of output 48 [2025-03-09 01:22:30,543 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-09 01:22:30,543 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1580532558] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-09 01:22:30,543 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-09 01:22:30,544 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 9, 9] total 23 [2025-03-09 01:22:30,544 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [344273861] [2025-03-09 01:22:30,544 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-09 01:22:30,544 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2025-03-09 01:22:30,544 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:22:30,544 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2025-03-09 01:22:30,544 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=72, Invalid=434, Unknown=0, NotChecked=0, Total=506 [2025-03-09 01:22:31,729 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 30 out of 66 [2025-03-09 01:22:31,730 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 204 places, 259 transitions, 3875 flow. Second operand has 23 states, 23 states have (on average 32.43478260869565) internal successors, (746), 23 states have internal predecessors, (746), 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-09 01:22:31,730 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 01:22:31,730 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 30 of 66 [2025-03-09 01:22:31,730 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 01:22:33,935 INFO L124 PetriNetUnfolderBase]: 7231/13608 cut-off events. [2025-03-09 01:22:33,935 INFO L125 PetriNetUnfolderBase]: For 128656/128676 co-relation queries the response was YES. [2025-03-09 01:22:34,039 INFO L83 FinitePrefix]: Finished finitePrefix Result has 72471 conditions, 13608 events. 7231/13608 cut-off events. For 128656/128676 co-relation queries the response was YES. Maximal size of possible extension queue 501. Compared 108833 event pairs, 950 based on Foata normal form. 115/13716 useless extension candidates. Maximal degree in co-relation 70386. Up to 5572 conditions per place. [2025-03-09 01:22:34,088 INFO L140 encePairwiseOnDemand]: 52/66 looper letters, 512 selfloop transitions, 52 changer transitions 23/608 dead transitions. [2025-03-09 01:22:34,088 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 215 places, 608 transitions, 10735 flow [2025-03-09 01:22:34,089 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-09 01:22:34,089 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2025-03-09 01:22:34,091 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 483 transitions. [2025-03-09 01:22:34,091 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6098484848484849 [2025-03-09 01:22:34,091 INFO L175 Difference]: Start difference. First operand has 204 places, 259 transitions, 3875 flow. Second operand 12 states and 483 transitions. [2025-03-09 01:22:34,091 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 215 places, 608 transitions, 10735 flow [2025-03-09 01:22:34,501 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 206 places, 608 transitions, 10598 flow, removed 2 selfloop flow, removed 9 redundant places. [2025-03-09 01:22:34,506 INFO L231 Difference]: Finished difference. Result has 211 places, 274 transitions, 4285 flow [2025-03-09 01:22:34,507 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=66, PETRI_DIFFERENCE_MINUEND_FLOW=3816, PETRI_DIFFERENCE_MINUEND_PLACES=195, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=259, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=33, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=207, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=4285, PETRI_PLACES=211, PETRI_TRANSITIONS=274} [2025-03-09 01:22:34,507 INFO L279 CegarLoopForPetriNet]: 62 programPoint places, 149 predicate places. [2025-03-09 01:22:34,507 INFO L471 AbstractCegarLoop]: Abstraction has has 211 places, 274 transitions, 4285 flow [2025-03-09 01:22:34,507 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 32.43478260869565) internal successors, (746), 23 states have internal predecessors, (746), 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-09 01:22:34,507 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 01:22:34,507 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 01:22:34,513 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Ended with exit code 0 [2025-03-09 01:22:34,708 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable41,24 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 01:22:34,708 INFO L396 AbstractCegarLoop]: === Iteration 43 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 37 more)] === [2025-03-09 01:22:34,708 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:22:34,708 INFO L85 PathProgramCache]: Analyzing trace with hash -738884431, now seen corresponding path program 1 times [2025-03-09 01:22:34,709 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:22:34,709 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2110275722] [2025-03-09 01:22:34,709 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:22:34,709 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:22:34,714 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 34 statements into 1 equivalence classes. [2025-03-09 01:22:34,720 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 34 of 34 statements. [2025-03-09 01:22:34,720 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:22:34,720 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:22:34,903 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-09 01:22:34,904 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:22:34,904 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2110275722] [2025-03-09 01:22:34,904 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2110275722] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 01:22:34,904 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 01:22:34,904 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2025-03-09 01:22:34,904 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1170349221] [2025-03-09 01:22:34,904 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 01:22:34,904 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-03-09 01:22:34,904 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:22:34,905 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-03-09 01:22:34,905 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=119, Unknown=0, NotChecked=0, Total=156 [2025-03-09 01:22:35,183 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 30 out of 66 [2025-03-09 01:22:35,183 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 211 places, 274 transitions, 4285 flow. Second operand has 13 states, 13 states have (on average 32.23076923076923) internal successors, (419), 13 states have internal predecessors, (419), 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-09 01:22:35,183 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 01:22:35,183 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 30 of 66 [2025-03-09 01:22:35,183 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 01:22:36,896 INFO L124 PetriNetUnfolderBase]: 7528/14115 cut-off events. [2025-03-09 01:22:36,896 INFO L125 PetriNetUnfolderBase]: For 152078/152106 co-relation queries the response was YES. [2025-03-09 01:22:36,995 INFO L83 FinitePrefix]: Finished finitePrefix Result has 78851 conditions, 14115 events. 7528/14115 cut-off events. For 152078/152106 co-relation queries the response was YES. Maximal size of possible extension queue 560. Compared 113547 event pairs, 3147 based on Foata normal form. 63/14149 useless extension candidates. Maximal degree in co-relation 76545. Up to 8054 conditions per place. [2025-03-09 01:22:37,043 INFO L140 encePairwiseOnDemand]: 52/66 looper letters, 505 selfloop transitions, 66 changer transitions 0/592 dead transitions. [2025-03-09 01:22:37,043 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 224 places, 592 transitions, 10661 flow [2025-03-09 01:22:37,044 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-03-09 01:22:37,044 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2025-03-09 01:22:37,044 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 536 transitions. [2025-03-09 01:22:37,044 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5800865800865801 [2025-03-09 01:22:37,044 INFO L175 Difference]: Start difference. First operand has 211 places, 274 transitions, 4285 flow. Second operand 14 states and 536 transitions. [2025-03-09 01:22:37,044 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 224 places, 592 transitions, 10661 flow [2025-03-09 01:22:37,449 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 218 places, 592 transitions, 10502 flow, removed 16 selfloop flow, removed 6 redundant places. [2025-03-09 01:22:37,455 INFO L231 Difference]: Finished difference. Result has 225 places, 310 transitions, 5037 flow [2025-03-09 01:22:37,455 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=66, PETRI_DIFFERENCE_MINUEND_FLOW=4162, PETRI_DIFFERENCE_MINUEND_PLACES=205, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=274, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=30, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=228, PETRI_DIFFERENCE_SUBTRAHEND_STATES=14, PETRI_FLOW=5037, PETRI_PLACES=225, PETRI_TRANSITIONS=310} [2025-03-09 01:22:37,456 INFO L279 CegarLoopForPetriNet]: 62 programPoint places, 163 predicate places. [2025-03-09 01:22:37,456 INFO L471 AbstractCegarLoop]: Abstraction has has 225 places, 310 transitions, 5037 flow [2025-03-09 01:22:37,456 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 32.23076923076923) internal successors, (419), 13 states have internal predecessors, (419), 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-09 01:22:37,456 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 01:22:37,456 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 01:22:37,456 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable42 [2025-03-09 01:22:37,456 INFO L396 AbstractCegarLoop]: === Iteration 44 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 37 more)] === [2025-03-09 01:22:37,457 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:22:37,457 INFO L85 PathProgramCache]: Analyzing trace with hash 917834097, now seen corresponding path program 2 times [2025-03-09 01:22:37,457 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:22:37,457 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [952370188] [2025-03-09 01:22:37,457 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-09 01:22:37,457 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:22:37,463 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 34 statements into 2 equivalence classes. [2025-03-09 01:22:37,472 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 34 of 34 statements. [2025-03-09 01:22:37,472 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-09 01:22:37,473 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:22:37,751 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-09 01:22:37,751 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:22:37,751 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [952370188] [2025-03-09 01:22:37,751 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [952370188] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 01:22:37,751 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 01:22:37,751 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2025-03-09 01:22:37,751 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1570993533] [2025-03-09 01:22:37,751 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 01:22:37,752 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-03-09 01:22:37,752 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:22:37,752 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-03-09 01:22:37,752 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=117, Unknown=0, NotChecked=0, Total=156 [2025-03-09 01:22:38,043 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 30 out of 66 [2025-03-09 01:22:38,043 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 225 places, 310 transitions, 5037 flow. Second operand has 13 states, 13 states have (on average 32.23076923076923) internal successors, (419), 13 states have internal predecessors, (419), 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-09 01:22:38,043 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 01:22:38,043 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 30 of 66 [2025-03-09 01:22:38,043 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 01:22:40,178 INFO L124 PetriNetUnfolderBase]: 9206/17131 cut-off events. [2025-03-09 01:22:40,178 INFO L125 PetriNetUnfolderBase]: For 212068/212100 co-relation queries the response was YES. [2025-03-09 01:22:40,277 INFO L83 FinitePrefix]: Finished finitePrefix Result has 102873 conditions, 17131 events. 9206/17131 cut-off events. For 212068/212100 co-relation queries the response was YES. Maximal size of possible extension queue 708. Compared 141672 event pairs, 3654 based on Foata normal form. 67/17147 useless extension candidates. Maximal degree in co-relation 99420. Up to 8567 conditions per place. [2025-03-09 01:22:40,341 INFO L140 encePairwiseOnDemand]: 52/66 looper letters, 393 selfloop transitions, 152 changer transitions 0/566 dead transitions. [2025-03-09 01:22:40,341 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 238 places, 566 transitions, 10527 flow [2025-03-09 01:22:40,342 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-03-09 01:22:40,342 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2025-03-09 01:22:40,342 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 536 transitions. [2025-03-09 01:22:40,342 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5800865800865801 [2025-03-09 01:22:40,342 INFO L175 Difference]: Start difference. First operand has 225 places, 310 transitions, 5037 flow. Second operand 14 states and 536 transitions. [2025-03-09 01:22:40,342 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 238 places, 566 transitions, 10527 flow [2025-03-09 01:22:41,026 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 231 places, 566 transitions, 10261 flow, removed 35 selfloop flow, removed 7 redundant places. [2025-03-09 01:22:41,034 INFO L231 Difference]: Finished difference. Result has 241 places, 420 transitions, 7855 flow [2025-03-09 01:22:41,034 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=66, PETRI_DIFFERENCE_MINUEND_FLOW=4864, PETRI_DIFFERENCE_MINUEND_PLACES=218, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=310, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=66, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=232, PETRI_DIFFERENCE_SUBTRAHEND_STATES=14, PETRI_FLOW=7855, PETRI_PLACES=241, PETRI_TRANSITIONS=420} [2025-03-09 01:22:41,034 INFO L279 CegarLoopForPetriNet]: 62 programPoint places, 179 predicate places. [2025-03-09 01:22:41,034 INFO L471 AbstractCegarLoop]: Abstraction has has 241 places, 420 transitions, 7855 flow [2025-03-09 01:22:41,035 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 32.23076923076923) internal successors, (419), 13 states have internal predecessors, (419), 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-09 01:22:41,035 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 01:22:41,035 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 01:22:41,035 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable43 [2025-03-09 01:22:41,035 INFO L396 AbstractCegarLoop]: === Iteration 45 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 37 more)] === [2025-03-09 01:22:41,035 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:22:41,035 INFO L85 PathProgramCache]: Analyzing trace with hash 871508651, now seen corresponding path program 3 times [2025-03-09 01:22:41,035 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:22:41,035 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [746502492] [2025-03-09 01:22:41,035 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-09 01:22:41,035 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:22:41,039 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 34 statements into 2 equivalence classes. [2025-03-09 01:22:41,073 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 34 of 34 statements. [2025-03-09 01:22:41,073 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-03-09 01:22:41,073 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:22:41,387 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-09 01:22:41,387 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:22:41,387 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [746502492] [2025-03-09 01:22:41,387 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [746502492] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 01:22:41,387 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1757160447] [2025-03-09 01:22:41,387 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-09 01:22:41,388 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 01:22:41,388 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 01:22:41,390 INFO L229 MonitoredProcess]: Starting monitored process 25 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-09 01:22:41,392 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (25)] Waiting until timeout for monitored process [2025-03-09 01:22:41,459 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 34 statements into 2 equivalence classes. [2025-03-09 01:22:41,483 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 34 of 34 statements. [2025-03-09 01:22:41,483 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-03-09 01:22:41,483 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:22:41,488 INFO L256 TraceCheckSpWp]: Trace formula consists of 241 conjuncts, 25 conjuncts are in the unsatisfiable core [2025-03-09 01:22:41,490 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 01:22:41,635 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-09 01:22:41,635 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 29 treesize of output 21 [2025-03-09 01:22:41,656 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-09 01:22:41,657 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 01:22:41,753 INFO L349 Elim1Store]: treesize reduction 28, result has 59.4 percent of original size [2025-03-09 01:22:41,753 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 32 treesize of output 48 [2025-03-09 01:22:41,771 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-09 01:22:41,771 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1757160447] provided 1 perfect and 1 imperfect interpolant sequences [2025-03-09 01:22:41,771 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-03-09 01:22:41,771 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [11, 11] total 27 [2025-03-09 01:22:41,772 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [922591446] [2025-03-09 01:22:41,772 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 01:22:41,772 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-09 01:22:41,772 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:22:41,772 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-09 01:22:41,772 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=116, Invalid=586, Unknown=0, NotChecked=0, Total=702 [2025-03-09 01:22:41,984 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 30 out of 66 [2025-03-09 01:22:41,984 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 241 places, 420 transitions, 7855 flow. Second operand has 9 states, 9 states have (on average 33.22222222222222) internal successors, (299), 9 states have internal predecessors, (299), 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-09 01:22:41,984 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 01:22:41,984 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 30 of 66 [2025-03-09 01:22:41,984 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 01:22:45,411 INFO L124 PetriNetUnfolderBase]: 10348/19197 cut-off events. [2025-03-09 01:22:45,412 INFO L125 PetriNetUnfolderBase]: For 268785/268817 co-relation queries the response was YES. [2025-03-09 01:22:45,559 INFO L83 FinitePrefix]: Finished finitePrefix Result has 122822 conditions, 19197 events. 10348/19197 cut-off events. For 268785/268817 co-relation queries the response was YES. Maximal size of possible extension queue 810. Compared 162326 event pairs, 2835 based on Foata normal form. 108/19274 useless extension candidates. Maximal degree in co-relation 118789. Up to 7473 conditions per place. [2025-03-09 01:22:45,629 INFO L140 encePairwiseOnDemand]: 54/66 looper letters, 727 selfloop transitions, 178 changer transitions 9/935 dead transitions. [2025-03-09 01:22:45,629 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 259 places, 935 transitions, 19105 flow [2025-03-09 01:22:45,629 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2025-03-09 01:22:45,629 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2025-03-09 01:22:45,630 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 749 transitions. [2025-03-09 01:22:45,630 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5972886762360446 [2025-03-09 01:22:45,630 INFO L175 Difference]: Start difference. First operand has 241 places, 420 transitions, 7855 flow. Second operand 19 states and 749 transitions. [2025-03-09 01:22:45,630 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 259 places, 935 transitions, 19105 flow [2025-03-09 01:22:46,797 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 257 places, 935 transitions, 18799 flow, removed 149 selfloop flow, removed 2 redundant places. [2025-03-09 01:22:46,807 INFO L231 Difference]: Finished difference. Result has 267 places, 505 transitions, 10218 flow [2025-03-09 01:22:46,807 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=66, PETRI_DIFFERENCE_MINUEND_FLOW=7659, PETRI_DIFFERENCE_MINUEND_PLACES=239, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=420, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=93, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=295, PETRI_DIFFERENCE_SUBTRAHEND_STATES=19, PETRI_FLOW=10218, PETRI_PLACES=267, PETRI_TRANSITIONS=505} [2025-03-09 01:22:46,809 INFO L279 CegarLoopForPetriNet]: 62 programPoint places, 205 predicate places. [2025-03-09 01:22:46,809 INFO L471 AbstractCegarLoop]: Abstraction has has 267 places, 505 transitions, 10218 flow [2025-03-09 01:22:46,809 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 33.22222222222222) internal successors, (299), 9 states have internal predecessors, (299), 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-09 01:22:46,809 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 01:22:46,809 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 01:22:46,815 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (25)] Ended with exit code 0 [2025-03-09 01:22:47,014 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable44,25 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 01:22:47,014 INFO L396 AbstractCegarLoop]: === Iteration 46 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 37 more)] === [2025-03-09 01:22:47,014 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:22:47,015 INFO L85 PathProgramCache]: Analyzing trace with hash 1432637829, now seen corresponding path program 4 times [2025-03-09 01:22:47,015 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:22:47,015 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1465477566] [2025-03-09 01:22:47,015 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-09 01:22:47,015 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:22:47,021 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 34 statements into 2 equivalence classes. [2025-03-09 01:22:47,024 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) and asserted 28 of 34 statements. [2025-03-09 01:22:47,025 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) [2025-03-09 01:22:47,025 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:22:47,088 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-09 01:22:47,089 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:22:47,089 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1465477566] [2025-03-09 01:22:47,089 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1465477566] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 01:22:47,089 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1666775212] [2025-03-09 01:22:47,089 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-09 01:22:47,089 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 01:22:47,089 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 01:22:47,091 INFO L229 MonitoredProcess]: Starting monitored process 26 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-09 01:22:47,092 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (26)] Waiting until timeout for monitored process [2025-03-09 01:22:47,136 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 34 statements into 2 equivalence classes. [2025-03-09 01:22:47,146 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) and asserted 28 of 34 statements. [2025-03-09 01:22:47,146 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) [2025-03-09 01:22:47,147 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:22:47,147 INFO L256 TraceCheckSpWp]: Trace formula consists of 152 conjuncts, 15 conjuncts are in the unsatisfiable core [2025-03-09 01:22:47,148 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 01:22:47,180 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-09 01:22:47,184 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-09 01:22:47,185 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 01:22:47,256 INFO L349 Elim1Store]: treesize reduction 28, result has 63.6 percent of original size [2025-03-09 01:22:47,257 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 40 treesize of output 56 [2025-03-09 01:22:47,272 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-09 01:22:47,272 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1666775212] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-09 01:22:47,272 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-09 01:22:47,272 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 16 [2025-03-09 01:22:47,273 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1530788011] [2025-03-09 01:22:47,273 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-09 01:22:47,273 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2025-03-09 01:22:47,273 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:22:47,273 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2025-03-09 01:22:47,273 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=188, Unknown=0, NotChecked=0, Total=240 [2025-03-09 01:22:47,708 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 30 out of 66 [2025-03-09 01:22:47,708 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 267 places, 505 transitions, 10218 flow. Second operand has 16 states, 16 states have (on average 32.4375) internal successors, (519), 16 states have internal predecessors, (519), 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-09 01:22:47,708 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 01:22:47,708 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 30 of 66 [2025-03-09 01:22:47,708 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand