./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/weaver/chl-array-int-symm.wvr.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version e2fb8bed Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../sv-benchmarks/c/weaver/chl-array-int-symm.wvr.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 8a0558934008acf79b7e5b205fa256c568a1b783af274566f36b253458639325 --- Real Ultimate output --- This is Ultimate 0.3.0-?-e2fb8be-m [2025-03-09 01:19:17,947 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-09 01:19:18,001 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2025-03-09 01:19:18,007 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-09 01:19:18,010 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-09 01:19:18,023 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-09 01:19:18,023 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-09 01:19:18,023 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-09 01:19:18,024 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-09 01:19:18,024 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-09 01:19:18,024 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-09 01:19:18,024 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-09 01:19:18,024 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-09 01:19:18,024 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-09 01:19:18,024 INFO L153 SettingsManager]: * Use SBE=true [2025-03-09 01:19:18,024 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-09 01:19:18,024 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-09 01:19:18,025 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-09 01:19:18,025 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-09 01:19:18,025 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-09 01:19:18,025 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2025-03-09 01:19:18,025 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2025-03-09 01:19:18,025 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2025-03-09 01:19:18,025 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-09 01:19:18,025 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-03-09 01:19:18,025 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-03-09 01:19:18,025 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-09 01:19:18,025 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-09 01:19:18,025 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-09 01:19:18,025 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-09 01:19:18,026 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-09 01:19:18,026 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-09 01:19:18,026 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-09 01:19:18,026 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-09 01:19:18,026 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-09 01:19:18,026 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-09 01:19:18,026 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-09 01:19:18,026 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-09 01:19:18,026 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-09 01:19:18,026 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-09 01:19:18,026 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-09 01:19:18,026 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-09 01:19:18,026 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 -> 8a0558934008acf79b7e5b205fa256c568a1b783af274566f36b253458639325 [2025-03-09 01:19:18,235 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-09 01:19:18,243 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-09 01:19:18,245 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-09 01:19:18,246 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-09 01:19:18,247 INFO L274 PluginConnector]: CDTParser initialized [2025-03-09 01:19:18,248 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/weaver/chl-array-int-symm.wvr.c [2025-03-09 01:19:19,364 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b541ab2a6/84eeaef671eb48cdb85d0c76596e7365/FLAGe49534cb9 [2025-03-09 01:19:19,580 INFO L384 CDTParser]: Found 1 translation units. [2025-03-09 01:19:19,583 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/weaver/chl-array-int-symm.wvr.c [2025-03-09 01:19:19,588 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b541ab2a6/84eeaef671eb48cdb85d0c76596e7365/FLAGe49534cb9 [2025-03-09 01:19:19,603 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b541ab2a6/84eeaef671eb48cdb85d0c76596e7365 [2025-03-09 01:19:19,604 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-09 01:19:19,606 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-09 01:19:19,606 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-09 01:19:19,607 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-09 01:19:19,609 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-09 01:19:19,610 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.03 01:19:19" (1/1) ... [2025-03-09 01:19:19,611 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@21a46283 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:19:19, skipping insertion in model container [2025-03-09 01:19:19,611 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.03 01:19:19" (1/1) ... [2025-03-09 01:19:19,622 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-09 01:19:19,753 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-03-09 01:19:19,760 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-09 01:19:19,770 INFO L200 MainTranslator]: Completed pre-run [2025-03-09 01:19:19,791 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-09 01:19:19,803 INFO L204 MainTranslator]: Completed translation [2025-03-09 01:19:19,804 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:19:19 WrapperNode [2025-03-09 01:19:19,804 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-09 01:19:19,805 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-09 01:19:19,805 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-09 01:19:19,806 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-09 01:19:19,809 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:19:19" (1/1) ... [2025-03-09 01:19:19,819 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:19:19" (1/1) ... [2025-03-09 01:19:19,842 INFO L138 Inliner]: procedures = 24, calls = 30, calls flagged for inlining = 14, calls inlined = 18, statements flattened = 183 [2025-03-09 01:19:19,843 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-09 01:19:19,844 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-09 01:19:19,844 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-09 01:19:19,844 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-09 01:19:19,850 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:19:19" (1/1) ... [2025-03-09 01:19:19,850 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:19:19" (1/1) ... [2025-03-09 01:19:19,852 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:19:19" (1/1) ... [2025-03-09 01:19:19,861 INFO L175 MemorySlicer]: Split 12 memory accesses to 2 slices as follows [2, 10]. 83 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0]. The 2 writes are split as follows [0, 2]. [2025-03-09 01:19:19,861 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:19:19" (1/1) ... [2025-03-09 01:19:19,861 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:19:19" (1/1) ... [2025-03-09 01:19:19,868 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:19:19" (1/1) ... [2025-03-09 01:19:19,872 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:19:19" (1/1) ... [2025-03-09 01:19:19,873 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:19:19" (1/1) ... [2025-03-09 01:19:19,875 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:19:19" (1/1) ... [2025-03-09 01:19:19,876 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-09 01:19:19,877 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-09 01:19:19,877 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-09 01:19:19,877 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-09 01:19:19,879 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:19:19" (1/1) ... [2025-03-09 01:19:19,883 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-09 01:19:19,892 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 01:19:19,902 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-09 01:19:19,904 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-09 01:19:19,920 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-09 01:19:19,920 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2025-03-09 01:19:19,920 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2025-03-09 01:19:19,920 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2025-03-09 01:19:19,920 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2025-03-09 01:19:19,920 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-09 01:19:19,920 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-03-09 01:19:19,920 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-03-09 01:19:19,920 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-03-09 01:19:19,920 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-03-09 01:19:19,920 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-09 01:19:19,921 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-09 01:19:19,921 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-03-09 01:19:19,921 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-03-09 01:19:19,921 WARN L225 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-03-09 01:19:19,987 INFO L256 CfgBuilder]: Building ICFG [2025-03-09 01:19:19,988 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-09 01:19:20,371 INFO L303 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-03-09 01:19:20,371 INFO L307 CfgBuilder]: Performing block encoding [2025-03-09 01:19:20,632 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-09 01:19:20,632 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-09 01:19:20,632 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 09.03 01:19:20 BoogieIcfgContainer [2025-03-09 01:19:20,632 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-09 01:19:20,634 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-09 01:19:20,634 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-09 01:19:20,637 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-09 01:19:20,637 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.03 01:19:19" (1/3) ... [2025-03-09 01:19:20,638 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5af79d93 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.03 01:19:20, skipping insertion in model container [2025-03-09 01:19:20,638 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:19:19" (2/3) ... [2025-03-09 01:19:20,638 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5af79d93 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.03 01:19:20, skipping insertion in model container [2025-03-09 01:19:20,638 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 09.03 01:19:20" (3/3) ... [2025-03-09 01:19:20,639 INFO L128 eAbstractionObserver]: Analyzing ICFG chl-array-int-symm.wvr.c [2025-03-09 01:19:20,649 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-09 01:19:20,651 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG chl-array-int-symm.wvr.c that has 3 procedures, 55 locations, 1 initial locations, 4 loop locations, and 22 error locations. [2025-03-09 01:19:20,651 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-03-09 01:19:20,712 INFO L143 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2025-03-09 01:19:20,737 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 61 places, 60 transitions, 134 flow [2025-03-09 01:19:20,767 INFO L124 PetriNetUnfolderBase]: 6/58 cut-off events. [2025-03-09 01:19:20,769 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2025-03-09 01:19:20,772 INFO L83 FinitePrefix]: Finished finitePrefix Result has 67 conditions, 58 events. 6/58 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 164 event pairs, 0 based on Foata normal form. 0/30 useless extension candidates. Maximal degree in co-relation 41. Up to 2 conditions per place. [2025-03-09 01:19:20,773 INFO L82 GeneralOperation]: Start removeDead. Operand has 61 places, 60 transitions, 134 flow [2025-03-09 01:19:20,775 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 58 places, 57 transitions, 126 flow [2025-03-09 01:19:20,783 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-09 01:19:20,790 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;@2791db45, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-09 01:19:20,790 INFO L334 AbstractCegarLoop]: Starting to check reachability of 40 error locations. [2025-03-09 01:19:20,792 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-09 01:19:20,792 INFO L124 PetriNetUnfolderBase]: 1/4 cut-off events. [2025-03-09 01:19:20,793 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-09 01:19:20,793 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 01:19:20,793 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2025-03-09 01:19:20,793 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 37 more)] === [2025-03-09 01:19:20,796 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:19:20,796 INFO L85 PathProgramCache]: Analyzing trace with hash 564242, now seen corresponding path program 1 times [2025-03-09 01:19:20,802 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:19:20,802 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [277893661] [2025-03-09 01:19:20,802 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:19:20,803 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:19:20,848 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-03-09 01:19:20,863 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-03-09 01:19:20,864 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:19:20,864 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:19:20,953 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 01:19:20,955 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:19:20,955 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [277893661] [2025-03-09 01:19:20,955 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [277893661] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 01:19:20,955 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 01:19:20,956 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-03-09 01:19:20,957 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1734888365] [2025-03-09 01:19:20,957 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 01:19:20,961 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-09 01:19:20,964 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:19:20,975 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-09 01:19:20,976 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-09 01:19:21,031 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 32 out of 60 [2025-03-09 01:19:21,033 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 58 places, 57 transitions, 126 flow. Second operand has 3 states, 3 states have (on average 33.0) internal successors, (99), 3 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:19:21,033 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 01:19:21,033 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 32 of 60 [2025-03-09 01:19:21,033 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 01:19:21,104 INFO L124 PetriNetUnfolderBase]: 105/252 cut-off events. [2025-03-09 01:19:21,104 INFO L125 PetriNetUnfolderBase]: For 11/11 co-relation queries the response was YES. [2025-03-09 01:19:21,105 INFO L83 FinitePrefix]: Finished finitePrefix Result has 443 conditions, 252 events. 105/252 cut-off events. For 11/11 co-relation queries the response was YES. Maximal size of possible extension queue 25. Compared 1143 event pairs, 58 based on Foata normal form. 1/160 useless extension candidates. Maximal degree in co-relation 386. Up to 166 conditions per place. [2025-03-09 01:19:21,107 INFO L140 encePairwiseOnDemand]: 55/60 looper letters, 22 selfloop transitions, 2 changer transitions 0/53 dead transitions. [2025-03-09 01:19:21,107 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 56 places, 53 transitions, 166 flow [2025-03-09 01:19:21,107 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-09 01:19:21,109 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-09 01:19:21,113 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 123 transitions. [2025-03-09 01:19:21,114 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6833333333333333 [2025-03-09 01:19:21,115 INFO L175 Difference]: Start difference. First operand has 58 places, 57 transitions, 126 flow. Second operand 3 states and 123 transitions. [2025-03-09 01:19:21,115 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 56 places, 53 transitions, 166 flow [2025-03-09 01:19:21,119 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 52 places, 53 transitions, 158 flow, removed 0 selfloop flow, removed 4 redundant places. [2025-03-09 01:19:21,120 INFO L231 Difference]: Finished difference. Result has 52 places, 53 transitions, 114 flow [2025-03-09 01:19:21,122 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=60, PETRI_DIFFERENCE_MINUEND_FLOW=110, PETRI_DIFFERENCE_MINUEND_PLACES=50, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=53, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=51, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=114, PETRI_PLACES=52, PETRI_TRANSITIONS=53} [2025-03-09 01:19:21,124 INFO L279 CegarLoopForPetriNet]: 58 programPoint places, -6 predicate places. [2025-03-09 01:19:21,124 INFO L471 AbstractCegarLoop]: Abstraction has has 52 places, 53 transitions, 114 flow [2025-03-09 01:19:21,124 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 33.0) internal successors, (99), 3 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:19:21,124 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 01:19:21,124 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2025-03-09 01:19:21,124 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-09 01:19:21,125 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 37 more)] === [2025-03-09 01:19:21,125 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:19:21,125 INFO L85 PathProgramCache]: Analyzing trace with hash 564243, now seen corresponding path program 1 times [2025-03-09 01:19:21,125 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:19:21,125 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1359492155] [2025-03-09 01:19:21,125 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:19:21,125 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:19:21,130 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-03-09 01:19:21,149 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-03-09 01:19:21,149 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:19:21,149 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:19:21,370 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 01:19:21,370 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:19:21,370 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1359492155] [2025-03-09 01:19:21,370 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1359492155] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 01:19:21,370 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 01:19:21,370 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-09 01:19:21,370 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2095610111] [2025-03-09 01:19:21,370 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 01:19:21,371 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-09 01:19:21,371 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:19:21,371 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-09 01:19:21,371 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-09 01:19:21,438 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 32 out of 60 [2025-03-09 01:19:21,439 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 52 places, 53 transitions, 114 flow. Second operand has 4 states, 4 states have (on average 32.75) internal successors, (131), 4 states have internal predecessors, (131), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:19:21,439 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 01:19:21,439 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 32 of 60 [2025-03-09 01:19:21,439 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 01:19:21,547 INFO L124 PetriNetUnfolderBase]: 106/255 cut-off events. [2025-03-09 01:19:21,547 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2025-03-09 01:19:21,548 INFO L83 FinitePrefix]: Finished finitePrefix Result has 441 conditions, 255 events. 106/255 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 25. Compared 1149 event pairs, 58 based on Foata normal form. 0/160 useless extension candidates. Maximal degree in co-relation 412. Up to 175 conditions per place. [2025-03-09 01:19:21,549 INFO L140 encePairwiseOnDemand]: 55/60 looper letters, 25 selfloop transitions, 4 changer transitions 0/56 dead transitions. [2025-03-09 01:19:21,549 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 55 places, 56 transitions, 178 flow [2025-03-09 01:19:21,549 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-09 01:19:21,549 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-09 01:19:21,550 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 158 transitions. [2025-03-09 01:19:21,550 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6583333333333333 [2025-03-09 01:19:21,550 INFO L175 Difference]: Start difference. First operand has 52 places, 53 transitions, 114 flow. Second operand 4 states and 158 transitions. [2025-03-09 01:19:21,550 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 55 places, 56 transitions, 178 flow [2025-03-09 01:19:21,551 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 53 places, 56 transitions, 174 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-09 01:19:21,552 INFO L231 Difference]: Finished difference. Result has 55 places, 56 transitions, 137 flow [2025-03-09 01:19:21,552 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=60, PETRI_DIFFERENCE_MINUEND_FLOW=110, PETRI_DIFFERENCE_MINUEND_PLACES=50, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=53, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=49, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=137, PETRI_PLACES=55, PETRI_TRANSITIONS=56} [2025-03-09 01:19:21,553 INFO L279 CegarLoopForPetriNet]: 58 programPoint places, -3 predicate places. [2025-03-09 01:19:21,553 INFO L471 AbstractCegarLoop]: Abstraction has has 55 places, 56 transitions, 137 flow [2025-03-09 01:19:21,553 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 32.75) internal successors, (131), 4 states have internal predecessors, (131), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:19:21,553 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 01:19:21,553 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1] [2025-03-09 01:19:21,553 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-09 01:19:21,553 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 37 more)] === [2025-03-09 01:19:21,554 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:19:21,554 INFO L85 PathProgramCache]: Analyzing trace with hash 17493669, now seen corresponding path program 1 times [2025-03-09 01:19:21,554 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:19:21,554 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1170292230] [2025-03-09 01:19:21,554 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:19:21,554 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:19:21,559 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-03-09 01:19:21,566 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-03-09 01:19:21,566 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:19:21,566 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:19:21,754 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 01:19:21,754 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:19:21,754 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1170292230] [2025-03-09 01:19:21,754 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1170292230] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 01:19:21,755 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 01:19:21,755 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-09 01:19:21,755 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1884504816] [2025-03-09 01:19:21,755 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 01:19:21,755 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-09 01:19:21,756 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:19:21,756 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-09 01:19:21,756 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-09 01:19:21,871 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 32 out of 60 [2025-03-09 01:19:21,871 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 55 places, 56 transitions, 137 flow. Second operand has 5 states, 5 states have (on average 32.8) internal successors, (164), 5 states have internal predecessors, (164), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:19:21,872 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 01:19:21,872 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 32 of 60 [2025-03-09 01:19:21,872 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 01:19:22,008 INFO L124 PetriNetUnfolderBase]: 107/258 cut-off events. [2025-03-09 01:19:22,010 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2025-03-09 01:19:22,012 INFO L83 FinitePrefix]: Finished finitePrefix Result has 458 conditions, 258 events. 107/258 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 25. Compared 1163 event pairs, 58 based on Foata normal form. 0/162 useless extension candidates. Maximal degree in co-relation 433. Up to 174 conditions per place. [2025-03-09 01:19:22,013 INFO L140 encePairwiseOnDemand]: 52/60 looper letters, 25 selfloop transitions, 7 changer transitions 0/59 dead transitions. [2025-03-09 01:19:22,015 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 59 places, 59 transitions, 207 flow [2025-03-09 01:19:22,015 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-09 01:19:22,015 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-03-09 01:19:22,016 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 193 transitions. [2025-03-09 01:19:22,016 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6433333333333333 [2025-03-09 01:19:22,016 INFO L175 Difference]: Start difference. First operand has 55 places, 56 transitions, 137 flow. Second operand 5 states and 193 transitions. [2025-03-09 01:19:22,016 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 59 places, 59 transitions, 207 flow [2025-03-09 01:19:22,018 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 58 places, 59 transitions, 204 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-09 01:19:22,019 INFO L231 Difference]: Finished difference. Result has 60 places, 59 transitions, 171 flow [2025-03-09 01:19:22,019 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=60, PETRI_DIFFERENCE_MINUEND_FLOW=134, PETRI_DIFFERENCE_MINUEND_PLACES=54, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=56, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=49, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=171, PETRI_PLACES=60, PETRI_TRANSITIONS=59} [2025-03-09 01:19:22,020 INFO L279 CegarLoopForPetriNet]: 58 programPoint places, 2 predicate places. [2025-03-09 01:19:22,020 INFO L471 AbstractCegarLoop]: Abstraction has has 60 places, 59 transitions, 171 flow [2025-03-09 01:19:22,020 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 32.8) internal successors, (164), 5 states have internal predecessors, (164), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:19:22,020 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 01:19:22,020 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1] [2025-03-09 01:19:22,020 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-09 01:19:22,020 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 37 more)] === [2025-03-09 01:19:22,020 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:19:22,020 INFO L85 PathProgramCache]: Analyzing trace with hash 542254957, now seen corresponding path program 1 times [2025-03-09 01:19:22,020 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:19:22,020 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1570575269] [2025-03-09 01:19:22,020 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:19:22,020 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:19:22,025 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-03-09 01:19:22,034 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-03-09 01:19:22,035 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:19:22,035 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:19:22,204 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 01:19:22,205 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:19:22,205 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1570575269] [2025-03-09 01:19:22,205 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1570575269] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 01:19:22,205 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1659724317] [2025-03-09 01:19:22,206 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:19:22,206 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 01:19:22,206 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 01:19:22,208 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-09 01:19:22,210 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-09 01:19:22,251 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-03-09 01:19:22,260 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-03-09 01:19:22,260 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:19:22,260 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:19:22,262 INFO L256 TraceCheckSpWp]: Trace formula consists of 71 conjuncts, 14 conjuncts are in the unsatisfiable core [2025-03-09 01:19:22,265 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 01:19:22,311 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2025-03-09 01:19:22,494 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-09 01:19:22,494 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 01:19:22,609 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 01:19:22,609 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1659724317] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-09 01:19:22,609 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-09 01:19:22,610 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2025-03-09 01:19:22,610 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [907006246] [2025-03-09 01:19:22,610 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-09 01:19:22,610 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-09 01:19:22,610 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:19:22,611 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-09 01:19:22,611 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=76, Unknown=0, NotChecked=0, Total=110 [2025-03-09 01:19:22,899 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 32 out of 60 [2025-03-09 01:19:22,900 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 60 places, 59 transitions, 171 flow. Second operand has 11 states, 11 states have (on average 33.36363636363637) internal successors, (367), 11 states have internal predecessors, (367), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:19:22,900 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 01:19:22,900 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 32 of 60 [2025-03-09 01:19:22,900 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 01:19:23,097 INFO L124 PetriNetUnfolderBase]: 107/257 cut-off events. [2025-03-09 01:19:23,097 INFO L125 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2025-03-09 01:19:23,098 INFO L83 FinitePrefix]: Finished finitePrefix Result has 471 conditions, 257 events. 107/257 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 25. Compared 1152 event pairs, 58 based on Foata normal form. 0/164 useless extension candidates. Maximal degree in co-relation 443. Up to 174 conditions per place. [2025-03-09 01:19:23,099 INFO L140 encePairwiseOnDemand]: 55/60 looper letters, 24 selfloop transitions, 7 changer transitions 0/58 dead transitions. [2025-03-09 01:19:23,099 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 64 places, 58 transitions, 229 flow [2025-03-09 01:19:23,100 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-09 01:19:23,100 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-09 01:19:23,100 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 221 transitions. [2025-03-09 01:19:23,101 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6138888888888889 [2025-03-09 01:19:23,101 INFO L175 Difference]: Start difference. First operand has 60 places, 59 transitions, 171 flow. Second operand 6 states and 221 transitions. [2025-03-09 01:19:23,101 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 64 places, 58 transitions, 229 flow [2025-03-09 01:19:23,102 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 63 places, 58 transitions, 228 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-09 01:19:23,103 INFO L231 Difference]: Finished difference. Result has 63 places, 58 transitions, 180 flow [2025-03-09 01:19:23,104 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=60, PETRI_DIFFERENCE_MINUEND_FLOW=166, PETRI_DIFFERENCE_MINUEND_PLACES=58, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=58, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=51, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=180, PETRI_PLACES=63, PETRI_TRANSITIONS=58} [2025-03-09 01:19:23,104 INFO L279 CegarLoopForPetriNet]: 58 programPoint places, 5 predicate places. [2025-03-09 01:19:23,104 INFO L471 AbstractCegarLoop]: Abstraction has has 63 places, 58 transitions, 180 flow [2025-03-09 01:19:23,104 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 33.36363636363637) internal successors, (367), 11 states have internal predecessors, (367), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:19:23,104 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 01:19:23,104 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1] [2025-03-09 01:19:23,111 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-03-09 01:19:23,305 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 01:19:23,305 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 37 more)] === [2025-03-09 01:19:23,306 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:19:23,306 INFO L85 PathProgramCache]: Analyzing trace with hash -368435391, now seen corresponding path program 1 times [2025-03-09 01:19:23,306 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:19:23,306 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [883931844] [2025-03-09 01:19:23,306 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:19:23,306 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:19:23,311 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-03-09 01:19:23,318 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-03-09 01:19:23,318 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:19:23,318 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:19:23,490 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 01:19:23,490 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:19:23,490 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [883931844] [2025-03-09 01:19:23,490 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [883931844] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 01:19:23,490 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2134273091] [2025-03-09 01:19:23,490 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:19:23,490 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 01:19:23,491 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 01:19:23,492 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-09 01:19:23,494 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-09 01:19:23,534 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-03-09 01:19:23,546 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-03-09 01:19:23,546 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:19:23,546 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:19:23,548 INFO L256 TraceCheckSpWp]: Trace formula consists of 96 conjuncts, 16 conjuncts are in the unsatisfiable core [2025-03-09 01:19:23,551 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 01:19:23,573 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2025-03-09 01:19:23,725 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 01:19:23,725 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 01:19:23,861 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 01:19:23,862 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2134273091] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-09 01:19:23,862 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-09 01:19:23,862 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 11 [2025-03-09 01:19:23,862 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1833363067] [2025-03-09 01:19:23,862 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-09 01:19:23,862 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-03-09 01:19:23,862 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:19:23,862 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-03-09 01:19:23,862 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=116, Unknown=0, NotChecked=0, Total=156 [2025-03-09 01:19:24,375 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 32 out of 60 [2025-03-09 01:19:24,376 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 63 places, 58 transitions, 180 flow. Second operand has 13 states, 13 states have (on average 33.30769230769231) internal successors, (433), 13 states have internal predecessors, (433), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:19:24,376 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 01:19:24,377 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 32 of 60 [2025-03-09 01:19:24,377 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 01:19:24,664 INFO L124 PetriNetUnfolderBase]: 109/262 cut-off events. [2025-03-09 01:19:24,664 INFO L125 PetriNetUnfolderBase]: For 7/7 co-relation queries the response was YES. [2025-03-09 01:19:24,664 INFO L83 FinitePrefix]: Finished finitePrefix Result has 497 conditions, 262 events. 109/262 cut-off events. For 7/7 co-relation queries the response was YES. Maximal size of possible extension queue 25. Compared 1176 event pairs, 58 based on Foata normal form. 0/169 useless extension candidates. Maximal degree in co-relation 451. Up to 167 conditions per place. [2025-03-09 01:19:24,665 INFO L140 encePairwiseOnDemand]: 52/60 looper letters, 18 selfloop transitions, 18 changer transitions 0/63 dead transitions. [2025-03-09 01:19:24,665 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 70 places, 63 transitions, 281 flow [2025-03-09 01:19:24,667 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-09 01:19:24,667 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2025-03-09 01:19:24,667 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 326 transitions. [2025-03-09 01:19:24,667 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6037037037037037 [2025-03-09 01:19:24,668 INFO L175 Difference]: Start difference. First operand has 63 places, 58 transitions, 180 flow. Second operand 9 states and 326 transitions. [2025-03-09 01:19:24,668 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 70 places, 63 transitions, 281 flow [2025-03-09 01:19:24,668 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 62 places, 63 transitions, 234 flow, removed 6 selfloop flow, removed 8 redundant places. [2025-03-09 01:19:24,669 INFO L231 Difference]: Finished difference. Result has 62 places, 63 transitions, 198 flow [2025-03-09 01:19:24,669 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=60, PETRI_DIFFERENCE_MINUEND_FLOW=142, PETRI_DIFFERENCE_MINUEND_PLACES=54, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=57, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=45, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=198, PETRI_PLACES=62, PETRI_TRANSITIONS=63} [2025-03-09 01:19:24,670 INFO L279 CegarLoopForPetriNet]: 58 programPoint places, 4 predicate places. [2025-03-09 01:19:24,670 INFO L471 AbstractCegarLoop]: Abstraction has has 62 places, 63 transitions, 198 flow [2025-03-09 01:19:24,670 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 33.30769230769231) internal successors, (433), 13 states have internal predecessors, (433), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:19:24,670 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 01:19:24,670 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2025-03-09 01:19:24,676 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-09 01:19:24,870 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 01:19:24,871 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting thread1Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 37 more)] === [2025-03-09 01:19:24,871 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:19:24,871 INFO L85 PathProgramCache]: Analyzing trace with hash 1466350822, now seen corresponding path program 1 times [2025-03-09 01:19:24,871 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:19:24,871 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1721763223] [2025-03-09 01:19:24,871 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:19:24,871 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:19:24,875 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-03-09 01:19:24,879 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-03-09 01:19:24,879 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:19:24,879 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:19:24,915 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 01:19:24,915 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:19:24,915 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1721763223] [2025-03-09 01:19:24,915 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1721763223] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 01:19:24,915 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 01:19:24,915 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-09 01:19:24,915 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2012545095] [2025-03-09 01:19:24,915 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 01:19:24,915 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-09 01:19:24,915 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:19:24,916 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-09 01:19:24,916 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-09 01:19:24,953 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 33 out of 60 [2025-03-09 01:19:24,954 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 62 places, 63 transitions, 198 flow. Second operand has 5 states, 5 states have (on average 34.2) internal successors, (171), 5 states have internal predecessors, (171), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:19:24,954 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 01:19:24,954 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 33 of 60 [2025-03-09 01:19:24,954 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 01:19:25,044 INFO L124 PetriNetUnfolderBase]: 176/448 cut-off events. [2025-03-09 01:19:25,044 INFO L125 PetriNetUnfolderBase]: For 5/5 co-relation queries the response was YES. [2025-03-09 01:19:25,045 INFO L83 FinitePrefix]: Finished finitePrefix Result has 825 conditions, 448 events. 176/448 cut-off events. For 5/5 co-relation queries the response was YES. Maximal size of possible extension queue 40. Compared 2396 event pairs, 74 based on Foata normal form. 12/325 useless extension candidates. Maximal degree in co-relation 522. Up to 206 conditions per place. [2025-03-09 01:19:25,046 INFO L140 encePairwiseOnDemand]: 53/60 looper letters, 62 selfloop transitions, 6 changer transitions 0/94 dead transitions. [2025-03-09 01:19:25,046 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 67 places, 94 transitions, 439 flow [2025-03-09 01:19:25,046 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-09 01:19:25,047 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-09 01:19:25,047 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 255 transitions. [2025-03-09 01:19:25,047 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7083333333333334 [2025-03-09 01:19:25,047 INFO L175 Difference]: Start difference. First operand has 62 places, 63 transitions, 198 flow. Second operand 6 states and 255 transitions. [2025-03-09 01:19:25,047 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 67 places, 94 transitions, 439 flow [2025-03-09 01:19:25,048 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 62 places, 94 transitions, 386 flow, removed 12 selfloop flow, removed 5 redundant places. [2025-03-09 01:19:25,049 INFO L231 Difference]: Finished difference. Result has 65 places, 66 transitions, 202 flow [2025-03-09 01:19:25,049 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=60, PETRI_DIFFERENCE_MINUEND_FLOW=165, PETRI_DIFFERENCE_MINUEND_PLACES=57, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=63, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=57, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=202, PETRI_PLACES=65, PETRI_TRANSITIONS=66} [2025-03-09 01:19:25,049 INFO L279 CegarLoopForPetriNet]: 58 programPoint places, 7 predicate places. [2025-03-09 01:19:25,049 INFO L471 AbstractCegarLoop]: Abstraction has has 65 places, 66 transitions, 202 flow [2025-03-09 01:19:25,050 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 34.2) internal successors, (171), 5 states have internal predecessors, (171), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:19:25,050 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 01:19:25,050 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 01:19:25,050 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-09 01:19:25,050 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting thread1Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 37 more)] === [2025-03-09 01:19:25,050 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:19:25,050 INFO L85 PathProgramCache]: Analyzing trace with hash -689501376, now seen corresponding path program 1 times [2025-03-09 01:19:25,050 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:19:25,050 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [153741075] [2025-03-09 01:19:25,050 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:19:25,050 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:19:25,054 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-03-09 01:19:25,060 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-03-09 01:19:25,060 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:19:25,060 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:19:25,115 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-09 01:19:25,115 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:19:25,115 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [153741075] [2025-03-09 01:19:25,115 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [153741075] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 01:19:25,115 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 01:19:25,115 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-09 01:19:25,116 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [397121473] [2025-03-09 01:19:25,116 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 01:19:25,116 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-09 01:19:25,116 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:19:25,116 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-09 01:19:25,116 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-09 01:19:25,140 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 33 out of 60 [2025-03-09 01:19:25,140 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 65 places, 66 transitions, 202 flow. Second operand has 5 states, 5 states have (on average 34.6) internal successors, (173), 5 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-09 01:19:25,140 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 01:19:25,140 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 33 of 60 [2025-03-09 01:19:25,140 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 01:19:25,263 INFO L124 PetriNetUnfolderBase]: 276/740 cut-off events. [2025-03-09 01:19:25,264 INFO L125 PetriNetUnfolderBase]: For 95/95 co-relation queries the response was YES. [2025-03-09 01:19:25,265 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1372 conditions, 740 events. 276/740 cut-off events. For 95/95 co-relation queries the response was YES. Maximal size of possible extension queue 64. Compared 4776 event pairs, 114 based on Foata normal form. 12/539 useless extension candidates. Maximal degree in co-relation 844. Up to 305 conditions per place. [2025-03-09 01:19:25,268 INFO L140 encePairwiseOnDemand]: 55/60 looper letters, 54 selfloop transitions, 9 changer transitions 0/89 dead transitions. [2025-03-09 01:19:25,270 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 69 places, 89 transitions, 385 flow [2025-03-09 01:19:25,271 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-09 01:19:25,272 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-03-09 01:19:25,272 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 216 transitions. [2025-03-09 01:19:25,273 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.72 [2025-03-09 01:19:25,273 INFO L175 Difference]: Start difference. First operand has 65 places, 66 transitions, 202 flow. Second operand 5 states and 216 transitions. [2025-03-09 01:19:25,273 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 69 places, 89 transitions, 385 flow [2025-03-09 01:19:25,274 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 67 places, 89 transitions, 380 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-09 01:19:25,276 INFO L231 Difference]: Finished difference. Result has 69 places, 68 transitions, 237 flow [2025-03-09 01:19:25,277 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=60, PETRI_DIFFERENCE_MINUEND_FLOW=197, PETRI_DIFFERENCE_MINUEND_PLACES=63, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=66, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=57, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=237, PETRI_PLACES=69, PETRI_TRANSITIONS=68} [2025-03-09 01:19:25,278 INFO L279 CegarLoopForPetriNet]: 58 programPoint places, 11 predicate places. [2025-03-09 01:19:25,278 INFO L471 AbstractCegarLoop]: Abstraction has has 69 places, 68 transitions, 237 flow [2025-03-09 01:19:25,279 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 34.6) internal successors, (173), 5 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-09 01:19:25,279 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 01:19:25,279 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 01:19:25,279 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-09 01:19:25,279 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting thread2Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 37 more)] === [2025-03-09 01:19:25,279 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:19:25,279 INFO L85 PathProgramCache]: Analyzing trace with hash 408566090, now seen corresponding path program 1 times [2025-03-09 01:19:25,280 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:19:25,280 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [544349226] [2025-03-09 01:19:25,280 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:19:25,280 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:19:25,285 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-03-09 01:19:25,288 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-03-09 01:19:25,291 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:19:25,291 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:19:25,337 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 01:19:25,337 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:19:25,337 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [544349226] [2025-03-09 01:19:25,337 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [544349226] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 01:19:25,337 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 01:19:25,337 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-09 01:19:25,337 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [635048301] [2025-03-09 01:19:25,337 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 01:19:25,338 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-09 01:19:25,338 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:19:25,338 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-09 01:19:25,338 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-09 01:19:25,363 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 33 out of 60 [2025-03-09 01:19:25,363 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 69 places, 68 transitions, 237 flow. Second operand has 5 states, 5 states have (on average 34.6) internal successors, (173), 5 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-09 01:19:25,363 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 01:19:25,363 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 33 of 60 [2025-03-09 01:19:25,363 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 01:19:25,464 INFO L124 PetriNetUnfolderBase]: 224/706 cut-off events. [2025-03-09 01:19:25,464 INFO L125 PetriNetUnfolderBase]: For 260/260 co-relation queries the response was YES. [2025-03-09 01:19:25,465 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1329 conditions, 706 events. 224/706 cut-off events. For 260/260 co-relation queries the response was YES. Maximal size of possible extension queue 60. Compared 4715 event pairs, 122 based on Foata normal form. 14/521 useless extension candidates. Maximal degree in co-relation 784. Up to 307 conditions per place. [2025-03-09 01:19:25,468 INFO L140 encePairwiseOnDemand]: 53/60 looper letters, 58 selfloop transitions, 6 changer transitions 0/90 dead transitions. [2025-03-09 01:19:25,468 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 74 places, 90 transitions, 442 flow [2025-03-09 01:19:25,469 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-09 01:19:25,469 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-09 01:19:25,469 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 248 transitions. [2025-03-09 01:19:25,470 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6888888888888889 [2025-03-09 01:19:25,470 INFO L175 Difference]: Start difference. First operand has 69 places, 68 transitions, 237 flow. Second operand 6 states and 248 transitions. [2025-03-09 01:19:25,470 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 74 places, 90 transitions, 442 flow [2025-03-09 01:19:25,473 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 73 places, 90 transitions, 437 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-09 01:19:25,476 INFO L231 Difference]: Finished difference. Result has 75 places, 69 transitions, 254 flow [2025-03-09 01:19:25,476 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=60, PETRI_DIFFERENCE_MINUEND_FLOW=232, PETRI_DIFFERENCE_MINUEND_PLACES=68, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=68, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=62, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=254, PETRI_PLACES=75, PETRI_TRANSITIONS=69} [2025-03-09 01:19:25,476 INFO L279 CegarLoopForPetriNet]: 58 programPoint places, 17 predicate places. [2025-03-09 01:19:25,476 INFO L471 AbstractCegarLoop]: Abstraction has has 75 places, 69 transitions, 254 flow [2025-03-09 01:19:25,476 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 34.6) internal successors, (173), 5 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-09 01:19:25,476 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 01:19:25,477 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 01:19:25,477 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-09 01:19:25,477 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting thread2Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 37 more)] === [2025-03-09 01:19:25,477 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:19:25,477 INFO L85 PathProgramCache]: Analyzing trace with hash -1191159516, now seen corresponding path program 1 times [2025-03-09 01:19:25,477 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:19:25,477 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1823941631] [2025-03-09 01:19:25,477 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:19:25,477 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:19:25,483 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-03-09 01:19:25,488 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-03-09 01:19:25,488 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:19:25,488 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:19:25,530 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-03-09 01:19:25,530 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:19:25,530 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1823941631] [2025-03-09 01:19:25,531 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1823941631] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 01:19:25,531 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 01:19:25,531 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-09 01:19:25,531 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [708048349] [2025-03-09 01:19:25,531 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 01:19:25,531 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-09 01:19:25,531 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:19:25,531 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-09 01:19:25,531 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-09 01:19:25,558 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 33 out of 60 [2025-03-09 01:19:25,559 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 75 places, 69 transitions, 254 flow. Second operand has 5 states, 5 states have (on average 35.0) internal successors, (175), 5 states have internal predecessors, (175), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:19:25,559 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 01:19:25,559 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 33 of 60 [2025-03-09 01:19:25,559 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 01:19:25,649 INFO L124 PetriNetUnfolderBase]: 185/523 cut-off events. [2025-03-09 01:19:25,649 INFO L125 PetriNetUnfolderBase]: For 277/277 co-relation queries the response was YES. [2025-03-09 01:19:25,650 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1121 conditions, 523 events. 185/523 cut-off events. For 277/277 co-relation queries the response was YES. Maximal size of possible extension queue 39. Compared 3003 event pairs, 99 based on Foata normal form. 7/413 useless extension candidates. Maximal degree in co-relation 750. Up to 253 conditions per place. [2025-03-09 01:19:25,651 INFO L140 encePairwiseOnDemand]: 55/60 looper letters, 50 selfloop transitions, 9 changer transitions 0/85 dead transitions. [2025-03-09 01:19:25,652 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 79 places, 85 transitions, 429 flow [2025-03-09 01:19:25,653 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-09 01:19:25,653 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-03-09 01:19:25,653 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 209 transitions. [2025-03-09 01:19:25,654 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6966666666666667 [2025-03-09 01:19:25,654 INFO L175 Difference]: Start difference. First operand has 75 places, 69 transitions, 254 flow. Second operand 5 states and 209 transitions. [2025-03-09 01:19:25,654 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 79 places, 85 transitions, 429 flow [2025-03-09 01:19:25,655 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 76 places, 85 transitions, 421 flow, removed 0 selfloop flow, removed 3 redundant places. [2025-03-09 01:19:25,656 INFO L231 Difference]: Finished difference. Result has 78 places, 71 transitions, 286 flow [2025-03-09 01:19:25,656 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=60, PETRI_DIFFERENCE_MINUEND_FLOW=246, PETRI_DIFFERENCE_MINUEND_PLACES=72, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=69, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=60, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=286, PETRI_PLACES=78, PETRI_TRANSITIONS=71} [2025-03-09 01:19:25,657 INFO L279 CegarLoopForPetriNet]: 58 programPoint places, 20 predicate places. [2025-03-09 01:19:25,657 INFO L471 AbstractCegarLoop]: Abstraction has has 78 places, 71 transitions, 286 flow [2025-03-09 01:19:25,658 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 35.0) internal successors, (175), 5 states have internal predecessors, (175), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:19:25,658 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 01:19:25,658 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 01:19:25,658 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-09 01:19:25,658 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting thread1Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 37 more)] === [2025-03-09 01:19:25,658 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:19:25,658 INFO L85 PathProgramCache]: Analyzing trace with hash 281450148, now seen corresponding path program 1 times [2025-03-09 01:19:25,658 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:19:25,658 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [338990121] [2025-03-09 01:19:25,658 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:19:25,658 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:19:25,663 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-03-09 01:19:25,669 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-03-09 01:19:25,669 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:19:25,669 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:19:25,732 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-09 01:19:25,732 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:19:25,732 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [338990121] [2025-03-09 01:19:25,732 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [338990121] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 01:19:25,732 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 01:19:25,732 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-09 01:19:25,732 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [863057515] [2025-03-09 01:19:25,732 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 01:19:25,732 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-09 01:19:25,732 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:19:25,732 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-09 01:19:25,732 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-09 01:19:25,789 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 25 out of 60 [2025-03-09 01:19:25,790 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 78 places, 71 transitions, 286 flow. Second operand has 5 states, 5 states have (on average 27.0) internal successors, (135), 5 states have internal predecessors, (135), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:19:25,790 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 01:19:25,790 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 25 of 60 [2025-03-09 01:19:25,790 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 01:19:25,860 INFO L124 PetriNetUnfolderBase]: 225/604 cut-off events. [2025-03-09 01:19:25,860 INFO L125 PetriNetUnfolderBase]: For 422/422 co-relation queries the response was YES. [2025-03-09 01:19:25,862 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1337 conditions, 604 events. 225/604 cut-off events. For 422/422 co-relation queries the response was YES. Maximal size of possible extension queue 42. Compared 3477 event pairs, 163 based on Foata normal form. 0/502 useless extension candidates. Maximal degree in co-relation 746. Up to 404 conditions per place. [2025-03-09 01:19:25,864 INFO L140 encePairwiseOnDemand]: 53/60 looper letters, 39 selfloop transitions, 8 changer transitions 0/67 dead transitions. [2025-03-09 01:19:25,864 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 78 places, 67 transitions, 372 flow [2025-03-09 01:19:25,864 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-09 01:19:25,864 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-03-09 01:19:25,865 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 156 transitions. [2025-03-09 01:19:25,865 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.52 [2025-03-09 01:19:25,865 INFO L175 Difference]: Start difference. First operand has 78 places, 71 transitions, 286 flow. Second operand 5 states and 156 transitions. [2025-03-09 01:19:25,865 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 78 places, 67 transitions, 372 flow [2025-03-09 01:19:25,889 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 76 places, 67 transitions, 360 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-09 01:19:25,889 INFO L231 Difference]: Finished difference. Result has 76 places, 67 transitions, 282 flow [2025-03-09 01:19:25,890 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=60, PETRI_DIFFERENCE_MINUEND_FLOW=266, PETRI_DIFFERENCE_MINUEND_PLACES=72, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=67, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=59, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=282, PETRI_PLACES=76, PETRI_TRANSITIONS=67} [2025-03-09 01:19:25,890 INFO L279 CegarLoopForPetriNet]: 58 programPoint places, 18 predicate places. [2025-03-09 01:19:25,890 INFO L471 AbstractCegarLoop]: Abstraction has has 76 places, 67 transitions, 282 flow [2025-03-09 01:19:25,890 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 27.0) internal successors, (135), 5 states have internal predecessors, (135), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:19:25,890 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 01:19:25,890 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 01:19:25,890 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-09 01:19:25,890 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting thread1Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 37 more)] === [2025-03-09 01:19:25,890 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:19:25,890 INFO L85 PathProgramCache]: Analyzing trace with hash 281450149, now seen corresponding path program 1 times [2025-03-09 01:19:25,891 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:19:25,891 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1084301091] [2025-03-09 01:19:25,891 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:19:25,891 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:19:25,897 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-03-09 01:19:25,907 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-03-09 01:19:25,907 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:19:25,907 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:19:26,020 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-09 01:19:26,020 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:19:26,021 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1084301091] [2025-03-09 01:19:26,021 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1084301091] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 01:19:26,021 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [87166878] [2025-03-09 01:19:26,021 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:19:26,021 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 01:19:26,021 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 01:19:26,022 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-09 01:19:26,024 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-03-09 01:19:26,063 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-03-09 01:19:26,076 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-03-09 01:19:26,076 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:19:26,077 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:19:26,077 INFO L256 TraceCheckSpWp]: Trace formula consists of 139 conjuncts, 16 conjuncts are in the unsatisfiable core [2025-03-09 01:19:26,078 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 01:19:26,083 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2025-03-09 01:19:26,120 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-09 01:19:26,121 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2025-03-09 01:19:26,130 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-03-09 01:19:26,130 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2025-03-09 01:19:26,168 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-09 01:19:26,168 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 01:19:26,263 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 48 [2025-03-09 01:19:26,312 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-09 01:19:26,312 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [87166878] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-09 01:19:26,312 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-09 01:19:26,312 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 11 [2025-03-09 01:19:26,312 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1217465785] [2025-03-09 01:19:26,312 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-09 01:19:26,312 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-03-09 01:19:26,313 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:19:26,313 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-03-09 01:19:26,313 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=122, Unknown=0, NotChecked=0, Total=156 [2025-03-09 01:19:26,752 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 28 out of 60 [2025-03-09 01:19:26,753 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 76 places, 67 transitions, 282 flow. Second operand has 13 states, 13 states have (on average 30.0) internal successors, (390), 13 states have internal predecessors, (390), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:19:26,753 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 01:19:26,753 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 28 of 60 [2025-03-09 01:19:26,753 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 01:19:27,094 INFO L124 PetriNetUnfolderBase]: 363/889 cut-off events. [2025-03-09 01:19:27,094 INFO L125 PetriNetUnfolderBase]: For 469/469 co-relation queries the response was YES. [2025-03-09 01:19:27,095 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1916 conditions, 889 events. 363/889 cut-off events. For 469/469 co-relation queries the response was YES. Maximal size of possible extension queue 57. Compared 5201 event pairs, 115 based on Foata normal form. 0/721 useless extension candidates. Maximal degree in co-relation 1324. Up to 232 conditions per place. [2025-03-09 01:19:27,098 INFO L140 encePairwiseOnDemand]: 50/60 looper letters, 76 selfloop transitions, 17 changer transitions 0/112 dead transitions. [2025-03-09 01:19:27,098 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 83 places, 112 transitions, 600 flow [2025-03-09 01:19:27,098 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-09 01:19:27,098 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2025-03-09 01:19:27,099 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 334 transitions. [2025-03-09 01:19:27,099 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6185185185185185 [2025-03-09 01:19:27,099 INFO L175 Difference]: Start difference. First operand has 76 places, 67 transitions, 282 flow. Second operand 9 states and 334 transitions. [2025-03-09 01:19:27,099 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 83 places, 112 transitions, 600 flow [2025-03-09 01:19:27,101 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 80 places, 112 transitions, 586 flow, removed 0 selfloop flow, removed 3 redundant places. [2025-03-09 01:19:27,102 INFO L231 Difference]: Finished difference. Result has 82 places, 70 transitions, 331 flow [2025-03-09 01:19:27,102 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=60, PETRI_DIFFERENCE_MINUEND_FLOW=268, PETRI_DIFFERENCE_MINUEND_PLACES=72, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=66, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=52, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=331, PETRI_PLACES=82, PETRI_TRANSITIONS=70} [2025-03-09 01:19:27,102 INFO L279 CegarLoopForPetriNet]: 58 programPoint places, 24 predicate places. [2025-03-09 01:19:27,102 INFO L471 AbstractCegarLoop]: Abstraction has has 82 places, 70 transitions, 331 flow [2025-03-09 01:19:27,104 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 30.0) internal successors, (390), 13 states have internal predecessors, (390), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:19:27,104 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 01:19:27,104 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 01:19:27,110 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-03-09 01:19:27,308 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 01:19:27,308 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting thread1Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 37 more)] === [2025-03-09 01:19:27,308 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:19:27,308 INFO L85 PathProgramCache]: Analyzing trace with hash 135020528, now seen corresponding path program 1 times [2025-03-09 01:19:27,308 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:19:27,308 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1293468493] [2025-03-09 01:19:27,308 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:19:27,308 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:19:27,316 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-03-09 01:19:27,320 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-03-09 01:19:27,320 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:19:27,320 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:19:27,354 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-03-09 01:19:27,354 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:19:27,354 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1293468493] [2025-03-09 01:19:27,354 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1293468493] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 01:19:27,354 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 01:19:27,354 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-09 01:19:27,354 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [467205655] [2025-03-09 01:19:27,354 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 01:19:27,354 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-09 01:19:27,355 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:19:27,355 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-09 01:19:27,355 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-09 01:19:27,382 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 25 out of 60 [2025-03-09 01:19:27,382 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 82 places, 70 transitions, 331 flow. Second operand has 4 states, 4 states have (on average 27.5) internal successors, (110), 4 states have internal predecessors, (110), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:19:27,383 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 01:19:27,383 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 25 of 60 [2025-03-09 01:19:27,383 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 01:19:27,477 INFO L124 PetriNetUnfolderBase]: 393/942 cut-off events. [2025-03-09 01:19:27,477 INFO L125 PetriNetUnfolderBase]: For 716/716 co-relation queries the response was YES. [2025-03-09 01:19:27,479 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2145 conditions, 942 events. 393/942 cut-off events. For 716/716 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 5400 event pairs, 301 based on Foata normal form. 0/894 useless extension candidates. Maximal degree in co-relation 1526. Up to 686 conditions per place. [2025-03-09 01:19:27,482 INFO L140 encePairwiseOnDemand]: 54/60 looper letters, 43 selfloop transitions, 7 changer transitions 0/66 dead transitions. [2025-03-09 01:19:27,482 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 81 places, 66 transitions, 423 flow [2025-03-09 01:19:27,485 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-09 01:19:27,486 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-09 01:19:27,486 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 131 transitions. [2025-03-09 01:19:27,486 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5458333333333333 [2025-03-09 01:19:27,486 INFO L175 Difference]: Start difference. First operand has 82 places, 70 transitions, 331 flow. Second operand 4 states and 131 transitions. [2025-03-09 01:19:27,486 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 81 places, 66 transitions, 423 flow [2025-03-09 01:19:27,488 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 76 places, 66 transitions, 393 flow, removed 4 selfloop flow, removed 5 redundant places. [2025-03-09 01:19:27,489 INFO L231 Difference]: Finished difference. Result has 76 places, 66 transitions, 307 flow [2025-03-09 01:19:27,489 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=60, PETRI_DIFFERENCE_MINUEND_FLOW=293, PETRI_DIFFERENCE_MINUEND_PLACES=73, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=66, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=59, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=307, PETRI_PLACES=76, PETRI_TRANSITIONS=66} [2025-03-09 01:19:27,489 INFO L279 CegarLoopForPetriNet]: 58 programPoint places, 18 predicate places. [2025-03-09 01:19:27,489 INFO L471 AbstractCegarLoop]: Abstraction has has 76 places, 66 transitions, 307 flow [2025-03-09 01:19:27,489 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 27.5) internal successors, (110), 4 states have internal predecessors, (110), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:19:27,489 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 01:19:27,489 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 01:19:27,489 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-09 01:19:27,489 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting thread1Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 37 more)] === [2025-03-09 01:19:27,491 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:19:27,491 INFO L85 PathProgramCache]: Analyzing trace with hash 135020529, now seen corresponding path program 1 times [2025-03-09 01:19:27,491 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:19:27,491 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1147853461] [2025-03-09 01:19:27,491 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:19:27,491 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:19:27,496 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-03-09 01:19:27,501 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-03-09 01:19:27,501 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:19:27,501 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:19:27,600 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-03-09 01:19:27,600 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:19:27,601 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1147853461] [2025-03-09 01:19:27,601 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1147853461] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 01:19:27,601 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [548461336] [2025-03-09 01:19:27,601 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:19:27,601 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 01:19:27,601 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 01:19:27,603 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-09 01:19:27,604 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-03-09 01:19:27,639 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-03-09 01:19:27,651 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-03-09 01:19:27,651 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:19:27,651 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:19:27,652 INFO L256 TraceCheckSpWp]: Trace formula consists of 145 conjuncts, 14 conjuncts are in the unsatisfiable core [2025-03-09 01:19:27,653 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 01:19:27,709 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-03-09 01:19:27,709 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 01:19:27,743 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 18 [2025-03-09 01:19:27,751 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-03-09 01:19:27,751 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [548461336] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-09 01:19:27,751 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-09 01:19:27,751 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 10 [2025-03-09 01:19:27,751 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [935565539] [2025-03-09 01:19:27,751 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-09 01:19:27,751 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-09 01:19:27,752 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:19:27,752 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-09 01:19:27,752 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=82, Unknown=0, NotChecked=0, Total=110 [2025-03-09 01:19:28,021 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 31 out of 60 [2025-03-09 01:19:28,022 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 76 places, 66 transitions, 307 flow. Second operand has 11 states, 11 states have (on average 32.72727272727273) internal successors, (360), 11 states have internal predecessors, (360), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:19:28,022 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 01:19:28,022 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 31 of 60 [2025-03-09 01:19:28,022 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 01:19:28,232 INFO L124 PetriNetUnfolderBase]: 325/759 cut-off events. [2025-03-09 01:19:28,233 INFO L125 PetriNetUnfolderBase]: For 558/558 co-relation queries the response was YES. [2025-03-09 01:19:28,234 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1781 conditions, 759 events. 325/759 cut-off events. For 558/558 co-relation queries the response was YES. Maximal size of possible extension queue 42. Compared 4078 event pairs, 107 based on Foata normal form. 0/686 useless extension candidates. Maximal degree in co-relation 1173. Up to 201 conditions per place. [2025-03-09 01:19:28,236 INFO L140 encePairwiseOnDemand]: 50/60 looper letters, 69 selfloop transitions, 17 changer transitions 0/102 dead transitions. [2025-03-09 01:19:28,236 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 81 places, 102 transitions, 575 flow [2025-03-09 01:19:28,237 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-09 01:19:28,237 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-03-09 01:19:28,237 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 291 transitions. [2025-03-09 01:19:28,237 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6928571428571428 [2025-03-09 01:19:28,237 INFO L175 Difference]: Start difference. First operand has 76 places, 66 transitions, 307 flow. Second operand 7 states and 291 transitions. [2025-03-09 01:19:28,237 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 81 places, 102 transitions, 575 flow [2025-03-09 01:19:28,239 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 79 places, 102 transitions, 567 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-09 01:19:28,240 INFO L231 Difference]: Finished difference. Result has 81 places, 66 transitions, 349 flow [2025-03-09 01:19:28,240 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=60, PETRI_DIFFERENCE_MINUEND_FLOW=297, PETRI_DIFFERENCE_MINUEND_PLACES=73, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=65, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=16, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=48, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=349, PETRI_PLACES=81, PETRI_TRANSITIONS=66} [2025-03-09 01:19:28,241 INFO L279 CegarLoopForPetriNet]: 58 programPoint places, 23 predicate places. [2025-03-09 01:19:28,241 INFO L471 AbstractCegarLoop]: Abstraction has has 81 places, 66 transitions, 349 flow [2025-03-09 01:19:28,241 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 32.72727272727273) internal successors, (360), 11 states have internal predecessors, (360), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:19:28,241 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 01:19:28,241 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 01:19:28,248 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2025-03-09 01:19:28,442 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 01:19:28,442 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting thread2Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 37 more)] === [2025-03-09 01:19:28,443 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:19:28,443 INFO L85 PathProgramCache]: Analyzing trace with hash -114648183, now seen corresponding path program 1 times [2025-03-09 01:19:28,443 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:19:28,443 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1120561419] [2025-03-09 01:19:28,443 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:19:28,443 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:19:28,448 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-03-09 01:19:28,455 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-03-09 01:19:28,458 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:19:28,458 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:19:28,598 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-09 01:19:28,598 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:19:28,598 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1120561419] [2025-03-09 01:19:28,599 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1120561419] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 01:19:28,599 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [515450213] [2025-03-09 01:19:28,599 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:19:28,599 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 01:19:28,599 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 01:19:28,601 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-09 01:19:28,603 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-03-09 01:19:28,641 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-03-09 01:19:28,654 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-03-09 01:19:28,654 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:19:28,654 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:19:28,656 INFO L256 TraceCheckSpWp]: Trace formula consists of 155 conjuncts, 17 conjuncts are in the unsatisfiable core [2025-03-09 01:19:28,657 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 01:19:28,662 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2025-03-09 01:19:28,666 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2025-03-09 01:19:28,696 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-09 01:19:28,697 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2025-03-09 01:19:28,702 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-03-09 01:19:28,703 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2025-03-09 01:19:28,745 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-09 01:19:28,745 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 01:19:28,867 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-09 01:19:28,868 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [515450213] provided 1 perfect and 1 imperfect interpolant sequences [2025-03-09 01:19:28,868 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-03-09 01:19:28,868 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4, 4] total 11 [2025-03-09 01:19:28,868 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1615365527] [2025-03-09 01:19:28,868 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 01:19:28,868 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-09 01:19:28,868 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:19:28,869 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-09 01:19:28,869 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=119, Unknown=0, NotChecked=0, Total=156 [2025-03-09 01:19:29,110 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 31 out of 60 [2025-03-09 01:19:29,111 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 81 places, 66 transitions, 349 flow. Second operand has 6 states, 6 states have (on average 33.0) internal successors, (198), 6 states have internal predecessors, (198), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:19:29,111 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 01:19:29,111 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 31 of 60 [2025-03-09 01:19:29,111 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 01:19:29,376 INFO L124 PetriNetUnfolderBase]: 396/960 cut-off events. [2025-03-09 01:19:29,376 INFO L125 PetriNetUnfolderBase]: For 1095/1115 co-relation queries the response was YES. [2025-03-09 01:19:29,378 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2307 conditions, 960 events. 396/960 cut-off events. For 1095/1115 co-relation queries the response was YES. Maximal size of possible extension queue 58. Compared 5685 event pairs, 171 based on Foata normal form. 0/860 useless extension candidates. Maximal degree in co-relation 1668. Up to 319 conditions per place. [2025-03-09 01:19:29,380 INFO L140 encePairwiseOnDemand]: 50/60 looper letters, 60 selfloop transitions, 16 changer transitions 0/92 dead transitions. [2025-03-09 01:19:29,380 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 87 places, 92 transitions, 601 flow [2025-03-09 01:19:29,381 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-09 01:19:29,381 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2025-03-09 01:19:29,381 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 310 transitions. [2025-03-09 01:19:29,381 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6458333333333334 [2025-03-09 01:19:29,381 INFO L175 Difference]: Start difference. First operand has 81 places, 66 transitions, 349 flow. Second operand 8 states and 310 transitions. [2025-03-09 01:19:29,381 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 87 places, 92 transitions, 601 flow [2025-03-09 01:19:29,384 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 82 places, 92 transitions, 567 flow, removed 3 selfloop flow, removed 5 redundant places. [2025-03-09 01:19:29,385 INFO L231 Difference]: Finished difference. Result has 84 places, 66 transitions, 366 flow [2025-03-09 01:19:29,385 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=60, PETRI_DIFFERENCE_MINUEND_FLOW=317, PETRI_DIFFERENCE_MINUEND_PLACES=75, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=65, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=49, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=366, PETRI_PLACES=84, PETRI_TRANSITIONS=66} [2025-03-09 01:19:29,386 INFO L279 CegarLoopForPetriNet]: 58 programPoint places, 26 predicate places. [2025-03-09 01:19:29,386 INFO L471 AbstractCegarLoop]: Abstraction has has 84 places, 66 transitions, 366 flow [2025-03-09 01:19:29,386 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 33.0) internal successors, (198), 6 states have internal predecessors, (198), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:19:29,386 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 01:19:29,386 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 01:19:29,392 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2025-03-09 01:19:29,587 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2025-03-09 01:19:29,587 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting thread2Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 37 more)] === [2025-03-09 01:19:29,587 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:19:29,587 INFO L85 PathProgramCache]: Analyzing trace with hash 740874143, now seen corresponding path program 1 times [2025-03-09 01:19:29,587 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:19:29,587 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2029294592] [2025-03-09 01:19:29,587 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:19:29,587 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:19:29,592 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-03-09 01:19:29,596 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-03-09 01:19:29,596 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:19:29,596 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:19:29,692 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-03-09 01:19:29,692 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:19:29,692 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2029294592] [2025-03-09 01:19:29,692 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2029294592] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 01:19:29,693 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1655571587] [2025-03-09 01:19:29,693 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:19:29,693 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 01:19:29,693 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 01:19:29,694 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-09 01:19:29,696 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-03-09 01:19:29,736 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-03-09 01:19:29,749 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-03-09 01:19:29,749 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:19:29,749 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:19:29,750 INFO L256 TraceCheckSpWp]: Trace formula consists of 161 conjuncts, 14 conjuncts are in the unsatisfiable core [2025-03-09 01:19:29,751 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 01:19:29,805 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-03-09 01:19:29,805 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 01:19:29,840 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 18 [2025-03-09 01:19:29,845 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-03-09 01:19:29,846 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1655571587] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-09 01:19:29,846 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-09 01:19:29,846 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 10 [2025-03-09 01:19:29,846 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2113981723] [2025-03-09 01:19:29,846 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-09 01:19:29,846 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-09 01:19:29,846 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:19:29,847 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-09 01:19:29,847 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=82, Unknown=0, NotChecked=0, Total=110 [2025-03-09 01:19:30,107 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 30 out of 60 [2025-03-09 01:19:30,108 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 84 places, 66 transitions, 366 flow. Second operand has 11 states, 11 states have (on average 32.09090909090909) internal successors, (353), 11 states have internal predecessors, (353), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:19:30,108 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 01:19:30,108 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 30 of 60 [2025-03-09 01:19:30,108 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 01:19:30,363 INFO L124 PetriNetUnfolderBase]: 606/1280 cut-off events. [2025-03-09 01:19:30,363 INFO L125 PetriNetUnfolderBase]: For 1533/1579 co-relation queries the response was YES. [2025-03-09 01:19:30,365 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3279 conditions, 1280 events. 606/1280 cut-off events. For 1533/1579 co-relation queries the response was YES. Maximal size of possible extension queue 71. Compared 7484 event pairs, 170 based on Foata normal form. 0/1236 useless extension candidates. Maximal degree in co-relation 2646. Up to 353 conditions per place. [2025-03-09 01:19:30,368 INFO L140 encePairwiseOnDemand]: 50/60 looper letters, 70 selfloop transitions, 17 changer transitions 0/102 dead transitions. [2025-03-09 01:19:30,368 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 89 places, 102 transitions, 673 flow [2025-03-09 01:19:30,369 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-09 01:19:30,369 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-03-09 01:19:30,369 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 282 transitions. [2025-03-09 01:19:30,369 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6714285714285714 [2025-03-09 01:19:30,369 INFO L175 Difference]: Start difference. First operand has 84 places, 66 transitions, 366 flow. Second operand 7 states and 282 transitions. [2025-03-09 01:19:30,370 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 89 places, 102 transitions, 673 flow [2025-03-09 01:19:30,371 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 82 places, 102 transitions, 639 flow, removed 2 selfloop flow, removed 7 redundant places. [2025-03-09 01:19:30,372 INFO L231 Difference]: Finished difference. Result has 84 places, 67 transitions, 388 flow [2025-03-09 01:19:30,372 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=60, PETRI_DIFFERENCE_MINUEND_FLOW=331, PETRI_DIFFERENCE_MINUEND_PLACES=76, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=65, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=49, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=388, PETRI_PLACES=84, PETRI_TRANSITIONS=67} [2025-03-09 01:19:30,373 INFO L279 CegarLoopForPetriNet]: 58 programPoint places, 26 predicate places. [2025-03-09 01:19:30,373 INFO L471 AbstractCegarLoop]: Abstraction has has 84 places, 67 transitions, 388 flow [2025-03-09 01:19:30,373 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 32.09090909090909) internal successors, (353), 11 states have internal predecessors, (353), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:19:30,373 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 01:19:30,373 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 01:19:30,379 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2025-03-09 01:19:30,574 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2025-03-09 01:19:30,574 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting thread1Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 37 more)] === [2025-03-09 01:19:30,574 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:19:30,574 INFO L85 PathProgramCache]: Analyzing trace with hash -1987274773, now seen corresponding path program 1 times [2025-03-09 01:19:30,574 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:19:30,574 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [711094263] [2025-03-09 01:19:30,574 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:19:30,574 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:19:30,579 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-03-09 01:19:30,586 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-03-09 01:19:30,586 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:19:30,586 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:19:30,646 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-03-09 01:19:30,647 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:19:30,647 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [711094263] [2025-03-09 01:19:30,647 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [711094263] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 01:19:30,647 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1521959534] [2025-03-09 01:19:30,647 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:19:30,647 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 01:19:30,647 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 01:19:30,648 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-09 01:19:30,650 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2025-03-09 01:19:30,691 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-03-09 01:19:30,704 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-03-09 01:19:30,704 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:19:30,704 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:19:30,705 INFO L256 TraceCheckSpWp]: Trace formula consists of 157 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-03-09 01:19:30,705 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 01:19:30,762 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 5 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-09 01:19:30,762 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 01:19:30,819 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 5 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-09 01:19:30,819 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1521959534] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-09 01:19:30,819 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-09 01:19:30,819 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6, 6] total 16 [2025-03-09 01:19:30,819 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1405790805] [2025-03-09 01:19:30,819 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-09 01:19:30,820 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2025-03-09 01:19:30,820 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:19:30,820 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2025-03-09 01:19:30,820 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=191, Unknown=0, NotChecked=0, Total=240 [2025-03-09 01:19:31,012 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 33 out of 60 [2025-03-09 01:19:31,013 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 84 places, 67 transitions, 388 flow. Second operand has 16 states, 16 states have (on average 35.0) internal successors, (560), 16 states have internal predecessors, (560), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:19:31,013 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 01:19:31,013 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 33 of 60 [2025-03-09 01:19:31,013 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 01:19:31,495 INFO L124 PetriNetUnfolderBase]: 1350/3036 cut-off events. [2025-03-09 01:19:31,495 INFO L125 PetriNetUnfolderBase]: For 4268/4356 co-relation queries the response was YES. [2025-03-09 01:19:31,499 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7954 conditions, 3036 events. 1350/3036 cut-off events. For 4268/4356 co-relation queries the response was YES. Maximal size of possible extension queue 169. Compared 22815 event pairs, 430 based on Foata normal form. 66/2953 useless extension candidates. Maximal degree in co-relation 2901. Up to 741 conditions per place. [2025-03-09 01:19:31,507 INFO L140 encePairwiseOnDemand]: 50/60 looper letters, 156 selfloop transitions, 35 changer transitions 0/209 dead transitions. [2025-03-09 01:19:31,507 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 104 places, 209 transitions, 1465 flow [2025-03-09 01:19:31,507 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2025-03-09 01:19:31,507 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2025-03-09 01:19:31,508 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 858 transitions. [2025-03-09 01:19:31,509 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.680952380952381 [2025-03-09 01:19:31,509 INFO L175 Difference]: Start difference. First operand has 84 places, 67 transitions, 388 flow. Second operand 21 states and 858 transitions. [2025-03-09 01:19:31,509 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 104 places, 209 transitions, 1465 flow [2025-03-09 01:19:31,513 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 100 places, 209 transitions, 1402 flow, removed 14 selfloop flow, removed 4 redundant places. [2025-03-09 01:19:31,514 INFO L231 Difference]: Finished difference. Result has 106 places, 84 transitions, 602 flow [2025-03-09 01:19:31,514 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=60, PETRI_DIFFERENCE_MINUEND_FLOW=360, PETRI_DIFFERENCE_MINUEND_PLACES=80, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=67, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=21, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=43, PETRI_DIFFERENCE_SUBTRAHEND_STATES=21, PETRI_FLOW=602, PETRI_PLACES=106, PETRI_TRANSITIONS=84} [2025-03-09 01:19:31,514 INFO L279 CegarLoopForPetriNet]: 58 programPoint places, 48 predicate places. [2025-03-09 01:19:31,515 INFO L471 AbstractCegarLoop]: Abstraction has has 106 places, 84 transitions, 602 flow [2025-03-09 01:19:31,515 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 35.0) internal successors, (560), 16 states have internal predecessors, (560), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:19:31,515 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 01:19:31,515 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 01:19:31,521 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-09 01:19:31,715 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 01:19:31,715 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting thread2Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 37 more)] === [2025-03-09 01:19:31,716 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:19:31,716 INFO L85 PathProgramCache]: Analyzing trace with hash -454820017, now seen corresponding path program 1 times [2025-03-09 01:19:31,716 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:19:31,716 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [102369057] [2025-03-09 01:19:31,716 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:19:31,716 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:19:31,720 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-03-09 01:19:31,724 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-03-09 01:19:31,724 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:19:31,724 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:19:31,774 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-03-09 01:19:31,774 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:19:31,774 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [102369057] [2025-03-09 01:19:31,774 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [102369057] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 01:19:31,774 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1109505062] [2025-03-09 01:19:31,774 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:19:31,774 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 01:19:31,774 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 01:19:31,776 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-09 01:19:31,777 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2025-03-09 01:19:31,818 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-03-09 01:19:31,832 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-03-09 01:19:31,832 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:19:31,832 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:19:31,833 INFO L256 TraceCheckSpWp]: Trace formula consists of 173 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-03-09 01:19:31,834 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 01:19:31,889 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 5 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-09 01:19:31,889 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 01:19:31,939 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 5 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-09 01:19:31,940 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1109505062] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-09 01:19:31,940 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-09 01:19:31,940 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6, 6] total 16 [2025-03-09 01:19:31,940 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [503877719] [2025-03-09 01:19:31,940 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-09 01:19:31,940 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2025-03-09 01:19:31,940 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:19:31,940 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2025-03-09 01:19:31,940 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=191, Unknown=0, NotChecked=0, Total=240 [2025-03-09 01:19:32,120 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 33 out of 60 [2025-03-09 01:19:32,120 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 106 places, 84 transitions, 602 flow. Second operand has 16 states, 16 states have (on average 35.25) internal successors, (564), 16 states have internal predecessors, (564), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:19:32,120 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 01:19:32,120 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 33 of 60 [2025-03-09 01:19:32,120 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 01:19:32,515 INFO L124 PetriNetUnfolderBase]: 1081/2516 cut-off events. [2025-03-09 01:19:32,515 INFO L125 PetriNetUnfolderBase]: For 4650/4760 co-relation queries the response was YES. [2025-03-09 01:19:32,520 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6760 conditions, 2516 events. 1081/2516 cut-off events. For 4650/4760 co-relation queries the response was YES. Maximal size of possible extension queue 143. Compared 18240 event pairs, 441 based on Foata normal form. 48/2511 useless extension candidates. Maximal degree in co-relation 6712. Up to 754 conditions per place. [2025-03-09 01:19:32,528 INFO L140 encePairwiseOnDemand]: 50/60 looper letters, 138 selfloop transitions, 35 changer transitions 0/191 dead transitions. [2025-03-09 01:19:32,528 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 126 places, 191 transitions, 1433 flow [2025-03-09 01:19:32,530 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2025-03-09 01:19:32,530 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2025-03-09 01:19:32,531 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 849 transitions. [2025-03-09 01:19:32,531 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6738095238095239 [2025-03-09 01:19:32,531 INFO L175 Difference]: Start difference. First operand has 106 places, 84 transitions, 602 flow. Second operand 21 states and 849 transitions. [2025-03-09 01:19:32,531 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 126 places, 191 transitions, 1433 flow [2025-03-09 01:19:32,560 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 125 places, 191 transitions, 1430 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-09 01:19:32,561 INFO L231 Difference]: Finished difference. Result has 128 places, 92 transitions, 753 flow [2025-03-09 01:19:32,561 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=60, PETRI_DIFFERENCE_MINUEND_FLOW=599, PETRI_DIFFERENCE_MINUEND_PLACES=105, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=84, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=29, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=55, PETRI_DIFFERENCE_SUBTRAHEND_STATES=21, PETRI_FLOW=753, PETRI_PLACES=128, PETRI_TRANSITIONS=92} [2025-03-09 01:19:32,562 INFO L279 CegarLoopForPetriNet]: 58 programPoint places, 70 predicate places. [2025-03-09 01:19:32,562 INFO L471 AbstractCegarLoop]: Abstraction has has 128 places, 92 transitions, 753 flow [2025-03-09 01:19:32,562 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 35.25) internal successors, (564), 16 states have internal predecessors, (564), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:19:32,562 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 01:19:32,562 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 01:19:32,568 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2025-03-09 01:19:32,762 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,SelfDestructingSolverStorable16 [2025-03-09 01:19:32,763 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 37 more)] === [2025-03-09 01:19:32,763 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:19:32,763 INFO L85 PathProgramCache]: Analyzing trace with hash -1636922748, now seen corresponding path program 1 times [2025-03-09 01:19:32,763 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:19:32,763 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1855837978] [2025-03-09 01:19:32,763 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:19:32,763 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:19:32,767 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-03-09 01:19:32,771 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-03-09 01:19:32,771 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:19:32,771 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:19:32,868 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 01:19:32,868 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:19:32,868 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1855837978] [2025-03-09 01:19:32,868 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1855837978] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 01:19:32,868 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 01:19:32,868 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-09 01:19:32,868 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [630336286] [2025-03-09 01:19:32,868 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 01:19:32,869 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-09 01:19:32,869 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:19:32,869 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-09 01:19:32,870 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-03-09 01:19:32,905 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 34 out of 60 [2025-03-09 01:19:32,906 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 128 places, 92 transitions, 753 flow. Second operand has 7 states, 7 states have (on average 36.0) internal successors, (252), 7 states have internal predecessors, (252), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:19:32,906 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 01:19:32,906 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 34 of 60 [2025-03-09 01:19:32,906 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 01:19:33,129 INFO L124 PetriNetUnfolderBase]: 926/2381 cut-off events. [2025-03-09 01:19:33,129 INFO L125 PetriNetUnfolderBase]: For 5811/5889 co-relation queries the response was YES. [2025-03-09 01:19:33,134 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6707 conditions, 2381 events. 926/2381 cut-off events. For 5811/5889 co-relation queries the response was YES. Maximal size of possible extension queue 144. Compared 17992 event pairs, 370 based on Foata normal form. 1/2309 useless extension candidates. Maximal degree in co-relation 6651. Up to 1578 conditions per place. [2025-03-09 01:19:33,141 INFO L140 encePairwiseOnDemand]: 52/60 looper letters, 69 selfloop transitions, 20 changer transitions 11/119 dead transitions. [2025-03-09 01:19:33,141 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 133 places, 119 transitions, 1158 flow [2025-03-09 01:19:33,141 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-09 01:19:33,141 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-09 01:19:33,142 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 250 transitions. [2025-03-09 01:19:33,142 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6944444444444444 [2025-03-09 01:19:33,142 INFO L175 Difference]: Start difference. First operand has 128 places, 92 transitions, 753 flow. Second operand 6 states and 250 transitions. [2025-03-09 01:19:33,142 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 133 places, 119 transitions, 1158 flow [2025-03-09 01:19:33,148 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 123 places, 119 transitions, 1125 flow, removed 0 selfloop flow, removed 10 redundant places. [2025-03-09 01:19:33,149 INFO L231 Difference]: Finished difference. Result has 125 places, 105 transitions, 956 flow [2025-03-09 01:19:33,150 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=60, PETRI_DIFFERENCE_MINUEND_FLOW=720, PETRI_DIFFERENCE_MINUEND_PLACES=118, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=92, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=72, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=956, PETRI_PLACES=125, PETRI_TRANSITIONS=105} [2025-03-09 01:19:33,150 INFO L279 CegarLoopForPetriNet]: 58 programPoint places, 67 predicate places. [2025-03-09 01:19:33,150 INFO L471 AbstractCegarLoop]: Abstraction has has 125 places, 105 transitions, 956 flow [2025-03-09 01:19:33,150 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 36.0) internal successors, (252), 7 states have internal predecessors, (252), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:19:33,150 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 01:19:33,150 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 01:19:33,150 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-03-09 01:19:33,150 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 37 more)] === [2025-03-09 01:19:33,151 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:19:33,151 INFO L85 PathProgramCache]: Analyzing trace with hash 897945308, now seen corresponding path program 1 times [2025-03-09 01:19:33,151 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:19:33,151 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [603186208] [2025-03-09 01:19:33,151 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:19:33,151 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:19:33,155 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-03-09 01:19:33,158 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-03-09 01:19:33,158 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:19:33,158 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:19:33,235 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-09 01:19:33,235 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:19:33,235 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [603186208] [2025-03-09 01:19:33,235 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [603186208] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 01:19:33,235 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1295266086] [2025-03-09 01:19:33,235 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:19:33,235 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 01:19:33,235 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 01:19:33,237 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-09 01:19:33,238 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2025-03-09 01:19:33,276 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-03-09 01:19:33,289 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-03-09 01:19:33,289 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:19:33,289 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:19:33,289 INFO L256 TraceCheckSpWp]: Trace formula consists of 172 conjuncts, 11 conjuncts are in the unsatisfiable core [2025-03-09 01:19:33,290 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 01:19:33,377 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-09 01:19:33,377 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 01:19:33,437 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 01:19:33,437 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1295266086] provided 1 perfect and 1 imperfect interpolant sequences [2025-03-09 01:19:33,437 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-03-09 01:19:33,437 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [7, 6] total 13 [2025-03-09 01:19:33,437 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1945159810] [2025-03-09 01:19:33,438 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 01:19:33,438 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-09 01:19:33,438 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:19:33,438 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-09 01:19:33,438 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=138, Unknown=0, NotChecked=0, Total=182 [2025-03-09 01:19:33,468 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 34 out of 60 [2025-03-09 01:19:33,469 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 125 places, 105 transitions, 956 flow. Second operand has 7 states, 7 states have (on average 36.285714285714285) internal successors, (254), 7 states have internal predecessors, (254), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:19:33,469 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 01:19:33,469 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 34 of 60 [2025-03-09 01:19:33,469 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 01:19:33,736 INFO L124 PetriNetUnfolderBase]: 914/2361 cut-off events. [2025-03-09 01:19:33,736 INFO L125 PetriNetUnfolderBase]: For 6511/6589 co-relation queries the response was YES. [2025-03-09 01:19:33,741 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6862 conditions, 2361 events. 914/2361 cut-off events. For 6511/6589 co-relation queries the response was YES. Maximal size of possible extension queue 140. Compared 17965 event pairs, 622 based on Foata normal form. 2/2291 useless extension candidates. Maximal degree in co-relation 6805. Up to 1525 conditions per place. [2025-03-09 01:19:33,746 INFO L140 encePairwiseOnDemand]: 51/60 looper letters, 70 selfloop transitions, 27 changer transitions 11/127 dead transitions. [2025-03-09 01:19:33,746 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 131 places, 127 transitions, 1242 flow [2025-03-09 01:19:33,751 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-09 01:19:33,751 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2025-03-09 01:19:33,751 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 324 transitions. [2025-03-09 01:19:33,751 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.675 [2025-03-09 01:19:33,751 INFO L175 Difference]: Start difference. First operand has 125 places, 105 transitions, 956 flow. Second operand 8 states and 324 transitions. [2025-03-09 01:19:33,751 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 131 places, 127 transitions, 1242 flow [2025-03-09 01:19:33,758 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 127 places, 127 transitions, 1216 flow, removed 2 selfloop flow, removed 4 redundant places. [2025-03-09 01:19:33,760 INFO L231 Difference]: Finished difference. Result has 128 places, 105 transitions, 961 flow [2025-03-09 01:19:33,760 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=60, PETRI_DIFFERENCE_MINUEND_FLOW=932, PETRI_DIFFERENCE_MINUEND_PLACES=120, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=105, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=23, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=82, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=961, PETRI_PLACES=128, PETRI_TRANSITIONS=105} [2025-03-09 01:19:33,761 INFO L279 CegarLoopForPetriNet]: 58 programPoint places, 70 predicate places. [2025-03-09 01:19:33,761 INFO L471 AbstractCegarLoop]: Abstraction has has 128 places, 105 transitions, 961 flow [2025-03-09 01:19:33,761 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 36.285714285714285) internal successors, (254), 7 states have internal predecessors, (254), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:19:33,761 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 01:19:33,761 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 01:19:33,769 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2025-03-09 01:19:33,961 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 01:19:33,962 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 37 more)] === [2025-03-09 01:19:33,962 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:19:33,962 INFO L85 PathProgramCache]: Analyzing trace with hash 130459416, now seen corresponding path program 1 times [2025-03-09 01:19:33,962 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:19:33,962 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1527886180] [2025-03-09 01:19:33,962 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:19:33,962 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:19:33,966 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-03-09 01:19:33,971 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-03-09 01:19:33,971 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:19:33,971 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:19:34,051 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 01:19:34,051 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:19:34,051 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1527886180] [2025-03-09 01:19:34,051 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1527886180] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 01:19:34,051 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1817071520] [2025-03-09 01:19:34,051 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:19:34,051 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 01:19:34,051 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 01:19:34,055 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-09 01:19:34,055 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2025-03-09 01:19:34,093 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-03-09 01:19:34,106 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-03-09 01:19:34,106 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:19:34,106 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:19:34,107 INFO L256 TraceCheckSpWp]: Trace formula consists of 172 conjuncts, 12 conjuncts are in the unsatisfiable core [2025-03-09 01:19:34,108 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 01:19:34,203 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-09 01:19:34,203 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 01:19:34,264 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-09 01:19:34,264 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1817071520] provided 1 perfect and 1 imperfect interpolant sequences [2025-03-09 01:19:34,264 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-03-09 01:19:34,264 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [8, 7] total 15 [2025-03-09 01:19:34,264 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1689727858] [2025-03-09 01:19:34,264 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 01:19:34,264 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-09 01:19:34,264 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:19:34,265 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-09 01:19:34,265 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=187, Unknown=0, NotChecked=0, Total=240 [2025-03-09 01:19:34,302 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 34 out of 60 [2025-03-09 01:19:34,302 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 128 places, 105 transitions, 961 flow. Second operand has 8 states, 8 states have (on average 36.0) internal successors, (288), 8 states have internal predecessors, (288), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:19:34,302 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 01:19:34,302 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 34 of 60 [2025-03-09 01:19:34,302 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 01:19:34,545 INFO L124 PetriNetUnfolderBase]: 898/2276 cut-off events. [2025-03-09 01:19:34,545 INFO L125 PetriNetUnfolderBase]: For 6264/6354 co-relation queries the response was YES. [2025-03-09 01:19:34,549 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6604 conditions, 2276 events. 898/2276 cut-off events. For 6264/6354 co-relation queries the response was YES. Maximal size of possible extension queue 144. Compared 17185 event pairs, 613 based on Foata normal form. 2/2191 useless extension candidates. Maximal degree in co-relation 6541. Up to 1433 conditions per place. [2025-03-09 01:19:34,552 INFO L140 encePairwiseOnDemand]: 50/60 looper letters, 72 selfloop transitions, 30 changer transitions 11/132 dead transitions. [2025-03-09 01:19:34,552 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 135 places, 132 transitions, 1256 flow [2025-03-09 01:19:34,553 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-09 01:19:34,553 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2025-03-09 01:19:34,553 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 370 transitions. [2025-03-09 01:19:34,553 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6851851851851852 [2025-03-09 01:19:34,553 INFO L175 Difference]: Start difference. First operand has 128 places, 105 transitions, 961 flow. Second operand 9 states and 370 transitions. [2025-03-09 01:19:34,553 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 135 places, 132 transitions, 1256 flow [2025-03-09 01:19:34,559 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 132 places, 132 transitions, 1230 flow, removed 7 selfloop flow, removed 3 redundant places. [2025-03-09 01:19:34,560 INFO L231 Difference]: Finished difference. Result has 133 places, 101 transitions, 951 flow [2025-03-09 01:19:34,561 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=60, PETRI_DIFFERENCE_MINUEND_FLOW=939, PETRI_DIFFERENCE_MINUEND_PLACES=124, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=105, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=30, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=951, PETRI_PLACES=133, PETRI_TRANSITIONS=101} [2025-03-09 01:19:34,561 INFO L279 CegarLoopForPetriNet]: 58 programPoint places, 75 predicate places. [2025-03-09 01:19:34,561 INFO L471 AbstractCegarLoop]: Abstraction has has 133 places, 101 transitions, 951 flow [2025-03-09 01:19:34,561 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 36.0) internal successors, (288), 8 states have internal predecessors, (288), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:19:34,561 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 01:19:34,561 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 01:19:34,568 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Ended with exit code 0 [2025-03-09 01:19:34,765 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 01:19:34,766 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting thread1Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 37 more)] === [2025-03-09 01:19:34,766 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:19:34,766 INFO L85 PathProgramCache]: Analyzing trace with hash 1923395113, now seen corresponding path program 2 times [2025-03-09 01:19:34,766 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:19:34,766 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1889489842] [2025-03-09 01:19:34,766 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-09 01:19:34,766 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:19:34,772 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 19 statements into 2 equivalence classes. [2025-03-09 01:19:34,781 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 19 of 19 statements. [2025-03-09 01:19:34,781 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-09 01:19:34,781 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:19:34,975 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 5 proven. 14 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-09 01:19:34,975 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:19:34,976 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1889489842] [2025-03-09 01:19:34,976 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1889489842] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 01:19:34,976 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2135649594] [2025-03-09 01:19:34,976 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-09 01:19:34,976 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 01:19:34,976 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 01:19:34,978 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-09 01:19:34,979 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2025-03-09 01:19:35,022 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 19 statements into 2 equivalence classes. [2025-03-09 01:19:35,041 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 19 of 19 statements. [2025-03-09 01:19:35,041 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-09 01:19:35,041 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:19:35,042 INFO L256 TraceCheckSpWp]: Trace formula consists of 183 conjuncts, 23 conjuncts are in the unsatisfiable core [2025-03-09 01:19:35,046 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 01:19:35,049 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2025-03-09 01:19:35,089 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-03-09 01:19:35,089 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2025-03-09 01:19:35,095 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2025-03-09 01:19:35,192 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 9 proven. 6 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-03-09 01:19:35,192 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 01:19:35,322 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 48 [2025-03-09 01:19:35,414 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 9 proven. 6 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-03-09 01:19:35,414 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2135649594] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-09 01:19:35,414 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-09 01:19:35,414 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 7, 6] total 21 [2025-03-09 01:19:35,414 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [444756432] [2025-03-09 01:19:35,414 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-09 01:19:35,414 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2025-03-09 01:19:35,414 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:19:35,415 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2025-03-09 01:19:35,415 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=441, Unknown=0, NotChecked=0, Total=506 [2025-03-09 01:19:36,785 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 27 out of 60 [2025-03-09 01:19:36,786 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 133 places, 101 transitions, 951 flow. Second operand has 23 states, 23 states have (on average 29.08695652173913) internal successors, (669), 23 states have internal predecessors, (669), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:19:36,786 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 01:19:36,786 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 27 of 60 [2025-03-09 01:19:36,786 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 01:19:37,788 INFO L124 PetriNetUnfolderBase]: 2517/5342 cut-off events. [2025-03-09 01:19:37,788 INFO L125 PetriNetUnfolderBase]: For 12594/12831 co-relation queries the response was YES. [2025-03-09 01:19:37,799 INFO L83 FinitePrefix]: Finished finitePrefix Result has 15503 conditions, 5342 events. 2517/5342 cut-off events. For 12594/12831 co-relation queries the response was YES. Maximal size of possible extension queue 212. Compared 41635 event pairs, 674 based on Foata normal form. 66/5336 useless extension candidates. Maximal degree in co-relation 15275. Up to 708 conditions per place. [2025-03-09 01:19:37,810 INFO L140 encePairwiseOnDemand]: 50/60 looper letters, 215 selfloop transitions, 40 changer transitions 0/269 dead transitions. [2025-03-09 01:19:37,811 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 150 places, 269 transitions, 2293 flow [2025-03-09 01:19:37,811 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2025-03-09 01:19:37,811 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2025-03-09 01:19:37,812 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 724 transitions. [2025-03-09 01:19:37,812 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6350877192982456 [2025-03-09 01:19:37,812 INFO L175 Difference]: Start difference. First operand has 133 places, 101 transitions, 951 flow. Second operand 19 states and 724 transitions. [2025-03-09 01:19:37,812 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 150 places, 269 transitions, 2293 flow [2025-03-09 01:19:37,823 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 144 places, 269 transitions, 2232 flow, removed 10 selfloop flow, removed 6 redundant places. [2025-03-09 01:19:37,825 INFO L231 Difference]: Finished difference. Result has 151 places, 113 transitions, 1155 flow [2025-03-09 01:19:37,825 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=60, PETRI_DIFFERENCE_MINUEND_FLOW=910, PETRI_DIFFERENCE_MINUEND_PLACES=126, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=101, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=28, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=69, PETRI_DIFFERENCE_SUBTRAHEND_STATES=19, PETRI_FLOW=1155, PETRI_PLACES=151, PETRI_TRANSITIONS=113} [2025-03-09 01:19:37,825 INFO L279 CegarLoopForPetriNet]: 58 programPoint places, 93 predicate places. [2025-03-09 01:19:37,825 INFO L471 AbstractCegarLoop]: Abstraction has has 151 places, 113 transitions, 1155 flow [2025-03-09 01:19:37,826 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 29.08695652173913) internal successors, (669), 23 states have internal predecessors, (669), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:19:37,826 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 01:19:37,826 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 01:19:37,832 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2025-03-09 01:19:38,030 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,SelfDestructingSolverStorable20 [2025-03-09 01:19:38,030 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 37 more)] === [2025-03-09 01:19:38,030 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:19:38,030 INFO L85 PathProgramCache]: Analyzing trace with hash 1446423932, now seen corresponding path program 2 times [2025-03-09 01:19:38,030 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:19:38,030 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1207037653] [2025-03-09 01:19:38,030 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-09 01:19:38,030 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:19:38,035 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 19 statements into 2 equivalence classes. [2025-03-09 01:19:38,038 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 16 of 19 statements. [2025-03-09 01:19:38,038 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-09 01:19:38,038 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:19:38,087 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-09 01:19:38,087 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:19:38,087 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1207037653] [2025-03-09 01:19:38,087 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1207037653] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 01:19:38,087 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 01:19:38,087 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-09 01:19:38,088 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1733151885] [2025-03-09 01:19:38,088 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 01:19:38,088 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-09 01:19:38,088 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:19:38,088 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-09 01:19:38,088 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-09 01:19:38,100 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 34 out of 60 [2025-03-09 01:19:38,100 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 151 places, 113 transitions, 1155 flow. Second operand has 5 states, 5 states have (on average 37.2) internal successors, (186), 5 states have internal predecessors, (186), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:19:38,100 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 01:19:38,100 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 34 of 60 [2025-03-09 01:19:38,100 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 01:19:38,596 INFO L124 PetriNetUnfolderBase]: 2581/6712 cut-off events. [2025-03-09 01:19:38,597 INFO L125 PetriNetUnfolderBase]: For 18144/18446 co-relation queries the response was YES. [2025-03-09 01:19:38,615 INFO L83 FinitePrefix]: Finished finitePrefix Result has 19096 conditions, 6712 events. 2581/6712 cut-off events. For 18144/18446 co-relation queries the response was YES. Maximal size of possible extension queue 356. Compared 64485 event pairs, 292 based on Foata normal form. 28/6656 useless extension candidates. Maximal degree in co-relation 17633. Up to 1887 conditions per place. [2025-03-09 01:19:38,629 INFO L140 encePairwiseOnDemand]: 52/60 looper letters, 90 selfloop transitions, 29 changer transitions 20/161 dead transitions. [2025-03-09 01:19:38,629 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 156 places, 161 transitions, 1852 flow [2025-03-09 01:19:38,630 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-09 01:19:38,630 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-09 01:19:38,630 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 255 transitions. [2025-03-09 01:19:38,630 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7083333333333334 [2025-03-09 01:19:38,630 INFO L175 Difference]: Start difference. First operand has 151 places, 113 transitions, 1155 flow. Second operand 6 states and 255 transitions. [2025-03-09 01:19:38,630 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 156 places, 161 transitions, 1852 flow [2025-03-09 01:19:38,649 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 151 places, 161 transitions, 1777 flow, removed 11 selfloop flow, removed 5 redundant places. [2025-03-09 01:19:38,650 INFO L231 Difference]: Finished difference. Result has 153 places, 101 transitions, 1046 flow [2025-03-09 01:19:38,651 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=60, PETRI_DIFFERENCE_MINUEND_FLOW=1101, PETRI_DIFFERENCE_MINUEND_PLACES=146, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=113, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=22, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=85, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1046, PETRI_PLACES=153, PETRI_TRANSITIONS=101} [2025-03-09 01:19:38,651 INFO L279 CegarLoopForPetriNet]: 58 programPoint places, 95 predicate places. [2025-03-09 01:19:38,651 INFO L471 AbstractCegarLoop]: Abstraction has has 153 places, 101 transitions, 1046 flow [2025-03-09 01:19:38,651 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 37.2) internal successors, (186), 5 states have internal predecessors, (186), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:19:38,651 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 01:19:38,651 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 01:19:38,651 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2025-03-09 01:19:38,651 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting thread1Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 37 more)] === [2025-03-09 01:19:38,652 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:19:38,652 INFO L85 PathProgramCache]: Analyzing trace with hash -504293139, now seen corresponding path program 1 times [2025-03-09 01:19:38,652 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:19:38,652 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [967853628] [2025-03-09 01:19:38,652 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:19:38,652 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:19:38,656 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-03-09 01:19:38,664 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-03-09 01:19:38,664 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:19:38,664 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:19:38,781 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2025-03-09 01:19:38,781 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:19:38,781 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [967853628] [2025-03-09 01:19:38,782 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [967853628] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 01:19:38,782 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1459268107] [2025-03-09 01:19:38,782 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:19:38,782 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 01:19:38,782 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 01:19:38,784 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-09 01:19:38,785 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2025-03-09 01:19:38,824 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-03-09 01:19:38,840 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-03-09 01:19:38,840 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:19:38,840 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:19:38,841 INFO L256 TraceCheckSpWp]: Trace formula consists of 189 conjuncts, 17 conjuncts are in the unsatisfiable core [2025-03-09 01:19:38,842 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 01:19:38,922 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2025-03-09 01:19:38,922 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 01:19:38,988 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 20 [2025-03-09 01:19:39,016 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2025-03-09 01:19:39,016 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1459268107] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-09 01:19:39,016 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-09 01:19:39,016 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 19 [2025-03-09 01:19:39,016 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1713617638] [2025-03-09 01:19:39,016 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-09 01:19:39,016 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2025-03-09 01:19:39,016 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:19:39,017 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2025-03-09 01:19:39,017 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=309, Unknown=0, NotChecked=0, Total=380 [2025-03-09 01:19:39,467 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 31 out of 60 [2025-03-09 01:19:39,467 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 153 places, 101 transitions, 1046 flow. Second operand has 20 states, 20 states have (on average 32.8) internal successors, (656), 20 states have internal predecessors, (656), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:19:39,467 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 01:19:39,468 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 31 of 60 [2025-03-09 01:19:39,468 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 01:19:40,188 INFO L124 PetriNetUnfolderBase]: 3133/6907 cut-off events. [2025-03-09 01:19:40,189 INFO L125 PetriNetUnfolderBase]: For 19647/20013 co-relation queries the response was YES. [2025-03-09 01:19:40,210 INFO L83 FinitePrefix]: Finished finitePrefix Result has 21274 conditions, 6907 events. 3133/6907 cut-off events. For 19647/20013 co-relation queries the response was YES. Maximal size of possible extension queue 339. Compared 61139 event pairs, 831 based on Foata normal form. 72/6830 useless extension candidates. Maximal degree in co-relation 19408. Up to 1384 conditions per place. [2025-03-09 01:19:40,227 INFO L140 encePairwiseOnDemand]: 51/60 looper letters, 131 selfloop transitions, 34 changer transitions 0/184 dead transitions. [2025-03-09 01:19:40,227 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 149 places, 184 transitions, 1790 flow [2025-03-09 01:19:40,231 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-09 01:19:40,231 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2025-03-09 01:19:40,231 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 421 transitions. [2025-03-09 01:19:40,231 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7016666666666667 [2025-03-09 01:19:40,231 INFO L175 Difference]: Start difference. First operand has 153 places, 101 transitions, 1046 flow. Second operand 10 states and 421 transitions. [2025-03-09 01:19:40,231 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 149 places, 184 transitions, 1790 flow [2025-03-09 01:19:40,249 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 137 places, 184 transitions, 1676 flow, removed 9 selfloop flow, removed 12 redundant places. [2025-03-09 01:19:40,253 INFO L231 Difference]: Finished difference. Result has 140 places, 103 transitions, 1043 flow [2025-03-09 01:19:40,254 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=60, PETRI_DIFFERENCE_MINUEND_FLOW=932, PETRI_DIFFERENCE_MINUEND_PLACES=128, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=101, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=32, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=67, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=1043, PETRI_PLACES=140, PETRI_TRANSITIONS=103} [2025-03-09 01:19:40,254 INFO L279 CegarLoopForPetriNet]: 58 programPoint places, 82 predicate places. [2025-03-09 01:19:40,254 INFO L471 AbstractCegarLoop]: Abstraction has has 140 places, 103 transitions, 1043 flow [2025-03-09 01:19:40,254 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 32.8) internal successors, (656), 20 states have internal predecessors, (656), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:19:40,254 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 01:19:40,254 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 01:19:40,261 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-09 01:19:40,459 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,SelfDestructingSolverStorable22 [2025-03-09 01:19:40,459 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 37 more)] === [2025-03-09 01:19:40,459 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:19:40,459 INFO L85 PathProgramCache]: Analyzing trace with hash 222971260, now seen corresponding path program 1 times [2025-03-09 01:19:40,459 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:19:40,459 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1630401786] [2025-03-09 01:19:40,459 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:19:40,459 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:19:40,466 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 21 statements into 1 equivalence classes. [2025-03-09 01:19:40,469 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 21 of 21 statements. [2025-03-09 01:19:40,469 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:19:40,469 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:19:40,557 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 4 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 01:19:40,558 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:19:40,558 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1630401786] [2025-03-09 01:19:40,558 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1630401786] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 01:19:40,558 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2137671281] [2025-03-09 01:19:40,558 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:19:40,558 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 01:19:40,558 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 01:19:40,560 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-09 01:19:40,562 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2025-03-09 01:19:40,602 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 21 statements into 1 equivalence classes. [2025-03-09 01:19:40,616 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 21 of 21 statements. [2025-03-09 01:19:40,616 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:19:40,616 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:19:40,617 INFO L256 TraceCheckSpWp]: Trace formula consists of 185 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-03-09 01:19:40,619 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 01:19:40,694 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-09 01:19:40,694 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 01:19:40,770 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-09 01:19:40,771 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2137671281] provided 1 perfect and 1 imperfect interpolant sequences [2025-03-09 01:19:40,771 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-03-09 01:19:40,771 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [8, 6] total 15 [2025-03-09 01:19:40,771 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1064787331] [2025-03-09 01:19:40,771 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 01:19:40,771 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-09 01:19:40,771 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:19:40,771 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-09 01:19:40,771 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=64, Invalid=176, Unknown=0, NotChecked=0, Total=240 [2025-03-09 01:19:40,806 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 32 out of 60 [2025-03-09 01:19:40,807 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 140 places, 103 transitions, 1043 flow. Second operand has 7 states, 7 states have (on average 34.714285714285715) internal successors, (243), 7 states have internal predecessors, (243), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:19:40,807 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 01:19:40,807 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 32 of 60 [2025-03-09 01:19:40,807 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 01:19:41,365 INFO L124 PetriNetUnfolderBase]: 3032/6899 cut-off events. [2025-03-09 01:19:41,365 INFO L125 PetriNetUnfolderBase]: For 21886/22349 co-relation queries the response was YES. [2025-03-09 01:19:41,377 INFO L83 FinitePrefix]: Finished finitePrefix Result has 21613 conditions, 6899 events. 3032/6899 cut-off events. For 21886/22349 co-relation queries the response was YES. Maximal size of possible extension queue 343. Compared 60846 event pairs, 1043 based on Foata normal form. 205/6993 useless extension candidates. Maximal degree in co-relation 19995. Up to 3137 conditions per place. [2025-03-09 01:19:41,387 INFO L140 encePairwiseOnDemand]: 52/60 looper letters, 85 selfloop transitions, 20 changer transitions 0/127 dead transitions. [2025-03-09 01:19:41,387 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 146 places, 127 transitions, 1511 flow [2025-03-09 01:19:41,387 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-09 01:19:41,387 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-03-09 01:19:41,388 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 264 transitions. [2025-03-09 01:19:41,388 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6285714285714286 [2025-03-09 01:19:41,388 INFO L175 Difference]: Start difference. First operand has 140 places, 103 transitions, 1043 flow. Second operand 7 states and 264 transitions. [2025-03-09 01:19:41,388 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 146 places, 127 transitions, 1511 flow [2025-03-09 01:19:41,401 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 143 places, 127 transitions, 1489 flow, removed 0 selfloop flow, removed 3 redundant places. [2025-03-09 01:19:41,402 INFO L231 Difference]: Finished difference. Result has 145 places, 104 transitions, 1103 flow [2025-03-09 01:19:41,402 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=60, PETRI_DIFFERENCE_MINUEND_FLOW=1021, PETRI_DIFFERENCE_MINUEND_PLACES=137, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=103, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=19, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=83, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=1103, PETRI_PLACES=145, PETRI_TRANSITIONS=104} [2025-03-09 01:19:41,402 INFO L279 CegarLoopForPetriNet]: 58 programPoint places, 87 predicate places. [2025-03-09 01:19:41,402 INFO L471 AbstractCegarLoop]: Abstraction has has 145 places, 104 transitions, 1103 flow [2025-03-09 01:19:41,403 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 34.714285714285715) internal successors, (243), 7 states have internal predecessors, (243), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:19:41,403 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 01:19:41,403 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 01:19:41,408 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Ended with exit code 0 [2025-03-09 01:19:41,607 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,SelfDestructingSolverStorable23 [2025-03-09 01:19:41,607 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting thread2Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 37 more)] === [2025-03-09 01:19:41,607 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:19:41,607 INFO L85 PathProgramCache]: Analyzing trace with hash -397443571, now seen corresponding path program 2 times [2025-03-09 01:19:41,607 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:19:41,607 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1975362607] [2025-03-09 01:19:41,607 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-09 01:19:41,607 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:19:41,612 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 21 statements into 2 equivalence classes. [2025-03-09 01:19:41,619 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 21 of 21 statements. [2025-03-09 01:19:41,619 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-09 01:19:41,619 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:19:41,831 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 9 proven. 6 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-03-09 01:19:41,832 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:19:41,832 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1975362607] [2025-03-09 01:19:41,832 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1975362607] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 01:19:41,832 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1553948357] [2025-03-09 01:19:41,832 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-09 01:19:41,832 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 01:19:41,832 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 01:19:41,834 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-09 01:19:41,835 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2025-03-09 01:19:41,877 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 21 statements into 2 equivalence classes. [2025-03-09 01:19:41,894 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 21 of 21 statements. [2025-03-09 01:19:41,894 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-09 01:19:41,894 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:19:41,895 INFO L256 TraceCheckSpWp]: Trace formula consists of 199 conjuncts, 23 conjuncts are in the unsatisfiable core [2025-03-09 01:19:41,896 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 01:19:41,901 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2025-03-09 01:19:41,963 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2025-03-09 01:19:41,964 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 16 treesize of output 15 [2025-03-09 01:19:41,972 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-03-09 01:19:41,972 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2025-03-09 01:19:42,079 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 9 proven. 6 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-03-09 01:19:42,079 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 01:19:42,189 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 48 [2025-03-09 01:19:42,284 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 9 proven. 6 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-03-09 01:19:42,284 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1553948357] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-09 01:19:42,285 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-09 01:19:42,285 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 7, 6] total 22 [2025-03-09 01:19:42,285 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1395467696] [2025-03-09 01:19:42,285 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-09 01:19:42,285 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2025-03-09 01:19:42,285 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:19:42,285 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2025-03-09 01:19:42,286 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=484, Unknown=0, NotChecked=0, Total=552 [2025-03-09 01:19:43,825 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 21 out of 60 [2025-03-09 01:19:43,826 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 145 places, 104 transitions, 1103 flow. Second operand has 24 states, 24 states have (on average 23.375) internal successors, (561), 24 states have internal predecessors, (561), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:19:43,826 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 01:19:43,826 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 21 of 60 [2025-03-09 01:19:43,826 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 01:19:45,837 INFO L124 PetriNetUnfolderBase]: 7247/13645 cut-off events. [2025-03-09 01:19:45,838 INFO L125 PetriNetUnfolderBase]: For 46012/46012 co-relation queries the response was YES. [2025-03-09 01:19:45,872 INFO L83 FinitePrefix]: Finished finitePrefix Result has 46329 conditions, 13645 events. 7247/13645 cut-off events. For 46012/46012 co-relation queries the response was YES. Maximal size of possible extension queue 438. Compared 109421 event pairs, 356 based on Foata normal form. 272/13908 useless extension candidates. Maximal degree in co-relation 41993. Up to 3118 conditions per place. [2025-03-09 01:19:45,903 INFO L140 encePairwiseOnDemand]: 47/60 looper letters, 241 selfloop transitions, 45 changer transitions 0/299 dead transitions. [2025-03-09 01:19:45,903 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 166 places, 299 transitions, 3231 flow [2025-03-09 01:19:45,904 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2025-03-09 01:19:45,904 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2025-03-09 01:19:45,904 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 665 transitions. [2025-03-09 01:19:45,905 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.48188405797101447 [2025-03-09 01:19:45,905 INFO L175 Difference]: Start difference. First operand has 145 places, 104 transitions, 1103 flow. Second operand 23 states and 665 transitions. [2025-03-09 01:19:45,905 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 166 places, 299 transitions, 3231 flow [2025-03-09 01:19:45,955 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 160 places, 299 transitions, 3165 flow, removed 12 selfloop flow, removed 6 redundant places. [2025-03-09 01:19:45,958 INFO L231 Difference]: Finished difference. Result has 165 places, 121 transitions, 1317 flow [2025-03-09 01:19:45,958 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=60, PETRI_DIFFERENCE_MINUEND_FLOW=1055, PETRI_DIFFERENCE_MINUEND_PLACES=138, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=103, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=27, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=67, PETRI_DIFFERENCE_SUBTRAHEND_STATES=23, PETRI_FLOW=1317, PETRI_PLACES=165, PETRI_TRANSITIONS=121} [2025-03-09 01:19:45,958 INFO L279 CegarLoopForPetriNet]: 58 programPoint places, 107 predicate places. [2025-03-09 01:19:45,958 INFO L471 AbstractCegarLoop]: Abstraction has has 165 places, 121 transitions, 1317 flow [2025-03-09 01:19:45,959 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 24 states have (on average 23.375) internal successors, (561), 24 states have internal predecessors, (561), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:19:45,959 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 01:19:45,959 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 01:19:45,964 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Forceful destruction successful, exit code 0 [2025-03-09 01:19:46,159 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24,15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 01:19:46,159 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting thread2Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 37 more)] === [2025-03-09 01:19:46,159 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:19:46,160 INFO L85 PathProgramCache]: Analyzing trace with hash 564151707, now seen corresponding path program 1 times [2025-03-09 01:19:46,160 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:19:46,160 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1326029026] [2025-03-09 01:19:46,160 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:19:46,160 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:19:46,165 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-03-09 01:19:46,170 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-03-09 01:19:46,170 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:19:46,170 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:19:46,368 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2025-03-09 01:19:46,369 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:19:46,369 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1326029026] [2025-03-09 01:19:46,369 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1326029026] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 01:19:46,369 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1649998180] [2025-03-09 01:19:46,369 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:19:46,369 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 01:19:46,369 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 01:19:46,371 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-09 01:19:46,372 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2025-03-09 01:19:46,423 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-03-09 01:19:46,442 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-03-09 01:19:46,442 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:19:46,442 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:19:46,443 INFO L256 TraceCheckSpWp]: Trace formula consists of 205 conjuncts, 17 conjuncts are in the unsatisfiable core [2025-03-09 01:19:46,444 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 01:19:46,537 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2025-03-09 01:19:46,537 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 01:19:46,617 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 20 [2025-03-09 01:19:46,647 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2025-03-09 01:19:46,647 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1649998180] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-09 01:19:46,647 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-09 01:19:46,647 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 19 [2025-03-09 01:19:46,647 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1059187433] [2025-03-09 01:19:46,647 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-09 01:19:46,647 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2025-03-09 01:19:46,647 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:19:46,648 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2025-03-09 01:19:46,648 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=309, Unknown=0, NotChecked=0, Total=380 [2025-03-09 01:19:47,206 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 30 out of 60 [2025-03-09 01:19:47,207 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 165 places, 121 transitions, 1317 flow. Second operand has 20 states, 20 states have (on average 32.1) internal successors, (642), 20 states have internal predecessors, (642), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:19:47,207 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 01:19:47,207 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 30 of 60 [2025-03-09 01:19:47,207 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 01:19:48,379 INFO L124 PetriNetUnfolderBase]: 5020/10306 cut-off events. [2025-03-09 01:19:48,380 INFO L125 PetriNetUnfolderBase]: For 42353/42590 co-relation queries the response was YES. [2025-03-09 01:19:48,409 INFO L83 FinitePrefix]: Finished finitePrefix Result has 36130 conditions, 10306 events. 5020/10306 cut-off events. For 42353/42590 co-relation queries the response was YES. Maximal size of possible extension queue 387. Compared 88130 event pairs, 967 based on Foata normal form. 142/10256 useless extension candidates. Maximal degree in co-relation 33014. Up to 2390 conditions per place. [2025-03-09 01:19:48,434 INFO L140 encePairwiseOnDemand]: 51/60 looper letters, 163 selfloop transitions, 28 changer transitions 0/223 dead transitions. [2025-03-09 01:19:48,434 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 174 places, 223 transitions, 2529 flow [2025-03-09 01:19:48,436 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-09 01:19:48,436 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2025-03-09 01:19:48,437 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 407 transitions. [2025-03-09 01:19:48,437 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6783333333333333 [2025-03-09 01:19:48,437 INFO L175 Difference]: Start difference. First operand has 165 places, 121 transitions, 1317 flow. Second operand 10 states and 407 transitions. [2025-03-09 01:19:48,437 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 174 places, 223 transitions, 2529 flow [2025-03-09 01:19:48,477 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 163 places, 223 transitions, 2467 flow, removed 10 selfloop flow, removed 11 redundant places. [2025-03-09 01:19:48,479 INFO L231 Difference]: Finished difference. Result has 166 places, 125 transitions, 1369 flow [2025-03-09 01:19:48,479 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=60, PETRI_DIFFERENCE_MINUEND_FLOW=1259, PETRI_DIFFERENCE_MINUEND_PLACES=154, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=121, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=24, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=93, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=1369, PETRI_PLACES=166, PETRI_TRANSITIONS=125} [2025-03-09 01:19:48,480 INFO L279 CegarLoopForPetriNet]: 58 programPoint places, 108 predicate places. [2025-03-09 01:19:48,480 INFO L471 AbstractCegarLoop]: Abstraction has has 166 places, 125 transitions, 1369 flow [2025-03-09 01:19:48,481 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 32.1) internal successors, (642), 20 states have internal predecessors, (642), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:19:48,481 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 01:19:48,481 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2025-03-09 01:19:48,487 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Forceful destruction successful, exit code 0 [2025-03-09 01:19:48,681 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable25 [2025-03-09 01:19:48,682 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting thread1Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 37 more)] === [2025-03-09 01:19:48,682 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:19:48,682 INFO L85 PathProgramCache]: Analyzing trace with hash -509713817, now seen corresponding path program 2 times [2025-03-09 01:19:48,682 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:19:48,682 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2062816563] [2025-03-09 01:19:48,682 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-09 01:19:48,682 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:19:48,687 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 24 statements into 2 equivalence classes. [2025-03-09 01:19:48,699 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 24 of 24 statements. [2025-03-09 01:19:48,699 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-09 01:19:48,699 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:19:48,776 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 10 proven. 13 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-03-09 01:19:48,776 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:19:48,776 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2062816563] [2025-03-09 01:19:48,776 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2062816563] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 01:19:48,776 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [746721103] [2025-03-09 01:19:48,776 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-09 01:19:48,776 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 01:19:48,776 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 01:19:48,778 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-09 01:19:48,779 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2025-03-09 01:19:48,830 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 24 statements into 2 equivalence classes. [2025-03-09 01:19:48,851 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 24 of 24 statements. [2025-03-09 01:19:48,851 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-09 01:19:48,851 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:19:48,854 INFO L256 TraceCheckSpWp]: Trace formula consists of 207 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-03-09 01:19:48,854 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 01:19:48,934 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 15 proven. 8 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-03-09 01:19:48,934 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 01:19:48,997 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 15 proven. 8 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-03-09 01:19:48,997 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [746721103] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-09 01:19:48,997 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-09 01:19:48,997 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 18 [2025-03-09 01:19:48,998 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2028422023] [2025-03-09 01:19:48,998 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-09 01:19:48,998 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2025-03-09 01:19:48,998 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:19:48,999 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2025-03-09 01:19:48,999 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=97, Invalid=245, Unknown=0, NotChecked=0, Total=342 [2025-03-09 01:19:49,142 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 33 out of 60 [2025-03-09 01:19:49,142 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 166 places, 125 transitions, 1369 flow. Second operand has 19 states, 19 states have (on average 34.94736842105263) internal successors, (664), 19 states have internal predecessors, (664), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:19:49,142 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 01:19:49,142 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 33 of 60 [2025-03-09 01:19:49,142 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 01:19:50,534 INFO L124 PetriNetUnfolderBase]: 6620/15049 cut-off events. [2025-03-09 01:19:50,534 INFO L125 PetriNetUnfolderBase]: For 76142/76670 co-relation queries the response was YES. [2025-03-09 01:19:50,583 INFO L83 FinitePrefix]: Finished finitePrefix Result has 54321 conditions, 15049 events. 6620/15049 cut-off events. For 76142/76670 co-relation queries the response was YES. Maximal size of possible extension queue 639. Compared 151164 event pairs, 3313 based on Foata normal form. 237/14799 useless extension candidates. Maximal degree in co-relation 51068. Up to 5630 conditions per place. [2025-03-09 01:19:50,622 INFO L140 encePairwiseOnDemand]: 50/60 looper letters, 136 selfloop transitions, 54 changer transitions 0/230 dead transitions. [2025-03-09 01:19:50,622 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 177 places, 230 transitions, 2862 flow [2025-03-09 01:19:50,622 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-09 01:19:50,622 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2025-03-09 01:19:50,622 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 488 transitions. [2025-03-09 01:19:50,623 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6777777777777778 [2025-03-09 01:19:50,623 INFO L175 Difference]: Start difference. First operand has 166 places, 125 transitions, 1369 flow. Second operand 12 states and 488 transitions. [2025-03-09 01:19:50,623 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 177 places, 230 transitions, 2862 flow [2025-03-09 01:19:50,689 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 173 places, 230 transitions, 2825 flow, removed 0 selfloop flow, removed 4 redundant places. [2025-03-09 01:19:50,691 INFO L231 Difference]: Finished difference. Result has 180 places, 152 transitions, 1971 flow [2025-03-09 01:19:50,691 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=60, PETRI_DIFFERENCE_MINUEND_FLOW=1345, PETRI_DIFFERENCE_MINUEND_PLACES=162, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=125, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=27, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=79, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=1971, PETRI_PLACES=180, PETRI_TRANSITIONS=152} [2025-03-09 01:19:50,692 INFO L279 CegarLoopForPetriNet]: 58 programPoint places, 122 predicate places. [2025-03-09 01:19:50,692 INFO L471 AbstractCegarLoop]: Abstraction has has 180 places, 152 transitions, 1971 flow [2025-03-09 01:19:50,692 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 34.94736842105263) internal successors, (664), 19 states have internal predecessors, (664), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:19:50,692 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 01:19:50,692 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 01:19:50,698 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Ended with exit code 0 [2025-03-09 01:19:50,892 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable26 [2025-03-09 01:19:50,893 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 37 more)] === [2025-03-09 01:19:50,893 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:19:50,893 INFO L85 PathProgramCache]: Analyzing trace with hash 464256764, now seen corresponding path program 1 times [2025-03-09 01:19:50,893 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:19:50,893 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1110623865] [2025-03-09 01:19:50,893 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:19:50,893 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:19:50,897 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-03-09 01:19:50,900 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-03-09 01:19:50,900 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:19:50,900 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:19:50,977 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 3 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-09 01:19:50,977 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:19:50,977 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1110623865] [2025-03-09 01:19:50,977 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1110623865] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 01:19:50,977 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [85941757] [2025-03-09 01:19:50,977 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:19:50,977 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 01:19:50,977 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 01:19:50,979 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-09 01:19:50,981 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Waiting until timeout for monitored process [2025-03-09 01:19:51,028 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-03-09 01:19:51,045 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-03-09 01:19:51,045 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:19:51,045 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:19:51,046 INFO L256 TraceCheckSpWp]: Trace formula consists of 203 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-03-09 01:19:51,047 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 01:19:51,095 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-09 01:19:51,096 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 01:19:51,153 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-09 01:19:51,153 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [85941757] provided 1 perfect and 1 imperfect interpolant sequences [2025-03-09 01:19:51,153 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-03-09 01:19:51,153 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [8, 6] total 14 [2025-03-09 01:19:51,153 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1510014473] [2025-03-09 01:19:51,153 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 01:19:51,153 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-09 01:19:51,154 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:19:51,154 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-09 01:19:51,154 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=149, Unknown=0, NotChecked=0, Total=210 [2025-03-09 01:19:51,195 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 32 out of 60 [2025-03-09 01:19:51,196 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 180 places, 152 transitions, 1971 flow. Second operand has 7 states, 7 states have (on average 34.857142857142854) internal successors, (244), 7 states have internal predecessors, (244), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:19:51,196 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 01:19:51,196 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 32 of 60 [2025-03-09 01:19:51,196 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 01:19:53,259 INFO L124 PetriNetUnfolderBase]: 6902/15132 cut-off events. [2025-03-09 01:19:53,260 INFO L125 PetriNetUnfolderBase]: For 87582/88116 co-relation queries the response was YES. [2025-03-09 01:19:53,303 INFO L83 FinitePrefix]: Finished finitePrefix Result has 57599 conditions, 15132 events. 6902/15132 cut-off events. For 87582/88116 co-relation queries the response was YES. Maximal size of possible extension queue 675. Compared 147254 event pairs, 2715 based on Foata normal form. 436/15232 useless extension candidates. Maximal degree in co-relation 54255. Up to 6809 conditions per place. [2025-03-09 01:19:53,341 INFO L140 encePairwiseOnDemand]: 52/60 looper letters, 87 selfloop transitions, 48 changer transitions 0/174 dead transitions. [2025-03-09 01:19:53,341 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 186 places, 174 transitions, 2475 flow [2025-03-09 01:19:53,342 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-09 01:19:53,342 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-03-09 01:19:53,342 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 266 transitions. [2025-03-09 01:19:53,342 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6333333333333333 [2025-03-09 01:19:53,342 INFO L175 Difference]: Start difference. First operand has 180 places, 152 transitions, 1971 flow. Second operand 7 states and 266 transitions. [2025-03-09 01:19:53,342 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 186 places, 174 transitions, 2475 flow [2025-03-09 01:19:53,443 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 184 places, 174 transitions, 2470 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-09 01:19:53,445 INFO L231 Difference]: Finished difference. Result has 186 places, 153 transitions, 2161 flow [2025-03-09 01:19:53,446 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=60, PETRI_DIFFERENCE_MINUEND_FLOW=1966, PETRI_DIFFERENCE_MINUEND_PLACES=178, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=152, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=47, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=104, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=2161, PETRI_PLACES=186, PETRI_TRANSITIONS=153} [2025-03-09 01:19:53,450 INFO L279 CegarLoopForPetriNet]: 58 programPoint places, 128 predicate places. [2025-03-09 01:19:53,450 INFO L471 AbstractCegarLoop]: Abstraction has has 186 places, 153 transitions, 2161 flow [2025-03-09 01:19:53,450 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 34.857142857142854) internal successors, (244), 7 states have internal predecessors, (244), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:19:53,450 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 01:19:53,450 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2025-03-09 01:19:53,456 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Ended with exit code 0 [2025-03-09 01:19:53,650 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable27 [2025-03-09 01:19:53,651 INFO L396 AbstractCegarLoop]: === Iteration 29 === Targeting thread1Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 37 more)] === [2025-03-09 01:19:53,651 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:19:53,651 INFO L85 PathProgramCache]: Analyzing trace with hash -531803315, now seen corresponding path program 3 times [2025-03-09 01:19:53,651 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:19:53,651 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [637135312] [2025-03-09 01:19:53,651 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-09 01:19:53,651 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:19:53,656 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 26 statements into 5 equivalence classes. [2025-03-09 01:19:53,661 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 15 of 26 statements. [2025-03-09 01:19:53,662 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-03-09 01:19:53,662 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:19:53,754 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 5 proven. 4 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2025-03-09 01:19:53,754 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:19:53,754 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [637135312] [2025-03-09 01:19:53,754 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [637135312] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 01:19:53,754 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [554702199] [2025-03-09 01:19:53,754 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-09 01:19:53,754 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 01:19:53,755 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 01:19:53,756 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-09 01:19:53,757 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Waiting until timeout for monitored process [2025-03-09 01:19:53,806 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 26 statements into 5 equivalence classes. [2025-03-09 01:19:53,821 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 15 of 26 statements. [2025-03-09 01:19:53,821 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-03-09 01:19:53,821 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:19:53,822 INFO L256 TraceCheckSpWp]: Trace formula consists of 160 conjuncts, 20 conjuncts are in the unsatisfiable core [2025-03-09 01:19:53,823 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 01:19:53,837 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2025-03-09 01:19:53,957 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 9 proven. 4 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2025-03-09 01:19:53,958 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 01:19:54,256 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 7 proven. 6 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2025-03-09 01:19:54,256 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [554702199] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-09 01:19:54,256 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-09 01:19:54,256 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6, 6] total 19 [2025-03-09 01:19:54,256 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [73005665] [2025-03-09 01:19:54,256 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-09 01:19:54,257 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2025-03-09 01:19:54,257 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:19:54,257 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2025-03-09 01:19:54,257 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=326, Unknown=0, NotChecked=0, Total=380 [2025-03-09 01:19:55,214 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 28 out of 60 [2025-03-09 01:19:55,215 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 186 places, 153 transitions, 2161 flow. Second operand has 20 states, 20 states have (on average 30.65) internal successors, (613), 20 states have internal predecessors, (613), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:19:55,215 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 01:19:55,215 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 28 of 60 [2025-03-09 01:19:55,215 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 01:19:57,293 INFO L124 PetriNetUnfolderBase]: 8910/16887 cut-off events. [2025-03-09 01:19:57,293 INFO L125 PetriNetUnfolderBase]: For 110061/111007 co-relation queries the response was YES. [2025-03-09 01:19:57,365 INFO L83 FinitePrefix]: Finished finitePrefix Result has 68721 conditions, 16887 events. 8910/16887 cut-off events. For 110061/111007 co-relation queries the response was YES. Maximal size of possible extension queue 746. Compared 148925 event pairs, 202 based on Foata normal form. 424/17205 useless extension candidates. Maximal degree in co-relation 64341. Up to 4650 conditions per place. [2025-03-09 01:19:57,415 INFO L140 encePairwiseOnDemand]: 50/60 looper letters, 163 selfloop transitions, 65 changer transitions 0/250 dead transitions. [2025-03-09 01:19:57,415 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 196 places, 250 transitions, 3597 flow [2025-03-09 01:19:57,416 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-09 01:19:57,416 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2025-03-09 01:19:57,416 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 428 transitions. [2025-03-09 01:19:57,416 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5944444444444444 [2025-03-09 01:19:57,416 INFO L175 Difference]: Start difference. First operand has 186 places, 153 transitions, 2161 flow. Second operand 12 states and 428 transitions. [2025-03-09 01:19:57,416 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 196 places, 250 transitions, 3597 flow [2025-03-09 01:19:57,558 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 189 places, 250 transitions, 3493 flow, removed 5 selfloop flow, removed 7 redundant places. [2025-03-09 01:19:57,560 INFO L231 Difference]: Finished difference. Result has 189 places, 152 transitions, 2181 flow [2025-03-09 01:19:57,560 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=60, PETRI_DIFFERENCE_MINUEND_FLOW=2051, PETRI_DIFFERENCE_MINUEND_PLACES=178, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=152, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=65, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=87, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=2181, PETRI_PLACES=189, PETRI_TRANSITIONS=152} [2025-03-09 01:19:57,561 INFO L279 CegarLoopForPetriNet]: 58 programPoint places, 131 predicate places. [2025-03-09 01:19:57,561 INFO L471 AbstractCegarLoop]: Abstraction has has 189 places, 152 transitions, 2181 flow [2025-03-09 01:19:57,561 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 30.65) internal successors, (613), 20 states have internal predecessors, (613), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:19:57,561 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 01:19:57,561 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 01:19:57,567 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-09 01:19:57,762 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 19 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable28 [2025-03-09 01:19:57,762 INFO L396 AbstractCegarLoop]: === Iteration 30 === Targeting thread2Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 37 more)] === [2025-03-09 01:19:57,762 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:19:57,762 INFO L85 PathProgramCache]: Analyzing trace with hash 661912725, now seen corresponding path program 2 times [2025-03-09 01:19:57,762 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:19:57,762 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [145861245] [2025-03-09 01:19:57,762 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-09 01:19:57,762 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:19:57,767 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 26 statements into 2 equivalence classes. [2025-03-09 01:19:57,774 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 26 of 26 statements. [2025-03-09 01:19:57,774 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-09 01:19:57,774 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:19:57,839 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 10 proven. 13 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-03-09 01:19:57,839 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:19:57,839 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [145861245] [2025-03-09 01:19:57,839 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [145861245] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 01:19:57,839 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [881258600] [2025-03-09 01:19:57,839 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-09 01:19:57,840 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 01:19:57,840 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 01:19:57,841 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-09 01:19:57,843 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Waiting until timeout for monitored process [2025-03-09 01:19:57,896 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 26 statements into 2 equivalence classes. [2025-03-09 01:19:57,915 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 26 of 26 statements. [2025-03-09 01:19:57,915 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-09 01:19:57,916 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:19:57,917 INFO L256 TraceCheckSpWp]: Trace formula consists of 223 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-03-09 01:19:57,917 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 01:19:58,003 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 10 proven. 4 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2025-03-09 01:19:58,003 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 01:19:58,095 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 10 proven. 4 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2025-03-09 01:19:58,096 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [881258600] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-09 01:19:58,096 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-09 01:19:58,096 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 9, 9] total 22 [2025-03-09 01:19:58,096 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1181115305] [2025-03-09 01:19:58,096 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-09 01:19:58,096 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2025-03-09 01:19:58,097 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:19:58,097 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2025-03-09 01:19:58,097 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=85, Invalid=377, Unknown=0, NotChecked=0, Total=462 [2025-03-09 01:19:58,370 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 33 out of 60 [2025-03-09 01:19:58,371 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 189 places, 152 transitions, 2181 flow. Second operand has 22 states, 22 states have (on average 35.18181818181818) internal successors, (774), 22 states have internal predecessors, (774), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:19:58,371 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 01:19:58,371 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 33 of 60 [2025-03-09 01:19:58,371 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 01:20:00,481 INFO L124 PetriNetUnfolderBase]: 6034/13989 cut-off events. [2025-03-09 01:20:00,481 INFO L125 PetriNetUnfolderBase]: For 95671/95995 co-relation queries the response was YES. [2025-03-09 01:20:00,566 INFO L83 FinitePrefix]: Finished finitePrefix Result has 54758 conditions, 13989 events. 6034/13989 cut-off events. For 95671/95995 co-relation queries the response was YES. Maximal size of possible extension queue 536. Compared 136670 event pairs, 1778 based on Foata normal form. 165/13876 useless extension candidates. Maximal degree in co-relation 52213. Up to 2577 conditions per place. [2025-03-09 01:20:00,618 INFO L140 encePairwiseOnDemand]: 50/60 looper letters, 254 selfloop transitions, 67 changer transitions 0/359 dead transitions. [2025-03-09 01:20:00,618 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 220 places, 359 transitions, 4959 flow [2025-03-09 01:20:00,619 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2025-03-09 01:20:00,620 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2025-03-09 01:20:00,621 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 1259 transitions. [2025-03-09 01:20:00,621 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6557291666666667 [2025-03-09 01:20:00,621 INFO L175 Difference]: Start difference. First operand has 189 places, 152 transitions, 2181 flow. Second operand 32 states and 1259 transitions. [2025-03-09 01:20:00,621 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 220 places, 359 transitions, 4959 flow [2025-03-09 01:20:00,783 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 210 places, 359 transitions, 4470 flow, removed 3 selfloop flow, removed 10 redundant places. [2025-03-09 01:20:00,787 INFO L231 Difference]: Finished difference. Result has 214 places, 175 transitions, 2511 flow [2025-03-09 01:20:00,787 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=60, PETRI_DIFFERENCE_MINUEND_FLOW=1921, PETRI_DIFFERENCE_MINUEND_PLACES=179, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=152, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=48, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=103, PETRI_DIFFERENCE_SUBTRAHEND_STATES=32, PETRI_FLOW=2511, PETRI_PLACES=214, PETRI_TRANSITIONS=175} [2025-03-09 01:20:00,787 INFO L279 CegarLoopForPetriNet]: 58 programPoint places, 156 predicate places. [2025-03-09 01:20:00,787 INFO L471 AbstractCegarLoop]: Abstraction has has 214 places, 175 transitions, 2511 flow [2025-03-09 01:20:00,788 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 22 states have (on average 35.18181818181818) internal successors, (774), 22 states have internal predecessors, (774), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:20:00,788 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 01:20:00,788 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2025-03-09 01:20:00,793 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Ended with exit code 0 [2025-03-09 01:20:00,988 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29,20 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 01:20:00,988 INFO L396 AbstractCegarLoop]: === Iteration 31 === Targeting thread1Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 37 more)] === [2025-03-09 01:20:00,989 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:20:00,989 INFO L85 PathProgramCache]: Analyzing trace with hash 1844002861, now seen corresponding path program 3 times [2025-03-09 01:20:00,989 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:20:00,989 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1773649190] [2025-03-09 01:20:00,989 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-09 01:20:00,989 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:20:00,995 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 27 statements into 5 equivalence classes. [2025-03-09 01:20:01,000 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 14 of 27 statements. [2025-03-09 01:20:01,000 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-03-09 01:20:01,000 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:20:01,123 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 11 proven. 8 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2025-03-09 01:20:01,124 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:20:01,124 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1773649190] [2025-03-09 01:20:01,124 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1773649190] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 01:20:01,124 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [155517639] [2025-03-09 01:20:01,124 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-09 01:20:01,124 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 01:20:01,124 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 01:20:01,126 INFO L229 MonitoredProcess]: Starting monitored process 21 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-09 01:20:01,128 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Waiting until timeout for monitored process [2025-03-09 01:20:01,184 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 27 statements into 5 equivalence classes. [2025-03-09 01:20:01,199 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 14 of 27 statements. [2025-03-09 01:20:01,199 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-03-09 01:20:01,200 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:20:01,200 INFO L256 TraceCheckSpWp]: Trace formula consists of 154 conjuncts, 22 conjuncts are in the unsatisfiable core [2025-03-09 01:20:01,202 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 01:20:01,207 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2025-03-09 01:20:01,261 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2025-03-09 01:20:01,261 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 18 treesize of output 17 [2025-03-09 01:20:01,271 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-03-09 01:20:01,272 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2025-03-09 01:20:01,321 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 17 proven. 2 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2025-03-09 01:20:01,321 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 01:20:01,481 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 42 treesize of output 38 [2025-03-09 01:20:01,529 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 7 proven. 12 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2025-03-09 01:20:01,529 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [155517639] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-09 01:20:01,529 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-09 01:20:01,529 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 7, 6] total 15 [2025-03-09 01:20:01,529 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1666247491] [2025-03-09 01:20:01,529 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-09 01:20:01,529 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2025-03-09 01:20:01,529 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:20:01,530 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2025-03-09 01:20:01,530 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=221, Unknown=0, NotChecked=0, Total=272 [2025-03-09 01:20:02,336 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 26 out of 60 [2025-03-09 01:20:02,337 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 214 places, 175 transitions, 2511 flow. Second operand has 17 states, 17 states have (on average 28.470588235294116) internal successors, (484), 17 states have internal predecessors, (484), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:20:02,337 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 01:20:02,337 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 26 of 60 [2025-03-09 01:20:02,337 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 01:20:04,132 INFO L124 PetriNetUnfolderBase]: 9052/17785 cut-off events. [2025-03-09 01:20:04,132 INFO L125 PetriNetUnfolderBase]: For 107319/108172 co-relation queries the response was YES. [2025-03-09 01:20:04,226 INFO L83 FinitePrefix]: Finished finitePrefix Result has 69351 conditions, 17785 events. 9052/17785 cut-off events. For 107319/108172 co-relation queries the response was YES. Maximal size of possible extension queue 636. Compared 160150 event pairs, 1153 based on Foata normal form. 189/17896 useless extension candidates. Maximal degree in co-relation 65705. Up to 4984 conditions per place. [2025-03-09 01:20:04,276 INFO L140 encePairwiseOnDemand]: 51/60 looper letters, 192 selfloop transitions, 55 changer transitions 0/276 dead transitions. [2025-03-09 01:20:04,276 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 221 places, 276 transitions, 4404 flow [2025-03-09 01:20:04,276 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-09 01:20:04,276 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2025-03-09 01:20:04,277 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 304 transitions. [2025-03-09 01:20:04,277 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.562962962962963 [2025-03-09 01:20:04,277 INFO L175 Difference]: Start difference. First operand has 214 places, 175 transitions, 2511 flow. Second operand 9 states and 304 transitions. [2025-03-09 01:20:04,277 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 221 places, 276 transitions, 4404 flow [2025-03-09 01:20:04,486 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 204 places, 276 transitions, 4218 flow, removed 15 selfloop flow, removed 17 redundant places. [2025-03-09 01:20:04,489 INFO L231 Difference]: Finished difference. Result has 204 places, 174 transitions, 2437 flow [2025-03-09 01:20:04,489 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=60, PETRI_DIFFERENCE_MINUEND_FLOW=2327, PETRI_DIFFERENCE_MINUEND_PLACES=196, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=174, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=55, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=119, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=2437, PETRI_PLACES=204, PETRI_TRANSITIONS=174} [2025-03-09 01:20:04,489 INFO L279 CegarLoopForPetriNet]: 58 programPoint places, 146 predicate places. [2025-03-09 01:20:04,489 INFO L471 AbstractCegarLoop]: Abstraction has has 204 places, 174 transitions, 2437 flow [2025-03-09 01:20:04,489 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 28.470588235294116) internal successors, (484), 17 states have internal predecessors, (484), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:20:04,489 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 01:20:04,489 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 01:20:04,495 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Forceful destruction successful, exit code 0 [2025-03-09 01:20:04,690 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,SelfDestructingSolverStorable30 [2025-03-09 01:20:04,690 INFO L396 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 37 more)] === [2025-03-09 01:20:04,690 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:20:04,690 INFO L85 PathProgramCache]: Analyzing trace with hash -1733455488, now seen corresponding path program 1 times [2025-03-09 01:20:04,690 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:20:04,690 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1338733285] [2025-03-09 01:20:04,690 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:20:04,691 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:20:04,695 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 29 statements into 1 equivalence classes. [2025-03-09 01:20:04,701 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 29 of 29 statements. [2025-03-09 01:20:04,702 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:20:04,702 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:20:04,872 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 3 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-09 01:20:04,872 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:20:04,872 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1338733285] [2025-03-09 01:20:04,872 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1338733285] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 01:20:04,873 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1545577510] [2025-03-09 01:20:04,873 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:20:04,873 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 01:20:04,873 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 01:20:04,875 INFO L229 MonitoredProcess]: Starting monitored process 22 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-09 01:20:04,876 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Waiting until timeout for monitored process [2025-03-09 01:20:04,927 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 29 statements into 1 equivalence classes. [2025-03-09 01:20:04,947 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 29 of 29 statements. [2025-03-09 01:20:04,947 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:20:04,947 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:20:04,950 INFO L256 TraceCheckSpWp]: Trace formula consists of 221 conjuncts, 15 conjuncts are in the unsatisfiable core [2025-03-09 01:20:04,951 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 01:20:05,069 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-09 01:20:05,069 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 01:20:05,293 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-09 01:20:05,294 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1545577510] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-09 01:20:05,294 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-09 01:20:05,294 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 7, 7] total 22 [2025-03-09 01:20:05,294 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [792244902] [2025-03-09 01:20:05,294 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-09 01:20:05,294 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2025-03-09 01:20:05,294 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:20:05,295 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2025-03-09 01:20:05,295 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=90, Invalid=416, Unknown=0, NotChecked=0, Total=506 [2025-03-09 01:20:05,508 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 34 out of 60 [2025-03-09 01:20:05,509 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 204 places, 174 transitions, 2437 flow. Second operand has 23 states, 23 states have (on average 36.608695652173914) internal successors, (842), 23 states have internal predecessors, (842), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:20:05,509 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 01:20:05,509 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 34 of 60 [2025-03-09 01:20:05,509 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 01:20:06,990 INFO L124 PetriNetUnfolderBase]: 4806/12006 cut-off events. [2025-03-09 01:20:06,990 INFO L125 PetriNetUnfolderBase]: For 74997/75425 co-relation queries the response was YES. [2025-03-09 01:20:07,034 INFO L83 FinitePrefix]: Finished finitePrefix Result has 45913 conditions, 12006 events. 4806/12006 cut-off events. For 74997/75425 co-relation queries the response was YES. Maximal size of possible extension queue 516. Compared 121760 event pairs, 2219 based on Foata normal form. 112/11884 useless extension candidates. Maximal degree in co-relation 42532. Up to 7001 conditions per place. [2025-03-09 01:20:07,061 INFO L140 encePairwiseOnDemand]: 48/60 looper letters, 151 selfloop transitions, 63 changer transitions 2/257 dead transitions. [2025-03-09 01:20:07,061 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 221 places, 257 transitions, 3327 flow [2025-03-09 01:20:07,062 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2025-03-09 01:20:07,062 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2025-03-09 01:20:07,062 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 739 transitions. [2025-03-09 01:20:07,062 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6842592592592592 [2025-03-09 01:20:07,062 INFO L175 Difference]: Start difference. First operand has 204 places, 174 transitions, 2437 flow. Second operand 18 states and 739 transitions. [2025-03-09 01:20:07,063 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 221 places, 257 transitions, 3327 flow [2025-03-09 01:20:07,160 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 213 places, 257 transitions, 3213 flow, removed 0 selfloop flow, removed 8 redundant places. [2025-03-09 01:20:07,163 INFO L231 Difference]: Finished difference. Result has 216 places, 187 transitions, 2624 flow [2025-03-09 01:20:07,163 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=60, PETRI_DIFFERENCE_MINUEND_FLOW=2327, PETRI_DIFFERENCE_MINUEND_PLACES=196, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=174, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=52, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=118, PETRI_DIFFERENCE_SUBTRAHEND_STATES=18, PETRI_FLOW=2624, PETRI_PLACES=216, PETRI_TRANSITIONS=187} [2025-03-09 01:20:07,163 INFO L279 CegarLoopForPetriNet]: 58 programPoint places, 158 predicate places. [2025-03-09 01:20:07,163 INFO L471 AbstractCegarLoop]: Abstraction has has 216 places, 187 transitions, 2624 flow [2025-03-09 01:20:07,164 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 36.608695652173914) internal successors, (842), 23 states have internal predecessors, (842), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:20:07,164 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 01:20:07,164 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 01:20:07,170 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Forceful destruction successful, exit code 0 [2025-03-09 01:20:07,364 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31,22 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 01:20:07,365 INFO L396 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 37 more)] === [2025-03-09 01:20:07,365 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:20:07,365 INFO L85 PathProgramCache]: Analyzing trace with hash -1349350619, now seen corresponding path program 1 times [2025-03-09 01:20:07,365 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:20:07,365 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [873202360] [2025-03-09 01:20:07,365 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:20:07,365 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:20:07,369 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 30 statements into 1 equivalence classes. [2025-03-09 01:20:07,375 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 30 of 30 statements. [2025-03-09 01:20:07,375 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:20:07,375 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:20:07,581 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-09 01:20:07,582 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:20:07,582 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [873202360] [2025-03-09 01:20:07,582 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [873202360] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 01:20:07,582 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 01:20:07,582 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-03-09 01:20:07,582 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1553795276] [2025-03-09 01:20:07,582 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 01:20:07,582 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-03-09 01:20:07,582 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:20:07,582 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-03-09 01:20:07,582 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=95, Unknown=0, NotChecked=0, Total=132 [2025-03-09 01:20:07,836 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 30 out of 60 [2025-03-09 01:20:07,836 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 216 places, 187 transitions, 2624 flow. Second operand has 12 states, 12 states have (on average 32.083333333333336) internal successors, (385), 12 states have internal predecessors, (385), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:20:07,837 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 01:20:07,837 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 30 of 60 [2025-03-09 01:20:07,837 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 01:20:09,628 INFO L124 PetriNetUnfolderBase]: 9232/18698 cut-off events. [2025-03-09 01:20:09,628 INFO L125 PetriNetUnfolderBase]: For 103180/103671 co-relation queries the response was YES. [2025-03-09 01:20:09,729 INFO L83 FinitePrefix]: Finished finitePrefix Result has 74278 conditions, 18698 events. 9232/18698 cut-off events. For 103180/103671 co-relation queries the response was YES. Maximal size of possible extension queue 650. Compared 170891 event pairs, 3946 based on Foata normal form. 132/18799 useless extension candidates. Maximal degree in co-relation 68229. Up to 9379 conditions per place. [2025-03-09 01:20:09,784 INFO L140 encePairwiseOnDemand]: 48/60 looper letters, 321 selfloop transitions, 74 changer transitions 0/408 dead transitions. [2025-03-09 01:20:09,784 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 226 places, 408 transitions, 6220 flow [2025-03-09 01:20:09,784 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-09 01:20:09,784 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2025-03-09 01:20:09,784 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 427 transitions. [2025-03-09 01:20:09,785 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.646969696969697 [2025-03-09 01:20:09,785 INFO L175 Difference]: Start difference. First operand has 216 places, 187 transitions, 2624 flow. Second operand 11 states and 427 transitions. [2025-03-09 01:20:09,785 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 226 places, 408 transitions, 6220 flow [2025-03-09 01:20:09,992 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 218 places, 408 transitions, 6149 flow, removed 17 selfloop flow, removed 8 redundant places. [2025-03-09 01:20:09,995 INFO L231 Difference]: Finished difference. Result has 223 places, 207 transitions, 3135 flow [2025-03-09 01:20:09,996 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=60, PETRI_DIFFERENCE_MINUEND_FLOW=2577, PETRI_DIFFERENCE_MINUEND_PLACES=208, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=187, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=54, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=113, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=3135, PETRI_PLACES=223, PETRI_TRANSITIONS=207} [2025-03-09 01:20:09,996 INFO L279 CegarLoopForPetriNet]: 58 programPoint places, 165 predicate places. [2025-03-09 01:20:09,996 INFO L471 AbstractCegarLoop]: Abstraction has has 223 places, 207 transitions, 3135 flow [2025-03-09 01:20:09,996 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 32.083333333333336) internal successors, (385), 12 states have internal predecessors, (385), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:20:09,996 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 01:20:09,996 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 01:20:09,996 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2025-03-09 01:20:09,996 INFO L396 AbstractCegarLoop]: === Iteration 34 === Targeting thread2Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 37 more)] === [2025-03-09 01:20:09,997 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:20:09,997 INFO L85 PathProgramCache]: Analyzing trace with hash -1366349545, now seen corresponding path program 3 times [2025-03-09 01:20:09,997 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:20:09,997 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1955044465] [2025-03-09 01:20:09,997 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-09 01:20:09,997 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:20:10,002 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 30 statements into 7 equivalence classes. [2025-03-09 01:20:10,013 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) and asserted 27 of 30 statements. [2025-03-09 01:20:10,013 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2025-03-09 01:20:10,014 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:20:10,157 INFO L134 CoverageAnalysis]: Checked inductivity of 79 backedges. 34 proven. 17 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2025-03-09 01:20:10,158 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:20:10,158 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1955044465] [2025-03-09 01:20:10,158 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1955044465] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 01:20:10,158 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [472848084] [2025-03-09 01:20:10,158 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-09 01:20:10,158 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 01:20:10,158 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 01:20:10,160 INFO L229 MonitoredProcess]: Starting monitored process 23 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-09 01:20:10,162 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Waiting until timeout for monitored process [2025-03-09 01:20:10,208 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 30 statements into 7 equivalence classes. [2025-03-09 01:20:10,241 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) and asserted 27 of 30 statements. [2025-03-09 01:20:10,241 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2025-03-09 01:20:10,242 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:20:10,242 INFO L256 TraceCheckSpWp]: Trace formula consists of 226 conjuncts, 25 conjuncts are in the unsatisfiable core [2025-03-09 01:20:10,243 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 01:20:10,442 INFO L134 CoverageAnalysis]: Checked inductivity of 79 backedges. 41 proven. 10 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2025-03-09 01:20:10,442 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 01:20:10,559 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 18 treesize of output 14 [2025-03-09 01:20:10,615 INFO L134 CoverageAnalysis]: Checked inductivity of 79 backedges. 33 proven. 18 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2025-03-09 01:20:10,615 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [472848084] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-09 01:20:10,615 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-09 01:20:10,615 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 11, 11] total 29 [2025-03-09 01:20:10,615 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1785727733] [2025-03-09 01:20:10,615 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-09 01:20:10,616 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2025-03-09 01:20:10,616 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:20:10,616 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2025-03-09 01:20:10,616 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=140, Invalid=730, Unknown=0, NotChecked=0, Total=870 [2025-03-09 01:20:11,223 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 29 out of 60 [2025-03-09 01:20:11,224 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 223 places, 207 transitions, 3135 flow. Second operand has 30 states, 30 states have (on average 30.733333333333334) internal successors, (922), 30 states have internal predecessors, (922), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:20:11,224 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 01:20:11,224 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 29 of 60 [2025-03-09 01:20:11,224 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 01:20:13,399 INFO L124 PetriNetUnfolderBase]: 8588/17419 cut-off events. [2025-03-09 01:20:13,399 INFO L125 PetriNetUnfolderBase]: For 115836/115956 co-relation queries the response was YES. [2025-03-09 01:20:13,525 INFO L83 FinitePrefix]: Finished finitePrefix Result has 75295 conditions, 17419 events. 8588/17419 cut-off events. For 115836/115956 co-relation queries the response was YES. Maximal size of possible extension queue 594. Compared 157150 event pairs, 1906 based on Foata normal form. 156/17407 useless extension candidates. Maximal degree in co-relation 67326. Up to 4407 conditions per place. [2025-03-09 01:20:13,580 INFO L140 encePairwiseOnDemand]: 49/60 looper letters, 292 selfloop transitions, 90 changer transitions 1/405 dead transitions. [2025-03-09 01:20:13,580 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 239 places, 405 transitions, 6017 flow [2025-03-09 01:20:13,580 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2025-03-09 01:20:13,581 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2025-03-09 01:20:13,581 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 636 transitions. [2025-03-09 01:20:13,581 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6235294117647059 [2025-03-09 01:20:13,581 INFO L175 Difference]: Start difference. First operand has 223 places, 207 transitions, 3135 flow. Second operand 17 states and 636 transitions. [2025-03-09 01:20:13,581 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 239 places, 405 transitions, 6017 flow [2025-03-09 01:20:13,841 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 233 places, 405 transitions, 5657 flow, removed 31 selfloop flow, removed 6 redundant places. [2025-03-09 01:20:13,844 INFO L231 Difference]: Finished difference. Result has 236 places, 216 transitions, 3283 flow [2025-03-09 01:20:13,845 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=60, PETRI_DIFFERENCE_MINUEND_FLOW=2956, PETRI_DIFFERENCE_MINUEND_PLACES=217, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=207, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=81, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=124, PETRI_DIFFERENCE_SUBTRAHEND_STATES=17, PETRI_FLOW=3283, PETRI_PLACES=236, PETRI_TRANSITIONS=216} [2025-03-09 01:20:13,845 INFO L279 CegarLoopForPetriNet]: 58 programPoint places, 178 predicate places. [2025-03-09 01:20:13,845 INFO L471 AbstractCegarLoop]: Abstraction has has 236 places, 216 transitions, 3283 flow [2025-03-09 01:20:13,845 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 30 states have (on average 30.733333333333334) internal successors, (922), 30 states have internal predecessors, (922), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:20:13,845 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 01:20:13,845 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 01:20:13,851 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Ended with exit code 0 [2025-03-09 01:20:14,046 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33,23 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 01:20:14,046 INFO L396 AbstractCegarLoop]: === Iteration 35 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 37 more)] === [2025-03-09 01:20:14,046 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:20:14,046 INFO L85 PathProgramCache]: Analyzing trace with hash -2132278109, now seen corresponding path program 1 times [2025-03-09 01:20:14,047 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:20:14,047 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1177633925] [2025-03-09 01:20:14,047 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:20:14,047 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:20:14,051 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 30 statements into 1 equivalence classes. [2025-03-09 01:20:14,057 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 30 of 30 statements. [2025-03-09 01:20:14,057 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:20:14,057 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:20:14,253 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-09 01:20:14,253 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:20:14,253 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1177633925] [2025-03-09 01:20:14,253 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1177633925] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 01:20:14,253 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 01:20:14,253 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-03-09 01:20:14,253 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1559065398] [2025-03-09 01:20:14,253 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 01:20:14,253 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-03-09 01:20:14,254 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:20:14,254 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-03-09 01:20:14,254 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=96, Unknown=0, NotChecked=0, Total=132 [2025-03-09 01:20:14,465 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 30 out of 60 [2025-03-09 01:20:14,465 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 236 places, 216 transitions, 3283 flow. Second operand has 12 states, 12 states have (on average 32.083333333333336) internal successors, (385), 12 states have internal predecessors, (385), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:20:14,465 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 01:20:14,465 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 30 of 60 [2025-03-09 01:20:14,465 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 01:20:16,753 INFO L124 PetriNetUnfolderBase]: 10818/21585 cut-off events. [2025-03-09 01:20:16,753 INFO L125 PetriNetUnfolderBase]: For 149594/150041 co-relation queries the response was YES. [2025-03-09 01:20:16,894 INFO L83 FinitePrefix]: Finished finitePrefix Result has 95533 conditions, 21585 events. 10818/21585 cut-off events. For 149594/150041 co-relation queries the response was YES. Maximal size of possible extension queue 685. Compared 195785 event pairs, 5390 based on Foata normal form. 192/21745 useless extension candidates. Maximal degree in co-relation 85904. Up to 10729 conditions per place. [2025-03-09 01:20:16,962 INFO L140 encePairwiseOnDemand]: 48/60 looper letters, 333 selfloop transitions, 110 changer transitions 9/465 dead transitions. [2025-03-09 01:20:16,962 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 246 places, 465 transitions, 8021 flow [2025-03-09 01:20:16,963 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-09 01:20:16,963 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2025-03-09 01:20:16,963 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 430 transitions. [2025-03-09 01:20:16,963 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6515151515151515 [2025-03-09 01:20:16,963 INFO L175 Difference]: Start difference. First operand has 236 places, 216 transitions, 3283 flow. Second operand 11 states and 430 transitions. [2025-03-09 01:20:16,963 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 246 places, 465 transitions, 8021 flow [2025-03-09 01:20:17,363 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 239 places, 465 transitions, 7895 flow, removed 23 selfloop flow, removed 7 redundant places. [2025-03-09 01:20:17,368 INFO L231 Difference]: Finished difference. Result has 244 places, 273 transitions, 4723 flow [2025-03-09 01:20:17,368 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=60, PETRI_DIFFERENCE_MINUEND_FLOW=3185, PETRI_DIFFERENCE_MINUEND_PLACES=229, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=216, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=53, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=137, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=4723, PETRI_PLACES=244, PETRI_TRANSITIONS=273} [2025-03-09 01:20:17,368 INFO L279 CegarLoopForPetriNet]: 58 programPoint places, 186 predicate places. [2025-03-09 01:20:17,368 INFO L471 AbstractCegarLoop]: Abstraction has has 244 places, 273 transitions, 4723 flow [2025-03-09 01:20:17,369 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 32.083333333333336) internal successors, (385), 12 states have internal predecessors, (385), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:20:17,369 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 01:20:17,369 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 01:20:17,369 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2025-03-09 01:20:17,369 INFO L396 AbstractCegarLoop]: === Iteration 36 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 37 more)] === [2025-03-09 01:20:17,369 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:20:17,369 INFO L85 PathProgramCache]: Analyzing trace with hash -1892763819, now seen corresponding path program 2 times [2025-03-09 01:20:17,369 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:20:17,370 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1877184231] [2025-03-09 01:20:17,370 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-09 01:20:17,370 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:20:17,374 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 30 statements into 2 equivalence classes. [2025-03-09 01:20:17,377 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 24 of 30 statements. [2025-03-09 01:20:17,377 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-09 01:20:17,377 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:20:17,501 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2025-03-09 01:20:17,502 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:20:17,502 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1877184231] [2025-03-09 01:20:17,502 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1877184231] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 01:20:17,502 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 01:20:17,502 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-03-09 01:20:17,502 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1376087334] [2025-03-09 01:20:17,502 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 01:20:17,502 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-09 01:20:17,502 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:20:17,503 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-09 01:20:17,503 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2025-03-09 01:20:17,636 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 30 out of 60 [2025-03-09 01:20:17,637 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 244 places, 273 transitions, 4723 flow. Second operand has 10 states, 10 states have (on average 32.5) internal successors, (325), 10 states have internal predecessors, (325), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:20:17,637 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 01:20:17,637 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 30 of 60 [2025-03-09 01:20:17,637 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 01:20:20,293 INFO L124 PetriNetUnfolderBase]: 11418/22928 cut-off events. [2025-03-09 01:20:20,293 INFO L125 PetriNetUnfolderBase]: For 208803/209282 co-relation queries the response was YES. [2025-03-09 01:20:20,466 INFO L83 FinitePrefix]: Finished finitePrefix Result has 111235 conditions, 22928 events. 11418/22928 cut-off events. For 208803/209282 co-relation queries the response was YES. Maximal size of possible extension queue 753. Compared 210215 event pairs, 5383 based on Foata normal form. 139/22991 useless extension candidates. Maximal degree in co-relation 99386. Up to 11446 conditions per place. [2025-03-09 01:20:20,543 INFO L140 encePairwiseOnDemand]: 50/60 looper letters, 269 selfloop transitions, 188 changer transitions 2/472 dead transitions. [2025-03-09 01:20:20,543 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 252 places, 472 transitions, 8939 flow [2025-03-09 01:20:20,544 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-09 01:20:20,544 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2025-03-09 01:20:20,544 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 364 transitions. [2025-03-09 01:20:20,544 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.674074074074074 [2025-03-09 01:20:20,544 INFO L175 Difference]: Start difference. First operand has 244 places, 273 transitions, 4723 flow. Second operand 9 states and 364 transitions. [2025-03-09 01:20:20,544 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 252 places, 472 transitions, 8939 flow [2025-03-09 01:20:21,096 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 246 places, 472 transitions, 8574 flow, removed 48 selfloop flow, removed 6 redundant places. [2025-03-09 01:20:21,101 INFO L231 Difference]: Finished difference. Result has 252 places, 378 transitions, 7516 flow [2025-03-09 01:20:21,102 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=60, PETRI_DIFFERENCE_MINUEND_FLOW=4480, PETRI_DIFFERENCE_MINUEND_PLACES=238, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=273, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=103, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=144, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=7516, PETRI_PLACES=252, PETRI_TRANSITIONS=378} [2025-03-09 01:20:21,102 INFO L279 CegarLoopForPetriNet]: 58 programPoint places, 194 predicate places. [2025-03-09 01:20:21,102 INFO L471 AbstractCegarLoop]: Abstraction has has 252 places, 378 transitions, 7516 flow [2025-03-09 01:20:21,102 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 32.5) internal successors, (325), 10 states have internal predecessors, (325), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:20:21,102 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 01:20:21,102 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 01:20:21,103 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35 [2025-03-09 01:20:21,103 INFO L396 AbstractCegarLoop]: === Iteration 37 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 37 more)] === [2025-03-09 01:20:21,103 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:20:21,103 INFO L85 PathProgramCache]: Analyzing trace with hash -1782900283, now seen corresponding path program 3 times [2025-03-09 01:20:21,103 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:20:21,103 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1181136646] [2025-03-09 01:20:21,103 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-09 01:20:21,103 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:20:21,107 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 30 statements into 4 equivalence classes. [2025-03-09 01:20:21,117 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 27 of 30 statements. [2025-03-09 01:20:21,117 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-03-09 01:20:21,117 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:20:21,197 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2025-03-09 01:20:21,197 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:20:21,197 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1181136646] [2025-03-09 01:20:21,197 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1181136646] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 01:20:21,197 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [759644208] [2025-03-09 01:20:21,197 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-09 01:20:21,197 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 01:20:21,197 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 01:20:21,199 INFO L229 MonitoredProcess]: Starting monitored process 24 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-09 01:20:21,200 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Waiting until timeout for monitored process [2025-03-09 01:20:21,247 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 30 statements into 4 equivalence classes. [2025-03-09 01:20:21,261 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 27 of 30 statements. [2025-03-09 01:20:21,261 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-03-09 01:20:21,261 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:20:21,262 INFO L256 TraceCheckSpWp]: Trace formula consists of 197 conjuncts, 19 conjuncts are in the unsatisfiable core [2025-03-09 01:20:21,262 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 01:20:21,329 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2025-03-09 01:20:21,334 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2025-03-09 01:20:21,335 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 01:20:21,439 INFO L349 Elim1Store]: treesize reduction 28, result has 59.4 percent of original size [2025-03-09 01:20:21,439 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 32 treesize of output 48 [2025-03-09 01:20:21,449 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2025-03-09 01:20:21,449 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [759644208] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-09 01:20:21,449 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-09 01:20:21,449 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 17 [2025-03-09 01:20:21,449 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [625007356] [2025-03-09 01:20:21,449 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-09 01:20:21,449 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2025-03-09 01:20:21,450 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:20:21,450 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2025-03-09 01:20:21,450 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=218, Unknown=0, NotChecked=0, Total=272 [2025-03-09 01:20:21,968 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 30 out of 60 [2025-03-09 01:20:21,969 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 252 places, 378 transitions, 7516 flow. Second operand has 17 states, 17 states have (on average 32.1764705882353) internal successors, (547), 17 states have internal predecessors, (547), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:20:21,969 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 01:20:21,969 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 30 of 60 [2025-03-09 01:20:21,969 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 01:20:25,244 INFO L124 PetriNetUnfolderBase]: 12455/24493 cut-off events. [2025-03-09 01:20:25,244 INFO L125 PetriNetUnfolderBase]: For 251935/252442 co-relation queries the response was YES. [2025-03-09 01:20:25,453 INFO L83 FinitePrefix]: Finished finitePrefix Result has 126452 conditions, 24493 events. 12455/24493 cut-off events. For 251935/252442 co-relation queries the response was YES. Maximal size of possible extension queue 812. Compared 223877 event pairs, 5578 based on Foata normal form. 195/24651 useless extension candidates. Maximal degree in co-relation 112190. Up to 11771 conditions per place. [2025-03-09 01:20:25,545 INFO L140 encePairwiseOnDemand]: 50/60 looper letters, 402 selfloop transitions, 189 changer transitions 4/608 dead transitions. [2025-03-09 01:20:25,545 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 260 places, 608 transitions, 12691 flow [2025-03-09 01:20:25,545 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-09 01:20:25,545 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2025-03-09 01:20:25,545 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 364 transitions. [2025-03-09 01:20:25,546 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.674074074074074 [2025-03-09 01:20:25,546 INFO L175 Difference]: Start difference. First operand has 252 places, 378 transitions, 7516 flow. Second operand 9 states and 364 transitions. [2025-03-09 01:20:25,546 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 260 places, 608 transitions, 12691 flow [2025-03-09 01:20:26,919 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 260 places, 608 transitions, 12023 flow, removed 334 selfloop flow, removed 0 redundant places. [2025-03-09 01:20:26,927 INFO L231 Difference]: Finished difference. Result has 265 places, 452 transitions, 9343 flow [2025-03-09 01:20:26,927 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=60, PETRI_DIFFERENCE_MINUEND_FLOW=7126, PETRI_DIFFERENCE_MINUEND_PLACES=252, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=378, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=115, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=230, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=9343, PETRI_PLACES=265, PETRI_TRANSITIONS=452} [2025-03-09 01:20:26,927 INFO L279 CegarLoopForPetriNet]: 58 programPoint places, 207 predicate places. [2025-03-09 01:20:26,927 INFO L471 AbstractCegarLoop]: Abstraction has has 265 places, 452 transitions, 9343 flow [2025-03-09 01:20:26,927 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 32.1764705882353) internal successors, (547), 17 states have internal predecessors, (547), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:20:26,927 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 01:20:26,927 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 01:20:26,934 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Ended with exit code 0 [2025-03-09 01:20:27,128 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36,24 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 01:20:27,128 INFO L396 AbstractCegarLoop]: === Iteration 38 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 37 more)] === [2025-03-09 01:20:27,128 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:20:27,128 INFO L85 PathProgramCache]: Analyzing trace with hash -1765115199, now seen corresponding path program 4 times [2025-03-09 01:20:27,129 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:20:27,129 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1665691861] [2025-03-09 01:20:27,129 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-09 01:20:27,129 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:20:27,134 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 30 statements into 2 equivalence classes. [2025-03-09 01:20:27,137 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) and asserted 25 of 30 statements. [2025-03-09 01:20:27,139 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) [2025-03-09 01:20:27,140 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:20:27,206 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2025-03-09 01:20:27,206 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:20:27,206 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1665691861] [2025-03-09 01:20:27,206 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1665691861] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 01:20:27,206 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [747646213] [2025-03-09 01:20:27,206 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-09 01:20:27,206 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 01:20:27,206 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 01:20:27,208 INFO L229 MonitoredProcess]: Starting monitored process 25 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-09 01:20:27,209 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (25)] Waiting until timeout for monitored process [2025-03-09 01:20:27,257 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 30 statements into 2 equivalence classes. [2025-03-09 01:20:27,267 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) and asserted 25 of 30 statements. [2025-03-09 01:20:27,267 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) [2025-03-09 01:20:27,267 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:20:27,268 INFO L256 TraceCheckSpWp]: Trace formula consists of 140 conjuncts, 15 conjuncts are in the unsatisfiable core [2025-03-09 01:20:27,269 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 01:20:27,339 INFO L349 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2025-03-09 01:20:27,339 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 10 [2025-03-09 01:20:27,340 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2025-03-09 01:20:27,340 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 01:20:27,410 INFO L349 Elim1Store]: treesize reduction 28, result has 63.6 percent of original size [2025-03-09 01:20:27,410 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 40 treesize of output 56 [2025-03-09 01:20:27,434 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2025-03-09 01:20:27,434 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [747646213] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-09 01:20:27,434 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-09 01:20:27,434 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 16 [2025-03-09 01:20:27,438 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1364611984] [2025-03-09 01:20:27,439 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-09 01:20:27,440 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2025-03-09 01:20:27,440 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:20:27,440 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2025-03-09 01:20:27,440 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=190, Unknown=0, NotChecked=0, Total=240 [2025-03-09 01:20:27,908 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 30 out of 60 [2025-03-09 01:20:27,909 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 265 places, 452 transitions, 9343 flow. Second operand has 16 states, 16 states have (on average 32.1875) internal successors, (515), 16 states have internal predecessors, (515), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:20:27,909 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 01:20:27,909 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 30 of 60 [2025-03-09 01:20:27,909 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 01:20:32,464 INFO L124 PetriNetUnfolderBase]: 13117/26149 cut-off events. [2025-03-09 01:20:32,465 INFO L125 PetriNetUnfolderBase]: For 248634/249152 co-relation queries the response was YES. [2025-03-09 01:20:32,635 INFO L83 FinitePrefix]: Finished finitePrefix Result has 134362 conditions, 26149 events. 13117/26149 cut-off events. For 248634/249152 co-relation queries the response was YES. Maximal size of possible extension queue 849. Compared 242383 event pairs, 5289 based on Foata normal form. 191/26301 useless extension candidates. Maximal degree in co-relation 119760. Up to 11885 conditions per place. [2025-03-09 01:20:32,735 INFO L140 encePairwiseOnDemand]: 48/60 looper letters, 324 selfloop transitions, 267 changer transitions 5/609 dead transitions. [2025-03-09 01:20:32,735 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 274 places, 609 transitions, 12476 flow [2025-03-09 01:20:32,735 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-09 01:20:32,735 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2025-03-09 01:20:32,736 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 414 transitions. [2025-03-09 01:20:32,736 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.69 [2025-03-09 01:20:32,736 INFO L175 Difference]: Start difference. First operand has 265 places, 452 transitions, 9343 flow. Second operand 10 states and 414 transitions. [2025-03-09 01:20:32,736 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 274 places, 609 transitions, 12476 flow [2025-03-09 01:20:33,814 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 272 places, 609 transitions, 12201 flow, removed 45 selfloop flow, removed 2 redundant places. [2025-03-09 01:20:33,823 INFO L231 Difference]: Finished difference. Result has 275 places, 467 transitions, 10023 flow [2025-03-09 01:20:33,824 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=60, PETRI_DIFFERENCE_MINUEND_FLOW=9094, PETRI_DIFFERENCE_MINUEND_PLACES=263, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=452, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=252, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=197, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=10023, PETRI_PLACES=275, PETRI_TRANSITIONS=467} [2025-03-09 01:20:33,824 INFO L279 CegarLoopForPetriNet]: 58 programPoint places, 217 predicate places. [2025-03-09 01:20:33,824 INFO L471 AbstractCegarLoop]: Abstraction has has 275 places, 467 transitions, 10023 flow [2025-03-09 01:20:33,824 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 32.1875) internal successors, (515), 16 states have internal predecessors, (515), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:20:33,824 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 01:20:33,825 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 01:20:33,832 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (25)] Forceful destruction successful, exit code 0 [2025-03-09 01:20:34,025 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 25 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable37 [2025-03-09 01:20:34,025 INFO L396 AbstractCegarLoop]: === Iteration 39 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 37 more)] === [2025-03-09 01:20:34,026 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:20:34,026 INFO L85 PathProgramCache]: Analyzing trace with hash -2098474335, now seen corresponding path program 2 times [2025-03-09 01:20:34,026 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:20:34,026 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1399047208] [2025-03-09 01:20:34,026 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-09 01:20:34,026 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:20:34,032 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 30 statements into 2 equivalence classes. [2025-03-09 01:20:34,043 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 30 of 30 statements. [2025-03-09 01:20:34,043 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-09 01:20:34,043 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:20:34,635 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 5 proven. 10 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-09 01:20:34,636 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:20:34,636 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1399047208] [2025-03-09 01:20:34,636 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1399047208] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 01:20:34,636 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1222510310] [2025-03-09 01:20:34,636 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-09 01:20:34,636 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 01:20:34,636 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 01:20:34,638 INFO L229 MonitoredProcess]: Starting monitored process 26 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-09 01:20:34,640 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (26)] Waiting until timeout for monitored process [2025-03-09 01:20:34,698 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 30 statements into 2 equivalence classes. [2025-03-09 01:20:34,718 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 30 of 30 statements. [2025-03-09 01:20:34,719 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-09 01:20:34,720 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:20:34,721 INFO L256 TraceCheckSpWp]: Trace formula consists of 235 conjuncts, 25 conjuncts are in the unsatisfiable core [2025-03-09 01:20:34,723 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 01:20:34,966 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2025-03-09 01:20:34,967 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 10 [2025-03-09 01:20:34,985 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 11 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-09 01:20:34,986 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 01:20:35,148 INFO L349 Elim1Store]: treesize reduction 28, result has 59.4 percent of original size [2025-03-09 01:20:35,148 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 32 treesize of output 48 [2025-03-09 01:20:35,194 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2025-03-09 01:20:35,194 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1222510310] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-09 01:20:35,194 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-09 01:20:35,194 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 11, 9] total 30 [2025-03-09 01:20:35,194 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1922226493] [2025-03-09 01:20:35,194 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-09 01:20:35,194 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2025-03-09 01:20:35,194 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:20:35,199 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2025-03-09 01:20:35,199 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=95, Invalid=775, Unknown=0, NotChecked=0, Total=870 [2025-03-09 01:20:37,190 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 24 out of 60 [2025-03-09 01:20:37,191 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 275 places, 467 transitions, 10023 flow. Second operand has 30 states, 30 states have (on average 26.266666666666666) internal successors, (788), 30 states have internal predecessors, (788), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:20:37,191 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 01:20:37,191 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 24 of 60 [2025-03-09 01:20:37,191 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 01:20:43,625 INFO L124 PetriNetUnfolderBase]: 17525/33477 cut-off events. [2025-03-09 01:20:43,626 INFO L125 PetriNetUnfolderBase]: For 319328/319737 co-relation queries the response was YES. [2025-03-09 01:20:43,896 INFO L83 FinitePrefix]: Finished finitePrefix Result has 169432 conditions, 33477 events. 17525/33477 cut-off events. For 319328/319737 co-relation queries the response was YES. Maximal size of possible extension queue 966. Compared 304795 event pairs, 1450 based on Foata normal form. 146/33617 useless extension candidates. Maximal degree in co-relation 152469. Up to 12954 conditions per place. [2025-03-09 01:20:44,025 INFO L140 encePairwiseOnDemand]: 43/60 looper letters, 656 selfloop transitions, 238 changer transitions 20/921 dead transitions. [2025-03-09 01:20:44,025 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 303 places, 921 transitions, 17600 flow [2025-03-09 01:20:44,025 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2025-03-09 01:20:44,025 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2025-03-09 01:20:44,026 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 944 transitions. [2025-03-09 01:20:44,027 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.542528735632184 [2025-03-09 01:20:44,027 INFO L175 Difference]: Start difference. First operand has 275 places, 467 transitions, 10023 flow. Second operand 29 states and 944 transitions. [2025-03-09 01:20:44,027 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 303 places, 921 transitions, 17600 flow [2025-03-09 01:20:46,167 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 298 places, 921 transitions, 17044 flow, removed 18 selfloop flow, removed 5 redundant places. [2025-03-09 01:20:46,178 INFO L231 Difference]: Finished difference. Result has 307 places, 512 transitions, 10819 flow [2025-03-09 01:20:46,178 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=60, PETRI_DIFFERENCE_MINUEND_FLOW=9612, PETRI_DIFFERENCE_MINUEND_PLACES=270, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=467, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=190, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=263, PETRI_DIFFERENCE_SUBTRAHEND_STATES=29, PETRI_FLOW=10819, PETRI_PLACES=307, PETRI_TRANSITIONS=512} [2025-03-09 01:20:46,178 INFO L279 CegarLoopForPetriNet]: 58 programPoint places, 249 predicate places. [2025-03-09 01:20:46,178 INFO L471 AbstractCegarLoop]: Abstraction has has 307 places, 512 transitions, 10819 flow [2025-03-09 01:20:46,179 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 30 states have (on average 26.266666666666666) internal successors, (788), 30 states have internal predecessors, (788), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:20:46,179 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 01:20:46,179 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 01:20:46,185 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (26)] Forceful destruction successful, exit code 0 [2025-03-09 01:20:46,383 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 26 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable38 [2025-03-09 01:20:46,383 INFO L396 AbstractCegarLoop]: === Iteration 40 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 37 more)] === [2025-03-09 01:20:46,383 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:20:46,383 INFO L85 PathProgramCache]: Analyzing trace with hash 1704649617, now seen corresponding path program 5 times [2025-03-09 01:20:46,383 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:20:46,383 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2125167777] [2025-03-09 01:20:46,384 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-09 01:20:46,384 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:20:46,389 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 30 statements into 4 equivalence classes. [2025-03-09 01:20:46,397 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) and asserted 30 of 30 statements. [2025-03-09 01:20:46,397 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2025-03-09 01:20:46,397 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:20:46,598 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2025-03-09 01:20:46,598 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:20:46,598 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2125167777] [2025-03-09 01:20:46,598 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2125167777] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 01:20:46,598 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [467829876] [2025-03-09 01:20:46,598 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-09 01:20:46,598 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 01:20:46,599 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 01:20:46,600 INFO L229 MonitoredProcess]: Starting monitored process 27 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-09 01:20:46,601 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (27)] Waiting until timeout for monitored process [2025-03-09 01:20:46,648 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 30 statements into 4 equivalence classes. [2025-03-09 01:20:46,665 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) and asserted 30 of 30 statements. [2025-03-09 01:20:46,665 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2025-03-09 01:20:46,665 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:20:46,666 INFO L256 TraceCheckSpWp]: Trace formula consists of 235 conjuncts, 31 conjuncts are in the unsatisfiable core [2025-03-09 01:20:46,667 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 01:20:46,868 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-03-09 01:20:46,868 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 15 [2025-03-09 01:20:46,880 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-09 01:20:46,880 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-09 01:20:46,880 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [467829876] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 01:20:46,880 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-09 01:20:46,880 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [11] total 23 [2025-03-09 01:20:46,881 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1397717402] [2025-03-09 01:20:46,881 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 01:20:46,881 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-03-09 01:20:46,881 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:20:46,881 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-03-09 01:20:46,881 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=94, Invalid=412, Unknown=0, NotChecked=0, Total=506 [2025-03-09 01:20:47,168 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 29 out of 60 [2025-03-09 01:20:47,168 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 307 places, 512 transitions, 10819 flow. Second operand has 14 states, 14 states have (on average 30.857142857142858) internal successors, (432), 14 states have internal predecessors, (432), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:20:47,168 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 01:20:47,168 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 29 of 60 [2025-03-09 01:20:47,168 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand