./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/weaver/popl20-more-multiply-verify.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/popl20-more-multiply-verify.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 d79cb5dae664e13779624ff0ffbc531b419f89e2c7510a92e890992a52ee7c98 --- Real Ultimate output --- This is Ultimate 0.3.0-?-e2fb8be-m [2025-03-09 01:26:59,042 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-09 01:26:59,097 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2025-03-09 01:26:59,100 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-09 01:26:59,100 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-09 01:26:59,125 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-09 01:26:59,126 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-09 01:26:59,126 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-09 01:26:59,126 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-09 01:26:59,126 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-09 01:26:59,126 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-09 01:26:59,127 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-09 01:26:59,127 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-09 01:26:59,127 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-09 01:26:59,127 INFO L153 SettingsManager]: * Use SBE=true [2025-03-09 01:26:59,127 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-09 01:26:59,127 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-09 01:26:59,127 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-09 01:26:59,127 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-09 01:26:59,127 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-09 01:26:59,127 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2025-03-09 01:26:59,128 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2025-03-09 01:26:59,128 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2025-03-09 01:26:59,128 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-09 01:26:59,128 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-03-09 01:26:59,128 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-03-09 01:26:59,128 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-09 01:26:59,128 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-09 01:26:59,128 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-09 01:26:59,128 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-09 01:26:59,128 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-09 01:26:59,128 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-09 01:26:59,128 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-09 01:26:59,129 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-09 01:26:59,129 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-09 01:26:59,129 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-09 01:26:59,129 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-09 01:26:59,129 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-09 01:26:59,129 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-09 01:26:59,129 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-09 01:26:59,129 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-09 01:26:59,129 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-09 01:26:59,129 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 -> d79cb5dae664e13779624ff0ffbc531b419f89e2c7510a92e890992a52ee7c98 [2025-03-09 01:26:59,375 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-09 01:26:59,385 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-09 01:26:59,387 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-09 01:26:59,388 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-09 01:26:59,388 INFO L274 PluginConnector]: CDTParser initialized [2025-03-09 01:26:59,389 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/weaver/popl20-more-multiply-verify.wvr.c [2025-03-09 01:27:00,661 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2fe8905e5/e4649926264f4d9a8e82192e952efd4c/FLAG1612682d6 [2025-03-09 01:27:00,920 INFO L384 CDTParser]: Found 1 translation units. [2025-03-09 01:27:00,920 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/weaver/popl20-more-multiply-verify.wvr.c [2025-03-09 01:27:00,928 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2fe8905e5/e4649926264f4d9a8e82192e952efd4c/FLAG1612682d6 [2025-03-09 01:27:00,943 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2fe8905e5/e4649926264f4d9a8e82192e952efd4c [2025-03-09 01:27:00,945 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-09 01:27:00,947 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-09 01:27:00,948 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-09 01:27:00,948 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-09 01:27:00,951 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-09 01:27:00,952 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.03 01:27:00" (1/1) ... [2025-03-09 01:27:00,953 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@73a7269b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:27:00, skipping insertion in model container [2025-03-09 01:27:00,953 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.03 01:27:00" (1/1) ... [2025-03-09 01:27:00,966 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-09 01:27:01,101 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:27:01,102 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-09 01:27:01,111 INFO L200 MainTranslator]: Completed pre-run [2025-03-09 01:27:01,129 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-09 01:27:01,140 INFO L204 MainTranslator]: Completed translation [2025-03-09 01:27:01,141 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:27:01 WrapperNode [2025-03-09 01:27:01,141 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-09 01:27:01,142 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-09 01:27:01,142 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-09 01:27:01,142 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-09 01:27:01,146 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:27:01" (1/1) ... [2025-03-09 01:27:01,152 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:27:01" (1/1) ... [2025-03-09 01:27:01,165 INFO L138 Inliner]: procedures = 25, calls = 36, calls flagged for inlining = 13, calls inlined = 13, statements flattened = 164 [2025-03-09 01:27:01,166 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-09 01:27:01,166 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-09 01:27:01,166 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-09 01:27:01,166 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-09 01:27:01,175 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:27:01" (1/1) ... [2025-03-09 01:27:01,175 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:27:01" (1/1) ... [2025-03-09 01:27:01,177 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:27:01" (1/1) ... [2025-03-09 01:27:01,198 INFO L175 MemorySlicer]: Split 7 memory accesses to 2 slices as follows [2, 5]. 71 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0]. The 1 writes are split as follows [0, 1]. [2025-03-09 01:27:01,201 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:27:01" (1/1) ... [2025-03-09 01:27:01,201 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:27:01" (1/1) ... [2025-03-09 01:27:01,208 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:27:01" (1/1) ... [2025-03-09 01:27:01,208 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:27:01" (1/1) ... [2025-03-09 01:27:01,210 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:27:01" (1/1) ... [2025-03-09 01:27:01,211 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:27:01" (1/1) ... [2025-03-09 01:27:01,213 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-09 01:27:01,214 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-09 01:27:01,214 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-09 01:27:01,214 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-09 01:27:01,215 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:27:01" (1/1) ... [2025-03-09 01:27:01,219 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-09 01:27:01,229 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 01:27:01,245 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:27:01,247 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:27:01,267 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-09 01:27:01,267 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2025-03-09 01:27:01,267 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2025-03-09 01:27:01,267 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2025-03-09 01:27:01,268 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2025-03-09 01:27:01,268 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2025-03-09 01:27:01,268 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2025-03-09 01:27:01,268 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-09 01:27:01,268 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-03-09 01:27:01,268 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-03-09 01:27:01,268 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-03-09 01:27:01,268 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2025-03-09 01:27:01,268 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2025-03-09 01:27:01,268 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-03-09 01:27:01,268 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-09 01:27:01,268 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-09 01:27:01,268 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-03-09 01:27:01,268 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-03-09 01:27:01,269 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:27:01,342 INFO L256 CfgBuilder]: Building ICFG [2025-03-09 01:27:01,343 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-09 01:27:01,627 INFO L303 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-03-09 01:27:01,627 INFO L307 CfgBuilder]: Performing block encoding [2025-03-09 01:27:01,799 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-09 01:27:01,799 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-09 01:27:01,799 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 09.03 01:27:01 BoogieIcfgContainer [2025-03-09 01:27:01,800 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-09 01:27:01,803 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-09 01:27:01,803 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-09 01:27:01,807 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-09 01:27:01,808 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.03 01:27:00" (1/3) ... [2025-03-09 01:27:01,808 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7969d1de and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.03 01:27:01, skipping insertion in model container [2025-03-09 01:27:01,809 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:27:01" (2/3) ... [2025-03-09 01:27:01,809 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7969d1de and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.03 01:27:01, skipping insertion in model container [2025-03-09 01:27:01,810 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 09.03 01:27:01" (3/3) ... [2025-03-09 01:27:01,811 INFO L128 eAbstractionObserver]: Analyzing ICFG popl20-more-multiply-verify.wvr.c [2025-03-09 01:27:01,823 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-09 01:27:01,824 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG popl20-more-multiply-verify.wvr.c that has 4 procedures, 47 locations, 1 initial locations, 3 loop locations, and 12 error locations. [2025-03-09 01:27:01,824 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-03-09 01:27:01,875 INFO L143 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2025-03-09 01:27:01,921 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 56 places, 49 transitions, 119 flow [2025-03-09 01:27:01,947 INFO L124 PetriNetUnfolderBase]: 3/46 cut-off events. [2025-03-09 01:27:01,948 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2025-03-09 01:27:01,954 INFO L83 FinitePrefix]: Finished finitePrefix Result has 59 conditions, 46 events. 3/46 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 91 event pairs, 0 based on Foata normal form. 0/31 useless extension candidates. Maximal degree in co-relation 35. Up to 2 conditions per place. [2025-03-09 01:27:01,954 INFO L82 GeneralOperation]: Start removeDead. Operand has 56 places, 49 transitions, 119 flow [2025-03-09 01:27:01,956 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 52 places, 45 transitions, 108 flow [2025-03-09 01:27:01,962 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-09 01:27:01,971 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;@5894cca5, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-09 01:27:01,971 INFO L334 AbstractCegarLoop]: Starting to check reachability of 23 error locations. [2025-03-09 01:27:01,974 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-09 01:27:01,975 INFO L124 PetriNetUnfolderBase]: 1/4 cut-off events. [2025-03-09 01:27:01,975 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-09 01:27:01,975 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 01:27:01,976 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2025-03-09 01:27:01,976 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 20 more)] === [2025-03-09 01:27:01,979 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:27:01,980 INFO L85 PathProgramCache]: Analyzing trace with hash 449591, now seen corresponding path program 1 times [2025-03-09 01:27:01,984 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:27:01,984 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [370274254] [2025-03-09 01:27:01,986 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:27:01,987 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:27:02,041 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-03-09 01:27:02,059 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-03-09 01:27:02,060 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:27:02,060 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:27:02,182 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:27:02,182 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:27:02,182 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [370274254] [2025-03-09 01:27:02,183 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [370274254] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 01:27:02,183 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 01:27:02,183 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-03-09 01:27:02,184 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [585717234] [2025-03-09 01:27:02,185 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 01:27:02,191 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-09 01:27:02,194 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:27:02,211 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-09 01:27:02,212 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-09 01:27:02,228 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 49 [2025-03-09 01:27:02,230 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 52 places, 45 transitions, 108 flow. Second operand has 3 states, 3 states have (on average 15.0) internal successors, (45), 3 states have internal predecessors, (45), 0 states have call successors, (0), 0 states 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:27:02,230 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 01:27:02,230 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 49 [2025-03-09 01:27:02,231 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 01:27:02,530 INFO L124 PetriNetUnfolderBase]: 1148/1869 cut-off events. [2025-03-09 01:27:02,530 INFO L125 PetriNetUnfolderBase]: For 114/114 co-relation queries the response was YES. [2025-03-09 01:27:02,534 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3756 conditions, 1869 events. 1148/1869 cut-off events. For 114/114 co-relation queries the response was YES. Maximal size of possible extension queue 152. Compared 10322 event pairs, 1014 based on Foata normal form. 1/1481 useless extension candidates. Maximal degree in co-relation 3567. Up to 1706 conditions per place. [2025-03-09 01:27:02,545 INFO L140 encePairwiseOnDemand]: 45/49 looper letters, 30 selfloop transitions, 2 changer transitions 0/42 dead transitions. [2025-03-09 01:27:02,545 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 51 places, 42 transitions, 166 flow [2025-03-09 01:27:02,546 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-09 01:27:02,548 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-09 01:27:02,553 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 76 transitions. [2025-03-09 01:27:02,555 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5170068027210885 [2025-03-09 01:27:02,556 INFO L175 Difference]: Start difference. First operand has 52 places, 45 transitions, 108 flow. Second operand 3 states and 76 transitions. [2025-03-09 01:27:02,557 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 51 places, 42 transitions, 166 flow [2025-03-09 01:27:02,564 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 45 places, 42 transitions, 154 flow, removed 0 selfloop flow, removed 6 redundant places. [2025-03-09 01:27:02,568 INFO L231 Difference]: Finished difference. Result has 45 places, 42 transitions, 94 flow [2025-03-09 01:27:02,570 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=49, PETRI_DIFFERENCE_MINUEND_FLOW=90, PETRI_DIFFERENCE_MINUEND_PLACES=43, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=42, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=40, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=94, PETRI_PLACES=45, PETRI_TRANSITIONS=42} [2025-03-09 01:27:02,575 INFO L279 CegarLoopForPetriNet]: 52 programPoint places, -7 predicate places. [2025-03-09 01:27:02,575 INFO L471 AbstractCegarLoop]: Abstraction has has 45 places, 42 transitions, 94 flow [2025-03-09 01:27:02,575 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 15.0) internal successors, (45), 3 states have internal predecessors, (45), 0 states have call successors, (0), 0 states 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:27:02,575 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 01:27:02,575 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2025-03-09 01:27:02,575 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-09 01:27:02,576 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 20 more)] === [2025-03-09 01:27:02,577 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:27:02,577 INFO L85 PathProgramCache]: Analyzing trace with hash 449592, now seen corresponding path program 1 times [2025-03-09 01:27:02,577 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:27:02,577 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [365195528] [2025-03-09 01:27:02,577 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:27:02,577 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:27:02,594 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-03-09 01:27:02,614 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-03-09 01:27:02,614 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:27:02,614 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:27:02,851 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:27:02,851 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:27:02,851 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [365195528] [2025-03-09 01:27:02,851 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [365195528] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 01:27:02,851 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 01:27:02,851 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-09 01:27:02,851 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1883245776] [2025-03-09 01:27:02,851 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 01:27:02,852 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-09 01:27:02,852 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:27:02,852 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-09 01:27:02,852 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-09 01:27:02,866 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 49 [2025-03-09 01:27:02,867 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 45 places, 42 transitions, 94 flow. Second operand has 4 states, 4 states have (on average 14.75) internal successors, (59), 4 states have internal predecessors, (59), 0 states have call successors, (0), 0 states 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:27:02,867 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 01:27:02,867 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 49 [2025-03-09 01:27:02,867 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 01:27:03,101 INFO L124 PetriNetUnfolderBase]: 1149/1872 cut-off events. [2025-03-09 01:27:03,101 INFO L125 PetriNetUnfolderBase]: For 12/12 co-relation queries the response was YES. [2025-03-09 01:27:03,103 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3663 conditions, 1872 events. 1149/1872 cut-off events. For 12/12 co-relation queries the response was YES. Maximal size of possible extension queue 150. Compared 10309 event pairs, 1014 based on Foata normal form. 0/1483 useless extension candidates. Maximal degree in co-relation 3641. Up to 1711 conditions per place. [2025-03-09 01:27:03,110 INFO L140 encePairwiseOnDemand]: 44/49 looper letters, 32 selfloop transitions, 4 changer transitions 0/45 dead transitions. [2025-03-09 01:27:03,111 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 48 places, 45 transitions, 174 flow [2025-03-09 01:27:03,111 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-09 01:27:03,111 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-09 01:27:03,112 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 93 transitions. [2025-03-09 01:27:03,112 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4744897959183674 [2025-03-09 01:27:03,112 INFO L175 Difference]: Start difference. First operand has 45 places, 42 transitions, 94 flow. Second operand 4 states and 93 transitions. [2025-03-09 01:27:03,112 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 48 places, 45 transitions, 174 flow [2025-03-09 01:27:03,112 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 46 places, 45 transitions, 168 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-09 01:27:03,113 INFO L231 Difference]: Finished difference. Result has 48 places, 45 transitions, 117 flow [2025-03-09 01:27:03,114 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=49, PETRI_DIFFERENCE_MINUEND_FLOW=90, PETRI_DIFFERENCE_MINUEND_PLACES=43, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=42, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=38, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=117, PETRI_PLACES=48, PETRI_TRANSITIONS=45} [2025-03-09 01:27:03,114 INFO L279 CegarLoopForPetriNet]: 52 programPoint places, -4 predicate places. [2025-03-09 01:27:03,114 INFO L471 AbstractCegarLoop]: Abstraction has has 48 places, 45 transitions, 117 flow [2025-03-09 01:27:03,114 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 14.75) internal successors, (59), 4 states have internal predecessors, (59), 0 states have call successors, (0), 0 states 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:27:03,114 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 01:27:03,114 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1] [2025-03-09 01:27:03,116 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-09 01:27:03,116 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 20 more)] === [2025-03-09 01:27:03,117 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:27:03,118 INFO L85 PathProgramCache]: Analyzing trace with hash 432072171, now seen corresponding path program 1 times [2025-03-09 01:27:03,118 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:27:03,118 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1564000945] [2025-03-09 01:27:03,118 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:27:03,118 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:27:03,126 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-03-09 01:27:03,139 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-03-09 01:27:03,141 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:27:03,142 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:27:03,358 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:27:03,358 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:27:03,359 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1564000945] [2025-03-09 01:27:03,359 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1564000945] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 01:27:03,359 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1418069052] [2025-03-09 01:27:03,359 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:27:03,359 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 01:27:03,359 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 01:27:03,362 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:27:03,363 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:27:03,407 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-03-09 01:27:03,417 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-03-09 01:27:03,418 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:27:03,418 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:27:03,419 INFO L256 TraceCheckSpWp]: Trace formula consists of 67 conjuncts, 16 conjuncts are in the unsatisfiable core [2025-03-09 01:27:03,423 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 01:27:03,470 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:27:03,651 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:27:03,651 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 01:27:03,740 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:27:03,740 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1418069052] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-09 01:27:03,740 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-09 01:27:03,740 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2025-03-09 01:27:03,740 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1748886033] [2025-03-09 01:27:03,740 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-09 01:27:03,741 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-09 01:27:03,741 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:27:03,741 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-09 01:27:03,742 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=76, Unknown=0, NotChecked=0, Total=110 [2025-03-09 01:27:03,823 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 49 [2025-03-09 01:27:03,824 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 48 places, 45 transitions, 117 flow. Second operand has 11 states, 11 states have (on average 15.363636363636363) internal successors, (169), 11 states have internal predecessors, (169), 0 states have call successors, (0), 0 states 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:27:03,824 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 01:27:03,824 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 49 [2025-03-09 01:27:03,824 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 01:27:04,193 INFO L124 PetriNetUnfolderBase]: 1150/1874 cut-off events. [2025-03-09 01:27:04,193 INFO L125 PetriNetUnfolderBase]: For 12/12 co-relation queries the response was YES. [2025-03-09 01:27:04,195 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3679 conditions, 1874 events. 1150/1874 cut-off events. For 12/12 co-relation queries the response was YES. Maximal size of possible extension queue 150. Compared 10330 event pairs, 1014 based on Foata normal form. 0/1484 useless extension candidates. Maximal degree in co-relation 3648. Up to 1708 conditions per place. [2025-03-09 01:27:04,200 INFO L140 encePairwiseOnDemand]: 44/49 looper letters, 28 selfloop transitions, 10 changer transitions 0/47 dead transitions. [2025-03-09 01:27:04,200 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 54 places, 47 transitions, 201 flow [2025-03-09 01:27:04,200 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-09 01:27:04,201 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2025-03-09 01:27:04,201 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 152 transitions. [2025-03-09 01:27:04,202 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.3877551020408163 [2025-03-09 01:27:04,202 INFO L175 Difference]: Start difference. First operand has 48 places, 45 transitions, 117 flow. Second operand 8 states and 152 transitions. [2025-03-09 01:27:04,202 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 54 places, 47 transitions, 201 flow [2025-03-09 01:27:04,202 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 53 places, 47 transitions, 198 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-09 01:27:04,203 INFO L231 Difference]: Finished difference. Result has 53 places, 47 transitions, 142 flow [2025-03-09 01:27:04,203 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=49, PETRI_DIFFERENCE_MINUEND_FLOW=110, PETRI_DIFFERENCE_MINUEND_PLACES=46, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=44, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=37, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=142, PETRI_PLACES=53, PETRI_TRANSITIONS=47} [2025-03-09 01:27:04,203 INFO L279 CegarLoopForPetriNet]: 52 programPoint places, 1 predicate places. [2025-03-09 01:27:04,203 INFO L471 AbstractCegarLoop]: Abstraction has has 53 places, 47 transitions, 142 flow [2025-03-09 01:27:04,203 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 15.363636363636363) internal successors, (169), 11 states have internal predecessors, (169), 0 states have call successors, (0), 0 states 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:27:04,203 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 01:27:04,203 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1] [2025-03-09 01:27:04,212 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-03-09 01:27:04,408 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 01:27:04,408 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 20 more)] === [2025-03-09 01:27:04,409 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:27:04,409 INFO L85 PathProgramCache]: Analyzing trace with hash 512494175, now seen corresponding path program 1 times [2025-03-09 01:27:04,409 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:27:04,409 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2123604116] [2025-03-09 01:27:04,409 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:27:04,409 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:27:04,413 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-03-09 01:27:04,417 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-03-09 01:27:04,417 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:27:04,417 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:27:04,480 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:27:04,480 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:27:04,480 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2123604116] [2025-03-09 01:27:04,480 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2123604116] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 01:27:04,480 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 01:27:04,480 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-09 01:27:04,480 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [849141602] [2025-03-09 01:27:04,480 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 01:27:04,480 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-09 01:27:04,480 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:27:04,481 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-09 01:27:04,481 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-09 01:27:04,488 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 15 out of 49 [2025-03-09 01:27:04,488 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 53 places, 47 transitions, 142 flow. Second operand has 4 states, 4 states have (on average 16.5) internal successors, (66), 4 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:27:04,488 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 01:27:04,488 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 15 of 49 [2025-03-09 01:27:04,488 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 01:27:04,668 INFO L124 PetriNetUnfolderBase]: 1270/2088 cut-off events. [2025-03-09 01:27:04,669 INFO L125 PetriNetUnfolderBase]: For 12/12 co-relation queries the response was YES. [2025-03-09 01:27:04,671 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4115 conditions, 2088 events. 1270/2088 cut-off events. For 12/12 co-relation queries the response was YES. Maximal size of possible extension queue 149. Compared 11534 event pairs, 1101 based on Foata normal form. 62/1773 useless extension candidates. Maximal degree in co-relation 3649. Up to 1712 conditions per place. [2025-03-09 01:27:04,678 INFO L140 encePairwiseOnDemand]: 39/49 looper letters, 35 selfloop transitions, 2 changer transitions 15/61 dead transitions. [2025-03-09 01:27:04,679 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 56 places, 61 transitions, 277 flow [2025-03-09 01:27:04,679 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-09 01:27:04,679 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-09 01:27:04,680 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 116 transitions. [2025-03-09 01:27:04,680 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5918367346938775 [2025-03-09 01:27:04,680 INFO L175 Difference]: Start difference. First operand has 53 places, 47 transitions, 142 flow. Second operand 4 states and 116 transitions. [2025-03-09 01:27:04,680 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 56 places, 61 transitions, 277 flow [2025-03-09 01:27:04,681 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 61 transitions, 235 flow, removed 6 selfloop flow, removed 7 redundant places. [2025-03-09 01:27:04,681 INFO L231 Difference]: Finished difference. Result has 50 places, 46 transitions, 116 flow [2025-03-09 01:27:04,681 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=49, PETRI_DIFFERENCE_MINUEND_FLOW=100, PETRI_DIFFERENCE_MINUEND_PLACES=46, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=47, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=45, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=116, PETRI_PLACES=50, PETRI_TRANSITIONS=46} [2025-03-09 01:27:04,682 INFO L279 CegarLoopForPetriNet]: 52 programPoint places, -2 predicate places. [2025-03-09 01:27:04,682 INFO L471 AbstractCegarLoop]: Abstraction has has 50 places, 46 transitions, 116 flow [2025-03-09 01:27:04,682 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 16.5) internal successors, (66), 4 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:27:04,682 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 01:27:04,682 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 01:27:04,682 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-09 01:27:04,682 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 20 more)] === [2025-03-09 01:27:04,683 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:27:04,683 INFO L85 PathProgramCache]: Analyzing trace with hash -151339060, now seen corresponding path program 1 times [2025-03-09 01:27:04,683 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:27:04,683 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1696004092] [2025-03-09 01:27:04,683 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:27:04,683 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:27:04,687 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-03-09 01:27:04,691 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-03-09 01:27:04,691 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:27:04,691 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:27:04,860 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 01:27:04,860 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:27:04,860 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1696004092] [2025-03-09 01:27:04,860 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1696004092] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 01:27:04,860 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [484819977] [2025-03-09 01:27:04,861 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:27:04,861 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 01:27:04,861 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 01:27:04,864 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:27:04,865 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:27:04,903 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-03-09 01:27:04,916 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-03-09 01:27:04,917 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:27:04,917 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:27:04,917 INFO L256 TraceCheckSpWp]: Trace formula consists of 97 conjuncts, 17 conjuncts are in the unsatisfiable core [2025-03-09 01:27:04,919 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 01:27:04,927 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:27:04,990 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:27:04,991 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-09 01:27:04,991 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [484819977] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 01:27:04,991 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-09 01:27:04,991 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [3] total 6 [2025-03-09 01:27:04,991 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1835412320] [2025-03-09 01:27:04,991 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 01:27:04,991 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-09 01:27:04,991 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:27:04,991 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-09 01:27:04,991 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2025-03-09 01:27:05,017 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 15 out of 49 [2025-03-09 01:27:05,018 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 50 places, 46 transitions, 116 flow. Second operand has 5 states, 5 states have (on average 16.6) internal successors, (83), 5 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:27:05,018 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 01:27:05,018 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 15 of 49 [2025-03-09 01:27:05,018 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 01:27:05,147 INFO L124 PetriNetUnfolderBase]: 887/1466 cut-off events. [2025-03-09 01:27:05,147 INFO L125 PetriNetUnfolderBase]: For 148/148 co-relation queries the response was YES. [2025-03-09 01:27:05,149 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3195 conditions, 1466 events. 887/1466 cut-off events. For 148/148 co-relation queries the response was YES. Maximal size of possible extension queue 117. Compared 7784 event pairs, 768 based on Foata normal form. 0/1240 useless extension candidates. Maximal degree in co-relation 3183. Up to 1319 conditions per place. [2025-03-09 01:27:05,154 INFO L140 encePairwiseOnDemand]: 45/49 looper letters, 32 selfloop transitions, 3 changer transitions 0/44 dead transitions. [2025-03-09 01:27:05,154 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 50 places, 44 transitions, 178 flow [2025-03-09 01:27:05,154 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-09 01:27:05,154 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-09 01:27:05,155 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 92 transitions. [2025-03-09 01:27:05,156 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.46938775510204084 [2025-03-09 01:27:05,156 INFO L175 Difference]: Start difference. First operand has 50 places, 46 transitions, 116 flow. Second operand 4 states and 92 transitions. [2025-03-09 01:27:05,156 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 50 places, 44 transitions, 178 flow [2025-03-09 01:27:05,157 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 48 places, 44 transitions, 174 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-09 01:27:05,157 INFO L231 Difference]: Finished difference. Result has 48 places, 44 transitions, 110 flow [2025-03-09 01:27:05,157 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=49, PETRI_DIFFERENCE_MINUEND_FLOW=104, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=44, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=41, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=110, PETRI_PLACES=48, PETRI_TRANSITIONS=44} [2025-03-09 01:27:05,159 INFO L279 CegarLoopForPetriNet]: 52 programPoint places, -4 predicate places. [2025-03-09 01:27:05,159 INFO L471 AbstractCegarLoop]: Abstraction has has 48 places, 44 transitions, 110 flow [2025-03-09 01:27:05,159 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 16.6) internal successors, (83), 5 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:27:05,159 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 01:27:05,159 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 01:27:05,168 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-03-09 01:27:05,364 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:27:05,364 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 20 more)] === [2025-03-09 01:27:05,364 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:27:05,364 INFO L85 PathProgramCache]: Analyzing trace with hash -151339061, now seen corresponding path program 1 times [2025-03-09 01:27:05,364 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:27:05,365 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [281632336] [2025-03-09 01:27:05,365 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:27:05,365 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:27:05,371 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-03-09 01:27:05,375 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-03-09 01:27:05,376 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:27:05,376 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:27:05,406 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-09 01:27:05,407 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:27:05,407 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [281632336] [2025-03-09 01:27:05,407 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [281632336] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 01:27:05,407 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 01:27:05,407 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-09 01:27:05,407 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [841229336] [2025-03-09 01:27:05,407 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 01:27:05,407 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-09 01:27:05,407 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:27:05,408 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-09 01:27:05,408 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-09 01:27:05,421 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 49 [2025-03-09 01:27:05,421 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 48 places, 44 transitions, 110 flow. Second operand has 4 states, 4 states have (on average 13.0) internal successors, (52), 4 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:27:05,421 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 01:27:05,421 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 49 [2025-03-09 01:27:05,421 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 01:27:05,513 INFO L124 PetriNetUnfolderBase]: 852/1381 cut-off events. [2025-03-09 01:27:05,513 INFO L125 PetriNetUnfolderBase]: For 174/174 co-relation queries the response was YES. [2025-03-09 01:27:05,514 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2897 conditions, 1381 events. 852/1381 cut-off events. For 174/174 co-relation queries the response was YES. Maximal size of possible extension queue 89. Compared 6588 event pairs, 724 based on Foata normal form. 0/1367 useless extension candidates. Maximal degree in co-relation 2872. Up to 1254 conditions per place. [2025-03-09 01:27:05,519 INFO L140 encePairwiseOnDemand]: 43/49 looper letters, 31 selfloop transitions, 3 changer transitions 0/40 dead transitions. [2025-03-09 01:27:05,519 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 47 places, 40 transitions, 166 flow [2025-03-09 01:27:05,520 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-09 01:27:05,520 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-09 01:27:05,521 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 77 transitions. [2025-03-09 01:27:05,521 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.39285714285714285 [2025-03-09 01:27:05,521 INFO L175 Difference]: Start difference. First operand has 48 places, 44 transitions, 110 flow. Second operand 4 states and 77 transitions. [2025-03-09 01:27:05,521 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 47 places, 40 transitions, 166 flow [2025-03-09 01:27:05,522 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 45 places, 40 transitions, 162 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-09 01:27:05,523 INFO L231 Difference]: Finished difference. Result has 45 places, 40 transitions, 100 flow [2025-03-09 01:27:05,524 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=49, PETRI_DIFFERENCE_MINUEND_FLOW=94, PETRI_DIFFERENCE_MINUEND_PLACES=42, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=40, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=37, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=100, PETRI_PLACES=45, PETRI_TRANSITIONS=40} [2025-03-09 01:27:05,524 INFO L279 CegarLoopForPetriNet]: 52 programPoint places, -7 predicate places. [2025-03-09 01:27:05,525 INFO L471 AbstractCegarLoop]: Abstraction has has 45 places, 40 transitions, 100 flow [2025-03-09 01:27:05,525 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.0) internal successors, (52), 4 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:27:05,525 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 01:27:05,525 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 01:27:05,525 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-09 01:27:05,525 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting thread3Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 20 more)] === [2025-03-09 01:27:05,526 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:27:05,526 INFO L85 PathProgramCache]: Analyzing trace with hash -1206894838, now seen corresponding path program 1 times [2025-03-09 01:27:05,526 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:27:05,526 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1433894685] [2025-03-09 01:27:05,526 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:27:05,526 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:27:05,531 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-03-09 01:27:05,534 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-03-09 01:27:05,534 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:27:05,534 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:27:05,560 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:27:05,560 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:27:05,560 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1433894685] [2025-03-09 01:27:05,560 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1433894685] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 01:27:05,560 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 01:27:05,560 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-09 01:27:05,560 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1846437073] [2025-03-09 01:27:05,560 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 01:27:05,560 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-09 01:27:05,560 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:27:05,561 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-09 01:27:05,561 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-09 01:27:05,566 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 15 out of 49 [2025-03-09 01:27:05,567 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 45 places, 40 transitions, 100 flow. Second operand has 3 states, 3 states have (on average 18.333333333333332) internal successors, (55), 3 states have internal predecessors, (55), 0 states have call successors, (0), 0 states 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:27:05,567 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 01:27:05,567 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 15 of 49 [2025-03-09 01:27:05,567 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 01:27:05,646 INFO L124 PetriNetUnfolderBase]: 467/875 cut-off events. [2025-03-09 01:27:05,646 INFO L125 PetriNetUnfolderBase]: For 115/122 co-relation queries the response was YES. [2025-03-09 01:27:05,647 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1776 conditions, 875 events. 467/875 cut-off events. For 115/122 co-relation queries the response was YES. Maximal size of possible extension queue 64. Compared 4395 event pairs, 171 based on Foata normal form. 28/852 useless extension candidates. Maximal degree in co-relation 1749. Up to 532 conditions per place. [2025-03-09 01:27:05,649 INFO L140 encePairwiseOnDemand]: 45/49 looper letters, 45 selfloop transitions, 3 changer transitions 0/55 dead transitions. [2025-03-09 01:27:05,649 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 47 places, 55 transitions, 232 flow [2025-03-09 01:27:05,650 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-09 01:27:05,650 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-09 01:27:05,650 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 89 transitions. [2025-03-09 01:27:05,650 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6054421768707483 [2025-03-09 01:27:05,651 INFO L175 Difference]: Start difference. First operand has 45 places, 40 transitions, 100 flow. Second operand 3 states and 89 transitions. [2025-03-09 01:27:05,651 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 47 places, 55 transitions, 232 flow [2025-03-09 01:27:05,652 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 45 places, 55 transitions, 228 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-09 01:27:05,652 INFO L231 Difference]: Finished difference. Result has 46 places, 42 transitions, 119 flow [2025-03-09 01:27:05,653 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=49, PETRI_DIFFERENCE_MINUEND_FLOW=96, PETRI_DIFFERENCE_MINUEND_PLACES=43, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=40, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=37, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=119, PETRI_PLACES=46, PETRI_TRANSITIONS=42} [2025-03-09 01:27:05,653 INFO L279 CegarLoopForPetriNet]: 52 programPoint places, -6 predicate places. [2025-03-09 01:27:05,653 INFO L471 AbstractCegarLoop]: Abstraction has has 46 places, 42 transitions, 119 flow [2025-03-09 01:27:05,653 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 18.333333333333332) internal successors, (55), 3 states have internal predecessors, (55), 0 states have call successors, (0), 0 states 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:27:05,653 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 01:27:05,653 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 01:27:05,653 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-09 01:27:05,653 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting thread3Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 20 more)] === [2025-03-09 01:27:05,654 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:27:05,654 INFO L85 PathProgramCache]: Analyzing trace with hash 2006455088, now seen corresponding path program 1 times [2025-03-09 01:27:05,654 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:27:05,654 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1694353217] [2025-03-09 01:27:05,654 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:27:05,654 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:27:05,663 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-03-09 01:27:05,671 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-03-09 01:27:05,671 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:27:05,671 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:27:05,860 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-09 01:27:05,860 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:27:05,860 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1694353217] [2025-03-09 01:27:05,860 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1694353217] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 01:27:05,860 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [436587344] [2025-03-09 01:27:05,860 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:27:05,860 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 01:27:05,860 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 01:27:05,862 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:27:05,863 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:27:05,905 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-03-09 01:27:05,920 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-03-09 01:27:05,921 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:27:05,921 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:27:05,921 INFO L256 TraceCheckSpWp]: Trace formula consists of 144 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-09 01:27:05,922 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 01:27:05,983 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-09 01:27:05,983 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 01:27:06,042 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-09 01:27:06,042 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [436587344] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-09 01:27:06,042 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-09 01:27:06,042 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4, 4] total 11 [2025-03-09 01:27:06,042 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2128758999] [2025-03-09 01:27:06,042 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-09 01:27:06,042 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-03-09 01:27:06,042 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:27:06,043 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-03-09 01:27:06,043 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2025-03-09 01:27:06,177 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 49 [2025-03-09 01:27:06,178 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 46 places, 42 transitions, 119 flow. Second operand has 12 states, 12 states have (on average 15.666666666666666) internal successors, (188), 12 states have internal predecessors, (188), 0 states have call successors, (0), 0 states 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:27:06,178 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 01:27:06,178 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 49 [2025-03-09 01:27:06,178 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 01:27:06,610 INFO L124 PetriNetUnfolderBase]: 834/1401 cut-off events. [2025-03-09 01:27:06,610 INFO L125 PetriNetUnfolderBase]: For 461/474 co-relation queries the response was YES. [2025-03-09 01:27:06,612 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3228 conditions, 1401 events. 834/1401 cut-off events. For 461/474 co-relation queries the response was YES. Maximal size of possible extension queue 74. Compared 6673 event pairs, 194 based on Foata normal form. 53/1447 useless extension candidates. Maximal degree in co-relation 2132. Up to 434 conditions per place. [2025-03-09 01:27:06,616 INFO L140 encePairwiseOnDemand]: 41/49 looper letters, 54 selfloop transitions, 9 changer transitions 36/104 dead transitions. [2025-03-09 01:27:06,616 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 55 places, 104 transitions, 478 flow [2025-03-09 01:27:06,616 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-09 01:27:06,616 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2025-03-09 01:27:06,617 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 244 transitions. [2025-03-09 01:27:06,617 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.45269016697588127 [2025-03-09 01:27:06,617 INFO L175 Difference]: Start difference. First operand has 46 places, 42 transitions, 119 flow. Second operand 11 states and 244 transitions. [2025-03-09 01:27:06,617 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 55 places, 104 transitions, 478 flow [2025-03-09 01:27:06,620 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 53 places, 104 transitions, 451 flow, removed 11 selfloop flow, removed 2 redundant places. [2025-03-09 01:27:06,622 INFO L231 Difference]: Finished difference. Result has 53 places, 40 transitions, 118 flow [2025-03-09 01:27:06,622 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=49, PETRI_DIFFERENCE_MINUEND_FLOW=104, PETRI_DIFFERENCE_MINUEND_PLACES=43, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=32, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=118, PETRI_PLACES=53, PETRI_TRANSITIONS=40} [2025-03-09 01:27:06,623 INFO L279 CegarLoopForPetriNet]: 52 programPoint places, 1 predicate places. [2025-03-09 01:27:06,623 INFO L471 AbstractCegarLoop]: Abstraction has has 53 places, 40 transitions, 118 flow [2025-03-09 01:27:06,623 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 15.666666666666666) internal successors, (188), 12 states have internal predecessors, (188), 0 states have call successors, (0), 0 states 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:27:06,623 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 01:27:06,623 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 01:27:06,631 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-03-09 01:27:06,824 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 01:27:06,824 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting thread3Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 20 more)] === [2025-03-09 01:27:06,824 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:27:06,824 INFO L85 PathProgramCache]: Analyzing trace with hash 974841237, now seen corresponding path program 1 times [2025-03-09 01:27:06,824 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:27:06,824 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1667651987] [2025-03-09 01:27:06,824 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:27:06,824 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:27:06,833 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-03-09 01:27:06,837 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-03-09 01:27:06,837 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:27:06,837 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:27:06,886 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-03-09 01:27:06,887 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:27:06,887 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1667651987] [2025-03-09 01:27:06,887 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1667651987] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 01:27:06,887 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 01:27:06,887 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-09 01:27:06,887 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1960014736] [2025-03-09 01:27:06,887 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 01:27:06,887 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-09 01:27:06,887 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:27:06,887 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-09 01:27:06,888 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-09 01:27:06,894 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 15 out of 49 [2025-03-09 01:27:06,894 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 53 places, 40 transitions, 118 flow. Second operand has 4 states, 4 states have (on average 18.25) internal successors, (73), 4 states have internal predecessors, (73), 0 states have call successors, (0), 0 states 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:27:06,894 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 01:27:06,894 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 15 of 49 [2025-03-09 01:27:06,895 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 01:27:06,966 INFO L124 PetriNetUnfolderBase]: 304/540 cut-off events. [2025-03-09 01:27:06,966 INFO L125 PetriNetUnfolderBase]: For 183/187 co-relation queries the response was YES. [2025-03-09 01:27:06,967 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1201 conditions, 540 events. 304/540 cut-off events. For 183/187 co-relation queries the response was YES. Maximal size of possible extension queue 39. Compared 2155 event pairs, 99 based on Foata normal form. 39/573 useless extension candidates. Maximal degree in co-relation 1172. Up to 201 conditions per place. [2025-03-09 01:27:06,968 INFO L140 encePairwiseOnDemand]: 45/49 looper letters, 48 selfloop transitions, 5 changer transitions 0/59 dead transitions. [2025-03-09 01:27:06,968 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 54 places, 59 transitions, 266 flow [2025-03-09 01:27:06,969 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-09 01:27:06,969 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-09 01:27:06,970 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 110 transitions. [2025-03-09 01:27:06,970 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5612244897959183 [2025-03-09 01:27:06,970 INFO L175 Difference]: Start difference. First operand has 53 places, 40 transitions, 118 flow. Second operand 4 states and 110 transitions. [2025-03-09 01:27:06,970 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 54 places, 59 transitions, 266 flow [2025-03-09 01:27:06,971 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 48 places, 59 transitions, 252 flow, removed 0 selfloop flow, removed 6 redundant places. [2025-03-09 01:27:06,972 INFO L231 Difference]: Finished difference. Result has 49 places, 40 transitions, 120 flow [2025-03-09 01:27:06,972 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=49, PETRI_DIFFERENCE_MINUEND_FLOW=104, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=40, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=35, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=120, PETRI_PLACES=49, PETRI_TRANSITIONS=40} [2025-03-09 01:27:06,973 INFO L279 CegarLoopForPetriNet]: 52 programPoint places, -3 predicate places. [2025-03-09 01:27:06,973 INFO L471 AbstractCegarLoop]: Abstraction has has 49 places, 40 transitions, 120 flow [2025-03-09 01:27:06,973 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 18.25) internal successors, (73), 4 states have internal predecessors, (73), 0 states have call successors, (0), 0 states 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:27:06,973 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 01:27:06,973 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 01:27:06,973 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-09 01:27:06,973 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting thread3Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 20 more)] === [2025-03-09 01:27:06,973 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:27:06,973 INFO L85 PathProgramCache]: Analyzing trace with hash -901612292, now seen corresponding path program 1 times [2025-03-09 01:27:06,973 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:27:06,974 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [198271547] [2025-03-09 01:27:06,974 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:27:06,974 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:27:06,980 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 21 statements into 1 equivalence classes. [2025-03-09 01:27:06,985 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 21 of 21 statements. [2025-03-09 01:27:06,986 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:27:06,986 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:27:07,044 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-03-09 01:27:07,044 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:27:07,044 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [198271547] [2025-03-09 01:27:07,044 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [198271547] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 01:27:07,045 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 01:27:07,045 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-09 01:27:07,045 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [519034726] [2025-03-09 01:27:07,045 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 01:27:07,045 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-09 01:27:07,045 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:27:07,045 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-09 01:27:07,045 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-09 01:27:07,061 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 49 [2025-03-09 01:27:07,062 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 40 transitions, 120 flow. Second operand has 6 states, 6 states have (on average 15.0) internal successors, (90), 6 states have internal predecessors, (90), 0 states have call successors, (0), 0 states 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:27:07,062 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 01:27:07,062 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 49 [2025-03-09 01:27:07,062 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 01:27:07,175 INFO L124 PetriNetUnfolderBase]: 320/547 cut-off events. [2025-03-09 01:27:07,175 INFO L125 PetriNetUnfolderBase]: For 245/252 co-relation queries the response was YES. [2025-03-09 01:27:07,177 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1310 conditions, 547 events. 320/547 cut-off events. For 245/252 co-relation queries the response was YES. Maximal size of possible extension queue 39. Compared 2083 event pairs, 93 based on Foata normal form. 6/547 useless extension candidates. Maximal degree in co-relation 1285. Up to 201 conditions per place. [2025-03-09 01:27:07,179 INFO L140 encePairwiseOnDemand]: 44/49 looper letters, 53 selfloop transitions, 6 changer transitions 0/63 dead transitions. [2025-03-09 01:27:07,179 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 63 transitions, 290 flow [2025-03-09 01:27:07,180 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-09 01:27:07,180 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-09 01:27:07,180 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 128 transitions. [2025-03-09 01:27:07,180 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.43537414965986393 [2025-03-09 01:27:07,181 INFO L175 Difference]: Start difference. First operand has 49 places, 40 transitions, 120 flow. Second operand 6 states and 128 transitions. [2025-03-09 01:27:07,181 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 63 transitions, 290 flow [2025-03-09 01:27:07,181 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 51 places, 63 transitions, 280 flow, removed 2 selfloop flow, removed 2 redundant places. [2025-03-09 01:27:07,182 INFO L231 Difference]: Finished difference. Result has 51 places, 39 transitions, 120 flow [2025-03-09 01:27:07,182 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=49, PETRI_DIFFERENCE_MINUEND_FLOW=108, PETRI_DIFFERENCE_MINUEND_PLACES=46, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=39, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=33, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=120, PETRI_PLACES=51, PETRI_TRANSITIONS=39} [2025-03-09 01:27:07,183 INFO L279 CegarLoopForPetriNet]: 52 programPoint places, -1 predicate places. [2025-03-09 01:27:07,183 INFO L471 AbstractCegarLoop]: Abstraction has has 51 places, 39 transitions, 120 flow [2025-03-09 01:27:07,183 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 15.0) internal successors, (90), 6 states have internal predecessors, (90), 0 states have call successors, (0), 0 states 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:27:07,183 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 01:27:07,183 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 01:27:07,183 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-09 01:27:07,183 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 20 more)] === [2025-03-09 01:27:07,184 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:27:07,184 INFO L85 PathProgramCache]: Analyzing trace with hash 452522556, now seen corresponding path program 1 times [2025-03-09 01:27:07,184 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:27:07,185 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [946393735] [2025-03-09 01:27:07,185 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:27:07,185 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:27:07,193 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 29 statements into 1 equivalence classes. [2025-03-09 01:27:07,241 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 29 of 29 statements. [2025-03-09 01:27:07,241 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:27:07,241 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:27:08,899 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 7 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 01:27:08,899 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:27:08,899 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [946393735] [2025-03-09 01:27:08,900 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [946393735] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 01:27:08,900 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [349726791] [2025-03-09 01:27:08,900 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:27:08,900 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 01:27:08,900 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 01:27:08,901 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:27:08,903 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:27:08,944 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 29 statements into 1 equivalence classes. [2025-03-09 01:27:08,987 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 29 of 29 statements. [2025-03-09 01:27:08,987 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:27:08,987 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:27:08,993 INFO L256 TraceCheckSpWp]: Trace formula consists of 218 conjuncts, 35 conjuncts are in the unsatisfiable core [2025-03-09 01:27:09,000 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 01:27:09,084 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 1 [2025-03-09 01:27:09,456 INFO L349 Elim1Store]: treesize reduction 16, result has 15.8 percent of original size [2025-03-09 01:27:09,456 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 65 treesize of output 34 [2025-03-09 01:27:09,481 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 5 proven. 8 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-09 01:27:09,482 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 01:27:10,207 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 81 treesize of output 73 [2025-03-09 01:27:10,252 INFO L349 Elim1Store]: treesize reduction 8, result has 82.2 percent of original size [2025-03-09 01:27:10,254 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 136 treesize of output 134 [2025-03-09 01:27:11,211 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 5 proven. 8 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-09 01:27:11,211 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [349726791] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-09 01:27:11,211 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-09 01:27:11,211 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 11, 11] total 33 [2025-03-09 01:27:11,211 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2015782107] [2025-03-09 01:27:11,212 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-09 01:27:11,212 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2025-03-09 01:27:11,212 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:27:11,212 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2025-03-09 01:27:11,213 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=137, Invalid=985, Unknown=0, NotChecked=0, Total=1122 [2025-03-09 01:27:12,176 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 49 [2025-03-09 01:27:12,177 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 51 places, 39 transitions, 120 flow. Second operand has 34 states, 34 states have (on average 16.38235294117647) internal successors, (557), 34 states have internal predecessors, (557), 0 states have call successors, (0), 0 states 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:27:12,177 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 01:27:12,177 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 49 [2025-03-09 01:27:12,177 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 01:27:15,700 INFO L124 PetriNetUnfolderBase]: 1188/2070 cut-off events. [2025-03-09 01:27:15,700 INFO L125 PetriNetUnfolderBase]: For 1011/1011 co-relation queries the response was YES. [2025-03-09 01:27:15,702 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5071 conditions, 2070 events. 1188/2070 cut-off events. For 1011/1011 co-relation queries the response was YES. Maximal size of possible extension queue 128. Compared 11185 event pairs, 416 based on Foata normal form. 1/2065 useless extension candidates. Maximal degree in co-relation 3716. Up to 521 conditions per place. [2025-03-09 01:27:15,713 INFO L140 encePairwiseOnDemand]: 34/49 looper letters, 146 selfloop transitions, 35 changer transitions 23/208 dead transitions. [2025-03-09 01:27:15,714 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 74 places, 208 transitions, 1024 flow [2025-03-09 01:27:15,715 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2025-03-09 01:27:15,715 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2025-03-09 01:27:15,716 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 539 transitions. [2025-03-09 01:27:15,716 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4583333333333333 [2025-03-09 01:27:15,716 INFO L175 Difference]: Start difference. First operand has 51 places, 39 transitions, 120 flow. Second operand 24 states and 539 transitions. [2025-03-09 01:27:15,716 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 74 places, 208 transitions, 1024 flow [2025-03-09 01:27:15,719 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 69 places, 208 transitions, 960 flow, removed 7 selfloop flow, removed 5 redundant places. [2025-03-09 01:27:15,721 INFO L231 Difference]: Finished difference. Result has 84 places, 69 transitions, 382 flow [2025-03-09 01:27:15,723 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=49, PETRI_DIFFERENCE_MINUEND_FLOW=104, PETRI_DIFFERENCE_MINUEND_PLACES=46, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=39, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=21, PETRI_DIFFERENCE_SUBTRAHEND_STATES=24, PETRI_FLOW=382, PETRI_PLACES=84, PETRI_TRANSITIONS=69} [2025-03-09 01:27:15,724 INFO L279 CegarLoopForPetriNet]: 52 programPoint places, 32 predicate places. [2025-03-09 01:27:15,724 INFO L471 AbstractCegarLoop]: Abstraction has has 84 places, 69 transitions, 382 flow [2025-03-09 01:27:15,725 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 34 states, 34 states have (on average 16.38235294117647) internal successors, (557), 34 states have internal predecessors, (557), 0 states have call successors, (0), 0 states 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:27:15,725 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 01:27:15,725 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 01:27:15,734 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2025-03-09 01:27:15,929 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 01:27:15,930 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 20 more)] === [2025-03-09 01:27:15,930 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:27:15,930 INFO L85 PathProgramCache]: Analyzing trace with hash 349636158, now seen corresponding path program 2 times [2025-03-09 01:27:15,930 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:27:15,930 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [25599903] [2025-03-09 01:27:15,931 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-09 01:27:15,931 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:27:15,938 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 29 statements into 2 equivalence classes. [2025-03-09 01:27:15,951 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 24 of 29 statements. [2025-03-09 01:27:15,951 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-09 01:27:15,951 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:27:16,173 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:27:16,173 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:27:16,173 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [25599903] [2025-03-09 01:27:16,173 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [25599903] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 01:27:16,173 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 01:27:16,173 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-09 01:27:16,173 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1121061116] [2025-03-09 01:27:16,173 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 01:27:16,173 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-09 01:27:16,174 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:27:16,174 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-09 01:27:16,174 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2025-03-09 01:27:16,237 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 49 [2025-03-09 01:27:16,237 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 84 places, 69 transitions, 382 flow. Second operand has 9 states, 9 states have (on average 16.77777777777778) internal successors, (151), 9 states have internal predecessors, (151), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:27:16,237 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 01:27:16,237 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 49 [2025-03-09 01:27:16,237 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 01:27:16,787 INFO L124 PetriNetUnfolderBase]: 2183/3834 cut-off events. [2025-03-09 01:27:16,787 INFO L125 PetriNetUnfolderBase]: For 5431/5436 co-relation queries the response was YES. [2025-03-09 01:27:16,794 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11166 conditions, 3834 events. 2183/3834 cut-off events. For 5431/5436 co-relation queries the response was YES. Maximal size of possible extension queue 192. Compared 23535 event pairs, 877 based on Foata normal form. 5/3838 useless extension candidates. Maximal degree in co-relation 11112. Up to 1598 conditions per place. [2025-03-09 01:27:16,802 INFO L140 encePairwiseOnDemand]: 39/49 looper letters, 105 selfloop transitions, 32 changer transitions 35/176 dead transitions. [2025-03-09 01:27:16,802 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 90 places, 176 transitions, 1223 flow [2025-03-09 01:27:16,802 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-09 01:27:16,802 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2025-03-09 01:27:16,803 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 254 transitions. [2025-03-09 01:27:16,803 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5183673469387755 [2025-03-09 01:27:16,804 INFO L175 Difference]: Start difference. First operand has 84 places, 69 transitions, 382 flow. Second operand 10 states and 254 transitions. [2025-03-09 01:27:16,804 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 90 places, 176 transitions, 1223 flow [2025-03-09 01:27:16,825 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 83 places, 176 transitions, 1179 flow, removed 18 selfloop flow, removed 7 redundant places. [2025-03-09 01:27:16,826 INFO L231 Difference]: Finished difference. Result has 91 places, 94 transitions, 719 flow [2025-03-09 01:27:16,826 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=49, PETRI_DIFFERENCE_MINUEND_FLOW=362, PETRI_DIFFERENCE_MINUEND_PLACES=74, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=69, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=43, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=719, PETRI_PLACES=91, PETRI_TRANSITIONS=94} [2025-03-09 01:27:16,827 INFO L279 CegarLoopForPetriNet]: 52 programPoint places, 39 predicate places. [2025-03-09 01:27:16,828 INFO L471 AbstractCegarLoop]: Abstraction has has 91 places, 94 transitions, 719 flow [2025-03-09 01:27:16,828 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 16.77777777777778) internal successors, (151), 9 states have internal predecessors, (151), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:27:16,828 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 01:27:16,828 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 01:27:16,828 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-09 01:27:16,828 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 20 more)] === [2025-03-09 01:27:16,828 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:27:16,828 INFO L85 PathProgramCache]: Analyzing trace with hash 1190196566, now seen corresponding path program 3 times [2025-03-09 01:27:16,828 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:27:16,828 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1312634701] [2025-03-09 01:27:16,828 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-09 01:27:16,828 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:27:16,835 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 29 statements into 4 equivalence classes. [2025-03-09 01:27:16,847 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 24 of 29 statements. [2025-03-09 01:27:16,847 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-03-09 01:27:16,847 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:27:17,096 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:27:17,096 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:27:17,096 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1312634701] [2025-03-09 01:27:17,096 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1312634701] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 01:27:17,096 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 01:27:17,096 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-09 01:27:17,096 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [113702475] [2025-03-09 01:27:17,096 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 01:27:17,096 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-09 01:27:17,097 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:27:17,097 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-09 01:27:17,097 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2025-03-09 01:27:17,163 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 49 [2025-03-09 01:27:17,163 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 91 places, 94 transitions, 719 flow. Second operand has 9 states, 9 states have (on average 16.77777777777778) internal successors, (151), 9 states have internal predecessors, (151), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:27:17,163 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 01:27:17,163 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 49 [2025-03-09 01:27:17,163 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 01:27:17,734 INFO L124 PetriNetUnfolderBase]: 3079/5437 cut-off events. [2025-03-09 01:27:17,734 INFO L125 PetriNetUnfolderBase]: For 13897/13905 co-relation queries the response was YES. [2025-03-09 01:27:17,744 INFO L83 FinitePrefix]: Finished finitePrefix Result has 17474 conditions, 5437 events. 3079/5437 cut-off events. For 13897/13905 co-relation queries the response was YES. Maximal size of possible extension queue 213. Compared 35304 event pairs, 1574 based on Foata normal form. 2/5435 useless extension candidates. Maximal degree in co-relation 17382. Up to 2699 conditions per place. [2025-03-09 01:27:17,756 INFO L140 encePairwiseOnDemand]: 39/49 looper letters, 119 selfloop transitions, 35 changer transitions 30/188 dead transitions. [2025-03-09 01:27:17,756 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 95 places, 188 transitions, 1584 flow [2025-03-09 01:27:17,758 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-09 01:27:17,758 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2025-03-09 01:27:17,758 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 231 transitions. [2025-03-09 01:27:17,758 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5238095238095238 [2025-03-09 01:27:17,758 INFO L175 Difference]: Start difference. First operand has 91 places, 94 transitions, 719 flow. Second operand 9 states and 231 transitions. [2025-03-09 01:27:17,758 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 95 places, 188 transitions, 1584 flow [2025-03-09 01:27:17,800 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 91 places, 188 transitions, 1520 flow, removed 32 selfloop flow, removed 4 redundant places. [2025-03-09 01:27:17,802 INFO L231 Difference]: Finished difference. Result has 98 places, 109 transitions, 1002 flow [2025-03-09 01:27:17,802 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=49, PETRI_DIFFERENCE_MINUEND_FLOW=685, PETRI_DIFFERENCE_MINUEND_PLACES=83, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=94, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=20, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=59, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1002, PETRI_PLACES=98, PETRI_TRANSITIONS=109} [2025-03-09 01:27:17,802 INFO L279 CegarLoopForPetriNet]: 52 programPoint places, 46 predicate places. [2025-03-09 01:27:17,803 INFO L471 AbstractCegarLoop]: Abstraction has has 98 places, 109 transitions, 1002 flow [2025-03-09 01:27:17,803 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 16.77777777777778) internal successors, (151), 9 states have internal predecessors, (151), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:27:17,803 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 01:27:17,803 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 01:27:17,803 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-09 01:27:17,803 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 20 more)] === [2025-03-09 01:27:17,804 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:27:17,804 INFO L85 PathProgramCache]: Analyzing trace with hash 417093862, now seen corresponding path program 4 times [2025-03-09 01:27:17,804 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:27:17,804 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1462335247] [2025-03-09 01:27:17,804 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-09 01:27:17,804 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:27:17,809 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 29 statements into 2 equivalence classes. [2025-03-09 01:27:17,835 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 29 of 29 statements. [2025-03-09 01:27:17,835 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-03-09 01:27:17,835 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:27:18,588 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 5 proven. 8 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-09 01:27:18,589 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:27:18,589 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1462335247] [2025-03-09 01:27:18,589 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1462335247] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 01:27:18,589 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [437437144] [2025-03-09 01:27:18,589 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-09 01:27:18,589 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 01:27:18,590 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 01:27:18,591 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:27:18,593 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:27:18,639 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 29 statements into 2 equivalence classes. [2025-03-09 01:27:18,661 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 29 of 29 statements. [2025-03-09 01:27:18,661 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-03-09 01:27:18,661 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:27:18,662 INFO L256 TraceCheckSpWp]: Trace formula consists of 218 conjuncts, 29 conjuncts are in the unsatisfiable core [2025-03-09 01:27:18,664 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 01:27:18,944 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 5 proven. 8 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-09 01:27:18,944 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 01:27:19,105 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-09 01:27:19,105 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 58 treesize of output 60 [2025-03-09 01:27:19,462 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 5 proven. 8 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-09 01:27:19,462 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [437437144] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-09 01:27:19,462 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-09 01:27:19,462 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12, 12] total 33 [2025-03-09 01:27:19,462 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1435418655] [2025-03-09 01:27:19,463 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-09 01:27:19,463 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2025-03-09 01:27:19,463 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:27:19,463 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2025-03-09 01:27:19,464 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=140, Invalid=982, Unknown=0, NotChecked=0, Total=1122 [2025-03-09 01:27:20,070 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 49 [2025-03-09 01:27:20,071 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 98 places, 109 transitions, 1002 flow. Second operand has 34 states, 34 states have (on average 16.38235294117647) internal successors, (557), 34 states have internal predecessors, (557), 0 states have call successors, (0), 0 states 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:27:20,071 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 01:27:20,071 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 49 [2025-03-09 01:27:20,071 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 01:27:21,468 INFO L124 PetriNetUnfolderBase]: 2939/5184 cut-off events. [2025-03-09 01:27:21,468 INFO L125 PetriNetUnfolderBase]: For 17408/17416 co-relation queries the response was YES. [2025-03-09 01:27:21,480 INFO L83 FinitePrefix]: Finished finitePrefix Result has 17589 conditions, 5184 events. 2939/5184 cut-off events. For 17408/17416 co-relation queries the response was YES. Maximal size of possible extension queue 201. Compared 33192 event pairs, 810 based on Foata normal form. 2/5182 useless extension candidates. Maximal degree in co-relation 17501. Up to 2751 conditions per place. [2025-03-09 01:27:21,493 INFO L140 encePairwiseOnDemand]: 36/49 looper letters, 140 selfloop transitions, 48 changer transitions 56/248 dead transitions. [2025-03-09 01:27:21,493 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 114 places, 248 transitions, 2085 flow [2025-03-09 01:27:21,493 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2025-03-09 01:27:21,493 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2025-03-09 01:27:21,494 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 484 transitions. [2025-03-09 01:27:21,495 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4703595724003887 [2025-03-09 01:27:21,495 INFO L175 Difference]: Start difference. First operand has 98 places, 109 transitions, 1002 flow. Second operand 21 states and 484 transitions. [2025-03-09 01:27:21,495 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 114 places, 248 transitions, 2085 flow [2025-03-09 01:27:21,544 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 109 places, 248 transitions, 2019 flow, removed 22 selfloop flow, removed 5 redundant places. [2025-03-09 01:27:21,546 INFO L231 Difference]: Finished difference. Result has 120 places, 117 transitions, 1211 flow [2025-03-09 01:27:21,546 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=49, PETRI_DIFFERENCE_MINUEND_FLOW=963, PETRI_DIFFERENCE_MINUEND_PLACES=89, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=109, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=39, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=67, PETRI_DIFFERENCE_SUBTRAHEND_STATES=21, PETRI_FLOW=1211, PETRI_PLACES=120, PETRI_TRANSITIONS=117} [2025-03-09 01:27:21,546 INFO L279 CegarLoopForPetriNet]: 52 programPoint places, 68 predicate places. [2025-03-09 01:27:21,546 INFO L471 AbstractCegarLoop]: Abstraction has has 120 places, 117 transitions, 1211 flow [2025-03-09 01:27:21,547 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 34 states, 34 states have (on average 16.38235294117647) internal successors, (557), 34 states have internal predecessors, (557), 0 states have call successors, (0), 0 states 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:27:21,547 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 01:27:21,547 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 3, 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:27:21,553 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:27:21,747 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:27:21,747 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 20 more)] === [2025-03-09 01:27:21,748 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:27:21,748 INFO L85 PathProgramCache]: Analyzing trace with hash -2114186275, now seen corresponding path program 5 times [2025-03-09 01:27:21,748 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:27:21,748 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [220336314] [2025-03-09 01:27:21,748 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-09 01:27:21,748 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:27:21,753 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 31 statements into 5 equivalence classes. [2025-03-09 01:27:21,789 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 5 check-sat command(s) and asserted 31 of 31 statements. [2025-03-09 01:27:21,790 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 5 check-sat command(s) [2025-03-09 01:27:21,790 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:27:22,937 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 8 proven. 18 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-09 01:27:22,937 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:27:22,937 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [220336314] [2025-03-09 01:27:22,937 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [220336314] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 01:27:22,937 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [915083028] [2025-03-09 01:27:22,937 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-09 01:27:22,937 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 01:27:22,938 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 01:27:22,939 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:27:22,940 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:27:22,982 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 31 statements into 5 equivalence classes. [2025-03-09 01:27:23,024 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 5 check-sat command(s) and asserted 31 of 31 statements. [2025-03-09 01:27:23,024 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 5 check-sat command(s) [2025-03-09 01:27:23,024 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:27:23,025 INFO L256 TraceCheckSpWp]: Trace formula consists of 231 conjuncts, 53 conjuncts are in the unsatisfiable core [2025-03-09 01:27:23,027 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 01:27:23,085 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-03-09 01:27:23,151 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 32 treesize of output 16 [2025-03-09 01:27:23,196 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-09 01:27:23,197 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 48 treesize of output 31 [2025-03-09 01:27:23,788 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 9 proven. 18 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-09 01:27:23,788 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 01:27:36,877 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 146 treesize of output 138 [2025-03-09 01:27:36,924 INFO L349 Elim1Store]: treesize reduction 13, result has 64.9 percent of original size [2025-03-09 01:27:36,924 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 41970 treesize of output 38541 [2025-03-09 01:27:38,011 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 7 proven. 20 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-09 01:27:38,012 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [915083028] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-09 01:27:38,012 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-09 01:27:38,012 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 15, 15] total 41 [2025-03-09 01:27:38,012 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1417763304] [2025-03-09 01:27:38,012 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-09 01:27:38,012 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 42 states [2025-03-09 01:27:38,013 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:27:38,013 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2025-03-09 01:27:38,013 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=263, Invalid=1458, Unknown=1, NotChecked=0, Total=1722 [2025-03-09 01:27:42,172 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-03-09 01:27:46,474 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-03-09 01:27:50,817 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-03-09 01:27:55,141 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-03-09 01:27:59,450 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-03-09 01:28:02,763 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.97s for a HTC check with result VALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-03-09 01:28:02,763 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 49 [2025-03-09 01:28:02,764 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 120 places, 117 transitions, 1211 flow. Second operand has 42 states, 42 states have (on average 10.071428571428571) internal successors, (423), 42 states have internal predecessors, (423), 0 states have call successors, (0), 0 states 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:28:02,764 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 01:28:02,764 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 49 [2025-03-09 01:28:02,764 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 01:28:08,539 INFO L124 PetriNetUnfolderBase]: 4909/8486 cut-off events. [2025-03-09 01:28:08,539 INFO L125 PetriNetUnfolderBase]: For 40396/40404 co-relation queries the response was YES. [2025-03-09 01:28:08,566 INFO L83 FinitePrefix]: Finished finitePrefix Result has 32199 conditions, 8486 events. 4909/8486 cut-off events. For 40396/40404 co-relation queries the response was YES. Maximal size of possible extension queue 329. Compared 57188 event pairs, 1191 based on Foata normal form. 2/8484 useless extension candidates. Maximal degree in co-relation 32084. Up to 3268 conditions per place. [2025-03-09 01:28:08,592 INFO L140 encePairwiseOnDemand]: 34/49 looper letters, 231 selfloop transitions, 127 changer transitions 57/419 dead transitions. [2025-03-09 01:28:08,592 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 146 places, 419 transitions, 4036 flow [2025-03-09 01:28:08,593 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2025-03-09 01:28:08,593 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2025-03-09 01:28:08,594 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 578 transitions. [2025-03-09 01:28:08,595 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.33702623906705537 [2025-03-09 01:28:08,595 INFO L175 Difference]: Start difference. First operand has 120 places, 117 transitions, 1211 flow. Second operand 35 states and 578 transitions. [2025-03-09 01:28:08,595 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 146 places, 419 transitions, 4036 flow [2025-03-09 01:28:08,746 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 132 places, 419 transitions, 3725 flow, removed 140 selfloop flow, removed 14 redundant places. [2025-03-09 01:28:08,749 INFO L231 Difference]: Finished difference. Result has 148 places, 201 transitions, 2547 flow [2025-03-09 01:28:08,750 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=49, PETRI_DIFFERENCE_MINUEND_FLOW=1098, PETRI_DIFFERENCE_MINUEND_PLACES=98, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=117, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=65, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=40, PETRI_DIFFERENCE_SUBTRAHEND_STATES=35, PETRI_FLOW=2547, PETRI_PLACES=148, PETRI_TRANSITIONS=201} [2025-03-09 01:28:08,750 INFO L279 CegarLoopForPetriNet]: 52 programPoint places, 96 predicate places. [2025-03-09 01:28:08,750 INFO L471 AbstractCegarLoop]: Abstraction has has 148 places, 201 transitions, 2547 flow [2025-03-09 01:28:08,750 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 42 states, 42 states have (on average 10.071428571428571) internal successors, (423), 42 states have internal predecessors, (423), 0 states have call successors, (0), 0 states 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:28:08,750 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 01:28:08,750 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 01:28:08,757 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2025-03-09 01:28:08,951 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:28:08,951 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 20 more)] === [2025-03-09 01:28:08,952 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:28:08,952 INFO L85 PathProgramCache]: Analyzing trace with hash -25009309, now seen corresponding path program 1 times [2025-03-09 01:28:08,952 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:28:08,952 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [716563542] [2025-03-09 01:28:08,952 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:28:08,952 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:28:08,958 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 32 statements into 1 equivalence classes. [2025-03-09 01:28:08,965 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 32 of 32 statements. [2025-03-09 01:28:08,965 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:28:08,965 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:28:09,040 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:28:09,041 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:28:09,041 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [716563542] [2025-03-09 01:28:09,041 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [716563542] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 01:28:09,041 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 01:28:09,041 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-09 01:28:09,041 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [417568640] [2025-03-09 01:28:09,041 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 01:28:09,041 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-09 01:28:09,042 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:28:09,042 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-09 01:28:09,042 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2025-03-09 01:28:09,047 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 49 [2025-03-09 01:28:09,048 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 148 places, 201 transitions, 2547 flow. Second operand has 5 states, 5 states have (on average 18.4) internal successors, (92), 5 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:28:09,048 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 01:28:09,048 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 49 [2025-03-09 01:28:09,048 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 01:28:10,197 INFO L124 PetriNetUnfolderBase]: 7240/11824 cut-off events. [2025-03-09 01:28:10,198 INFO L125 PetriNetUnfolderBase]: For 60819/60821 co-relation queries the response was YES. [2025-03-09 01:28:10,234 INFO L83 FinitePrefix]: Finished finitePrefix Result has 45387 conditions, 11824 events. 7240/11824 cut-off events. For 60819/60821 co-relation queries the response was YES. Maximal size of possible extension queue 416. Compared 78410 event pairs, 4056 based on Foata normal form. 1/10594 useless extension candidates. Maximal degree in co-relation 45264. Up to 8586 conditions per place. [2025-03-09 01:28:10,271 INFO L140 encePairwiseOnDemand]: 41/49 looper letters, 267 selfloop transitions, 26 changer transitions 10/306 dead transitions. [2025-03-09 01:28:10,271 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 144 places, 306 transitions, 4301 flow [2025-03-09 01:28:10,272 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-09 01:28:10,272 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-03-09 01:28:10,272 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 134 transitions. [2025-03-09 01:28:10,272 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5469387755102041 [2025-03-09 01:28:10,272 INFO L175 Difference]: Start difference. First operand has 148 places, 201 transitions, 2547 flow. Second operand 5 states and 134 transitions. [2025-03-09 01:28:10,272 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 144 places, 306 transitions, 4301 flow [2025-03-09 01:28:10,584 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 130 places, 306 transitions, 4169 flow, removed 59 selfloop flow, removed 14 redundant places. [2025-03-09 01:28:10,587 INFO L231 Difference]: Finished difference. Result has 133 places, 213 transitions, 2616 flow [2025-03-09 01:28:10,587 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=49, PETRI_DIFFERENCE_MINUEND_FLOW=2419, PETRI_DIFFERENCE_MINUEND_PLACES=126, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=201, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=176, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=2616, PETRI_PLACES=133, PETRI_TRANSITIONS=213} [2025-03-09 01:28:10,588 INFO L279 CegarLoopForPetriNet]: 52 programPoint places, 81 predicate places. [2025-03-09 01:28:10,588 INFO L471 AbstractCegarLoop]: Abstraction has has 133 places, 213 transitions, 2616 flow [2025-03-09 01:28:10,588 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 18.4) internal successors, (92), 5 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:28:10,588 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 01:28:10,588 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 01:28:10,588 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-03-09 01:28:10,588 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 20 more)] === [2025-03-09 01:28:10,588 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:28:10,588 INFO L85 PathProgramCache]: Analyzing trace with hash 1964304271, now seen corresponding path program 2 times [2025-03-09 01:28:10,589 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:28:10,589 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1443921254] [2025-03-09 01:28:10,589 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-09 01:28:10,589 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:28:10,595 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 32 statements into 2 equivalence classes. [2025-03-09 01:28:10,611 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 32 of 32 statements. [2025-03-09 01:28:10,611 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-09 01:28:10,611 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:28:10,795 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:28:10,795 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:28:10,796 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1443921254] [2025-03-09 01:28:10,796 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1443921254] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 01:28:10,796 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1702389040] [2025-03-09 01:28:10,796 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-09 01:28:10,796 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 01:28:10,796 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 01:28:10,798 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:28:10,799 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:28:10,845 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 32 statements into 2 equivalence classes. [2025-03-09 01:28:10,867 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 32 of 32 statements. [2025-03-09 01:28:10,867 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-09 01:28:10,867 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:28:10,868 INFO L256 TraceCheckSpWp]: Trace formula consists of 223 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-09 01:28:10,869 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 01:28:10,913 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:28:10,913 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 01:28:10,958 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2025-03-09 01:28:10,958 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1702389040] provided 1 perfect and 1 imperfect interpolant sequences [2025-03-09 01:28:10,958 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-03-09 01:28:10,958 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [7, 5] total 10 [2025-03-09 01:28:10,958 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2025221345] [2025-03-09 01:28:10,958 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 01:28:10,958 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-09 01:28:10,959 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:28:10,959 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-09 01:28:10,959 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2025-03-09 01:28:10,963 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 49 [2025-03-09 01:28:10,964 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 133 places, 213 transitions, 2616 flow. Second operand has 4 states, 4 states have (on average 19.75) internal successors, (79), 4 states have internal predecessors, (79), 0 states have call successors, (0), 0 states 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:28:10,964 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 01:28:10,964 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 49 [2025-03-09 01:28:10,964 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 01:28:12,291 INFO L124 PetriNetUnfolderBase]: 7433/12130 cut-off events. [2025-03-09 01:28:12,291 INFO L125 PetriNetUnfolderBase]: For 62907/62911 co-relation queries the response was YES. [2025-03-09 01:28:12,324 INFO L83 FinitePrefix]: Finished finitePrefix Result has 50292 conditions, 12130 events. 7433/12130 cut-off events. For 62907/62911 co-relation queries the response was YES. Maximal size of possible extension queue 429. Compared 79913 event pairs, 1588 based on Foata normal form. 109/12239 useless extension candidates. Maximal degree in co-relation 48969. Up to 6405 conditions per place. [2025-03-09 01:28:12,354 INFO L140 encePairwiseOnDemand]: 44/49 looper letters, 296 selfloop transitions, 16 changer transitions 0/315 dead transitions. [2025-03-09 01:28:12,354 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 136 places, 315 transitions, 4514 flow [2025-03-09 01:28:12,354 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-09 01:28:12,354 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-09 01:28:12,355 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 116 transitions. [2025-03-09 01:28:12,355 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5918367346938775 [2025-03-09 01:28:12,355 INFO L175 Difference]: Start difference. First operand has 133 places, 213 transitions, 2616 flow. Second operand 4 states and 116 transitions. [2025-03-09 01:28:12,355 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 136 places, 315 transitions, 4514 flow [2025-03-09 01:28:12,608 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 136 places, 315 transitions, 4508 flow, removed 3 selfloop flow, removed 0 redundant places. [2025-03-09 01:28:12,611 INFO L231 Difference]: Finished difference. Result has 139 places, 218 transitions, 2719 flow [2025-03-09 01:28:12,611 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=49, PETRI_DIFFERENCE_MINUEND_FLOW=2610, PETRI_DIFFERENCE_MINUEND_PLACES=133, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=213, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=199, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=2719, PETRI_PLACES=139, PETRI_TRANSITIONS=218} [2025-03-09 01:28:12,612 INFO L279 CegarLoopForPetriNet]: 52 programPoint places, 87 predicate places. [2025-03-09 01:28:12,612 INFO L471 AbstractCegarLoop]: Abstraction has has 139 places, 218 transitions, 2719 flow [2025-03-09 01:28:12,612 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 19.75) internal successors, (79), 4 states have internal predecessors, (79), 0 states have call successors, (0), 0 states 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:28:12,612 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 01:28:12,612 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 01:28:12,618 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:28:12,812 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 01:28:12,813 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 20 more)] === [2025-03-09 01:28:12,813 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:28:12,813 INFO L85 PathProgramCache]: Analyzing trace with hash 1971401331, now seen corresponding path program 3 times [2025-03-09 01:28:12,813 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:28:12,813 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [370364137] [2025-03-09 01:28:12,813 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-09 01:28:12,813 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:28:12,819 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 32 statements into 4 equivalence classes. [2025-03-09 01:28:12,832 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 29 of 32 statements. [2025-03-09 01:28:12,832 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-03-09 01:28:12,832 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:28:12,921 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:28:12,921 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:28:12,921 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [370364137] [2025-03-09 01:28:12,921 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [370364137] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 01:28:12,921 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [641831527] [2025-03-09 01:28:12,921 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-09 01:28:12,921 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 01:28:12,921 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 01:28:12,924 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:28:12,925 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:28:12,968 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 32 statements into 4 equivalence classes. [2025-03-09 01:28:12,988 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 29 of 32 statements. [2025-03-09 01:28:12,988 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-03-09 01:28:12,988 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:28:12,989 INFO L256 TraceCheckSpWp]: Trace formula consists of 207 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-09 01:28:12,990 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 01:28:13,022 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2025-03-09 01:28:13,022 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-09 01:28:13,022 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [641831527] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 01:28:13,022 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-09 01:28:13,022 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [7] total 9 [2025-03-09 01:28:13,023 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1396986487] [2025-03-09 01:28:13,023 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 01:28:13,023 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-09 01:28:13,023 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:28:13,023 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-09 01:28:13,023 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2025-03-09 01:28:13,028 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 49 [2025-03-09 01:28:13,029 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 139 places, 218 transitions, 2719 flow. Second operand has 5 states, 5 states have (on average 18.4) internal successors, (92), 5 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:28:13,029 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 01:28:13,029 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 49 [2025-03-09 01:28:13,029 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 01:28:14,071 INFO L124 PetriNetUnfolderBase]: 7649/12483 cut-off events. [2025-03-09 01:28:14,071 INFO L125 PetriNetUnfolderBase]: For 72387/72389 co-relation queries the response was YES. [2025-03-09 01:28:14,101 INFO L83 FinitePrefix]: Finished finitePrefix Result has 55494 conditions, 12483 events. 7649/12483 cut-off events. For 72387/72389 co-relation queries the response was YES. Maximal size of possible extension queue 441. Compared 82556 event pairs, 4083 based on Foata normal form. 45/12528 useless extension candidates. Maximal degree in co-relation 54144. Up to 8990 conditions per place. [2025-03-09 01:28:14,131 INFO L140 encePairwiseOnDemand]: 42/49 looper letters, 252 selfloop transitions, 35 changer transitions 10/300 dead transitions. [2025-03-09 01:28:14,131 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 143 places, 300 transitions, 4232 flow [2025-03-09 01:28:14,132 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-09 01:28:14,132 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-03-09 01:28:14,132 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 131 transitions. [2025-03-09 01:28:14,132 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5346938775510204 [2025-03-09 01:28:14,132 INFO L175 Difference]: Start difference. First operand has 139 places, 218 transitions, 2719 flow. Second operand 5 states and 131 transitions. [2025-03-09 01:28:14,132 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 143 places, 300 transitions, 4232 flow [2025-03-09 01:28:14,426 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 143 places, 300 transitions, 4226 flow, removed 3 selfloop flow, removed 0 redundant places. [2025-03-09 01:28:14,429 INFO L231 Difference]: Finished difference. Result has 146 places, 229 transitions, 2951 flow [2025-03-09 01:28:14,429 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=49, PETRI_DIFFERENCE_MINUEND_FLOW=2717, PETRI_DIFFERENCE_MINUEND_PLACES=139, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=218, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=24, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=187, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=2951, PETRI_PLACES=146, PETRI_TRANSITIONS=229} [2025-03-09 01:28:14,429 INFO L279 CegarLoopForPetriNet]: 52 programPoint places, 94 predicate places. [2025-03-09 01:28:14,429 INFO L471 AbstractCegarLoop]: Abstraction has has 146 places, 229 transitions, 2951 flow [2025-03-09 01:28:14,429 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 18.4) internal successors, (92), 5 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:28:14,429 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 01:28:14,429 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 01:28:14,435 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2025-03-09 01:28:14,631 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,SelfDestructingSolverStorable17 [2025-03-09 01:28:14,631 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 20 more)] === [2025-03-09 01:28:14,632 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:28:14,632 INFO L85 PathProgramCache]: Analyzing trace with hash 211201644, now seen corresponding path program 1 times [2025-03-09 01:28:14,632 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:28:14,632 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1408507027] [2025-03-09 01:28:14,632 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:28:14,632 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:28:14,637 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 32 statements into 1 equivalence classes. [2025-03-09 01:28:14,642 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 32 of 32 statements. [2025-03-09 01:28:14,642 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:28:14,642 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:28:14,703 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:28:14,703 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:28:14,703 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1408507027] [2025-03-09 01:28:14,703 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1408507027] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 01:28:14,703 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 01:28:14,703 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-09 01:28:14,703 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [702424043] [2025-03-09 01:28:14,703 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 01:28:14,703 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-09 01:28:14,704 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:28:14,704 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-09 01:28:14,704 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2025-03-09 01:28:14,707 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 49 [2025-03-09 01:28:14,707 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 146 places, 229 transitions, 2951 flow. Second operand has 5 states, 5 states have (on average 18.4) internal successors, (92), 5 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:28:14,707 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 01:28:14,707 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 49 [2025-03-09 01:28:14,707 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 01:28:16,066 INFO L124 PetriNetUnfolderBase]: 7930/13001 cut-off events. [2025-03-09 01:28:16,066 INFO L125 PetriNetUnfolderBase]: For 85108/85112 co-relation queries the response was YES. [2025-03-09 01:28:16,117 INFO L83 FinitePrefix]: Finished finitePrefix Result has 60895 conditions, 13001 events. 7930/13001 cut-off events. For 85108/85112 co-relation queries the response was YES. Maximal size of possible extension queue 452. Compared 86741 event pairs, 3633 based on Foata normal form. 229/13230 useless extension candidates. Maximal degree in co-relation 59469. Up to 8671 conditions per place. [2025-03-09 01:28:16,161 INFO L140 encePairwiseOnDemand]: 41/49 looper letters, 270 selfloop transitions, 45 changer transitions 14/332 dead transitions. [2025-03-09 01:28:16,161 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 148 places, 332 transitions, 4978 flow [2025-03-09 01:28:16,162 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-09 01:28:16,162 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-03-09 01:28:16,162 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 132 transitions. [2025-03-09 01:28:16,162 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5387755102040817 [2025-03-09 01:28:16,162 INFO L175 Difference]: Start difference. First operand has 146 places, 229 transitions, 2951 flow. Second operand 5 states and 132 transitions. [2025-03-09 01:28:16,162 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 148 places, 332 transitions, 4978 flow [2025-03-09 01:28:16,552 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 147 places, 332 transitions, 4929 flow, removed 5 selfloop flow, removed 1 redundant places. [2025-03-09 01:28:16,556 INFO L231 Difference]: Finished difference. Result has 150 places, 235 transitions, 3207 flow [2025-03-09 01:28:16,556 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=49, PETRI_DIFFERENCE_MINUEND_FLOW=2859, PETRI_DIFFERENCE_MINUEND_PLACES=143, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=223, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=29, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=179, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=3207, PETRI_PLACES=150, PETRI_TRANSITIONS=235} [2025-03-09 01:28:16,556 INFO L279 CegarLoopForPetriNet]: 52 programPoint places, 98 predicate places. [2025-03-09 01:28:16,556 INFO L471 AbstractCegarLoop]: Abstraction has has 150 places, 235 transitions, 3207 flow [2025-03-09 01:28:16,556 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 18.4) internal successors, (92), 5 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:28:16,556 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 01:28:16,556 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 01:28:16,556 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-03-09 01:28:16,557 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 20 more)] === [2025-03-09 01:28:16,557 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:28:16,557 INFO L85 PathProgramCache]: Analyzing trace with hash -640186538, now seen corresponding path program 2 times [2025-03-09 01:28:16,557 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:28:16,557 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1170492306] [2025-03-09 01:28:16,557 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-09 01:28:16,557 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:28:16,563 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 32 statements into 2 equivalence classes. [2025-03-09 01:28:16,578 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 32 of 32 statements. [2025-03-09 01:28:16,578 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-09 01:28:16,578 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:28:16,718 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:28:16,718 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:28:16,718 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1170492306] [2025-03-09 01:28:16,718 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1170492306] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 01:28:16,718 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1822797071] [2025-03-09 01:28:16,718 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-09 01:28:16,718 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 01:28:16,718 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 01:28:16,724 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:28:16,733 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:28:16,783 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 32 statements into 2 equivalence classes. [2025-03-09 01:28:16,809 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 32 of 32 statements. [2025-03-09 01:28:16,809 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-09 01:28:16,810 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:28:16,810 INFO L256 TraceCheckSpWp]: Trace formula consists of 223 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-09 01:28:16,815 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 01:28:16,845 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:28:16,845 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 01:28:16,875 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2025-03-09 01:28:16,876 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1822797071] provided 1 perfect and 1 imperfect interpolant sequences [2025-03-09 01:28:16,876 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-03-09 01:28:16,876 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [7, 5] total 10 [2025-03-09 01:28:16,876 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [433663400] [2025-03-09 01:28:16,876 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 01:28:16,876 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-09 01:28:16,876 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:28:16,876 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-09 01:28:16,877 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2025-03-09 01:28:16,880 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 49 [2025-03-09 01:28:16,880 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 150 places, 235 transitions, 3207 flow. Second operand has 4 states, 4 states have (on average 19.75) internal successors, (79), 4 states have internal predecessors, (79), 0 states have call successors, (0), 0 states 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:28:16,880 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 01:28:16,880 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 49 [2025-03-09 01:28:16,880 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 01:28:18,202 INFO L124 PetriNetUnfolderBase]: 7898/12967 cut-off events. [2025-03-09 01:28:18,202 INFO L125 PetriNetUnfolderBase]: For 91168/91170 co-relation queries the response was YES. [2025-03-09 01:28:18,251 INFO L83 FinitePrefix]: Finished finitePrefix Result has 63836 conditions, 12967 events. 7898/12967 cut-off events. For 91168/91170 co-relation queries the response was YES. Maximal size of possible extension queue 447. Compared 86538 event pairs, 1622 based on Foata normal form. 113/13080 useless extension candidates. Maximal degree in co-relation 62708. Up to 6676 conditions per place. [2025-03-09 01:28:18,288 INFO L140 encePairwiseOnDemand]: 44/49 looper letters, 283 selfloop transitions, 28 changer transitions 0/314 dead transitions. [2025-03-09 01:28:18,288 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 152 places, 314 transitions, 4841 flow [2025-03-09 01:28:18,289 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-09 01:28:18,289 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-09 01:28:18,289 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 117 transitions. [2025-03-09 01:28:18,289 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5969387755102041 [2025-03-09 01:28:18,289 INFO L175 Difference]: Start difference. First operand has 150 places, 235 transitions, 3207 flow. Second operand 4 states and 117 transitions. [2025-03-09 01:28:18,289 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 152 places, 314 transitions, 4841 flow [2025-03-09 01:28:18,635 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 151 places, 314 transitions, 4833 flow, removed 4 selfloop flow, removed 1 redundant places. [2025-03-09 01:28:18,638 INFO L231 Difference]: Finished difference. Result has 153 places, 239 transitions, 3405 flow [2025-03-09 01:28:18,638 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=49, PETRI_DIFFERENCE_MINUEND_FLOW=3176, PETRI_DIFFERENCE_MINUEND_PLACES=148, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=233, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=22, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=205, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=3405, PETRI_PLACES=153, PETRI_TRANSITIONS=239} [2025-03-09 01:28:18,639 INFO L279 CegarLoopForPetriNet]: 52 programPoint places, 101 predicate places. [2025-03-09 01:28:18,639 INFO L471 AbstractCegarLoop]: Abstraction has has 153 places, 239 transitions, 3405 flow [2025-03-09 01:28:18,639 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 19.75) internal successors, (79), 4 states have internal predecessors, (79), 0 states have call successors, (0), 0 states 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:28:18,639 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 01:28:18,639 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 01:28:18,644 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2025-03-09 01:28:18,839 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 01:28:18,840 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 20 more)] === [2025-03-09 01:28:18,840 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:28:18,840 INFO L85 PathProgramCache]: Analyzing trace with hash -2106728538, now seen corresponding path program 3 times [2025-03-09 01:28:18,840 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:28:18,840 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1616596996] [2025-03-09 01:28:18,841 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-09 01:28:18,841 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:28:18,845 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 32 statements into 4 equivalence classes. [2025-03-09 01:28:18,856 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 29 of 32 statements. [2025-03-09 01:28:18,856 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-03-09 01:28:18,856 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:28:18,930 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:28:18,931 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:28:18,931 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1616596996] [2025-03-09 01:28:18,931 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1616596996] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 01:28:18,931 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [892950808] [2025-03-09 01:28:18,931 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-09 01:28:18,932 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 01:28:18,932 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 01:28:18,934 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:28:18,936 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:28:18,996 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 32 statements into 4 equivalence classes. [2025-03-09 01:28:19,020 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 29 of 32 statements. [2025-03-09 01:28:19,020 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-03-09 01:28:19,020 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:28:19,021 INFO L256 TraceCheckSpWp]: Trace formula consists of 207 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-09 01:28:19,022 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 01:28:19,064 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2025-03-09 01:28:19,065 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-09 01:28:19,065 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [892950808] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 01:28:19,065 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-09 01:28:19,065 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [7] total 8 [2025-03-09 01:28:19,065 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1611514253] [2025-03-09 01:28:19,066 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 01:28:19,066 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-09 01:28:19,066 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:28:19,066 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-09 01:28:19,066 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2025-03-09 01:28:19,068 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 49 [2025-03-09 01:28:19,068 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 153 places, 239 transitions, 3405 flow. Second operand has 5 states, 5 states have (on average 18.4) internal successors, (92), 5 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:28:19,068 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 01:28:19,069 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 49 [2025-03-09 01:28:19,069 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 01:28:20,194 INFO L124 PetriNetUnfolderBase]: 6740/11017 cut-off events. [2025-03-09 01:28:20,194 INFO L125 PetriNetUnfolderBase]: For 94330/94330 co-relation queries the response was YES. [2025-03-09 01:28:20,251 INFO L83 FinitePrefix]: Finished finitePrefix Result has 57644 conditions, 11017 events. 6740/11017 cut-off events. For 94330/94330 co-relation queries the response was YES. Maximal size of possible extension queue 362. Compared 70465 event pairs, 2623 based on Foata normal form. 204/11221 useless extension candidates. Maximal degree in co-relation 57294. Up to 6030 conditions per place. [2025-03-09 01:28:20,282 INFO L140 encePairwiseOnDemand]: 43/49 looper letters, 199 selfloop transitions, 38 changer transitions 32/272 dead transitions. [2025-03-09 01:28:20,282 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 157 places, 272 transitions, 4139 flow [2025-03-09 01:28:20,283 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-09 01:28:20,283 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-03-09 01:28:20,283 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 137 transitions. [2025-03-09 01:28:20,283 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5591836734693878 [2025-03-09 01:28:20,283 INFO L175 Difference]: Start difference. First operand has 153 places, 239 transitions, 3405 flow. Second operand 5 states and 137 transitions. [2025-03-09 01:28:20,284 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 157 places, 272 transitions, 4139 flow [2025-03-09 01:28:20,640 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 154 places, 272 transitions, 4092 flow, removed 7 selfloop flow, removed 3 redundant places. [2025-03-09 01:28:20,645 INFO L231 Difference]: Finished difference. Result has 156 places, 195 transitions, 2736 flow [2025-03-09 01:28:20,646 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=49, PETRI_DIFFERENCE_MINUEND_FLOW=3042, PETRI_DIFFERENCE_MINUEND_PLACES=150, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=217, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=37, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=179, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=2736, PETRI_PLACES=156, PETRI_TRANSITIONS=195} [2025-03-09 01:28:20,646 INFO L279 CegarLoopForPetriNet]: 52 programPoint places, 104 predicate places. [2025-03-09 01:28:20,646 INFO L471 AbstractCegarLoop]: Abstraction has has 156 places, 195 transitions, 2736 flow [2025-03-09 01:28:20,646 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 18.4) internal successors, (92), 5 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:28:20,646 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 01:28:20,646 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 01:28:20,652 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2025-03-09 01:28:20,847 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable20 [2025-03-09 01:28:20,847 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 20 more)] === [2025-03-09 01:28:20,847 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:28:20,848 INFO L85 PathProgramCache]: Analyzing trace with hash 635650577, now seen corresponding path program 4 times [2025-03-09 01:28:20,848 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:28:20,848 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [729736524] [2025-03-09 01:28:20,848 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-09 01:28:20,848 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:28:20,852 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 32 statements into 2 equivalence classes. [2025-03-09 01:28:20,857 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 32 of 32 statements. [2025-03-09 01:28:20,857 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-03-09 01:28:20,857 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:28:20,935 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:28:20,936 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:28:20,936 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [729736524] [2025-03-09 01:28:20,936 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [729736524] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 01:28:20,936 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1616531866] [2025-03-09 01:28:20,936 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-09 01:28:20,936 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 01:28:20,936 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 01:28:20,938 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:28:20,940 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:28:20,982 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 32 statements into 2 equivalence classes. [2025-03-09 01:28:21,004 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 32 of 32 statements. [2025-03-09 01:28:21,004 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-03-09 01:28:21,004 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:28:21,005 INFO L256 TraceCheckSpWp]: Trace formula consists of 223 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-09 01:28:21,006 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 01:28:21,026 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2025-03-09 01:28:21,027 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-09 01:28:21,027 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1616531866] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 01:28:21,027 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-09 01:28:21,027 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [7] total 8 [2025-03-09 01:28:21,027 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1599401074] [2025-03-09 01:28:21,027 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 01:28:21,027 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-09 01:28:21,027 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:28:21,027 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-09 01:28:21,027 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2025-03-09 01:28:21,038 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 49 [2025-03-09 01:28:21,038 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 156 places, 195 transitions, 2736 flow. Second operand has 5 states, 5 states have (on average 18.4) internal successors, (92), 5 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:28:21,038 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 01:28:21,038 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 49 [2025-03-09 01:28:21,038 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 01:28:21,817 INFO L124 PetriNetUnfolderBase]: 5597/8999 cut-off events. [2025-03-09 01:28:21,817 INFO L125 PetriNetUnfolderBase]: For 76484/76484 co-relation queries the response was YES. [2025-03-09 01:28:21,851 INFO L83 FinitePrefix]: Finished finitePrefix Result has 48023 conditions, 8999 events. 5597/8999 cut-off events. For 76484/76484 co-relation queries the response was YES. Maximal size of possible extension queue 281. Compared 53704 event pairs, 1930 based on Foata normal form. 96/9095 useless extension candidates. Maximal degree in co-relation 47972. Up to 4924 conditions per place. [2025-03-09 01:28:21,878 INFO L140 encePairwiseOnDemand]: 43/49 looper letters, 181 selfloop transitions, 23 changer transitions 29/236 dead transitions. [2025-03-09 01:28:21,878 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 155 places, 236 transitions, 3569 flow [2025-03-09 01:28:21,878 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-09 01:28:21,879 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-03-09 01:28:21,879 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 133 transitions. [2025-03-09 01:28:21,879 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5428571428571428 [2025-03-09 01:28:21,879 INFO L175 Difference]: Start difference. First operand has 156 places, 195 transitions, 2736 flow. Second operand 5 states and 133 transitions. [2025-03-09 01:28:21,879 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 155 places, 236 transitions, 3569 flow [2025-03-09 01:28:22,109 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 148 places, 236 transitions, 3361 flow, removed 26 selfloop flow, removed 7 redundant places. [2025-03-09 01:28:22,112 INFO L231 Difference]: Finished difference. Result has 150 places, 173 transitions, 2278 flow [2025-03-09 01:28:22,112 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=49, PETRI_DIFFERENCE_MINUEND_FLOW=2410, PETRI_DIFFERENCE_MINUEND_PLACES=144, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=185, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=23, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=162, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=2278, PETRI_PLACES=150, PETRI_TRANSITIONS=173} [2025-03-09 01:28:22,113 INFO L279 CegarLoopForPetriNet]: 52 programPoint places, 98 predicate places. [2025-03-09 01:28:22,113 INFO L471 AbstractCegarLoop]: Abstraction has has 150 places, 173 transitions, 2278 flow [2025-03-09 01:28:22,113 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 18.4) internal successors, (92), 5 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:28:22,113 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 01:28:22,113 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 01:28:22,119 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Ended with exit code 0 [2025-03-09 01:28:22,313 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,SelfDestructingSolverStorable21 [2025-03-09 01:28:22,314 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 20 more)] === [2025-03-09 01:28:22,314 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:28:22,315 INFO L85 PathProgramCache]: Analyzing trace with hash 1548557247, now seen corresponding path program 1 times [2025-03-09 01:28:22,315 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:28:22,315 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1255507097] [2025-03-09 01:28:22,315 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:28:22,315 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:28:22,320 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 35 statements into 1 equivalence classes. [2025-03-09 01:28:22,333 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 35 of 35 statements. [2025-03-09 01:28:22,334 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:28:22,334 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:28:23,268 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 6 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 01:28:23,268 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:28:23,268 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1255507097] [2025-03-09 01:28:23,268 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1255507097] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 01:28:23,268 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2009347548] [2025-03-09 01:28:23,268 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:28:23,268 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 01:28:23,268 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 01:28:23,270 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:28:23,270 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:28:23,310 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 35 statements into 1 equivalence classes. [2025-03-09 01:28:23,338 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 35 of 35 statements. [2025-03-09 01:28:23,338 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:28:23,338 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:28:23,339 INFO L256 TraceCheckSpWp]: Trace formula consists of 228 conjuncts, 38 conjuncts are in the unsatisfiable core [2025-03-09 01:28:23,341 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 01:28:23,391 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 1 [2025-03-09 01:28:23,735 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 5 proven. 9 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-09 01:28:23,735 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 01:28:24,717 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 80 treesize of output 72 [2025-03-09 01:28:24,750 INFO L349 Elim1Store]: treesize reduction 13, result has 64.9 percent of original size [2025-03-09 01:28:24,750 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 173 treesize of output 144 [2025-03-09 01:28:25,207 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 5 proven. 9 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-09 01:28:25,208 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2009347548] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-09 01:28:25,208 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-09 01:28:25,208 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 13, 13] total 39 [2025-03-09 01:28:25,208 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [537838979] [2025-03-09 01:28:25,208 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-09 01:28:25,208 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 40 states [2025-03-09 01:28:25,208 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:28:25,209 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2025-03-09 01:28:25,209 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=185, Invalid=1375, Unknown=0, NotChecked=0, Total=1560 [2025-03-09 01:28:26,753 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 49 [2025-03-09 01:28:26,754 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 150 places, 173 transitions, 2278 flow. Second operand has 40 states, 40 states have (on average 16.325) internal successors, (653), 40 states have internal predecessors, (653), 0 states have call successors, (0), 0 states 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:28:26,754 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 01:28:26,754 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 49 [2025-03-09 01:28:26,754 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand