./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/goblint-regression/06-symbeq_07-tricky_address2.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/goblint-regression/06-symbeq_07-tricky_address2.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 c18dd13658bb5739ed2db8c4c80ae330682b7c3cebd2ad85657518c27ca325b9 --- Real Ultimate output --- This is Ultimate 0.3.0-?-e2fb8be-m [2025-03-09 01:13:23,466 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-09 01:13:23,517 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2025-03-09 01:13:23,521 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-09 01:13:23,521 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-09 01:13:23,540 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-09 01:13:23,541 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-09 01:13:23,541 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-09 01:13:23,542 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-09 01:13:23,542 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-09 01:13:23,543 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-09 01:13:23,543 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-09 01:13:23,543 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-09 01:13:23,543 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-09 01:13:23,543 INFO L153 SettingsManager]: * Use SBE=true [2025-03-09 01:13:23,544 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-09 01:13:23,544 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-09 01:13:23,544 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-09 01:13:23,544 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-09 01:13:23,544 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-09 01:13:23,544 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2025-03-09 01:13:23,544 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2025-03-09 01:13:23,544 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2025-03-09 01:13:23,544 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-09 01:13:23,545 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-03-09 01:13:23,545 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-03-09 01:13:23,545 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-09 01:13:23,545 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-09 01:13:23,545 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-09 01:13:23,545 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-09 01:13:23,545 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-09 01:13:23,545 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-09 01:13:23,546 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-09 01:13:23,546 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-09 01:13:23,546 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-09 01:13:23,546 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-09 01:13:23,546 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-09 01:13:23,546 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-09 01:13:23,546 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-09 01:13:23,546 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-09 01:13:23,546 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-09 01:13:23,546 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-09 01:13:23,546 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 -> c18dd13658bb5739ed2db8c4c80ae330682b7c3cebd2ad85657518c27ca325b9 [2025-03-09 01:13:23,774 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-09 01:13:23,782 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-09 01:13:23,783 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-09 01:13:23,784 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-09 01:13:23,785 INFO L274 PluginConnector]: CDTParser initialized [2025-03-09 01:13:23,785 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/goblint-regression/06-symbeq_07-tricky_address2.i [2025-03-09 01:13:24,959 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/74408f556/54decfca8bbf45b89518d3957f87a489/FLAG90c258f27 [2025-03-09 01:13:25,243 INFO L384 CDTParser]: Found 1 translation units. [2025-03-09 01:13:25,244 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/goblint-regression/06-symbeq_07-tricky_address2.i [2025-03-09 01:13:25,256 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/74408f556/54decfca8bbf45b89518d3957f87a489/FLAG90c258f27 [2025-03-09 01:13:25,267 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/74408f556/54decfca8bbf45b89518d3957f87a489 [2025-03-09 01:13:25,269 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-09 01:13:25,270 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-09 01:13:25,271 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-09 01:13:25,271 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-09 01:13:25,274 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-09 01:13:25,275 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.03 01:13:25" (1/1) ... [2025-03-09 01:13:25,277 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@70826b7e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:13:25, skipping insertion in model container [2025-03-09 01:13:25,277 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.03 01:13:25" (1/1) ... [2025-03-09 01:13:25,306 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-09 01:13:25,526 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-09 01:13:25,550 INFO L200 MainTranslator]: Completed pre-run [2025-03-09 01:13:25,581 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-09 01:13:25,629 INFO L204 MainTranslator]: Completed translation [2025-03-09 01:13:25,630 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:13:25 WrapperNode [2025-03-09 01:13:25,630 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-09 01:13:25,631 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-09 01:13:25,631 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-09 01:13:25,631 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-09 01:13:25,636 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:13:25" (1/1) ... [2025-03-09 01:13:25,654 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:13:25" (1/1) ... [2025-03-09 01:13:25,678 INFO L138 Inliner]: procedures = 265, calls = 74, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 124 [2025-03-09 01:13:25,679 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-09 01:13:25,679 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-09 01:13:25,679 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-09 01:13:25,680 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-09 01:13:25,686 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:13:25" (1/1) ... [2025-03-09 01:13:25,687 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:13:25" (1/1) ... [2025-03-09 01:13:25,692 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:13:25" (1/1) ... [2025-03-09 01:13:25,707 INFO L175 MemorySlicer]: Split 64 memory accesses to 1 slices as follows [64]. 100 percent of accesses are in the largest equivalence class. The 60 initializations are split as follows [60]. The 2 writes are split as follows [2]. [2025-03-09 01:13:25,708 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:13:25" (1/1) ... [2025-03-09 01:13:25,708 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:13:25" (1/1) ... [2025-03-09 01:13:25,715 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:13:25" (1/1) ... [2025-03-09 01:13:25,723 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:13:25" (1/1) ... [2025-03-09 01:13:25,725 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:13:25" (1/1) ... [2025-03-09 01:13:25,727 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:13:25" (1/1) ... [2025-03-09 01:13:25,728 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-09 01:13:25,731 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-09 01:13:25,731 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-09 01:13:25,731 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-09 01:13:25,732 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:13:25" (1/1) ... [2025-03-09 01:13:25,735 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-09 01:13:25,743 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 01:13:25,759 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-09 01:13:25,762 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-09 01:13:25,778 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2025-03-09 01:13:25,778 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-03-09 01:13:25,778 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-03-09 01:13:25,778 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2025-03-09 01:13:25,778 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-09 01:13:25,778 INFO L130 BoogieDeclarations]: Found specification of procedure t_fun [2025-03-09 01:13:25,778 INFO L138 BoogieDeclarations]: Found implementation of procedure t_fun [2025-03-09 01:13:25,778 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-09 01:13:25,779 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-09 01:13:25,779 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-09 01:13:25,780 WARN L225 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-03-09 01:13:25,877 INFO L256 CfgBuilder]: Building ICFG [2025-03-09 01:13:25,878 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-09 01:13:26,139 INFO L303 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-03-09 01:13:26,139 INFO L307 CfgBuilder]: Performing block encoding [2025-03-09 01:13:26,478 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-09 01:13:26,479 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-09 01:13:26,479 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 09.03 01:13:26 BoogieIcfgContainer [2025-03-09 01:13:26,479 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-09 01:13:26,481 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-09 01:13:26,481 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-09 01:13:26,484 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-09 01:13:26,485 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.03 01:13:25" (1/3) ... [2025-03-09 01:13:26,486 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6d95e80c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.03 01:13:26, skipping insertion in model container [2025-03-09 01:13:26,486 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:13:25" (2/3) ... [2025-03-09 01:13:26,487 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6d95e80c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.03 01:13:26, skipping insertion in model container [2025-03-09 01:13:26,487 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 09.03 01:13:26" (3/3) ... [2025-03-09 01:13:26,488 INFO L128 eAbstractionObserver]: Analyzing ICFG 06-symbeq_07-tricky_address2.i [2025-03-09 01:13:26,498 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-09 01:13:26,500 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG 06-symbeq_07-tricky_address2.i that has 2 procedures, 29 locations, 1 initial locations, 1 loop locations, and 9 error locations. [2025-03-09 01:13:26,500 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-03-09 01:13:26,537 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-03-09 01:13:26,582 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 32 places, 29 transitions, 62 flow [2025-03-09 01:13:26,606 INFO L124 PetriNetUnfolderBase]: 1/28 cut-off events. [2025-03-09 01:13:26,609 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-09 01:13:26,611 INFO L83 FinitePrefix]: Finished finitePrefix Result has 32 conditions, 28 events. 1/28 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 52 event pairs, 0 based on Foata normal form. 0/18 useless extension candidates. Maximal degree in co-relation 3. Up to 2 conditions per place. [2025-03-09 01:13:26,612 INFO L82 GeneralOperation]: Start removeDead. Operand has 32 places, 29 transitions, 62 flow [2025-03-09 01:13:26,614 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 31 places, 28 transitions, 59 flow [2025-03-09 01:13:26,619 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-09 01:13:26,629 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;@49c038e9, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-09 01:13:26,631 INFO L334 AbstractCegarLoop]: Starting to check reachability of 14 error locations. [2025-03-09 01:13:26,638 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-09 01:13:26,640 INFO L124 PetriNetUnfolderBase]: 1/10 cut-off events. [2025-03-09 01:13:26,641 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-09 01:13:26,641 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 01:13:26,641 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2025-03-09 01:13:26,643 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting t_funErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 11 more)] === [2025-03-09 01:13:26,648 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:13:26,649 INFO L85 PathProgramCache]: Analyzing trace with hash -1572463899, now seen corresponding path program 1 times [2025-03-09 01:13:26,655 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:13:26,655 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1197958854] [2025-03-09 01:13:26,655 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:13:26,656 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:13:26,717 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-03-09 01:13:26,741 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-03-09 01:13:26,742 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:13:26,742 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:13:26,880 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 01:13:26,880 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:13:26,881 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1197958854] [2025-03-09 01:13:26,881 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1197958854] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 01:13:26,881 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 01:13:26,881 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-09 01:13:26,882 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1144513766] [2025-03-09 01:13:26,882 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 01:13:26,886 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-09 01:13:26,889 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:13:26,903 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-09 01:13:26,903 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-09 01:13:26,904 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 29 [2025-03-09 01:13:26,906 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 31 places, 28 transitions, 59 flow. Second operand has 3 states, 3 states have (on average 13.666666666666666) internal successors, (41), 3 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:13:26,906 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 01:13:26,906 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 29 [2025-03-09 01:13:26,906 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 01:13:26,988 INFO L124 PetriNetUnfolderBase]: 43/138 cut-off events. [2025-03-09 01:13:26,988 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-09 01:13:26,989 INFO L83 FinitePrefix]: Finished finitePrefix Result has 245 conditions, 138 events. 43/138 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 528 event pairs, 42 based on Foata normal form. 0/124 useless extension candidates. Maximal degree in co-relation 230. Up to 102 conditions per place. [2025-03-09 01:13:26,990 INFO L140 encePairwiseOnDemand]: 26/29 looper letters, 16 selfloop transitions, 2 changer transitions 0/29 dead transitions. [2025-03-09 01:13:26,990 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 33 places, 29 transitions, 97 flow [2025-03-09 01:13:26,991 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-09 01:13:26,993 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-09 01:13:26,997 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 55 transitions. [2025-03-09 01:13:26,999 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.632183908045977 [2025-03-09 01:13:27,000 INFO L175 Difference]: Start difference. First operand has 31 places, 28 transitions, 59 flow. Second operand 3 states and 55 transitions. [2025-03-09 01:13:27,001 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 33 places, 29 transitions, 97 flow [2025-03-09 01:13:27,004 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 29 transitions, 96 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-09 01:13:27,005 INFO L231 Difference]: Finished difference. Result has 33 places, 29 transitions, 70 flow [2025-03-09 01:13:27,008 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=29, PETRI_DIFFERENCE_MINUEND_FLOW=58, PETRI_DIFFERENCE_MINUEND_PLACES=30, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=28, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=26, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=70, PETRI_PLACES=33, PETRI_TRANSITIONS=29} [2025-03-09 01:13:27,012 INFO L279 CegarLoopForPetriNet]: 31 programPoint places, 2 predicate places. [2025-03-09 01:13:27,013 INFO L471 AbstractCegarLoop]: Abstraction has has 33 places, 29 transitions, 70 flow [2025-03-09 01:13:27,013 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 13.666666666666666) internal successors, (41), 3 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:13:27,013 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 01:13:27,013 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 01:13:27,013 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-09 01:13:27,017 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 11 more)] === [2025-03-09 01:13:27,018 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:13:27,018 INFO L85 PathProgramCache]: Analyzing trace with hash 857191578, now seen corresponding path program 1 times [2025-03-09 01:13:27,019 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:13:27,019 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [822571308] [2025-03-09 01:13:27,019 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:13:27,019 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:13:27,035 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-03-09 01:13:27,053 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-03-09 01:13:27,053 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:13:27,053 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:13:27,099 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 01:13:27,101 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:13:27,101 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [822571308] [2025-03-09 01:13:27,102 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [822571308] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 01:13:27,102 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1191327177] [2025-03-09 01:13:27,102 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:13:27,102 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 01:13:27,102 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 01:13:27,104 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-09 01:13:27,106 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-09 01:13:27,155 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-03-09 01:13:27,186 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-03-09 01:13:27,187 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:13:27,187 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:13:27,188 INFO L256 TraceCheckSpWp]: Trace formula consists of 172 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-09 01:13:27,191 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 01:13:27,219 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 01:13:27,219 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 01:13:27,250 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 01:13:27,250 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1191327177] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-09 01:13:27,250 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-09 01:13:27,250 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 6 [2025-03-09 01:13:27,251 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [686444320] [2025-03-09 01:13:27,251 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-09 01:13:27,251 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-09 01:13:27,251 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:13:27,252 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-09 01:13:27,252 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2025-03-09 01:13:27,253 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 29 [2025-03-09 01:13:27,253 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 33 places, 29 transitions, 70 flow. Second operand has 7 states, 7 states have (on average 13.571428571428571) internal successors, (95), 7 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:13:27,253 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 01:13:27,253 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 29 [2025-03-09 01:13:27,253 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 01:13:27,339 INFO L124 PetriNetUnfolderBase]: 43/141 cut-off events. [2025-03-09 01:13:27,340 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-09 01:13:27,340 INFO L83 FinitePrefix]: Finished finitePrefix Result has 260 conditions, 141 events. 43/141 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 528 event pairs, 42 based on Foata normal form. 0/127 useless extension candidates. Maximal degree in co-relation 249. Up to 102 conditions per place. [2025-03-09 01:13:27,341 INFO L140 encePairwiseOnDemand]: 26/29 looper letters, 16 selfloop transitions, 5 changer transitions 0/32 dead transitions. [2025-03-09 01:13:27,341 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 38 places, 32 transitions, 124 flow [2025-03-09 01:13:27,342 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-09 01:13:27,342 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-09 01:13:27,344 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 96 transitions. [2025-03-09 01:13:27,344 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5517241379310345 [2025-03-09 01:13:27,345 INFO L175 Difference]: Start difference. First operand has 33 places, 29 transitions, 70 flow. Second operand 6 states and 96 transitions. [2025-03-09 01:13:27,345 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 38 places, 32 transitions, 124 flow [2025-03-09 01:13:27,345 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 37 places, 32 transitions, 120 flow, removed 1 selfloop flow, removed 1 redundant places. [2025-03-09 01:13:27,346 INFO L231 Difference]: Finished difference. Result has 40 places, 32 transitions, 102 flow [2025-03-09 01:13:27,346 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=29, PETRI_DIFFERENCE_MINUEND_FLOW=66, PETRI_DIFFERENCE_MINUEND_PLACES=32, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=29, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=26, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=102, PETRI_PLACES=40, PETRI_TRANSITIONS=32} [2025-03-09 01:13:27,347 INFO L279 CegarLoopForPetriNet]: 31 programPoint places, 9 predicate places. [2025-03-09 01:13:27,347 INFO L471 AbstractCegarLoop]: Abstraction has has 40 places, 32 transitions, 102 flow [2025-03-09 01:13:27,347 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 13.571428571428571) internal successors, (95), 7 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:13:27,347 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 01:13:27,347 INFO L206 CegarLoopForPetriNet]: trace histogram [4, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 01:13:27,353 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-03-09 01:13:27,547 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 01:13:27,548 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 11 more)] === [2025-03-09 01:13:27,548 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:13:27,549 INFO L85 PathProgramCache]: Analyzing trace with hash 1168184129, now seen corresponding path program 2 times [2025-03-09 01:13:27,549 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:13:27,549 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [301490708] [2025-03-09 01:13:27,549 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-09 01:13:27,549 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:13:27,560 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 11 statements into 2 equivalence classes. [2025-03-09 01:13:27,571 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 7 of 11 statements. [2025-03-09 01:13:27,571 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-09 01:13:27,571 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:13:27,674 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-03-09 01:13:27,674 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:13:27,674 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [301490708] [2025-03-09 01:13:27,674 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [301490708] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 01:13:27,674 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 01:13:27,674 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-03-09 01:13:27,675 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1489040690] [2025-03-09 01:13:27,675 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 01:13:27,675 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-09 01:13:27,675 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:13:27,676 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-09 01:13:27,676 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-09 01:13:27,693 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 29 [2025-03-09 01:13:27,693 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 40 places, 32 transitions, 102 flow. Second operand has 3 states, 3 states have (on average 10.333333333333334) internal successors, (31), 3 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:13:27,693 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 01:13:27,693 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 29 [2025-03-09 01:13:27,693 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 01:13:27,756 INFO L124 PetriNetUnfolderBase]: 43/129 cut-off events. [2025-03-09 01:13:27,756 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2025-03-09 01:13:27,757 INFO L83 FinitePrefix]: Finished finitePrefix Result has 261 conditions, 129 events. 43/129 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 434 event pairs, 42 based on Foata normal form. 0/128 useless extension candidates. Maximal degree in co-relation 228. Up to 105 conditions per place. [2025-03-09 01:13:27,758 INFO L140 encePairwiseOnDemand]: 24/29 looper letters, 20 selfloop transitions, 1 changer transitions 0/28 dead transitions. [2025-03-09 01:13:27,758 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 38 places, 28 transitions, 136 flow [2025-03-09 01:13:27,758 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-09 01:13:27,759 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-09 01:13:27,759 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 45 transitions. [2025-03-09 01:13:27,759 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5172413793103449 [2025-03-09 01:13:27,759 INFO L175 Difference]: Start difference. First operand has 40 places, 32 transitions, 102 flow. Second operand 3 states and 45 transitions. [2025-03-09 01:13:27,759 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 38 places, 28 transitions, 136 flow [2025-03-09 01:13:27,760 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 37 places, 28 transitions, 122 flow, removed 6 selfloop flow, removed 1 redundant places. [2025-03-09 01:13:27,760 INFO L231 Difference]: Finished difference. Result has 37 places, 28 transitions, 82 flow [2025-03-09 01:13:27,760 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=29, PETRI_DIFFERENCE_MINUEND_FLOW=80, PETRI_DIFFERENCE_MINUEND_PLACES=35, 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=82, PETRI_PLACES=37, PETRI_TRANSITIONS=28} [2025-03-09 01:13:27,761 INFO L279 CegarLoopForPetriNet]: 31 programPoint places, 6 predicate places. [2025-03-09 01:13:27,761 INFO L471 AbstractCegarLoop]: Abstraction has has 37 places, 28 transitions, 82 flow [2025-03-09 01:13:27,761 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 10.333333333333334) internal successors, (31), 3 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:13:27,761 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 01:13:27,761 INFO L206 CegarLoopForPetriNet]: trace histogram [4, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 01:13:27,761 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-09 01:13:27,761 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 11 more)] === [2025-03-09 01:13:27,762 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:13:27,762 INFO L85 PathProgramCache]: Analyzing trace with hash 1168184130, now seen corresponding path program 1 times [2025-03-09 01:13:27,762 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:13:27,762 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1300783157] [2025-03-09 01:13:27,762 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:13:27,762 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:13:27,776 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-03-09 01:13:27,784 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-03-09 01:13:27,787 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:13:27,787 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:13:27,890 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 01:13:27,890 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:13:27,890 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1300783157] [2025-03-09 01:13:27,891 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1300783157] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 01:13:27,891 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [379680255] [2025-03-09 01:13:27,891 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:13:27,891 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 01:13:27,891 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 01:13:27,893 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-09 01:13:27,895 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-09 01:13:27,938 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-03-09 01:13:27,962 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-03-09 01:13:27,963 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:13:27,963 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:13:27,964 INFO L256 TraceCheckSpWp]: Trace formula consists of 193 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-09 01:13:27,965 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 01:13:27,980 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 01:13:27,981 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 01:13:28,034 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 01:13:28,034 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [379680255] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-09 01:13:28,034 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-09 01:13:28,034 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 12 [2025-03-09 01:13:28,035 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [915567437] [2025-03-09 01:13:28,035 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-09 01:13:28,035 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-03-09 01:13:28,036 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:13:28,036 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-03-09 01:13:28,037 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2025-03-09 01:13:28,037 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 29 [2025-03-09 01:13:28,038 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 37 places, 28 transitions, 82 flow. Second operand has 13 states, 13 states have (on average 13.307692307692308) internal successors, (173), 13 states have internal predecessors, (173), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:13:28,038 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 01:13:28,038 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 29 [2025-03-09 01:13:28,038 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 01:13:28,116 INFO L124 PetriNetUnfolderBase]: 43/135 cut-off events. [2025-03-09 01:13:28,116 INFO L125 PetriNetUnfolderBase]: For 25/25 co-relation queries the response was YES. [2025-03-09 01:13:28,118 INFO L83 FinitePrefix]: Finished finitePrefix Result has 280 conditions, 135 events. 43/135 cut-off events. For 25/25 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 434 event pairs, 42 based on Foata normal form. 6/140 useless extension candidates. Maximal degree in co-relation 268. Up to 102 conditions per place. [2025-03-09 01:13:28,119 INFO L140 encePairwiseOnDemand]: 26/29 looper letters, 16 selfloop transitions, 11 changer transitions 0/34 dead transitions. [2025-03-09 01:13:28,119 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 48 places, 34 transitions, 172 flow [2025-03-09 01:13:28,119 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-09 01:13:28,120 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2025-03-09 01:13:28,120 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 177 transitions. [2025-03-09 01:13:28,121 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5086206896551724 [2025-03-09 01:13:28,122 INFO L175 Difference]: Start difference. First operand has 37 places, 28 transitions, 82 flow. Second operand 12 states and 177 transitions. [2025-03-09 01:13:28,122 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 48 places, 34 transitions, 172 flow [2025-03-09 01:13:28,123 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 47 places, 34 transitions, 171 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-09 01:13:28,124 INFO L231 Difference]: Finished difference. Result has 53 places, 34 transitions, 165 flow [2025-03-09 01:13:28,125 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=29, PETRI_DIFFERENCE_MINUEND_FLOW=81, PETRI_DIFFERENCE_MINUEND_PLACES=36, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=28, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=22, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=165, PETRI_PLACES=53, PETRI_TRANSITIONS=34} [2025-03-09 01:13:28,125 INFO L279 CegarLoopForPetriNet]: 31 programPoint places, 22 predicate places. [2025-03-09 01:13:28,126 INFO L471 AbstractCegarLoop]: Abstraction has has 53 places, 34 transitions, 165 flow [2025-03-09 01:13:28,126 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 13.307692307692308) internal successors, (173), 13 states have internal predecessors, (173), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:13:28,126 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 01:13:28,126 INFO L206 CegarLoopForPetriNet]: trace histogram [10, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 01:13:28,132 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-03-09 01:13:28,326 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,SelfDestructingSolverStorable3 [2025-03-09 01:13:28,327 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 11 more)] === [2025-03-09 01:13:28,329 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:13:28,329 INFO L85 PathProgramCache]: Analyzing trace with hash -1187355486, now seen corresponding path program 2 times [2025-03-09 01:13:28,329 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:13:28,329 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [657438889] [2025-03-09 01:13:28,329 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-09 01:13:28,329 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:13:28,341 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 17 statements into 2 equivalence classes. [2025-03-09 01:13:28,347 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 7 of 17 statements. [2025-03-09 01:13:28,347 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-09 01:13:28,347 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:13:28,457 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2025-03-09 01:13:28,458 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:13:28,458 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [657438889] [2025-03-09 01:13:28,458 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [657438889] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 01:13:28,458 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 01:13:28,458 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-09 01:13:28,458 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1291157394] [2025-03-09 01:13:28,458 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 01:13:28,458 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-09 01:13:28,458 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:13:28,458 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-09 01:13:28,459 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-09 01:13:28,476 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 29 [2025-03-09 01:13:28,477 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 53 places, 34 transitions, 165 flow. Second operand has 4 states, 4 states have (on average 11.75) internal successors, (47), 4 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:13:28,477 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 01:13:28,477 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 29 [2025-03-09 01:13:28,477 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 01:13:28,536 INFO L124 PetriNetUnfolderBase]: 43/131 cut-off events. [2025-03-09 01:13:28,537 INFO L125 PetriNetUnfolderBase]: For 31/31 co-relation queries the response was YES. [2025-03-09 01:13:28,537 INFO L83 FinitePrefix]: Finished finitePrefix Result has 306 conditions, 131 events. 43/131 cut-off events. For 31/31 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 396 event pairs, 36 based on Foata normal form. 0/130 useless extension candidates. Maximal degree in co-relation 287. Up to 86 conditions per place. [2025-03-09 01:13:28,538 INFO L140 encePairwiseOnDemand]: 24/29 looper letters, 27 selfloop transitions, 3 changer transitions 3/38 dead transitions. [2025-03-09 01:13:28,538 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 54 places, 38 transitions, 239 flow [2025-03-09 01:13:28,538 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-09 01:13:28,538 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-09 01:13:28,539 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 65 transitions. [2025-03-09 01:13:28,539 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5603448275862069 [2025-03-09 01:13:28,539 INFO L175 Difference]: Start difference. First operand has 53 places, 34 transitions, 165 flow. Second operand 4 states and 65 transitions. [2025-03-09 01:13:28,539 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 54 places, 38 transitions, 239 flow [2025-03-09 01:13:28,540 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 38 transitions, 191 flow, removed 19 selfloop flow, removed 5 redundant places. [2025-03-09 01:13:28,542 INFO L231 Difference]: Finished difference. Result has 49 places, 32 transitions, 119 flow [2025-03-09 01:13:28,542 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=29, PETRI_DIFFERENCE_MINUEND_FLOW=113, PETRI_DIFFERENCE_MINUEND_PLACES=46, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=32, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=29, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=119, PETRI_PLACES=49, PETRI_TRANSITIONS=32} [2025-03-09 01:13:28,543 INFO L279 CegarLoopForPetriNet]: 31 programPoint places, 18 predicate places. [2025-03-09 01:13:28,544 INFO L471 AbstractCegarLoop]: Abstraction has has 49 places, 32 transitions, 119 flow [2025-03-09 01:13:28,544 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.75) internal successors, (47), 4 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:13:28,544 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 01:13:28,544 INFO L206 CegarLoopForPetriNet]: trace histogram [10, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 01:13:28,544 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-09 01:13:28,544 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting t_funErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 11 more)] === [2025-03-09 01:13:28,545 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:13:28,545 INFO L85 PathProgramCache]: Analyzing trace with hash -1187050874, now seen corresponding path program 1 times [2025-03-09 01:13:28,545 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:13:28,545 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1026040712] [2025-03-09 01:13:28,545 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:13:28,545 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:13:28,554 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-03-09 01:13:28,562 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-03-09 01:13:28,563 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:13:28,563 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:13:28,681 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2025-03-09 01:13:28,681 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:13:28,682 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1026040712] [2025-03-09 01:13:28,682 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1026040712] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 01:13:28,682 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 01:13:28,682 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-09 01:13:28,682 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [135749873] [2025-03-09 01:13:28,682 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 01:13:28,682 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-09 01:13:28,682 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:13:28,683 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-09 01:13:28,683 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-09 01:13:28,705 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 29 [2025-03-09 01:13:28,705 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 32 transitions, 119 flow. Second operand has 4 states, 4 states have (on average 11.75) internal successors, (47), 4 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:13:28,705 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 01:13:28,705 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 29 [2025-03-09 01:13:28,706 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 01:13:28,765 INFO L124 PetriNetUnfolderBase]: 43/121 cut-off events. [2025-03-09 01:13:28,765 INFO L125 PetriNetUnfolderBase]: For 62/62 co-relation queries the response was YES. [2025-03-09 01:13:28,766 INFO L83 FinitePrefix]: Finished finitePrefix Result has 281 conditions, 121 events. 43/121 cut-off events. For 62/62 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 356 event pairs, 0 based on Foata normal form. 0/121 useless extension candidates. Maximal degree in co-relation 262. Up to 90 conditions per place. [2025-03-09 01:13:28,766 INFO L140 encePairwiseOnDemand]: 25/29 looper letters, 30 selfloop transitions, 2 changer transitions 2/37 dead transitions. [2025-03-09 01:13:28,766 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 50 places, 37 transitions, 199 flow [2025-03-09 01:13:28,767 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-09 01:13:28,767 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-09 01:13:28,767 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 66 transitions. [2025-03-09 01:13:28,767 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5689655172413793 [2025-03-09 01:13:28,767 INFO L175 Difference]: Start difference. First operand has 49 places, 32 transitions, 119 flow. Second operand 4 states and 66 transitions. [2025-03-09 01:13:28,767 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 50 places, 37 transitions, 199 flow [2025-03-09 01:13:28,768 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 47 places, 37 transitions, 191 flow, removed 0 selfloop flow, removed 3 redundant places. [2025-03-09 01:13:28,769 INFO L231 Difference]: Finished difference. Result has 47 places, 29 transitions, 111 flow [2025-03-09 01:13:28,769 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=29, PETRI_DIFFERENCE_MINUEND_FLOW=109, PETRI_DIFFERENCE_MINUEND_PLACES=44, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=30, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=28, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=111, PETRI_PLACES=47, PETRI_TRANSITIONS=29} [2025-03-09 01:13:28,769 INFO L279 CegarLoopForPetriNet]: 31 programPoint places, 16 predicate places. [2025-03-09 01:13:28,769 INFO L471 AbstractCegarLoop]: Abstraction has has 47 places, 29 transitions, 111 flow [2025-03-09 01:13:28,770 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.75) internal successors, (47), 4 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:13:28,770 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 01:13:28,770 INFO L206 CegarLoopForPetriNet]: trace histogram [10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 01:13:28,770 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-09 01:13:28,770 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 11 more)] === [2025-03-09 01:13:28,770 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:13:28,770 INFO L85 PathProgramCache]: Analyzing trace with hash 384470487, now seen corresponding path program 1 times [2025-03-09 01:13:28,770 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:13:28,771 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [543238105] [2025-03-09 01:13:28,771 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:13:28,771 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:13:28,777 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 21 statements into 1 equivalence classes. [2025-03-09 01:13:28,782 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 21 of 21 statements. [2025-03-09 01:13:28,782 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:13:28,782 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:13:28,803 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2025-03-09 01:13:28,803 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:13:28,803 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [543238105] [2025-03-09 01:13:28,804 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [543238105] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 01:13:28,804 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 01:13:28,804 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-03-09 01:13:28,804 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1283111971] [2025-03-09 01:13:28,804 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 01:13:28,804 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-09 01:13:28,804 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:13:28,805 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-09 01:13:28,805 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-09 01:13:28,810 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 29 [2025-03-09 01:13:28,811 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 47 places, 29 transitions, 111 flow. Second operand has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 3 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:13:28,811 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 01:13:28,811 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 29 [2025-03-09 01:13:28,811 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 01:13:28,837 INFO L124 PetriNetUnfolderBase]: 37/104 cut-off events. [2025-03-09 01:13:28,837 INFO L125 PetriNetUnfolderBase]: For 52/52 co-relation queries the response was YES. [2025-03-09 01:13:28,838 INFO L83 FinitePrefix]: Finished finitePrefix Result has 250 conditions, 104 events. 37/104 cut-off events. For 52/52 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 256 event pairs, 36 based on Foata normal form. 7/110 useless extension candidates. Maximal degree in co-relation 231. Up to 98 conditions per place. [2025-03-09 01:13:28,838 INFO L140 encePairwiseOnDemand]: 27/29 looper letters, 0 selfloop transitions, 0 changer transitions 28/28 dead transitions. [2025-03-09 01:13:28,838 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 47 places, 28 transitions, 161 flow [2025-03-09 01:13:28,838 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-09 01:13:28,838 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-09 01:13:28,839 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 50 transitions. [2025-03-09 01:13:28,840 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5747126436781609 [2025-03-09 01:13:28,840 INFO L175 Difference]: Start difference. First operand has 47 places, 29 transitions, 111 flow. Second operand 3 states and 50 transitions. [2025-03-09 01:13:28,840 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 47 places, 28 transitions, 161 flow [2025-03-09 01:13:28,841 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 45 places, 28 transitions, 158 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-09 01:13:28,841 INFO L231 Difference]: Finished difference. Result has 45 places, 0 transitions, 0 flow [2025-03-09 01:13:28,841 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=29, PETRI_DIFFERENCE_MINUEND_FLOW=106, PETRI_DIFFERENCE_MINUEND_PLACES=43, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=28, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=28, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=0, PETRI_PLACES=45, PETRI_TRANSITIONS=0} [2025-03-09 01:13:28,842 INFO L279 CegarLoopForPetriNet]: 31 programPoint places, 14 predicate places. [2025-03-09 01:13:28,842 INFO L471 AbstractCegarLoop]: Abstraction has has 45 places, 0 transitions, 0 flow [2025-03-09 01:13:28,842 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 3 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:13:28,846 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (13 of 14 remaining) [2025-03-09 01:13:28,847 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (12 of 14 remaining) [2025-03-09 01:13:28,848 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (11 of 14 remaining) [2025-03-09 01:13:28,848 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 14 remaining) [2025-03-09 01:13:28,848 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (9 of 14 remaining) [2025-03-09 01:13:28,848 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (8 of 14 remaining) [2025-03-09 01:13:28,849 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t_funErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 14 remaining) [2025-03-09 01:13:28,849 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t_funErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 14 remaining) [2025-03-09 01:13:28,849 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t_funErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (5 of 14 remaining) [2025-03-09 01:13:28,849 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t_funErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (4 of 14 remaining) [2025-03-09 01:13:28,849 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t_funErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (3 of 14 remaining) [2025-03-09 01:13:28,849 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t_funErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (2 of 14 remaining) [2025-03-09 01:13:28,849 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t_funErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (1 of 14 remaining) [2025-03-09 01:13:28,849 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t_funErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (0 of 14 remaining) [2025-03-09 01:13:28,849 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-09 01:13:28,849 INFO L422 BasicCegarLoop]: Path program histogram: [2, 2, 1, 1, 1] [2025-03-09 01:13:28,855 INFO L241 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2025-03-09 01:13:28,856 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-09 01:13:28,860 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 09.03 01:13:28 BasicIcfg [2025-03-09 01:13:28,860 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-09 01:13:28,861 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-09 01:13:28,861 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-09 01:13:28,861 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-09 01:13:28,862 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 09.03 01:13:26" (3/4) ... [2025-03-09 01:13:28,863 INFO L146 WitnessPrinter]: Generating witness for correct program [2025-03-09 01:13:28,865 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure t_fun [2025-03-09 01:13:28,868 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 52 nodes and edges [2025-03-09 01:13:28,869 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 25 nodes and edges [2025-03-09 01:13:28,869 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 13 nodes and edges [2025-03-09 01:13:28,869 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2025-03-09 01:13:28,869 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2025-03-09 01:13:28,869 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2025-03-09 01:13:28,870 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2025-03-09 01:13:28,930 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-03-09 01:13:28,931 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2025-03-09 01:13:28,931 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-09 01:13:28,931 INFO L158 Benchmark]: Toolchain (without parser) took 3661.28ms. Allocated memory is still 142.6MB. Free memory was 112.1MB in the beginning and 74.5MB in the end (delta: 37.6MB). Peak memory consumption was 40.0MB. Max. memory is 16.1GB. [2025-03-09 01:13:28,932 INFO L158 Benchmark]: CDTParser took 0.23ms. Allocated memory is still 201.3MB. Free memory is still 123.8MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-09 01:13:28,932 INFO L158 Benchmark]: CACSL2BoogieTranslator took 359.72ms. Allocated memory is still 142.6MB. Free memory was 111.6MB in the beginning and 82.5MB in the end (delta: 29.1MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2025-03-09 01:13:28,932 INFO L158 Benchmark]: Boogie Procedure Inliner took 47.86ms. Allocated memory is still 142.6MB. Free memory was 82.2MB in the beginning and 80.0MB in the end (delta: 2.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-09 01:13:28,932 INFO L158 Benchmark]: Boogie Preprocessor took 51.05ms. Allocated memory is still 142.6MB. Free memory was 80.0MB in the beginning and 77.7MB in the end (delta: 2.3MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-09 01:13:28,933 INFO L158 Benchmark]: IcfgBuilder took 748.30ms. Allocated memory is still 142.6MB. Free memory was 77.7MB in the beginning and 49.8MB in the end (delta: 27.9MB). Peak memory consumption was 47.7MB. Max. memory is 16.1GB. [2025-03-09 01:13:28,933 INFO L158 Benchmark]: TraceAbstraction took 2379.53ms. Allocated memory is still 142.6MB. Free memory was 49.0MB in the beginning and 80.2MB in the end (delta: -31.1MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-09 01:13:28,933 INFO L158 Benchmark]: Witness Printer took 70.06ms. Allocated memory is still 142.6MB. Free memory was 80.2MB in the beginning and 74.5MB in the end (delta: 5.7MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-09 01:13:28,934 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.23ms. Allocated memory is still 201.3MB. Free memory is still 123.8MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 359.72ms. Allocated memory is still 142.6MB. Free memory was 111.6MB in the beginning and 82.5MB in the end (delta: 29.1MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 47.86ms. Allocated memory is still 142.6MB. Free memory was 82.2MB in the beginning and 80.0MB in the end (delta: 2.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 51.05ms. Allocated memory is still 142.6MB. Free memory was 80.0MB in the beginning and 77.7MB in the end (delta: 2.3MB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 748.30ms. Allocated memory is still 142.6MB. Free memory was 77.7MB in the beginning and 49.8MB in the end (delta: 27.9MB). Peak memory consumption was 47.7MB. Max. memory is 16.1GB. * TraceAbstraction took 2379.53ms. Allocated memory is still 142.6MB. Free memory was 49.0MB in the beginning and 80.2MB in the end (delta: -31.1MB). There was no memory consumed. Max. memory is 16.1GB. * Witness Printer took 70.06ms. Allocated memory is still 142.6MB. Free memory was 80.2MB in the beginning and 74.5MB in the end (delta: 5.7MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 935]: all allocated memory was freed For all program executions holds that all allocated memory was freed at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 3 procedures, 42 locations, 41 edges, 14 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 2.3s, OverallIterations: 7, TraceHistogramMax: 10, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 0.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 161 SdHoareTripleChecker+Valid, 0.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 112 mSDsluCounter, 5 SdHoareTripleChecker+Invalid, 0.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 9 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 299 IncrementalHoareTripleChecker+Invalid, 308 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 9 mSolverCounterUnsat, 5 mSDtfsCounter, 299 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 53 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=165occurred in iteration=4, InterpolantAutomatonStates: 35, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 0.8s InterpolantComputationTime, 111 NumberOfCodeBlocks, 97 NumberOfCodeBlocksAsserted, 9 NumberOfCheckSat, 119 ConstructedInterpolants, 0 QuantifiedInterpolants, 647 SizeOfPredicates, 0 NumberOfNonLiveVariables, 365 ConjunctsInSsa, 9 ConjunctsInUnsatCore, 11 InterpolantComputations, 5 PerfectInterpolantSequences, 175/208 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 9 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2025-03-09 01:13:28,946 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE