./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/pthread/fib_unsafe-10.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version e2fb8bed Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../sv-benchmarks/c/pthread/fib_unsafe-10.i -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 89d9c43e2f37f1bac8114d01260f8a993f33530b50231d4afed1f3cf3859d385 --- Real Ultimate output --- This is Ultimate 0.3.0-?-e2fb8be-m [2025-03-09 00:54:03,859 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-09 00:54:03,914 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2025-03-09 00:54:03,917 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-09 00:54:03,920 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-09 00:54:03,940 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-09 00:54:03,941 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-09 00:54:03,941 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-09 00:54:03,942 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-09 00:54:03,942 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-09 00:54:03,942 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-09 00:54:03,942 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-09 00:54:03,943 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-09 00:54:03,943 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-09 00:54:03,943 INFO L153 SettingsManager]: * Use SBE=true [2025-03-09 00:54:03,943 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-09 00:54:03,943 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-09 00:54:03,944 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-09 00:54:03,944 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-09 00:54:03,944 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-09 00:54:03,944 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2025-03-09 00:54:03,944 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2025-03-09 00:54:03,944 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2025-03-09 00:54:03,944 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-09 00:54:03,944 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-03-09 00:54:03,944 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-03-09 00:54:03,944 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-09 00:54:03,944 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-09 00:54:03,944 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-09 00:54:03,944 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-09 00:54:03,945 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-09 00:54:03,945 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-09 00:54:03,945 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-09 00:54:03,945 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-09 00:54:03,945 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-09 00:54:03,945 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-09 00:54:03,945 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-09 00:54:03,946 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-09 00:54:03,946 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-09 00:54:03,946 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-09 00:54:03,946 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-09 00:54:03,946 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-09 00:54:03,946 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 -> 89d9c43e2f37f1bac8114d01260f8a993f33530b50231d4afed1f3cf3859d385 [2025-03-09 00:54:04,145 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-09 00:54:04,153 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-09 00:54:04,154 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-09 00:54:04,155 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-09 00:54:04,155 INFO L274 PluginConnector]: CDTParser initialized [2025-03-09 00:54:04,157 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/pthread/fib_unsafe-10.i [2025-03-09 00:54:05,240 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f60570e92/4f68c5f0989649ecb7bf25c92b8796e7/FLAG733e23f78 [2025-03-09 00:54:05,516 INFO L384 CDTParser]: Found 1 translation units. [2025-03-09 00:54:05,519 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread/fib_unsafe-10.i [2025-03-09 00:54:05,532 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f60570e92/4f68c5f0989649ecb7bf25c92b8796e7/FLAG733e23f78 [2025-03-09 00:54:05,546 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f60570e92/4f68c5f0989649ecb7bf25c92b8796e7 [2025-03-09 00:54:05,548 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-09 00:54:05,550 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-09 00:54:05,551 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-09 00:54:05,551 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-09 00:54:05,554 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-09 00:54:05,555 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.03 12:54:05" (1/1) ... [2025-03-09 00:54:05,556 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@36402bbd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 12:54:05, skipping insertion in model container [2025-03-09 00:54:05,556 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.03 12:54:05" (1/1) ... [2025-03-09 00:54:05,584 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-09 00:54:05,792 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-09 00:54:05,799 INFO L200 MainTranslator]: Completed pre-run [2025-03-09 00:54:05,827 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-09 00:54:05,846 INFO L204 MainTranslator]: Completed translation [2025-03-09 00:54:05,847 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 12:54:05 WrapperNode [2025-03-09 00:54:05,847 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-09 00:54:05,847 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-09 00:54:05,847 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-09 00:54:05,848 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-09 00:54:05,851 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 12:54:05" (1/1) ... [2025-03-09 00:54:05,862 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 12:54:05" (1/1) ... [2025-03-09 00:54:05,877 INFO L138 Inliner]: procedures = 164, calls = 21, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 65 [2025-03-09 00:54:05,877 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-09 00:54:05,878 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-09 00:54:05,878 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-09 00:54:05,878 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-09 00:54:05,882 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 12:54:05" (1/1) ... [2025-03-09 00:54:05,883 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 12:54:05" (1/1) ... [2025-03-09 00:54:05,884 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 12:54:05" (1/1) ... [2025-03-09 00:54:05,893 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-09 00:54:05,893 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 12:54:05" (1/1) ... [2025-03-09 00:54:05,893 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 12:54:05" (1/1) ... [2025-03-09 00:54:05,896 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 12:54:05" (1/1) ... [2025-03-09 00:54:05,897 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 12:54:05" (1/1) ... [2025-03-09 00:54:05,897 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 12:54:05" (1/1) ... [2025-03-09 00:54:05,898 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 12:54:05" (1/1) ... [2025-03-09 00:54:05,899 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-09 00:54:05,900 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-09 00:54:05,900 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-09 00:54:05,900 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-09 00:54:05,900 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 12:54:05" (1/1) ... [2025-03-09 00:54:05,904 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-09 00:54:05,912 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 00:54:05,922 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-09 00:54:05,925 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-09 00:54:05,941 INFO L130 BoogieDeclarations]: Found specification of procedure t1 [2025-03-09 00:54:05,941 INFO L138 BoogieDeclarations]: Found implementation of procedure t1 [2025-03-09 00:54:05,941 INFO L130 BoogieDeclarations]: Found specification of procedure t2 [2025-03-09 00:54:05,941 INFO L138 BoogieDeclarations]: Found implementation of procedure t2 [2025-03-09 00:54:05,941 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2025-03-09 00:54:05,941 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-09 00:54:05,941 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-09 00:54:05,941 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2025-03-09 00:54:05,941 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-09 00:54:05,941 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-09 00:54:05,942 WARN L225 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-03-09 00:54:06,036 INFO L256 CfgBuilder]: Building ICFG [2025-03-09 00:54:06,037 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-09 00:54:06,172 INFO L303 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-03-09 00:54:06,172 INFO L307 CfgBuilder]: Performing block encoding [2025-03-09 00:54:06,238 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-09 00:54:06,238 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-09 00:54:06,238 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 09.03 12:54:06 BoogieIcfgContainer [2025-03-09 00:54:06,238 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-09 00:54:06,240 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-09 00:54:06,240 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-09 00:54:06,243 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-09 00:54:06,243 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.03 12:54:05" (1/3) ... [2025-03-09 00:54:06,244 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6f959f53 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.03 12:54:06, skipping insertion in model container [2025-03-09 00:54:06,244 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 12:54:05" (2/3) ... [2025-03-09 00:54:06,244 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6f959f53 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.03 12:54:06, skipping insertion in model container [2025-03-09 00:54:06,244 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 09.03 12:54:06" (3/3) ... [2025-03-09 00:54:06,245 INFO L128 eAbstractionObserver]: Analyzing ICFG fib_unsafe-10.i [2025-03-09 00:54:06,255 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-09 00:54:06,256 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG fib_unsafe-10.i that has 3 procedures, 30 locations, 1 initial locations, 3 loop locations, and 2 error locations. [2025-03-09 00:54:06,257 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-03-09 00:54:06,285 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-03-09 00:54:06,310 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 36 places, 34 transitions, 76 flow [2025-03-09 00:54:06,336 INFO L124 PetriNetUnfolderBase]: 5/32 cut-off events. [2025-03-09 00:54:06,340 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-09 00:54:06,342 INFO L83 FinitePrefix]: Finished finitePrefix Result has 39 conditions, 32 events. 5/32 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 43 event pairs, 0 based on Foata normal form. 0/25 useless extension candidates. Maximal degree in co-relation 29. Up to 2 conditions per place. [2025-03-09 00:54:06,342 INFO L82 GeneralOperation]: Start removeDead. Operand has 36 places, 34 transitions, 76 flow [2025-03-09 00:54:06,344 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 34 places, 32 transitions, 70 flow [2025-03-09 00:54:06,352 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-09 00:54:06,359 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;@e85b6b9, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-09 00:54:06,359 INFO L334 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2025-03-09 00:54:06,366 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-09 00:54:06,366 INFO L124 PetriNetUnfolderBase]: 5/29 cut-off events. [2025-03-09 00:54:06,366 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-09 00:54:06,366 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 00:54:06,367 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 00:54:06,367 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-03-09 00:54:06,370 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 00:54:06,371 INFO L85 PathProgramCache]: Analyzing trace with hash 1473564154, now seen corresponding path program 1 times [2025-03-09 00:54:06,375 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 00:54:06,375 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [330342091] [2025-03-09 00:54:06,376 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 00:54:06,376 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 00:54:06,438 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-03-09 00:54:06,451 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-03-09 00:54:06,452 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 00:54:06,452 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 00:54:06,571 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 00:54:06,573 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 00:54:06,573 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [330342091] [2025-03-09 00:54:06,574 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [330342091] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 00:54:06,574 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 00:54:06,574 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-09 00:54:06,575 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1409263697] [2025-03-09 00:54:06,576 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 00:54:06,580 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-09 00:54:06,585 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 00:54:06,598 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-09 00:54:06,598 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-09 00:54:06,599 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 34 [2025-03-09 00:54:06,600 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 34 places, 32 transitions, 70 flow. Second operand has 3 states, 3 states have (on average 12.0) internal successors, (36), 3 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 00:54:06,600 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 00:54:06,600 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 34 [2025-03-09 00:54:06,601 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 00:54:06,743 INFO L124 PetriNetUnfolderBase]: 297/523 cut-off events. [2025-03-09 00:54:06,743 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2025-03-09 00:54:06,745 INFO L83 FinitePrefix]: Finished finitePrefix Result has 990 conditions, 523 events. 297/523 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 37. Compared 2156 event pairs, 39 based on Foata normal form. 32/534 useless extension candidates. Maximal degree in co-relation 974. Up to 353 conditions per place. [2025-03-09 00:54:06,748 INFO L140 encePairwiseOnDemand]: 29/34 looper letters, 29 selfloop transitions, 2 changer transitions 1/38 dead transitions. [2025-03-09 00:54:06,749 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 35 places, 38 transitions, 146 flow [2025-03-09 00:54:06,753 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-09 00:54:06,754 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-09 00:54:06,763 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 59 transitions. [2025-03-09 00:54:06,766 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5784313725490197 [2025-03-09 00:54:06,767 INFO L175 Difference]: Start difference. First operand has 34 places, 32 transitions, 70 flow. Second operand 3 states and 59 transitions. [2025-03-09 00:54:06,767 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 35 places, 38 transitions, 146 flow [2025-03-09 00:54:06,770 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 33 places, 38 transitions, 144 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-09 00:54:06,771 INFO L231 Difference]: Finished difference. Result has 34 places, 29 transitions, 72 flow [2025-03-09 00:54:06,773 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=34, PETRI_DIFFERENCE_MINUEND_FLOW=62, PETRI_DIFFERENCE_MINUEND_PLACES=31, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=29, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=27, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=72, PETRI_PLACES=34, PETRI_TRANSITIONS=29} [2025-03-09 00:54:06,777 INFO L279 CegarLoopForPetriNet]: 34 programPoint places, 0 predicate places. [2025-03-09 00:54:06,777 INFO L471 AbstractCegarLoop]: Abstraction has has 34 places, 29 transitions, 72 flow [2025-03-09 00:54:06,777 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 12.0) internal successors, (36), 3 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 00:54:06,777 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 00:54:06,777 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 00:54:06,778 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-09 00:54:06,778 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-03-09 00:54:06,778 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 00:54:06,778 INFO L85 PathProgramCache]: Analyzing trace with hash -1404976497, now seen corresponding path program 1 times [2025-03-09 00:54:06,778 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 00:54:06,778 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [189287464] [2025-03-09 00:54:06,778 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 00:54:06,779 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 00:54:06,806 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-03-09 00:54:06,820 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-03-09 00:54:06,820 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 00:54:06,820 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 00:54:06,884 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 00:54:06,884 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 00:54:06,884 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [189287464] [2025-03-09 00:54:06,884 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [189287464] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 00:54:06,884 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [493082689] [2025-03-09 00:54:06,884 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 00:54:06,884 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 00:54:06,884 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 00:54:06,886 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-09 00:54:06,887 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-09 00:54:06,936 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-03-09 00:54:06,951 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-03-09 00:54:06,952 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 00:54:06,952 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 00:54:06,953 INFO L256 TraceCheckSpWp]: Trace formula consists of 104 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-09 00:54:06,955 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 00:54:06,988 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-09 00:54:06,988 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-09 00:54:06,988 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [493082689] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 00:54:06,988 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-09 00:54:06,988 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [4] total 5 [2025-03-09 00:54:06,989 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [656081895] [2025-03-09 00:54:06,989 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 00:54:06,989 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-09 00:54:06,989 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 00:54:06,989 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-09 00:54:06,990 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-09 00:54:06,990 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 34 [2025-03-09 00:54:06,990 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 34 places, 29 transitions, 72 flow. Second operand has 3 states, 3 states have (on average 11.666666666666666) internal successors, (35), 3 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 00:54:06,990 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 00:54:06,990 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 34 [2025-03-09 00:54:06,990 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 00:54:07,048 INFO L124 PetriNetUnfolderBase]: 265/459 cut-off events. [2025-03-09 00:54:07,048 INFO L125 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2025-03-09 00:54:07,049 INFO L83 FinitePrefix]: Finished finitePrefix Result has 943 conditions, 459 events. 265/459 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 30. Compared 1781 event pairs, 183 based on Foata normal form. 16/454 useless extension candidates. Maximal degree in co-relation 926. Up to 405 conditions per place. [2025-03-09 00:54:07,051 INFO L140 encePairwiseOnDemand]: 32/34 looper letters, 21 selfloop transitions, 1 changer transitions 1/28 dead transitions. [2025-03-09 00:54:07,051 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 34 places, 28 transitions, 116 flow [2025-03-09 00:54:07,051 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-09 00:54:07,051 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-09 00:54:07,051 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 44 transitions. [2025-03-09 00:54:07,051 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.43137254901960786 [2025-03-09 00:54:07,052 INFO L175 Difference]: Start difference. First operand has 34 places, 29 transitions, 72 flow. Second operand 3 states and 44 transitions. [2025-03-09 00:54:07,052 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 34 places, 28 transitions, 116 flow [2025-03-09 00:54:07,052 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 33 places, 28 transitions, 114 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-09 00:54:07,052 INFO L231 Difference]: Finished difference. Result has 33 places, 27 transitions, 68 flow [2025-03-09 00:54:07,052 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=34, PETRI_DIFFERENCE_MINUEND_FLOW=68, PETRI_DIFFERENCE_MINUEND_PLACES=31, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=28, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=27, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=68, PETRI_PLACES=33, PETRI_TRANSITIONS=27} [2025-03-09 00:54:07,053 INFO L279 CegarLoopForPetriNet]: 34 programPoint places, -1 predicate places. [2025-03-09 00:54:07,053 INFO L471 AbstractCegarLoop]: Abstraction has has 33 places, 27 transitions, 68 flow [2025-03-09 00:54:07,053 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 11.666666666666666) internal successors, (35), 3 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 00:54:07,053 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 00:54:07,053 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 00:54:07,059 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-03-09 00:54:07,253 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 00:54:07,254 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-03-09 00:54:07,254 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 00:54:07,254 INFO L85 PathProgramCache]: Analyzing trace with hash -1404975617, now seen corresponding path program 1 times [2025-03-09 00:54:07,254 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 00:54:07,255 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [98994109] [2025-03-09 00:54:07,255 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 00:54:07,255 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 00:54:07,261 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-03-09 00:54:07,268 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-03-09 00:54:07,269 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 00:54:07,269 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 00:54:07,324 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 00:54:07,324 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 00:54:07,324 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [98994109] [2025-03-09 00:54:07,324 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [98994109] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 00:54:07,324 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [214752432] [2025-03-09 00:54:07,324 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 00:54:07,324 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 00:54:07,324 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 00:54:07,326 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-09 00:54:07,328 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-09 00:54:07,362 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-03-09 00:54:07,379 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-03-09 00:54:07,380 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 00:54:07,380 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 00:54:07,381 INFO L256 TraceCheckSpWp]: Trace formula consists of 104 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-09 00:54:07,382 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 00:54:07,404 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 00:54:07,405 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 00:54:07,424 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 00:54:07,424 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [214752432] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-09 00:54:07,424 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-09 00:54:07,424 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 7 [2025-03-09 00:54:07,424 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1236637923] [2025-03-09 00:54:07,424 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-09 00:54:07,425 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-09 00:54:07,425 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 00:54:07,425 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-09 00:54:07,425 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2025-03-09 00:54:07,425 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 34 [2025-03-09 00:54:07,425 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 33 places, 27 transitions, 68 flow. Second operand has 7 states, 7 states have (on average 10.571428571428571) internal successors, (74), 7 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 00:54:07,425 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 00:54:07,425 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 34 [2025-03-09 00:54:07,425 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 00:54:07,542 INFO L124 PetriNetUnfolderBase]: 329/555 cut-off events. [2025-03-09 00:54:07,543 INFO L125 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2025-03-09 00:54:07,544 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1168 conditions, 555 events. 329/555 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 26. Compared 2078 event pairs, 39 based on Foata normal form. 0/534 useless extension candidates. Maximal degree in co-relation 1160. Up to 257 conditions per place. [2025-03-09 00:54:07,547 INFO L140 encePairwiseOnDemand]: 31/34 looper letters, 52 selfloop transitions, 5 changer transitions 0/62 dead transitions. [2025-03-09 00:54:07,547 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 37 places, 62 transitions, 258 flow [2025-03-09 00:54:07,547 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-09 00:54:07,548 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-09 00:54:07,548 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 108 transitions. [2025-03-09 00:54:07,548 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5294117647058824 [2025-03-09 00:54:07,548 INFO L175 Difference]: Start difference. First operand has 33 places, 27 transitions, 68 flow. Second operand 6 states and 108 transitions. [2025-03-09 00:54:07,548 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 37 places, 62 transitions, 258 flow [2025-03-09 00:54:07,549 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 36 places, 62 transitions, 257 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-09 00:54:07,549 INFO L231 Difference]: Finished difference. Result has 39 places, 30 transitions, 103 flow [2025-03-09 00:54:07,550 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=34, PETRI_DIFFERENCE_MINUEND_FLOW=67, PETRI_DIFFERENCE_MINUEND_PLACES=31, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=24, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=103, PETRI_PLACES=39, PETRI_TRANSITIONS=30} [2025-03-09 00:54:07,550 INFO L279 CegarLoopForPetriNet]: 34 programPoint places, 5 predicate places. [2025-03-09 00:54:07,550 INFO L471 AbstractCegarLoop]: Abstraction has has 39 places, 30 transitions, 103 flow [2025-03-09 00:54:07,550 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 10.571428571428571) internal successors, (74), 7 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 00:54:07,550 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 00:54:07,550 INFO L206 CegarLoopForPetriNet]: trace histogram [4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 00:54:07,560 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-03-09 00:54:07,751 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,SelfDestructingSolverStorable2 [2025-03-09 00:54:07,751 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-03-09 00:54:07,751 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 00:54:07,752 INFO L85 PathProgramCache]: Analyzing trace with hash -2051551574, now seen corresponding path program 2 times [2025-03-09 00:54:07,752 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 00:54:07,752 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1534487746] [2025-03-09 00:54:07,752 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-09 00:54:07,752 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 00:54:07,762 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 18 statements into 2 equivalence classes. [2025-03-09 00:54:07,773 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 18 of 18 statements. [2025-03-09 00:54:07,774 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-09 00:54:07,774 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 00:54:07,855 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 00:54:07,855 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 00:54:07,855 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1534487746] [2025-03-09 00:54:07,855 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1534487746] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 00:54:07,855 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1938170940] [2025-03-09 00:54:07,855 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-09 00:54:07,855 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 00:54:07,855 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 00:54:07,858 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-09 00:54:07,859 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-03-09 00:54:07,913 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 18 statements into 2 equivalence classes. [2025-03-09 00:54:07,928 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 18 of 18 statements. [2025-03-09 00:54:07,928 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-09 00:54:07,928 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 00:54:07,929 INFO L256 TraceCheckSpWp]: Trace formula consists of 131 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-09 00:54:07,930 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 00:54:07,947 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 00:54:07,947 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 00:54:07,997 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 00:54:07,998 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1938170940] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-09 00:54:07,998 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-09 00:54:07,998 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 13 [2025-03-09 00:54:07,998 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [681660393] [2025-03-09 00:54:07,998 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-09 00:54:07,998 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-03-09 00:54:07,998 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 00:54:07,998 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-03-09 00:54:07,999 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2025-03-09 00:54:07,999 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 34 [2025-03-09 00:54:08,000 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 39 places, 30 transitions, 103 flow. Second operand has 13 states, 13 states have (on average 9.846153846153847) internal successors, (128), 13 states have internal predecessors, (128), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 00:54:08,000 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 00:54:08,001 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 34 [2025-03-09 00:54:08,001 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 00:54:08,161 INFO L124 PetriNetUnfolderBase]: 521/843 cut-off events. [2025-03-09 00:54:08,161 INFO L125 PetriNetUnfolderBase]: For 364/364 co-relation queries the response was YES. [2025-03-09 00:54:08,163 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2116 conditions, 843 events. 521/843 cut-off events. For 364/364 co-relation queries the response was YES. Maximal size of possible extension queue 26. Compared 3138 event pairs, 39 based on Foata normal form. 96/934 useless extension candidates. Maximal degree in co-relation 2104. Up to 257 conditions per place. [2025-03-09 00:54:08,165 INFO L140 encePairwiseOnDemand]: 31/34 looper letters, 100 selfloop transitions, 11 changer transitions 0/116 dead transitions. [2025-03-09 00:54:08,165 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 50 places, 116 transitions, 521 flow [2025-03-09 00:54:08,166 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-09 00:54:08,166 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2025-03-09 00:54:08,169 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 213 transitions. [2025-03-09 00:54:08,169 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5220588235294118 [2025-03-09 00:54:08,169 INFO L175 Difference]: Start difference. First operand has 39 places, 30 transitions, 103 flow. Second operand 12 states and 213 transitions. [2025-03-09 00:54:08,169 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 50 places, 116 transitions, 521 flow [2025-03-09 00:54:08,171 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 116 transitions, 507 flow, removed 6 selfloop flow, removed 1 redundant places. [2025-03-09 00:54:08,175 INFO L231 Difference]: Finished difference. Result has 55 places, 36 transitions, 173 flow [2025-03-09 00:54:08,175 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=34, PETRI_DIFFERENCE_MINUEND_FLOW=89, PETRI_DIFFERENCE_MINUEND_PLACES=38, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=30, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=24, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=173, PETRI_PLACES=55, PETRI_TRANSITIONS=36} [2025-03-09 00:54:08,175 INFO L279 CegarLoopForPetriNet]: 34 programPoint places, 21 predicate places. [2025-03-09 00:54:08,175 INFO L471 AbstractCegarLoop]: Abstraction has has 55 places, 36 transitions, 173 flow [2025-03-09 00:54:08,176 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 9.846153846153847) internal successors, (128), 13 states have internal predecessors, (128), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 00:54:08,176 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 00:54:08,176 INFO L206 CegarLoopForPetriNet]: trace histogram [10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 00:54:08,183 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-03-09 00:54:08,376 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 00:54:08,377 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-03-09 00:54:08,377 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 00:54:08,377 INFO L85 PathProgramCache]: Analyzing trace with hash -1525932406, now seen corresponding path program 3 times [2025-03-09 00:54:08,377 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 00:54:08,377 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1827171851] [2025-03-09 00:54:08,377 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-09 00:54:08,377 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 00:54:08,384 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 24 statements into 6 equivalence classes. [2025-03-09 00:54:08,416 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) and asserted 24 of 24 statements. [2025-03-09 00:54:08,416 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2025-03-09 00:54:08,416 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 00:54:08,590 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 00:54:08,590 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 00:54:08,590 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1827171851] [2025-03-09 00:54:08,590 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1827171851] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 00:54:08,590 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1931604988] [2025-03-09 00:54:08,590 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-09 00:54:08,591 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 00:54:08,591 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 00:54:08,593 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-09 00:54:08,594 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-03-09 00:54:08,632 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 24 statements into 6 equivalence classes. [2025-03-09 00:54:08,660 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) and asserted 24 of 24 statements. [2025-03-09 00:54:08,660 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2025-03-09 00:54:08,660 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 00:54:08,661 INFO L256 TraceCheckSpWp]: Trace formula consists of 185 conjuncts, 12 conjuncts are in the unsatisfiable core [2025-03-09 00:54:08,663 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 00:54:08,697 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 00:54:08,697 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 00:54:08,885 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 00:54:08,885 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1931604988] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-09 00:54:08,885 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-09 00:54:08,886 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 13] total 25 [2025-03-09 00:54:08,886 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1108351583] [2025-03-09 00:54:08,886 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-09 00:54:08,886 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2025-03-09 00:54:08,886 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 00:54:08,887 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2025-03-09 00:54:08,887 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=300, Invalid=300, Unknown=0, NotChecked=0, Total=600 [2025-03-09 00:54:08,890 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 34 [2025-03-09 00:54:08,890 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 55 places, 36 transitions, 173 flow. Second operand has 25 states, 25 states have (on average 9.44) internal successors, (236), 25 states have internal predecessors, (236), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 00:54:08,890 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 00:54:08,890 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 34 [2025-03-09 00:54:08,891 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 00:54:09,245 INFO L124 PetriNetUnfolderBase]: 905/1419 cut-off events. [2025-03-09 00:54:09,246 INFO L125 PetriNetUnfolderBase]: For 7468/7468 co-relation queries the response was YES. [2025-03-09 00:54:09,250 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4123 conditions, 1419 events. 905/1419 cut-off events. For 7468/7468 co-relation queries the response was YES. Maximal size of possible extension queue 26. Compared 5205 event pairs, 39 based on Foata normal form. 192/1606 useless extension candidates. Maximal degree in co-relation 4104. Up to 337 conditions per place. [2025-03-09 00:54:09,256 INFO L140 encePairwiseOnDemand]: 31/34 looper letters, 196 selfloop transitions, 23 changer transitions 0/224 dead transitions. [2025-03-09 00:54:09,256 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 78 places, 224 transitions, 1059 flow [2025-03-09 00:54:09,257 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2025-03-09 00:54:09,257 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2025-03-09 00:54:09,259 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 423 transitions. [2025-03-09 00:54:09,259 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5183823529411765 [2025-03-09 00:54:09,259 INFO L175 Difference]: Start difference. First operand has 55 places, 36 transitions, 173 flow. Second operand 24 states and 423 transitions. [2025-03-09 00:54:09,260 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 78 places, 224 transitions, 1059 flow [2025-03-09 00:54:09,269 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 73 places, 224 transitions, 987 flow, removed 31 selfloop flow, removed 5 redundant places. [2025-03-09 00:54:09,271 INFO L231 Difference]: Finished difference. Result has 85 places, 48 transitions, 293 flow [2025-03-09 00:54:09,272 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=34, PETRI_DIFFERENCE_MINUEND_FLOW=125, PETRI_DIFFERENCE_MINUEND_PLACES=50, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=36, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=24, PETRI_DIFFERENCE_SUBTRAHEND_STATES=24, PETRI_FLOW=293, PETRI_PLACES=85, PETRI_TRANSITIONS=48} [2025-03-09 00:54:09,274 INFO L279 CegarLoopForPetriNet]: 34 programPoint places, 51 predicate places. [2025-03-09 00:54:09,274 INFO L471 AbstractCegarLoop]: Abstraction has has 85 places, 48 transitions, 293 flow [2025-03-09 00:54:09,274 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 25 states have (on average 9.44) internal successors, (236), 25 states have internal predecessors, (236), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 00:54:09,274 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 00:54:09,274 INFO L206 CegarLoopForPetriNet]: trace histogram [22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 00:54:09,281 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2025-03-09 00:54:09,479 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 00:54:09,479 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-03-09 00:54:09,479 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 00:54:09,479 INFO L85 PathProgramCache]: Analyzing trace with hash 773359178, now seen corresponding path program 4 times [2025-03-09 00:54:09,480 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 00:54:09,480 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1432528804] [2025-03-09 00:54:09,480 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-09 00:54:09,480 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 00:54:09,486 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 36 statements into 2 equivalence classes. [2025-03-09 00:54:09,520 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 36 of 36 statements. [2025-03-09 00:54:09,521 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-03-09 00:54:09,521 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 00:54:10,982 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 0 proven. 253 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 00:54:10,982 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 00:54:10,983 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1432528804] [2025-03-09 00:54:10,983 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1432528804] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 00:54:10,983 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1114052310] [2025-03-09 00:54:10,983 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-09 00:54:10,983 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 00:54:10,983 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 00:54:10,985 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-09 00:54:10,987 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-03-09 00:54:11,029 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 36 statements into 2 equivalence classes. [2025-03-09 00:54:11,057 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 36 of 36 statements. [2025-03-09 00:54:11,057 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-03-09 00:54:11,057 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 00:54:11,062 INFO L256 TraceCheckSpWp]: Trace formula consists of 293 conjuncts, 77 conjuncts are in the unsatisfiable core [2025-03-09 00:54:11,065 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 00:54:12,313 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 210 proven. 43 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 00:54:12,314 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 00:54:13,701 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 0 proven. 253 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 00:54:13,701 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1114052310] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-09 00:54:13,701 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-09 00:54:13,701 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 29, 29] total 85 [2025-03-09 00:54:13,701 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [740308124] [2025-03-09 00:54:13,701 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-09 00:54:13,701 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 86 states [2025-03-09 00:54:13,702 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 00:54:13,702 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 86 interpolants. [2025-03-09 00:54:13,705 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1010, Invalid=6300, Unknown=0, NotChecked=0, Total=7310 [2025-03-09 00:54:13,709 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 34 [2025-03-09 00:54:13,709 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 85 places, 48 transitions, 293 flow. Second operand has 86 states, 86 states have (on average 8.186046511627907) internal successors, (704), 86 states have internal predecessors, (704), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 00:54:13,710 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 00:54:13,710 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 34 [2025-03-09 00:54:13,710 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 00:54:45,539 INFO L124 PetriNetUnfolderBase]: 31762/52483 cut-off events. [2025-03-09 00:54:45,539 INFO L125 PetriNetUnfolderBase]: For 195751/195751 co-relation queries the response was YES. [2025-03-09 00:54:45,696 INFO L83 FinitePrefix]: Finished finitePrefix Result has 148939 conditions, 52483 events. 31762/52483 cut-off events. For 195751/195751 co-relation queries the response was YES. Maximal size of possible extension queue 558. Compared 362114 event pairs, 104 based on Foata normal form. 0/51987 useless extension candidates. Maximal degree in co-relation 148908. Up to 7717 conditions per place. [2025-03-09 00:54:45,872 INFO L140 encePairwiseOnDemand]: 24/34 looper letters, 869 selfloop transitions, 1254 changer transitions 1053/3180 dead transitions. [2025-03-09 00:54:45,872 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 346 places, 3180 transitions, 21998 flow [2025-03-09 00:54:45,874 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 262 states. [2025-03-09 00:54:45,874 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 262 states. [2025-03-09 00:54:45,886 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 262 states to 262 states and 4041 transitions. [2025-03-09 00:54:45,888 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.45363718006286485 [2025-03-09 00:54:45,888 INFO L175 Difference]: Start difference. First operand has 85 places, 48 transitions, 293 flow. Second operand 262 states and 4041 transitions. [2025-03-09 00:54:45,888 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 346 places, 3180 transitions, 21998 flow [2025-03-09 00:54:46,101 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 335 places, 3180 transitions, 17336 flow, removed 1850 selfloop flow, removed 11 redundant places. [2025-03-09 00:54:46,122 INFO L231 Difference]: Finished difference. Result has 437 places, 1387 transitions, 8389 flow [2025-03-09 00:54:46,122 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=34, PETRI_DIFFERENCE_MINUEND_FLOW=197, PETRI_DIFFERENCE_MINUEND_PLACES=74, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=48, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=27, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=20, PETRI_DIFFERENCE_SUBTRAHEND_STATES=262, PETRI_FLOW=8389, PETRI_PLACES=437, PETRI_TRANSITIONS=1387} [2025-03-09 00:54:46,123 INFO L279 CegarLoopForPetriNet]: 34 programPoint places, 403 predicate places. [2025-03-09 00:54:46,123 INFO L471 AbstractCegarLoop]: Abstraction has has 437 places, 1387 transitions, 8389 flow [2025-03-09 00:54:46,124 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 86 states, 86 states have (on average 8.186046511627907) internal successors, (704), 86 states have internal predecessors, (704), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 00:54:46,124 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 00:54:46,124 INFO L206 CegarLoopForPetriNet]: trace histogram [22, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 00:54:46,131 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2025-03-09 00:54:46,329 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 00:54:46,329 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-03-09 00:54:46,329 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 00:54:46,329 INFO L85 PathProgramCache]: Analyzing trace with hash 2125009886, now seen corresponding path program 1 times [2025-03-09 00:54:46,329 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 00:54:46,330 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1726895971] [2025-03-09 00:54:46,330 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 00:54:46,330 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 00:54:46,337 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 42 statements into 1 equivalence classes. [2025-03-09 00:54:46,358 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 42 of 42 statements. [2025-03-09 00:54:46,361 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 00:54:46,361 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 00:54:47,612 INFO L134 CoverageAnalysis]: Checked inductivity of 278 backedges. 0 proven. 278 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 00:54:47,613 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 00:54:47,613 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1726895971] [2025-03-09 00:54:47,613 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1726895971] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 00:54:47,613 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1968922306] [2025-03-09 00:54:47,613 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 00:54:47,613 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 00:54:47,613 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 00:54:47,615 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-09 00:54:47,616 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-03-09 00:54:47,650 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 42 statements into 1 equivalence classes. [2025-03-09 00:54:47,675 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 42 of 42 statements. [2025-03-09 00:54:47,675 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 00:54:47,675 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 00:54:47,677 INFO L256 TraceCheckSpWp]: Trace formula consists of 307 conjuncts, 79 conjuncts are in the unsatisfiable core [2025-03-09 00:54:47,679 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 00:54:48,795 INFO L134 CoverageAnalysis]: Checked inductivity of 278 backedges. 210 proven. 68 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 00:54:48,795 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 00:54:50,203 INFO L134 CoverageAnalysis]: Checked inductivity of 278 backedges. 0 proven. 278 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 00:54:50,203 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1968922306] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-09 00:54:50,203 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-09 00:54:50,203 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [31, 31, 31] total 90 [2025-03-09 00:54:50,204 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [625086491] [2025-03-09 00:54:50,204 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-09 00:54:50,204 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 91 states [2025-03-09 00:54:50,204 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 00:54:50,205 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 91 interpolants. [2025-03-09 00:54:50,206 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1088, Invalid=7102, Unknown=0, NotChecked=0, Total=8190 [2025-03-09 00:54:50,207 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 34 [2025-03-09 00:54:50,208 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 437 places, 1387 transitions, 8389 flow. Second operand has 91 states, 91 states have (on average 8.241758241758241) internal successors, (750), 91 states have internal predecessors, (750), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 00:54:50,208 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 00:54:50,208 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 34 [2025-03-09 00:54:50,208 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand