./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/weaver/popl20-counter-fun.wvr.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 798a7b37 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../sv-benchmarks/c/weaver/popl20-counter-fun.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 fbe9f324c9eba6beb8c990e3f85f0b00a68548fe05ffdb4e97bc061354d1cdf2 --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-04 10:11:32,665 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-04 10:11:32,721 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2025-03-04 10:11:32,728 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-04 10:11:32,728 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-04 10:11:32,752 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-04 10:11:32,753 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-04 10:11:32,753 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-04 10:11:32,753 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-04 10:11:32,753 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-04 10:11:32,753 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-04 10:11:32,754 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-04 10:11:32,754 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-04 10:11:32,754 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-04 10:11:32,754 INFO L153 SettingsManager]: * Use SBE=true [2025-03-04 10:11:32,754 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-04 10:11:32,754 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-04 10:11:32,754 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-04 10:11:32,754 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-04 10:11:32,754 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-04 10:11:32,754 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2025-03-04 10:11:32,754 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2025-03-04 10:11:32,754 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2025-03-04 10:11:32,754 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-04 10:11:32,754 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-03-04 10:11:32,754 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-03-04 10:11:32,755 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-04 10:11:32,755 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-04 10:11:32,755 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-04 10:11:32,755 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-04 10:11:32,755 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-04 10:11:32,755 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-04 10:11:32,755 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-04 10:11:32,755 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 10:11:32,755 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-04 10:11:32,755 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-04 10:11:32,755 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-04 10:11:32,755 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-04 10:11:32,755 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-04 10:11:32,755 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-04 10:11:32,755 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-04 10:11:32,755 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-04 10:11:32,755 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 -> fbe9f324c9eba6beb8c990e3f85f0b00a68548fe05ffdb4e97bc061354d1cdf2 [2025-03-04 10:11:32,980 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-04 10:11:32,989 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-04 10:11:32,990 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-04 10:11:32,991 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-04 10:11:32,991 INFO L274 PluginConnector]: CDTParser initialized [2025-03-04 10:11:32,992 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/weaver/popl20-counter-fun.wvr.c [2025-03-04 10:11:34,126 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/73c1b0578/7b8ae2c129764f7094100b80db98bb8d/FLAGf90366373 [2025-03-04 10:11:34,351 INFO L384 CDTParser]: Found 1 translation units. [2025-03-04 10:11:34,352 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/weaver/popl20-counter-fun.wvr.c [2025-03-04 10:11:34,358 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/73c1b0578/7b8ae2c129764f7094100b80db98bb8d/FLAGf90366373 [2025-03-04 10:11:34,701 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/73c1b0578/7b8ae2c129764f7094100b80db98bb8d [2025-03-04 10:11:34,703 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-04 10:11:34,704 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-04 10:11:34,705 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-04 10:11:34,705 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-04 10:11:34,707 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-04 10:11:34,708 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 10:11:34" (1/1) ... [2025-03-04 10:11:34,708 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3fb74559 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:11:34, skipping insertion in model container [2025-03-04 10:11:34,709 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 10:11:34" (1/1) ... [2025-03-04 10:11:34,718 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-04 10:11:34,847 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-03-04 10:11:34,849 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 10:11:34,857 INFO L200 MainTranslator]: Completed pre-run [2025-03-04 10:11:34,879 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 10:11:34,894 INFO L204 MainTranslator]: Completed translation [2025-03-04 10:11:34,894 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:11:34 WrapperNode [2025-03-04 10:11:34,895 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-04 10:11:34,895 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-04 10:11:34,896 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-04 10:11:34,896 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-04 10:11:34,901 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:11:34" (1/1) ... [2025-03-04 10:11:34,906 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:11:34" (1/1) ... [2025-03-04 10:11:34,928 INFO L138 Inliner]: procedures = 23, calls = 36, calls flagged for inlining = 14, calls inlined = 16, statements flattened = 181 [2025-03-04 10:11:34,930 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-04 10:11:34,931 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-04 10:11:34,931 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-04 10:11:34,931 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-04 10:11:34,937 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:11:34" (1/1) ... [2025-03-04 10:11:34,937 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:11:34" (1/1) ... [2025-03-04 10:11:34,939 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:11:34" (1/1) ... [2025-03-04 10:11:34,953 INFO L175 MemorySlicer]: Split 14 memory accesses to 2 slices as follows [2, 12]. 86 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-04 10:11:34,953 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:11:34" (1/1) ... [2025-03-04 10:11:34,953 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:11:34" (1/1) ... [2025-03-04 10:11:34,965 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:11:34" (1/1) ... [2025-03-04 10:11:34,966 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:11:34" (1/1) ... [2025-03-04 10:11:34,967 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:11:34" (1/1) ... [2025-03-04 10:11:34,967 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:11:34" (1/1) ... [2025-03-04 10:11:34,969 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-04 10:11:34,969 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-04 10:11:34,969 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-04 10:11:34,970 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-04 10:11:34,970 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:11:34" (1/1) ... [2025-03-04 10:11:34,974 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 10:11:34,986 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:11:35,000 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-04 10:11:35,002 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-04 10:11:35,021 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-04 10:11:35,021 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2025-03-04 10:11:35,021 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2025-03-04 10:11:35,021 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2025-03-04 10:11:35,021 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2025-03-04 10:11:35,021 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-04 10:11:35,021 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-03-04 10:11:35,021 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-03-04 10:11:35,021 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-03-04 10:11:35,021 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2025-03-04 10:11:35,021 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2025-03-04 10:11:35,021 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-03-04 10:11:35,021 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-04 10:11:35,021 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-04 10:11:35,021 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-03-04 10:11:35,021 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-03-04 10:11:35,023 WARN L225 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-03-04 10:11:35,097 INFO L256 CfgBuilder]: Building ICFG [2025-03-04 10:11:35,098 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-04 10:11:35,447 INFO L303 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-03-04 10:11:35,448 INFO L307 CfgBuilder]: Performing block encoding [2025-03-04 10:11:35,718 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-04 10:11:35,718 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-04 10:11:35,718 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 10:11:35 BoogieIcfgContainer [2025-03-04 10:11:35,718 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-04 10:11:35,720 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-04 10:11:35,721 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-04 10:11:35,724 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-04 10:11:35,725 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.03 10:11:34" (1/3) ... [2025-03-04 10:11:35,725 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@546a66a5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 10:11:35, skipping insertion in model container [2025-03-04 10:11:35,725 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:11:34" (2/3) ... [2025-03-04 10:11:35,725 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@546a66a5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 10:11:35, skipping insertion in model container [2025-03-04 10:11:35,725 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 10:11:35" (3/3) ... [2025-03-04 10:11:35,727 INFO L128 eAbstractionObserver]: Analyzing ICFG popl20-counter-fun.wvr.c [2025-03-04 10:11:35,737 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-04 10:11:35,738 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG popl20-counter-fun.wvr.c that has 3 procedures, 51 locations, 1 initial locations, 4 loop locations, and 26 error locations. [2025-03-04 10:11:35,739 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-03-04 10:11:35,808 INFO L143 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2025-03-04 10:11:35,832 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 57 places, 54 transitions, 122 flow [2025-03-04 10:11:35,864 INFO L124 PetriNetUnfolderBase]: 4/52 cut-off events. [2025-03-04 10:11:35,865 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2025-03-04 10:11:35,870 INFO L83 FinitePrefix]: Finished finitePrefix Result has 61 conditions, 52 events. 4/52 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 165 event pairs, 0 based on Foata normal form. 0/22 useless extension candidates. Maximal degree in co-relation 35. Up to 2 conditions per place. [2025-03-04 10:11:35,870 INFO L82 GeneralOperation]: Start removeDead. Operand has 57 places, 54 transitions, 122 flow [2025-03-04 10:11:35,872 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 54 places, 51 transitions, 114 flow [2025-03-04 10:11:35,878 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-04 10:11:35,889 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;@30718e97, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-04 10:11:35,889 INFO L334 AbstractCegarLoop]: Starting to check reachability of 48 error locations. [2025-03-04 10:11:35,894 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-04 10:11:35,894 INFO L124 PetriNetUnfolderBase]: 1/4 cut-off events. [2025-03-04 10:11:35,894 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-04 10:11:35,894 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 10:11:35,894 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2025-03-04 10:11:35,894 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err8REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err9REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 45 more)] === [2025-03-04 10:11:35,898 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:11:35,898 INFO L85 PathProgramCache]: Analyzing trace with hash 589506, now seen corresponding path program 1 times [2025-03-04 10:11:35,903 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:11:35,903 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [60432252] [2025-03-04 10:11:35,903 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:11:35,904 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:11:35,955 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-03-04 10:11:35,973 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-03-04 10:11:35,973 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:11:35,973 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:11:36,074 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 10:11:36,075 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:11:36,075 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [60432252] [2025-03-04 10:11:36,075 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [60432252] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:11:36,075 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 10:11:36,075 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-03-04 10:11:36,076 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [671417774] [2025-03-04 10:11:36,077 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:11:36,082 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 10:11:36,085 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:11:36,103 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 10:11:36,103 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 10:11:36,121 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 54 [2025-03-04 10:11:36,123 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 54 places, 51 transitions, 114 flow. Second operand has 3 states, 3 states have (on average 9.0) internal successors, (27), 3 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:11:36,123 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 10:11:36,124 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 54 [2025-03-04 10:11:36,124 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 10:11:36,276 INFO L124 PetriNetUnfolderBase]: 219/390 cut-off events. [2025-03-04 10:11:36,276 INFO L125 PetriNetUnfolderBase]: For 12/12 co-relation queries the response was YES. [2025-03-04 10:11:36,277 INFO L83 FinitePrefix]: Finished finitePrefix Result has 799 conditions, 390 events. 219/390 cut-off events. For 12/12 co-relation queries the response was YES. Maximal size of possible extension queue 76. Compared 1954 event pairs, 182 based on Foata normal form. 1/240 useless extension candidates. Maximal degree in co-relation 729. Up to 373 conditions per place. [2025-03-04 10:11:36,280 INFO L140 encePairwiseOnDemand]: 37/54 looper letters, 28 selfloop transitions, 2 changer transitions 0/35 dead transitions. [2025-03-04 10:11:36,280 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 40 places, 35 transitions, 142 flow [2025-03-04 10:11:36,282 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 10:11:36,283 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 10:11:36,290 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 69 transitions. [2025-03-04 10:11:36,292 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.42592592592592593 [2025-03-04 10:11:36,293 INFO L175 Difference]: Start difference. First operand has 54 places, 51 transitions, 114 flow. Second operand 3 states and 69 transitions. [2025-03-04 10:11:36,294 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 40 places, 35 transitions, 142 flow [2025-03-04 10:11:36,297 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 36 places, 35 transitions, 134 flow, removed 0 selfloop flow, removed 4 redundant places. [2025-03-04 10:11:36,299 INFO L231 Difference]: Finished difference. Result has 36 places, 35 transitions, 78 flow [2025-03-04 10:11:36,300 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=54, PETRI_DIFFERENCE_MINUEND_FLOW=74, PETRI_DIFFERENCE_MINUEND_PLACES=34, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=35, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=33, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=78, PETRI_PLACES=36, PETRI_TRANSITIONS=35} [2025-03-04 10:11:36,304 INFO L279 CegarLoopForPetriNet]: 54 programPoint places, -18 predicate places. [2025-03-04 10:11:36,305 INFO L471 AbstractCegarLoop]: Abstraction has has 36 places, 35 transitions, 78 flow [2025-03-04 10:11:36,305 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 9.0) internal successors, (27), 3 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:11:36,305 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 10:11:36,305 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2025-03-04 10:11:36,305 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-04 10:11:36,305 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err8REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err9REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 45 more)] === [2025-03-04 10:11:36,306 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:11:36,306 INFO L85 PathProgramCache]: Analyzing trace with hash 589507, now seen corresponding path program 1 times [2025-03-04 10:11:36,306 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:11:36,307 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1638446028] [2025-03-04 10:11:36,307 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:11:36,307 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:11:36,314 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-03-04 10:11:36,329 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-03-04 10:11:36,330 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:11:36,330 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:11:36,547 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 10:11:36,547 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:11:36,547 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1638446028] [2025-03-04 10:11:36,547 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1638446028] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:11:36,547 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 10:11:36,547 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 10:11:36,547 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1764731662] [2025-03-04 10:11:36,547 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:11:36,548 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 10:11:36,548 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:11:36,548 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 10:11:36,548 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 10:11:36,562 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 54 [2025-03-04 10:11:36,562 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 36 places, 35 transitions, 78 flow. Second operand has 4 states, 4 states have (on average 8.75) internal successors, (35), 4 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:11:36,562 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 10:11:36,562 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 54 [2025-03-04 10:11:36,562 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 10:11:36,726 INFO L124 PetriNetUnfolderBase]: 219/389 cut-off events. [2025-03-04 10:11:36,726 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2025-03-04 10:11:36,727 INFO L83 FinitePrefix]: Finished finitePrefix Result has 782 conditions, 389 events. 219/389 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 76. Compared 1973 event pairs, 182 based on Foata normal form. 0/238 useless extension candidates. Maximal degree in co-relation 761. Up to 377 conditions per place. [2025-03-04 10:11:36,729 INFO L140 encePairwiseOnDemand]: 49/54 looper letters, 27 selfloop transitions, 4 changer transitions 0/34 dead transitions. [2025-03-04 10:11:36,729 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 38 places, 34 transitions, 138 flow [2025-03-04 10:11:36,729 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 10:11:36,729 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-04 10:11:36,729 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 64 transitions. [2025-03-04 10:11:36,730 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.2962962962962963 [2025-03-04 10:11:36,730 INFO L175 Difference]: Start difference. First operand has 36 places, 35 transitions, 78 flow. Second operand 4 states and 64 transitions. [2025-03-04 10:11:36,730 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 38 places, 34 transitions, 138 flow [2025-03-04 10:11:36,730 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 36 places, 34 transitions, 134 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-04 10:11:36,730 INFO L231 Difference]: Finished difference. Result has 36 places, 34 transitions, 80 flow [2025-03-04 10:11:36,731 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=54, PETRI_DIFFERENCE_MINUEND_FLOW=72, PETRI_DIFFERENCE_MINUEND_PLACES=33, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=34, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=80, PETRI_PLACES=36, PETRI_TRANSITIONS=34} [2025-03-04 10:11:36,731 INFO L279 CegarLoopForPetriNet]: 54 programPoint places, -18 predicate places. [2025-03-04 10:11:36,731 INFO L471 AbstractCegarLoop]: Abstraction has has 36 places, 34 transitions, 80 flow [2025-03-04 10:11:36,731 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 8.75) internal successors, (35), 4 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:11:36,731 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 10:11:36,731 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1] [2025-03-04 10:11:36,731 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-04 10:11:36,731 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err8REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err9REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 45 more)] === [2025-03-04 10:11:36,732 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:11:36,732 INFO L85 PathProgramCache]: Analyzing trace with hash 18276364, now seen corresponding path program 1 times [2025-03-04 10:11:36,732 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:11:36,732 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [488673794] [2025-03-04 10:11:36,732 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:11:36,732 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:11:36,738 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-03-04 10:11:36,751 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-03-04 10:11:36,751 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:11:36,751 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:11:36,922 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 10:11:36,923 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:11:36,923 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [488673794] [2025-03-04 10:11:36,923 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [488673794] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:11:36,923 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 10:11:36,923 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 10:11:36,924 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1537372658] [2025-03-04 10:11:36,924 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:11:36,924 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 10:11:36,924 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:11:36,924 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 10:11:36,925 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-04 10:11:36,946 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 54 [2025-03-04 10:11:36,947 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 36 places, 34 transitions, 80 flow. Second operand has 5 states, 5 states have (on average 8.8) internal successors, (44), 5 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:11:36,947 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 10:11:36,947 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 54 [2025-03-04 10:11:36,947 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 10:11:37,080 INFO L124 PetriNetUnfolderBase]: 221/395 cut-off events. [2025-03-04 10:11:37,080 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2025-03-04 10:11:37,081 INFO L83 FinitePrefix]: Finished finitePrefix Result has 799 conditions, 395 events. 221/395 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 76. Compared 1987 event pairs, 182 based on Foata normal form. 0/241 useless extension candidates. Maximal degree in co-relation 775. Up to 380 conditions per place. [2025-03-04 10:11:37,082 INFO L140 encePairwiseOnDemand]: 46/54 looper letters, 30 selfloop transitions, 7 changer transitions 0/40 dead transitions. [2025-03-04 10:11:37,082 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 40 places, 40 transitions, 172 flow [2025-03-04 10:11:37,085 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 10:11:37,085 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-03-04 10:11:37,085 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 78 transitions. [2025-03-04 10:11:37,085 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.28888888888888886 [2025-03-04 10:11:37,085 INFO L175 Difference]: Start difference. First operand has 36 places, 34 transitions, 80 flow. Second operand 5 states and 78 transitions. [2025-03-04 10:11:37,085 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 40 places, 40 transitions, 172 flow [2025-03-04 10:11:37,086 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 37 places, 40 transitions, 158 flow, removed 0 selfloop flow, removed 3 redundant places. [2025-03-04 10:11:37,087 INFO L231 Difference]: Finished difference. Result has 40 places, 40 transitions, 125 flow [2025-03-04 10:11:37,087 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=54, PETRI_DIFFERENCE_MINUEND_FLOW=72, PETRI_DIFFERENCE_MINUEND_PLACES=33, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=34, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=27, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=125, PETRI_PLACES=40, PETRI_TRANSITIONS=40} [2025-03-04 10:11:37,087 INFO L279 CegarLoopForPetriNet]: 54 programPoint places, -14 predicate places. [2025-03-04 10:11:37,088 INFO L471 AbstractCegarLoop]: Abstraction has has 40 places, 40 transitions, 125 flow [2025-03-04 10:11:37,088 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.8) internal successors, (44), 5 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:11:37,088 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 10:11:37,088 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1] [2025-03-04 10:11:37,088 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-04 10:11:37,088 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err8REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err9REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 45 more)] === [2025-03-04 10:11:37,088 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:11:37,088 INFO L85 PathProgramCache]: Analyzing trace with hash 383734945, now seen corresponding path program 1 times [2025-03-04 10:11:37,088 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:11:37,088 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [328478085] [2025-03-04 10:11:37,088 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:11:37,089 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:11:37,097 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-03-04 10:11:37,109 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-03-04 10:11:37,109 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:11:37,109 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:11:37,323 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 10:11:37,324 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:11:37,324 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [328478085] [2025-03-04 10:11:37,324 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [328478085] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 10:11:37,325 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [546939376] [2025-03-04 10:11:37,325 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:11:37,325 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:11:37,325 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:11:37,337 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 10:11:37,340 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-04 10:11:37,392 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-03-04 10:11:37,404 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-03-04 10:11:37,405 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:11:37,405 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:11:37,406 INFO L256 TraceCheckSpWp]: Trace formula consists of 96 conjuncts, 14 conjuncts are in the unsatisfiable core [2025-03-04 10:11:37,409 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:11:37,483 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2025-03-04 10:11:37,659 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 10:11:37,660 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 10:11:37,843 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 10:11:37,844 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [546939376] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 10:11:37,844 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 10:11:37,844 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 11 [2025-03-04 10:11:37,844 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2019882093] [2025-03-04 10:11:37,844 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 10:11:37,844 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-03-04 10:11:37,845 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:11:37,845 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-03-04 10:11:37,846 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=116, Unknown=0, NotChecked=0, Total=156 [2025-03-04 10:11:37,920 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 54 [2025-03-04 10:11:37,921 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 40 places, 40 transitions, 125 flow. Second operand has 13 states, 13 states have (on average 9.307692307692308) internal successors, (121), 13 states have internal predecessors, (121), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:11:37,921 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 10:11:37,921 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 54 [2025-03-04 10:11:37,921 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 10:11:38,187 INFO L124 PetriNetUnfolderBase]: 221/394 cut-off events. [2025-03-04 10:11:38,188 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2025-03-04 10:11:38,190 INFO L83 FinitePrefix]: Finished finitePrefix Result has 812 conditions, 394 events. 221/394 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 76. Compared 1972 event pairs, 182 based on Foata normal form. 0/244 useless extension candidates. Maximal degree in co-relation 771. Up to 373 conditions per place. [2025-03-04 10:11:38,192 INFO L140 encePairwiseOnDemand]: 46/54 looper letters, 24 selfloop transitions, 12 changer transitions 0/39 dead transitions. [2025-03-04 10:11:38,192 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 45 places, 39 transitions, 193 flow [2025-03-04 10:11:38,192 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-04 10:11:38,192 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-03-04 10:11:38,193 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 93 transitions. [2025-03-04 10:11:38,193 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.24603174603174602 [2025-03-04 10:11:38,194 INFO L175 Difference]: Start difference. First operand has 40 places, 40 transitions, 125 flow. Second operand 7 states and 93 transitions. [2025-03-04 10:11:38,194 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 45 places, 39 transitions, 193 flow [2025-03-04 10:11:38,195 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 44 places, 39 transitions, 192 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-04 10:11:38,195 INFO L231 Difference]: Finished difference. Result has 44 places, 39 transitions, 144 flow [2025-03-04 10:11:38,195 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=54, PETRI_DIFFERENCE_MINUEND_FLOW=120, PETRI_DIFFERENCE_MINUEND_PLACES=38, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=39, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=27, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=144, PETRI_PLACES=44, PETRI_TRANSITIONS=39} [2025-03-04 10:11:38,196 INFO L279 CegarLoopForPetriNet]: 54 programPoint places, -10 predicate places. [2025-03-04 10:11:38,196 INFO L471 AbstractCegarLoop]: Abstraction has has 44 places, 39 transitions, 144 flow [2025-03-04 10:11:38,196 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 9.307692307692308) internal successors, (121), 13 states have internal predecessors, (121), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:11:38,196 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 10:11:38,196 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:11:38,203 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-03-04 10:11:38,396 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-04 10:11:38,397 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting thread1Err8REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err8REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err9REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 45 more)] === [2025-03-04 10:11:38,398 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:11:38,398 INFO L85 PathProgramCache]: Analyzing trace with hash -986944888, now seen corresponding path program 1 times [2025-03-04 10:11:38,398 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:11:38,398 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [189493445] [2025-03-04 10:11:38,398 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:11:38,398 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:11:38,415 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-03-04 10:11:38,419 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-03-04 10:11:38,419 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:11:38,419 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:11:38,465 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 10:11:38,465 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:11:38,466 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [189493445] [2025-03-04 10:11:38,466 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [189493445] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:11:38,466 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 10:11:38,466 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 10:11:38,466 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1112337391] [2025-03-04 10:11:38,466 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:11:38,466 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 10:11:38,466 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:11:38,468 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 10:11:38,468 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 10:11:38,474 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 54 [2025-03-04 10:11:38,474 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 44 places, 39 transitions, 144 flow. Second operand has 4 states, 4 states have (on average 11.5) internal successors, (46), 4 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:11:38,475 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 10:11:38,475 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 54 [2025-03-04 10:11:38,476 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 10:11:38,622 INFO L124 PetriNetUnfolderBase]: 260/484 cut-off events. [2025-03-04 10:11:38,622 INFO L125 PetriNetUnfolderBase]: For 6/6 co-relation queries the response was YES. [2025-03-04 10:11:38,622 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1019 conditions, 484 events. 260/484 cut-off events. For 6/6 co-relation queries the response was YES. Maximal size of possible extension queue 76. Compared 2479 event pairs, 220 based on Foata normal form. 12/344 useless extension candidates. Maximal degree in co-relation 775. Up to 382 conditions per place. [2025-03-04 10:11:38,624 INFO L140 encePairwiseOnDemand]: 39/54 looper letters, 45 selfloop transitions, 7 changer transitions 2/57 dead transitions. [2025-03-04 10:11:38,624 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 48 places, 57 transitions, 322 flow [2025-03-04 10:11:38,625 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 10:11:38,625 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-03-04 10:11:38,625 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 109 transitions. [2025-03-04 10:11:38,625 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.40370370370370373 [2025-03-04 10:11:38,625 INFO L175 Difference]: Start difference. First operand has 44 places, 39 transitions, 144 flow. Second operand 5 states and 109 transitions. [2025-03-04 10:11:38,626 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 48 places, 57 transitions, 322 flow [2025-03-04 10:11:38,626 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 42 places, 57 transitions, 273 flow, removed 8 selfloop flow, removed 6 redundant places. [2025-03-04 10:11:38,627 INFO L231 Difference]: Finished difference. Result has 44 places, 43 transitions, 178 flow [2025-03-04 10:11:38,627 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=54, PETRI_DIFFERENCE_MINUEND_FLOW=111, PETRI_DIFFERENCE_MINUEND_PLACES=38, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=39, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=32, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=178, PETRI_PLACES=44, PETRI_TRANSITIONS=43} [2025-03-04 10:11:38,628 INFO L279 CegarLoopForPetriNet]: 54 programPoint places, -10 predicate places. [2025-03-04 10:11:38,628 INFO L471 AbstractCegarLoop]: Abstraction has has 44 places, 43 transitions, 178 flow [2025-03-04 10:11:38,628 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.5) internal successors, (46), 4 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:11:38,628 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 10:11:38,628 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:11:38,628 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-04 10:11:38,628 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting thread1Err8REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err8REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err9REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 45 more)] === [2025-03-04 10:11:38,629 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:11:38,629 INFO L85 PathProgramCache]: Analyzing trace with hash 1715622648, now seen corresponding path program 1 times [2025-03-04 10:11:38,629 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:11:38,629 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [529447059] [2025-03-04 10:11:38,629 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:11:38,629 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:11:38,634 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-03-04 10:11:38,640 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-03-04 10:11:38,640 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:11:38,640 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:11:38,705 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-04 10:11:38,705 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:11:38,705 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [529447059] [2025-03-04 10:11:38,705 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [529447059] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:11:38,705 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 10:11:38,705 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 10:11:38,706 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [976407821] [2025-03-04 10:11:38,706 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:11:38,706 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 10:11:38,706 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:11:38,707 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 10:11:38,707 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 10:11:38,719 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 54 [2025-03-04 10:11:38,719 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 44 places, 43 transitions, 178 flow. Second operand has 4 states, 4 states have (on average 10.0) internal successors, (40), 4 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:11:38,719 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 10:11:38,720 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 54 [2025-03-04 10:11:38,720 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 10:11:38,812 INFO L124 PetriNetUnfolderBase]: 212/402 cut-off events. [2025-03-04 10:11:38,812 INFO L125 PetriNetUnfolderBase]: For 38/38 co-relation queries the response was YES. [2025-03-04 10:11:38,813 INFO L83 FinitePrefix]: Finished finitePrefix Result has 939 conditions, 402 events. 212/402 cut-off events. For 38/38 co-relation queries the response was YES. Maximal size of possible extension queue 57. Compared 1949 event pairs, 176 based on Foata normal form. 0/298 useless extension candidates. Maximal degree in co-relation 724. Up to 374 conditions per place. [2025-03-04 10:11:38,814 INFO L140 encePairwiseOnDemand]: 49/54 looper letters, 32 selfloop transitions, 6 changer transitions 0/41 dead transitions. [2025-03-04 10:11:38,814 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 46 places, 41 transitions, 246 flow [2025-03-04 10:11:38,814 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 10:11:38,814 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-03-04 10:11:38,815 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 70 transitions. [2025-03-04 10:11:38,815 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.25925925925925924 [2025-03-04 10:11:38,815 INFO L175 Difference]: Start difference. First operand has 44 places, 43 transitions, 178 flow. Second operand 5 states and 70 transitions. [2025-03-04 10:11:38,815 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 46 places, 41 transitions, 246 flow [2025-03-04 10:11:38,816 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 45 places, 41 transitions, 242 flow, removed 1 selfloop flow, removed 1 redundant places. [2025-03-04 10:11:38,816 INFO L231 Difference]: Finished difference. Result has 45 places, 41 transitions, 178 flow [2025-03-04 10:11:38,816 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=54, PETRI_DIFFERENCE_MINUEND_FLOW=166, PETRI_DIFFERENCE_MINUEND_PLACES=41, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=35, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=178, PETRI_PLACES=45, PETRI_TRANSITIONS=41} [2025-03-04 10:11:38,817 INFO L279 CegarLoopForPetriNet]: 54 programPoint places, -9 predicate places. [2025-03-04 10:11:38,817 INFO L471 AbstractCegarLoop]: Abstraction has has 45 places, 41 transitions, 178 flow [2025-03-04 10:11:38,817 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.0) internal successors, (40), 4 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:11:38,817 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 10:11:38,817 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:11:38,817 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-04 10:11:38,817 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting thread1Err9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err8REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err9REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 45 more)] === [2025-03-04 10:11:38,817 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:11:38,817 INFO L85 PathProgramCache]: Analyzing trace with hash 1715622649, now seen corresponding path program 1 times [2025-03-04 10:11:38,818 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:11:38,818 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1657002827] [2025-03-04 10:11:38,818 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:11:38,818 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:11:38,822 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-03-04 10:11:38,826 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-03-04 10:11:38,826 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:11:38,826 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:11:38,977 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 10:11:38,977 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:11:38,978 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1657002827] [2025-03-04 10:11:38,978 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1657002827] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 10:11:38,978 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [144485479] [2025-03-04 10:11:38,978 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:11:38,978 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:11:38,978 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:11:38,980 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 10:11:38,981 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-04 10:11:39,026 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-03-04 10:11:39,039 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-03-04 10:11:39,039 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:11:39,039 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:11:39,040 INFO L256 TraceCheckSpWp]: Trace formula consists of 124 conjuncts, 16 conjuncts are in the unsatisfiable core [2025-03-04 10:11:39,041 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:11:39,048 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-04 10:11:39,096 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-04 10:11:39,097 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-04 10:11:39,119 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-03-04 10:11:39,119 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-04 10:11:39,153 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 10:11:39,153 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 10:11:39,253 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 61 treesize of output 57 [2025-03-04 10:11:39,317 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 10:11:39,317 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [144485479] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 10:11:39,317 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 10:11:39,317 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2025-03-04 10:11:39,318 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1285917143] [2025-03-04 10:11:39,318 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 10:11:39,318 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-04 10:11:39,318 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:11:39,318 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-04 10:11:39,318 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2025-03-04 10:11:39,428 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 54 [2025-03-04 10:11:39,429 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 45 places, 41 transitions, 178 flow. Second operand has 11 states, 11 states have (on average 10.181818181818182) internal successors, (112), 11 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:11:39,429 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 10:11:39,429 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 54 [2025-03-04 10:11:39,429 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 10:11:39,779 INFO L124 PetriNetUnfolderBase]: 403/749 cut-off events. [2025-03-04 10:11:39,779 INFO L125 PetriNetUnfolderBase]: For 82/82 co-relation queries the response was YES. [2025-03-04 10:11:39,780 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1734 conditions, 749 events. 403/749 cut-off events. For 82/82 co-relation queries the response was YES. Maximal size of possible extension queue 67. Compared 3781 event pairs, 187 based on Foata normal form. 1/568 useless extension candidates. Maximal degree in co-relation 1482. Up to 272 conditions per place. [2025-03-04 10:11:39,784 INFO L140 encePairwiseOnDemand]: 43/54 looper letters, 60 selfloop transitions, 15 changer transitions 1/79 dead transitions. [2025-03-04 10:11:39,784 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 52 places, 79 transitions, 441 flow [2025-03-04 10:11:39,784 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-04 10:11:39,785 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2025-03-04 10:11:39,785 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 143 transitions. [2025-03-04 10:11:39,786 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.33101851851851855 [2025-03-04 10:11:39,786 INFO L175 Difference]: Start difference. First operand has 45 places, 41 transitions, 178 flow. Second operand 8 states and 143 transitions. [2025-03-04 10:11:39,786 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 52 places, 79 transitions, 441 flow [2025-03-04 10:11:39,787 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 48 places, 79 transitions, 425 flow, removed 0 selfloop flow, removed 4 redundant places. [2025-03-04 10:11:39,789 INFO L231 Difference]: Finished difference. Result has 51 places, 48 transitions, 253 flow [2025-03-04 10:11:39,790 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=54, PETRI_DIFFERENCE_MINUEND_FLOW=163, PETRI_DIFFERENCE_MINUEND_PLACES=41, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=29, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=253, PETRI_PLACES=51, PETRI_TRANSITIONS=48} [2025-03-04 10:11:39,790 INFO L279 CegarLoopForPetriNet]: 54 programPoint places, -3 predicate places. [2025-03-04 10:11:39,791 INFO L471 AbstractCegarLoop]: Abstraction has has 51 places, 48 transitions, 253 flow [2025-03-04 10:11:39,791 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 10.181818181818182) internal successors, (112), 11 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:11:39,791 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 10:11:39,791 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:11:39,799 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-03-04 10:11:39,994 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,SelfDestructingSolverStorable6 [2025-03-04 10:11:39,994 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err8REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err9REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 45 more)] === [2025-03-04 10:11:39,994 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:11:39,994 INFO L85 PathProgramCache]: Analyzing trace with hash 1715622654, now seen corresponding path program 1 times [2025-03-04 10:11:39,995 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:11:39,995 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1475617849] [2025-03-04 10:11:39,995 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:11:39,995 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:11:40,001 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-03-04 10:11:40,005 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-03-04 10:11:40,006 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:11:40,006 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:11:40,057 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-04 10:11:40,057 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:11:40,057 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1475617849] [2025-03-04 10:11:40,057 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1475617849] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:11:40,057 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 10:11:40,057 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 10:11:40,057 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1064539143] [2025-03-04 10:11:40,057 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:11:40,057 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 10:11:40,057 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:11:40,057 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 10:11:40,057 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 10:11:40,064 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 54 [2025-03-04 10:11:40,064 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 51 places, 48 transitions, 253 flow. Second operand has 4 states, 4 states have (on average 10.0) internal successors, (40), 4 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:11:40,064 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 10:11:40,064 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 54 [2025-03-04 10:11:40,064 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 10:11:40,149 INFO L124 PetriNetUnfolderBase]: 295/570 cut-off events. [2025-03-04 10:11:40,149 INFO L125 PetriNetUnfolderBase]: For 564/564 co-relation queries the response was YES. [2025-03-04 10:11:40,150 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1507 conditions, 570 events. 295/570 cut-off events. For 564/564 co-relation queries the response was YES. Maximal size of possible extension queue 45. Compared 2694 event pairs, 219 based on Foata normal form. 0/550 useless extension candidates. Maximal degree in co-relation 1278. Up to 518 conditions per place. [2025-03-04 10:11:40,153 INFO L140 encePairwiseOnDemand]: 50/54 looper letters, 37 selfloop transitions, 5 changer transitions 0/45 dead transitions. [2025-03-04 10:11:40,153 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 52 places, 45 transitions, 321 flow [2025-03-04 10:11:40,154 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 10:11:40,154 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-04 10:11:40,155 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 60 transitions. [2025-03-04 10:11:40,155 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.2777777777777778 [2025-03-04 10:11:40,155 INFO L175 Difference]: Start difference. First operand has 51 places, 48 transitions, 253 flow. Second operand 4 states and 60 transitions. [2025-03-04 10:11:40,155 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 52 places, 45 transitions, 321 flow [2025-03-04 10:11:40,158 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 52 places, 45 transitions, 317 flow, removed 2 selfloop flow, removed 0 redundant places. [2025-03-04 10:11:40,158 INFO L231 Difference]: Finished difference. Result has 52 places, 45 transitions, 243 flow [2025-03-04 10:11:40,159 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=54, PETRI_DIFFERENCE_MINUEND_FLOW=233, PETRI_DIFFERENCE_MINUEND_PLACES=49, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=45, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=40, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=243, PETRI_PLACES=52, PETRI_TRANSITIONS=45} [2025-03-04 10:11:40,161 INFO L279 CegarLoopForPetriNet]: 54 programPoint places, -2 predicate places. [2025-03-04 10:11:40,161 INFO L471 AbstractCegarLoop]: Abstraction has has 52 places, 45 transitions, 243 flow [2025-03-04 10:11:40,161 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.0) internal successors, (40), 4 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:11:40,161 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 10:11:40,161 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:11:40,161 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-04 10:11:40,162 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting thread1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err8REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err9REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 45 more)] === [2025-03-04 10:11:40,162 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:11:40,162 INFO L85 PathProgramCache]: Analyzing trace with hash 1715622655, now seen corresponding path program 1 times [2025-03-04 10:11:40,162 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:11:40,162 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1441417777] [2025-03-04 10:11:40,163 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:11:40,163 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:11:40,170 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-03-04 10:11:40,178 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-03-04 10:11:40,178 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:11:40,178 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:11:40,282 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-04 10:11:40,283 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:11:40,283 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1441417777] [2025-03-04 10:11:40,283 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1441417777] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:11:40,283 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 10:11:40,283 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 10:11:40,283 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1307609003] [2025-03-04 10:11:40,283 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:11:40,283 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 10:11:40,283 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:11:40,284 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 10:11:40,284 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 10:11:40,289 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 54 [2025-03-04 10:11:40,290 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 52 places, 45 transitions, 243 flow. Second operand has 4 states, 4 states have (on average 12.0) internal successors, (48), 4 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:11:40,290 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 10:11:40,290 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 54 [2025-03-04 10:11:40,290 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 10:11:40,391 INFO L124 PetriNetUnfolderBase]: 337/678 cut-off events. [2025-03-04 10:11:40,391 INFO L125 PetriNetUnfolderBase]: For 692/692 co-relation queries the response was YES. [2025-03-04 10:11:40,392 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1727 conditions, 678 events. 337/678 cut-off events. For 692/692 co-relation queries the response was YES. Maximal size of possible extension queue 46. Compared 3277 event pairs, 263 based on Foata normal form. 30/708 useless extension candidates. Maximal degree in co-relation 1433. Up to 528 conditions per place. [2025-03-04 10:11:40,395 INFO L140 encePairwiseOnDemand]: 46/54 looper letters, 36 selfloop transitions, 4 changer transitions 12/55 dead transitions. [2025-03-04 10:11:40,395 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 55 places, 55 transitions, 371 flow [2025-03-04 10:11:40,395 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 10:11:40,395 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-04 10:11:40,395 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 84 transitions. [2025-03-04 10:11:40,396 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.3888888888888889 [2025-03-04 10:11:40,396 INFO L175 Difference]: Start difference. First operand has 52 places, 45 transitions, 243 flow. Second operand 4 states and 84 transitions. [2025-03-04 10:11:40,396 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 55 places, 55 transitions, 371 flow [2025-03-04 10:11:40,397 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 53 places, 55 transitions, 365 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-04 10:11:40,398 INFO L231 Difference]: Finished difference. Result has 54 places, 43 transitions, 233 flow [2025-03-04 10:11:40,398 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=54, PETRI_DIFFERENCE_MINUEND_FLOW=237, PETRI_DIFFERENCE_MINUEND_PLACES=50, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=45, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=41, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=233, PETRI_PLACES=54, PETRI_TRANSITIONS=43} [2025-03-04 10:11:40,399 INFO L279 CegarLoopForPetriNet]: 54 programPoint places, 0 predicate places. [2025-03-04 10:11:40,399 INFO L471 AbstractCegarLoop]: Abstraction has has 54 places, 43 transitions, 233 flow [2025-03-04 10:11:40,399 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.0) internal successors, (48), 4 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:11:40,399 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 10:11:40,399 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:11:40,399 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-04 10:11:40,399 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting thread1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err8REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err9REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 45 more)] === [2025-03-04 10:11:40,399 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:11:40,400 INFO L85 PathProgramCache]: Analyzing trace with hash 1654701642, now seen corresponding path program 1 times [2025-03-04 10:11:40,400 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:11:40,400 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1865423074] [2025-03-04 10:11:40,400 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:11:40,401 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:11:40,405 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-03-04 10:11:40,416 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-03-04 10:11:40,416 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:11:40,416 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:11:40,605 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-04 10:11:40,605 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:11:40,606 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1865423074] [2025-03-04 10:11:40,606 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1865423074] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 10:11:40,606 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1226320041] [2025-03-04 10:11:40,606 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:11:40,606 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:11:40,606 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:11:40,608 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 10:11:40,609 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-03-04 10:11:40,652 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-03-04 10:11:40,668 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-03-04 10:11:40,668 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:11:40,668 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:11:40,669 INFO L256 TraceCheckSpWp]: Trace formula consists of 146 conjuncts, 20 conjuncts are in the unsatisfiable core [2025-03-04 10:11:40,671 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:11:40,718 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-04 10:11:40,718 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 10:11:40,718 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1226320041] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:11:40,718 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-04 10:11:40,718 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 7 [2025-03-04 10:11:40,719 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1101134178] [2025-03-04 10:11:40,719 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:11:40,719 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 10:11:40,719 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:11:40,719 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 10:11:40,719 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2025-03-04 10:11:40,729 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 54 [2025-03-04 10:11:40,729 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 54 places, 43 transitions, 233 flow. Second operand has 5 states, 5 states have (on average 12.0) internal successors, (60), 5 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:11:40,729 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 10:11:40,729 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 54 [2025-03-04 10:11:40,730 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 10:11:40,794 INFO L124 PetriNetUnfolderBase]: 201/413 cut-off events. [2025-03-04 10:11:40,795 INFO L125 PetriNetUnfolderBase]: For 672/672 co-relation queries the response was YES. [2025-03-04 10:11:40,795 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1114 conditions, 413 events. 201/413 cut-off events. For 672/672 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 1729 event pairs, 147 based on Foata normal form. 56/460 useless extension candidates. Maximal degree in co-relation 963. Up to 364 conditions per place. [2025-03-04 10:11:40,797 INFO L140 encePairwiseOnDemand]: 50/54 looper letters, 30 selfloop transitions, 2 changer transitions 5/40 dead transitions. [2025-03-04 10:11:40,797 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 54 places, 40 transitions, 287 flow [2025-03-04 10:11:40,797 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 10:11:40,797 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-04 10:11:40,797 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 66 transitions. [2025-03-04 10:11:40,798 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.3055555555555556 [2025-03-04 10:11:40,798 INFO L175 Difference]: Start difference. First operand has 54 places, 43 transitions, 233 flow. Second operand 4 states and 66 transitions. [2025-03-04 10:11:40,798 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 54 places, 40 transitions, 287 flow [2025-03-04 10:11:40,799 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 51 places, 40 transitions, 272 flow, removed 3 selfloop flow, removed 3 redundant places. [2025-03-04 10:11:40,799 INFO L231 Difference]: Finished difference. Result has 51 places, 35 transitions, 161 flow [2025-03-04 10:11:40,799 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=54, PETRI_DIFFERENCE_MINUEND_FLOW=198, PETRI_DIFFERENCE_MINUEND_PLACES=48, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=40, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=38, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=161, PETRI_PLACES=51, PETRI_TRANSITIONS=35} [2025-03-04 10:11:40,800 INFO L279 CegarLoopForPetriNet]: 54 programPoint places, -3 predicate places. [2025-03-04 10:11:40,800 INFO L471 AbstractCegarLoop]: Abstraction has has 51 places, 35 transitions, 161 flow [2025-03-04 10:11:40,800 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.0) internal successors, (60), 5 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:11:40,800 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 10:11:40,800 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:11:40,806 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-04 10:11:41,001 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:11:41,001 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting thread2Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err8REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err9REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 45 more)] === [2025-03-04 10:11:41,002 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:11:41,002 INFO L85 PathProgramCache]: Analyzing trace with hash 985119720, now seen corresponding path program 1 times [2025-03-04 10:11:41,002 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:11:41,002 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [981697662] [2025-03-04 10:11:41,002 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:11:41,002 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:11:41,007 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-03-04 10:11:41,012 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-03-04 10:11:41,012 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:11:41,012 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:11:41,237 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-04 10:11:41,238 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:11:41,238 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [981697662] [2025-03-04 10:11:41,238 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [981697662] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:11:41,238 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 10:11:41,239 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 10:11:41,239 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [818257189] [2025-03-04 10:11:41,239 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:11:41,239 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 10:11:41,239 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:11:41,239 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 10:11:41,239 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-04 10:11:41,252 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 54 [2025-03-04 10:11:41,252 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 51 places, 35 transitions, 161 flow. Second operand has 5 states, 5 states have (on average 10.4) internal successors, (52), 5 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:11:41,252 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 10:11:41,252 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 54 [2025-03-04 10:11:41,252 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 10:11:41,306 INFO L124 PetriNetUnfolderBase]: 124/250 cut-off events. [2025-03-04 10:11:41,307 INFO L125 PetriNetUnfolderBase]: For 272/272 co-relation queries the response was YES. [2025-03-04 10:11:41,308 INFO L83 FinitePrefix]: Finished finitePrefix Result has 634 conditions, 250 events. 124/250 cut-off events. For 272/272 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 877 event pairs, 81 based on Foata normal form. 28/272 useless extension candidates. Maximal degree in co-relation 622. Up to 221 conditions per place. [2025-03-04 10:11:41,309 INFO L140 encePairwiseOnDemand]: 50/54 looper letters, 28 selfloop transitions, 2 changer transitions 0/33 dead transitions. [2025-03-04 10:11:41,309 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 50 places, 33 transitions, 209 flow [2025-03-04 10:11:41,309 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 10:11:41,310 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-04 10:11:41,310 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 56 transitions. [2025-03-04 10:11:41,310 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.25925925925925924 [2025-03-04 10:11:41,310 INFO L175 Difference]: Start difference. First operand has 51 places, 35 transitions, 161 flow. Second operand 4 states and 56 transitions. [2025-03-04 10:11:41,310 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 50 places, 33 transitions, 209 flow [2025-03-04 10:11:41,311 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 44 places, 33 transitions, 189 flow, removed 5 selfloop flow, removed 6 redundant places. [2025-03-04 10:11:41,311 INFO L231 Difference]: Finished difference. Result has 44 places, 33 transitions, 133 flow [2025-03-04 10:11:41,312 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=54, PETRI_DIFFERENCE_MINUEND_FLOW=129, PETRI_DIFFERENCE_MINUEND_PLACES=41, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=33, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=31, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=133, PETRI_PLACES=44, PETRI_TRANSITIONS=33} [2025-03-04 10:11:41,312 INFO L279 CegarLoopForPetriNet]: 54 programPoint places, -10 predicate places. [2025-03-04 10:11:41,313 INFO L471 AbstractCegarLoop]: Abstraction has has 44 places, 33 transitions, 133 flow [2025-03-04 10:11:41,313 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.4) internal successors, (52), 5 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:11:41,313 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 10:11:41,313 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] [2025-03-04 10:11:41,313 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-04 10:11:41,313 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err8REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err9REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 45 more)] === [2025-03-04 10:11:41,313 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:11:41,313 INFO L85 PathProgramCache]: Analyzing trace with hash -502012040, now seen corresponding path program 1 times [2025-03-04 10:11:41,313 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:11:41,314 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1080718083] [2025-03-04 10:11:41,314 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:11:41,314 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:11:41,321 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-03-04 10:11:41,327 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-03-04 10:11:41,327 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:11:41,327 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:11:41,381 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-04 10:11:41,381 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:11:41,381 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1080718083] [2025-03-04 10:11:41,381 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1080718083] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:11:41,382 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 10:11:41,382 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-04 10:11:41,382 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1557744192] [2025-03-04 10:11:41,382 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:11:41,382 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 10:11:41,382 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:11:41,383 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 10:11:41,383 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-03-04 10:11:41,390 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 54 [2025-03-04 10:11:41,391 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 44 places, 33 transitions, 133 flow. Second operand has 6 states, 6 states have (on average 12.5) internal successors, (75), 6 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:11:41,391 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 10:11:41,391 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 54 [2025-03-04 10:11:41,391 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 10:11:41,545 INFO L124 PetriNetUnfolderBase]: 259/472 cut-off events. [2025-03-04 10:11:41,546 INFO L125 PetriNetUnfolderBase]: For 155/155 co-relation queries the response was YES. [2025-03-04 10:11:41,547 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1141 conditions, 472 events. 259/472 cut-off events. For 155/155 co-relation queries the response was YES. Maximal size of possible extension queue 36. Compared 1979 event pairs, 83 based on Foata normal form. 13/446 useless extension candidates. Maximal degree in co-relation 1112. Up to 273 conditions per place. [2025-03-04 10:11:41,549 INFO L140 encePairwiseOnDemand]: 47/54 looper letters, 60 selfloop transitions, 8 changer transitions 0/70 dead transitions. [2025-03-04 10:11:41,549 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 49 places, 70 transitions, 394 flow [2025-03-04 10:11:41,549 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 10:11:41,549 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-04 10:11:41,550 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 110 transitions. [2025-03-04 10:11:41,550 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.3395061728395062 [2025-03-04 10:11:41,550 INFO L175 Difference]: Start difference. First operand has 44 places, 33 transitions, 133 flow. Second operand 6 states and 110 transitions. [2025-03-04 10:11:41,550 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 49 places, 70 transitions, 394 flow [2025-03-04 10:11:41,552 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 46 places, 70 transitions, 365 flow, removed 13 selfloop flow, removed 3 redundant places. [2025-03-04 10:11:41,555 INFO L231 Difference]: Finished difference. Result has 50 places, 40 transitions, 182 flow [2025-03-04 10:11:41,555 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=54, PETRI_DIFFERENCE_MINUEND_FLOW=122, PETRI_DIFFERENCE_MINUEND_PLACES=41, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=33, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=27, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=182, PETRI_PLACES=50, PETRI_TRANSITIONS=40} [2025-03-04 10:11:41,556 INFO L279 CegarLoopForPetriNet]: 54 programPoint places, -4 predicate places. [2025-03-04 10:11:41,557 INFO L471 AbstractCegarLoop]: Abstraction has has 50 places, 40 transitions, 182 flow [2025-03-04 10:11:41,557 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 12.5) internal successors, (75), 6 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:11:41,557 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 10:11:41,557 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] [2025-03-04 10:11:41,557 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-04 10:11:41,557 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err8REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err9REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 45 more)] === [2025-03-04 10:11:41,558 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:11:41,558 INFO L85 PathProgramCache]: Analyzing trace with hash -1851432228, now seen corresponding path program 2 times [2025-03-04 10:11:41,558 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:11:41,558 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [267565458] [2025-03-04 10:11:41,558 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 10:11:41,559 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:11:41,567 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 22 statements into 2 equivalence classes. [2025-03-04 10:11:41,575 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 22 of 22 statements. [2025-03-04 10:11:41,575 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 10:11:41,575 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:11:41,623 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-04 10:11:41,623 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:11:41,623 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [267565458] [2025-03-04 10:11:41,623 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [267565458] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 10:11:41,623 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1832947848] [2025-03-04 10:11:41,623 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 10:11:41,623 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:11:41,623 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:11:41,625 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 10:11:41,627 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-03-04 10:11:41,672 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 22 statements into 2 equivalence classes. [2025-03-04 10:11:41,689 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 22 of 22 statements. [2025-03-04 10:11:41,689 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 10:11:41,689 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:11:41,691 INFO L256 TraceCheckSpWp]: Trace formula consists of 197 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-04 10:11:41,691 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:11:41,716 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-04 10:11:41,716 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 10:11:41,734 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-04 10:11:41,735 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1832947848] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 10:11:41,735 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 10:11:41,735 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5] total 9 [2025-03-04 10:11:41,735 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [245363826] [2025-03-04 10:11:41,735 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 10:11:41,735 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-04 10:11:41,736 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:11:41,736 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-04 10:11:41,736 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2025-03-04 10:11:41,743 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 54 [2025-03-04 10:11:41,743 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 50 places, 40 transitions, 182 flow. Second operand has 9 states, 9 states have (on average 11.444444444444445) internal successors, (103), 9 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:11:41,743 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 10:11:41,743 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 54 [2025-03-04 10:11:41,743 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 10:11:41,996 INFO L124 PetriNetUnfolderBase]: 394/688 cut-off events. [2025-03-04 10:11:41,996 INFO L125 PetriNetUnfolderBase]: For 437/437 co-relation queries the response was YES. [2025-03-04 10:11:41,997 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2102 conditions, 688 events. 394/688 cut-off events. For 437/437 co-relation queries the response was YES. Maximal size of possible extension queue 47. Compared 2907 event pairs, 23 based on Foata normal form. 9/661 useless extension candidates. Maximal degree in co-relation 2071. Up to 140 conditions per place. [2025-03-04 10:11:42,000 INFO L140 encePairwiseOnDemand]: 46/54 looper letters, 87 selfloop transitions, 30 changer transitions 0/118 dead transitions. [2025-03-04 10:11:42,000 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 63 places, 118 transitions, 708 flow [2025-03-04 10:11:42,000 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-03-04 10:11:42,000 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2025-03-04 10:11:42,001 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 212 transitions. [2025-03-04 10:11:42,001 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.2804232804232804 [2025-03-04 10:11:42,001 INFO L175 Difference]: Start difference. First operand has 50 places, 40 transitions, 182 flow. Second operand 14 states and 212 transitions. [2025-03-04 10:11:42,001 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 63 places, 118 transitions, 708 flow [2025-03-04 10:11:42,002 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 62 places, 118 transitions, 700 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-04 10:11:42,004 INFO L231 Difference]: Finished difference. Result has 66 places, 62 transitions, 362 flow [2025-03-04 10:11:42,004 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=54, PETRI_DIFFERENCE_MINUEND_FLOW=178, PETRI_DIFFERENCE_MINUEND_PLACES=49, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=40, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=28, PETRI_DIFFERENCE_SUBTRAHEND_STATES=14, PETRI_FLOW=362, PETRI_PLACES=66, PETRI_TRANSITIONS=62} [2025-03-04 10:11:42,004 INFO L279 CegarLoopForPetriNet]: 54 programPoint places, 12 predicate places. [2025-03-04 10:11:42,004 INFO L471 AbstractCegarLoop]: Abstraction has has 66 places, 62 transitions, 362 flow [2025-03-04 10:11:42,004 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 11.444444444444445) internal successors, (103), 9 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:11:42,004 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 10:11:42,005 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] [2025-03-04 10:11:42,011 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-04 10:11:42,205 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-04 10:11:42,205 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err8REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err9REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 45 more)] === [2025-03-04 10:11:42,206 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:11:42,206 INFO L85 PathProgramCache]: Analyzing trace with hash 2012993995, now seen corresponding path program 1 times [2025-03-04 10:11:42,206 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:11:42,206 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [404696682] [2025-03-04 10:11:42,206 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:11:42,206 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:11:42,214 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-03-04 10:11:42,219 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-03-04 10:11:42,220 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:11:42,220 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:11:42,271 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-04 10:11:42,271 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:11:42,271 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [404696682] [2025-03-04 10:11:42,271 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [404696682] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:11:42,271 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 10:11:42,272 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-04 10:11:42,272 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1772733838] [2025-03-04 10:11:42,272 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:11:42,272 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 10:11:42,272 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:11:42,272 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 10:11:42,272 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-04 10:11:42,275 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 54 [2025-03-04 10:11:42,275 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 66 places, 62 transitions, 362 flow. Second operand has 5 states, 5 states have (on average 13.2) internal successors, (66), 5 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:11:42,275 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 10:11:42,275 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 54 [2025-03-04 10:11:42,275 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 10:11:42,386 INFO L124 PetriNetUnfolderBase]: 330/604 cut-off events. [2025-03-04 10:11:42,386 INFO L125 PetriNetUnfolderBase]: For 1142/1156 co-relation queries the response was YES. [2025-03-04 10:11:42,387 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2187 conditions, 604 events. 330/604 cut-off events. For 1142/1156 co-relation queries the response was YES. Maximal size of possible extension queue 46. Compared 2679 event pairs, 95 based on Foata normal form. 3/598 useless extension candidates. Maximal degree in co-relation 2152. Up to 372 conditions per place. [2025-03-04 10:11:42,390 INFO L140 encePairwiseOnDemand]: 48/54 looper letters, 69 selfloop transitions, 7 changer transitions 6/86 dead transitions. [2025-03-04 10:11:42,390 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 70 places, 86 transitions, 639 flow [2025-03-04 10:11:42,390 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 10:11:42,390 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-03-04 10:11:42,390 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 94 transitions. [2025-03-04 10:11:42,391 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.34814814814814815 [2025-03-04 10:11:42,391 INFO L175 Difference]: Start difference. First operand has 66 places, 62 transitions, 362 flow. Second operand 5 states and 94 transitions. [2025-03-04 10:11:42,391 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 70 places, 86 transitions, 639 flow [2025-03-04 10:11:42,395 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 67 places, 86 transitions, 598 flow, removed 13 selfloop flow, removed 3 redundant places. [2025-03-04 10:11:42,396 INFO L231 Difference]: Finished difference. Result has 69 places, 62 transitions, 347 flow [2025-03-04 10:11:42,396 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=54, PETRI_DIFFERENCE_MINUEND_FLOW=325, PETRI_DIFFERENCE_MINUEND_PLACES=63, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=62, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=55, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=347, PETRI_PLACES=69, PETRI_TRANSITIONS=62} [2025-03-04 10:11:42,396 INFO L279 CegarLoopForPetriNet]: 54 programPoint places, 15 predicate places. [2025-03-04 10:11:42,396 INFO L471 AbstractCegarLoop]: Abstraction has has 69 places, 62 transitions, 347 flow [2025-03-04 10:11:42,396 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 13.2) internal successors, (66), 5 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:11:42,396 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 10:11:42,396 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] [2025-03-04 10:11:42,397 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-04 10:11:42,397 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err8REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err9REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 45 more)] === [2025-03-04 10:11:42,397 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:11:42,397 INFO L85 PathProgramCache]: Analyzing trace with hash 410813867, now seen corresponding path program 2 times [2025-03-04 10:11:42,397 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:11:42,397 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1092434991] [2025-03-04 10:11:42,397 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 10:11:42,397 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:11:42,402 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 22 statements into 2 equivalence classes. [2025-03-04 10:11:42,410 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 22 of 22 statements. [2025-03-04 10:11:42,411 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 10:11:42,411 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:11:42,454 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-04 10:11:42,455 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:11:42,455 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1092434991] [2025-03-04 10:11:42,455 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1092434991] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 10:11:42,455 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1442160619] [2025-03-04 10:11:42,455 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 10:11:42,455 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:11:42,455 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:11:42,457 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 10:11:42,458 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-03-04 10:11:42,506 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 22 statements into 2 equivalence classes. [2025-03-04 10:11:42,523 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 22 of 22 statements. [2025-03-04 10:11:42,523 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 10:11:42,523 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:11:42,524 INFO L256 TraceCheckSpWp]: Trace formula consists of 197 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-04 10:11:42,525 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:11:42,542 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-04 10:11:42,542 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 10:11:42,558 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-04 10:11:42,559 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1442160619] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 10:11:42,559 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 10:11:42,559 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5] total 9 [2025-03-04 10:11:42,559 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [529759089] [2025-03-04 10:11:42,559 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 10:11:42,559 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-04 10:11:42,559 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:11:42,560 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-04 10:11:42,560 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2025-03-04 10:11:42,562 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 54 [2025-03-04 10:11:42,562 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 69 places, 62 transitions, 347 flow. Second operand has 9 states, 9 states have (on average 11.222222222222221) internal successors, (101), 9 states have internal predecessors, (101), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:11:42,562 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 10:11:42,562 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 54 [2025-03-04 10:11:42,562 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 10:11:42,825 INFO L124 PetriNetUnfolderBase]: 553/960 cut-off events. [2025-03-04 10:11:42,826 INFO L125 PetriNetUnfolderBase]: For 1660/1660 co-relation queries the response was YES. [2025-03-04 10:11:42,827 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3477 conditions, 960 events. 553/960 cut-off events. For 1660/1660 co-relation queries the response was YES. Maximal size of possible extension queue 63. Compared 4308 event pairs, 23 based on Foata normal form. 12/972 useless extension candidates. Maximal degree in co-relation 3439. Up to 172 conditions per place. [2025-03-04 10:11:42,830 INFO L140 encePairwiseOnDemand]: 46/54 looper letters, 100 selfloop transitions, 67 changer transitions 1/169 dead transitions. [2025-03-04 10:11:42,830 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 81 places, 169 transitions, 1251 flow [2025-03-04 10:11:42,830 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-03-04 10:11:42,830 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2025-03-04 10:11:42,831 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 207 transitions. [2025-03-04 10:11:42,831 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.27380952380952384 [2025-03-04 10:11:42,831 INFO L175 Difference]: Start difference. First operand has 69 places, 62 transitions, 347 flow. Second operand 14 states and 207 transitions. [2025-03-04 10:11:42,832 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 81 places, 169 transitions, 1251 flow [2025-03-04 10:11:42,837 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 78 places, 169 transitions, 1195 flow, removed 7 selfloop flow, removed 3 redundant places. [2025-03-04 10:11:42,839 INFO L231 Difference]: Finished difference. Result has 87 places, 111 transitions, 901 flow [2025-03-04 10:11:42,839 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=54, PETRI_DIFFERENCE_MINUEND_FLOW=331, PETRI_DIFFERENCE_MINUEND_PLACES=65, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=62, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=20, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=14, PETRI_FLOW=901, PETRI_PLACES=87, PETRI_TRANSITIONS=111} [2025-03-04 10:11:42,840 INFO L279 CegarLoopForPetriNet]: 54 programPoint places, 33 predicate places. [2025-03-04 10:11:42,840 INFO L471 AbstractCegarLoop]: Abstraction has has 87 places, 111 transitions, 901 flow [2025-03-04 10:11:42,840 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 11.222222222222221) internal successors, (101), 9 states have internal predecessors, (101), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:11:42,840 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 10:11:42,840 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] [2025-03-04 10:11:42,847 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2025-03-04 10:11:43,045 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,SelfDestructingSolverStorable14 [2025-03-04 10:11:43,045 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err8REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err9REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 45 more)] === [2025-03-04 10:11:43,045 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:11:43,045 INFO L85 PathProgramCache]: Analyzing trace with hash -417011846, now seen corresponding path program 3 times [2025-03-04 10:11:43,046 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:11:43,046 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1840694020] [2025-03-04 10:11:43,046 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-04 10:11:43,046 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:11:43,055 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 22 statements into 2 equivalence classes. [2025-03-04 10:11:43,064 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 22 of 22 statements. [2025-03-04 10:11:43,064 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-03-04 10:11:43,064 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:11:43,108 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-04 10:11:43,108 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:11:43,108 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1840694020] [2025-03-04 10:11:43,108 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1840694020] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:11:43,108 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 10:11:43,108 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-04 10:11:43,109 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [768317471] [2025-03-04 10:11:43,109 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:11:43,109 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 10:11:43,109 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:11:43,109 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 10:11:43,110 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-04 10:11:43,119 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 54 [2025-03-04 10:11:43,120 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 87 places, 111 transitions, 901 flow. Second operand has 5 states, 5 states have (on average 13.2) internal successors, (66), 5 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:11:43,120 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 10:11:43,120 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 54 [2025-03-04 10:11:43,120 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 10:11:43,262 INFO L124 PetriNetUnfolderBase]: 535/960 cut-off events. [2025-03-04 10:11:43,262 INFO L125 PetriNetUnfolderBase]: For 3295/3305 co-relation queries the response was YES. [2025-03-04 10:11:43,264 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4246 conditions, 960 events. 535/960 cut-off events. For 3295/3305 co-relation queries the response was YES. Maximal size of possible extension queue 65. Compared 4618 event pairs, 129 based on Foata normal form. 2/956 useless extension candidates. Maximal degree in co-relation 4200. Up to 604 conditions per place. [2025-03-04 10:11:43,268 INFO L140 encePairwiseOnDemand]: 47/54 looper letters, 94 selfloop transitions, 30 changer transitions 2/142 dead transitions. [2025-03-04 10:11:43,268 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 91 places, 142 transitions, 1390 flow [2025-03-04 10:11:43,268 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 10:11:43,268 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-03-04 10:11:43,269 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 92 transitions. [2025-03-04 10:11:43,269 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.34074074074074073 [2025-03-04 10:11:43,269 INFO L175 Difference]: Start difference. First operand has 87 places, 111 transitions, 901 flow. Second operand 5 states and 92 transitions. [2025-03-04 10:11:43,269 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 91 places, 142 transitions, 1390 flow [2025-03-04 10:11:43,280 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 91 places, 142 transitions, 1332 flow, removed 29 selfloop flow, removed 0 redundant places. [2025-03-04 10:11:43,281 INFO L231 Difference]: Finished difference. Result has 94 places, 120 transitions, 1059 flow [2025-03-04 10:11:43,282 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=54, PETRI_DIFFERENCE_MINUEND_FLOW=865, PETRI_DIFFERENCE_MINUEND_PLACES=87, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=111, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=21, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=86, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=1059, PETRI_PLACES=94, PETRI_TRANSITIONS=120} [2025-03-04 10:11:43,282 INFO L279 CegarLoopForPetriNet]: 54 programPoint places, 40 predicate places. [2025-03-04 10:11:43,282 INFO L471 AbstractCegarLoop]: Abstraction has has 94 places, 120 transitions, 1059 flow [2025-03-04 10:11:43,282 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 13.2) internal successors, (66), 5 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:11:43,282 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 10:11:43,283 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] [2025-03-04 10:11:43,283 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-03-04 10:11:43,283 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err8REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err9REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 45 more)] === [2025-03-04 10:11:43,283 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:11:43,283 INFO L85 PathProgramCache]: Analyzing trace with hash -373096488, now seen corresponding path program 4 times [2025-03-04 10:11:43,283 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:11:43,283 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1648185298] [2025-03-04 10:11:43,283 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-04 10:11:43,283 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:11:43,293 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 22 statements into 2 equivalence classes. [2025-03-04 10:11:43,296 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) and asserted 18 of 22 statements. [2025-03-04 10:11:43,297 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) [2025-03-04 10:11:43,297 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:11:43,330 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-04 10:11:43,330 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:11:43,330 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1648185298] [2025-03-04 10:11:43,330 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1648185298] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:11:43,330 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 10:11:43,330 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-04 10:11:43,330 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [560594489] [2025-03-04 10:11:43,331 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:11:43,331 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 10:11:43,331 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:11:43,332 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 10:11:43,332 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-04 10:11:43,336 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 54 [2025-03-04 10:11:43,336 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 94 places, 120 transitions, 1059 flow. Second operand has 5 states, 5 states have (on average 12.2) internal successors, (61), 5 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:11:43,336 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 10:11:43,336 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 54 [2025-03-04 10:11:43,336 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 10:11:43,509 INFO L124 PetriNetUnfolderBase]: 596/1029 cut-off events. [2025-03-04 10:11:43,509 INFO L125 PetriNetUnfolderBase]: For 3548/3548 co-relation queries the response was YES. [2025-03-04 10:11:43,512 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4670 conditions, 1029 events. 596/1029 cut-off events. For 3548/3548 co-relation queries the response was YES. Maximal size of possible extension queue 66. Compared 4668 event pairs, 134 based on Foata normal form. 2/1031 useless extension candidates. Maximal degree in co-relation 4620. Up to 557 conditions per place. [2025-03-04 10:11:43,516 INFO L140 encePairwiseOnDemand]: 48/54 looper letters, 116 selfloop transitions, 26 changer transitions 4/147 dead transitions. [2025-03-04 10:11:43,516 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 98 places, 147 transitions, 1541 flow [2025-03-04 10:11:43,517 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 10:11:43,518 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-03-04 10:11:43,518 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 87 transitions. [2025-03-04 10:11:43,519 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.32222222222222224 [2025-03-04 10:11:43,519 INFO L175 Difference]: Start difference. First operand has 94 places, 120 transitions, 1059 flow. Second operand 5 states and 87 transitions. [2025-03-04 10:11:43,519 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 98 places, 147 transitions, 1541 flow [2025-03-04 10:11:43,530 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 96 places, 147 transitions, 1486 flow, removed 11 selfloop flow, removed 2 redundant places. [2025-03-04 10:11:43,532 INFO L231 Difference]: Finished difference. Result has 98 places, 120 transitions, 1074 flow [2025-03-04 10:11:43,532 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=54, PETRI_DIFFERENCE_MINUEND_FLOW=1013, PETRI_DIFFERENCE_MINUEND_PLACES=92, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=120, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=26, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=94, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=1074, PETRI_PLACES=98, PETRI_TRANSITIONS=120} [2025-03-04 10:11:43,533 INFO L279 CegarLoopForPetriNet]: 54 programPoint places, 44 predicate places. [2025-03-04 10:11:43,533 INFO L471 AbstractCegarLoop]: Abstraction has has 98 places, 120 transitions, 1074 flow [2025-03-04 10:11:43,533 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.2) internal successors, (61), 5 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:11:43,533 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 10:11:43,533 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] [2025-03-04 10:11:43,533 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-03-04 10:11:43,533 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err8REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err9REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 45 more)] === [2025-03-04 10:11:43,534 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:11:43,534 INFO L85 PathProgramCache]: Analyzing trace with hash -1763715349, now seen corresponding path program 3 times [2025-03-04 10:11:43,534 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:11:43,534 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [748126477] [2025-03-04 10:11:43,534 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-04 10:11:43,534 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:11:43,540 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 22 statements into 2 equivalence classes. [2025-03-04 10:11:43,546 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 22 of 22 statements. [2025-03-04 10:11:43,546 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-03-04 10:11:43,546 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:11:43,592 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-04 10:11:43,593 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:11:43,593 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [748126477] [2025-03-04 10:11:43,593 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [748126477] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 10:11:43,593 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1247082904] [2025-03-04 10:11:43,593 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-04 10:11:43,593 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:11:43,593 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:11:43,595 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 10:11:43,597 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-03-04 10:11:43,643 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 22 statements into 2 equivalence classes. [2025-03-04 10:11:43,660 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 22 of 22 statements. [2025-03-04 10:11:43,660 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-03-04 10:11:43,660 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:11:43,661 INFO L256 TraceCheckSpWp]: Trace formula consists of 197 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-04 10:11:43,662 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:11:43,687 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-04 10:11:43,689 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 10:11:43,710 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-04 10:11:43,711 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1247082904] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 10:11:43,711 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 10:11:43,711 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5] total 11 [2025-03-04 10:11:43,711 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1296800584] [2025-03-04 10:11:43,712 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 10:11:43,712 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-04 10:11:43,712 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:11:43,713 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-04 10:11:43,713 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2025-03-04 10:11:43,720 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 54 [2025-03-04 10:11:43,720 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 98 places, 120 transitions, 1074 flow. Second operand has 11 states, 11 states have (on average 11.181818181818182) internal successors, (123), 11 states have internal predecessors, (123), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:11:43,720 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 10:11:43,720 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 54 [2025-03-04 10:11:43,720 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 10:11:43,969 INFO L124 PetriNetUnfolderBase]: 628/1081 cut-off events. [2025-03-04 10:11:43,970 INFO L125 PetriNetUnfolderBase]: For 4328/4328 co-relation queries the response was YES. [2025-03-04 10:11:43,972 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4879 conditions, 1081 events. 628/1081 cut-off events. For 4328/4328 co-relation queries the response was YES. Maximal size of possible extension queue 72. Compared 4989 event pairs, 110 based on Foata normal form. 16/1097 useless extension candidates. Maximal degree in co-relation 4828. Up to 469 conditions per place. [2025-03-04 10:11:43,976 INFO L140 encePairwiseOnDemand]: 46/54 looper letters, 113 selfloop transitions, 52 changer transitions 0/166 dead transitions. [2025-03-04 10:11:43,976 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 103 places, 166 transitions, 1662 flow [2025-03-04 10:11:43,977 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-04 10:11:43,977 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2025-03-04 10:11:43,977 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 140 transitions. [2025-03-04 10:11:43,977 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.32407407407407407 [2025-03-04 10:11:43,977 INFO L175 Difference]: Start difference. First operand has 98 places, 120 transitions, 1074 flow. Second operand 8 states and 140 transitions. [2025-03-04 10:11:43,978 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 103 places, 166 transitions, 1662 flow [2025-03-04 10:11:43,987 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 100 places, 166 transitions, 1608 flow, removed 2 selfloop flow, removed 3 redundant places. [2025-03-04 10:11:43,989 INFO L231 Difference]: Finished difference. Result has 103 places, 127 transitions, 1227 flow [2025-03-04 10:11:43,989 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=54, PETRI_DIFFERENCE_MINUEND_FLOW=991, PETRI_DIFFERENCE_MINUEND_PLACES=93, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=117, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=42, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=68, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=1227, PETRI_PLACES=103, PETRI_TRANSITIONS=127} [2025-03-04 10:11:43,989 INFO L279 CegarLoopForPetriNet]: 54 programPoint places, 49 predicate places. [2025-03-04 10:11:43,989 INFO L471 AbstractCegarLoop]: Abstraction has has 103 places, 127 transitions, 1227 flow [2025-03-04 10:11:43,989 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 11.181818181818182) internal successors, (123), 11 states have internal predecessors, (123), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:11:43,989 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 10:11:43,990 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] [2025-03-04 10:11:43,996 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-04 10:11:44,192 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,SelfDestructingSolverStorable17 [2025-03-04 10:11:44,192 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err8REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err9REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 45 more)] === [2025-03-04 10:11:44,193 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:11:44,193 INFO L85 PathProgramCache]: Analyzing trace with hash 26565571, now seen corresponding path program 4 times [2025-03-04 10:11:44,193 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:11:44,193 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [538191180] [2025-03-04 10:11:44,193 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-04 10:11:44,193 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:11:44,199 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 22 statements into 2 equivalence classes. [2025-03-04 10:11:44,202 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) and asserted 18 of 22 statements. [2025-03-04 10:11:44,202 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) [2025-03-04 10:11:44,202 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:11:44,226 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-04 10:11:44,226 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:11:44,227 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [538191180] [2025-03-04 10:11:44,227 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [538191180] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:11:44,227 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 10:11:44,227 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-04 10:11:44,227 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1804216845] [2025-03-04 10:11:44,227 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:11:44,228 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 10:11:44,228 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:11:44,228 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 10:11:44,228 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-04 10:11:44,230 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 54 [2025-03-04 10:11:44,230 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 103 places, 127 transitions, 1227 flow. Second operand has 5 states, 5 states have (on average 12.2) internal successors, (61), 5 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:11:44,230 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 10:11:44,230 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 54 [2025-03-04 10:11:44,230 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 10:11:44,396 INFO L124 PetriNetUnfolderBase]: 640/1111 cut-off events. [2025-03-04 10:11:44,396 INFO L125 PetriNetUnfolderBase]: For 4837/4837 co-relation queries the response was YES. [2025-03-04 10:11:44,399 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5275 conditions, 1111 events. 640/1111 cut-off events. For 4837/4837 co-relation queries the response was YES. Maximal size of possible extension queue 76. Compared 5203 event pairs, 93 based on Foata normal form. 6/1117 useless extension candidates. Maximal degree in co-relation 5222. Up to 646 conditions per place. [2025-03-04 10:11:44,403 INFO L140 encePairwiseOnDemand]: 48/54 looper letters, 125 selfloop transitions, 31 changer transitions 1/158 dead transitions. [2025-03-04 10:11:44,403 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 107 places, 158 transitions, 1760 flow [2025-03-04 10:11:44,404 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 10:11:44,405 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-03-04 10:11:44,405 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 86 transitions. [2025-03-04 10:11:44,405 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.31851851851851853 [2025-03-04 10:11:44,405 INFO L175 Difference]: Start difference. First operand has 103 places, 127 transitions, 1227 flow. Second operand 5 states and 86 transitions. [2025-03-04 10:11:44,405 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 107 places, 158 transitions, 1760 flow [2025-03-04 10:11:44,418 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 105 places, 158 transitions, 1720 flow, removed 2 selfloop flow, removed 2 redundant places. [2025-03-04 10:11:44,420 INFO L231 Difference]: Finished difference. Result has 108 places, 134 transitions, 1391 flow [2025-03-04 10:11:44,420 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=54, PETRI_DIFFERENCE_MINUEND_FLOW=1189, PETRI_DIFFERENCE_MINUEND_PLACES=101, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=127, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=24, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=101, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=1391, PETRI_PLACES=108, PETRI_TRANSITIONS=134} [2025-03-04 10:11:44,420 INFO L279 CegarLoopForPetriNet]: 54 programPoint places, 54 predicate places. [2025-03-04 10:11:44,420 INFO L471 AbstractCegarLoop]: Abstraction has has 108 places, 134 transitions, 1391 flow [2025-03-04 10:11:44,420 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.2) internal successors, (61), 5 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:11:44,420 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 10:11:44,421 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] [2025-03-04 10:11:44,421 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-03-04 10:11:44,421 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err8REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err9REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 45 more)] === [2025-03-04 10:11:44,421 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:11:44,421 INFO L85 PathProgramCache]: Analyzing trace with hash -1798647927, now seen corresponding path program 5 times [2025-03-04 10:11:44,421 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:11:44,421 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1542318098] [2025-03-04 10:11:44,421 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-04 10:11:44,421 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:11:44,427 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 22 statements into 2 equivalence classes. [2025-03-04 10:11:44,433 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 22 of 22 statements. [2025-03-04 10:11:44,436 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 10:11:44,436 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:11:44,477 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-04 10:11:44,477 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:11:44,477 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1542318098] [2025-03-04 10:11:44,477 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1542318098] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:11:44,477 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 10:11:44,477 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-04 10:11:44,478 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [477032584] [2025-03-04 10:11:44,478 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:11:44,478 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 10:11:44,478 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:11:44,479 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 10:11:44,479 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-04 10:11:44,482 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 54 [2025-03-04 10:11:44,483 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 108 places, 134 transitions, 1391 flow. Second operand has 5 states, 5 states have (on average 13.2) internal successors, (66), 5 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:11:44,483 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 10:11:44,483 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 54 [2025-03-04 10:11:44,483 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 10:11:44,621 INFO L124 PetriNetUnfolderBase]: 572/1016 cut-off events. [2025-03-04 10:11:44,623 INFO L125 PetriNetUnfolderBase]: For 5382/5392 co-relation queries the response was YES. [2025-03-04 10:11:44,625 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5058 conditions, 1016 events. 572/1016 cut-off events. For 5382/5392 co-relation queries the response was YES. Maximal size of possible extension queue 75. Compared 4902 event pairs, 144 based on Foata normal form. 3/1002 useless extension candidates. Maximal degree in co-relation 5001. Up to 630 conditions per place. [2025-03-04 10:11:44,631 INFO L140 encePairwiseOnDemand]: 48/54 looper letters, 102 selfloop transitions, 29 changer transitions 4/155 dead transitions. [2025-03-04 10:11:44,632 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 112 places, 155 transitions, 1768 flow [2025-03-04 10:11:44,632 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 10:11:44,632 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-03-04 10:11:44,633 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 91 transitions. [2025-03-04 10:11:44,633 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.337037037037037 [2025-03-04 10:11:44,633 INFO L175 Difference]: Start difference. First operand has 108 places, 134 transitions, 1391 flow. Second operand 5 states and 91 transitions. [2025-03-04 10:11:44,633 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 112 places, 155 transitions, 1768 flow [2025-03-04 10:11:44,645 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 111 places, 155 transitions, 1717 flow, removed 16 selfloop flow, removed 1 redundant places. [2025-03-04 10:11:44,647 INFO L231 Difference]: Finished difference. Result has 112 places, 133 transitions, 1392 flow [2025-03-04 10:11:44,647 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=54, PETRI_DIFFERENCE_MINUEND_FLOW=1341, PETRI_DIFFERENCE_MINUEND_PLACES=107, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=134, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=29, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=105, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=1392, PETRI_PLACES=112, PETRI_TRANSITIONS=133} [2025-03-04 10:11:44,648 INFO L279 CegarLoopForPetriNet]: 54 programPoint places, 58 predicate places. [2025-03-04 10:11:44,648 INFO L471 AbstractCegarLoop]: Abstraction has has 112 places, 133 transitions, 1392 flow [2025-03-04 10:11:44,648 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 13.2) internal successors, (66), 5 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:11:44,648 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 10:11:44,648 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] [2025-03-04 10:11:44,648 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-03-04 10:11:44,648 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err8REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err9REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 45 more)] === [2025-03-04 10:11:44,649 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:11:44,649 INFO L85 PathProgramCache]: Analyzing trace with hash 1853792278, now seen corresponding path program 5 times [2025-03-04 10:11:44,649 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:11:44,649 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1836241259] [2025-03-04 10:11:44,649 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-04 10:11:44,649 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:11:44,657 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 22 statements into 2 equivalence classes. [2025-03-04 10:11:44,669 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 22 of 22 statements. [2025-03-04 10:11:44,669 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 10:11:44,670 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:11:44,703 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-04 10:11:44,703 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:11:44,703 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1836241259] [2025-03-04 10:11:44,703 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1836241259] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 10:11:44,703 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [219825082] [2025-03-04 10:11:44,703 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-04 10:11:44,703 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:11:44,704 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:11:44,705 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 10:11:44,707 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2025-03-04 10:11:44,756 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 22 statements into 2 equivalence classes. [2025-03-04 10:11:44,773 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 22 of 22 statements. [2025-03-04 10:11:44,773 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 10:11:44,773 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:11:44,775 INFO L256 TraceCheckSpWp]: Trace formula consists of 197 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-04 10:11:44,777 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:11:44,802 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-04 10:11:44,802 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 10:11:44,825 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-04 10:11:44,825 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [219825082] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 10:11:44,825 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 10:11:44,825 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 9 [2025-03-04 10:11:44,825 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1875438923] [2025-03-04 10:11:44,825 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 10:11:44,826 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-04 10:11:44,826 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:11:44,826 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-04 10:11:44,826 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2025-03-04 10:11:44,835 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 54 [2025-03-04 10:11:44,835 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 112 places, 133 transitions, 1392 flow. Second operand has 9 states, 9 states have (on average 11.666666666666666) internal successors, (105), 9 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:11:44,835 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 10:11:44,836 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 54 [2025-03-04 10:11:44,836 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 10:11:45,046 INFO L124 PetriNetUnfolderBase]: 697/1212 cut-off events. [2025-03-04 10:11:45,046 INFO L125 PetriNetUnfolderBase]: For 6178/6178 co-relation queries the response was YES. [2025-03-04 10:11:45,050 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5960 conditions, 1212 events. 697/1212 cut-off events. For 6178/6178 co-relation queries the response was YES. Maximal size of possible extension queue 90. Compared 5924 event pairs, 47 based on Foata normal form. 9/1221 useless extension candidates. Maximal degree in co-relation 5902. Up to 349 conditions per place. [2025-03-04 10:11:45,058 INFO L140 encePairwiseOnDemand]: 47/54 looper letters, 117 selfloop transitions, 64 changer transitions 0/182 dead transitions. [2025-03-04 10:11:45,058 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 118 places, 182 transitions, 2088 flow [2025-03-04 10:11:45,059 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-04 10:11:45,059 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2025-03-04 10:11:45,059 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 125 transitions. [2025-03-04 10:11:45,059 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.28935185185185186 [2025-03-04 10:11:45,059 INFO L175 Difference]: Start difference. First operand has 112 places, 133 transitions, 1392 flow. Second operand 8 states and 125 transitions. [2025-03-04 10:11:45,060 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 118 places, 182 transitions, 2088 flow [2025-03-04 10:11:45,075 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 114 places, 182 transitions, 2024 flow, removed 3 selfloop flow, removed 4 redundant places. [2025-03-04 10:11:45,078 INFO L231 Difference]: Finished difference. Result has 119 places, 149 transitions, 1716 flow [2025-03-04 10:11:45,078 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=54, PETRI_DIFFERENCE_MINUEND_FLOW=1330, PETRI_DIFFERENCE_MINUEND_PLACES=107, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=133, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=48, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=77, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=1716, PETRI_PLACES=119, PETRI_TRANSITIONS=149} [2025-03-04 10:11:45,078 INFO L279 CegarLoopForPetriNet]: 54 programPoint places, 65 predicate places. [2025-03-04 10:11:45,078 INFO L471 AbstractCegarLoop]: Abstraction has has 119 places, 149 transitions, 1716 flow [2025-03-04 10:11:45,079 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 11.666666666666666) internal successors, (105), 9 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:11:45,079 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 10:11:45,079 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] [2025-03-04 10:11:45,085 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2025-03-04 10:11:45,279 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:11:45,280 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err8REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err9REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 45 more)] === [2025-03-04 10:11:45,280 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:11:45,280 INFO L85 PathProgramCache]: Analyzing trace with hash -1989288998, now seen corresponding path program 6 times [2025-03-04 10:11:45,280 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:11:45,280 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [33483291] [2025-03-04 10:11:45,280 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-03-04 10:11:45,280 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:11:45,287 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 22 statements into 2 equivalence classes. [2025-03-04 10:11:45,294 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) and asserted 22 of 22 statements. [2025-03-04 10:11:45,294 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) [2025-03-04 10:11:45,294 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:11:45,326 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-04 10:11:45,326 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:11:45,326 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [33483291] [2025-03-04 10:11:45,326 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [33483291] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:11:45,326 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 10:11:45,326 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-04 10:11:45,326 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [472360627] [2025-03-04 10:11:45,326 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:11:45,327 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 10:11:45,327 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:11:45,328 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 10:11:45,328 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-04 10:11:45,332 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 54 [2025-03-04 10:11:45,332 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 119 places, 149 transitions, 1716 flow. Second operand has 5 states, 5 states have (on average 13.2) internal successors, (66), 5 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:11:45,332 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 10:11:45,332 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 54 [2025-03-04 10:11:45,332 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 10:11:45,529 INFO L124 PetriNetUnfolderBase]: 623/1127 cut-off events. [2025-03-04 10:11:45,529 INFO L125 PetriNetUnfolderBase]: For 7944/7950 co-relation queries the response was YES. [2025-03-04 10:11:45,532 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6048 conditions, 1127 events. 623/1127 cut-off events. For 7944/7950 co-relation queries the response was YES. Maximal size of possible extension queue 92. Compared 5790 event pairs, 128 based on Foata normal form. 2/1109 useless extension candidates. Maximal degree in co-relation 5987. Up to 608 conditions per place. [2025-03-04 10:11:45,536 INFO L140 encePairwiseOnDemand]: 47/54 looper letters, 104 selfloop transitions, 38 changer transitions 3/169 dead transitions. [2025-03-04 10:11:45,536 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 123 places, 169 transitions, 2160 flow [2025-03-04 10:11:45,537 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 10:11:45,537 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-03-04 10:11:45,537 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 91 transitions. [2025-03-04 10:11:45,537 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.337037037037037 [2025-03-04 10:11:45,537 INFO L175 Difference]: Start difference. First operand has 119 places, 149 transitions, 1716 flow. Second operand 5 states and 91 transitions. [2025-03-04 10:11:45,537 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 123 places, 169 transitions, 2160 flow [2025-03-04 10:11:45,552 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 122 places, 169 transitions, 2151 flow, removed 3 selfloop flow, removed 1 redundant places. [2025-03-04 10:11:45,554 INFO L231 Difference]: Finished difference. Result has 124 places, 150 transitions, 1827 flow [2025-03-04 10:11:45,555 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=54, PETRI_DIFFERENCE_MINUEND_FLOW=1707, PETRI_DIFFERENCE_MINUEND_PLACES=118, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=149, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=36, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=111, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=1827, PETRI_PLACES=124, PETRI_TRANSITIONS=150} [2025-03-04 10:11:45,555 INFO L279 CegarLoopForPetriNet]: 54 programPoint places, 70 predicate places. [2025-03-04 10:11:45,555 INFO L471 AbstractCegarLoop]: Abstraction has has 124 places, 150 transitions, 1827 flow [2025-03-04 10:11:45,555 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 13.2) internal successors, (66), 5 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:11:45,556 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 10:11:45,556 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:11:45,556 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2025-03-04 10:11:45,556 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err8REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err9REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 45 more)] === [2025-03-04 10:11:45,556 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:11:45,556 INFO L85 PathProgramCache]: Analyzing trace with hash 1057135177, now seen corresponding path program 6 times [2025-03-04 10:11:45,556 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:11:45,556 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [576776588] [2025-03-04 10:11:45,557 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-03-04 10:11:45,557 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:11:45,561 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 22 statements into 2 equivalence classes. [2025-03-04 10:11:45,567 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) and asserted 22 of 22 statements. [2025-03-04 10:11:45,567 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) [2025-03-04 10:11:45,567 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:11:45,610 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-04 10:11:45,611 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:11:45,611 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [576776588] [2025-03-04 10:11:45,611 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [576776588] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 10:11:45,611 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [873172851] [2025-03-04 10:11:45,611 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-03-04 10:11:45,611 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:11:45,611 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:11:45,613 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 10:11:45,614 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2025-03-04 10:11:45,664 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 22 statements into 2 equivalence classes. [2025-03-04 10:11:45,681 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) and asserted 22 of 22 statements. [2025-03-04 10:11:45,681 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) [2025-03-04 10:11:45,681 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:11:45,682 INFO L256 TraceCheckSpWp]: Trace formula consists of 197 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-04 10:11:45,683 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:11:45,708 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-04 10:11:45,709 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 10:11:45,730 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-04 10:11:45,730 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [873172851] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 10:11:45,731 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 10:11:45,731 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5] total 11 [2025-03-04 10:11:45,731 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1674134622] [2025-03-04 10:11:45,731 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 10:11:45,731 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-04 10:11:45,731 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:11:45,731 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-04 10:11:45,731 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=73, Unknown=0, NotChecked=0, Total=110 [2025-03-04 10:11:45,733 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 54 [2025-03-04 10:11:45,734 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 124 places, 150 transitions, 1827 flow. Second operand has 11 states, 11 states have (on average 11.272727272727273) internal successors, (124), 11 states have internal predecessors, (124), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:11:45,734 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 10:11:45,734 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 54 [2025-03-04 10:11:45,734 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 10:11:46,046 INFO L124 PetriNetUnfolderBase]: 749/1290 cut-off events. [2025-03-04 10:11:46,047 INFO L125 PetriNetUnfolderBase]: For 9345/9345 co-relation queries the response was YES. [2025-03-04 10:11:46,050 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7018 conditions, 1290 events. 749/1290 cut-off events. For 9345/9345 co-relation queries the response was YES. Maximal size of possible extension queue 100. Compared 6305 event pairs, 39 based on Foata normal form. 16/1306 useless extension candidates. Maximal degree in co-relation 6955. Up to 241 conditions per place. [2025-03-04 10:11:46,054 INFO L140 encePairwiseOnDemand]: 46/54 looper letters, 125 selfloop transitions, 92 changer transitions 1/219 dead transitions. [2025-03-04 10:11:46,054 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 136 places, 219 transitions, 2660 flow [2025-03-04 10:11:46,054 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-03-04 10:11:46,054 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2025-03-04 10:11:46,055 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 229 transitions. [2025-03-04 10:11:46,055 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.28271604938271605 [2025-03-04 10:11:46,055 INFO L175 Difference]: Start difference. First operand has 124 places, 150 transitions, 1827 flow. Second operand 15 states and 229 transitions. [2025-03-04 10:11:46,055 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 136 places, 219 transitions, 2660 flow [2025-03-04 10:11:46,071 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 130 places, 219 transitions, 2585 flow, removed 7 selfloop flow, removed 6 redundant places. [2025-03-04 10:11:46,073 INFO L231 Difference]: Finished difference. Result has 133 places, 159 transitions, 2053 flow [2025-03-04 10:11:46,073 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=54, PETRI_DIFFERENCE_MINUEND_FLOW=1657, PETRI_DIFFERENCE_MINUEND_PLACES=116, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=144, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=77, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=63, PETRI_DIFFERENCE_SUBTRAHEND_STATES=15, PETRI_FLOW=2053, PETRI_PLACES=133, PETRI_TRANSITIONS=159} [2025-03-04 10:11:46,074 INFO L279 CegarLoopForPetriNet]: 54 programPoint places, 79 predicate places. [2025-03-04 10:11:46,074 INFO L471 AbstractCegarLoop]: Abstraction has has 133 places, 159 transitions, 2053 flow [2025-03-04 10:11:46,074 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 11.272727272727273) internal successors, (124), 11 states have internal predecessors, (124), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:11:46,074 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 10:11:46,074 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] [2025-03-04 10:11:46,081 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2025-03-04 10:11:46,274 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable22 [2025-03-04 10:11:46,275 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err8REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err9REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 45 more)] === [2025-03-04 10:11:46,275 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:11:46,275 INFO L85 PathProgramCache]: Analyzing trace with hash -1040595268, now seen corresponding path program 7 times [2025-03-04 10:11:46,275 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:11:46,275 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [772707535] [2025-03-04 10:11:46,275 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-03-04 10:11:46,275 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:11:46,281 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-03-04 10:11:46,285 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-03-04 10:11:46,285 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:11:46,285 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:11:46,334 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-04 10:11:46,334 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:11:46,334 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [772707535] [2025-03-04 10:11:46,334 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [772707535] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 10:11:46,334 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [523256744] [2025-03-04 10:11:46,335 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-03-04 10:11:46,335 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:11:46,335 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:11:46,337 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 10:11:46,338 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2025-03-04 10:11:46,390 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-03-04 10:11:46,408 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-03-04 10:11:46,409 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:11:46,409 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:11:46,409 INFO L256 TraceCheckSpWp]: Trace formula consists of 197 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-04 10:11:46,412 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:11:46,435 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-04 10:11:46,435 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 10:11:46,453 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-04 10:11:46,453 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [523256744] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 10:11:46,453 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 10:11:46,453 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5] total 11 [2025-03-04 10:11:46,453 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [427277198] [2025-03-04 10:11:46,453 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 10:11:46,454 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-04 10:11:46,454 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:11:46,454 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-04 10:11:46,454 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2025-03-04 10:11:46,457 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 54 [2025-03-04 10:11:46,457 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 133 places, 159 transitions, 2053 flow. Second operand has 11 states, 11 states have (on average 10.909090909090908) internal successors, (120), 11 states have internal predecessors, (120), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:11:46,457 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 10:11:46,457 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 54 [2025-03-04 10:11:46,457 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 10:11:46,696 INFO L124 PetriNetUnfolderBase]: 733/1257 cut-off events. [2025-03-04 10:11:46,696 INFO L125 PetriNetUnfolderBase]: For 10985/10985 co-relation queries the response was YES. [2025-03-04 10:11:46,700 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7095 conditions, 1257 events. 733/1257 cut-off events. For 10985/10985 co-relation queries the response was YES. Maximal size of possible extension queue 97. Compared 6100 event pairs, 110 based on Foata normal form. 9/1266 useless extension candidates. Maximal degree in co-relation 7035. Up to 475 conditions per place. [2025-03-04 10:11:46,705 INFO L140 encePairwiseOnDemand]: 46/54 looper letters, 127 selfloop transitions, 62 changer transitions 1/191 dead transitions. [2025-03-04 10:11:46,705 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 139 places, 191 transitions, 2602 flow [2025-03-04 10:11:46,705 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-04 10:11:46,706 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2025-03-04 10:11:46,706 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 134 transitions. [2025-03-04 10:11:46,706 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.3101851851851852 [2025-03-04 10:11:46,706 INFO L175 Difference]: Start difference. First operand has 133 places, 159 transitions, 2053 flow. Second operand 8 states and 134 transitions. [2025-03-04 10:11:46,706 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 139 places, 191 transitions, 2602 flow [2025-03-04 10:11:46,727 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 132 places, 191 transitions, 2465 flow, removed 11 selfloop flow, removed 7 redundant places. [2025-03-04 10:11:46,729 INFO L231 Difference]: Finished difference. Result has 133 places, 159 transitions, 2026 flow [2025-03-04 10:11:46,729 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=54, PETRI_DIFFERENCE_MINUEND_FLOW=1894, PETRI_DIFFERENCE_MINUEND_PLACES=125, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=158, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=60, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=96, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=2026, PETRI_PLACES=133, PETRI_TRANSITIONS=159} [2025-03-04 10:11:46,730 INFO L279 CegarLoopForPetriNet]: 54 programPoint places, 79 predicate places. [2025-03-04 10:11:46,730 INFO L471 AbstractCegarLoop]: Abstraction has has 133 places, 159 transitions, 2026 flow [2025-03-04 10:11:46,730 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 10.909090909090908) internal successors, (120), 11 states have internal predecessors, (120), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:11:46,730 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 10:11:46,730 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-04 10:11:46,736 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-04 10:11:46,930 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable23 [2025-03-04 10:11:46,930 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err8REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err9REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 45 more)] === [2025-03-04 10:11:46,931 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:11:46,931 INFO L85 PathProgramCache]: Analyzing trace with hash -2011697012, now seen corresponding path program 1 times [2025-03-04 10:11:46,931 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:11:46,931 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [368628473] [2025-03-04 10:11:46,931 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:11:46,931 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:11:46,937 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-03-04 10:11:46,944 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-03-04 10:11:46,944 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:11:46,944 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:11:47,070 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-04 10:11:47,070 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:11:47,070 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [368628473] [2025-03-04 10:11:47,070 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [368628473] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 10:11:47,070 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2051654666] [2025-03-04 10:11:47,070 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:11:47,070 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:11:47,070 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:11:47,072 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 10:11:47,073 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2025-03-04 10:11:47,126 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-03-04 10:11:47,145 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-03-04 10:11:47,146 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:11:47,146 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:11:47,149 INFO L256 TraceCheckSpWp]: Trace formula consists of 215 conjuncts, 14 conjuncts are in the unsatisfiable core [2025-03-04 10:11:47,150 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:11:47,229 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-04 10:11:47,229 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 10:11:47,249 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 51 treesize of output 19 [2025-03-04 10:11:47,343 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-04 10:11:47,344 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2051654666] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 10:11:47,344 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 10:11:47,344 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5] total 12 [2025-03-04 10:11:47,344 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [450054833] [2025-03-04 10:11:47,344 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 10:11:47,344 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-03-04 10:11:47,345 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:11:47,345 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-03-04 10:11:47,345 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=115, Unknown=0, NotChecked=0, Total=156 [2025-03-04 10:11:47,378 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 54 [2025-03-04 10:11:47,379 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 133 places, 159 transitions, 2026 flow. Second operand has 13 states, 13 states have (on average 14.153846153846153) internal successors, (184), 13 states have internal predecessors, (184), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:11:47,379 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 10:11:47,379 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 54 [2025-03-04 10:11:47,379 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 10:11:47,775 INFO L124 PetriNetUnfolderBase]: 1449/2653 cut-off events. [2025-03-04 10:11:47,776 INFO L125 PetriNetUnfolderBase]: For 24767/24890 co-relation queries the response was YES. [2025-03-04 10:11:47,784 INFO L83 FinitePrefix]: Finished finitePrefix Result has 15201 conditions, 2653 events. 1449/2653 cut-off events. For 24767/24890 co-relation queries the response was YES. Maximal size of possible extension queue 185. Compared 16329 event pairs, 189 based on Foata normal form. 101/2745 useless extension candidates. Maximal degree in co-relation 13755. Up to 851 conditions per place. [2025-03-04 10:11:47,793 INFO L140 encePairwiseOnDemand]: 45/54 looper letters, 331 selfloop transitions, 19 changer transitions 19/419 dead transitions. [2025-03-04 10:11:47,793 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 140 places, 419 transitions, 6239 flow [2025-03-04 10:11:47,793 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-04 10:11:47,793 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2025-03-04 10:11:47,794 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 175 transitions. [2025-03-04 10:11:47,794 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.360082304526749 [2025-03-04 10:11:47,794 INFO L175 Difference]: Start difference. First operand has 133 places, 159 transitions, 2026 flow. Second operand 9 states and 175 transitions. [2025-03-04 10:11:47,794 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 140 places, 419 transitions, 6239 flow [2025-03-04 10:11:47,852 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 128 places, 419 transitions, 5735 flow, removed 24 selfloop flow, removed 12 redundant places. [2025-03-04 10:11:47,855 INFO L231 Difference]: Finished difference. Result has 133 places, 174 transitions, 1994 flow [2025-03-04 10:11:47,855 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=54, PETRI_DIFFERENCE_MINUEND_FLOW=1836, PETRI_DIFFERENCE_MINUEND_PLACES=120, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=159, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=144, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1994, PETRI_PLACES=133, PETRI_TRANSITIONS=174} [2025-03-04 10:11:47,855 INFO L279 CegarLoopForPetriNet]: 54 programPoint places, 79 predicate places. [2025-03-04 10:11:47,855 INFO L471 AbstractCegarLoop]: Abstraction has has 133 places, 174 transitions, 1994 flow [2025-03-04 10:11:47,856 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 14.153846153846153) internal successors, (184), 13 states have internal predecessors, (184), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:11:47,856 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 10:11:47,856 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-04 10:11:47,862 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2025-03-04 10:11:48,056 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,SelfDestructingSolverStorable24 [2025-03-04 10:11:48,058 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err8REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err9REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 45 more)] === [2025-03-04 10:11:48,058 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:11:48,058 INFO L85 PathProgramCache]: Analyzing trace with hash -1356971118, now seen corresponding path program 2 times [2025-03-04 10:11:48,058 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:11:48,058 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1792551848] [2025-03-04 10:11:48,058 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 10:11:48,058 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:11:48,064 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 25 statements into 2 equivalence classes. [2025-03-04 10:11:48,074 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 25 of 25 statements. [2025-03-04 10:11:48,074 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 10:11:48,074 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:11:48,262 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 10:11:48,262 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:11:48,262 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1792551848] [2025-03-04 10:11:48,262 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1792551848] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 10:11:48,262 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [74040491] [2025-03-04 10:11:48,262 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 10:11:48,262 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:11:48,262 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:11:48,264 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 10:11:48,266 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2025-03-04 10:11:48,320 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 25 statements into 2 equivalence classes. [2025-03-04 10:11:48,339 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 25 of 25 statements. [2025-03-04 10:11:48,340 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 10:11:48,340 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:11:48,340 INFO L256 TraceCheckSpWp]: Trace formula consists of 215 conjuncts, 11 conjuncts are in the unsatisfiable core [2025-03-04 10:11:48,341 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:11:48,429 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-04 10:11:48,429 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 3 new quantified variables, introduced 1 case distinctions, treesize of input 62 treesize of output 37 [2025-03-04 10:11:48,443 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-04 10:11:48,443 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 10:11:48,443 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [74040491] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:11:48,443 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-04 10:11:48,443 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [8] total 12 [2025-03-04 10:11:48,443 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [745208632] [2025-03-04 10:11:48,443 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:11:48,444 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-04 10:11:48,445 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:11:48,445 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-04 10:11:48,445 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2025-03-04 10:11:48,453 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 54 [2025-03-04 10:11:48,453 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 133 places, 174 transitions, 1994 flow. Second operand has 7 states, 7 states have (on average 13.142857142857142) internal successors, (92), 7 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:11:48,454 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 10:11:48,454 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 54 [2025-03-04 10:11:48,454 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 10:11:48,849 INFO L124 PetriNetUnfolderBase]: 1948/3555 cut-off events. [2025-03-04 10:11:48,850 INFO L125 PetriNetUnfolderBase]: For 27257/27432 co-relation queries the response was YES. [2025-03-04 10:11:48,865 INFO L83 FinitePrefix]: Finished finitePrefix Result has 19375 conditions, 3555 events. 1948/3555 cut-off events. For 27257/27432 co-relation queries the response was YES. Maximal size of possible extension queue 216. Compared 22867 event pairs, 206 based on Foata normal form. 105/3641 useless extension candidates. Maximal degree in co-relation 16271. Up to 2121 conditions per place. [2025-03-04 10:11:48,881 INFO L140 encePairwiseOnDemand]: 49/54 looper letters, 212 selfloop transitions, 12 changer transitions 1/275 dead transitions. [2025-03-04 10:11:48,881 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 137 places, 275 transitions, 3650 flow [2025-03-04 10:11:48,881 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 10:11:48,882 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-03-04 10:11:48,882 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 97 transitions. [2025-03-04 10:11:48,882 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.3592592592592593 [2025-03-04 10:11:48,882 INFO L175 Difference]: Start difference. First operand has 133 places, 174 transitions, 1994 flow. Second operand 5 states and 97 transitions. [2025-03-04 10:11:48,882 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 137 places, 275 transitions, 3650 flow [2025-03-04 10:11:48,951 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 136 places, 275 transitions, 3646 flow, removed 1 selfloop flow, removed 1 redundant places. [2025-03-04 10:11:48,955 INFO L231 Difference]: Finished difference. Result has 138 places, 180 transitions, 2083 flow [2025-03-04 10:11:48,955 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=54, PETRI_DIFFERENCE_MINUEND_FLOW=1990, PETRI_DIFFERENCE_MINUEND_PLACES=132, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=174, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=162, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=2083, PETRI_PLACES=138, PETRI_TRANSITIONS=180} [2025-03-04 10:11:48,956 INFO L279 CegarLoopForPetriNet]: 54 programPoint places, 84 predicate places. [2025-03-04 10:11:48,956 INFO L471 AbstractCegarLoop]: Abstraction has has 138 places, 180 transitions, 2083 flow [2025-03-04 10:11:48,957 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 13.142857142857142) internal successors, (92), 7 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:11:48,957 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 10:11:48,957 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:11:48,963 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Ended with exit code 0 [2025-03-04 10:11:49,157 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,SelfDestructingSolverStorable25 [2025-03-04 10:11:49,157 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err8REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err9REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 45 more)] === [2025-03-04 10:11:49,158 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:11:49,158 INFO L85 PathProgramCache]: Analyzing trace with hash 487066503, now seen corresponding path program 3 times [2025-03-04 10:11:49,158 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:11:49,158 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1726754434] [2025-03-04 10:11:49,158 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-04 10:11:49,158 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:11:49,168 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 28 statements into 2 equivalence classes. [2025-03-04 10:11:49,182 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 28 of 28 statements. [2025-03-04 10:11:49,182 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-03-04 10:11:49,182 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:11:49,241 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-04 10:11:49,241 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:11:49,241 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1726754434] [2025-03-04 10:11:49,241 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1726754434] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 10:11:49,241 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1420854796] [2025-03-04 10:11:49,241 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-04 10:11:49,241 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:11:49,242 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:11:49,243 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 10:11:49,245 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2025-03-04 10:11:49,299 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 28 statements into 2 equivalence classes. [2025-03-04 10:11:49,323 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 28 of 28 statements. [2025-03-04 10:11:49,324 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-03-04 10:11:49,324 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:11:49,325 INFO L256 TraceCheckSpWp]: Trace formula consists of 233 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-04 10:11:49,326 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:11:49,394 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-04 10:11:49,394 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 10:11:49,446 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-04 10:11:49,446 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1420854796] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 10:11:49,446 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 10:11:49,447 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 15 [2025-03-04 10:11:49,447 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1588641153] [2025-03-04 10:11:49,447 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 10:11:49,447 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-03-04 10:11:49,447 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:11:49,447 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-03-04 10:11:49,447 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=157, Unknown=0, NotChecked=0, Total=210 [2025-03-04 10:11:49,464 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 54 [2025-03-04 10:11:49,464 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 138 places, 180 transitions, 2083 flow. Second operand has 15 states, 15 states have (on average 11.533333333333333) internal successors, (173), 15 states have internal predecessors, (173), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:11:49,464 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 10:11:49,465 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 54 [2025-03-04 10:11:49,465 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 10:11:50,394 INFO L124 PetriNetUnfolderBase]: 3520/5892 cut-off events. [2025-03-04 10:11:50,394 INFO L125 PetriNetUnfolderBase]: For 41826/41826 co-relation queries the response was YES. [2025-03-04 10:11:50,408 INFO L83 FinitePrefix]: Finished finitePrefix Result has 32999 conditions, 5892 events. 3520/5892 cut-off events. For 41826/41826 co-relation queries the response was YES. Maximal size of possible extension queue 272. Compared 36031 event pairs, 130 based on Foata normal form. 170/6062 useless extension candidates. Maximal degree in co-relation 29264. Up to 1067 conditions per place. [2025-03-04 10:11:50,428 INFO L140 encePairwiseOnDemand]: 46/54 looper letters, 302 selfloop transitions, 144 changer transitions 7/454 dead transitions. [2025-03-04 10:11:50,428 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 166 places, 454 transitions, 5392 flow [2025-03-04 10:11:50,429 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2025-03-04 10:11:50,429 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2025-03-04 10:11:50,429 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 434 transitions. [2025-03-04 10:11:50,430 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.2771392081736909 [2025-03-04 10:11:50,430 INFO L175 Difference]: Start difference. First operand has 138 places, 180 transitions, 2083 flow. Second operand 29 states and 434 transitions. [2025-03-04 10:11:50,430 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 166 places, 454 transitions, 5392 flow [2025-03-04 10:11:50,537 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 164 places, 454 transitions, 5351 flow, removed 10 selfloop flow, removed 2 redundant places. [2025-03-04 10:11:50,542 INFO L231 Difference]: Finished difference. Result has 181 places, 238 transitions, 3297 flow [2025-03-04 10:11:50,542 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=54, PETRI_DIFFERENCE_MINUEND_FLOW=2072, PETRI_DIFFERENCE_MINUEND_PLACES=136, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=180, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=86, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=85, PETRI_DIFFERENCE_SUBTRAHEND_STATES=29, PETRI_FLOW=3297, PETRI_PLACES=181, PETRI_TRANSITIONS=238} [2025-03-04 10:11:50,542 INFO L279 CegarLoopForPetriNet]: 54 programPoint places, 127 predicate places. [2025-03-04 10:11:50,542 INFO L471 AbstractCegarLoop]: Abstraction has has 181 places, 238 transitions, 3297 flow [2025-03-04 10:11:50,543 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 11.533333333333333) internal successors, (173), 15 states have internal predecessors, (173), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:11:50,543 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 10:11:50,543 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:11:50,549 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2025-03-04 10:11:50,743 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,SelfDestructingSolverStorable26 [2025-03-04 10:11:50,744 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err8REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err9REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 45 more)] === [2025-03-04 10:11:50,744 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:11:50,744 INFO L85 PathProgramCache]: Analyzing trace with hash -929022613, now seen corresponding path program 4 times [2025-03-04 10:11:50,744 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:11:50,744 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1435158047] [2025-03-04 10:11:50,744 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-04 10:11:50,744 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:11:50,750 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 28 statements into 2 equivalence classes. [2025-03-04 10:11:50,753 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) and asserted 24 of 28 statements. [2025-03-04 10:11:50,753 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) [2025-03-04 10:11:50,753 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:11:50,793 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-04 10:11:50,794 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:11:50,794 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1435158047] [2025-03-04 10:11:50,794 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1435158047] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 10:11:50,794 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [910339162] [2025-03-04 10:11:50,794 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-04 10:11:50,794 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:11:50,794 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:11:50,796 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 10:11:50,797 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2025-03-04 10:11:50,856 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 28 statements into 2 equivalence classes. [2025-03-04 10:11:50,872 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) and asserted 24 of 28 statements. [2025-03-04 10:11:50,872 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) [2025-03-04 10:11:50,872 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:11:50,874 INFO L256 TraceCheckSpWp]: Trace formula consists of 150 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-04 10:11:50,875 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:11:50,906 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-04 10:11:50,906 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 10:11:50,934 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-04 10:11:50,934 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [910339162] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 10:11:50,935 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 10:11:50,935 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 9 [2025-03-04 10:11:50,935 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1132979837] [2025-03-04 10:11:50,935 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 10:11:50,935 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-04 10:11:50,935 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:11:50,935 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-04 10:11:50,935 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2025-03-04 10:11:50,940 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 54 [2025-03-04 10:11:50,940 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 181 places, 238 transitions, 3297 flow. Second operand has 9 states, 9 states have (on average 12.0) internal successors, (108), 9 states have internal predecessors, (108), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:11:50,940 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 10:11:50,940 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 54 [2025-03-04 10:11:50,940 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 10:11:52,118 INFO L124 PetriNetUnfolderBase]: 4917/8215 cut-off events. [2025-03-04 10:11:52,118 INFO L125 PetriNetUnfolderBase]: For 102232/102232 co-relation queries the response was YES. [2025-03-04 10:11:52,150 INFO L83 FinitePrefix]: Finished finitePrefix Result has 53792 conditions, 8215 events. 4917/8215 cut-off events. For 102232/102232 co-relation queries the response was YES. Maximal size of possible extension queue 359. Compared 52707 event pairs, 235 based on Foata normal form. 57/8272 useless extension candidates. Maximal degree in co-relation 50676. Up to 1589 conditions per place. [2025-03-04 10:11:52,177 INFO L140 encePairwiseOnDemand]: 46/54 looper letters, 236 selfloop transitions, 203 changer transitions 6/446 dead transitions. [2025-03-04 10:11:52,177 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 195 places, 446 transitions, 6579 flow [2025-03-04 10:11:52,179 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-03-04 10:11:52,179 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2025-03-04 10:11:52,179 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 229 transitions. [2025-03-04 10:11:52,179 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.28271604938271605 [2025-03-04 10:11:52,179 INFO L175 Difference]: Start difference. First operand has 181 places, 238 transitions, 3297 flow. Second operand 15 states and 229 transitions. [2025-03-04 10:11:52,179 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 195 places, 446 transitions, 6579 flow [2025-03-04 10:11:52,720 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 192 places, 446 transitions, 6220 flow, removed 141 selfloop flow, removed 3 redundant places. [2025-03-04 10:11:52,725 INFO L231 Difference]: Finished difference. Result has 199 places, 317 transitions, 4883 flow [2025-03-04 10:11:52,725 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=54, PETRI_DIFFERENCE_MINUEND_FLOW=3093, PETRI_DIFFERENCE_MINUEND_PLACES=178, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=238, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=127, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=95, PETRI_DIFFERENCE_SUBTRAHEND_STATES=15, PETRI_FLOW=4883, PETRI_PLACES=199, PETRI_TRANSITIONS=317} [2025-03-04 10:11:52,725 INFO L279 CegarLoopForPetriNet]: 54 programPoint places, 145 predicate places. [2025-03-04 10:11:52,725 INFO L471 AbstractCegarLoop]: Abstraction has has 199 places, 317 transitions, 4883 flow [2025-03-04 10:11:52,725 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 12.0) internal successors, (108), 9 states have internal predecessors, (108), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:11:52,725 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 10:11:52,725 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:11:52,731 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-04 10:11:52,927 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable27 [2025-03-04 10:11:52,927 INFO L396 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err8REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err9REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 45 more)] === [2025-03-04 10:11:52,928 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:11:52,928 INFO L85 PathProgramCache]: Analyzing trace with hash 963233439, now seen corresponding path program 5 times [2025-03-04 10:11:52,928 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:11:52,928 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [772669110] [2025-03-04 10:11:52,928 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-04 10:11:52,928 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:11:52,936 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 28 statements into 3 equivalence classes. [2025-03-04 10:11:52,946 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) and asserted 28 of 28 statements. [2025-03-04 10:11:52,946 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) [2025-03-04 10:11:52,946 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:11:52,997 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-04 10:11:52,997 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:11:52,997 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [772669110] [2025-03-04 10:11:52,997 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [772669110] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 10:11:52,997 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [833469515] [2025-03-04 10:11:52,998 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-04 10:11:52,998 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:11:52,998 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:11:53,000 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 10:11:53,002 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2025-03-04 10:11:53,064 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 28 statements into 3 equivalence classes. [2025-03-04 10:11:53,085 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) and asserted 28 of 28 statements. [2025-03-04 10:11:53,085 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) [2025-03-04 10:11:53,085 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:11:53,086 INFO L256 TraceCheckSpWp]: Trace formula consists of 233 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-04 10:11:53,087 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:11:53,128 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-04 10:11:53,129 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 10:11:53,158 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-04 10:11:53,158 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [833469515] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 10:11:53,158 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 10:11:53,158 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 10 [2025-03-04 10:11:53,158 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1451995] [2025-03-04 10:11:53,158 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 10:11:53,159 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-04 10:11:53,159 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:11:53,159 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-04 10:11:53,159 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2025-03-04 10:11:53,164 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 54 [2025-03-04 10:11:53,164 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 199 places, 317 transitions, 4883 flow. Second operand has 10 states, 10 states have (on average 11.5) internal successors, (115), 10 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:11:53,164 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 10:11:53,164 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 54 [2025-03-04 10:11:53,164 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 10:11:54,772 INFO L124 PetriNetUnfolderBase]: 6569/10941 cut-off events. [2025-03-04 10:11:54,772 INFO L125 PetriNetUnfolderBase]: For 169573/169573 co-relation queries the response was YES. [2025-03-04 10:11:54,811 INFO L83 FinitePrefix]: Finished finitePrefix Result has 76452 conditions, 10941 events. 6569/10941 cut-off events. For 169573/169573 co-relation queries the response was YES. Maximal size of possible extension queue 412. Compared 72574 event pairs, 270 based on Foata normal form. 111/11052 useless extension candidates. Maximal degree in co-relation 72344. Up to 2487 conditions per place. [2025-03-04 10:11:54,841 INFO L140 encePairwiseOnDemand]: 46/54 looper letters, 259 selfloop transitions, 270 changer transitions 5/535 dead transitions. [2025-03-04 10:11:54,842 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 214 places, 535 transitions, 8567 flow [2025-03-04 10:11:54,842 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-03-04 10:11:54,842 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2025-03-04 10:11:54,842 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 250 transitions. [2025-03-04 10:11:54,843 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.28935185185185186 [2025-03-04 10:11:54,843 INFO L175 Difference]: Start difference. First operand has 199 places, 317 transitions, 4883 flow. Second operand 16 states and 250 transitions. [2025-03-04 10:11:54,843 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 214 places, 535 transitions, 8567 flow [2025-03-04 10:11:55,888 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 213 places, 535 transitions, 8459 flow, removed 36 selfloop flow, removed 1 redundant places. [2025-03-04 10:11:55,894 INFO L231 Difference]: Finished difference. Result has 223 places, 396 transitions, 7146 flow [2025-03-04 10:11:55,894 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=54, PETRI_DIFFERENCE_MINUEND_FLOW=4799, PETRI_DIFFERENCE_MINUEND_PLACES=198, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=317, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=191, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=104, PETRI_DIFFERENCE_SUBTRAHEND_STATES=16, PETRI_FLOW=7146, PETRI_PLACES=223, PETRI_TRANSITIONS=396} [2025-03-04 10:11:55,895 INFO L279 CegarLoopForPetriNet]: 54 programPoint places, 169 predicate places. [2025-03-04 10:11:55,895 INFO L471 AbstractCegarLoop]: Abstraction has has 223 places, 396 transitions, 7146 flow [2025-03-04 10:11:55,895 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 11.5) internal successors, (115), 10 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:11:55,895 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 10:11:55,895 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:11:55,902 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Ended with exit code 0 [2025-03-04 10:11:56,095 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28,15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:11:56,096 INFO L396 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err8REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err9REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 45 more)] === [2025-03-04 10:11:56,096 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:11:56,096 INFO L85 PathProgramCache]: Analyzing trace with hash 1254391887, now seen corresponding path program 6 times [2025-03-04 10:11:56,096 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:11:56,096 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1203844629] [2025-03-04 10:11:56,096 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-03-04 10:11:56,096 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:11:56,103 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 28 statements into 2 equivalence classes. [2025-03-04 10:11:56,109 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) and asserted 28 of 28 statements. [2025-03-04 10:11:56,110 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) [2025-03-04 10:11:56,110 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:11:56,170 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-04 10:11:56,171 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:11:56,171 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1203844629] [2025-03-04 10:11:56,171 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1203844629] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 10:11:56,171 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [833917963] [2025-03-04 10:11:56,171 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-03-04 10:11:56,171 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:11:56,171 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:11:56,173 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 10:11:56,175 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2025-03-04 10:11:56,240 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 28 statements into 2 equivalence classes. [2025-03-04 10:11:56,264 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) and asserted 28 of 28 statements. [2025-03-04 10:11:56,264 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) [2025-03-04 10:11:56,264 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:11:56,265 INFO L256 TraceCheckSpWp]: Trace formula consists of 233 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-04 10:11:56,266 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:11:56,314 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-04 10:11:56,315 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 10:11:56,354 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-04 10:11:56,354 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [833917963] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 10:11:56,354 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 10:11:56,354 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 12 [2025-03-04 10:11:56,354 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1354907279] [2025-03-04 10:11:56,354 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 10:11:56,354 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-03-04 10:11:56,355 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:11:56,355 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-03-04 10:11:56,355 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=93, Unknown=0, NotChecked=0, Total=132 [2025-03-04 10:11:56,361 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 54 [2025-03-04 10:11:56,361 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 223 places, 396 transitions, 7146 flow. Second operand has 12 states, 12 states have (on average 11.75) internal successors, (141), 12 states have internal predecessors, (141), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:11:56,361 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 10:11:56,361 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 54 [2025-03-04 10:11:56,361 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 10:11:58,879 INFO L124 PetriNetUnfolderBase]: 7934/13214 cut-off events. [2025-03-04 10:11:58,879 INFO L125 PetriNetUnfolderBase]: For 286013/286013 co-relation queries the response was YES. [2025-03-04 10:11:58,951 INFO L83 FinitePrefix]: Finished finitePrefix Result has 103337 conditions, 13214 events. 7934/13214 cut-off events. For 286013/286013 co-relation queries the response was YES. Maximal size of possible extension queue 473. Compared 90110 event pairs, 308 based on Foata normal form. 80/13294 useless extension candidates. Maximal degree in co-relation 99019. Up to 2358 conditions per place. [2025-03-04 10:11:58,999 INFO L140 encePairwiseOnDemand]: 46/54 looper letters, 353 selfloop transitions, 343 changer transitions 3/700 dead transitions. [2025-03-04 10:11:58,999 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 248 places, 700 transitions, 12411 flow [2025-03-04 10:11:58,999 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2025-03-04 10:11:58,999 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2025-03-04 10:11:59,000 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 393 transitions. [2025-03-04 10:11:59,000 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.2799145299145299 [2025-03-04 10:11:59,000 INFO L175 Difference]: Start difference. First operand has 223 places, 396 transitions, 7146 flow. Second operand 26 states and 393 transitions. [2025-03-04 10:11:59,000 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 248 places, 700 transitions, 12411 flow [2025-03-04 10:12:01,541 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 245 places, 700 transitions, 12277 flow, removed 28 selfloop flow, removed 3 redundant places. [2025-03-04 10:12:01,549 INFO L231 Difference]: Finished difference. Result has 257 places, 483 transitions, 10047 flow [2025-03-04 10:12:01,550 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=54, PETRI_DIFFERENCE_MINUEND_FLOW=7014, PETRI_DIFFERENCE_MINUEND_PLACES=220, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=396, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=263, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=116, PETRI_DIFFERENCE_SUBTRAHEND_STATES=26, PETRI_FLOW=10047, PETRI_PLACES=257, PETRI_TRANSITIONS=483} [2025-03-04 10:12:01,550 INFO L279 CegarLoopForPetriNet]: 54 programPoint places, 203 predicate places. [2025-03-04 10:12:01,550 INFO L471 AbstractCegarLoop]: Abstraction has has 257 places, 483 transitions, 10047 flow [2025-03-04 10:12:01,550 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 11.75) internal successors, (141), 12 states have internal predecessors, (141), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:12:01,550 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 10:12:01,550 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:12:01,556 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-04 10:12:01,754 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29,16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:12:01,755 INFO L396 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err8REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err9REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 45 more)] === [2025-03-04 10:12:01,755 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:12:01,755 INFO L85 PathProgramCache]: Analyzing trace with hash -1288643797, now seen corresponding path program 7 times [2025-03-04 10:12:01,755 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:12:01,755 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [792088919] [2025-03-04 10:12:01,755 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-03-04 10:12:01,755 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:12:01,760 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 28 statements into 1 equivalence classes. [2025-03-04 10:12:01,764 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 28 of 28 statements. [2025-03-04 10:12:01,764 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:12:01,764 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:12:01,811 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-04 10:12:01,811 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:12:01,811 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [792088919] [2025-03-04 10:12:01,812 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [792088919] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 10:12:01,812 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [278074154] [2025-03-04 10:12:01,812 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-03-04 10:12:01,812 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:12:01,812 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:12:01,814 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 10:12:01,815 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2025-03-04 10:12:01,873 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 28 statements into 1 equivalence classes. [2025-03-04 10:12:01,893 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 28 of 28 statements. [2025-03-04 10:12:01,894 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:12:01,894 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:12:01,895 INFO L256 TraceCheckSpWp]: Trace formula consists of 233 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-04 10:12:01,897 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:12:01,935 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-04 10:12:01,935 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 10:12:01,960 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-04 10:12:01,961 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [278074154] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 10:12:01,961 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 10:12:01,961 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 12 [2025-03-04 10:12:01,961 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [157248085] [2025-03-04 10:12:01,961 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 10:12:01,961 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-03-04 10:12:01,961 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:12:01,961 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-03-04 10:12:01,961 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=91, Unknown=0, NotChecked=0, Total=132 [2025-03-04 10:12:01,976 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 54 [2025-03-04 10:12:01,977 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 257 places, 483 transitions, 10047 flow. Second operand has 12 states, 12 states have (on average 11.416666666666666) internal successors, (137), 12 states have internal predecessors, (137), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:12:01,977 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 10:12:01,977 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 54 [2025-03-04 10:12:01,977 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 10:12:04,392 INFO L124 PetriNetUnfolderBase]: 7957/13283 cut-off events. [2025-03-04 10:12:04,392 INFO L125 PetriNetUnfolderBase]: For 369665/369665 co-relation queries the response was YES. [2025-03-04 10:12:04,467 INFO L83 FinitePrefix]: Finished finitePrefix Result has 115373 conditions, 13283 events. 7957/13283 cut-off events. For 369665/369665 co-relation queries the response was YES. Maximal size of possible extension queue 472. Compared 91457 event pairs, 906 based on Foata normal form. 24/13307 useless extension candidates. Maximal degree in co-relation 110817. Up to 3715 conditions per place. [2025-03-04 10:12:04,522 INFO L140 encePairwiseOnDemand]: 47/54 looper letters, 404 selfloop transitions, 221 changer transitions 6/632 dead transitions. [2025-03-04 10:12:04,522 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 269 places, 632 transitions, 12899 flow [2025-03-04 10:12:04,523 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-04 10:12:04,523 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2025-03-04 10:12:04,523 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 213 transitions. [2025-03-04 10:12:04,523 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.3034188034188034 [2025-03-04 10:12:04,523 INFO L175 Difference]: Start difference. First operand has 257 places, 483 transitions, 10047 flow. Second operand 13 states and 213 transitions. [2025-03-04 10:12:04,523 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 269 places, 632 transitions, 12899 flow [2025-03-04 10:12:08,086 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 259 places, 632 transitions, 12330 flow, removed 215 selfloop flow, removed 10 redundant places. [2025-03-04 10:12:08,094 INFO L231 Difference]: Finished difference. Result has 261 places, 482 transitions, 9920 flow [2025-03-04 10:12:08,094 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=54, PETRI_DIFFERENCE_MINUEND_FLOW=9478, PETRI_DIFFERENCE_MINUEND_PLACES=247, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=483, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=220, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=263, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=9920, PETRI_PLACES=261, PETRI_TRANSITIONS=482} [2025-03-04 10:12:08,095 INFO L279 CegarLoopForPetriNet]: 54 programPoint places, 207 predicate places. [2025-03-04 10:12:08,095 INFO L471 AbstractCegarLoop]: Abstraction has has 261 places, 482 transitions, 9920 flow [2025-03-04 10:12:08,095 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 11.416666666666666) internal successors, (137), 12 states have internal predecessors, (137), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:12:08,095 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 10:12:08,095 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:12:08,101 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-04 10:12:08,295 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30,17 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:12:08,296 INFO L396 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err8REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err9REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 45 more)] === [2025-03-04 10:12:08,296 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:12:08,296 INFO L85 PathProgramCache]: Analyzing trace with hash 49098315, now seen corresponding path program 8 times [2025-03-04 10:12:08,296 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:12:08,296 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [31270390] [2025-03-04 10:12:08,296 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 10:12:08,296 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:12:08,302 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 28 statements into 2 equivalence classes. [2025-03-04 10:12:08,314 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 28 of 28 statements. [2025-03-04 10:12:08,314 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 10:12:08,314 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:12:08,475 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-04 10:12:08,475 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:12:08,475 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [31270390] [2025-03-04 10:12:08,475 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [31270390] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 10:12:08,476 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [359122442] [2025-03-04 10:12:08,476 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 10:12:08,476 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:12:08,476 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:12:08,478 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 10:12:08,480 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Waiting until timeout for monitored process [2025-03-04 10:12:08,542 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 28 statements into 2 equivalence classes. [2025-03-04 10:12:08,563 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 28 of 28 statements. [2025-03-04 10:12:08,563 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 10:12:08,563 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:12:08,564 INFO L256 TraceCheckSpWp]: Trace formula consists of 233 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-04 10:12:08,566 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:12:08,616 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-04 10:12:08,617 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 10:12:08,652 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-04 10:12:08,652 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [359122442] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 10:12:08,652 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 10:12:08,652 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 6] total 13 [2025-03-04 10:12:08,653 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1667629873] [2025-03-04 10:12:08,653 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 10:12:08,653 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-03-04 10:12:08,654 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:12:08,654 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-03-04 10:12:08,654 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=109, Unknown=0, NotChecked=0, Total=156 [2025-03-04 10:12:08,659 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 54 [2025-03-04 10:12:08,659 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 261 places, 482 transitions, 9920 flow. Second operand has 13 states, 13 states have (on average 11.538461538461538) internal successors, (150), 13 states have internal predecessors, (150), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:12:08,659 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 10:12:08,659 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 54 [2025-03-04 10:12:08,659 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 10:12:11,215 INFO L124 PetriNetUnfolderBase]: 9111/15074 cut-off events. [2025-03-04 10:12:11,216 INFO L125 PetriNetUnfolderBase]: For 396518/396518 co-relation queries the response was YES. [2025-03-04 10:12:11,295 INFO L83 FinitePrefix]: Finished finitePrefix Result has 130557 conditions, 15074 events. 9111/15074 cut-off events. For 396518/396518 co-relation queries the response was YES. Maximal size of possible extension queue 558. Compared 104128 event pairs, 529 based on Foata normal form. 72/15146 useless extension candidates. Maximal degree in co-relation 129989. Up to 3118 conditions per place. [2025-03-04 10:12:11,348 INFO L140 encePairwiseOnDemand]: 46/54 looper letters, 360 selfloop transitions, 423 changer transitions 3/787 dead transitions. [2025-03-04 10:12:11,348 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 285 places, 787 transitions, 15595 flow [2025-03-04 10:12:11,348 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2025-03-04 10:12:11,348 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2025-03-04 10:12:11,349 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 387 transitions. [2025-03-04 10:12:11,349 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.27564102564102566 [2025-03-04 10:12:11,349 INFO L175 Difference]: Start difference. First operand has 261 places, 482 transitions, 9920 flow. Second operand 26 states and 387 transitions. [2025-03-04 10:12:11,349 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 285 places, 787 transitions, 15595 flow [2025-03-04 10:12:15,098 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 275 places, 787 transitions, 15160 flow, removed 3 selfloop flow, removed 10 redundant places. [2025-03-04 10:12:15,107 INFO L231 Difference]: Finished difference. Result has 286 places, 571 transitions, 13090 flow [2025-03-04 10:12:15,107 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=54, PETRI_DIFFERENCE_MINUEND_FLOW=9524, PETRI_DIFFERENCE_MINUEND_PLACES=250, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=482, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=343, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=119, PETRI_DIFFERENCE_SUBTRAHEND_STATES=26, PETRI_FLOW=13090, PETRI_PLACES=286, PETRI_TRANSITIONS=571} [2025-03-04 10:12:15,107 INFO L279 CegarLoopForPetriNet]: 54 programPoint places, 232 predicate places. [2025-03-04 10:12:15,108 INFO L471 AbstractCegarLoop]: Abstraction has has 286 places, 571 transitions, 13090 flow [2025-03-04 10:12:15,108 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 11.538461538461538) internal successors, (150), 13 states have internal predecessors, (150), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:12:15,108 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 10:12:15,108 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:12:15,114 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Forceful destruction successful, exit code 0 [2025-03-04 10:12:15,308 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31,18 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:12:15,308 INFO L396 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err8REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err9REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 45 more)] === [2025-03-04 10:12:15,309 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:12:15,309 INFO L85 PathProgramCache]: Analyzing trace with hash 1294683661, now seen corresponding path program 9 times [2025-03-04 10:12:15,309 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:12:15,309 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [920061480] [2025-03-04 10:12:15,309 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-04 10:12:15,309 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:12:15,316 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 28 statements into 2 equivalence classes. [2025-03-04 10:12:15,322 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 28 of 28 statements. [2025-03-04 10:12:15,322 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-03-04 10:12:15,322 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:12:15,378 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-04 10:12:15,378 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:12:15,378 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [920061480] [2025-03-04 10:12:15,378 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [920061480] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 10:12:15,378 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1899477475] [2025-03-04 10:12:15,378 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-04 10:12:15,378 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:12:15,379 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:12:15,380 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 10:12:15,382 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Waiting until timeout for monitored process [2025-03-04 10:12:15,441 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 28 statements into 2 equivalence classes. [2025-03-04 10:12:15,463 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 28 of 28 statements. [2025-03-04 10:12:15,463 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-03-04 10:12:15,463 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:12:15,464 INFO L256 TraceCheckSpWp]: Trace formula consists of 233 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-04 10:12:15,467 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:12:15,511 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-04 10:12:15,513 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 10:12:15,545 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-04 10:12:15,545 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1899477475] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 10:12:15,545 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 10:12:15,545 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 15 [2025-03-04 10:12:15,545 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [787339040] [2025-03-04 10:12:15,545 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 10:12:15,546 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-03-04 10:12:15,546 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:12:15,546 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-03-04 10:12:15,547 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=153, Unknown=0, NotChecked=0, Total=210 [2025-03-04 10:12:15,553 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 54 [2025-03-04 10:12:15,553 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 286 places, 571 transitions, 13090 flow. Second operand has 15 states, 15 states have (on average 10.866666666666667) internal successors, (163), 15 states have internal predecessors, (163), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:12:15,553 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 10:12:15,553 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 54 [2025-03-04 10:12:15,553 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 10:12:19,245 INFO L124 PetriNetUnfolderBase]: 9872/16257 cut-off events. [2025-03-04 10:12:19,245 INFO L125 PetriNetUnfolderBase]: For 543046/543046 co-relation queries the response was YES. [2025-03-04 10:12:19,392 INFO L83 FinitePrefix]: Finished finitePrefix Result has 153896 conditions, 16257 events. 9872/16257 cut-off events. For 543046/543046 co-relation queries the response was YES. Maximal size of possible extension queue 616. Compared 113386 event pairs, 1031 based on Foata normal form. 32/16289 useless extension candidates. Maximal degree in co-relation 152037. Up to 4370 conditions per place. [2025-03-04 10:12:19,470 INFO L140 encePairwiseOnDemand]: 47/54 looper letters, 474 selfloop transitions, 272 changer transitions 16/763 dead transitions. [2025-03-04 10:12:19,471 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 301 places, 763 transitions, 17121 flow [2025-03-04 10:12:19,471 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-03-04 10:12:19,471 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2025-03-04 10:12:19,471 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 247 transitions. [2025-03-04 10:12:19,471 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.28587962962962965 [2025-03-04 10:12:19,471 INFO L175 Difference]: Start difference. First operand has 286 places, 571 transitions, 13090 flow. Second operand 16 states and 247 transitions. [2025-03-04 10:12:19,471 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 301 places, 763 transitions, 17121 flow [2025-03-04 10:12:26,236 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 291 places, 763 transitions, 16532 flow, removed 202 selfloop flow, removed 10 redundant places. [2025-03-04 10:12:26,247 INFO L231 Difference]: Finished difference. Result has 297 places, 588 transitions, 13766 flow [2025-03-04 10:12:26,247 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=54, PETRI_DIFFERENCE_MINUEND_FLOW=12636, PETRI_DIFFERENCE_MINUEND_PLACES=276, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=571, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=252, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=310, PETRI_DIFFERENCE_SUBTRAHEND_STATES=16, PETRI_FLOW=13766, PETRI_PLACES=297, PETRI_TRANSITIONS=588} [2025-03-04 10:12:26,247 INFO L279 CegarLoopForPetriNet]: 54 programPoint places, 243 predicate places. [2025-03-04 10:12:26,248 INFO L471 AbstractCegarLoop]: Abstraction has has 297 places, 588 transitions, 13766 flow [2025-03-04 10:12:26,248 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 10.866666666666667) internal successors, (163), 15 states have internal predecessors, (163), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:12:26,248 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 10:12:26,248 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:12:26,254 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Ended with exit code 0 [2025-03-04 10:12:26,448 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32,19 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:12:26,448 INFO L396 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err8REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err9REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 45 more)] === [2025-03-04 10:12:26,449 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:12:26,449 INFO L85 PathProgramCache]: Analyzing trace with hash 487156862, now seen corresponding path program 10 times [2025-03-04 10:12:26,449 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:12:26,449 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2072878125] [2025-03-04 10:12:26,449 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-04 10:12:26,449 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:12:26,459 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 28 statements into 2 equivalence classes. [2025-03-04 10:12:26,463 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) and asserted 24 of 28 statements. [2025-03-04 10:12:26,463 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) [2025-03-04 10:12:26,463 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:12:26,515 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-04 10:12:26,516 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:12:26,517 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2072878125] [2025-03-04 10:12:26,517 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2072878125] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 10:12:26,517 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [286323754] [2025-03-04 10:12:26,517 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-04 10:12:26,517 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:12:26,517 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:12:26,519 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 10:12:26,520 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Waiting until timeout for monitored process [2025-03-04 10:12:26,584 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 28 statements into 2 equivalence classes. [2025-03-04 10:12:26,598 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) and asserted 24 of 28 statements. [2025-03-04 10:12:26,598 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) [2025-03-04 10:12:26,598 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:12:26,599 INFO L256 TraceCheckSpWp]: Trace formula consists of 150 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-04 10:12:26,600 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:12:26,640 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-04 10:12:26,641 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 10:12:26,661 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-04 10:12:26,661 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [286323754] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 10:12:26,661 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 10:12:26,661 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 11 [2025-03-04 10:12:26,661 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1751070489] [2025-03-04 10:12:26,661 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 10:12:26,661 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-04 10:12:26,662 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:12:26,662 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-04 10:12:26,662 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=78, Unknown=0, NotChecked=0, Total=110 [2025-03-04 10:12:26,667 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 54 [2025-03-04 10:12:26,667 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 297 places, 588 transitions, 13766 flow. Second operand has 11 states, 11 states have (on average 11.363636363636363) internal successors, (125), 11 states have internal predecessors, (125), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:12:26,667 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 10:12:26,667 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 54 [2025-03-04 10:12:26,667 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 10:12:30,386 INFO L124 PetriNetUnfolderBase]: 11107/18282 cut-off events. [2025-03-04 10:12:30,387 INFO L125 PetriNetUnfolderBase]: For 643397/643397 co-relation queries the response was YES. [2025-03-04 10:12:30,503 INFO L83 FinitePrefix]: Finished finitePrefix Result has 174597 conditions, 18282 events. 11107/18282 cut-off events. For 643397/643397 co-relation queries the response was YES. Maximal size of possible extension queue 705. Compared 130103 event pairs, 1998 based on Foata normal form. 330/18612 useless extension candidates. Maximal degree in co-relation 173719. Up to 8167 conditions per place. [2025-03-04 10:12:30,569 INFO L140 encePairwiseOnDemand]: 46/54 looper letters, 675 selfloop transitions, 194 changer transitions 0/870 dead transitions. [2025-03-04 10:12:30,569 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 313 places, 870 transitions, 20205 flow [2025-03-04 10:12:30,572 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2025-03-04 10:12:30,572 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2025-03-04 10:12:30,572 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 310 transitions. [2025-03-04 10:12:30,572 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.28703703703703703 [2025-03-04 10:12:30,572 INFO L175 Difference]: Start difference. First operand has 297 places, 588 transitions, 13766 flow. Second operand 20 states and 310 transitions. [2025-03-04 10:12:30,572 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 313 places, 870 transitions, 20205 flow [2025-03-04 10:12:36,783 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 305 places, 870 transitions, 19867 flow, removed 20 selfloop flow, removed 8 redundant places. [2025-03-04 10:12:36,795 INFO L231 Difference]: Finished difference. Result has 317 places, 645 transitions, 15812 flow [2025-03-04 10:12:36,796 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=54, PETRI_DIFFERENCE_MINUEND_FLOW=13342, PETRI_DIFFERENCE_MINUEND_PLACES=286, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=584, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=138, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=430, PETRI_DIFFERENCE_SUBTRAHEND_STATES=20, PETRI_FLOW=15812, PETRI_PLACES=317, PETRI_TRANSITIONS=645} [2025-03-04 10:12:36,796 INFO L279 CegarLoopForPetriNet]: 54 programPoint places, 263 predicate places. [2025-03-04 10:12:36,796 INFO L471 AbstractCegarLoop]: Abstraction has has 317 places, 645 transitions, 15812 flow [2025-03-04 10:12:36,796 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 11.363636363636363) internal successors, (125), 11 states have internal predecessors, (125), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:12:36,796 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 10:12:36,796 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:12:36,802 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-04 10:12:36,997 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33,20 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:12:36,997 INFO L396 AbstractCegarLoop]: === Iteration 35 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err8REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err9REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 45 more)] === [2025-03-04 10:12:36,997 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:12:36,997 INFO L85 PathProgramCache]: Analyzing trace with hash -1559690143, now seen corresponding path program 11 times [2025-03-04 10:12:36,997 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:12:36,998 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [532249191] [2025-03-04 10:12:36,998 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-04 10:12:36,998 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:12:37,004 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 28 statements into 2 equivalence classes. [2025-03-04 10:12:37,017 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 28 of 28 statements. [2025-03-04 10:12:37,017 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 10:12:37,017 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:12:37,075 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-04 10:12:37,075 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:12:37,075 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [532249191] [2025-03-04 10:12:37,075 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [532249191] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 10:12:37,075 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [426970469] [2025-03-04 10:12:37,075 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-04 10:12:37,075 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:12:37,075 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:12:37,077 INFO L229 MonitoredProcess]: Starting monitored process 21 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 10:12:37,078 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Waiting until timeout for monitored process [2025-03-04 10:12:37,138 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 28 statements into 2 equivalence classes. [2025-03-04 10:12:37,158 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 28 of 28 statements. [2025-03-04 10:12:37,158 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 10:12:37,158 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:12:37,159 INFO L256 TraceCheckSpWp]: Trace formula consists of 233 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-04 10:12:37,160 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:12:37,205 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-04 10:12:37,205 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 10:12:37,251 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-04 10:12:37,251 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [426970469] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 10:12:37,251 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 10:12:37,251 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 15 [2025-03-04 10:12:37,251 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1367327879] [2025-03-04 10:12:37,251 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 10:12:37,251 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-03-04 10:12:37,252 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:12:37,252 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-03-04 10:12:37,252 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=152, Unknown=0, NotChecked=0, Total=210 [2025-03-04 10:12:37,262 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 54 [2025-03-04 10:12:37,263 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 317 places, 645 transitions, 15812 flow. Second operand has 15 states, 15 states have (on average 11.333333333333334) internal successors, (170), 15 states have internal predecessors, (170), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:12:37,263 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 10:12:37,263 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 54 [2025-03-04 10:12:37,263 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 10:12:42,239 INFO L124 PetriNetUnfolderBase]: 12134/19906 cut-off events. [2025-03-04 10:12:42,239 INFO L125 PetriNetUnfolderBase]: For 807996/807996 co-relation queries the response was YES. [2025-03-04 10:12:42,430 INFO L83 FinitePrefix]: Finished finitePrefix Result has 200989 conditions, 19906 events. 12134/19906 cut-off events. For 807996/807996 co-relation queries the response was YES. Maximal size of possible extension queue 786. Compared 142978 event pairs, 1785 based on Foata normal form. 170/20076 useless extension candidates. Maximal degree in co-relation 198772. Up to 9207 conditions per place. [2025-03-04 10:12:42,518 INFO L140 encePairwiseOnDemand]: 46/54 looper letters, 538 selfloop transitions, 312 changer transitions 4/855 dead transitions. [2025-03-04 10:12:42,518 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 336 places, 855 transitions, 20740 flow [2025-03-04 10:12:42,518 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2025-03-04 10:12:42,518 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2025-03-04 10:12:42,519 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 313 transitions. [2025-03-04 10:12:42,519 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.2898148148148148 [2025-03-04 10:12:42,519 INFO L175 Difference]: Start difference. First operand has 317 places, 645 transitions, 15812 flow. Second operand 20 states and 313 transitions. [2025-03-04 10:12:42,519 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 336 places, 855 transitions, 20740 flow [2025-03-04 10:12:53,160 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 328 places, 855 transitions, 20122 flow, removed 261 selfloop flow, removed 8 redundant places. [2025-03-04 10:12:53,172 INFO L231 Difference]: Finished difference. Result has 340 places, 683 transitions, 17673 flow [2025-03-04 10:12:53,173 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=54, PETRI_DIFFERENCE_MINUEND_FLOW=15196, PETRI_DIFFERENCE_MINUEND_PLACES=309, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=645, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=276, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=360, PETRI_DIFFERENCE_SUBTRAHEND_STATES=20, PETRI_FLOW=17673, PETRI_PLACES=340, PETRI_TRANSITIONS=683} [2025-03-04 10:12:53,173 INFO L279 CegarLoopForPetriNet]: 54 programPoint places, 286 predicate places. [2025-03-04 10:12:53,173 INFO L471 AbstractCegarLoop]: Abstraction has has 340 places, 683 transitions, 17673 flow [2025-03-04 10:12:53,173 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 11.333333333333334) internal successors, (170), 15 states have internal predecessors, (170), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:12:53,173 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 10:12:53,173 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:12:53,180 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Ended with exit code 0 [2025-03-04 10:12:53,374 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,SelfDestructingSolverStorable34 [2025-03-04 10:12:53,374 INFO L396 AbstractCegarLoop]: === Iteration 36 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err8REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err9REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 45 more)] === [2025-03-04 10:12:53,374 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:12:53,374 INFO L85 PathProgramCache]: Analyzing trace with hash 322943166, now seen corresponding path program 12 times [2025-03-04 10:12:53,375 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:12:53,375 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [172075648] [2025-03-04 10:12:53,375 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-03-04 10:12:53,375 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:12:53,381 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 28 statements into 2 equivalence classes. [2025-03-04 10:12:53,383 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) and asserted 24 of 28 statements. [2025-03-04 10:12:53,383 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) [2025-03-04 10:12:53,383 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:12:53,432 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-04 10:12:53,432 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:12:53,432 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [172075648] [2025-03-04 10:12:53,432 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [172075648] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:12:53,432 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 10:12:53,432 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-04 10:12:53,432 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1438230434] [2025-03-04 10:12:53,432 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:12:53,432 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-04 10:12:53,433 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:12:53,433 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-04 10:12:53,433 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2025-03-04 10:12:53,436 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 54 [2025-03-04 10:12:53,436 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 340 places, 683 transitions, 17673 flow. Second operand has 7 states, 7 states have (on average 11.857142857142858) internal successors, (83), 7 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:12:53,436 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 10:12:53,436 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 54 [2025-03-04 10:12:53,436 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 10:12:58,588 INFO L124 PetriNetUnfolderBase]: 12395/20333 cut-off events. [2025-03-04 10:12:58,588 INFO L125 PetriNetUnfolderBase]: For 912109/912109 co-relation queries the response was YES. [2025-03-04 10:12:58,820 INFO L83 FinitePrefix]: Finished finitePrefix Result has 213919 conditions, 20333 events. 12395/20333 cut-off events. For 912109/912109 co-relation queries the response was YES. Maximal size of possible extension queue 789. Compared 146812 event pairs, 2124 based on Foata normal form. 54/20387 useless extension candidates. Maximal degree in co-relation 212070. Up to 8891 conditions per place. [2025-03-04 10:12:58,913 INFO L140 encePairwiseOnDemand]: 46/54 looper letters, 603 selfloop transitions, 230 changer transitions 0/834 dead transitions. [2025-03-04 10:12:58,913 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 350 places, 834 transitions, 22227 flow [2025-03-04 10:12:58,914 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-04 10:12:58,914 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2025-03-04 10:12:58,914 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 170 transitions. [2025-03-04 10:12:58,914 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.28619528619528617 [2025-03-04 10:12:58,914 INFO L175 Difference]: Start difference. First operand has 340 places, 683 transitions, 17673 flow. Second operand 11 states and 170 transitions. [2025-03-04 10:12:58,914 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 350 places, 834 transitions, 22227 flow [2025-03-04 10:13:10,507 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 346 places, 834 transitions, 21739 flow, removed 199 selfloop flow, removed 4 redundant places. [2025-03-04 10:13:10,520 INFO L231 Difference]: Finished difference. Result has 351 places, 708 transitions, 18497 flow [2025-03-04 10:13:10,521 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=54, PETRI_DIFFERENCE_MINUEND_FLOW=17213, PETRI_DIFFERENCE_MINUEND_PLACES=336, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=683, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=205, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=465, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=18497, PETRI_PLACES=351, PETRI_TRANSITIONS=708} [2025-03-04 10:13:10,521 INFO L279 CegarLoopForPetriNet]: 54 programPoint places, 297 predicate places. [2025-03-04 10:13:10,521 INFO L471 AbstractCegarLoop]: Abstraction has has 351 places, 708 transitions, 18497 flow [2025-03-04 10:13:10,521 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 11.857142857142858) internal successors, (83), 7 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:13:10,521 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 10:13:10,522 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:13:10,522 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35 [2025-03-04 10:13:10,522 INFO L396 AbstractCegarLoop]: === Iteration 37 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err8REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err9REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 45 more)] === [2025-03-04 10:13:10,522 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:13:10,522 INFO L85 PathProgramCache]: Analyzing trace with hash 148680954, now seen corresponding path program 13 times [2025-03-04 10:13:10,522 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:13:10,522 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1445977252] [2025-03-04 10:13:10,522 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-03-04 10:13:10,522 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:13:10,529 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 28 statements into 1 equivalence classes. [2025-03-04 10:13:10,534 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 28 of 28 statements. [2025-03-04 10:13:10,534 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:13:10,534 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:13:10,593 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-04 10:13:10,593 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:13:10,593 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1445977252] [2025-03-04 10:13:10,593 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1445977252] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 10:13:10,593 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [360209350] [2025-03-04 10:13:10,594 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-03-04 10:13:10,594 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:13:10,594 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:13:10,596 INFO L229 MonitoredProcess]: Starting monitored process 22 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 10:13:10,597 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Waiting until timeout for monitored process [2025-03-04 10:13:10,667 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 28 statements into 1 equivalence classes. [2025-03-04 10:13:10,685 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 28 of 28 statements. [2025-03-04 10:13:10,685 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:13:10,686 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:13:10,686 INFO L256 TraceCheckSpWp]: Trace formula consists of 233 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-04 10:13:10,687 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:13:10,720 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-04 10:13:10,720 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 10:13:10,748 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-04 10:13:10,748 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [360209350] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 10:13:10,748 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 10:13:10,748 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 11 [2025-03-04 10:13:10,748 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [870352089] [2025-03-04 10:13:10,748 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 10:13:10,748 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-04 10:13:10,749 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:13:10,749 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-04 10:13:10,749 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2025-03-04 10:13:10,752 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 54 [2025-03-04 10:13:10,752 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 351 places, 708 transitions, 18497 flow. Second operand has 11 states, 11 states have (on average 11.636363636363637) internal successors, (128), 11 states have internal predecessors, (128), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:13:10,752 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 10:13:10,752 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 54 [2025-03-04 10:13:10,752 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand