./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/weaver/unroll-3.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/unroll-3.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 a4cca88acec68e5dbb90cd5700ef248bb5273dc097847f9475a683bfbdc7b189 --- Real Ultimate output --- This is Ultimate 0.3.0-?-e2fb8be-m [2025-03-09 01:30:24,982 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-09 01:30:25,048 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2025-03-09 01:30:25,051 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-09 01:30:25,051 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-09 01:30:25,065 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-09 01:30:25,065 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-09 01:30:25,065 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-09 01:30:25,066 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-09 01:30:25,066 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-09 01:30:25,066 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-09 01:30:25,066 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-09 01:30:25,066 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-09 01:30:25,066 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-09 01:30:25,066 INFO L153 SettingsManager]: * Use SBE=true [2025-03-09 01:30:25,066 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-09 01:30:25,067 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-09 01:30:25,067 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-09 01:30:25,067 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-09 01:30:25,067 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-09 01:30:25,067 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2025-03-09 01:30:25,067 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2025-03-09 01:30:25,067 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2025-03-09 01:30:25,067 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-09 01:30:25,067 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-03-09 01:30:25,067 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-03-09 01:30:25,068 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-09 01:30:25,068 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-09 01:30:25,068 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-09 01:30:25,068 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-09 01:30:25,068 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-09 01:30:25,068 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-09 01:30:25,068 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-09 01:30:25,068 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-09 01:30:25,068 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-09 01:30:25,068 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-09 01:30:25,068 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-09 01:30:25,069 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-09 01:30:25,069 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-09 01:30:25,069 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-09 01:30:25,069 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-09 01:30:25,069 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-09 01:30:25,069 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 -> a4cca88acec68e5dbb90cd5700ef248bb5273dc097847f9475a683bfbdc7b189 [2025-03-09 01:30:25,308 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-09 01:30:25,316 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-09 01:30:25,318 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-09 01:30:25,320 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-09 01:30:25,320 INFO L274 PluginConnector]: CDTParser initialized [2025-03-09 01:30:25,321 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/weaver/unroll-3.wvr.c [2025-03-09 01:30:26,478 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3e09efd42/0ad2adda950342b38ac453f3e36e25ad/FLAG894b8ed0a [2025-03-09 01:30:26,721 INFO L384 CDTParser]: Found 1 translation units. [2025-03-09 01:30:26,723 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/weaver/unroll-3.wvr.c [2025-03-09 01:30:26,730 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3e09efd42/0ad2adda950342b38ac453f3e36e25ad/FLAG894b8ed0a [2025-03-09 01:30:26,742 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3e09efd42/0ad2adda950342b38ac453f3e36e25ad [2025-03-09 01:30:26,744 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-09 01:30:26,746 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-09 01:30:26,747 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-09 01:30:26,748 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-09 01:30:26,750 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-09 01:30:26,751 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.03 01:30:26" (1/1) ... [2025-03-09 01:30:26,752 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@755836d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:30:26, skipping insertion in model container [2025-03-09 01:30:26,753 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.03 01:30:26" (1/1) ... [2025-03-09 01:30:26,765 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-09 01:30:26,897 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:30:26,902 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-09 01:30:26,911 INFO L200 MainTranslator]: Completed pre-run [2025-03-09 01:30:26,930 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-09 01:30:26,941 INFO L204 MainTranslator]: Completed translation [2025-03-09 01:30:26,941 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:30:26 WrapperNode [2025-03-09 01:30:26,942 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-09 01:30:26,942 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-09 01:30:26,943 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-09 01:30:26,943 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-09 01:30:26,946 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:30:26" (1/1) ... [2025-03-09 01:30:26,951 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:30:26" (1/1) ... [2025-03-09 01:30:26,964 INFO L138 Inliner]: procedures = 23, calls = 25, calls flagged for inlining = 13, calls inlined = 13, statements flattened = 130 [2025-03-09 01:30:26,964 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-09 01:30:26,965 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-09 01:30:26,965 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-09 01:30:26,965 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-09 01:30:26,971 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:30:26" (1/1) ... [2025-03-09 01:30:26,971 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:30:26" (1/1) ... [2025-03-09 01:30:26,973 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:30:26" (1/1) ... [2025-03-09 01:30:26,982 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:30:26,983 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:30:26" (1/1) ... [2025-03-09 01:30:26,983 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:30:26" (1/1) ... [2025-03-09 01:30:26,986 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:30:26" (1/1) ... [2025-03-09 01:30:26,987 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:30:26" (1/1) ... [2025-03-09 01:30:26,990 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:30:26" (1/1) ... [2025-03-09 01:30:26,990 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:30:26" (1/1) ... [2025-03-09 01:30:26,992 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-09 01:30:26,992 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-09 01:30:26,992 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-09 01:30:26,993 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-09 01:30:26,993 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:30:26" (1/1) ... [2025-03-09 01:30:26,996 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-09 01:30:27,005 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 01:30:27,015 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:30:27,019 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:30:27,038 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-09 01:30:27,038 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2025-03-09 01:30:27,038 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2025-03-09 01:30:27,038 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2025-03-09 01:30:27,038 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2025-03-09 01:30:27,040 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-09 01:30:27,040 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-03-09 01:30:27,040 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-03-09 01:30:27,040 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-03-09 01:30:27,040 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-03-09 01:30:27,040 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-09 01:30:27,040 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-09 01:30:27,040 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-03-09 01:30:27,040 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-03-09 01:30:27,041 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:30:27,117 INFO L256 CfgBuilder]: Building ICFG [2025-03-09 01:30:27,119 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-09 01:30:27,370 INFO L303 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-03-09 01:30:27,371 INFO L307 CfgBuilder]: Performing block encoding [2025-03-09 01:30:27,532 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-09 01:30:27,533 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-09 01:30:27,533 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 09.03 01:30:27 BoogieIcfgContainer [2025-03-09 01:30:27,533 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-09 01:30:27,539 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-09 01:30:27,539 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-09 01:30:27,543 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-09 01:30:27,544 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.03 01:30:26" (1/3) ... [2025-03-09 01:30:27,545 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@14fecdaf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.03 01:30:27, skipping insertion in model container [2025-03-09 01:30:27,545 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:30:26" (2/3) ... [2025-03-09 01:30:27,545 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@14fecdaf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.03 01:30:27, skipping insertion in model container [2025-03-09 01:30:27,546 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 09.03 01:30:27" (3/3) ... [2025-03-09 01:30:27,547 INFO L128 eAbstractionObserver]: Analyzing ICFG unroll-3.wvr.c [2025-03-09 01:30:27,559 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-09 01:30:27,561 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG unroll-3.wvr.c that has 3 procedures, 35 locations, 1 initial locations, 3 loop locations, and 12 error locations. [2025-03-09 01:30:27,561 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-03-09 01:30:27,627 INFO L143 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2025-03-09 01:30:27,663 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 41 places, 37 transitions, 88 flow [2025-03-09 01:30:27,690 INFO L124 PetriNetUnfolderBase]: 3/35 cut-off events. [2025-03-09 01:30:27,695 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2025-03-09 01:30:27,699 INFO L83 FinitePrefix]: Finished finitePrefix Result has 44 conditions, 35 events. 3/35 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 52 event pairs, 0 based on Foata normal form. 0/20 useless extension candidates. Maximal degree in co-relation 23. Up to 2 conditions per place. [2025-03-09 01:30:27,700 INFO L82 GeneralOperation]: Start removeDead. Operand has 41 places, 37 transitions, 88 flow [2025-03-09 01:30:27,706 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 38 places, 34 transitions, 80 flow [2025-03-09 01:30:27,715 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-09 01:30:27,746 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;@91ee544, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-09 01:30:27,747 INFO L334 AbstractCegarLoop]: Starting to check reachability of 22 error locations. [2025-03-09 01:30:27,753 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-09 01:30:27,753 INFO L124 PetriNetUnfolderBase]: 1/4 cut-off events. [2025-03-09 01:30:27,754 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-09 01:30:27,754 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 01:30:27,755 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2025-03-09 01:30:27,755 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 19 more)] === [2025-03-09 01:30:27,759 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:30:27,760 INFO L85 PathProgramCache]: Analyzing trace with hash 387306, now seen corresponding path program 1 times [2025-03-09 01:30:27,765 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:30:27,766 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1715224215] [2025-03-09 01:30:27,767 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:30:27,767 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:30:27,828 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-03-09 01:30:27,846 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-03-09 01:30:27,847 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:30:27,847 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:30:27,946 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:30:27,947 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:30:27,947 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1715224215] [2025-03-09 01:30:27,947 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1715224215] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 01:30:27,949 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 01:30:27,950 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-03-09 01:30:27,951 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1353413333] [2025-03-09 01:30:27,952 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 01:30:27,957 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-09 01:30:27,960 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:30:27,977 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-09 01:30:27,977 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-09 01:30:27,994 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 37 [2025-03-09 01:30:27,996 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 38 places, 34 transitions, 80 flow. Second operand has 3 states, 3 states have (on average 14.0) internal successors, (42), 3 states have internal predecessors, (42), 0 states have call successors, (0), 0 states 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:30:27,997 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 01:30:27,997 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 37 [2025-03-09 01:30:27,997 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 01:30:28,098 INFO L124 PetriNetUnfolderBase]: 88/211 cut-off events. [2025-03-09 01:30:28,099 INFO L125 PetriNetUnfolderBase]: For 17/17 co-relation queries the response was YES. [2025-03-09 01:30:28,100 INFO L83 FinitePrefix]: Finished finitePrefix Result has 387 conditions, 211 events. 88/211 cut-off events. For 17/17 co-relation queries the response was YES. Maximal size of possible extension queue 25. Compared 876 event pairs, 64 based on Foata normal form. 1/161 useless extension candidates. Maximal degree in co-relation 332. Up to 153 conditions per place. [2025-03-09 01:30:28,102 INFO L140 encePairwiseOnDemand]: 33/37 looper letters, 19 selfloop transitions, 2 changer transitions 0/31 dead transitions. [2025-03-09 01:30:28,102 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 37 places, 31 transitions, 116 flow [2025-03-09 01:30:28,103 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-09 01:30:28,104 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-09 01:30:28,113 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 62 transitions. [2025-03-09 01:30:28,114 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5585585585585585 [2025-03-09 01:30:28,115 INFO L175 Difference]: Start difference. First operand has 38 places, 34 transitions, 80 flow. Second operand 3 states and 62 transitions. [2025-03-09 01:30:28,116 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 37 places, 31 transitions, 116 flow [2025-03-09 01:30:28,120 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 33 places, 31 transitions, 108 flow, removed 0 selfloop flow, removed 4 redundant places. [2025-03-09 01:30:28,122 INFO L231 Difference]: Finished difference. Result has 33 places, 31 transitions, 70 flow [2025-03-09 01:30:28,124 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=66, PETRI_DIFFERENCE_MINUEND_PLACES=31, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=31, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=29, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=70, PETRI_PLACES=33, PETRI_TRANSITIONS=31} [2025-03-09 01:30:28,127 INFO L279 CegarLoopForPetriNet]: 38 programPoint places, -5 predicate places. [2025-03-09 01:30:28,128 INFO L471 AbstractCegarLoop]: Abstraction has has 33 places, 31 transitions, 70 flow [2025-03-09 01:30:28,128 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 14.0) internal successors, (42), 3 states have internal predecessors, (42), 0 states have call successors, (0), 0 states 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:30:28,128 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 01:30:28,128 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2025-03-09 01:30:28,128 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-09 01:30:28,129 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 19 more)] === [2025-03-09 01:30:28,129 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:30:28,130 INFO L85 PathProgramCache]: Analyzing trace with hash 387307, now seen corresponding path program 1 times [2025-03-09 01:30:28,130 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:30:28,130 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [577201695] [2025-03-09 01:30:28,130 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:30:28,130 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:30:28,138 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-03-09 01:30:28,162 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-03-09 01:30:28,162 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:30:28,162 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:30:28,373 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:30:28,373 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:30:28,373 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [577201695] [2025-03-09 01:30:28,374 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [577201695] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 01:30:28,374 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 01:30:28,374 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-09 01:30:28,374 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1480448539] [2025-03-09 01:30:28,374 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 01:30:28,375 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-09 01:30:28,375 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:30:28,375 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-09 01:30:28,375 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-09 01:30:28,401 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 37 [2025-03-09 01:30:28,401 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 33 places, 31 transitions, 70 flow. Second operand has 4 states, 4 states have (on average 13.75) internal successors, (55), 4 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:30:28,401 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 01:30:28,401 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 37 [2025-03-09 01:30:28,401 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 01:30:28,507 INFO L124 PetriNetUnfolderBase]: 88/213 cut-off events. [2025-03-09 01:30:28,508 INFO L125 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2025-03-09 01:30:28,508 INFO L83 FinitePrefix]: Finished finitePrefix Result has 381 conditions, 213 events. 88/213 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 25. Compared 874 event pairs, 64 based on Foata normal form. 1/163 useless extension candidates. Maximal degree in co-relation 362. Up to 157 conditions per place. [2025-03-09 01:30:28,509 INFO L140 encePairwiseOnDemand]: 33/37 looper letters, 22 selfloop transitions, 2 changer transitions 0/33 dead transitions. [2025-03-09 01:30:28,510 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 35 places, 33 transitions, 122 flow [2025-03-09 01:30:28,511 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-09 01:30:28,511 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-09 01:30:28,512 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 65 transitions. [2025-03-09 01:30:28,512 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5855855855855856 [2025-03-09 01:30:28,512 INFO L175 Difference]: Start difference. First operand has 33 places, 31 transitions, 70 flow. Second operand 3 states and 65 transitions. [2025-03-09 01:30:28,513 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 35 places, 33 transitions, 122 flow [2025-03-09 01:30:28,513 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 33 places, 33 transitions, 118 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-09 01:30:28,515 INFO L231 Difference]: Finished difference. Result has 34 places, 32 transitions, 80 flow [2025-03-09 01:30:28,515 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=66, PETRI_DIFFERENCE_MINUEND_PLACES=31, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=31, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=29, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=80, PETRI_PLACES=34, PETRI_TRANSITIONS=32} [2025-03-09 01:30:28,516 INFO L279 CegarLoopForPetriNet]: 38 programPoint places, -4 predicate places. [2025-03-09 01:30:28,516 INFO L471 AbstractCegarLoop]: Abstraction has has 34 places, 32 transitions, 80 flow [2025-03-09 01:30:28,516 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.75) internal successors, (55), 4 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:30:28,516 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 01:30:28,516 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1] [2025-03-09 01:30:28,517 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-09 01:30:28,517 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 19 more)] === [2025-03-09 01:30:28,517 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:30:28,518 INFO L85 PathProgramCache]: Analyzing trace with hash 372214544, now seen corresponding path program 1 times [2025-03-09 01:30:28,519 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:30:28,519 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [732778855] [2025-03-09 01:30:28,519 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:30:28,519 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:30:28,526 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-03-09 01:30:28,533 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-03-09 01:30:28,533 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:30:28,533 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:30:28,810 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 01:30:28,810 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:30:28,811 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [732778855] [2025-03-09 01:30:28,811 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [732778855] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 01:30:28,811 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [958958967] [2025-03-09 01:30:28,811 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:30:28,811 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 01:30:28,811 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 01:30:28,814 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:30:28,817 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:30:28,853 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-03-09 01:30:28,861 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-03-09 01:30:28,862 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:30:28,862 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:30:28,864 INFO L256 TraceCheckSpWp]: Trace formula consists of 66 conjuncts, 14 conjuncts are in the unsatisfiable core [2025-03-09 01:30:28,866 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 01:30:28,921 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:30:29,028 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:30:29,028 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 01:30:29,104 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:30:29,104 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [958958967] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-09 01:30:29,104 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-09 01:30:29,104 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2025-03-09 01:30:29,104 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1670538178] [2025-03-09 01:30:29,104 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-09 01:30:29,105 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-09 01:30:29,105 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:30:29,105 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-09 01:30:29,105 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2025-03-09 01:30:29,207 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 37 [2025-03-09 01:30:29,208 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 34 places, 32 transitions, 80 flow. Second operand has 11 states, 11 states have (on average 14.363636363636363) internal successors, (158), 11 states have internal predecessors, (158), 0 states have call successors, (0), 0 states 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:30:29,208 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 01:30:29,208 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 37 [2025-03-09 01:30:29,208 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 01:30:29,368 INFO L124 PetriNetUnfolderBase]: 89/215 cut-off events. [2025-03-09 01:30:29,368 INFO L125 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2025-03-09 01:30:29,369 INFO L83 FinitePrefix]: Finished finitePrefix Result has 391 conditions, 215 events. 89/215 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 25. Compared 886 event pairs, 64 based on Foata normal form. 0/165 useless extension candidates. Maximal degree in co-relation 378. Up to 154 conditions per place. [2025-03-09 01:30:29,372 INFO L140 encePairwiseOnDemand]: 32/37 looper letters, 18 selfloop transitions, 8 changer transitions 0/35 dead transitions. [2025-03-09 01:30:29,372 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 39 places, 35 transitions, 140 flow [2025-03-09 01:30:29,373 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-09 01:30:29,373 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-03-09 01:30:29,373 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 119 transitions. [2025-03-09 01:30:29,374 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4594594594594595 [2025-03-09 01:30:29,374 INFO L175 Difference]: Start difference. First operand has 34 places, 32 transitions, 80 flow. Second operand 7 states and 119 transitions. [2025-03-09 01:30:29,374 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 39 places, 35 transitions, 140 flow [2025-03-09 01:30:29,374 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 38 places, 35 transitions, 138 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-09 01:30:29,375 INFO L231 Difference]: Finished difference. Result has 38 places, 35 transitions, 104 flow [2025-03-09 01:30:29,375 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=74, PETRI_DIFFERENCE_MINUEND_PLACES=32, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=31, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=26, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=104, PETRI_PLACES=38, PETRI_TRANSITIONS=35} [2025-03-09 01:30:29,375 INFO L279 CegarLoopForPetriNet]: 38 programPoint places, 0 predicate places. [2025-03-09 01:30:29,375 INFO L471 AbstractCegarLoop]: Abstraction has has 38 places, 35 transitions, 104 flow [2025-03-09 01:30:29,375 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 14.363636363636363) internal successors, (158), 11 states have internal predecessors, (158), 0 states have call successors, (0), 0 states 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:30:29,375 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 01:30:29,375 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 01:30:29,382 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:30:29,580 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:30:29,580 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 19 more)] === [2025-03-09 01:30:29,581 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:30:29,581 INFO L85 PathProgramCache]: Analyzing trace with hash -959581430, now seen corresponding path program 1 times [2025-03-09 01:30:29,581 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:30:29,581 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [382218430] [2025-03-09 01:30:29,581 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:30:29,581 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:30:29,587 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-03-09 01:30:29,591 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-03-09 01:30:29,591 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:30:29,592 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:30:29,620 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:30:29,620 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:30:29,620 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [382218430] [2025-03-09 01:30:29,620 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [382218430] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 01:30:29,620 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 01:30:29,620 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-09 01:30:29,620 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1381588382] [2025-03-09 01:30:29,621 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 01:30:29,621 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-09 01:30:29,621 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:30:29,621 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-09 01:30:29,621 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-09 01:30:29,641 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 37 [2025-03-09 01:30:29,642 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 38 places, 35 transitions, 104 flow. Second operand has 4 states, 4 states have (on average 11.0) internal successors, (44), 4 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:30:29,642 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 01:30:29,642 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 37 [2025-03-09 01:30:29,642 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 01:30:29,687 INFO L124 PetriNetUnfolderBase]: 89/188 cut-off events. [2025-03-09 01:30:29,687 INFO L125 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2025-03-09 01:30:29,687 INFO L83 FinitePrefix]: Finished finitePrefix Result has 372 conditions, 188 events. 89/188 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 620 event pairs, 64 based on Foata normal form. 0/165 useless extension candidates. Maximal degree in co-relation 335. Up to 153 conditions per place. [2025-03-09 01:30:29,688 INFO L140 encePairwiseOnDemand]: 31/37 looper letters, 23 selfloop transitions, 3 changer transitions 0/31 dead transitions. [2025-03-09 01:30:29,688 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 37 places, 31 transitions, 148 flow [2025-03-09 01:30:29,689 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-09 01:30:29,689 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-09 01:30:29,689 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 61 transitions. [2025-03-09 01:30:29,689 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.41216216216216217 [2025-03-09 01:30:29,689 INFO L175 Difference]: Start difference. First operand has 38 places, 35 transitions, 104 flow. Second operand 4 states and 61 transitions. [2025-03-09 01:30:29,689 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 37 places, 31 transitions, 148 flow [2025-03-09 01:30:29,690 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 34 places, 31 transitions, 133 flow, removed 4 selfloop flow, removed 3 redundant places. [2025-03-09 01:30:29,690 INFO L231 Difference]: Finished difference. Result has 34 places, 31 transitions, 87 flow [2025-03-09 01:30:29,690 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=81, PETRI_DIFFERENCE_MINUEND_PLACES=31, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=31, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=28, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=87, PETRI_PLACES=34, PETRI_TRANSITIONS=31} [2025-03-09 01:30:29,691 INFO L279 CegarLoopForPetriNet]: 38 programPoint places, -4 predicate places. [2025-03-09 01:30:29,691 INFO L471 AbstractCegarLoop]: Abstraction has has 34 places, 31 transitions, 87 flow [2025-03-09 01:30:29,691 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.0) internal successors, (44), 4 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:30:29,691 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 01:30:29,691 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 01:30:29,691 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-09 01:30:29,691 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 19 more)] === [2025-03-09 01:30:29,692 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:30:29,692 INFO L85 PathProgramCache]: Analyzing trace with hash -959581429, now seen corresponding path program 1 times [2025-03-09 01:30:29,692 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:30:29,692 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1043668322] [2025-03-09 01:30:29,692 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:30:29,692 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:30:29,697 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-03-09 01:30:29,703 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-03-09 01:30:29,705 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:30:29,705 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:30:29,872 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:30:29,872 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:30:29,872 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1043668322] [2025-03-09 01:30:29,872 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1043668322] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 01:30:29,872 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1516055170] [2025-03-09 01:30:29,872 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:30:29,872 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 01:30:29,873 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 01:30:29,874 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:30:29,876 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:30:29,915 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-03-09 01:30:29,925 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-03-09 01:30:29,925 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:30:29,925 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:30:29,927 INFO L256 TraceCheckSpWp]: Trace formula consists of 95 conjuncts, 15 conjuncts are in the unsatisfiable core [2025-03-09 01:30:29,928 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 01:30:29,938 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:30:30,016 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 01:30:30,016 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 01:30:30,093 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:30:30,093 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1516055170] provided 1 perfect and 1 imperfect interpolant sequences [2025-03-09 01:30:30,093 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-03-09 01:30:30,093 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [3, 3] total 9 [2025-03-09 01:30:30,094 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [317877472] [2025-03-09 01:30:30,094 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 01:30:30,094 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-09 01:30:30,094 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:30:30,094 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-09 01:30:30,094 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2025-03-09 01:30:30,128 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 37 [2025-03-09 01:30:30,128 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 34 places, 31 transitions, 87 flow. Second operand has 5 states, 5 states have (on average 14.6) internal successors, (73), 5 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:30:30,128 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 01:30:30,128 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 37 [2025-03-09 01:30:30,128 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 01:30:30,231 INFO L124 PetriNetUnfolderBase]: 175/337 cut-off events. [2025-03-09 01:30:30,231 INFO L125 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2025-03-09 01:30:30,232 INFO L83 FinitePrefix]: Finished finitePrefix Result has 669 conditions, 337 events. 175/337 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 31. Compared 1344 event pairs, 64 based on Foata normal form. 0/277 useless extension candidates. Maximal degree in co-relation 638. Up to 165 conditions per place. [2025-03-09 01:30:30,236 INFO L140 encePairwiseOnDemand]: 33/37 looper letters, 38 selfloop transitions, 4 changer transitions 0/46 dead transitions. [2025-03-09 01:30:30,236 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 37 places, 46 transitions, 204 flow [2025-03-09 01:30:30,237 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-09 01:30:30,237 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-09 01:30:30,237 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 90 transitions. [2025-03-09 01:30:30,237 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6081081081081081 [2025-03-09 01:30:30,238 INFO L175 Difference]: Start difference. First operand has 34 places, 31 transitions, 87 flow. Second operand 4 states and 90 transitions. [2025-03-09 01:30:30,238 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 37 places, 46 transitions, 204 flow [2025-03-09 01:30:30,238 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 35 places, 46 transitions, 200 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-09 01:30:30,239 INFO L231 Difference]: Finished difference. Result has 36 places, 32 transitions, 100 flow [2025-03-09 01:30:30,239 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=83, PETRI_DIFFERENCE_MINUEND_PLACES=32, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=31, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=27, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=100, PETRI_PLACES=36, PETRI_TRANSITIONS=32} [2025-03-09 01:30:30,239 INFO L279 CegarLoopForPetriNet]: 38 programPoint places, -2 predicate places. [2025-03-09 01:30:30,240 INFO L471 AbstractCegarLoop]: Abstraction has has 36 places, 32 transitions, 100 flow [2025-03-09 01:30:30,240 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 14.6) internal successors, (73), 5 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:30:30,240 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 01:30:30,240 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 01:30:30,248 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-03-09 01:30:30,440 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:30:30,440 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 19 more)] === [2025-03-09 01:30:30,441 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:30:30,441 INFO L85 PathProgramCache]: Analyzing trace with hash 1260228686, now seen corresponding path program 1 times [2025-03-09 01:30:30,441 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:30:30,441 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1161624865] [2025-03-09 01:30:30,441 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:30:30,441 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:30:30,451 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-03-09 01:30:30,458 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-03-09 01:30:30,459 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:30:30,459 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:30:30,622 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 01:30:30,622 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:30:30,622 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1161624865] [2025-03-09 01:30:30,622 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1161624865] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 01:30:30,622 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [372245203] [2025-03-09 01:30:30,622 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:30:30,622 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 01:30:30,623 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 01:30:30,625 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:30:30,627 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:30:30,663 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-03-09 01:30:30,675 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-03-09 01:30:30,676 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:30:30,676 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:30:30,676 INFO L256 TraceCheckSpWp]: Trace formula consists of 105 conjuncts, 12 conjuncts are in the unsatisfiable core [2025-03-09 01:30:30,677 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 01:30:30,785 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 01:30:30,786 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 01:30:30,852 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 32 [2025-03-09 01:30:30,984 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 01:30:30,984 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [372245203] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-09 01:30:30,984 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-09 01:30:30,985 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 15 [2025-03-09 01:30:30,985 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1911647803] [2025-03-09 01:30:30,985 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-09 01:30:30,985 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2025-03-09 01:30:30,985 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:30:30,986 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2025-03-09 01:30:30,986 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=225, Unknown=0, NotChecked=0, Total=272 [2025-03-09 01:30:31,273 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 37 [2025-03-09 01:30:31,274 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 36 places, 32 transitions, 100 flow. Second operand has 17 states, 17 states have (on average 14.764705882352942) internal successors, (251), 17 states have internal predecessors, (251), 0 states have call successors, (0), 0 states 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:30:31,274 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 01:30:31,274 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 37 [2025-03-09 01:30:31,274 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 01:30:31,599 INFO L124 PetriNetUnfolderBase]: 366/744 cut-off events. [2025-03-09 01:30:31,600 INFO L125 PetriNetUnfolderBase]: For 62/62 co-relation queries the response was YES. [2025-03-09 01:30:31,601 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1532 conditions, 744 events. 366/744 cut-off events. For 62/62 co-relation queries the response was YES. Maximal size of possible extension queue 57. Compared 3826 event pairs, 189 based on Foata normal form. 0/625 useless extension candidates. Maximal degree in co-relation 781. Up to 305 conditions per place. [2025-03-09 01:30:31,604 INFO L140 encePairwiseOnDemand]: 29/37 looper letters, 63 selfloop transitions, 11 changer transitions 0/78 dead transitions. [2025-03-09 01:30:31,604 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 43 places, 78 transitions, 358 flow [2025-03-09 01:30:31,605 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-09 01:30:31,605 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2025-03-09 01:30:31,606 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 177 transitions. [2025-03-09 01:30:31,607 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.597972972972973 [2025-03-09 01:30:31,607 INFO L175 Difference]: Start difference. First operand has 36 places, 32 transitions, 100 flow. Second operand 8 states and 177 transitions. [2025-03-09 01:30:31,607 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 43 places, 78 transitions, 358 flow [2025-03-09 01:30:31,608 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 41 places, 78 transitions, 351 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-09 01:30:31,609 INFO L231 Difference]: Finished difference. Result has 44 places, 37 transitions, 154 flow [2025-03-09 01:30:31,610 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=95, PETRI_DIFFERENCE_MINUEND_PLACES=34, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=32, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=22, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=154, PETRI_PLACES=44, PETRI_TRANSITIONS=37} [2025-03-09 01:30:31,610 INFO L279 CegarLoopForPetriNet]: 38 programPoint places, 6 predicate places. [2025-03-09 01:30:31,611 INFO L471 AbstractCegarLoop]: Abstraction has has 44 places, 37 transitions, 154 flow [2025-03-09 01:30:31,612 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 14.764705882352942) internal successors, (251), 17 states have internal predecessors, (251), 0 states have call successors, (0), 0 states 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:30:31,612 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 01:30:31,612 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 01:30:31,618 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-03-09 01:30:31,812 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 01:30:31,812 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting thread2Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 19 more)] === [2025-03-09 01:30:31,813 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:30:31,813 INFO L85 PathProgramCache]: Analyzing trace with hash 1241342345, now seen corresponding path program 1 times [2025-03-09 01:30:31,813 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:30:31,813 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1437835206] [2025-03-09 01:30:31,813 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:30:31,813 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:30:31,817 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-03-09 01:30:31,821 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-03-09 01:30:31,821 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:30:31,821 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:30:31,942 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:30:31,942 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:30:31,942 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1437835206] [2025-03-09 01:30:31,942 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1437835206] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 01:30:31,942 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [118896561] [2025-03-09 01:30:31,943 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:30:31,943 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 01:30:31,943 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 01:30:31,945 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:30:31,946 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:30:31,977 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-03-09 01:30:31,988 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-03-09 01:30:31,988 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:30:31,988 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:30:31,989 INFO L256 TraceCheckSpWp]: Trace formula consists of 111 conjuncts, 15 conjuncts are in the unsatisfiable core [2025-03-09 01:30:31,990 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 01:30:31,995 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:30:32,054 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:30:32,054 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 01:30:32,128 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:30:32,128 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [118896561] provided 1 perfect and 1 imperfect interpolant sequences [2025-03-09 01:30:32,128 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-03-09 01:30:32,128 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [3, 3] total 9 [2025-03-09 01:30:32,128 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1773496664] [2025-03-09 01:30:32,129 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 01:30:32,129 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-09 01:30:32,129 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:30:32,129 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-09 01:30:32,129 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2025-03-09 01:30:32,155 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 37 [2025-03-09 01:30:32,156 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 44 places, 37 transitions, 154 flow. Second operand has 5 states, 5 states have (on average 13.0) internal successors, (65), 5 states have internal predecessors, (65), 0 states have call successors, (0), 0 states 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:30:32,156 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 01:30:32,156 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 37 [2025-03-09 01:30:32,156 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 01:30:32,281 INFO L124 PetriNetUnfolderBase]: 583/1037 cut-off events. [2025-03-09 01:30:32,281 INFO L125 PetriNetUnfolderBase]: For 596/628 co-relation queries the response was YES. [2025-03-09 01:30:32,282 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2579 conditions, 1037 events. 583/1037 cut-off events. For 596/628 co-relation queries the response was YES. Maximal size of possible extension queue 59. Compared 4783 event pairs, 162 based on Foata normal form. 32/941 useless extension candidates. Maximal degree in co-relation 1657. Up to 665 conditions per place. [2025-03-09 01:30:32,286 INFO L140 encePairwiseOnDemand]: 33/37 looper letters, 44 selfloop transitions, 5 changer transitions 0/51 dead transitions. [2025-03-09 01:30:32,286 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 47 places, 51 transitions, 304 flow [2025-03-09 01:30:32,286 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-09 01:30:32,286 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-09 01:30:32,287 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 80 transitions. [2025-03-09 01:30:32,287 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5405405405405406 [2025-03-09 01:30:32,287 INFO L175 Difference]: Start difference. First operand has 44 places, 37 transitions, 154 flow. Second operand 4 states and 80 transitions. [2025-03-09 01:30:32,287 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 47 places, 51 transitions, 304 flow [2025-03-09 01:30:32,289 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 44 places, 51 transitions, 297 flow, removed 0 selfloop flow, removed 3 redundant places. [2025-03-09 01:30:32,291 INFO L231 Difference]: Finished difference. Result has 45 places, 38 transitions, 169 flow [2025-03-09 01:30:32,291 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=147, PETRI_DIFFERENCE_MINUEND_PLACES=41, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=37, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=32, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=169, PETRI_PLACES=45, PETRI_TRANSITIONS=38} [2025-03-09 01:30:32,291 INFO L279 CegarLoopForPetriNet]: 38 programPoint places, 7 predicate places. [2025-03-09 01:30:32,291 INFO L471 AbstractCegarLoop]: Abstraction has has 45 places, 38 transitions, 169 flow [2025-03-09 01:30:32,291 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 13.0) internal successors, (65), 5 states have internal predecessors, (65), 0 states have call successors, (0), 0 states 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:30:32,291 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 01:30:32,291 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 01:30:32,299 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:30:32,492 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 01:30:32,492 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting thread2Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 19 more)] === [2025-03-09 01:30:32,492 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:30:32,493 INFO L85 PathProgramCache]: Analyzing trace with hash -173092541, now seen corresponding path program 1 times [2025-03-09 01:30:32,493 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:30:32,493 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1897683791] [2025-03-09 01:30:32,493 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:30:32,493 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:30:32,497 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-03-09 01:30:32,503 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-03-09 01:30:32,504 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:30:32,504 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:30:32,629 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:30:32,630 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:30:32,630 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1897683791] [2025-03-09 01:30:32,630 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1897683791] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 01:30:32,630 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1339505823] [2025-03-09 01:30:32,630 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:30:32,630 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 01:30:32,630 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 01:30:32,632 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:30:32,640 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:30:32,678 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-03-09 01:30:32,691 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-03-09 01:30:32,692 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:30:32,692 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:30:32,693 INFO L256 TraceCheckSpWp]: Trace formula consists of 120 conjuncts, 12 conjuncts are in the unsatisfiable core [2025-03-09 01:30:32,694 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 01:30:32,773 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:30:32,773 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 01:30:32,803 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 25 [2025-03-09 01:30:32,935 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:30:32,936 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1339505823] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-09 01:30:32,936 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-09 01:30:32,936 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 12 [2025-03-09 01:30:32,936 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1679677841] [2025-03-09 01:30:32,936 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-09 01:30:32,936 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-03-09 01:30:32,936 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:30:32,936 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-03-09 01:30:32,937 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=143, Unknown=0, NotChecked=0, Total=182 [2025-03-09 01:30:33,055 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 37 [2025-03-09 01:30:33,056 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 45 places, 38 transitions, 169 flow. Second operand has 14 states, 14 states have (on average 13.357142857142858) internal successors, (187), 14 states have internal predecessors, (187), 0 states have call successors, (0), 0 states 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:30:33,056 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 01:30:33,056 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 37 [2025-03-09 01:30:33,056 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 01:30:33,296 INFO L124 PetriNetUnfolderBase]: 629/1108 cut-off events. [2025-03-09 01:30:33,297 INFO L125 PetriNetUnfolderBase]: For 722/764 co-relation queries the response was YES. [2025-03-09 01:30:33,298 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2880 conditions, 1108 events. 629/1108 cut-off events. For 722/764 co-relation queries the response was YES. Maximal size of possible extension queue 57. Compared 5083 event pairs, 322 based on Foata normal form. 0/980 useless extension candidates. Maximal degree in co-relation 1781. Up to 841 conditions per place. [2025-03-09 01:30:33,302 INFO L140 encePairwiseOnDemand]: 28/37 looper letters, 58 selfloop transitions, 9 changer transitions 0/69 dead transitions. [2025-03-09 01:30:33,302 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 51 places, 69 transitions, 397 flow [2025-03-09 01:30:33,302 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-09 01:30:33,302 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-03-09 01:30:33,303 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 139 transitions. [2025-03-09 01:30:33,303 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5366795366795367 [2025-03-09 01:30:33,303 INFO L175 Difference]: Start difference. First operand has 45 places, 38 transitions, 169 flow. Second operand 7 states and 139 transitions. [2025-03-09 01:30:33,303 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 51 places, 69 transitions, 397 flow [2025-03-09 01:30:33,305 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 69 transitions, 388 flow, removed 1 selfloop flow, removed 2 redundant places. [2025-03-09 01:30:33,305 INFO L231 Difference]: Finished difference. Result has 50 places, 39 transitions, 190 flow [2025-03-09 01:30:33,306 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=161, PETRI_DIFFERENCE_MINUEND_PLACES=43, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=38, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=29, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=190, PETRI_PLACES=50, PETRI_TRANSITIONS=39} [2025-03-09 01:30:33,306 INFO L279 CegarLoopForPetriNet]: 38 programPoint places, 12 predicate places. [2025-03-09 01:30:33,306 INFO L471 AbstractCegarLoop]: Abstraction has has 50 places, 39 transitions, 190 flow [2025-03-09 01:30:33,306 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 13.357142857142858) internal successors, (187), 14 states have internal predecessors, (187), 0 states have call successors, (0), 0 states 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:30:33,306 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 01:30:33,307 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1] [2025-03-09 01:30:33,313 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2025-03-09 01:30:33,507 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 01:30:33,507 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 19 more)] === [2025-03-09 01:30:33,507 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:30:33,508 INFO L85 PathProgramCache]: Analyzing trace with hash 650455689, now seen corresponding path program 2 times [2025-03-09 01:30:33,508 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:30:33,508 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [883555870] [2025-03-09 01:30:33,508 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-09 01:30:33,508 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:30:33,513 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 12 statements into 2 equivalence classes. [2025-03-09 01:30:33,517 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 6 of 12 statements. [2025-03-09 01:30:33,517 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-09 01:30:33,517 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:30:33,616 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-03-09 01:30:33,616 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:30:33,616 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [883555870] [2025-03-09 01:30:33,616 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [883555870] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 01:30:33,616 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [11823078] [2025-03-09 01:30:33,616 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-09 01:30:33,617 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 01:30:33,617 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 01:30:33,618 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:30:33,620 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:30:33,669 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 12 statements into 2 equivalence classes. [2025-03-09 01:30:33,684 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 6 of 12 statements. [2025-03-09 01:30:33,684 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-09 01:30:33,684 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:30:33,685 INFO L256 TraceCheckSpWp]: Trace formula consists of 82 conjuncts, 20 conjuncts are in the unsatisfiable core [2025-03-09 01:30:33,687 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 01:30:33,700 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:30:33,816 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-03-09 01:30:33,816 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 01:30:33,936 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-03-09 01:30:33,936 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [11823078] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-09 01:30:33,936 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-09 01:30:33,936 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2025-03-09 01:30:33,936 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1533749853] [2025-03-09 01:30:33,936 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-09 01:30:33,936 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-09 01:30:33,936 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:30:33,937 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-09 01:30:33,937 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2025-03-09 01:30:34,060 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 37 [2025-03-09 01:30:34,061 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 50 places, 39 transitions, 190 flow. Second operand has 11 states, 11 states have (on average 15.727272727272727) internal successors, (173), 11 states have internal predecessors, (173), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:30:34,061 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 01:30:34,061 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 37 [2025-03-09 01:30:34,061 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 01:30:34,229 INFO L124 PetriNetUnfolderBase]: 491/943 cut-off events. [2025-03-09 01:30:34,229 INFO L125 PetriNetUnfolderBase]: For 442/442 co-relation queries the response was YES. [2025-03-09 01:30:34,230 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2450 conditions, 943 events. 491/943 cut-off events. For 442/442 co-relation queries the response was YES. Maximal size of possible extension queue 53. Compared 4786 event pairs, 280 based on Foata normal form. 0/879 useless extension candidates. Maximal degree in co-relation 1560. Up to 640 conditions per place. [2025-03-09 01:30:34,234 INFO L140 encePairwiseOnDemand]: 32/37 looper letters, 36 selfloop transitions, 10 changer transitions 0/50 dead transitions. [2025-03-09 01:30:34,234 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 50 transitions, 321 flow [2025-03-09 01:30:34,236 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-09 01:30:34,237 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-03-09 01:30:34,237 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 96 transitions. [2025-03-09 01:30:34,237 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.518918918918919 [2025-03-09 01:30:34,237 INFO L175 Difference]: Start difference. First operand has 50 places, 39 transitions, 190 flow. Second operand 5 states and 96 transitions. [2025-03-09 01:30:34,237 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 50 transitions, 321 flow [2025-03-09 01:30:34,239 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 48 places, 50 transitions, 304 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-03-09 01:30:34,240 INFO L231 Difference]: Finished difference. Result has 48 places, 38 transitions, 189 flow [2025-03-09 01:30:34,240 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=169, PETRI_DIFFERENCE_MINUEND_PLACES=44, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=38, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=28, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=189, PETRI_PLACES=48, PETRI_TRANSITIONS=38} [2025-03-09 01:30:34,241 INFO L279 CegarLoopForPetriNet]: 38 programPoint places, 10 predicate places. [2025-03-09 01:30:34,241 INFO L471 AbstractCegarLoop]: Abstraction has has 48 places, 38 transitions, 189 flow [2025-03-09 01:30:34,241 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 15.727272727272727) internal successors, (173), 11 states have internal predecessors, (173), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:30:34,241 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 01:30:34,241 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 01:30:34,247 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2025-03-09 01:30:34,441 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 01:30:34,442 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting thread2Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 19 more)] === [2025-03-09 01:30:34,442 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:30:34,442 INFO L85 PathProgramCache]: Analyzing trace with hash -1896186264, now seen corresponding path program 2 times [2025-03-09 01:30:34,442 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:30:34,442 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2110802525] [2025-03-09 01:30:34,442 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-09 01:30:34,442 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:30:34,446 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 13 statements into 2 equivalence classes. [2025-03-09 01:30:34,460 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 9 of 13 statements. [2025-03-09 01:30:34,461 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-09 01:30:34,461 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:30:34,607 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-09 01:30:34,607 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:30:34,607 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2110802525] [2025-03-09 01:30:34,607 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2110802525] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 01:30:34,607 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 01:30:34,608 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-09 01:30:34,608 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1346118183] [2025-03-09 01:30:34,608 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 01:30:34,609 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-09 01:30:34,609 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:30:34,609 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-09 01:30:34,609 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-09 01:30:34,665 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 37 [2025-03-09 01:30:34,665 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 48 places, 38 transitions, 189 flow. Second operand has 5 states, 5 states have (on average 13.2) internal successors, (66), 5 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:30:34,665 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 01:30:34,665 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 37 [2025-03-09 01:30:34,666 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 01:30:34,779 INFO L124 PetriNetUnfolderBase]: 537/949 cut-off events. [2025-03-09 01:30:34,779 INFO L125 PetriNetUnfolderBase]: For 1139/1139 co-relation queries the response was YES. [2025-03-09 01:30:34,780 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2697 conditions, 949 events. 537/949 cut-off events. For 1139/1139 co-relation queries the response was YES. Maximal size of possible extension queue 47. Compared 4199 event pairs, 322 based on Foata normal form. 32/885 useless extension candidates. Maximal degree in co-relation 1659. Up to 684 conditions per place. [2025-03-09 01:30:34,783 INFO L140 encePairwiseOnDemand]: 31/37 looper letters, 37 selfloop transitions, 8 changer transitions 0/46 dead transitions. [2025-03-09 01:30:34,784 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 50 places, 46 transitions, 330 flow [2025-03-09 01:30:34,784 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-09 01:30:34,784 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-03-09 01:30:34,785 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 85 transitions. [2025-03-09 01:30:34,785 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4594594594594595 [2025-03-09 01:30:34,785 INFO L175 Difference]: Start difference. First operand has 48 places, 38 transitions, 189 flow. Second operand 5 states and 85 transitions. [2025-03-09 01:30:34,786 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 50 places, 46 transitions, 330 flow [2025-03-09 01:30:34,787 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 46 places, 46 transitions, 298 flow, removed 0 selfloop flow, removed 4 redundant places. [2025-03-09 01:30:34,788 INFO L231 Difference]: Finished difference. Result has 46 places, 36 transitions, 177 flow [2025-03-09 01:30:34,788 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=161, PETRI_DIFFERENCE_MINUEND_PLACES=42, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=36, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=28, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=177, PETRI_PLACES=46, PETRI_TRANSITIONS=36} [2025-03-09 01:30:34,789 INFO L279 CegarLoopForPetriNet]: 38 programPoint places, 8 predicate places. [2025-03-09 01:30:34,789 INFO L471 AbstractCegarLoop]: Abstraction has has 46 places, 36 transitions, 177 flow [2025-03-09 01:30:34,790 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 13.2) internal successors, (66), 5 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:30:34,790 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 01:30:34,790 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 01:30:34,790 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-09 01:30:34,790 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting thread2Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 19 more)] === [2025-03-09 01:30:34,790 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:30:34,790 INFO L85 PathProgramCache]: Analyzing trace with hash 1656261263, now seen corresponding path program 1 times [2025-03-09 01:30:34,791 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:30:34,791 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [84137808] [2025-03-09 01:30:34,791 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:30:34,791 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:30:34,795 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-03-09 01:30:34,802 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-03-09 01:30:34,802 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:30:34,802 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:30:34,941 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 01:30:34,941 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:30:34,941 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [84137808] [2025-03-09 01:30:34,941 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [84137808] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 01:30:34,942 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [308907588] [2025-03-09 01:30:34,942 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:30:34,942 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 01:30:34,942 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 01:30:34,944 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:30:34,945 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:30:34,981 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-03-09 01:30:34,994 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-03-09 01:30:34,994 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:30:34,994 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:30:34,995 INFO L256 TraceCheckSpWp]: Trace formula consists of 139 conjuncts, 12 conjuncts are in the unsatisfiable core [2025-03-09 01:30:34,996 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 01:30:35,092 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 01:30:35,093 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 01:30:35,145 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 32 [2025-03-09 01:30:35,263 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 01:30:35,264 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [308907588] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-09 01:30:35,264 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-09 01:30:35,264 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 15 [2025-03-09 01:30:35,264 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [611033438] [2025-03-09 01:30:35,264 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-09 01:30:35,264 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2025-03-09 01:30:35,264 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:30:35,265 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2025-03-09 01:30:35,265 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=225, Unknown=0, NotChecked=0, Total=272 [2025-03-09 01:30:35,466 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 37 [2025-03-09 01:30:35,467 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 46 places, 36 transitions, 177 flow. Second operand has 17 states, 17 states have (on average 13.470588235294118) internal successors, (229), 17 states have internal predecessors, (229), 0 states have call successors, (0), 0 states 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:30:35,467 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 01:30:35,467 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 37 [2025-03-09 01:30:35,467 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 01:30:35,759 INFO L124 PetriNetUnfolderBase]: 514/910 cut-off events. [2025-03-09 01:30:35,759 INFO L125 PetriNetUnfolderBase]: For 786/786 co-relation queries the response was YES. [2025-03-09 01:30:35,761 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2505 conditions, 910 events. 514/910 cut-off events. For 786/786 co-relation queries the response was YES. Maximal size of possible extension queue 44. Compared 3975 event pairs, 274 based on Foata normal form. 16/862 useless extension candidates. Maximal degree in co-relation 1616. Up to 431 conditions per place. [2025-03-09 01:30:35,764 INFO L140 encePairwiseOnDemand]: 28/37 looper letters, 65 selfloop transitions, 11 changer transitions 0/77 dead transitions. [2025-03-09 01:30:35,764 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 77 transitions, 456 flow [2025-03-09 01:30:35,765 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-09 01:30:35,765 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2025-03-09 01:30:35,765 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 157 transitions. [2025-03-09 01:30:35,766 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5304054054054054 [2025-03-09 01:30:35,766 INFO L175 Difference]: Start difference. First operand has 46 places, 36 transitions, 177 flow. Second operand 8 states and 157 transitions. [2025-03-09 01:30:35,766 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 77 transitions, 456 flow [2025-03-09 01:30:35,768 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 77 transitions, 434 flow, removed 0 selfloop flow, removed 4 redundant places. [2025-03-09 01:30:35,769 INFO L231 Difference]: Finished difference. Result has 51 places, 38 transitions, 203 flow [2025-03-09 01:30:35,769 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=161, PETRI_DIFFERENCE_MINUEND_PLACES=42, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=36, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=25, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=203, PETRI_PLACES=51, PETRI_TRANSITIONS=38} [2025-03-09 01:30:35,769 INFO L279 CegarLoopForPetriNet]: 38 programPoint places, 13 predicate places. [2025-03-09 01:30:35,770 INFO L471 AbstractCegarLoop]: Abstraction has has 51 places, 38 transitions, 203 flow [2025-03-09 01:30:35,770 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 13.470588235294118) internal successors, (229), 17 states have internal predecessors, (229), 0 states have call successors, (0), 0 states 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:30:35,770 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 01:30:35,770 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 01:30:35,777 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:30:35,970 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 01:30:35,971 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting thread2Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 19 more)] === [2025-03-09 01:30:35,971 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:30:35,972 INFO L85 PathProgramCache]: Analyzing trace with hash -1874686134, now seen corresponding path program 2 times [2025-03-09 01:30:35,972 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:30:35,972 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1986289825] [2025-03-09 01:30:35,972 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-09 01:30:35,972 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:30:35,981 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 16 statements into 2 equivalence classes. [2025-03-09 01:30:35,988 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 8 of 16 statements. [2025-03-09 01:30:35,988 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-09 01:30:35,988 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:30:36,098 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-03-09 01:30:36,098 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:30:36,099 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1986289825] [2025-03-09 01:30:36,099 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1986289825] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 01:30:36,099 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1104608400] [2025-03-09 01:30:36,099 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-09 01:30:36,099 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 01:30:36,099 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 01:30:36,101 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:30:36,102 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:30:36,140 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 16 statements into 2 equivalence classes. [2025-03-09 01:30:36,167 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 8 of 16 statements. [2025-03-09 01:30:36,167 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-09 01:30:36,167 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:30:36,168 INFO L256 TraceCheckSpWp]: Trace formula consists of 98 conjuncts, 22 conjuncts are in the unsatisfiable core [2025-03-09 01:30:36,169 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 01:30:36,178 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:30:36,298 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-03-09 01:30:36,298 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 01:30:36,449 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-03-09 01:30:36,449 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1104608400] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-09 01:30:36,449 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-09 01:30:36,449 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2025-03-09 01:30:36,449 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [311206110] [2025-03-09 01:30:36,450 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-09 01:30:36,450 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-09 01:30:36,450 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:30:36,451 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-09 01:30:36,451 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2025-03-09 01:30:36,601 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 37 [2025-03-09 01:30:36,602 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 51 places, 38 transitions, 203 flow. Second operand has 11 states, 11 states have (on average 14.818181818181818) internal successors, (163), 11 states have internal predecessors, (163), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:30:36,603 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 01:30:36,603 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 37 [2025-03-09 01:30:36,603 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 01:30:36,765 INFO L124 PetriNetUnfolderBase]: 491/871 cut-off events. [2025-03-09 01:30:36,765 INFO L125 PetriNetUnfolderBase]: For 934/934 co-relation queries the response was YES. [2025-03-09 01:30:36,767 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2471 conditions, 871 events. 491/871 cut-off events. For 934/934 co-relation queries the response was YES. Maximal size of possible extension queue 44. Compared 3803 event pairs, 200 based on Foata normal form. 16/887 useless extension candidates. Maximal degree in co-relation 1555. Up to 450 conditions per place. [2025-03-09 01:30:36,770 INFO L140 encePairwiseOnDemand]: 32/37 looper letters, 39 selfloop transitions, 8 changer transitions 0/48 dead transitions. [2025-03-09 01:30:36,770 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 54 places, 48 transitions, 351 flow [2025-03-09 01:30:36,770 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-09 01:30:36,770 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-03-09 01:30:36,771 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 83 transitions. [2025-03-09 01:30:36,771 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4486486486486487 [2025-03-09 01:30:36,771 INFO L175 Difference]: Start difference. First operand has 51 places, 38 transitions, 203 flow. Second operand 5 states and 83 transitions. [2025-03-09 01:30:36,771 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 54 places, 48 transitions, 351 flow [2025-03-09 01:30:36,773 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 48 transitions, 334 flow, removed 1 selfloop flow, removed 5 redundant places. [2025-03-09 01:30:36,773 INFO L231 Difference]: Finished difference. Result has 49 places, 37 transitions, 197 flow [2025-03-09 01:30:36,773 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=181, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=37, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=29, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=197, PETRI_PLACES=49, PETRI_TRANSITIONS=37} [2025-03-09 01:30:36,775 INFO L279 CegarLoopForPetriNet]: 38 programPoint places, 11 predicate places. [2025-03-09 01:30:36,775 INFO L471 AbstractCegarLoop]: Abstraction has has 49 places, 37 transitions, 197 flow [2025-03-09 01:30:36,776 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 14.818181818181818) internal successors, (163), 11 states have internal predecessors, (163), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:30:36,777 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 01:30:36,777 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 01:30:36,784 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2025-03-09 01:30:36,978 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2025-03-09 01:30:36,978 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 19 more)] === [2025-03-09 01:30:36,978 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:30:36,978 INFO L85 PathProgramCache]: Analyzing trace with hash -434559828, now seen corresponding path program 1 times [2025-03-09 01:30:36,978 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:30:36,978 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [118725383] [2025-03-09 01:30:36,978 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:30:36,978 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:30:36,982 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-03-09 01:30:36,985 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-03-09 01:30:36,985 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:30:36,985 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:30:37,001 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-09 01:30:37,001 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:30:37,001 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [118725383] [2025-03-09 01:30:37,001 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [118725383] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 01:30:37,001 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 01:30:37,001 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-09 01:30:37,002 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1955282270] [2025-03-09 01:30:37,002 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 01:30:37,002 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-09 01:30:37,002 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:30:37,002 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-09 01:30:37,002 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-09 01:30:37,012 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 37 [2025-03-09 01:30:37,012 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 37 transitions, 197 flow. Second operand has 3 states, 3 states have (on average 19.0) internal successors, (57), 3 states have internal predecessors, (57), 0 states have call successors, (0), 0 states 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:30:37,012 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 01:30:37,012 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 37 [2025-03-09 01:30:37,012 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 01:30:37,104 INFO L124 PetriNetUnfolderBase]: 491/867 cut-off events. [2025-03-09 01:30:37,105 INFO L125 PetriNetUnfolderBase]: For 965/965 co-relation queries the response was YES. [2025-03-09 01:30:37,106 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2558 conditions, 867 events. 491/867 cut-off events. For 965/965 co-relation queries the response was YES. Maximal size of possible extension queue 44. Compared 3721 event pairs, 144 based on Foata normal form. 2/869 useless extension candidates. Maximal degree in co-relation 1607. Up to 679 conditions per place. [2025-03-09 01:30:37,109 INFO L140 encePairwiseOnDemand]: 33/37 looper letters, 43 selfloop transitions, 5 changer transitions 1/50 dead transitions. [2025-03-09 01:30:37,109 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 51 places, 50 transitions, 338 flow [2025-03-09 01:30:37,109 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-09 01:30:37,109 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-09 01:30:37,110 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 77 transitions. [2025-03-09 01:30:37,110 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6936936936936937 [2025-03-09 01:30:37,110 INFO L175 Difference]: Start difference. First operand has 49 places, 37 transitions, 197 flow. Second operand 3 states and 77 transitions. [2025-03-09 01:30:37,110 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 51 places, 50 transitions, 338 flow [2025-03-09 01:30:37,112 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 47 places, 50 transitions, 320 flow, removed 0 selfloop flow, removed 4 redundant places. [2025-03-09 01:30:37,113 INFO L231 Difference]: Finished difference. Result has 48 places, 39 transitions, 214 flow [2025-03-09 01:30:37,113 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=181, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=37, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=32, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=214, PETRI_PLACES=48, PETRI_TRANSITIONS=39} [2025-03-09 01:30:37,113 INFO L279 CegarLoopForPetriNet]: 38 programPoint places, 10 predicate places. [2025-03-09 01:30:37,113 INFO L471 AbstractCegarLoop]: Abstraction has has 48 places, 39 transitions, 214 flow [2025-03-09 01:30:37,113 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 19.0) internal successors, (57), 3 states have internal predecessors, (57), 0 states have call successors, (0), 0 states 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:30:37,113 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 01:30:37,114 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 01:30:37,114 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-09 01:30:37,114 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 19 more)] === [2025-03-09 01:30:37,114 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:30:37,114 INFO L85 PathProgramCache]: Analyzing trace with hash 963885385, now seen corresponding path program 1 times [2025-03-09 01:30:37,114 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:30:37,114 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1818744226] [2025-03-09 01:30:37,114 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:30:37,114 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:30:37,119 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-03-09 01:30:37,130 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-03-09 01:30:37,131 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:30:37,131 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:30:37,193 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-09 01:30:37,194 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:30:37,194 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1818744226] [2025-03-09 01:30:37,194 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1818744226] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 01:30:37,194 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 01:30:37,194 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-09 01:30:37,194 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1560210197] [2025-03-09 01:30:37,194 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 01:30:37,194 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-09 01:30:37,195 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:30:37,195 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-09 01:30:37,195 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2025-03-09 01:30:37,195 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 37 [2025-03-09 01:30:37,195 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 48 places, 39 transitions, 214 flow. Second operand has 5 states, 5 states have (on average 17.4) internal successors, (87), 5 states have internal predecessors, (87), 0 states have call successors, (0), 0 states 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:30:37,195 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 01:30:37,195 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 37 [2025-03-09 01:30:37,196 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 01:30:37,333 INFO L124 PetriNetUnfolderBase]: 573/1033 cut-off events. [2025-03-09 01:30:37,334 INFO L125 PetriNetUnfolderBase]: For 1237/1237 co-relation queries the response was YES. [2025-03-09 01:30:37,335 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3096 conditions, 1033 events. 573/1033 cut-off events. For 1237/1237 co-relation queries the response was YES. Maximal size of possible extension queue 56. Compared 5115 event pairs, 192 based on Foata normal form. 32/1065 useless extension candidates. Maximal degree in co-relation 1890. Up to 500 conditions per place. [2025-03-09 01:30:37,339 INFO L140 encePairwiseOnDemand]: 29/37 looper letters, 68 selfloop transitions, 13 changer transitions 0/82 dead transitions. [2025-03-09 01:30:37,339 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 52 places, 82 transitions, 602 flow [2025-03-09 01:30:37,339 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-09 01:30:37,339 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-03-09 01:30:37,340 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 125 transitions. [2025-03-09 01:30:37,340 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6756756756756757 [2025-03-09 01:30:37,340 INFO L175 Difference]: Start difference. First operand has 48 places, 39 transitions, 214 flow. Second operand 5 states and 125 transitions. [2025-03-09 01:30:37,340 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 52 places, 82 transitions, 602 flow [2025-03-09 01:30:37,344 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 51 places, 82 transitions, 587 flow, removed 1 selfloop flow, removed 1 redundant places. [2025-03-09 01:30:37,345 INFO L231 Difference]: Finished difference. Result has 54 places, 47 transitions, 328 flow [2025-03-09 01:30:37,345 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=207, PETRI_DIFFERENCE_MINUEND_PLACES=47, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=39, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=28, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=328, PETRI_PLACES=54, PETRI_TRANSITIONS=47} [2025-03-09 01:30:37,346 INFO L279 CegarLoopForPetriNet]: 38 programPoint places, 16 predicate places. [2025-03-09 01:30:37,347 INFO L471 AbstractCegarLoop]: Abstraction has has 54 places, 47 transitions, 328 flow [2025-03-09 01:30:37,347 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 17.4) internal successors, (87), 5 states have internal predecessors, (87), 0 states have call successors, (0), 0 states 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:30:37,347 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 01:30:37,347 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 01:30:37,347 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-09 01:30:37,347 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 19 more)] === [2025-03-09 01:30:37,347 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:30:37,347 INFO L85 PathProgramCache]: Analyzing trace with hash 688965203, now seen corresponding path program 2 times [2025-03-09 01:30:37,348 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:30:37,348 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1902850545] [2025-03-09 01:30:37,348 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-09 01:30:37,348 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:30:37,352 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 18 statements into 2 equivalence classes. [2025-03-09 01:30:37,362 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 18 of 18 statements. [2025-03-09 01:30:37,367 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-09 01:30:37,367 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:30:37,540 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-09 01:30:37,540 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:30:37,540 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1902850545] [2025-03-09 01:30:37,540 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1902850545] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 01:30:37,540 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [863685322] [2025-03-09 01:30:37,540 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-09 01:30:37,541 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 01:30:37,541 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 01:30:37,543 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:30:37,544 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:30:37,579 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 18 statements into 2 equivalence classes. [2025-03-09 01:30:37,592 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 18 of 18 statements. [2025-03-09 01:30:37,592 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-09 01:30:37,592 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:30:37,593 INFO L256 TraceCheckSpWp]: Trace formula consists of 147 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-09 01:30:37,593 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 01:30:37,636 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-09 01:30:37,637 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 01:30:37,668 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-09 01:30:37,669 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [863685322] provided 1 perfect and 1 imperfect interpolant sequences [2025-03-09 01:30:37,669 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-03-09 01:30:37,670 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [7, 5] total 11 [2025-03-09 01:30:37,670 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1003622218] [2025-03-09 01:30:37,670 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 01:30:37,670 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-09 01:30:37,671 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:30:37,671 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-09 01:30:37,671 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2025-03-09 01:30:37,671 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 37 [2025-03-09 01:30:37,672 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 54 places, 47 transitions, 328 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:30:37,672 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 01:30:37,672 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 37 [2025-03-09 01:30:37,672 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 01:30:37,779 INFO L124 PetriNetUnfolderBase]: 593/1067 cut-off events. [2025-03-09 01:30:37,779 INFO L125 PetriNetUnfolderBase]: For 2153/2153 co-relation queries the response was YES. [2025-03-09 01:30:37,781 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3759 conditions, 1067 events. 593/1067 cut-off events. For 2153/2153 co-relation queries the response was YES. Maximal size of possible extension queue 58. Compared 5068 event pairs, 107 based on Foata normal form. 14/1081 useless extension candidates. Maximal degree in co-relation 2373. Up to 696 conditions per place. [2025-03-09 01:30:37,784 INFO L140 encePairwiseOnDemand]: 32/37 looper letters, 56 selfloop transitions, 15 changer transitions 1/73 dead transitions. [2025-03-09 01:30:37,785 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 57 places, 73 transitions, 628 flow [2025-03-09 01:30:37,785 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-09 01:30:37,785 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-09 01:30:37,786 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 96 transitions. [2025-03-09 01:30:37,786 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6486486486486487 [2025-03-09 01:30:37,786 INFO L175 Difference]: Start difference. First operand has 54 places, 47 transitions, 328 flow. Second operand 4 states and 96 transitions. [2025-03-09 01:30:37,786 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 57 places, 73 transitions, 628 flow [2025-03-09 01:30:37,790 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 55 places, 73 transitions, 597 flow, removed 3 selfloop flow, removed 2 redundant places. [2025-03-09 01:30:37,791 INFO L231 Difference]: Finished difference. Result has 58 places, 52 transitions, 409 flow [2025-03-09 01:30:37,792 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=311, PETRI_DIFFERENCE_MINUEND_PLACES=52, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=47, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=34, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=409, PETRI_PLACES=58, PETRI_TRANSITIONS=52} [2025-03-09 01:30:37,793 INFO L279 CegarLoopForPetriNet]: 38 programPoint places, 20 predicate places. [2025-03-09 01:30:37,793 INFO L471 AbstractCegarLoop]: Abstraction has has 58 places, 52 transitions, 409 flow [2025-03-09 01:30:37,793 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:30:37,793 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 01:30:37,793 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 01:30:37,801 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2025-03-09 01:30:37,994 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2025-03-09 01:30:37,994 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 19 more)] === [2025-03-09 01:30:37,994 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:30:37,994 INFO L85 PathProgramCache]: Analyzing trace with hash -2015192607, now seen corresponding path program 3 times [2025-03-09 01:30:37,995 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:30:37,995 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [671576722] [2025-03-09 01:30:37,995 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-09 01:30:37,995 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:30:38,003 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 18 statements into 2 equivalence classes. [2025-03-09 01:30:38,009 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 18 of 18 statements. [2025-03-09 01:30:38,009 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-03-09 01:30:38,009 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:30:38,145 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-09 01:30:38,146 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:30:38,146 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [671576722] [2025-03-09 01:30:38,146 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [671576722] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 01:30:38,146 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [224032066] [2025-03-09 01:30:38,146 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-09 01:30:38,146 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 01:30:38,146 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 01:30:38,148 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:30:38,155 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:30:38,197 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 18 statements into 2 equivalence classes. [2025-03-09 01:30:38,210 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 18 of 18 statements. [2025-03-09 01:30:38,210 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-03-09 01:30:38,211 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:30:38,211 INFO L256 TraceCheckSpWp]: Trace formula consists of 147 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-09 01:30:38,212 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 01:30:39,004 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-09 01:30:39,005 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-09 01:30:39,005 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [224032066] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 01:30:39,005 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-09 01:30:39,005 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [8] total 10 [2025-03-09 01:30:39,005 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1500753671] [2025-03-09 01:30:39,005 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 01:30:39,005 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-09 01:30:39,005 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:30:39,005 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-09 01:30:39,006 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2025-03-09 01:30:39,006 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 37 [2025-03-09 01:30:39,006 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 58 places, 52 transitions, 409 flow. Second operand has 5 states, 5 states have (on average 17.4) internal successors, (87), 5 states have internal predecessors, (87), 0 states have call successors, (0), 0 states 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:30:39,006 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 01:30:39,006 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 37 [2025-03-09 01:30:39,006 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 01:30:39,152 INFO L124 PetriNetUnfolderBase]: 595/1059 cut-off events. [2025-03-09 01:30:39,152 INFO L125 PetriNetUnfolderBase]: For 3111/3111 co-relation queries the response was YES. [2025-03-09 01:30:39,154 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4209 conditions, 1059 events. 595/1059 cut-off events. For 3111/3111 co-relation queries the response was YES. Maximal size of possible extension queue 61. Compared 5146 event pairs, 180 based on Foata normal form. 22/1081 useless extension candidates. Maximal degree in co-relation 2844. Up to 546 conditions per place. [2025-03-09 01:30:39,158 INFO L140 encePairwiseOnDemand]: 29/37 looper letters, 74 selfloop transitions, 19 changer transitions 8/102 dead transitions. [2025-03-09 01:30:39,158 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 63 places, 102 transitions, 977 flow [2025-03-09 01:30:39,158 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-09 01:30:39,158 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-09 01:30:39,159 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 144 transitions. [2025-03-09 01:30:39,159 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6486486486486487 [2025-03-09 01:30:39,159 INFO L175 Difference]: Start difference. First operand has 58 places, 52 transitions, 409 flow. Second operand 6 states and 144 transitions. [2025-03-09 01:30:39,159 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 63 places, 102 transitions, 977 flow [2025-03-09 01:30:39,164 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 63 places, 102 transitions, 957 flow, removed 10 selfloop flow, removed 0 redundant places. [2025-03-09 01:30:39,166 INFO L231 Difference]: Finished difference. Result has 67 places, 61 transitions, 586 flow [2025-03-09 01:30:39,166 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=401, PETRI_DIFFERENCE_MINUEND_PLACES=58, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=52, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=37, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=586, PETRI_PLACES=67, PETRI_TRANSITIONS=61} [2025-03-09 01:30:39,166 INFO L279 CegarLoopForPetriNet]: 38 programPoint places, 29 predicate places. [2025-03-09 01:30:39,166 INFO L471 AbstractCegarLoop]: Abstraction has has 67 places, 61 transitions, 586 flow [2025-03-09 01:30:39,167 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 17.4) internal successors, (87), 5 states have internal predecessors, (87), 0 states have call successors, (0), 0 states 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:30:39,167 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 01:30:39,167 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 01:30:39,174 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:30:39,367 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,SelfDestructingSolverStorable15 [2025-03-09 01:30:39,367 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 19 more)] === [2025-03-09 01:30:39,367 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:30:39,368 INFO L85 PathProgramCache]: Analyzing trace with hash 2040244073, now seen corresponding path program 4 times [2025-03-09 01:30:39,368 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:30:39,368 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1050437632] [2025-03-09 01:30:39,368 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-09 01:30:39,368 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:30:39,371 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 18 statements into 2 equivalence classes. [2025-03-09 01:30:39,377 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 18 of 18 statements. [2025-03-09 01:30:39,377 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-03-09 01:30:39,377 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:30:39,437 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-09 01:30:39,438 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:30:39,438 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1050437632] [2025-03-09 01:30:39,438 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1050437632] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 01:30:39,438 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [91140672] [2025-03-09 01:30:39,438 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-09 01:30:39,438 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 01:30:39,438 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 01:30:39,440 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:30:39,442 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:30:39,475 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 18 statements into 2 equivalence classes. [2025-03-09 01:30:39,489 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 18 of 18 statements. [2025-03-09 01:30:39,489 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-03-09 01:30:39,489 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:30:39,490 INFO L256 TraceCheckSpWp]: Trace formula consists of 147 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-09 01:30:39,491 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 01:30:39,521 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-09 01:30:39,522 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 01:30:39,559 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-09 01:30:39,561 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [91140672] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-09 01:30:39,561 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-09 01:30:39,561 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5] total 10 [2025-03-09 01:30:39,561 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1968504330] [2025-03-09 01:30:39,561 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-09 01:30:39,561 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-09 01:30:39,561 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:30:39,562 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-09 01:30:39,562 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2025-03-09 01:30:39,562 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 37 [2025-03-09 01:30:39,562 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 67 places, 61 transitions, 586 flow. Second operand has 10 states, 10 states have (on average 16.7) internal successors, (167), 10 states have internal predecessors, (167), 0 states have call successors, (0), 0 states 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:30:39,562 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 01:30:39,562 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 37 [2025-03-09 01:30:39,562 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 01:30:39,795 INFO L124 PetriNetUnfolderBase]: 619/1135 cut-off events. [2025-03-09 01:30:39,795 INFO L125 PetriNetUnfolderBase]: For 4230/4230 co-relation queries the response was YES. [2025-03-09 01:30:39,797 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4927 conditions, 1135 events. 619/1135 cut-off events. For 4230/4230 co-relation queries the response was YES. Maximal size of possible extension queue 65. Compared 5569 event pairs, 201 based on Foata normal form. 40/1175 useless extension candidates. Maximal degree in co-relation 3369. Up to 624 conditions per place. [2025-03-09 01:30:39,801 INFO L140 encePairwiseOnDemand]: 29/37 looper letters, 83 selfloop transitions, 36 changer transitions 5/125 dead transitions. [2025-03-09 01:30:39,801 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 75 places, 125 transitions, 1277 flow [2025-03-09 01:30:39,802 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-09 01:30:39,802 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2025-03-09 01:30:39,802 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 200 transitions. [2025-03-09 01:30:39,803 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6006006006006006 [2025-03-09 01:30:39,803 INFO L175 Difference]: Start difference. First operand has 67 places, 61 transitions, 586 flow. Second operand 9 states and 200 transitions. [2025-03-09 01:30:39,803 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 75 places, 125 transitions, 1277 flow [2025-03-09 01:30:39,809 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 74 places, 125 transitions, 1251 flow, removed 4 selfloop flow, removed 1 redundant places. [2025-03-09 01:30:39,811 INFO L231 Difference]: Finished difference. Result has 80 places, 77 transitions, 895 flow [2025-03-09 01:30:39,811 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=543, PETRI_DIFFERENCE_MINUEND_PLACES=66, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=59, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=18, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=895, PETRI_PLACES=80, PETRI_TRANSITIONS=77} [2025-03-09 01:30:39,811 INFO L279 CegarLoopForPetriNet]: 38 programPoint places, 42 predicate places. [2025-03-09 01:30:39,812 INFO L471 AbstractCegarLoop]: Abstraction has has 80 places, 77 transitions, 895 flow [2025-03-09 01:30:39,812 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 16.7) internal successors, (167), 10 states have internal predecessors, (167), 0 states have call successors, (0), 0 states 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:30:39,812 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 01:30:39,812 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 01:30:39,817 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:30:40,016 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,SelfDestructingSolverStorable16 [2025-03-09 01:30:40,016 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 19 more)] === [2025-03-09 01:30:40,017 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:30:40,017 INFO L85 PathProgramCache]: Analyzing trace with hash 1146851647, now seen corresponding path program 5 times [2025-03-09 01:30:40,017 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:30:40,017 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [98090578] [2025-03-09 01:30:40,017 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-09 01:30:40,017 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:30:40,021 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 18 statements into 2 equivalence classes. [2025-03-09 01:30:40,025 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 18 of 18 statements. [2025-03-09 01:30:40,026 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-09 01:30:40,026 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:30:40,063 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-09 01:30:40,063 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:30:40,063 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [98090578] [2025-03-09 01:30:40,063 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [98090578] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 01:30:40,063 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 01:30:40,063 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-09 01:30:40,063 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [30865100] [2025-03-09 01:30:40,063 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 01:30:40,063 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-09 01:30:40,063 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:30:40,063 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-09 01:30:40,064 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-09 01:30:40,064 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 37 [2025-03-09 01:30:40,064 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 80 places, 77 transitions, 895 flow. Second operand has 5 states, 5 states have (on average 17.4) internal successors, (87), 5 states have internal predecessors, (87), 0 states have call successors, (0), 0 states 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:30:40,064 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 01:30:40,064 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 37 [2025-03-09 01:30:40,064 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 01:30:40,217 INFO L124 PetriNetUnfolderBase]: 597/1057 cut-off events. [2025-03-09 01:30:40,218 INFO L125 PetriNetUnfolderBase]: For 6860/6860 co-relation queries the response was YES. [2025-03-09 01:30:40,220 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5550 conditions, 1057 events. 597/1057 cut-off events. For 6860/6860 co-relation queries the response was YES. Maximal size of possible extension queue 58. Compared 4980 event pairs, 146 based on Foata normal form. 4/1061 useless extension candidates. Maximal degree in co-relation 4714. Up to 486 conditions per place. [2025-03-09 01:30:40,225 INFO L140 encePairwiseOnDemand]: 32/37 looper letters, 80 selfloop transitions, 22 changer transitions 8/111 dead transitions. [2025-03-09 01:30:40,225 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 84 places, 111 transitions, 1392 flow [2025-03-09 01:30:40,225 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-09 01:30:40,225 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-09 01:30:40,226 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 133 transitions. [2025-03-09 01:30:40,226 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5990990990990991 [2025-03-09 01:30:40,226 INFO L175 Difference]: Start difference. First operand has 80 places, 77 transitions, 895 flow. Second operand 6 states and 133 transitions. [2025-03-09 01:30:40,226 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 84 places, 111 transitions, 1392 flow [2025-03-09 01:30:40,237 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 81 places, 111 transitions, 1328 flow, removed 18 selfloop flow, removed 3 redundant places. [2025-03-09 01:30:40,238 INFO L231 Difference]: Finished difference. Result has 84 places, 81 transitions, 954 flow [2025-03-09 01:30:40,238 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=841, PETRI_DIFFERENCE_MINUEND_PLACES=76, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=77, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=18, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=59, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=954, PETRI_PLACES=84, PETRI_TRANSITIONS=81} [2025-03-09 01:30:40,238 INFO L279 CegarLoopForPetriNet]: 38 programPoint places, 46 predicate places. [2025-03-09 01:30:40,239 INFO L471 AbstractCegarLoop]: Abstraction has has 84 places, 81 transitions, 954 flow [2025-03-09 01:30:40,239 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 17.4) internal successors, (87), 5 states have internal predecessors, (87), 0 states have call successors, (0), 0 states 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:30:40,239 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 01:30:40,239 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 01:30:40,239 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-03-09 01:30:40,239 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 19 more)] === [2025-03-09 01:30:40,239 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:30:40,239 INFO L85 PathProgramCache]: Analyzing trace with hash 1887130950, now seen corresponding path program 1 times [2025-03-09 01:30:40,240 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:30:40,240 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2082824506] [2025-03-09 01:30:40,240 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:30:40,240 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:30:40,243 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-03-09 01:30:40,250 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-03-09 01:30:40,250 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:30:40,250 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:30:40,294 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-09 01:30:40,294 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:30:40,294 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2082824506] [2025-03-09 01:30:40,294 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2082824506] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 01:30:40,294 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 01:30:40,294 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-09 01:30:40,294 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1523786421] [2025-03-09 01:30:40,295 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 01:30:40,295 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-09 01:30:40,296 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:30:40,296 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-09 01:30:40,296 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-09 01:30:40,296 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 37 [2025-03-09 01:30:40,296 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 84 places, 81 transitions, 954 flow. Second operand has 4 states, 4 states have (on average 18.75) internal successors, (75), 4 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:30:40,296 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 01:30:40,296 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 37 [2025-03-09 01:30:40,296 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 01:30:40,413 INFO L124 PetriNetUnfolderBase]: 609/1053 cut-off events. [2025-03-09 01:30:40,413 INFO L125 PetriNetUnfolderBase]: For 7557/7557 co-relation queries the response was YES. [2025-03-09 01:30:40,415 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5731 conditions, 1053 events. 609/1053 cut-off events. For 7557/7557 co-relation queries the response was YES. Maximal size of possible extension queue 55. Compared 4680 event pairs, 106 based on Foata normal form. 24/1077 useless extension candidates. Maximal degree in co-relation 5131. Up to 796 conditions per place. [2025-03-09 01:30:40,418 INFO L140 encePairwiseOnDemand]: 32/37 looper letters, 86 selfloop transitions, 12 changer transitions 2/101 dead transitions. [2025-03-09 01:30:40,419 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 86 places, 101 transitions, 1347 flow [2025-03-09 01:30:40,419 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-09 01:30:40,419 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-09 01:30:40,419 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 95 transitions. [2025-03-09 01:30:40,419 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6418918918918919 [2025-03-09 01:30:40,419 INFO L175 Difference]: Start difference. First operand has 84 places, 81 transitions, 954 flow. Second operand 4 states and 95 transitions. [2025-03-09 01:30:40,419 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 86 places, 101 transitions, 1347 flow [2025-03-09 01:30:40,429 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 85 places, 101 transitions, 1331 flow, removed 8 selfloop flow, removed 1 redundant places. [2025-03-09 01:30:40,430 INFO L231 Difference]: Finished difference. Result has 87 places, 84 transitions, 1031 flow [2025-03-09 01:30:40,430 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=925, PETRI_DIFFERENCE_MINUEND_PLACES=82, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=80, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=68, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1031, PETRI_PLACES=87, PETRI_TRANSITIONS=84} [2025-03-09 01:30:40,431 INFO L279 CegarLoopForPetriNet]: 38 programPoint places, 49 predicate places. [2025-03-09 01:30:40,431 INFO L471 AbstractCegarLoop]: Abstraction has has 87 places, 84 transitions, 1031 flow [2025-03-09 01:30:40,431 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 18.75) internal successors, (75), 4 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:30:40,431 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 01:30:40,431 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 01:30:40,431 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-03-09 01:30:40,431 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 19 more)] === [2025-03-09 01:30:40,431 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:30:40,432 INFO L85 PathProgramCache]: Analyzing trace with hash -1842440851, now seen corresponding path program 1 times [2025-03-09 01:30:40,432 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:30:40,432 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [789504736] [2025-03-09 01:30:40,432 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:30:40,432 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:30:40,435 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-03-09 01:30:40,447 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-03-09 01:30:40,447 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:30:40,447 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:30:40,753 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-09 01:30:40,753 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:30:40,753 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [789504736] [2025-03-09 01:30:40,754 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [789504736] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 01:30:40,754 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1823634070] [2025-03-09 01:30:40,754 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:30:40,754 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 01:30:40,754 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 01:30:40,756 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:30:40,757 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:30:40,791 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-03-09 01:30:40,807 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-03-09 01:30:40,807 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:30:40,807 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:30:40,811 INFO L256 TraceCheckSpWp]: Trace formula consists of 175 conjuncts, 22 conjuncts are in the unsatisfiable core [2025-03-09 01:30:40,815 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 01:30:40,972 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2025-03-09 01:30:40,993 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:30:40,993 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 01:30:41,103 INFO L349 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2025-03-09 01:30:41,103 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 7 [2025-03-09 01:30:41,252 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:30:41,253 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1823634070] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-09 01:30:41,253 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-09 01:30:41,253 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 7, 7] total 22 [2025-03-09 01:30:41,253 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1474068805] [2025-03-09 01:30:41,253 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-09 01:30:41,253 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2025-03-09 01:30:41,253 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:30:41,253 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2025-03-09 01:30:41,253 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=402, Unknown=0, NotChecked=0, Total=462 [2025-03-09 01:30:41,764 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 37 [2025-03-09 01:30:41,764 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 87 places, 84 transitions, 1031 flow. Second operand has 22 states, 22 states have (on average 16.681818181818183) internal successors, (367), 22 states have internal predecessors, (367), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:30:41,764 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 01:30:41,764 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 37 [2025-03-09 01:30:41,764 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 01:30:44,639 INFO L124 PetriNetUnfolderBase]: 1125/1953 cut-off events. [2025-03-09 01:30:44,639 INFO L125 PetriNetUnfolderBase]: For 12448/12448 co-relation queries the response was YES. [2025-03-09 01:30:44,643 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10173 conditions, 1953 events. 1125/1953 cut-off events. For 12448/12448 co-relation queries the response was YES. Maximal size of possible extension queue 103. Compared 9902 event pairs, 83 based on Foata normal form. 9/1962 useless extension candidates. Maximal degree in co-relation 8593. Up to 405 conditions per place. [2025-03-09 01:30:44,648 INFO L140 encePairwiseOnDemand]: 22/37 looper letters, 132 selfloop transitions, 73 changer transitions 173/379 dead transitions. [2025-03-09 01:30:44,648 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 129 places, 379 transitions, 4165 flow [2025-03-09 01:30:44,648 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2025-03-09 01:30:44,649 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2025-03-09 01:30:44,650 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 909 transitions. [2025-03-09 01:30:44,651 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5583538083538083 [2025-03-09 01:30:44,651 INFO L175 Difference]: Start difference. First operand has 87 places, 84 transitions, 1031 flow. Second operand 44 states and 909 transitions. [2025-03-09 01:30:44,651 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 129 places, 379 transitions, 4165 flow [2025-03-09 01:30:44,668 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 127 places, 379 transitions, 4149 flow, removed 2 selfloop flow, removed 2 redundant places. [2025-03-09 01:30:44,671 INFO L231 Difference]: Finished difference. Result has 139 places, 109 transitions, 1328 flow [2025-03-09 01:30:44,671 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=1023, PETRI_DIFFERENCE_MINUEND_PLACES=84, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=84, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=36, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=40, PETRI_DIFFERENCE_SUBTRAHEND_STATES=44, PETRI_FLOW=1328, PETRI_PLACES=139, PETRI_TRANSITIONS=109} [2025-03-09 01:30:44,671 INFO L279 CegarLoopForPetriNet]: 38 programPoint places, 101 predicate places. [2025-03-09 01:30:44,671 INFO L471 AbstractCegarLoop]: Abstraction has has 139 places, 109 transitions, 1328 flow [2025-03-09 01:30:44,671 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 22 states have (on average 16.681818181818183) internal successors, (367), 22 states have internal predecessors, (367), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:30:44,671 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 01:30:44,672 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] [2025-03-09 01:30:44,677 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Ended with exit code 0 [2025-03-09 01:30:44,872 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 01:30:44,872 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 19 more)] === [2025-03-09 01:30:44,873 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:30:44,873 INFO L85 PathProgramCache]: Analyzing trace with hash 1891916318, now seen corresponding path program 2 times [2025-03-09 01:30:44,873 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:30:44,873 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1262832919] [2025-03-09 01:30:44,873 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-09 01:30:44,873 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:30:44,877 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 24 statements into 2 equivalence classes. [2025-03-09 01:30:44,891 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 24 of 24 statements. [2025-03-09 01:30:44,891 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-09 01:30:44,891 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:30:45,189 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-09 01:30:45,189 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:30:45,190 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1262832919] [2025-03-09 01:30:45,190 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1262832919] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 01:30:45,190 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [382764480] [2025-03-09 01:30:45,190 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-09 01:30:45,190 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 01:30:45,190 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 01:30:45,192 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-09 01:30:45,193 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2025-03-09 01:30:45,237 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 24 statements into 2 equivalence classes. [2025-03-09 01:30:45,268 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 24 of 24 statements. [2025-03-09 01:30:45,268 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-09 01:30:45,268 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:30:45,273 INFO L256 TraceCheckSpWp]: Trace formula consists of 188 conjuncts, 34 conjuncts are in the unsatisfiable core [2025-03-09 01:30:45,274 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 01:30:45,341 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 19 treesize of output 1 [2025-03-09 01:30:45,496 INFO L349 Elim1Store]: treesize reduction 13, result has 48.0 percent of original size [2025-03-09 01:30:45,496 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 5 new quantified variables, introduced 3 case distinctions, treesize of input 67 treesize of output 40 [2025-03-09 01:30:45,531 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 01:30:45,531 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 01:30:45,796 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 170 treesize of output 150 [2025-03-09 01:30:45,871 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-09 01:30:45,871 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 9 new quantified variables, introduced 15 case distinctions, treesize of input 572 treesize of output 488 [2025-03-09 01:31:20,184 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 01:31:20,184 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [382764480] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-09 01:31:20,184 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-09 01:31:20,184 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 9, 9] total 22 [2025-03-09 01:31:20,184 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [649149699] [2025-03-09 01:31:20,184 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-09 01:31:20,185 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2025-03-09 01:31:20,185 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:31:20,185 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2025-03-09 01:31:20,185 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=80, Invalid=382, Unknown=0, NotChecked=0, Total=462 [2025-03-09 01:31:20,591 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 37 [2025-03-09 01:31:20,592 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 139 places, 109 transitions, 1328 flow. Second operand has 22 states, 22 states have (on average 17.045454545454547) internal successors, (375), 22 states have internal predecessors, (375), 0 states have call successors, (0), 0 states 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:31:20,592 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 01:31:20,592 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 37 [2025-03-09 01:31:20,592 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 01:31:22,251 INFO L124 PetriNetUnfolderBase]: 1291/2280 cut-off events. [2025-03-09 01:31:22,251 INFO L125 PetriNetUnfolderBase]: For 20793/20793 co-relation queries the response was YES. [2025-03-09 01:31:22,257 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13452 conditions, 2280 events. 1291/2280 cut-off events. For 20793/20793 co-relation queries the response was YES. Maximal size of possible extension queue 98. Compared 12142 event pairs, 21 based on Foata normal form. 38/2318 useless extension candidates. Maximal degree in co-relation 13409. Up to 499 conditions per place. [2025-03-09 01:31:22,263 INFO L140 encePairwiseOnDemand]: 25/37 looper letters, 212 selfloop transitions, 151 changer transitions 34/398 dead transitions. [2025-03-09 01:31:22,263 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 152 places, 398 transitions, 4996 flow [2025-03-09 01:31:22,264 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2025-03-09 01:31:22,264 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2025-03-09 01:31:22,265 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 782 transitions. [2025-03-09 01:31:22,265 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5561877667140825 [2025-03-09 01:31:22,265 INFO L175 Difference]: Start difference. First operand has 139 places, 109 transitions, 1328 flow. Second operand 38 states and 782 transitions. [2025-03-09 01:31:22,266 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 152 places, 398 transitions, 4996 flow [2025-03-09 01:31:22,301 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 130 places, 398 transitions, 4372 flow, removed 251 selfloop flow, removed 22 redundant places. [2025-03-09 01:31:22,305 INFO L231 Difference]: Finished difference. Result has 146 places, 209 transitions, 2593 flow [2025-03-09 01:31:22,305 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=1095, PETRI_DIFFERENCE_MINUEND_PLACES=93, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=108, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=63, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=40, PETRI_DIFFERENCE_SUBTRAHEND_STATES=38, PETRI_FLOW=2593, PETRI_PLACES=146, PETRI_TRANSITIONS=209} [2025-03-09 01:31:22,305 INFO L279 CegarLoopForPetriNet]: 38 programPoint places, 108 predicate places. [2025-03-09 01:31:22,305 INFO L471 AbstractCegarLoop]: Abstraction has has 146 places, 209 transitions, 2593 flow [2025-03-09 01:31:22,306 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 22 states have (on average 17.045454545454547) internal successors, (375), 22 states have internal predecessors, (375), 0 states have call successors, (0), 0 states 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:31:22,306 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 01:31:22,306 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] [2025-03-09 01:31:22,317 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Ended with exit code 0 [2025-03-09 01:31:22,510 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable20 [2025-03-09 01:31:22,510 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 19 more)] === [2025-03-09 01:31:22,510 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:31:22,510 INFO L85 PathProgramCache]: Analyzing trace with hash 2089084020, now seen corresponding path program 3 times [2025-03-09 01:31:22,510 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:31:22,510 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [835139002] [2025-03-09 01:31:22,511 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-09 01:31:22,511 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:31:22,515 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 24 statements into 3 equivalence classes. [2025-03-09 01:31:22,521 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 16 of 24 statements. [2025-03-09 01:31:22,522 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-03-09 01:31:22,522 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:31:22,608 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-03-09 01:31:22,608 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:31:22,608 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [835139002] [2025-03-09 01:31:22,608 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [835139002] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 01:31:22,608 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 01:31:22,608 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-09 01:31:22,608 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1170625280] [2025-03-09 01:31:22,609 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 01:31:22,609 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-09 01:31:22,609 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:31:22,609 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-09 01:31:22,609 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-03-09 01:31:22,609 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 37 [2025-03-09 01:31:22,609 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 146 places, 209 transitions, 2593 flow. Second operand has 6 states, 6 states have (on average 17.5) internal successors, (105), 6 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:31:22,609 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 01:31:22,609 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 37 [2025-03-09 01:31:22,609 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 01:31:22,854 INFO L124 PetriNetUnfolderBase]: 1179/2043 cut-off events. [2025-03-09 01:31:22,854 INFO L125 PetriNetUnfolderBase]: For 27003/27003 co-relation queries the response was YES. [2025-03-09 01:31:22,860 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12924 conditions, 2043 events. 1179/2043 cut-off events. For 27003/27003 co-relation queries the response was YES. Maximal size of possible extension queue 82. Compared 10284 event pairs, 444 based on Foata normal form. 34/2077 useless extension candidates. Maximal degree in co-relation 12878. Up to 1433 conditions per place. [2025-03-09 01:31:22,866 INFO L140 encePairwiseOnDemand]: 31/37 looper letters, 166 selfloop transitions, 48 changer transitions 0/215 dead transitions. [2025-03-09 01:31:22,866 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 139 places, 215 transitions, 2977 flow [2025-03-09 01:31:22,866 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-09 01:31:22,866 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-09 01:31:22,867 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 138 transitions. [2025-03-09 01:31:22,867 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6216216216216216 [2025-03-09 01:31:22,867 INFO L175 Difference]: Start difference. First operand has 146 places, 209 transitions, 2593 flow. Second operand 6 states and 138 transitions. [2025-03-09 01:31:22,867 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 139 places, 215 transitions, 2977 flow [2025-03-09 01:31:22,913 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 128 places, 215 transitions, 2769 flow, removed 91 selfloop flow, removed 11 redundant places. [2025-03-09 01:31:22,915 INFO L231 Difference]: Finished difference. Result has 128 places, 191 transitions, 2254 flow [2025-03-09 01:31:22,916 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=2158, PETRI_DIFFERENCE_MINUEND_PLACES=123, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=191, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=48, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=143, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=2254, PETRI_PLACES=128, PETRI_TRANSITIONS=191} [2025-03-09 01:31:22,916 INFO L279 CegarLoopForPetriNet]: 38 programPoint places, 90 predicate places. [2025-03-09 01:31:22,916 INFO L471 AbstractCegarLoop]: Abstraction has has 128 places, 191 transitions, 2254 flow [2025-03-09 01:31:22,916 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 17.5) internal successors, (105), 6 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:31:22,916 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 01:31:22,916 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 01:31:22,917 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2025-03-09 01:31:22,917 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 19 more)] === [2025-03-09 01:31:22,917 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:31:22,917 INFO L85 PathProgramCache]: Analyzing trace with hash 368922231, now seen corresponding path program 4 times [2025-03-09 01:31:22,917 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:31:22,917 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [767951208] [2025-03-09 01:31:22,917 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-09 01:31:22,917 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:31:22,922 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 26 statements into 2 equivalence classes. [2025-03-09 01:31:22,934 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 26 of 26 statements. [2025-03-09 01:31:22,935 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-03-09 01:31:22,935 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:31:23,070 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-09 01:31:23,071 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:31:23,071 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [767951208] [2025-03-09 01:31:23,071 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [767951208] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 01:31:23,071 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2107725077] [2025-03-09 01:31:23,071 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-09 01:31:23,071 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 01:31:23,071 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 01:31:23,073 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-09 01:31:23,076 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2025-03-09 01:31:23,113 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 26 statements into 2 equivalence classes. [2025-03-09 01:31:23,164 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 26 of 26 statements. [2025-03-09 01:31:23,165 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-03-09 01:31:23,165 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:31:23,166 INFO L256 TraceCheckSpWp]: Trace formula consists of 198 conjuncts, 19 conjuncts are in the unsatisfiable core [2025-03-09 01:31:23,167 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 01:31:23,579 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-09 01:31:23,580 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 01:31:25,902 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-09 01:31:25,902 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2107725077] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-09 01:31:25,902 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-09 01:31:25,902 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 9, 13] total 23 [2025-03-09 01:31:25,903 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1661345411] [2025-03-09 01:31:25,903 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-09 01:31:25,903 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2025-03-09 01:31:25,903 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:31:25,903 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2025-03-09 01:31:25,904 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=116, Invalid=390, Unknown=0, NotChecked=0, Total=506 [2025-03-09 01:31:25,904 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 37 [2025-03-09 01:31:25,904 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 128 places, 191 transitions, 2254 flow. Second operand has 23 states, 23 states have (on average 16.217391304347824) internal successors, (373), 23 states have internal predecessors, (373), 0 states have call successors, (0), 0 states 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:31:25,904 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 01:31:25,904 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 37 [2025-03-09 01:31:25,904 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand