./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/pthread/fib_safe-5.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_safe-5.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 74a086edb560572752b8cbc391425d974c2cbbd7d3553767e0707a5dc02a4897 --- Real Ultimate output --- This is Ultimate 0.3.0-?-e2fb8be-m [2025-03-09 00:53:39,135 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-09 00:53:39,186 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2025-03-09 00:53:39,190 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-09 00:53:39,191 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-09 00:53:39,209 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-09 00:53:39,210 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-09 00:53:39,210 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-09 00:53:39,210 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-09 00:53:39,210 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-09 00:53:39,210 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-09 00:53:39,211 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-09 00:53:39,211 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-09 00:53:39,211 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-09 00:53:39,211 INFO L153 SettingsManager]: * Use SBE=true [2025-03-09 00:53:39,212 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-09 00:53:39,212 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-09 00:53:39,212 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-09 00:53:39,212 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-09 00:53:39,212 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-09 00:53:39,212 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2025-03-09 00:53:39,212 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2025-03-09 00:53:39,213 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2025-03-09 00:53:39,213 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-09 00:53:39,213 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-03-09 00:53:39,213 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-03-09 00:53:39,213 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-09 00:53:39,213 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-09 00:53:39,213 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-09 00:53:39,213 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-09 00:53:39,213 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-09 00:53:39,213 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-09 00:53:39,213 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-09 00:53:39,213 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-09 00:53:39,213 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-09 00:53:39,213 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-09 00:53:39,213 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-09 00:53:39,213 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-09 00:53:39,213 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-09 00:53:39,214 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-09 00:53:39,214 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-09 00:53:39,214 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-09 00:53:39,214 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 -> 74a086edb560572752b8cbc391425d974c2cbbd7d3553767e0707a5dc02a4897 [2025-03-09 00:53:39,426 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-09 00:53:39,435 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-09 00:53:39,437 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-09 00:53:39,438 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-09 00:53:39,438 INFO L274 PluginConnector]: CDTParser initialized [2025-03-09 00:53:39,439 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/pthread/fib_safe-5.i [2025-03-09 00:53:40,590 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c7a094fe6/ed33230cf72e4598883bfb8c7053687b/FLAG555f98899 [2025-03-09 00:53:40,838 INFO L384 CDTParser]: Found 1 translation units. [2025-03-09 00:53:40,839 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread/fib_safe-5.i [2025-03-09 00:53:40,855 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c7a094fe6/ed33230cf72e4598883bfb8c7053687b/FLAG555f98899 [2025-03-09 00:53:41,160 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c7a094fe6/ed33230cf72e4598883bfb8c7053687b [2025-03-09 00:53:41,162 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-09 00:53:41,163 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-09 00:53:41,164 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-09 00:53:41,164 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-09 00:53:41,167 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-09 00:53:41,167 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.03 12:53:41" (1/1) ... [2025-03-09 00:53:41,168 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@33215fd8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 12:53:41, skipping insertion in model container [2025-03-09 00:53:41,168 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.03 12:53:41" (1/1) ... [2025-03-09 00:53:41,187 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-09 00:53:41,362 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-09 00:53:41,374 INFO L200 MainTranslator]: Completed pre-run [2025-03-09 00:53:41,422 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-09 00:53:41,451 INFO L204 MainTranslator]: Completed translation [2025-03-09 00:53:41,451 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 12:53:41 WrapperNode [2025-03-09 00:53:41,451 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-09 00:53:41,452 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-09 00:53:41,452 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-09 00:53:41,452 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-09 00:53:41,458 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:53:41" (1/1) ... [2025-03-09 00:53:41,469 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:53:41" (1/1) ... [2025-03-09 00:53:41,486 INFO L138 Inliner]: procedures = 164, calls = 21, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 65 [2025-03-09 00:53:41,487 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-09 00:53:41,487 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-09 00:53:41,487 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-09 00:53:41,487 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-09 00:53:41,493 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 12:53:41" (1/1) ... [2025-03-09 00:53:41,493 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 12:53:41" (1/1) ... [2025-03-09 00:53:41,494 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 12:53:41" (1/1) ... [2025-03-09 00:53:41,501 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:53:41,501 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 12:53:41" (1/1) ... [2025-03-09 00:53:41,501 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 12:53:41" (1/1) ... [2025-03-09 00:53:41,505 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 12:53:41" (1/1) ... [2025-03-09 00:53:41,505 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 12:53:41" (1/1) ... [2025-03-09 00:53:41,506 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 12:53:41" (1/1) ... [2025-03-09 00:53:41,506 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 12:53:41" (1/1) ... [2025-03-09 00:53:41,508 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-09 00:53:41,509 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-09 00:53:41,509 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-09 00:53:41,509 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-09 00:53:41,510 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 12:53:41" (1/1) ... [2025-03-09 00:53:41,514 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-09 00:53:41,524 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 00:53:41,536 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:53:41,543 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:53:41,562 INFO L130 BoogieDeclarations]: Found specification of procedure t1 [2025-03-09 00:53:41,562 INFO L138 BoogieDeclarations]: Found implementation of procedure t1 [2025-03-09 00:53:41,562 INFO L130 BoogieDeclarations]: Found specification of procedure t2 [2025-03-09 00:53:41,562 INFO L138 BoogieDeclarations]: Found implementation of procedure t2 [2025-03-09 00:53:41,563 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2025-03-09 00:53:41,563 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-09 00:53:41,563 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-09 00:53:41,563 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2025-03-09 00:53:41,563 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-09 00:53:41,563 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-09 00:53:41,563 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:53:41,667 INFO L256 CfgBuilder]: Building ICFG [2025-03-09 00:53:41,669 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-09 00:53:41,824 INFO L303 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-03-09 00:53:41,824 INFO L307 CfgBuilder]: Performing block encoding [2025-03-09 00:53:41,908 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-09 00:53:41,908 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-09 00:53:41,908 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 09.03 12:53:41 BoogieIcfgContainer [2025-03-09 00:53:41,909 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-09 00:53:41,910 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-09 00:53:41,910 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-09 00:53:41,914 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-09 00:53:41,917 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.03 12:53:41" (1/3) ... [2025-03-09 00:53:41,918 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3f177b9b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.03 12:53:41, skipping insertion in model container [2025-03-09 00:53:41,918 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 12:53:41" (2/3) ... [2025-03-09 00:53:41,918 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3f177b9b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.03 12:53:41, skipping insertion in model container [2025-03-09 00:53:41,918 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 09.03 12:53:41" (3/3) ... [2025-03-09 00:53:41,919 INFO L128 eAbstractionObserver]: Analyzing ICFG fib_safe-5.i [2025-03-09 00:53:41,931 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-09 00:53:41,933 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG fib_safe-5.i that has 3 procedures, 30 locations, 1 initial locations, 3 loop locations, and 2 error locations. [2025-03-09 00:53:41,933 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-03-09 00:53:41,976 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-03-09 00:53:42,012 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 36 places, 34 transitions, 76 flow [2025-03-09 00:53:42,047 INFO L124 PetriNetUnfolderBase]: 5/32 cut-off events. [2025-03-09 00:53:42,050 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-09 00:53:42,053 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:53:42,057 INFO L82 GeneralOperation]: Start removeDead. Operand has 36 places, 34 transitions, 76 flow [2025-03-09 00:53:42,059 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 34 places, 32 transitions, 70 flow [2025-03-09 00:53:42,067 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-09 00:53:42,080 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;@2c9a9787, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-09 00:53:42,080 INFO L334 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2025-03-09 00:53:42,092 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-09 00:53:42,093 INFO L124 PetriNetUnfolderBase]: 5/29 cut-off events. [2025-03-09 00:53:42,093 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-09 00:53:42,093 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 00:53:42,094 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 00:53:42,095 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:53:42,099 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 00:53:42,100 INFO L85 PathProgramCache]: Analyzing trace with hash 1473564154, now seen corresponding path program 1 times [2025-03-09 00:53:42,105 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 00:53:42,106 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [88746453] [2025-03-09 00:53:42,106 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 00:53:42,106 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 00:53:42,171 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-03-09 00:53:42,192 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-03-09 00:53:42,192 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 00:53:42,192 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 00:53:42,304 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:53:42,304 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 00:53:42,304 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [88746453] [2025-03-09 00:53:42,307 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [88746453] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 00:53:42,307 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 00:53:42,307 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-09 00:53:42,308 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [111583881] [2025-03-09 00:53:42,308 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 00:53:42,312 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-09 00:53:42,317 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 00:53:42,335 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-09 00:53:42,336 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-09 00:53:42,337 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 34 [2025-03-09 00:53:42,339 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:53:42,339 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 00:53:42,339 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 34 [2025-03-09 00:53:42,340 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 00:53:42,507 INFO L124 PetriNetUnfolderBase]: 297/523 cut-off events. [2025-03-09 00:53:42,507 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2025-03-09 00:53:42,508 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:53:42,511 INFO L140 encePairwiseOnDemand]: 29/34 looper letters, 29 selfloop transitions, 2 changer transitions 1/38 dead transitions. [2025-03-09 00:53:42,511 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 35 places, 38 transitions, 146 flow [2025-03-09 00:53:42,512 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-09 00:53:42,514 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-09 00:53:42,518 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 59 transitions. [2025-03-09 00:53:42,519 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5784313725490197 [2025-03-09 00:53:42,520 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:53:42,521 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 35 places, 38 transitions, 146 flow [2025-03-09 00:53:42,524 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:53:42,526 INFO L231 Difference]: Finished difference. Result has 34 places, 29 transitions, 72 flow [2025-03-09 00:53:42,528 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:53:42,531 INFO L279 CegarLoopForPetriNet]: 34 programPoint places, 0 predicate places. [2025-03-09 00:53:42,532 INFO L471 AbstractCegarLoop]: Abstraction has has 34 places, 29 transitions, 72 flow [2025-03-09 00:53:42,532 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:53:42,532 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 00:53:42,532 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 00:53:42,532 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-09 00:53:42,532 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:53:42,533 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 00:53:42,533 INFO L85 PathProgramCache]: Analyzing trace with hash -1404976497, now seen corresponding path program 1 times [2025-03-09 00:53:42,533 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 00:53:42,533 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1893050377] [2025-03-09 00:53:42,533 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 00:53:42,533 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 00:53:42,546 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-03-09 00:53:42,558 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-03-09 00:53:42,562 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 00:53:42,562 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 00:53:42,641 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:53:42,641 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 00:53:42,641 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1893050377] [2025-03-09 00:53:42,641 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1893050377] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 00:53:42,641 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [536036755] [2025-03-09 00:53:42,641 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 00:53:42,641 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 00:53:42,641 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 00:53:42,644 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:53:42,645 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:53:42,694 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-03-09 00:53:42,709 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-03-09 00:53:42,709 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 00:53:42,709 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 00:53:42,711 INFO L256 TraceCheckSpWp]: Trace formula consists of 104 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-09 00:53:42,713 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 00:53:42,734 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:53:42,734 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-09 00:53:42,734 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [536036755] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 00:53:42,735 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-09 00:53:42,735 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [4] total 5 [2025-03-09 00:53:42,735 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1963956901] [2025-03-09 00:53:42,735 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 00:53:42,735 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-09 00:53:42,736 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 00:53:42,736 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-09 00:53:42,736 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-09 00:53:42,736 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 34 [2025-03-09 00:53:42,736 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:53:42,737 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 00:53:42,737 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 34 [2025-03-09 00:53:42,737 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 00:53:42,809 INFO L124 PetriNetUnfolderBase]: 265/459 cut-off events. [2025-03-09 00:53:42,809 INFO L125 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2025-03-09 00:53:42,811 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:53:42,813 INFO L140 encePairwiseOnDemand]: 32/34 looper letters, 21 selfloop transitions, 1 changer transitions 1/28 dead transitions. [2025-03-09 00:53:42,814 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 34 places, 28 transitions, 116 flow [2025-03-09 00:53:42,815 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-09 00:53:42,815 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-09 00:53:42,815 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 44 transitions. [2025-03-09 00:53:42,815 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.43137254901960786 [2025-03-09 00:53:42,816 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:53:42,816 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 34 places, 28 transitions, 116 flow [2025-03-09 00:53:42,817 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:53:42,817 INFO L231 Difference]: Finished difference. Result has 33 places, 27 transitions, 68 flow [2025-03-09 00:53:42,818 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:53:42,819 INFO L279 CegarLoopForPetriNet]: 34 programPoint places, -1 predicate places. [2025-03-09 00:53:42,819 INFO L471 AbstractCegarLoop]: Abstraction has has 33 places, 27 transitions, 68 flow [2025-03-09 00:53:42,820 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:53:42,820 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 00:53:42,820 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 00:53:42,827 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-03-09 00:53:43,020 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:53:43,021 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:53:43,021 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 00:53:43,021 INFO L85 PathProgramCache]: Analyzing trace with hash -1404975617, now seen corresponding path program 1 times [2025-03-09 00:53:43,021 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 00:53:43,021 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [255068720] [2025-03-09 00:53:43,021 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 00:53:43,022 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 00:53:43,027 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-03-09 00:53:43,031 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-03-09 00:53:43,031 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 00:53:43,032 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 00:53:43,064 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:53:43,064 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 00:53:43,064 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [255068720] [2025-03-09 00:53:43,064 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [255068720] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 00:53:43,064 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [117117298] [2025-03-09 00:53:43,064 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 00:53:43,064 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 00:53:43,064 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 00:53:43,066 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:53:43,068 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:53:43,116 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-03-09 00:53:43,128 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-03-09 00:53:43,128 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 00:53:43,128 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 00:53:43,130 INFO L256 TraceCheckSpWp]: Trace formula consists of 104 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-09 00:53:43,130 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 00:53:43,154 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:53:43,154 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 00:53:43,174 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:53:43,174 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [117117298] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-09 00:53:43,175 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-09 00:53:43,175 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 7 [2025-03-09 00:53:43,175 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1465725418] [2025-03-09 00:53:43,175 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-09 00:53:43,175 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-09 00:53:43,175 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 00:53:43,176 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-09 00:53:43,176 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2025-03-09 00:53:43,176 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 34 [2025-03-09 00:53:43,176 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:53:43,176 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 00:53:43,176 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 34 [2025-03-09 00:53:43,176 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 00:53:43,317 INFO L124 PetriNetUnfolderBase]: 329/555 cut-off events. [2025-03-09 00:53:43,317 INFO L125 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2025-03-09 00:53:43,319 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:53:43,322 INFO L140 encePairwiseOnDemand]: 31/34 looper letters, 52 selfloop transitions, 5 changer transitions 0/62 dead transitions. [2025-03-09 00:53:43,322 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 37 places, 62 transitions, 258 flow [2025-03-09 00:53:43,323 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-09 00:53:43,323 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-09 00:53:43,324 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 108 transitions. [2025-03-09 00:53:43,324 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5294117647058824 [2025-03-09 00:53:43,324 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:53:43,324 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 37 places, 62 transitions, 258 flow [2025-03-09 00:53:43,325 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:53:43,326 INFO L231 Difference]: Finished difference. Result has 39 places, 30 transitions, 103 flow [2025-03-09 00:53:43,326 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:53:43,326 INFO L279 CegarLoopForPetriNet]: 34 programPoint places, 5 predicate places. [2025-03-09 00:53:43,326 INFO L471 AbstractCegarLoop]: Abstraction has has 39 places, 30 transitions, 103 flow [2025-03-09 00:53:43,326 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:53:43,326 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 00:53:43,326 INFO L206 CegarLoopForPetriNet]: trace histogram [4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 00:53:43,335 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:53:43,527 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:53:43,527 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:53:43,528 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 00:53:43,528 INFO L85 PathProgramCache]: Analyzing trace with hash -2051551574, now seen corresponding path program 2 times [2025-03-09 00:53:43,528 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 00:53:43,528 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [959430423] [2025-03-09 00:53:43,528 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-09 00:53:43,528 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 00:53:43,536 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 18 statements into 2 equivalence classes. [2025-03-09 00:53:43,552 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 18 of 18 statements. [2025-03-09 00:53:43,556 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-09 00:53:43,556 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 00:53:43,645 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:53:43,645 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 00:53:43,645 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [959430423] [2025-03-09 00:53:43,645 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [959430423] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 00:53:43,645 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1545796983] [2025-03-09 00:53:43,645 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-09 00:53:43,645 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 00:53:43,645 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 00:53:43,648 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:53:43,649 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:53:43,689 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 18 statements into 2 equivalence classes. [2025-03-09 00:53:43,705 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 18 of 18 statements. [2025-03-09 00:53:43,705 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-09 00:53:43,705 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 00:53:43,706 INFO L256 TraceCheckSpWp]: Trace formula consists of 131 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-09 00:53:43,707 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 00:53:43,729 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:53:43,732 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 00:53:43,789 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:53:43,791 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1545796983] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-09 00:53:43,792 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-09 00:53:43,792 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 13 [2025-03-09 00:53:43,792 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [322998560] [2025-03-09 00:53:43,792 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-09 00:53:43,792 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-03-09 00:53:43,792 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 00:53:43,793 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-03-09 00:53:43,793 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2025-03-09 00:53:43,793 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 34 [2025-03-09 00:53:43,793 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:53:43,793 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 00:53:43,793 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 34 [2025-03-09 00:53:43,793 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 00:53:43,977 INFO L124 PetriNetUnfolderBase]: 521/843 cut-off events. [2025-03-09 00:53:43,978 INFO L125 PetriNetUnfolderBase]: For 364/364 co-relation queries the response was YES. [2025-03-09 00:53:43,979 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:53:43,981 INFO L140 encePairwiseOnDemand]: 31/34 looper letters, 100 selfloop transitions, 11 changer transitions 0/116 dead transitions. [2025-03-09 00:53:43,981 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 50 places, 116 transitions, 521 flow [2025-03-09 00:53:43,982 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-09 00:53:43,982 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2025-03-09 00:53:43,982 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 213 transitions. [2025-03-09 00:53:43,984 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5220588235294118 [2025-03-09 00:53:43,985 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:53:43,985 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 50 places, 116 transitions, 521 flow [2025-03-09 00:53:43,987 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:53:43,990 INFO L231 Difference]: Finished difference. Result has 55 places, 36 transitions, 173 flow [2025-03-09 00:53:43,990 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:53:43,991 INFO L279 CegarLoopForPetriNet]: 34 programPoint places, 21 predicate places. [2025-03-09 00:53:43,991 INFO L471 AbstractCegarLoop]: Abstraction has has 55 places, 36 transitions, 173 flow [2025-03-09 00:53:43,991 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:53:43,992 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 00:53:43,992 INFO L206 CegarLoopForPetriNet]: trace histogram [10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 00:53:43,998 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:53:44,194 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:53:44,194 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:53:44,194 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 00:53:44,195 INFO L85 PathProgramCache]: Analyzing trace with hash -1525932406, now seen corresponding path program 3 times [2025-03-09 00:53:44,195 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 00:53:44,195 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [805978745] [2025-03-09 00:53:44,195 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-09 00:53:44,195 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 00:53:44,201 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 24 statements into 6 equivalence classes. [2025-03-09 00:53:44,227 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) and asserted 24 of 24 statements. [2025-03-09 00:53:44,228 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2025-03-09 00:53:44,228 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 00:53:44,409 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:53:44,410 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 00:53:44,410 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [805978745] [2025-03-09 00:53:44,410 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [805978745] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 00:53:44,410 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [197237855] [2025-03-09 00:53:44,410 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-09 00:53:44,410 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 00:53:44,410 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 00:53:44,412 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:53:44,414 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:53:44,453 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 24 statements into 6 equivalence classes. [2025-03-09 00:53:44,483 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) and asserted 24 of 24 statements. [2025-03-09 00:53:44,483 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2025-03-09 00:53:44,483 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 00:53:44,484 INFO L256 TraceCheckSpWp]: Trace formula consists of 185 conjuncts, 12 conjuncts are in the unsatisfiable core [2025-03-09 00:53:44,485 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 00:53:44,521 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:53:44,521 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 00:53:44,625 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:53:44,625 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [197237855] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-09 00:53:44,626 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-09 00:53:44,626 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 13] total 15 [2025-03-09 00:53:44,626 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [915894575] [2025-03-09 00:53:44,626 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-09 00:53:44,626 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-03-09 00:53:44,626 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 00:53:44,627 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-03-09 00:53:44,627 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=105, Invalid=105, Unknown=0, NotChecked=0, Total=210 [2025-03-09 00:53:44,627 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 34 [2025-03-09 00:53:44,627 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 55 places, 36 transitions, 173 flow. Second operand has 15 states, 15 states have (on average 9.8) internal successors, (147), 15 states have internal predecessors, (147), 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:53:44,627 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 00:53:44,627 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 34 [2025-03-09 00:53:44,628 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 00:53:44,855 INFO L124 PetriNetUnfolderBase]: 585/939 cut-off events. [2025-03-09 00:53:44,855 INFO L125 PetriNetUnfolderBase]: For 1708/1708 co-relation queries the response was YES. [2025-03-09 00:53:44,859 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2683 conditions, 939 events. 585/939 cut-off events. For 1708/1708 co-relation queries the response was YES. Maximal size of possible extension queue 26. Compared 3468 event pairs, 39 based on Foata normal form. 32/966 useless extension candidates. Maximal degree in co-relation 2664. Up to 257 conditions per place. [2025-03-09 00:53:44,863 INFO L140 encePairwiseOnDemand]: 31/34 looper letters, 116 selfloop transitions, 13 changer transitions 0/134 dead transitions. [2025-03-09 00:53:44,864 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 68 places, 134 transitions, 639 flow [2025-03-09 00:53:44,864 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-03-09 00:53:44,864 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2025-03-09 00:53:44,865 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 243 transitions. [2025-03-09 00:53:44,866 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5105042016806722 [2025-03-09 00:53:44,866 INFO L175 Difference]: Start difference. First operand has 55 places, 36 transitions, 173 flow. Second operand 14 states and 243 transitions. [2025-03-09 00:53:44,866 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 68 places, 134 transitions, 639 flow [2025-03-09 00:53:44,873 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 63 places, 134 transitions, 587 flow, removed 21 selfloop flow, removed 5 redundant places. [2025-03-09 00:53:44,876 INFO L231 Difference]: Finished difference. Result has 65 places, 38 transitions, 173 flow [2025-03-09 00:53:44,876 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=14, PETRI_FLOW=173, PETRI_PLACES=65, PETRI_TRANSITIONS=38} [2025-03-09 00:53:44,877 INFO L279 CegarLoopForPetriNet]: 34 programPoint places, 31 predicate places. [2025-03-09 00:53:44,877 INFO L471 AbstractCegarLoop]: Abstraction has has 65 places, 38 transitions, 173 flow [2025-03-09 00:53:44,878 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 9.8) internal successors, (147), 15 states have internal predecessors, (147), 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:53:44,878 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 00:53:44,878 INFO L206 CegarLoopForPetriNet]: trace histogram [12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 00:53:44,885 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2025-03-09 00:53:45,083 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:53:45,083 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:53:45,084 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 00:53:45,084 INFO L85 PathProgramCache]: Analyzing trace with hash -1039406806, now seen corresponding path program 4 times [2025-03-09 00:53:45,084 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 00:53:45,084 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [320680219] [2025-03-09 00:53:45,084 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-09 00:53:45,084 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 00:53:45,103 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 26 statements into 2 equivalence classes. [2025-03-09 00:53:45,130 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 26 of 26 statements. [2025-03-09 00:53:45,132 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-03-09 00:53:45,132 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 00:53:45,904 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 0 proven. 78 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 00:53:45,905 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 00:53:45,905 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [320680219] [2025-03-09 00:53:45,905 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [320680219] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 00:53:45,905 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [868672875] [2025-03-09 00:53:45,905 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-09 00:53:45,905 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 00:53:45,905 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 00:53:45,907 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:53:45,909 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:53:45,943 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 26 statements into 2 equivalence classes. [2025-03-09 00:53:45,964 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 26 of 26 statements. [2025-03-09 00:53:45,964 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-03-09 00:53:45,964 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 00:53:45,966 INFO L256 TraceCheckSpWp]: Trace formula consists of 203 conjuncts, 47 conjuncts are in the unsatisfiable core [2025-03-09 00:53:45,968 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 00:53:46,583 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 55 proven. 23 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 00:53:46,583 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 00:53:47,353 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 0 proven. 78 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 00:53:47,353 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [868672875] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-09 00:53:47,353 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-09 00:53:47,353 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 19, 19] total 55 [2025-03-09 00:53:47,353 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [93746725] [2025-03-09 00:53:47,353 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-09 00:53:47,354 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 56 states [2025-03-09 00:53:47,354 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 00:53:47,355 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 56 interpolants. [2025-03-09 00:53:47,356 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=403, Invalid=2677, Unknown=0, NotChecked=0, Total=3080 [2025-03-09 00:53:47,359 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 34 [2025-03-09 00:53:47,360 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 65 places, 38 transitions, 173 flow. Second operand has 56 states, 56 states have (on average 8.285714285714286) internal successors, (464), 56 states have internal predecessors, (464), 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:53:47,360 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 00:53:47,360 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 34 [2025-03-09 00:53:47,360 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 00:53:58,233 INFO L124 PetriNetUnfolderBase]: 12499/20440 cut-off events. [2025-03-09 00:53:58,234 INFO L125 PetriNetUnfolderBase]: For 30423/30423 co-relation queries the response was YES. [2025-03-09 00:53:58,284 INFO L83 FinitePrefix]: Finished finitePrefix Result has 52638 conditions, 20440 events. 12499/20440 cut-off events. For 30423/30423 co-relation queries the response was YES. Maximal size of possible extension queue 362. Compared 129826 event pairs, 70 based on Foata normal form. 0/20154 useless extension candidates. Maximal degree in co-relation 52617. Up to 2607 conditions per place. [2025-03-09 00:53:58,353 INFO L140 encePairwiseOnDemand]: 23/34 looper letters, 505 selfloop transitions, 455 changer transitions 613/1577 dead transitions. [2025-03-09 00:53:58,353 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 219 places, 1577 transitions, 8872 flow [2025-03-09 00:53:58,354 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 155 states. [2025-03-09 00:53:58,354 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 155 states. [2025-03-09 00:53:58,361 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 155 states to 155 states and 2373 transitions. [2025-03-09 00:53:58,365 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.45028462998102464 [2025-03-09 00:53:58,367 INFO L175 Difference]: Start difference. First operand has 65 places, 38 transitions, 173 flow. Second operand 155 states and 2373 transitions. [2025-03-09 00:53:58,368 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 219 places, 1577 transitions, 8872 flow [2025-03-09 00:53:58,445 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 208 places, 1577 transitions, 7874 flow, removed 210 selfloop flow, removed 11 redundant places. [2025-03-09 00:53:58,458 INFO L231 Difference]: Finished difference. Result has 270 places, 539 transitions, 3243 flow [2025-03-09 00:53:58,460 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=34, PETRI_DIFFERENCE_MINUEND_FLOW=137, PETRI_DIFFERENCE_MINUEND_PLACES=54, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=38, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=18, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=19, PETRI_DIFFERENCE_SUBTRAHEND_STATES=155, PETRI_FLOW=3243, PETRI_PLACES=270, PETRI_TRANSITIONS=539} [2025-03-09 00:53:58,461 INFO L279 CegarLoopForPetriNet]: 34 programPoint places, 236 predicate places. [2025-03-09 00:53:58,462 INFO L471 AbstractCegarLoop]: Abstraction has has 270 places, 539 transitions, 3243 flow [2025-03-09 00:53:58,462 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 56 states, 56 states have (on average 8.285714285714286) internal successors, (464), 56 states have internal predecessors, (464), 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:53:58,462 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 00:53:58,462 INFO L206 CegarLoopForPetriNet]: trace histogram [12, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 00:53:58,469 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2025-03-09 00:53:58,663 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:53:58,663 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:53:58,663 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 00:53:58,664 INFO L85 PathProgramCache]: Analyzing trace with hash 440398014, now seen corresponding path program 1 times [2025-03-09 00:53:58,664 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 00:53:58,664 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [466606519] [2025-03-09 00:53:58,664 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 00:53:58,664 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 00:53:58,669 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 32 statements into 1 equivalence classes. [2025-03-09 00:53:58,681 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 32 of 32 statements. [2025-03-09 00:53:58,681 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 00:53:58,681 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 00:53:59,462 INFO L134 CoverageAnalysis]: Checked inductivity of 93 backedges. 0 proven. 93 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 00:53:59,462 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 00:53:59,462 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [466606519] [2025-03-09 00:53:59,462 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [466606519] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 00:53:59,462 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1859781973] [2025-03-09 00:53:59,463 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 00:53:59,463 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 00:53:59,463 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 00:53:59,465 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:53:59,467 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:53:59,510 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 32 statements into 1 equivalence classes. [2025-03-09 00:53:59,530 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 32 of 32 statements. [2025-03-09 00:53:59,530 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 00:53:59,530 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 00:53:59,531 INFO L256 TraceCheckSpWp]: Trace formula consists of 217 conjuncts, 49 conjuncts are in the unsatisfiable core [2025-03-09 00:53:59,533 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 00:54:00,126 INFO L134 CoverageAnalysis]: Checked inductivity of 93 backedges. 55 proven. 38 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 00:54:00,126 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 00:54:00,813 INFO L134 CoverageAnalysis]: Checked inductivity of 93 backedges. 0 proven. 93 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 00:54:00,814 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1859781973] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-09 00:54:00,814 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-09 00:54:00,814 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 21, 21] total 60 [2025-03-09 00:54:00,814 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2066655629] [2025-03-09 00:54:00,814 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-09 00:54:00,814 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 61 states [2025-03-09 00:54:00,814 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 00:54:00,815 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 61 interpolants. [2025-03-09 00:54:00,816 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=452, Invalid=3208, Unknown=0, NotChecked=0, Total=3660 [2025-03-09 00:54:00,817 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 34 [2025-03-09 00:54:00,818 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 270 places, 539 transitions, 3243 flow. Second operand has 61 states, 61 states have (on average 8.360655737704919) internal successors, (510), 61 states have internal predecessors, (510), 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:00,818 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 00:54:00,818 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 34 [2025-03-09 00:54:00,818 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 00:54:59,864 INFO L124 PetriNetUnfolderBase]: 128809/216453 cut-off events. [2025-03-09 00:54:59,865 INFO L125 PetriNetUnfolderBase]: For 9881131/9881131 co-relation queries the response was YES. [2025-03-09 00:55:02,543 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1135904 conditions, 216453 events. 128809/216453 cut-off events. For 9881131/9881131 co-relation queries the response was YES. Maximal size of possible extension queue 3659. Compared 2014074 event pairs, 7590 based on Foata normal form. 5454/221903 useless extension candidates. Maximal degree in co-relation 1135821. Up to 24507 conditions per place. [2025-03-09 00:55:03,363 INFO L140 encePairwiseOnDemand]: 24/34 looper letters, 1572 selfloop transitions, 4863 changer transitions 3211/9650 dead transitions. [2025-03-09 00:55:03,363 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 543 places, 9650 transitions, 79904 flow [2025-03-09 00:55:03,364 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 358 states. [2025-03-09 00:55:03,364 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 358 states. [2025-03-09 00:55:03,371 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 358 states to 358 states and 5425 transitions. [2025-03-09 00:55:03,374 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.445695037791653 [2025-03-09 00:55:03,374 INFO L175 Difference]: Start difference. First operand has 270 places, 539 transitions, 3243 flow. Second operand 358 states and 5425 transitions. [2025-03-09 00:55:03,374 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 543 places, 9650 transitions, 79904 flow