./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/goblint-regression/06-symbeq_05-funloop_hard2.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 798a7b37 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_05-funloop_hard2.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 9e83a031749850377e0f1ecd2c361048b8f87f697f146600048034d31c93bd9a --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-04 10:00:24,105 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-04 10:00:24,152 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2025-03-04 10:00:24,159 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-04 10:00:24,160 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-04 10:00:24,179 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-04 10:00:24,180 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-04 10:00:24,180 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-04 10:00:24,181 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-04 10:00:24,181 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-04 10:00:24,182 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-04 10:00:24,182 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-04 10:00:24,182 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-04 10:00:24,182 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-04 10:00:24,182 INFO L153 SettingsManager]: * Use SBE=true [2025-03-04 10:00:24,182 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-04 10:00:24,182 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-04 10:00:24,182 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-04 10:00:24,182 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-04 10:00:24,182 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-04 10:00:24,182 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2025-03-04 10:00:24,182 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2025-03-04 10:00:24,182 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2025-03-04 10:00:24,182 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-04 10:00:24,182 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-03-04 10:00:24,182 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-03-04 10:00:24,182 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-04 10:00:24,183 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-04 10:00:24,183 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-04 10:00:24,183 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-04 10:00:24,183 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-04 10:00:24,183 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-04 10:00:24,183 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-04 10:00:24,183 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 10:00:24,183 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-04 10:00:24,183 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-04 10:00:24,183 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-04 10:00:24,183 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-04 10:00:24,183 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-04 10:00:24,183 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-04 10:00:24,183 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-04 10:00:24,183 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-04 10:00:24,183 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 -> 9e83a031749850377e0f1ecd2c361048b8f87f697f146600048034d31c93bd9a [2025-03-04 10:00:24,408 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-04 10:00:24,414 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-04 10:00:24,416 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-04 10:00:24,417 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-04 10:00:24,417 INFO L274 PluginConnector]: CDTParser initialized [2025-03-04 10:00:24,419 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/goblint-regression/06-symbeq_05-funloop_hard2.i [2025-03-04 10:00:25,535 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/13fef5434/8c21167805064334b85d7e196bcbc319/FLAGff3370ef3 [2025-03-04 10:00:25,833 INFO L384 CDTParser]: Found 1 translation units. [2025-03-04 10:00:25,834 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/goblint-regression/06-symbeq_05-funloop_hard2.i [2025-03-04 10:00:25,849 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/13fef5434/8c21167805064334b85d7e196bcbc319/FLAGff3370ef3 [2025-03-04 10:00:25,877 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/13fef5434/8c21167805064334b85d7e196bcbc319 [2025-03-04 10:00:25,880 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-04 10:00:25,882 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-04 10:00:25,883 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-04 10:00:25,883 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-04 10:00:25,886 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-04 10:00:25,887 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 10:00:25" (1/1) ... [2025-03-04 10:00:25,889 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4efedec1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:00:25, skipping insertion in model container [2025-03-04 10:00:25,889 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 10:00:25" (1/1) ... [2025-03-04 10:00:25,917 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-04 10:00:26,174 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 10:00:26,194 INFO L200 MainTranslator]: Completed pre-run [2025-03-04 10:00:26,227 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 10:00:26,262 INFO L204 MainTranslator]: Completed translation [2025-03-04 10:00:26,263 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:00:26 WrapperNode [2025-03-04 10:00:26,263 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-04 10:00:26,264 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-04 10:00:26,264 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-04 10:00:26,264 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-04 10:00:26,268 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:00:26" (1/1) ... [2025-03-04 10:00:26,286 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:00:26" (1/1) ... [2025-03-04 10:00:26,309 INFO L138 Inliner]: procedures = 263, calls = 74, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 134 [2025-03-04 10:00:26,309 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-04 10:00:26,310 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-04 10:00:26,310 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-04 10:00:26,310 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-04 10:00:26,315 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:00:26" (1/1) ... [2025-03-04 10:00:26,315 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:00:26" (1/1) ... [2025-03-04 10:00:26,323 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:00:26" (1/1) ... [2025-03-04 10:00:26,339 INFO L175 MemorySlicer]: Split 66 memory accesses to 1 slices as follows [66]. 100 percent of accesses are in the largest equivalence class. The 60 initializations are split as follows [60]. The 3 writes are split as follows [3]. [2025-03-04 10:00:26,339 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:00:26" (1/1) ... [2025-03-04 10:00:26,339 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:00:26" (1/1) ... [2025-03-04 10:00:26,348 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:00:26" (1/1) ... [2025-03-04 10:00:26,349 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:00:26" (1/1) ... [2025-03-04 10:00:26,350 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:00:26" (1/1) ... [2025-03-04 10:00:26,350 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:00:26" (1/1) ... [2025-03-04 10:00:26,351 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-04 10:00:26,352 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-04 10:00:26,352 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-04 10:00:26,352 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-04 10:00:26,353 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:00:26" (1/1) ... [2025-03-04 10:00:26,360 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 10:00:26,371 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:00:26,385 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-04 10:00:26,387 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-04 10:00:26,404 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2025-03-04 10:00:26,405 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-03-04 10:00:26,405 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-03-04 10:00:26,405 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2025-03-04 10:00:26,405 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-04 10:00:26,405 INFO L130 BoogieDeclarations]: Found specification of procedure t_fun [2025-03-04 10:00:26,406 INFO L138 BoogieDeclarations]: Found implementation of procedure t_fun [2025-03-04 10:00:26,406 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-04 10:00:26,406 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-04 10:00:26,406 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-04 10:00:26,407 WARN L225 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-03-04 10:00:26,517 INFO L256 CfgBuilder]: Building ICFG [2025-03-04 10:00:26,518 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-04 10:00:26,748 INFO L303 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-03-04 10:00:26,748 INFO L307 CfgBuilder]: Performing block encoding [2025-03-04 10:00:26,951 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-04 10:00:26,951 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-04 10:00:26,951 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 10:00:26 BoogieIcfgContainer [2025-03-04 10:00:26,952 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-04 10:00:26,953 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-04 10:00:26,953 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-04 10:00:26,956 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-04 10:00:26,957 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.03 10:00:25" (1/3) ... [2025-03-04 10:00:26,957 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1d63212b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 10:00:26, skipping insertion in model container [2025-03-04 10:00:26,958 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:00:26" (2/3) ... [2025-03-04 10:00:26,959 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1d63212b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 10:00:26, skipping insertion in model container [2025-03-04 10:00:26,959 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 10:00:26" (3/3) ... [2025-03-04 10:00:26,960 INFO L128 eAbstractionObserver]: Analyzing ICFG 06-symbeq_05-funloop_hard2.i [2025-03-04 10:00:26,971 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-04 10:00:26,973 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG 06-symbeq_05-funloop_hard2.i that has 2 procedures, 41 locations, 1 initial locations, 3 loop locations, and 13 error locations. [2025-03-04 10:00:26,973 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-03-04 10:00:27,006 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-03-04 10:00:27,028 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 44 places, 43 transitions, 90 flow [2025-03-04 10:00:27,057 INFO L124 PetriNetUnfolderBase]: 3/42 cut-off events. [2025-03-04 10:00:27,059 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-04 10:00:27,061 INFO L83 FinitePrefix]: Finished finitePrefix Result has 46 conditions, 42 events. 3/42 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 124 event pairs, 0 based on Foata normal form. 0/26 useless extension candidates. Maximal degree in co-relation 38. Up to 2 conditions per place. [2025-03-04 10:00:27,061 INFO L82 GeneralOperation]: Start removeDead. Operand has 44 places, 43 transitions, 90 flow [2025-03-04 10:00:27,064 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 43 places, 42 transitions, 87 flow [2025-03-04 10:00:27,071 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-04 10:00:27,079 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;@2c28eb2e, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-04 10:00:27,079 INFO L334 AbstractCegarLoop]: Starting to check reachability of 18 error locations. [2025-03-04 10:00:27,085 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-04 10:00:27,087 INFO L124 PetriNetUnfolderBase]: 1/16 cut-off events. [2025-03-04 10:00:27,087 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-04 10:00:27,087 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 10:00:27,087 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:00:27,088 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 15 more)] === [2025-03-04 10:00:27,092 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:00:27,092 INFO L85 PathProgramCache]: Analyzing trace with hash -1287069226, now seen corresponding path program 1 times [2025-03-04 10:00:27,097 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:00:27,099 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [159102693] [2025-03-04 10:00:27,100 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:00:27,100 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:00:27,171 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-03-04 10:00:27,195 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-03-04 10:00:27,197 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:00:27,197 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:00:27,317 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-04 10:00:27,319 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:00:27,320 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [159102693] [2025-03-04 10:00:27,320 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [159102693] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:00:27,320 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 10:00:27,320 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 10:00:27,321 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1339183701] [2025-03-04 10:00:27,321 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:00:27,326 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 10:00:27,329 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:00:27,344 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 10:00:27,345 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 10:00:27,346 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 18 out of 43 [2025-03-04 10:00:27,347 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 43 places, 42 transitions, 87 flow. Second operand has 3 states, 3 states have (on average 19.666666666666668) internal successors, (59), 3 states have internal predecessors, (59), 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-04 10:00:27,348 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 10:00:27,348 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 18 of 43 [2025-03-04 10:00:27,348 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 10:00:27,458 INFO L124 PetriNetUnfolderBase]: 106/288 cut-off events. [2025-03-04 10:00:27,459 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-04 10:00:27,460 INFO L83 FinitePrefix]: Finished finitePrefix Result has 506 conditions, 288 events. 106/288 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 34. Compared 1436 event pairs, 84 based on Foata normal form. 0/243 useless extension candidates. Maximal degree in co-relation 491. Up to 213 conditions per place. [2025-03-04 10:00:27,462 INFO L140 encePairwiseOnDemand]: 40/43 looper letters, 24 selfloop transitions, 2 changer transitions 0/43 dead transitions. [2025-03-04 10:00:27,462 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 45 places, 43 transitions, 141 flow [2025-03-04 10:00:27,463 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 10:00:27,464 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 10:00:27,469 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 81 transitions. [2025-03-04 10:00:27,470 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.627906976744186 [2025-03-04 10:00:27,471 INFO L175 Difference]: Start difference. First operand has 43 places, 42 transitions, 87 flow. Second operand 3 states and 81 transitions. [2025-03-04 10:00:27,471 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 45 places, 43 transitions, 141 flow [2025-03-04 10:00:27,474 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 44 places, 43 transitions, 140 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-04 10:00:27,475 INFO L231 Difference]: Finished difference. Result has 45 places, 43 transitions, 98 flow [2025-03-04 10:00:27,477 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=86, PETRI_DIFFERENCE_MINUEND_PLACES=42, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=42, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=40, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=98, PETRI_PLACES=45, PETRI_TRANSITIONS=43} [2025-03-04 10:00:27,479 INFO L279 CegarLoopForPetriNet]: 43 programPoint places, 2 predicate places. [2025-03-04 10:00:27,480 INFO L471 AbstractCegarLoop]: Abstraction has has 45 places, 43 transitions, 98 flow [2025-03-04 10:00:27,480 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 19.666666666666668) internal successors, (59), 3 states have internal predecessors, (59), 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-04 10:00:27,480 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 10:00:27,480 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:00:27,480 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-04 10:00:27,480 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting t_funErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 15 more)] === [2025-03-04 10:00:27,481 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:00:27,481 INFO L85 PathProgramCache]: Analyzing trace with hash -271037962, now seen corresponding path program 1 times [2025-03-04 10:00:27,481 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:00:27,481 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [317116294] [2025-03-04 10:00:27,481 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:00:27,481 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:00:27,494 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-03-04 10:00:27,505 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-03-04 10:00:27,505 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:00:27,505 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:00:27,579 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-04 10:00:27,579 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:00:27,579 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [317116294] [2025-03-04 10:00:27,579 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [317116294] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 10:00:27,579 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1034541039] [2025-03-04 10:00:27,580 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:00:27,580 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:00:27,580 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:00:27,582 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-04 10:00:27,584 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-04 10:00:27,651 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-03-04 10:00:27,681 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-03-04 10:00:27,682 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:00:27,682 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:00:27,683 INFO L256 TraceCheckSpWp]: Trace formula consists of 183 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-04 10:00:27,686 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:00:27,711 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-04 10:00:27,712 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 10:00:27,730 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-04 10:00:27,731 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1034541039] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 10:00:27,731 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 10:00:27,731 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 6 [2025-03-04 10:00:27,731 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [851532683] [2025-03-04 10:00:27,731 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 10:00:27,732 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-04 10:00:27,732 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:00:27,733 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-04 10:00:27,733 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2025-03-04 10:00:27,733 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 18 out of 43 [2025-03-04 10:00:27,734 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 45 places, 43 transitions, 98 flow. Second operand has 7 states, 7 states have (on average 19.714285714285715) internal successors, (138), 7 states have internal predecessors, (138), 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-04 10:00:27,734 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 10:00:27,735 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 18 of 43 [2025-03-04 10:00:27,735 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 10:00:27,839 INFO L124 PetriNetUnfolderBase]: 106/291 cut-off events. [2025-03-04 10:00:27,841 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-04 10:00:27,841 INFO L83 FinitePrefix]: Finished finitePrefix Result has 521 conditions, 291 events. 106/291 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 34. Compared 1430 event pairs, 84 based on Foata normal form. 0/246 useless extension candidates. Maximal degree in co-relation 510. Up to 213 conditions per place. [2025-03-04 10:00:27,843 INFO L140 encePairwiseOnDemand]: 40/43 looper letters, 24 selfloop transitions, 5 changer transitions 0/46 dead transitions. [2025-03-04 10:00:27,844 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 50 places, 46 transitions, 168 flow [2025-03-04 10:00:27,844 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 10:00:27,844 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-04 10:00:27,845 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 140 transitions. [2025-03-04 10:00:27,846 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5426356589147286 [2025-03-04 10:00:27,846 INFO L175 Difference]: Start difference. First operand has 45 places, 43 transitions, 98 flow. Second operand 6 states and 140 transitions. [2025-03-04 10:00:27,846 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 50 places, 46 transitions, 168 flow [2025-03-04 10:00:27,847 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 46 transitions, 164 flow, removed 1 selfloop flow, removed 1 redundant places. [2025-03-04 10:00:27,847 INFO L231 Difference]: Finished difference. Result has 52 places, 46 transitions, 130 flow [2025-03-04 10:00:27,849 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=94, PETRI_DIFFERENCE_MINUEND_PLACES=44, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=43, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=40, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=130, PETRI_PLACES=52, PETRI_TRANSITIONS=46} [2025-03-04 10:00:27,849 INFO L279 CegarLoopForPetriNet]: 43 programPoint places, 9 predicate places. [2025-03-04 10:00:27,861 INFO L471 AbstractCegarLoop]: Abstraction has has 52 places, 46 transitions, 130 flow [2025-03-04 10:00:27,862 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 19.714285714285715) internal successors, (138), 7 states have internal predecessors, (138), 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-04 10:00:27,862 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 10:00:27,862 INFO L206 CegarLoopForPetriNet]: trace histogram [4, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:00:27,868 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-03-04 10:00:28,064 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-04 10:00:28,066 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting t_funErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 15 more)] === [2025-03-04 10:00:28,067 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:00:28,067 INFO L85 PathProgramCache]: Analyzing trace with hash 1815313037, now seen corresponding path program 2 times [2025-03-04 10:00:28,067 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:00:28,067 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [614760754] [2025-03-04 10:00:28,067 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 10:00:28,067 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:00:28,080 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 12 statements into 2 equivalence classes. [2025-03-04 10:00:28,093 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 8 of 12 statements. [2025-03-04 10:00:28,093 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-04 10:00:28,093 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:00:28,180 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-04 10:00:28,180 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:00:28,180 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [614760754] [2025-03-04 10:00:28,180 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [614760754] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:00:28,180 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 10:00:28,180 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 10:00:28,180 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1816422859] [2025-03-04 10:00:28,180 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:00:28,180 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 10:00:28,181 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:00:28,181 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 10:00:28,181 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 10:00:28,203 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 43 [2025-03-04 10:00:28,204 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 52 places, 46 transitions, 130 flow. Second operand has 4 states, 4 states have (on average 16.0) internal successors, (64), 4 states have internal predecessors, (64), 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-04 10:00:28,204 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 10:00:28,204 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 43 [2025-03-04 10:00:28,204 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 10:00:28,293 INFO L124 PetriNetUnfolderBase]: 106/281 cut-off events. [2025-03-04 10:00:28,293 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2025-03-04 10:00:28,294 INFO L83 FinitePrefix]: Finished finitePrefix Result has 524 conditions, 281 events. 106/281 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 27. Compared 1353 event pairs, 24 based on Foata normal form. 0/260 useless extension candidates. Maximal degree in co-relation 491. Up to 130 conditions per place. [2025-03-04 10:00:28,295 INFO L140 encePairwiseOnDemand]: 36/43 looper letters, 39 selfloop transitions, 3 changer transitions 0/55 dead transitions. [2025-03-04 10:00:28,295 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 51 places, 55 transitions, 232 flow [2025-03-04 10:00:28,296 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 10:00:28,296 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-04 10:00:28,296 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 100 transitions. [2025-03-04 10:00:28,297 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5813953488372093 [2025-03-04 10:00:28,297 INFO L175 Difference]: Start difference. First operand has 52 places, 46 transitions, 130 flow. Second operand 4 states and 100 transitions. [2025-03-04 10:00:28,297 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 51 places, 55 transitions, 232 flow [2025-03-04 10:00:28,298 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 50 places, 55 transitions, 218 flow, removed 6 selfloop flow, removed 1 redundant places. [2025-03-04 10:00:28,298 INFO L231 Difference]: Finished difference. Result has 50 places, 42 transitions, 114 flow [2025-03-04 10:00:28,298 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=108, PETRI_DIFFERENCE_MINUEND_PLACES=47, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=42, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=39, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=114, PETRI_PLACES=50, PETRI_TRANSITIONS=42} [2025-03-04 10:00:28,299 INFO L279 CegarLoopForPetriNet]: 43 programPoint places, 7 predicate places. [2025-03-04 10:00:28,299 INFO L471 AbstractCegarLoop]: Abstraction has has 50 places, 42 transitions, 114 flow [2025-03-04 10:00:28,299 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 16.0) internal successors, (64), 4 states have internal predecessors, (64), 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-04 10:00:28,299 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 10:00:28,299 INFO L206 CegarLoopForPetriNet]: trace histogram [4, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:00:28,300 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-04 10:00:28,300 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting t_funErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 15 more)] === [2025-03-04 10:00:28,300 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:00:28,300 INFO L85 PathProgramCache]: Analyzing trace with hash 1815313038, now seen corresponding path program 1 times [2025-03-04 10:00:28,300 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:00:28,300 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1788810578] [2025-03-04 10:00:28,300 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:00:28,301 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:00:28,308 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-03-04 10:00:28,314 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-03-04 10:00:28,315 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:00:28,315 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:00:28,425 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-04 10:00:28,425 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:00:28,426 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1788810578] [2025-03-04 10:00:28,426 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1788810578] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 10:00:28,426 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [330447658] [2025-03-04 10:00:28,426 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:00:28,426 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:00:28,426 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:00:28,428 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-04 10:00:28,430 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-04 10:00:28,476 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-03-04 10:00:28,503 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-03-04 10:00:28,503 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:00:28,504 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:00:28,505 INFO L256 TraceCheckSpWp]: Trace formula consists of 204 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-04 10:00:28,506 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:00:28,523 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-04 10:00:28,524 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 10:00:28,581 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-04 10:00:28,581 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [330447658] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 10:00:28,581 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 10:00:28,581 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 12 [2025-03-04 10:00:28,581 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2075750792] [2025-03-04 10:00:28,581 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 10:00:28,582 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-03-04 10:00:28,582 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:00:28,582 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-03-04 10:00:28,582 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2025-03-04 10:00:28,583 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 18 out of 43 [2025-03-04 10:00:28,583 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 50 places, 42 transitions, 114 flow. Second operand has 13 states, 13 states have (on average 19.384615384615383) internal successors, (252), 13 states have internal predecessors, (252), 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-04 10:00:28,583 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 10:00:28,583 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 18 of 43 [2025-03-04 10:00:28,583 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 10:00:28,710 INFO L124 PetriNetUnfolderBase]: 106/283 cut-off events. [2025-03-04 10:00:28,711 INFO L125 PetriNetUnfolderBase]: For 41/41 co-relation queries the response was YES. [2025-03-04 10:00:28,713 INFO L83 FinitePrefix]: Finished finitePrefix Result has 565 conditions, 283 events. 106/283 cut-off events. For 41/41 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 1276 event pairs, 84 based on Foata normal form. 6/272 useless extension candidates. Maximal degree in co-relation 513. Up to 213 conditions per place. [2025-03-04 10:00:28,715 INFO L140 encePairwiseOnDemand]: 40/43 looper letters, 24 selfloop transitions, 11 changer transitions 0/48 dead transitions. [2025-03-04 10:00:28,715 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 61 places, 48 transitions, 220 flow [2025-03-04 10:00:28,715 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-04 10:00:28,715 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2025-03-04 10:00:28,716 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 257 transitions. [2025-03-04 10:00:28,716 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.49806201550387597 [2025-03-04 10:00:28,716 INFO L175 Difference]: Start difference. First operand has 50 places, 42 transitions, 114 flow. Second operand 12 states and 257 transitions. [2025-03-04 10:00:28,716 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 61 places, 48 transitions, 220 flow [2025-03-04 10:00:28,717 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 58 places, 48 transitions, 214 flow, removed 0 selfloop flow, removed 3 redundant places. [2025-03-04 10:00:28,718 INFO L231 Difference]: Finished difference. Result has 64 places, 48 transitions, 192 flow [2025-03-04 10:00:28,718 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=108, PETRI_DIFFERENCE_MINUEND_PLACES=47, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=42, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=36, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=192, PETRI_PLACES=64, PETRI_TRANSITIONS=48} [2025-03-04 10:00:28,721 INFO L279 CegarLoopForPetriNet]: 43 programPoint places, 21 predicate places. [2025-03-04 10:00:28,721 INFO L471 AbstractCegarLoop]: Abstraction has has 64 places, 48 transitions, 192 flow [2025-03-04 10:00:28,721 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 19.384615384615383) internal successors, (252), 13 states have internal predecessors, (252), 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-04 10:00:28,722 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 10:00:28,722 INFO L206 CegarLoopForPetriNet]: trace histogram [10, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:00:28,728 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-04 10:00:28,922 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-04 10:00:28,923 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting t_funErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 15 more)] === [2025-03-04 10:00:28,923 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:00:28,923 INFO L85 PathProgramCache]: Analyzing trace with hash -820833810, now seen corresponding path program 2 times [2025-03-04 10:00:28,923 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:00:28,923 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [40860146] [2025-03-04 10:00:28,923 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 10:00:28,923 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:00:28,932 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 18 statements into 2 equivalence classes. [2025-03-04 10:00:28,938 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 8 of 18 statements. [2025-03-04 10:00:28,938 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-04 10:00:28,938 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:00:29,053 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-04 10:00:29,053 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:00:29,054 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [40860146] [2025-03-04 10:00:29,054 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [40860146] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:00:29,054 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 10:00:29,054 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 10:00:29,054 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1949523690] [2025-03-04 10:00:29,056 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:00:29,056 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 10:00:29,056 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:00:29,057 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 10:00:29,057 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-04 10:00:29,095 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 43 [2025-03-04 10:00:29,095 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 64 places, 48 transitions, 192 flow. Second operand has 5 states, 5 states have (on average 15.6) internal successors, (78), 5 states have internal predecessors, (78), 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-04 10:00:29,095 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 10:00:29,095 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 43 [2025-03-04 10:00:29,096 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 10:00:29,248 INFO L124 PetriNetUnfolderBase]: 210/473 cut-off events. [2025-03-04 10:00:29,248 INFO L125 PetriNetUnfolderBase]: For 31/31 co-relation queries the response was YES. [2025-03-04 10:00:29,249 INFO L83 FinitePrefix]: Finished finitePrefix Result has 966 conditions, 473 events. 210/473 cut-off events. For 31/31 co-relation queries the response was YES. Maximal size of possible extension queue 23. Compared 2076 event pairs, 103 based on Foata normal form. 0/430 useless extension candidates. Maximal degree in co-relation 891. Up to 274 conditions per place. [2025-03-04 10:00:29,251 INFO L140 encePairwiseOnDemand]: 34/43 looper letters, 65 selfloop transitions, 4 changer transitions 0/78 dead transitions. [2025-03-04 10:00:29,251 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 66 places, 78 transitions, 390 flow [2025-03-04 10:00:29,251 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 10:00:29,251 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-03-04 10:00:29,252 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 138 transitions. [2025-03-04 10:00:29,252 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.641860465116279 [2025-03-04 10:00:29,252 INFO L175 Difference]: Start difference. First operand has 64 places, 48 transitions, 192 flow. Second operand 5 states and 138 transitions. [2025-03-04 10:00:29,252 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 66 places, 78 transitions, 390 flow [2025-03-04 10:00:29,254 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 61 places, 78 transitions, 342 flow, removed 19 selfloop flow, removed 5 redundant places. [2025-03-04 10:00:29,255 INFO L231 Difference]: Finished difference. Result has 63 places, 48 transitions, 166 flow [2025-03-04 10:00:29,255 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=140, PETRI_DIFFERENCE_MINUEND_PLACES=57, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=46, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=42, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=166, PETRI_PLACES=63, PETRI_TRANSITIONS=48} [2025-03-04 10:00:29,255 INFO L279 CegarLoopForPetriNet]: 43 programPoint places, 20 predicate places. [2025-03-04 10:00:29,256 INFO L471 AbstractCegarLoop]: Abstraction has has 63 places, 48 transitions, 166 flow [2025-03-04 10:00:29,256 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 15.6) internal successors, (78), 5 states have internal predecessors, (78), 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-04 10:00:29,256 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 10:00:29,256 INFO L206 CegarLoopForPetriNet]: trace histogram [10, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:00:29,256 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-04 10:00:29,256 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 15 more)] === [2025-03-04 10:00:29,258 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:00:29,258 INFO L85 PathProgramCache]: Analyzing trace with hash -846413285, now seen corresponding path program 1 times [2025-03-04 10:00:29,258 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:00:29,258 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1413755875] [2025-03-04 10:00:29,258 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:00:29,258 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:00:29,265 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-03-04 10:00:29,270 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-03-04 10:00:29,271 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:00:29,271 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:00:29,354 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-04 10:00:29,354 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:00:29,354 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1413755875] [2025-03-04 10:00:29,354 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1413755875] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:00:29,354 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 10:00:29,354 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 10:00:29,354 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [340584746] [2025-03-04 10:00:29,355 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:00:29,355 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 10:00:29,355 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:00:29,355 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 10:00:29,356 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 10:00:29,381 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 43 [2025-03-04 10:00:29,382 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 63 places, 48 transitions, 166 flow. Second operand has 4 states, 4 states have (on average 16.0) internal successors, (64), 4 states have internal predecessors, (64), 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-04 10:00:29,382 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 10:00:29,382 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 43 [2025-03-04 10:00:29,382 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 10:00:29,466 INFO L124 PetriNetUnfolderBase]: 184/457 cut-off events. [2025-03-04 10:00:29,467 INFO L125 PetriNetUnfolderBase]: For 140/140 co-relation queries the response was YES. [2025-03-04 10:00:29,468 INFO L83 FinitePrefix]: Finished finitePrefix Result has 995 conditions, 457 events. 184/457 cut-off events. For 140/140 co-relation queries the response was YES. Maximal size of possible extension queue 26. Compared 2177 event pairs, 91 based on Foata normal form. 0/442 useless extension candidates. Maximal degree in co-relation 941. Up to 238 conditions per place. [2025-03-04 10:00:29,469 INFO L140 encePairwiseOnDemand]: 38/43 looper letters, 44 selfloop transitions, 3 changer transitions 0/56 dead transitions. [2025-03-04 10:00:29,469 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 64 places, 56 transitions, 292 flow [2025-03-04 10:00:29,470 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 10:00:29,470 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-04 10:00:29,470 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 91 transitions. [2025-03-04 10:00:29,470 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5290697674418605 [2025-03-04 10:00:29,470 INFO L175 Difference]: Start difference. First operand has 63 places, 48 transitions, 166 flow. Second operand 4 states and 91 transitions. [2025-03-04 10:00:29,470 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 64 places, 56 transitions, 292 flow [2025-03-04 10:00:29,472 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 62 places, 56 transitions, 286 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-04 10:00:29,473 INFO L231 Difference]: Finished difference. Result has 62 places, 46 transitions, 164 flow [2025-03-04 10:00:29,473 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=158, PETRI_DIFFERENCE_MINUEND_PLACES=59, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=46, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=43, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=164, PETRI_PLACES=62, PETRI_TRANSITIONS=46} [2025-03-04 10:00:29,473 INFO L279 CegarLoopForPetriNet]: 43 programPoint places, 19 predicate places. [2025-03-04 10:00:29,474 INFO L471 AbstractCegarLoop]: Abstraction has has 62 places, 46 transitions, 164 flow [2025-03-04 10:00:29,474 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 16.0) internal successors, (64), 4 states have internal predecessors, (64), 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-04 10:00:29,474 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 10:00:29,474 INFO L206 CegarLoopForPetriNet]: trace histogram [10, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:00:29,474 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-04 10:00:29,474 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 15 more)] === [2025-03-04 10:00:29,475 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:00:29,475 INFO L85 PathProgramCache]: Analyzing trace with hash -846413284, now seen corresponding path program 1 times [2025-03-04 10:00:29,475 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:00:29,475 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1988701373] [2025-03-04 10:00:29,475 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:00:29,475 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:00:29,482 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-03-04 10:00:29,493 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-03-04 10:00:29,493 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:00:29,493 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:00:29,633 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-04 10:00:29,633 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:00:29,633 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1988701373] [2025-03-04 10:00:29,633 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1988701373] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:00:29,633 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 10:00:29,633 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 10:00:29,633 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1545310394] [2025-03-04 10:00:29,633 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:00:29,634 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 10:00:29,634 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:00:29,634 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 10:00:29,634 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-04 10:00:29,664 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 43 [2025-03-04 10:00:29,664 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 62 places, 46 transitions, 164 flow. Second operand has 5 states, 5 states have (on average 14.6) internal successors, (73), 5 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:00:29,664 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 10:00:29,664 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 43 [2025-03-04 10:00:29,664 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 10:00:29,824 INFO L124 PetriNetUnfolderBase]: 310/694 cut-off events. [2025-03-04 10:00:29,824 INFO L125 PetriNetUnfolderBase]: For 206/206 co-relation queries the response was YES. [2025-03-04 10:00:29,825 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1580 conditions, 694 events. 310/694 cut-off events. For 206/206 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 3185 event pairs, 172 based on Foata normal form. 14/658 useless extension candidates. Maximal degree in co-relation 1526. Up to 462 conditions per place. [2025-03-04 10:00:29,827 INFO L140 encePairwiseOnDemand]: 36/43 looper letters, 62 selfloop transitions, 4 changer transitions 0/72 dead transitions. [2025-03-04 10:00:29,827 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 66 places, 72 transitions, 380 flow [2025-03-04 10:00:29,828 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 10:00:29,828 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-03-04 10:00:29,828 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 118 transitions. [2025-03-04 10:00:29,828 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5488372093023256 [2025-03-04 10:00:29,828 INFO L175 Difference]: Start difference. First operand has 62 places, 46 transitions, 164 flow. Second operand 5 states and 118 transitions. [2025-03-04 10:00:29,828 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 66 places, 72 transitions, 380 flow [2025-03-04 10:00:29,829 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 63 places, 72 transitions, 370 flow, removed 0 selfloop flow, removed 3 redundant places. [2025-03-04 10:00:29,830 INFO L231 Difference]: Finished difference. Result has 65 places, 48 transitions, 184 flow [2025-03-04 10:00:29,830 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=158, PETRI_DIFFERENCE_MINUEND_PLACES=59, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=46, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=42, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=184, PETRI_PLACES=65, PETRI_TRANSITIONS=48} [2025-03-04 10:00:29,831 INFO L279 CegarLoopForPetriNet]: 43 programPoint places, 22 predicate places. [2025-03-04 10:00:29,831 INFO L471 AbstractCegarLoop]: Abstraction has has 65 places, 48 transitions, 184 flow [2025-03-04 10:00:29,831 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 14.6) internal successors, (73), 5 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:00:29,831 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 10:00:29,831 INFO L206 CegarLoopForPetriNet]: trace histogram [10, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:00:29,833 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-04 10:00:29,833 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting t_funErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 15 more)] === [2025-03-04 10:00:29,833 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:00:29,834 INFO L85 PathProgramCache]: Analyzing trace with hash 1093340271, now seen corresponding path program 1 times [2025-03-04 10:00:29,834 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:00:29,834 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1163354287] [2025-03-04 10:00:29,834 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:00:29,834 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:00:29,846 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-03-04 10:00:29,853 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-03-04 10:00:29,854 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:00:29,854 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:00:30,008 INFO L134 CoverageAnalysis]: Checked inductivity of 59 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2025-03-04 10:00:30,008 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:00:30,009 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1163354287] [2025-03-04 10:00:30,009 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1163354287] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 10:00:30,009 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1446503144] [2025-03-04 10:00:30,009 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:00:30,009 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:00:30,009 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:00:30,011 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-04 10:00:30,012 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-04 10:00:30,055 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-03-04 10:00:30,086 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-03-04 10:00:30,087 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:00:30,087 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:00:30,088 INFO L256 TraceCheckSpWp]: Trace formula consists of 288 conjuncts, 18 conjuncts are in the unsatisfiable core [2025-03-04 10:00:30,089 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:00:30,270 INFO L134 CoverageAnalysis]: Checked inductivity of 59 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2025-03-04 10:00:30,271 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 10:00:30,422 INFO L134 CoverageAnalysis]: Checked inductivity of 59 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2025-03-04 10:00:30,422 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1446503144] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 10:00:30,422 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 10:00:30,423 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 12 [2025-03-04 10:00:30,423 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1393085886] [2025-03-04 10:00:30,423 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 10:00:30,423 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-03-04 10:00:30,423 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:00:30,423 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-03-04 10:00:30,424 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=136, Unknown=0, NotChecked=0, Total=182 [2025-03-04 10:00:30,592 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 43 [2025-03-04 10:00:30,593 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 65 places, 48 transitions, 184 flow. Second operand has 14 states, 14 states have (on average 17.0) internal successors, (238), 14 states have internal predecessors, (238), 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-04 10:00:30,593 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 10:00:30,593 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 43 [2025-03-04 10:00:30,593 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 10:00:31,156 INFO L124 PetriNetUnfolderBase]: 629/1380 cut-off events. [2025-03-04 10:00:31,156 INFO L125 PetriNetUnfolderBase]: For 478/507 co-relation queries the response was YES. [2025-03-04 10:00:31,159 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3196 conditions, 1380 events. 629/1380 cut-off events. For 478/507 co-relation queries the response was YES. Maximal size of possible extension queue 27. Compared 6753 event pairs, 72 based on Foata normal form. 133/1494 useless extension candidates. Maximal degree in co-relation 3140. Up to 242 conditions per place. [2025-03-04 10:00:31,165 INFO L140 encePairwiseOnDemand]: 35/43 looper letters, 185 selfloop transitions, 12 changer transitions 0/204 dead transitions. [2025-03-04 10:00:31,165 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 75 places, 204 transitions, 1026 flow [2025-03-04 10:00:31,166 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-04 10:00:31,166 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2025-03-04 10:00:31,167 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 345 transitions. [2025-03-04 10:00:31,168 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6686046511627907 [2025-03-04 10:00:31,168 INFO L175 Difference]: Start difference. First operand has 65 places, 48 transitions, 184 flow. Second operand 12 states and 345 transitions. [2025-03-04 10:00:31,168 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 75 places, 204 transitions, 1026 flow [2025-03-04 10:00:31,170 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 73 places, 204 transitions, 1004 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-04 10:00:31,172 INFO L231 Difference]: Finished difference. Result has 80 places, 54 transitions, 259 flow [2025-03-04 10:00:31,174 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=176, PETRI_DIFFERENCE_MINUEND_PLACES=62, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=47, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=40, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=259, PETRI_PLACES=80, PETRI_TRANSITIONS=54} [2025-03-04 10:00:31,175 INFO L279 CegarLoopForPetriNet]: 43 programPoint places, 37 predicate places. [2025-03-04 10:00:31,176 INFO L471 AbstractCegarLoop]: Abstraction has has 80 places, 54 transitions, 259 flow [2025-03-04 10:00:31,176 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 17.0) internal successors, (238), 14 states have internal predecessors, (238), 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-04 10:00:31,176 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 10:00:31,176 INFO L206 CegarLoopForPetriNet]: trace histogram [10, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:00:31,183 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-03-04 10:00:31,377 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:00:31,377 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 15 more)] === [2025-03-04 10:00:31,377 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:00:31,377 INFO L85 PathProgramCache]: Analyzing trace with hash 1929598314, now seen corresponding path program 1 times [2025-03-04 10:00:31,378 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:00:31,378 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1119188424] [2025-03-04 10:00:31,378 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:00:31,378 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:00:31,385 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-03-04 10:00:31,391 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-03-04 10:00:31,391 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:00:31,392 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:00:31,545 INFO L134 CoverageAnalysis]: Checked inductivity of 59 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2025-03-04 10:00:31,546 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:00:31,546 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1119188424] [2025-03-04 10:00:31,546 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1119188424] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 10:00:31,546 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1479760105] [2025-03-04 10:00:31,546 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:00:31,546 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:00:31,546 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:00:31,548 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-04 10:00:31,550 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-04 10:00:31,596 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-03-04 10:00:31,620 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-03-04 10:00:31,620 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:00:31,621 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:00:31,622 INFO L256 TraceCheckSpWp]: Trace formula consists of 284 conjuncts, 18 conjuncts are in the unsatisfiable core [2025-03-04 10:00:31,623 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:00:31,763 INFO L134 CoverageAnalysis]: Checked inductivity of 59 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2025-03-04 10:00:31,763 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 10:00:31,890 INFO L134 CoverageAnalysis]: Checked inductivity of 59 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2025-03-04 10:00:31,890 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1479760105] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 10:00:31,890 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 10:00:31,890 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 12 [2025-03-04 10:00:31,890 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1262215018] [2025-03-04 10:00:31,891 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 10:00:31,891 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-03-04 10:00:31,891 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:00:31,891 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-03-04 10:00:31,891 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=136, Unknown=0, NotChecked=0, Total=182 [2025-03-04 10:00:31,998 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 43 [2025-03-04 10:00:31,999 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 80 places, 54 transitions, 259 flow. Second operand has 14 states, 14 states have (on average 16.0) internal successors, (224), 14 states have internal predecessors, (224), 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-04 10:00:31,999 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 10:00:31,999 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 43 [2025-03-04 10:00:31,999 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 10:00:32,629 INFO L124 PetriNetUnfolderBase]: 1250/2746 cut-off events. [2025-03-04 10:00:32,629 INFO L125 PetriNetUnfolderBase]: For 3118/3118 co-relation queries the response was YES. [2025-03-04 10:00:32,633 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7323 conditions, 2746 events. 1250/2746 cut-off events. For 3118/3118 co-relation queries the response was YES. Maximal size of possible extension queue 46. Compared 14939 event pairs, 306 based on Foata normal form. 224/2938 useless extension candidates. Maximal degree in co-relation 7260. Up to 782 conditions per place. [2025-03-04 10:00:32,642 INFO L140 encePairwiseOnDemand]: 35/43 looper letters, 211 selfloop transitions, 12 changer transitions 0/228 dead transitions. [2025-03-04 10:00:32,642 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 90 places, 228 transitions, 1729 flow [2025-03-04 10:00:32,643 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-04 10:00:32,643 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2025-03-04 10:00:32,644 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 289 transitions. [2025-03-04 10:00:32,644 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.560077519379845 [2025-03-04 10:00:32,644 INFO L175 Difference]: Start difference. First operand has 80 places, 54 transitions, 259 flow. Second operand 12 states and 289 transitions. [2025-03-04 10:00:32,644 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 90 places, 228 transitions, 1729 flow [2025-03-04 10:00:32,651 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 87 places, 228 transitions, 1548 flow, removed 70 selfloop flow, removed 3 redundant places. [2025-03-04 10:00:32,654 INFO L231 Difference]: Finished difference. Result has 94 places, 60 transitions, 319 flow [2025-03-04 10:00:32,654 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=236, PETRI_DIFFERENCE_MINUEND_PLACES=76, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=53, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=46, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=319, PETRI_PLACES=94, PETRI_TRANSITIONS=60} [2025-03-04 10:00:32,655 INFO L279 CegarLoopForPetriNet]: 43 programPoint places, 51 predicate places. [2025-03-04 10:00:32,656 INFO L471 AbstractCegarLoop]: Abstraction has has 94 places, 60 transitions, 319 flow [2025-03-04 10:00:32,656 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 16.0) internal successors, (224), 14 states have internal predecessors, (224), 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-04 10:00:32,656 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 10:00:32,656 INFO L206 CegarLoopForPetriNet]: trace histogram [10, 5, 5, 5, 4, 4, 4, 4, 1, 1, 1, 1, 1] [2025-03-04 10:00:32,663 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-04 10:00:32,856 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:00:32,857 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting t_funErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 15 more)] === [2025-03-04 10:00:32,857 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:00:32,857 INFO L85 PathProgramCache]: Analyzing trace with hash -728513618, now seen corresponding path program 2 times [2025-03-04 10:00:32,857 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:00:32,857 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1784687930] [2025-03-04 10:00:32,857 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 10:00:32,857 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:00:32,873 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 46 statements into 2 equivalence classes. [2025-03-04 10:00:32,895 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 46 of 46 statements. [2025-03-04 10:00:32,895 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 10:00:32,895 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:00:33,182 INFO L134 CoverageAnalysis]: Checked inductivity of 113 backedges. 21 proven. 37 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2025-03-04 10:00:33,182 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:00:33,182 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1784687930] [2025-03-04 10:00:33,182 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1784687930] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 10:00:33,182 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1686811341] [2025-03-04 10:00:33,182 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 10:00:33,183 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:00:33,183 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:00:33,184 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-04 10:00:33,186 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-04 10:00:33,238 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 46 statements into 2 equivalence classes. [2025-03-04 10:00:33,275 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 46 of 46 statements. [2025-03-04 10:00:33,275 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 10:00:33,275 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:00:33,277 INFO L256 TraceCheckSpWp]: Trace formula consists of 414 conjuncts, 24 conjuncts are in the unsatisfiable core [2025-03-04 10:00:33,280 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:00:33,556 INFO L134 CoverageAnalysis]: Checked inductivity of 113 backedges. 0 proven. 58 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2025-03-04 10:00:33,556 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 10:00:33,802 INFO L134 CoverageAnalysis]: Checked inductivity of 113 backedges. 0 proven. 58 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2025-03-04 10:00:33,802 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1686811341] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 10:00:33,802 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 10:00:33,802 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 21 [2025-03-04 10:00:33,803 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [864375332] [2025-03-04 10:00:33,803 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 10:00:33,803 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2025-03-04 10:00:33,804 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:00:33,804 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2025-03-04 10:00:33,805 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=111, Invalid=395, Unknown=0, NotChecked=0, Total=506 [2025-03-04 10:00:34,043 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 43 [2025-03-04 10:00:34,043 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 94 places, 60 transitions, 319 flow. Second operand has 23 states, 23 states have (on average 18.17391304347826) internal successors, (418), 23 states have internal predecessors, (418), 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-04 10:00:34,043 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 10:00:34,043 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 43 [2025-03-04 10:00:34,043 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 10:00:35,796 INFO L124 PetriNetUnfolderBase]: 2333/5055 cut-off events. [2025-03-04 10:00:35,796 INFO L125 PetriNetUnfolderBase]: For 8796/8857 co-relation queries the response was YES. [2025-03-04 10:00:35,808 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14212 conditions, 5055 events. 2333/5055 cut-off events. For 8796/8857 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 29114 event pairs, 0 based on Foata normal form. 444/5499 useless extension candidates. Maximal degree in co-relation 14141. Up to 519 conditions per place. [2025-03-04 10:00:35,825 INFO L140 encePairwiseOnDemand]: 37/43 looper letters, 516 selfloop transitions, 23 changer transitions 22/567 dead transitions. [2025-03-04 10:00:35,825 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 116 places, 567 transitions, 3893 flow [2025-03-04 10:00:35,825 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2025-03-04 10:00:35,825 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2025-03-04 10:00:35,826 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 701 transitions. [2025-03-04 10:00:35,827 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6792635658914729 [2025-03-04 10:00:35,827 INFO L175 Difference]: Start difference. First operand has 94 places, 60 transitions, 319 flow. Second operand 24 states and 701 transitions. [2025-03-04 10:00:35,827 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 116 places, 567 transitions, 3893 flow [2025-03-04 10:00:35,838 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 109 places, 567 transitions, 3488 flow, removed 154 selfloop flow, removed 7 redundant places. [2025-03-04 10:00:35,841 INFO L231 Difference]: Finished difference. Result has 115 places, 69 transitions, 411 flow [2025-03-04 10:00:35,841 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=282, PETRI_DIFFERENCE_MINUEND_PLACES=86, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=59, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=47, PETRI_DIFFERENCE_SUBTRAHEND_STATES=24, PETRI_FLOW=411, PETRI_PLACES=115, PETRI_TRANSITIONS=69} [2025-03-04 10:00:35,842 INFO L279 CegarLoopForPetriNet]: 43 programPoint places, 72 predicate places. [2025-03-04 10:00:35,842 INFO L471 AbstractCegarLoop]: Abstraction has has 115 places, 69 transitions, 411 flow [2025-03-04 10:00:35,842 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 18.17391304347826) internal successors, (418), 23 states have internal predecessors, (418), 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-04 10:00:35,842 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 10:00:35,842 INFO L206 CegarLoopForPetriNet]: trace histogram [10, 5, 5, 5, 4, 4, 4, 4, 1, 1, 1, 1, 1] [2025-03-04 10:00:35,849 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-04 10:00:36,047 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2025-03-04 10:00:36,047 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 15 more)] === [2025-03-04 10:00:36,047 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:00:36,048 INFO L85 PathProgramCache]: Analyzing trace with hash 1429400220, now seen corresponding path program 2 times [2025-03-04 10:00:36,048 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:00:36,048 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [349200429] [2025-03-04 10:00:36,048 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 10:00:36,048 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:00:36,057 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 46 statements into 2 equivalence classes. [2025-03-04 10:00:36,077 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 46 of 46 statements. [2025-03-04 10:00:36,078 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 10:00:36,078 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:00:36,308 INFO L134 CoverageAnalysis]: Checked inductivity of 113 backedges. 0 proven. 58 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2025-03-04 10:00:36,308 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:00:36,308 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [349200429] [2025-03-04 10:00:36,308 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [349200429] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 10:00:36,309 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1027313826] [2025-03-04 10:00:36,309 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 10:00:36,309 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:00:36,309 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:00:36,311 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-04 10:00:36,312 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-04 10:00:36,370 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 46 statements into 2 equivalence classes. [2025-03-04 10:00:36,405 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 46 of 46 statements. [2025-03-04 10:00:36,405 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 10:00:36,405 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:00:36,407 INFO L256 TraceCheckSpWp]: Trace formula consists of 410 conjuncts, 20 conjuncts are in the unsatisfiable core [2025-03-04 10:00:36,408 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:00:36,711 INFO L134 CoverageAnalysis]: Checked inductivity of 113 backedges. 46 proven. 12 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2025-03-04 10:00:36,711 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 10:00:37,102 INFO L134 CoverageAnalysis]: Checked inductivity of 113 backedges. 42 proven. 16 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2025-03-04 10:00:37,102 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1027313826] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 10:00:37,102 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 10:00:37,102 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 21 [2025-03-04 10:00:37,102 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [516633093] [2025-03-04 10:00:37,102 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 10:00:37,103 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2025-03-04 10:00:37,103 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:00:37,103 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2025-03-04 10:00:37,104 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=112, Invalid=394, Unknown=0, NotChecked=0, Total=506 [2025-03-04 10:00:37,327 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 43 [2025-03-04 10:00:37,327 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 115 places, 69 transitions, 411 flow. Second operand has 23 states, 23 states have (on average 17.17391304347826) internal successors, (395), 23 states have internal predecessors, (395), 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-04 10:00:37,328 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 10:00:37,328 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 43 [2025-03-04 10:00:37,328 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 10:00:38,529 INFO L124 PetriNetUnfolderBase]: 2711/5946 cut-off events. [2025-03-04 10:00:38,530 INFO L125 PetriNetUnfolderBase]: For 11939/11939 co-relation queries the response was YES. [2025-03-04 10:00:38,548 INFO L83 FinitePrefix]: Finished finitePrefix Result has 17492 conditions, 5946 events. 2711/5946 cut-off events. For 11939/11939 co-relation queries the response was YES. Maximal size of possible extension queue 53. Compared 35816 event pairs, 0 based on Foata normal form. 189/6135 useless extension candidates. Maximal degree in co-relation 17418. Up to 945 conditions per place. [2025-03-04 10:00:38,572 INFO L140 encePairwiseOnDemand]: 37/43 looper letters, 407 selfloop transitions, 14 changer transitions 0/425 dead transitions. [2025-03-04 10:00:38,573 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 127 places, 425 transitions, 3833 flow [2025-03-04 10:00:38,574 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-03-04 10:00:38,574 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2025-03-04 10:00:38,575 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 349 transitions. [2025-03-04 10:00:38,575 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5410852713178295 [2025-03-04 10:00:38,575 INFO L175 Difference]: Start difference. First operand has 115 places, 69 transitions, 411 flow. Second operand 15 states and 349 transitions. [2025-03-04 10:00:38,575 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 127 places, 425 transitions, 3833 flow [2025-03-04 10:00:38,592 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 113 places, 425 transitions, 3264 flow, removed 169 selfloop flow, removed 14 redundant places. [2025-03-04 10:00:38,595 INFO L231 Difference]: Finished difference. Result has 114 places, 70 transitions, 391 flow [2025-03-04 10:00:38,595 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=348, PETRI_DIFFERENCE_MINUEND_PLACES=99, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=68, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=56, PETRI_DIFFERENCE_SUBTRAHEND_STATES=15, PETRI_FLOW=391, PETRI_PLACES=114, PETRI_TRANSITIONS=70} [2025-03-04 10:00:38,596 INFO L279 CegarLoopForPetriNet]: 43 programPoint places, 71 predicate places. [2025-03-04 10:00:38,596 INFO L471 AbstractCegarLoop]: Abstraction has has 114 places, 70 transitions, 391 flow [2025-03-04 10:00:38,596 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 17.17391304347826) internal successors, (395), 23 states have internal predecessors, (395), 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-04 10:00:38,596 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 10:00:38,596 INFO L206 CegarLoopForPetriNet]: trace histogram [10, 5, 5, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:00:38,603 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2025-03-04 10:00:38,797 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:00:38,797 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 15 more)] === [2025-03-04 10:00:38,797 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:00:38,798 INFO L85 PathProgramCache]: Analyzing trace with hash -1330627556, now seen corresponding path program 1 times [2025-03-04 10:00:38,798 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:00:38,798 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2051256220] [2025-03-04 10:00:38,798 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:00:38,798 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:00:38,813 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 57 statements into 1 equivalence classes. [2025-03-04 10:00:38,820 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 57 of 57 statements. [2025-03-04 10:00:38,821 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:00:38,821 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:00:38,862 INFO L134 CoverageAnalysis]: Checked inductivity of 130 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 130 trivial. 0 not checked. [2025-03-04 10:00:38,863 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:00:38,863 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2051256220] [2025-03-04 10:00:38,863 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2051256220] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:00:38,863 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 10:00:38,863 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-03-04 10:00:38,863 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [947986824] [2025-03-04 10:00:38,863 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:00:38,863 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 10:00:38,864 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:00:38,864 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 10:00:38,864 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 10:00:38,870 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 17 out of 43 [2025-03-04 10:00:38,870 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 114 places, 70 transitions, 391 flow. Second operand has 3 states, 3 states have (on average 22.666666666666668) internal successors, (68), 3 states have internal predecessors, (68), 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-04 10:00:38,870 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 10:00:38,870 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 17 of 43 [2025-03-04 10:00:38,870 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 10:00:39,452 INFO L124 PetriNetUnfolderBase]: 2648/5773 cut-off events. [2025-03-04 10:00:39,453 INFO L125 PetriNetUnfolderBase]: For 8927/8957 co-relation queries the response was YES. [2025-03-04 10:00:39,464 INFO L83 FinitePrefix]: Finished finitePrefix Result has 16758 conditions, 5773 events. 2648/5773 cut-off events. For 8927/8957 co-relation queries the response was YES. Maximal size of possible extension queue 54. Compared 34878 event pairs, 2542 based on Foata normal form. 63/5833 useless extension candidates. Maximal degree in co-relation 16687. Up to 5306 conditions per place. [2025-03-04 10:00:39,467 INFO L140 encePairwiseOnDemand]: 41/43 looper letters, 0 selfloop transitions, 0 changer transitions 69/69 dead transitions. [2025-03-04 10:00:39,467 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 115 places, 69 transitions, 519 flow [2025-03-04 10:00:39,468 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 10:00:39,468 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 10:00:39,468 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 76 transitions. [2025-03-04 10:00:39,468 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5891472868217055 [2025-03-04 10:00:39,468 INFO L175 Difference]: Start difference. First operand has 114 places, 70 transitions, 391 flow. Second operand 3 states and 76 transitions. [2025-03-04 10:00:39,468 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 115 places, 69 transitions, 519 flow [2025-03-04 10:00:39,485 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 105 places, 69 transitions, 494 flow, removed 3 selfloop flow, removed 10 redundant places. [2025-03-04 10:00:39,485 INFO L231 Difference]: Finished difference. Result has 105 places, 0 transitions, 0 flow [2025-03-04 10:00:39,485 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=364, PETRI_DIFFERENCE_MINUEND_PLACES=103, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=69, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=69, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=0, PETRI_PLACES=105, PETRI_TRANSITIONS=0} [2025-03-04 10:00:39,486 INFO L279 CegarLoopForPetriNet]: 43 programPoint places, 62 predicate places. [2025-03-04 10:00:39,486 INFO L471 AbstractCegarLoop]: Abstraction has has 105 places, 0 transitions, 0 flow [2025-03-04 10:00:39,486 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 22.666666666666668) internal successors, (68), 3 states have internal predecessors, (68), 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-04 10:00:39,488 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (17 of 18 remaining) [2025-03-04 10:00:39,489 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (16 of 18 remaining) [2025-03-04 10:00:39,489 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (15 of 18 remaining) [2025-03-04 10:00:39,490 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (14 of 18 remaining) [2025-03-04 10:00:39,490 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (13 of 18 remaining) [2025-03-04 10:00:39,490 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (12 of 18 remaining) [2025-03-04 10:00:39,490 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (11 of 18 remaining) [2025-03-04 10:00:39,490 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 18 remaining) [2025-03-04 10:00:39,490 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (9 of 18 remaining) [2025-03-04 10:00:39,490 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (8 of 18 remaining) [2025-03-04 10:00:39,490 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t_funErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 18 remaining) [2025-03-04 10:00:39,490 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t_funErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 18 remaining) [2025-03-04 10:00:39,490 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t_funErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (5 of 18 remaining) [2025-03-04 10:00:39,490 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t_funErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (4 of 18 remaining) [2025-03-04 10:00:39,490 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t_funErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (3 of 18 remaining) [2025-03-04 10:00:39,491 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t_funErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (2 of 18 remaining) [2025-03-04 10:00:39,491 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t_funErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (1 of 18 remaining) [2025-03-04 10:00:39,491 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t_funErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (0 of 18 remaining) [2025-03-04 10:00:39,491 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-04 10:00:39,491 INFO L422 BasicCegarLoop]: Path program histogram: [2, 2, 2, 2, 1, 1, 1, 1] [2025-03-04 10:00:39,494 INFO L241 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2025-03-04 10:00:39,495 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-04 10:00:39,498 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 04.03 10:00:39 BasicIcfg [2025-03-04 10:00:39,498 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-04 10:00:39,498 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-04 10:00:39,499 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-04 10:00:39,499 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-04 10:00:39,499 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 10:00:26" (3/4) ... [2025-03-04 10:00:39,500 INFO L146 WitnessPrinter]: Generating witness for correct program [2025-03-04 10:00:39,502 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure t_fun [2025-03-04 10:00:39,505 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 49 nodes and edges [2025-03-04 10:00:39,505 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 24 nodes and edges [2025-03-04 10:00:39,505 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 12 nodes and edges [2025-03-04 10:00:39,505 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2025-03-04 10:00:39,505 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2025-03-04 10:00:39,505 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2025-03-04 10:00:39,560 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-03-04 10:00:39,561 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2025-03-04 10:00:39,561 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-04 10:00:39,561 INFO L158 Benchmark]: Toolchain (without parser) took 13679.83ms. Allocated memory was 142.6MB in the beginning and 444.6MB in the end (delta: 302.0MB). Free memory was 110.7MB in the beginning and 170.1MB in the end (delta: -59.4MB). Peak memory consumption was 240.5MB. Max. memory is 16.1GB. [2025-03-04 10:00:39,561 INFO L158 Benchmark]: CDTParser took 0.25ms. Allocated memory is still 201.3MB. Free memory is still 123.7MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-04 10:00:39,562 INFO L158 Benchmark]: CACSL2BoogieTranslator took 379.72ms. Allocated memory is still 142.6MB. Free memory was 110.7MB in the beginning and 81.2MB in the end (delta: 29.5MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2025-03-04 10:00:39,562 INFO L158 Benchmark]: Boogie Procedure Inliner took 45.55ms. Allocated memory is still 142.6MB. Free memory was 81.2MB in the beginning and 78.5MB in the end (delta: 2.7MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-04 10:00:39,562 INFO L158 Benchmark]: Boogie Preprocessor took 41.89ms. Allocated memory is still 142.6MB. Free memory was 78.5MB in the beginning and 76.7MB in the end (delta: 1.8MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-04 10:00:39,562 INFO L158 Benchmark]: IcfgBuilder took 599.73ms. Allocated memory is still 142.6MB. Free memory was 76.7MB in the beginning and 65.8MB in the end (delta: 10.9MB). Peak memory consumption was 48.2MB. Max. memory is 16.1GB. [2025-03-04 10:00:39,562 INFO L158 Benchmark]: TraceAbstraction took 12544.87ms. Allocated memory was 142.6MB in the beginning and 444.6MB in the end (delta: 302.0MB). Free memory was 65.1MB in the beginning and 178.5MB in the end (delta: -113.4MB). Peak memory consumption was 360.1MB. Max. memory is 16.1GB. [2025-03-04 10:00:39,563 INFO L158 Benchmark]: Witness Printer took 62.27ms. Allocated memory is still 444.6MB. Free memory was 178.5MB in the beginning and 170.1MB in the end (delta: 8.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-04 10:00:39,564 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.25ms. Allocated memory is still 201.3MB. Free memory is still 123.7MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 379.72ms. Allocated memory is still 142.6MB. Free memory was 110.7MB in the beginning and 81.2MB in the end (delta: 29.5MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 45.55ms. Allocated memory is still 142.6MB. Free memory was 81.2MB in the beginning and 78.5MB in the end (delta: 2.7MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 41.89ms. Allocated memory is still 142.6MB. Free memory was 78.5MB in the beginning and 76.7MB in the end (delta: 1.8MB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 599.73ms. Allocated memory is still 142.6MB. Free memory was 76.7MB in the beginning and 65.8MB in the end (delta: 10.9MB). Peak memory consumption was 48.2MB. Max. memory is 16.1GB. * TraceAbstraction took 12544.87ms. Allocated memory was 142.6MB in the beginning and 444.6MB in the end (delta: 302.0MB). Free memory was 65.1MB in the beginning and 178.5MB in the end (delta: -113.4MB). Peak memory consumption was 360.1MB. Max. memory is 16.1GB. * Witness Printer took 62.27ms. Allocated memory is still 444.6MB. Free memory was 178.5MB in the beginning and 170.1MB in the end (delta: 8.4MB). 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: -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: 931]: 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, 55 locations, 18 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: 12.5s, OverallIterations: 12, TraceHistogramMax: 10, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 6.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 2651 SdHoareTripleChecker+Valid, 3.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 2517 mSDsluCounter, 479 SdHoareTripleChecker+Invalid, 2.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 455 mSDsCounter, 63 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 5977 IncrementalHoareTripleChecker+Invalid, 6040 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 63 mSolverCounterUnsat, 24 mSDtfsCounter, 5977 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 408 GetRequests, 264 SyntacticMatches, 0 SemanticMatches, 144 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 693 ImplicationChecksByTransitivity, 1.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=411occurred in iteration=10, InterpolantAutomatonStates: 105, 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.1s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 3.5s InterpolantComputationTime, 457 NumberOfCodeBlocks, 443 NumberOfCodeBlocksAsserted, 22 NumberOfCheckSat, 596 ConstructedInterpolants, 0 QuantifiedInterpolants, 7067 SizeOfPredicates, 20 NumberOfNonLiveVariables, 1783 ConjunctsInSsa, 89 ConjunctsInUnsatCore, 24 InterpolantComputations, 6 PerfectInterpolantSequences, 1074/1370 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 13 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2025-03-04 10:00:39,576 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE