./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/weaver/popl20-counter-determinism.wvr.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 8fc3dc66 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../sv-benchmarks/c/weaver/popl20-counter-determinism.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 981eae178b9cad0bb64b87dda8360f4f1e2e23d7b9d396f9db2ad5a6977098c4 --- Real Ultimate output --- This is Ultimate 0.3.0-?-8fc3dc6-m [2025-03-17 14:27:32,816 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-17 14:27:32,868 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2025-03-17 14:27:32,874 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-17 14:27:32,875 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-17 14:27:32,895 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-17 14:27:32,896 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-17 14:27:32,896 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-17 14:27:32,897 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-17 14:27:32,897 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-17 14:27:32,897 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-17 14:27:32,897 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-17 14:27:32,897 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-17 14:27:32,897 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-17 14:27:32,897 INFO L153 SettingsManager]: * Use SBE=true [2025-03-17 14:27:32,898 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-17 14:27:32,898 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-17 14:27:32,898 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-17 14:27:32,898 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-17 14:27:32,899 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-17 14:27:32,899 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2025-03-17 14:27:32,899 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2025-03-17 14:27:32,899 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2025-03-17 14:27:32,899 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-17 14:27:32,899 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-03-17 14:27:32,899 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-03-17 14:27:32,899 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-17 14:27:32,899 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-17 14:27:32,899 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-17 14:27:32,899 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-17 14:27:32,899 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-17 14:27:32,899 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-17 14:27:32,899 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-17 14:27:32,899 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 14:27:32,900 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-17 14:27:32,900 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-17 14:27:32,900 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-17 14:27:32,900 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-17 14:27:32,900 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-17 14:27:32,900 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-17 14:27:32,900 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-17 14:27:32,900 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-17 14:27:32,900 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 -> 981eae178b9cad0bb64b87dda8360f4f1e2e23d7b9d396f9db2ad5a6977098c4 [2025-03-17 14:27:33,151 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-17 14:27:33,161 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-17 14:27:33,162 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-17 14:27:33,163 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-17 14:27:33,164 INFO L274 PluginConnector]: CDTParser initialized [2025-03-17 14:27:33,164 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/weaver/popl20-counter-determinism.wvr.c [2025-03-17 14:27:34,300 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a75ca48ca/1bba088c80124d3a9ecde8a4dd427bb9/FLAGe45d61e71 [2025-03-17 14:27:34,510 INFO L384 CDTParser]: Found 1 translation units. [2025-03-17 14:27:34,511 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/weaver/popl20-counter-determinism.wvr.c [2025-03-17 14:27:34,517 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a75ca48ca/1bba088c80124d3a9ecde8a4dd427bb9/FLAGe45d61e71 [2025-03-17 14:27:34,531 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a75ca48ca/1bba088c80124d3a9ecde8a4dd427bb9 [2025-03-17 14:27:34,533 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-17 14:27:34,534 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-17 14:27:34,536 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-17 14:27:34,536 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-17 14:27:34,539 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-17 14:27:34,539 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 02:27:34" (1/1) ... [2025-03-17 14:27:34,540 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5383518e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:27:34, skipping insertion in model container [2025-03-17 14:27:34,540 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 02:27:34" (1/1) ... [2025-03-17 14:27:34,553 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-17 14:27:34,654 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 14:27:34,662 INFO L200 MainTranslator]: Completed pre-run [2025-03-17 14:27:34,676 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 14:27:34,686 INFO L204 MainTranslator]: Completed translation [2025-03-17 14:27:34,687 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:27:34 WrapperNode [2025-03-17 14:27:34,687 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-17 14:27:34,688 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-17 14:27:34,688 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-17 14:27:34,688 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-17 14:27:34,693 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:27:34" (1/1) ... [2025-03-17 14:27:34,703 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:27:34" (1/1) ... [2025-03-17 14:27:34,716 INFO L138 Inliner]: procedures = 20, calls = 14, calls flagged for inlining = 6, calls inlined = 6, statements flattened = 90 [2025-03-17 14:27:34,716 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-17 14:27:34,717 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-17 14:27:34,717 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-17 14:27:34,717 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-17 14:27:34,723 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:27:34" (1/1) ... [2025-03-17 14:27:34,723 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:27:34" (1/1) ... [2025-03-17 14:27:34,724 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:27:34" (1/1) ... [2025-03-17 14:27:34,731 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-03-17 14:27:34,732 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:27:34" (1/1) ... [2025-03-17 14:27:34,732 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:27:34" (1/1) ... [2025-03-17 14:27:34,734 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:27:34" (1/1) ... [2025-03-17 14:27:34,735 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:27:34" (1/1) ... [2025-03-17 14:27:34,735 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:27:34" (1/1) ... [2025-03-17 14:27:34,736 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:27:34" (1/1) ... [2025-03-17 14:27:34,737 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-17 14:27:34,737 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-17 14:27:34,738 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-17 14:27:34,738 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-17 14:27:34,738 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:27:34" (1/1) ... [2025-03-17 14:27:34,744 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 14:27:34,756 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 14:27:34,769 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-17 14:27:34,772 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-17 14:27:34,791 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-17 14:27:34,791 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2025-03-17 14:27:34,791 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2025-03-17 14:27:34,791 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2025-03-17 14:27:34,791 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2025-03-17 14:27:34,791 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2025-03-17 14:27:34,791 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2025-03-17 14:27:34,791 INFO L130 BoogieDeclarations]: Found specification of procedure thread4 [2025-03-17 14:27:34,791 INFO L138 BoogieDeclarations]: Found implementation of procedure thread4 [2025-03-17 14:27:34,791 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-17 14:27:34,791 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-17 14:27:34,792 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-17 14:27:34,792 WARN L225 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-03-17 14:27:34,868 INFO L256 CfgBuilder]: Building ICFG [2025-03-17 14:27:34,869 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-17 14:27:35,072 INFO L303 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-03-17 14:27:35,073 INFO L307 CfgBuilder]: Performing block encoding [2025-03-17 14:27:35,156 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-17 14:27:35,156 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-17 14:27:35,157 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 02:27:35 BoogieIcfgContainer [2025-03-17 14:27:35,157 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-17 14:27:35,158 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-17 14:27:35,158 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-17 14:27:35,161 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-17 14:27:35,162 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 17.03 02:27:34" (1/3) ... [2025-03-17 14:27:35,162 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2c9e1834 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 02:27:35, skipping insertion in model container [2025-03-17 14:27:35,162 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:27:34" (2/3) ... [2025-03-17 14:27:35,162 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2c9e1834 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 02:27:35, skipping insertion in model container [2025-03-17 14:27:35,162 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 02:27:35" (3/3) ... [2025-03-17 14:27:35,163 INFO L128 eAbstractionObserver]: Analyzing ICFG popl20-counter-determinism.wvr.c [2025-03-17 14:27:35,175 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-17 14:27:35,177 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG popl20-counter-determinism.wvr.c that has 5 procedures, 39 locations, 1 initial locations, 4 loop locations, and 2 error locations. [2025-03-17 14:27:35,177 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-03-17 14:27:35,223 INFO L143 ThreadInstanceAdder]: Constructed 4 joinOtherThreadTransitions. [2025-03-17 14:27:35,246 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 51 places, 42 transitions, 112 flow [2025-03-17 14:27:35,266 INFO L124 PetriNetUnfolderBase]: 4/38 cut-off events. [2025-03-17 14:27:35,271 INFO L125 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2025-03-17 14:27:35,273 INFO L83 FinitePrefix]: Finished finitePrefix Result has 55 conditions, 38 events. 4/38 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 49 event pairs, 0 based on Foata normal form. 0/32 useless extension candidates. Maximal degree in co-relation 33. Up to 2 conditions per place. [2025-03-17 14:27:35,273 INFO L82 GeneralOperation]: Start removeDead. Operand has 51 places, 42 transitions, 112 flow [2025-03-17 14:27:35,275 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 46 places, 37 transitions, 98 flow [2025-03-17 14:27:35,281 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-17 14:27:35,291 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;@47f77943, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-17 14:27:35,291 INFO L334 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2025-03-17 14:27:35,302 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-17 14:27:35,303 INFO L124 PetriNetUnfolderBase]: 4/34 cut-off events. [2025-03-17 14:27:35,303 INFO L125 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2025-03-17 14:27:35,303 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 14:27:35,304 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 14:27:35,304 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2025-03-17 14:27:35,310 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 14:27:35,310 INFO L85 PathProgramCache]: Analyzing trace with hash -2131589975, now seen corresponding path program 1 times [2025-03-17 14:27:35,316 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 14:27:35,317 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1786238371] [2025-03-17 14:27:35,317 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 14:27:35,317 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 14:27:35,378 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-03-17 14:27:35,406 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-03-17 14:27:35,407 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:27:35,407 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:27:35,563 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-17 14:27:35,565 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 14:27:35,566 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1786238371] [2025-03-17 14:27:35,566 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1786238371] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 14:27:35,566 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 14:27:35,566 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 14:27:35,567 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [847618723] [2025-03-17 14:27:35,568 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 14:27:35,573 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 14:27:35,577 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 14:27:35,594 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 14:27:35,594 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 14:27:35,595 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 42 [2025-03-17 14:27:35,597 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 46 places, 37 transitions, 98 flow. Second operand has 3 states, 3 states have (on average 15.333333333333334) internal successors, (46), 3 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 14:27:35,597 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 14:27:35,597 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 42 [2025-03-17 14:27:35,598 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 14:27:36,186 INFO L124 PetriNetUnfolderBase]: 5145/6893 cut-off events. [2025-03-17 14:27:36,186 INFO L125 PetriNetUnfolderBase]: For 482/482 co-relation queries the response was YES. [2025-03-17 14:27:36,200 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14124 conditions, 6893 events. 5145/6893 cut-off events. For 482/482 co-relation queries the response was YES. Maximal size of possible extension queue 333. Compared 30667 event pairs, 1020 based on Foata normal form. 2/6281 useless extension candidates. Maximal degree in co-relation 12502. Up to 5288 conditions per place. [2025-03-17 14:27:36,229 INFO L140 encePairwiseOnDemand]: 35/42 looper letters, 51 selfloop transitions, 5 changer transitions 1/60 dead transitions. [2025-03-17 14:27:36,230 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 46 places, 60 transitions, 279 flow [2025-03-17 14:27:36,231 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 14:27:36,233 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-17 14:27:36,240 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 83 transitions. [2025-03-17 14:27:36,243 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6587301587301587 [2025-03-17 14:27:36,244 INFO L175 Difference]: Start difference. First operand has 46 places, 37 transitions, 98 flow. Second operand 3 states and 83 transitions. [2025-03-17 14:27:36,245 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 46 places, 60 transitions, 279 flow [2025-03-17 14:27:36,258 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 38 places, 60 transitions, 249 flow, removed 0 selfloop flow, removed 8 redundant places. [2025-03-17 14:27:36,262 INFO L231 Difference]: Finished difference. Result has 39 places, 39 transitions, 111 flow [2025-03-17 14:27:36,264 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=78, PETRI_DIFFERENCE_MINUEND_PLACES=36, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=35, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=111, PETRI_PLACES=39, PETRI_TRANSITIONS=39} [2025-03-17 14:27:36,268 INFO L279 CegarLoopForPetriNet]: 46 programPoint places, -7 predicate places. [2025-03-17 14:27:36,268 INFO L471 AbstractCegarLoop]: Abstraction has has 39 places, 39 transitions, 111 flow [2025-03-17 14:27:36,268 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 15.333333333333334) internal successors, (46), 3 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 14:27:36,268 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 14:27:36,268 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 14:27:36,268 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-17 14:27:36,271 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2025-03-17 14:27:36,271 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 14:27:36,271 INFO L85 PathProgramCache]: Analyzing trace with hash -1522219111, now seen corresponding path program 1 times [2025-03-17 14:27:36,271 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 14:27:36,271 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [830300621] [2025-03-17 14:27:36,271 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 14:27:36,272 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 14:27:36,287 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-03-17 14:27:36,304 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-03-17 14:27:36,304 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:27:36,304 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:27:36,418 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-17 14:27:36,418 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 14:27:36,418 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [830300621] [2025-03-17 14:27:36,419 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [830300621] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 14:27:36,419 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 14:27:36,419 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-17 14:27:36,419 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1914934895] [2025-03-17 14:27:36,419 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 14:27:36,420 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-17 14:27:36,420 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 14:27:36,421 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-17 14:27:36,421 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-17 14:27:36,427 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 42 [2025-03-17 14:27:36,428 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 39 places, 39 transitions, 111 flow. Second operand has 5 states, 5 states have (on average 12.0) internal successors, (60), 5 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 14:27:36,428 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 14:27:36,428 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 42 [2025-03-17 14:27:36,428 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 14:27:37,277 INFO L124 PetriNetUnfolderBase]: 11897/15400 cut-off events. [2025-03-17 14:27:37,277 INFO L125 PetriNetUnfolderBase]: For 1929/1929 co-relation queries the response was YES. [2025-03-17 14:27:37,294 INFO L83 FinitePrefix]: Finished finitePrefix Result has 35071 conditions, 15400 events. 11897/15400 cut-off events. For 1929/1929 co-relation queries the response was YES. Maximal size of possible extension queue 638. Compared 72807 event pairs, 3629 based on Foata normal form. 0/13196 useless extension candidates. Maximal degree in co-relation 5548. Up to 7867 conditions per place. [2025-03-17 14:27:37,348 INFO L140 encePairwiseOnDemand]: 35/42 looper letters, 101 selfloop transitions, 10 changer transitions 0/113 dead transitions. [2025-03-17 14:27:37,349 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 43 places, 113 transitions, 540 flow [2025-03-17 14:27:37,349 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-17 14:27:37,350 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-03-17 14:27:37,351 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 133 transitions. [2025-03-17 14:27:37,352 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6333333333333333 [2025-03-17 14:27:37,353 INFO L175 Difference]: Start difference. First operand has 39 places, 39 transitions, 111 flow. Second operand 5 states and 133 transitions. [2025-03-17 14:27:37,353 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 43 places, 113 transitions, 540 flow [2025-03-17 14:27:37,354 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 42 places, 113 transitions, 525 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-17 14:27:37,357 INFO L231 Difference]: Finished difference. Result has 45 places, 48 transitions, 169 flow [2025-03-17 14:27:37,357 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=106, PETRI_DIFFERENCE_MINUEND_PLACES=38, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=39, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=33, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=169, PETRI_PLACES=45, PETRI_TRANSITIONS=48} [2025-03-17 14:27:37,358 INFO L279 CegarLoopForPetriNet]: 46 programPoint places, -1 predicate places. [2025-03-17 14:27:37,358 INFO L471 AbstractCegarLoop]: Abstraction has has 45 places, 48 transitions, 169 flow [2025-03-17 14:27:37,358 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.0) internal successors, (60), 5 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 14:27:37,358 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 14:27:37,359 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 14:27:37,359 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-17 14:27:37,359 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2025-03-17 14:27:37,359 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 14:27:37,361 INFO L85 PathProgramCache]: Analyzing trace with hash 199881933, now seen corresponding path program 2 times [2025-03-17 14:27:37,362 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 14:27:37,362 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [564999579] [2025-03-17 14:27:37,362 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-17 14:27:37,362 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 14:27:37,370 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 26 statements into 2 equivalence classes. [2025-03-17 14:27:37,385 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 26 of 26 statements. [2025-03-17 14:27:37,386 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-17 14:27:37,386 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:27:37,470 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-17 14:27:37,470 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 14:27:37,470 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [564999579] [2025-03-17 14:27:37,470 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [564999579] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 14:27:37,470 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [31596144] [2025-03-17 14:27:37,470 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-17 14:27:37,470 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 14:27:37,470 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 14:27:37,474 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-17 14:27:37,474 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-17 14:27:37,519 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 26 statements into 2 equivalence classes. [2025-03-17 14:27:37,537 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 26 of 26 statements. [2025-03-17 14:27:37,537 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-17 14:27:37,537 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:27:37,538 INFO L256 TraceCheckSpWp]: Trace formula consists of 174 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-17 14:27:37,541 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 14:27:37,586 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-17 14:27:37,586 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 14:27:37,618 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-17 14:27:37,619 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [31596144] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 14:27:37,619 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 14:27:37,619 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5] total 9 [2025-03-17 14:27:37,619 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1872639712] [2025-03-17 14:27:37,619 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 14:27:37,620 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-17 14:27:37,620 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 14:27:37,620 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-17 14:27:37,620 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2025-03-17 14:27:37,635 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 42 [2025-03-17 14:27:37,635 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 45 places, 48 transitions, 169 flow. Second operand has 9 states, 9 states have (on average 10.88888888888889) internal successors, (98), 9 states have internal predecessors, (98), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 14:27:37,636 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 14:27:37,636 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 42 [2025-03-17 14:27:37,636 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 14:27:38,914 INFO L124 PetriNetUnfolderBase]: 16200/21067 cut-off events. [2025-03-17 14:27:38,914 INFO L125 PetriNetUnfolderBase]: For 7122/7122 co-relation queries the response was YES. [2025-03-17 14:27:38,943 INFO L83 FinitePrefix]: Finished finitePrefix Result has 54783 conditions, 21067 events. 16200/21067 cut-off events. For 7122/7122 co-relation queries the response was YES. Maximal size of possible extension queue 855. Compared 106158 event pairs, 1341 based on Foata normal form. 346/20581 useless extension candidates. Maximal degree in co-relation 27418. Up to 4494 conditions per place. [2025-03-17 14:27:39,013 INFO L140 encePairwiseOnDemand]: 34/42 looper letters, 260 selfloop transitions, 36 changer transitions 0/298 dead transitions. [2025-03-17 14:27:39,013 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 58 places, 298 transitions, 1478 flow [2025-03-17 14:27:39,013 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-03-17 14:27:39,013 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2025-03-17 14:27:39,015 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 366 transitions. [2025-03-17 14:27:39,015 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6224489795918368 [2025-03-17 14:27:39,015 INFO L175 Difference]: Start difference. First operand has 45 places, 48 transitions, 169 flow. Second operand 14 states and 366 transitions. [2025-03-17 14:27:39,016 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 58 places, 298 transitions, 1478 flow [2025-03-17 14:27:39,023 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 58 places, 298 transitions, 1478 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-03-17 14:27:39,025 INFO L231 Difference]: Finished difference. Result has 64 places, 76 transitions, 405 flow [2025-03-17 14:27:39,026 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=169, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=48, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=34, PETRI_DIFFERENCE_SUBTRAHEND_STATES=14, PETRI_FLOW=405, PETRI_PLACES=64, PETRI_TRANSITIONS=76} [2025-03-17 14:27:39,026 INFO L279 CegarLoopForPetriNet]: 46 programPoint places, 18 predicate places. [2025-03-17 14:27:39,026 INFO L471 AbstractCegarLoop]: Abstraction has has 64 places, 76 transitions, 405 flow [2025-03-17 14:27:39,027 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 10.88888888888889) internal successors, (98), 9 states have internal predecessors, (98), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 14:27:39,027 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 14:27:39,027 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 14:27:39,034 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-03-17 14:27:39,232 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-17 14:27:39,232 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2025-03-17 14:27:39,232 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 14:27:39,233 INFO L85 PathProgramCache]: Analyzing trace with hash 2107482899, now seen corresponding path program 3 times [2025-03-17 14:27:39,233 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 14:27:39,233 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1945492505] [2025-03-17 14:27:39,233 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-17 14:27:39,233 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 14:27:39,242 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 26 statements into 2 equivalence classes. [2025-03-17 14:27:39,250 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 26 of 26 statements. [2025-03-17 14:27:39,252 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-03-17 14:27:39,252 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:27:39,316 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-17 14:27:39,317 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 14:27:39,317 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1945492505] [2025-03-17 14:27:39,317 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1945492505] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 14:27:39,317 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 14:27:39,317 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-17 14:27:39,317 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [516496683] [2025-03-17 14:27:39,317 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 14:27:39,317 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-17 14:27:39,318 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 14:27:39,318 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-17 14:27:39,318 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-17 14:27:39,322 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 42 [2025-03-17 14:27:39,322 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 64 places, 76 transitions, 405 flow. Second operand has 5 states, 5 states have (on average 12.0) internal successors, (60), 5 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 14:27:39,322 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 14:27:39,323 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 42 [2025-03-17 14:27:39,323 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 14:27:40,616 INFO L124 PetriNetUnfolderBase]: 22784/29827 cut-off events. [2025-03-17 14:27:40,616 INFO L125 PetriNetUnfolderBase]: For 36461/36461 co-relation queries the response was YES. [2025-03-17 14:27:40,680 INFO L83 FinitePrefix]: Finished finitePrefix Result has 91235 conditions, 29827 events. 22784/29827 cut-off events. For 36461/36461 co-relation queries the response was YES. Maximal size of possible extension queue 1109. Compared 154455 event pairs, 6160 based on Foata normal form. 76/28725 useless extension candidates. Maximal degree in co-relation 82664. Up to 14037 conditions per place. [2025-03-17 14:27:40,871 INFO L140 encePairwiseOnDemand]: 36/42 looper letters, 145 selfloop transitions, 19 changer transitions 0/166 dead transitions. [2025-03-17 14:27:40,872 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 68 places, 166 transitions, 1106 flow [2025-03-17 14:27:40,873 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-17 14:27:40,873 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-03-17 14:27:40,873 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 132 transitions. [2025-03-17 14:27:40,874 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6285714285714286 [2025-03-17 14:27:40,874 INFO L175 Difference]: Start difference. First operand has 64 places, 76 transitions, 405 flow. Second operand 5 states and 132 transitions. [2025-03-17 14:27:40,874 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 68 places, 166 transitions, 1106 flow [2025-03-17 14:27:41,166 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 67 places, 166 transitions, 1059 flow, removed 13 selfloop flow, removed 1 redundant places. [2025-03-17 14:27:41,168 INFO L231 Difference]: Finished difference. Result has 70 places, 84 transitions, 504 flow [2025-03-17 14:27:41,168 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=376, PETRI_DIFFERENCE_MINUEND_PLACES=63, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=76, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=57, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=504, PETRI_PLACES=70, PETRI_TRANSITIONS=84} [2025-03-17 14:27:41,168 INFO L279 CegarLoopForPetriNet]: 46 programPoint places, 24 predicate places. [2025-03-17 14:27:41,169 INFO L471 AbstractCegarLoop]: Abstraction has has 70 places, 84 transitions, 504 flow [2025-03-17 14:27:41,169 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.0) internal successors, (60), 5 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 14:27:41,169 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 14:27:41,169 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 14:27:41,169 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-17 14:27:41,169 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2025-03-17 14:27:41,170 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 14:27:41,170 INFO L85 PathProgramCache]: Analyzing trace with hash 176172025, now seen corresponding path program 1 times [2025-03-17 14:27:41,170 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 14:27:41,170 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [27722666] [2025-03-17 14:27:41,170 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 14:27:41,170 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 14:27:41,176 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-03-17 14:27:41,179 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-03-17 14:27:41,179 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:27:41,180 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:27:41,220 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-17 14:27:41,220 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 14:27:41,220 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [27722666] [2025-03-17 14:27:41,220 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [27722666] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 14:27:41,221 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 14:27:41,221 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 14:27:41,221 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1528414210] [2025-03-17 14:27:41,221 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 14:27:41,221 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 14:27:41,221 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 14:27:41,222 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 14:27:41,222 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 14:27:41,222 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 42 [2025-03-17 14:27:41,222 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 70 places, 84 transitions, 504 flow. Second operand has 3 states, 3 states have (on average 16.333333333333332) internal successors, (49), 3 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 14:27:41,222 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 14:27:41,222 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 42 [2025-03-17 14:27:41,222 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 14:27:42,147 INFO L124 PetriNetUnfolderBase]: 13174/17583 cut-off events. [2025-03-17 14:27:42,147 INFO L125 PetriNetUnfolderBase]: For 33083/33316 co-relation queries the response was YES. [2025-03-17 14:27:42,186 INFO L83 FinitePrefix]: Finished finitePrefix Result has 55462 conditions, 17583 events. 13174/17583 cut-off events. For 33083/33316 co-relation queries the response was YES. Maximal size of possible extension queue 693. Compared 88664 event pairs, 4104 based on Foata normal form. 567/17361 useless extension candidates. Maximal degree in co-relation 45420. Up to 12915 conditions per place. [2025-03-17 14:27:42,250 INFO L140 encePairwiseOnDemand]: 39/42 looper letters, 90 selfloop transitions, 3 changer transitions 0/97 dead transitions. [2025-03-17 14:27:42,250 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 70 places, 97 transitions, 698 flow [2025-03-17 14:27:42,251 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 14:27:42,251 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-17 14:27:42,251 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 82 transitions. [2025-03-17 14:27:42,251 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6507936507936508 [2025-03-17 14:27:42,251 INFO L175 Difference]: Start difference. First operand has 70 places, 84 transitions, 504 flow. Second operand 3 states and 82 transitions. [2025-03-17 14:27:42,251 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 70 places, 97 transitions, 698 flow [2025-03-17 14:27:42,309 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 68 places, 97 transitions, 675 flow, removed 5 selfloop flow, removed 2 redundant places. [2025-03-17 14:27:42,311 INFO L231 Difference]: Finished difference. Result has 69 places, 73 transitions, 414 flow [2025-03-17 14:27:42,311 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=395, PETRI_DIFFERENCE_MINUEND_PLACES=66, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=72, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=69, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=414, PETRI_PLACES=69, PETRI_TRANSITIONS=73} [2025-03-17 14:27:42,311 INFO L279 CegarLoopForPetriNet]: 46 programPoint places, 23 predicate places. [2025-03-17 14:27:42,311 INFO L471 AbstractCegarLoop]: Abstraction has has 69 places, 73 transitions, 414 flow [2025-03-17 14:27:42,311 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 16.333333333333332) internal successors, (49), 3 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 14:27:42,312 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 14:27:42,312 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 14:27:42,312 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-17 14:27:42,312 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2025-03-17 14:27:42,312 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 14:27:42,312 INFO L85 PathProgramCache]: Analyzing trace with hash -908667079, now seen corresponding path program 1 times [2025-03-17 14:27:42,312 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 14:27:42,313 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [487430995] [2025-03-17 14:27:42,313 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 14:27:42,313 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 14:27:42,319 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-03-17 14:27:42,327 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-03-17 14:27:42,328 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:27:42,328 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:27:42,422 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-17 14:27:42,422 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 14:27:42,422 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [487430995] [2025-03-17 14:27:42,422 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [487430995] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 14:27:42,422 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 14:27:42,422 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-17 14:27:42,423 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [401503829] [2025-03-17 14:27:42,423 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 14:27:42,423 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-17 14:27:42,423 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 14:27:42,423 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-17 14:27:42,423 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-17 14:27:42,429 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 42 [2025-03-17 14:27:42,429 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 69 places, 73 transitions, 414 flow. Second operand has 5 states, 5 states have (on average 12.0) internal successors, (60), 5 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 14:27:42,429 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 14:27:42,429 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 42 [2025-03-17 14:27:42,429 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 14:27:43,263 INFO L124 PetriNetUnfolderBase]: 16752/22331 cut-off events. [2025-03-17 14:27:43,263 INFO L125 PetriNetUnfolderBase]: For 36089/36191 co-relation queries the response was YES. [2025-03-17 14:27:43,310 INFO L83 FinitePrefix]: Finished finitePrefix Result has 71316 conditions, 22331 events. 16752/22331 cut-off events. For 36089/36191 co-relation queries the response was YES. Maximal size of possible extension queue 770. Compared 116654 event pairs, 5823 based on Foata normal form. 0/20372 useless extension candidates. Maximal degree in co-relation 61770. Up to 13039 conditions per place. [2025-03-17 14:27:43,385 INFO L140 encePairwiseOnDemand]: 36/42 looper letters, 118 selfloop transitions, 14 changer transitions 0/135 dead transitions. [2025-03-17 14:27:43,385 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 73 places, 135 transitions, 879 flow [2025-03-17 14:27:43,386 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-17 14:27:43,386 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-03-17 14:27:43,386 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 131 transitions. [2025-03-17 14:27:43,386 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6238095238095238 [2025-03-17 14:27:43,386 INFO L175 Difference]: Start difference. First operand has 69 places, 73 transitions, 414 flow. Second operand 5 states and 131 transitions. [2025-03-17 14:27:43,386 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 73 places, 135 transitions, 879 flow [2025-03-17 14:27:43,512 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 72 places, 135 transitions, 876 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-17 14:27:43,513 INFO L231 Difference]: Finished difference. Result has 74 places, 75 transitions, 457 flow [2025-03-17 14:27:43,513 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=411, PETRI_DIFFERENCE_MINUEND_PLACES=68, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=73, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=59, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=457, PETRI_PLACES=74, PETRI_TRANSITIONS=75} [2025-03-17 14:27:43,514 INFO L279 CegarLoopForPetriNet]: 46 programPoint places, 28 predicate places. [2025-03-17 14:27:43,514 INFO L471 AbstractCegarLoop]: Abstraction has has 74 places, 75 transitions, 457 flow [2025-03-17 14:27:43,514 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.0) internal successors, (60), 5 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 14:27:43,514 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 14:27:43,514 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 14:27:43,514 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-17 14:27:43,514 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2025-03-17 14:27:43,515 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 14:27:43,515 INFO L85 PathProgramCache]: Analyzing trace with hash 726086995, now seen corresponding path program 2 times [2025-03-17 14:27:43,515 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 14:27:43,515 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1996017954] [2025-03-17 14:27:43,515 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-17 14:27:43,515 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 14:27:43,521 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 26 statements into 1 equivalence classes. [2025-03-17 14:27:43,525 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-03-17 14:27:43,525 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-17 14:27:43,525 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:27:43,591 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-17 14:27:43,591 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 14:27:43,591 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1996017954] [2025-03-17 14:27:43,591 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1996017954] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 14:27:43,591 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 14:27:43,591 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-17 14:27:43,591 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1711731668] [2025-03-17 14:27:43,591 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 14:27:43,591 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-17 14:27:43,591 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 14:27:43,592 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-17 14:27:43,592 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-03-17 14:27:43,600 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 42 [2025-03-17 14:27:43,600 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 74 places, 75 transitions, 457 flow. Second operand has 6 states, 6 states have (on average 11.166666666666666) internal successors, (67), 6 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 14:27:43,600 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 14:27:43,600 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 42 [2025-03-17 14:27:43,600 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 14:27:45,649 INFO L124 PetriNetUnfolderBase]: 35027/45568 cut-off events. [2025-03-17 14:27:45,649 INFO L125 PetriNetUnfolderBase]: For 99138/99623 co-relation queries the response was YES. [2025-03-17 14:27:45,770 INFO L83 FinitePrefix]: Finished finitePrefix Result has 151058 conditions, 45568 events. 35027/45568 cut-off events. For 99138/99623 co-relation queries the response was YES. Maximal size of possible extension queue 1347. Compared 239660 event pairs, 10407 based on Foata normal form. 0/41742 useless extension candidates. Maximal degree in co-relation 118261. Up to 21857 conditions per place. [2025-03-17 14:27:45,898 INFO L140 encePairwiseOnDemand]: 35/42 looper letters, 284 selfloop transitions, 10 changer transitions 0/297 dead transitions. [2025-03-17 14:27:45,898 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 79 places, 297 transitions, 2562 flow [2025-03-17 14:27:45,902 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-17 14:27:45,903 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-17 14:27:45,903 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 156 transitions. [2025-03-17 14:27:45,903 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6190476190476191 [2025-03-17 14:27:45,903 INFO L175 Difference]: Start difference. First operand has 74 places, 75 transitions, 457 flow. Second operand 6 states and 156 transitions. [2025-03-17 14:27:45,903 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 79 places, 297 transitions, 2562 flow [2025-03-17 14:27:46,002 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 77 places, 297 transitions, 2462 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-17 14:27:46,004 INFO L231 Difference]: Finished difference. Result has 81 places, 82 transitions, 507 flow [2025-03-17 14:27:46,004 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=437, PETRI_DIFFERENCE_MINUEND_PLACES=72, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=75, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=67, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=507, PETRI_PLACES=81, PETRI_TRANSITIONS=82} [2025-03-17 14:27:46,005 INFO L279 CegarLoopForPetriNet]: 46 programPoint places, 35 predicate places. [2025-03-17 14:27:46,005 INFO L471 AbstractCegarLoop]: Abstraction has has 81 places, 82 transitions, 507 flow [2025-03-17 14:27:46,005 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.166666666666666) internal successors, (67), 6 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 14:27:46,005 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 14:27:46,005 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 14:27:46,005 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-17 14:27:46,005 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2025-03-17 14:27:46,006 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 14:27:46,006 INFO L85 PathProgramCache]: Analyzing trace with hash 335296903, now seen corresponding path program 3 times [2025-03-17 14:27:46,006 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 14:27:46,006 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1189657136] [2025-03-17 14:27:46,006 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-17 14:27:46,006 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 14:27:46,010 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 26 statements into 2 equivalence classes. [2025-03-17 14:27:46,016 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 26 of 26 statements. [2025-03-17 14:27:46,016 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-03-17 14:27:46,016 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:27:46,068 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-17 14:27:46,068 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 14:27:46,068 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1189657136] [2025-03-17 14:27:46,068 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1189657136] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 14:27:46,068 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1466234609] [2025-03-17 14:27:46,068 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-17 14:27:46,068 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 14:27:46,068 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 14:27:46,073 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-17 14:27:46,074 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-17 14:27:46,105 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 26 statements into 2 equivalence classes. [2025-03-17 14:27:46,123 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 26 of 26 statements. [2025-03-17 14:27:46,123 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-03-17 14:27:46,123 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:27:46,124 INFO L256 TraceCheckSpWp]: Trace formula consists of 174 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-17 14:27:46,125 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 14:27:46,165 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-17 14:27:46,165 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 14:27:46,198 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-17 14:27:46,199 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1466234609] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 14:27:46,199 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 14:27:46,199 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5] total 11 [2025-03-17 14:27:46,199 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2041683994] [2025-03-17 14:27:46,199 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 14:27:46,199 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-17 14:27:46,199 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 14:27:46,199 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-17 14:27:46,199 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2025-03-17 14:27:46,202 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 42 [2025-03-17 14:27:46,202 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 81 places, 82 transitions, 507 flow. Second operand has 11 states, 11 states have (on average 9.636363636363637) internal successors, (106), 11 states have internal predecessors, (106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 14:27:46,202 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 14:27:46,202 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 42 [2025-03-17 14:27:46,202 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 14:27:50,001 INFO L124 PetriNetUnfolderBase]: 52751/68590 cut-off events. [2025-03-17 14:27:50,001 INFO L125 PetriNetUnfolderBase]: For 168177/168177 co-relation queries the response was YES. [2025-03-17 14:27:50,216 INFO L83 FinitePrefix]: Finished finitePrefix Result has 259324 conditions, 68590 events. 52751/68590 cut-off events. For 168177/168177 co-relation queries the response was YES. Maximal size of possible extension queue 1841. Compared 373596 event pairs, 11332 based on Foata normal form. 984/67450 useless extension candidates. Maximal degree in co-relation 223384. Up to 26980 conditions per place. [2025-03-17 14:27:50,421 INFO L140 encePairwiseOnDemand]: 34/42 looper letters, 223 selfloop transitions, 39 changer transitions 0/263 dead transitions. [2025-03-17 14:27:50,421 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 88 places, 263 transitions, 2092 flow [2025-03-17 14:27:50,425 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-17 14:27:50,425 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2025-03-17 14:27:50,425 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 207 transitions. [2025-03-17 14:27:50,425 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6160714285714286 [2025-03-17 14:27:50,425 INFO L175 Difference]: Start difference. First operand has 81 places, 82 transitions, 507 flow. Second operand 8 states and 207 transitions. [2025-03-17 14:27:50,425 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 88 places, 263 transitions, 2092 flow [2025-03-17 14:27:50,983 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 87 places, 263 transitions, 2051 flow, removed 10 selfloop flow, removed 1 redundant places. [2025-03-17 14:27:50,985 INFO L231 Difference]: Finished difference. Result has 92 places, 107 transitions, 835 flow [2025-03-17 14:27:50,985 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=497, PETRI_DIFFERENCE_MINUEND_PLACES=80, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=82, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=61, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=835, PETRI_PLACES=92, PETRI_TRANSITIONS=107} [2025-03-17 14:27:50,986 INFO L279 CegarLoopForPetriNet]: 46 programPoint places, 46 predicate places. [2025-03-17 14:27:50,986 INFO L471 AbstractCegarLoop]: Abstraction has has 92 places, 107 transitions, 835 flow [2025-03-17 14:27:50,986 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 9.636363636363637) internal successors, (106), 11 states have internal predecessors, (106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 14:27:50,986 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 14:27:50,986 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 14:27:50,993 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-03-17 14:27:51,187 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable7 [2025-03-17 14:27:51,187 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2025-03-17 14:27:51,187 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 14:27:51,187 INFO L85 PathProgramCache]: Analyzing trace with hash 501463885, now seen corresponding path program 4 times [2025-03-17 14:27:51,187 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 14:27:51,187 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1820568495] [2025-03-17 14:27:51,187 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-17 14:27:51,187 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 14:27:51,194 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 26 statements into 2 equivalence classes. [2025-03-17 14:27:51,198 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) and asserted 25 of 26 statements. [2025-03-17 14:27:51,198 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) [2025-03-17 14:27:51,198 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:27:51,228 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-17 14:27:51,228 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 14:27:51,228 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1820568495] [2025-03-17 14:27:51,228 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1820568495] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 14:27:51,228 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1279620834] [2025-03-17 14:27:51,228 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-17 14:27:51,228 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 14:27:51,228 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 14:27:51,231 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-17 14:27:51,232 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-17 14:27:51,263 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 26 statements into 2 equivalence classes. [2025-03-17 14:27:51,274 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) and asserted 25 of 26 statements. [2025-03-17 14:27:51,274 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) [2025-03-17 14:27:51,274 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:27:51,275 INFO L256 TraceCheckSpWp]: Trace formula consists of 146 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-17 14:27:51,275 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 14:27:51,309 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-17 14:27:51,310 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 14:27:51,331 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-17 14:27:51,332 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1279620834] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 14:27:51,332 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 14:27:51,332 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 7 [2025-03-17 14:27:51,332 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1137665532] [2025-03-17 14:27:51,332 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 14:27:51,333 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-17 14:27:51,334 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 14:27:51,334 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-17 14:27:51,334 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-03-17 14:27:51,338 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 42 [2025-03-17 14:27:51,338 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 92 places, 107 transitions, 835 flow. Second operand has 7 states, 7 states have (on average 11.428571428571429) internal successors, (80), 7 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 14:27:51,338 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 14:27:51,338 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 42 [2025-03-17 14:27:51,338 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 14:27:55,264 INFO L124 PetriNetUnfolderBase]: 48866/64505 cut-off events. [2025-03-17 14:27:55,264 INFO L125 PetriNetUnfolderBase]: For 210079/215594 co-relation queries the response was YES. [2025-03-17 14:27:55,478 INFO L83 FinitePrefix]: Finished finitePrefix Result has 253885 conditions, 64505 events. 48866/64505 cut-off events. For 210079/215594 co-relation queries the response was YES. Maximal size of possible extension queue 2071. Compared 371295 event pairs, 11860 based on Foata normal form. 2529/66880 useless extension candidates. Maximal degree in co-relation 217728. Up to 24247 conditions per place. [2025-03-17 14:27:55,826 INFO L140 encePairwiseOnDemand]: 35/42 looper letters, 271 selfloop transitions, 37 changer transitions 0/312 dead transitions. [2025-03-17 14:27:55,826 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 99 places, 312 transitions, 2722 flow [2025-03-17 14:27:55,826 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-17 14:27:55,826 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2025-03-17 14:27:55,827 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 209 transitions. [2025-03-17 14:27:55,827 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6220238095238095 [2025-03-17 14:27:55,827 INFO L175 Difference]: Start difference. First operand has 92 places, 107 transitions, 835 flow. Second operand 8 states and 209 transitions. [2025-03-17 14:27:55,827 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 99 places, 312 transitions, 2722 flow [2025-03-17 14:27:56,743 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 98 places, 312 transitions, 2646 flow, removed 27 selfloop flow, removed 1 redundant places. [2025-03-17 14:27:56,745 INFO L231 Difference]: Finished difference. Result has 101 places, 124 transitions, 1076 flow [2025-03-17 14:27:56,745 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=808, PETRI_DIFFERENCE_MINUEND_PLACES=91, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=107, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=23, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=76, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=1076, PETRI_PLACES=101, PETRI_TRANSITIONS=124} [2025-03-17 14:27:56,746 INFO L279 CegarLoopForPetriNet]: 46 programPoint places, 55 predicate places. [2025-03-17 14:27:56,746 INFO L471 AbstractCegarLoop]: Abstraction has has 101 places, 124 transitions, 1076 flow [2025-03-17 14:27:56,746 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 11.428571428571429) internal successors, (80), 7 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 14:27:56,746 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 14:27:56,746 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 14:27:56,751 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-03-17 14:27:56,946 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 14:27:56,947 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2025-03-17 14:27:56,947 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 14:27:56,947 INFO L85 PathProgramCache]: Analyzing trace with hash -1000658803, now seen corresponding path program 4 times [2025-03-17 14:27:56,947 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 14:27:56,947 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1922199119] [2025-03-17 14:27:56,947 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-17 14:27:56,947 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 14:27:56,952 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 26 statements into 2 equivalence classes. [2025-03-17 14:27:56,955 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) and asserted 25 of 26 statements. [2025-03-17 14:27:56,955 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) [2025-03-17 14:27:56,955 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:27:56,984 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-17 14:27:56,985 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 14:27:56,985 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1922199119] [2025-03-17 14:27:56,985 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1922199119] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 14:27:56,985 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 14:27:56,985 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-17 14:27:56,985 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [277739976] [2025-03-17 14:27:56,985 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 14:27:56,986 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-17 14:27:56,986 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 14:27:56,986 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-17 14:27:56,986 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-17 14:27:56,993 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 42 [2025-03-17 14:27:56,994 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 101 places, 124 transitions, 1076 flow. Second operand has 5 states, 5 states have (on average 11.0) internal successors, (55), 5 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-17 14:27:56,994 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 14:27:56,994 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 42 [2025-03-17 14:27:56,994 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 14:28:01,571 INFO L124 PetriNetUnfolderBase]: 59649/77816 cut-off events. [2025-03-17 14:28:01,571 INFO L125 PetriNetUnfolderBase]: For 270075/270075 co-relation queries the response was YES. [2025-03-17 14:28:01,864 INFO L83 FinitePrefix]: Finished finitePrefix Result has 320899 conditions, 77816 events. 59649/77816 cut-off events. For 270075/270075 co-relation queries the response was YES. Maximal size of possible extension queue 2089. Compared 428038 event pairs, 8818 based on Foata normal form. 172/77988 useless extension candidates. Maximal degree in co-relation 277521. Up to 48485 conditions per place. [2025-03-17 14:28:02,148 INFO L140 encePairwiseOnDemand]: 36/42 looper letters, 230 selfloop transitions, 27 changer transitions 0/258 dead transitions. [2025-03-17 14:28:02,148 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 105 places, 258 transitions, 2639 flow [2025-03-17 14:28:02,149 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-17 14:28:02,149 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-03-17 14:28:02,149 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 121 transitions. [2025-03-17 14:28:02,149 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5761904761904761 [2025-03-17 14:28:02,149 INFO L175 Difference]: Start difference. First operand has 101 places, 124 transitions, 1076 flow. Second operand 5 states and 121 transitions. [2025-03-17 14:28:02,149 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 105 places, 258 transitions, 2639 flow [2025-03-17 14:28:04,268 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 103 places, 258 transitions, 2463 flow, removed 44 selfloop flow, removed 2 redundant places. [2025-03-17 14:28:04,271 INFO L231 Difference]: Finished difference. Result has 106 places, 142 transitions, 1302 flow [2025-03-17 14:28:04,271 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=986, PETRI_DIFFERENCE_MINUEND_PLACES=99, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=124, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=101, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=1302, PETRI_PLACES=106, PETRI_TRANSITIONS=142} [2025-03-17 14:28:04,271 INFO L279 CegarLoopForPetriNet]: 46 programPoint places, 60 predicate places. [2025-03-17 14:28:04,271 INFO L471 AbstractCegarLoop]: Abstraction has has 106 places, 142 transitions, 1302 flow [2025-03-17 14:28:04,271 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.0) internal successors, (55), 5 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-17 14:28:04,271 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 14:28:04,271 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 14:28:04,272 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-17 14:28:04,272 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2025-03-17 14:28:04,272 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 14:28:04,272 INFO L85 PathProgramCache]: Analyzing trace with hash -1226112961, now seen corresponding path program 5 times [2025-03-17 14:28:04,272 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 14:28:04,272 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1297524590] [2025-03-17 14:28:04,272 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-17 14:28:04,272 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 14:28:04,277 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 26 statements into 2 equivalence classes. [2025-03-17 14:28:04,280 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 26 of 26 statements. [2025-03-17 14:28:04,280 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-17 14:28:04,280 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:28:04,329 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-17 14:28:04,329 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 14:28:04,329 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1297524590] [2025-03-17 14:28:04,329 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1297524590] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 14:28:04,329 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [563336240] [2025-03-17 14:28:04,329 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-17 14:28:04,329 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 14:28:04,329 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 14:28:04,332 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-17 14:28:04,333 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-17 14:28:04,372 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 26 statements into 2 equivalence classes. [2025-03-17 14:28:04,387 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 26 of 26 statements. [2025-03-17 14:28:04,387 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-17 14:28:04,387 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:28:04,388 INFO L256 TraceCheckSpWp]: Trace formula consists of 174 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-17 14:28:04,388 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 14:28:04,405 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-17 14:28:04,406 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 14:28:04,426 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-17 14:28:04,426 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [563336240] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 14:28:04,426 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 14:28:04,426 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 7 [2025-03-17 14:28:04,426 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [659739124] [2025-03-17 14:28:04,426 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 14:28:04,426 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-17 14:28:04,427 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 14:28:04,427 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-17 14:28:04,427 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2025-03-17 14:28:04,433 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 42 [2025-03-17 14:28:04,433 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 106 places, 142 transitions, 1302 flow. Second operand has 7 states, 7 states have (on average 10.142857142857142) internal successors, (71), 7 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 14:28:04,433 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 14:28:04,433 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 42 [2025-03-17 14:28:04,433 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 14:28:10,233 INFO L124 PetriNetUnfolderBase]: 71869/94312 cut-off events. [2025-03-17 14:28:10,234 INFO L125 PetriNetUnfolderBase]: For 385054/385054 co-relation queries the response was YES. [2025-03-17 14:28:10,624 INFO L83 FinitePrefix]: Finished finitePrefix Result has 400891 conditions, 94312 events. 71869/94312 cut-off events. For 385054/385054 co-relation queries the response was YES. Maximal size of possible extension queue 2665. Compared 541642 event pairs, 6468 based on Foata normal form. 684/94996 useless extension candidates. Maximal degree in co-relation 358575. Up to 27824 conditions per place. [2025-03-17 14:28:11,078 INFO L140 encePairwiseOnDemand]: 35/42 looper letters, 430 selfloop transitions, 103 changer transitions 2/536 dead transitions. [2025-03-17 14:28:11,078 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 116 places, 536 transitions, 5370 flow [2025-03-17 14:28:11,079 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-17 14:28:11,079 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2025-03-17 14:28:11,079 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 266 transitions. [2025-03-17 14:28:11,080 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5757575757575758 [2025-03-17 14:28:11,080 INFO L175 Difference]: Start difference. First operand has 106 places, 142 transitions, 1302 flow. Second operand 11 states and 266 transitions. [2025-03-17 14:28:11,080 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 116 places, 536 transitions, 5370 flow [2025-03-17 14:28:13,223 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 115 places, 536 transitions, 5338 flow, removed 6 selfloop flow, removed 1 redundant places. [2025-03-17 14:28:13,227 INFO L231 Difference]: Finished difference. Result has 119 places, 202 transitions, 2294 flow [2025-03-17 14:28:13,228 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=1281, PETRI_DIFFERENCE_MINUEND_PLACES=105, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=142, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=47, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=91, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=2294, PETRI_PLACES=119, PETRI_TRANSITIONS=202} [2025-03-17 14:28:13,228 INFO L279 CegarLoopForPetriNet]: 46 programPoint places, 73 predicate places. [2025-03-17 14:28:13,228 INFO L471 AbstractCegarLoop]: Abstraction has has 119 places, 202 transitions, 2294 flow [2025-03-17 14:28:13,228 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 10.142857142857142) internal successors, (71), 7 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 14:28:13,228 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 14:28:13,228 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 14:28:13,234 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-17 14:28:13,429 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 14:28:13,429 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2025-03-17 14:28:13,429 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 14:28:13,429 INFO L85 PathProgramCache]: Analyzing trace with hash -1205016825, now seen corresponding path program 5 times [2025-03-17 14:28:13,429 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 14:28:13,429 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2046108507] [2025-03-17 14:28:13,429 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-17 14:28:13,429 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 14:28:13,433 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 26 statements into 2 equivalence classes. [2025-03-17 14:28:13,436 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 26 of 26 statements. [2025-03-17 14:28:13,436 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-17 14:28:13,437 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:28:13,482 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-17 14:28:13,482 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 14:28:13,482 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2046108507] [2025-03-17 14:28:13,482 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2046108507] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 14:28:13,482 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [164119973] [2025-03-17 14:28:13,482 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-17 14:28:13,482 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 14:28:13,482 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 14:28:13,484 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-17 14:28:13,486 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-17 14:28:13,517 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 26 statements into 2 equivalence classes. [2025-03-17 14:28:13,529 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 26 of 26 statements. [2025-03-17 14:28:13,529 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-17 14:28:13,529 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:28:13,530 INFO L256 TraceCheckSpWp]: Trace formula consists of 174 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-17 14:28:13,530 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 14:28:13,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-17 14:28:13,629 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 14:28:13,652 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-17 14:28:13,653 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [164119973] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 14:28:13,653 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 14:28:13,654 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 9 [2025-03-17 14:28:13,654 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [371946167] [2025-03-17 14:28:13,654 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 14:28:13,654 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-17 14:28:13,654 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 14:28:13,654 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-17 14:28:13,654 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2025-03-17 14:28:13,665 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 42 [2025-03-17 14:28:13,665 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 119 places, 202 transitions, 2294 flow. Second operand has 9 states, 9 states have (on average 10.88888888888889) internal successors, (98), 9 states have internal predecessors, (98), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 14:28:13,666 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 14:28:13,666 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 42 [2025-03-17 14:28:13,666 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand