./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/array-examples/data_structures_set_multi_proc_trivial_ground.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/array-examples/data_structures_set_multi_proc_trivial_ground.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 0286582125bb2879636b8cf3b934bed172850a3a3b0d880c07306d10439134a7 --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-04 07:26:08,167 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-04 07:26:08,223 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2025-03-04 07:26:08,229 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-04 07:26:08,229 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-04 07:26:08,247 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-04 07:26:08,248 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-04 07:26:08,248 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-04 07:26:08,248 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-04 07:26:08,248 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-04 07:26:08,248 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-04 07:26:08,248 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-04 07:26:08,249 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-04 07:26:08,249 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-04 07:26:08,249 INFO L153 SettingsManager]: * Use SBE=true [2025-03-04 07:26:08,249 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-04 07:26:08,249 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-04 07:26:08,249 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-04 07:26:08,249 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-04 07:26:08,249 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-04 07:26:08,249 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2025-03-04 07:26:08,249 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2025-03-04 07:26:08,249 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2025-03-04 07:26:08,249 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-04 07:26:08,249 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-03-04 07:26:08,249 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-03-04 07:26:08,249 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-04 07:26:08,249 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-04 07:26:08,249 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-04 07:26:08,249 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-04 07:26:08,249 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-04 07:26:08,250 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-04 07:26:08,250 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-04 07:26:08,250 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 07:26:08,250 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-04 07:26:08,250 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-04 07:26:08,250 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-04 07:26:08,250 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-04 07:26:08,250 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-04 07:26:08,250 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-04 07:26:08,250 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-04 07:26:08,250 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-04 07:26:08,250 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 -> 0286582125bb2879636b8cf3b934bed172850a3a3b0d880c07306d10439134a7 [2025-03-04 07:26:08,463 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-04 07:26:08,468 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-04 07:26:08,472 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-04 07:26:08,473 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-04 07:26:08,473 INFO L274 PluginConnector]: CDTParser initialized [2025-03-04 07:26:08,474 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/array-examples/data_structures_set_multi_proc_trivial_ground.i [2025-03-04 07:26:09,648 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c124b88a7/4c8dbfe3a5fc4a0cb0d5990f34b7e3d5/FLAG2cd66a5fe [2025-03-04 07:26:09,857 INFO L384 CDTParser]: Found 1 translation units. [2025-03-04 07:26:09,858 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/array-examples/data_structures_set_multi_proc_trivial_ground.i [2025-03-04 07:26:09,863 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c124b88a7/4c8dbfe3a5fc4a0cb0d5990f34b7e3d5/FLAG2cd66a5fe [2025-03-04 07:26:10,218 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c124b88a7/4c8dbfe3a5fc4a0cb0d5990f34b7e3d5 [2025-03-04 07:26:10,220 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-04 07:26:10,220 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-04 07:26:10,221 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-04 07:26:10,221 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-04 07:26:10,224 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-04 07:26:10,224 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 07:26:10" (1/1) ... [2025-03-04 07:26:10,225 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@68b8afb0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 07:26:10, skipping insertion in model container [2025-03-04 07:26:10,225 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 07:26:10" (1/1) ... [2025-03-04 07:26:10,236 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-04 07:26:10,360 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 07:26:10,368 INFO L200 MainTranslator]: Completed pre-run [2025-03-04 07:26:10,390 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 07:26:10,403 INFO L204 MainTranslator]: Completed translation [2025-03-04 07:26:10,404 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 07:26:10 WrapperNode [2025-03-04 07:26:10,405 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-04 07:26:10,405 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-04 07:26:10,406 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-04 07:26:10,406 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-04 07:26:10,411 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 07:26:10" (1/1) ... [2025-03-04 07:26:10,418 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 07:26:10" (1/1) ... [2025-03-04 07:26:10,438 INFO L138 Inliner]: procedures = 18, calls = 30, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 136 [2025-03-04 07:26:10,440 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-04 07:26:10,441 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-04 07:26:10,441 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-04 07:26:10,441 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-04 07:26:10,447 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 07:26:10" (1/1) ... [2025-03-04 07:26:10,447 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 07:26:10" (1/1) ... [2025-03-04 07:26:10,449 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 07:26:10" (1/1) ... [2025-03-04 07:26:10,465 INFO L175 MemorySlicer]: Split 14 memory accesses to 3 slices as follows [2, 3, 9]. 64 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0, 0]. The 3 writes are split as follows [0, 1, 2]. [2025-03-04 07:26:10,466 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 07:26:10" (1/1) ... [2025-03-04 07:26:10,466 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 07:26:10" (1/1) ... [2025-03-04 07:26:10,471 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 07:26:10" (1/1) ... [2025-03-04 07:26:10,475 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 07:26:10" (1/1) ... [2025-03-04 07:26:10,476 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 07:26:10" (1/1) ... [2025-03-04 07:26:10,477 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 07:26:10" (1/1) ... [2025-03-04 07:26:10,478 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-04 07:26:10,483 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-04 07:26:10,483 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-04 07:26:10,483 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-04 07:26:10,484 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 07:26:10" (1/1) ... [2025-03-04 07:26:10,489 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 07:26:10,500 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 07:26:10,513 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 07:26:10,515 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 07:26:10,530 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-04 07:26:10,531 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-04 07:26:10,531 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-03-04 07:26:10,531 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-03-04 07:26:10,531 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-03-04 07:26:10,531 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-03-04 07:26:10,531 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-03-04 07:26:10,532 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2025-03-04 07:26:10,532 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-04 07:26:10,532 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-04 07:26:10,532 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-03-04 07:26:10,532 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-03-04 07:26:10,532 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2025-03-04 07:26:10,532 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2025-03-04 07:26:10,533 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2025-03-04 07:26:10,533 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-03-04 07:26:10,600 INFO L256 CfgBuilder]: Building ICFG [2025-03-04 07:26:10,602 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-04 07:26:10,903 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L29: call ULTIMATE.dealloc(main_~#set~0#1.base, main_~#set~0#1.offset);havoc main_~#set~0#1.base, main_~#set~0#1.offset;call ULTIMATE.dealloc(main_~#values~0#1.base, main_~#values~0#1.offset);havoc main_~#values~0#1.base, main_~#values~0#1.offset; [2025-03-04 07:26:10,934 INFO L? ?]: Removed 84 outVars from TransFormulas that were not future-live. [2025-03-04 07:26:10,935 INFO L307 CfgBuilder]: Performing block encoding [2025-03-04 07:26:10,951 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-04 07:26:10,951 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-04 07:26:10,952 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 07:26:10 BoogieIcfgContainer [2025-03-04 07:26:10,952 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-04 07:26:10,953 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-04 07:26:10,953 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-04 07:26:10,956 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-04 07:26:10,957 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.03 07:26:10" (1/3) ... [2025-03-04 07:26:10,957 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@26fe2452 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 07:26:10, skipping insertion in model container [2025-03-04 07:26:10,957 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 07:26:10" (2/3) ... [2025-03-04 07:26:10,957 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@26fe2452 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 07:26:10, skipping insertion in model container [2025-03-04 07:26:10,957 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 07:26:10" (3/3) ... [2025-03-04 07:26:10,958 INFO L128 eAbstractionObserver]: Analyzing ICFG data_structures_set_multi_proc_trivial_ground.i [2025-03-04 07:26:10,969 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-04 07:26:10,970 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG data_structures_set_multi_proc_trivial_ground.i that has 2 procedures, 77 locations, 1 initial locations, 10 loop locations, and 26 error locations. [2025-03-04 07:26:11,004 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-04 07:26:11,014 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;@c97840b, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-04 07:26:11,014 INFO L334 AbstractCegarLoop]: Starting to check reachability of 26 error locations. [2025-03-04 07:26:11,021 INFO L276 IsEmpty]: Start isEmpty. Operand has 77 states, 46 states have (on average 1.8695652173913044) internal successors, (86), 72 states have internal predecessors, (86), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-03-04 07:26:11,024 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2025-03-04 07:26:11,024 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 07:26:11,025 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2025-03-04 07:26:11,025 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr23REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 23 more)] === [2025-03-04 07:26:11,029 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:26:11,029 INFO L85 PathProgramCache]: Analyzing trace with hash 3508350, now seen corresponding path program 1 times [2025-03-04 07:26:11,035 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 07:26:11,036 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [643614100] [2025-03-04 07:26:11,036 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:26:11,037 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 07:26:11,092 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-03-04 07:26:11,106 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-03-04 07:26:11,107 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:26:11,107 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:26:11,195 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 07:26:11,195 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 07:26:11,196 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [643614100] [2025-03-04 07:26:11,196 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [643614100] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 07:26:11,196 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 07:26:11,197 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 07:26:11,197 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1231973566] [2025-03-04 07:26:11,198 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 07:26:11,200 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 07:26:11,200 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 07:26:11,215 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 07:26:11,215 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 07:26:11,217 INFO L87 Difference]: Start difference. First operand has 77 states, 46 states have (on average 1.8695652173913044) internal successors, (86), 72 states have internal predecessors, (86), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 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 07:26:11,299 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 07:26:11,299 INFO L93 Difference]: Finished difference Result 69 states and 82 transitions. [2025-03-04 07:26:11,300 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 07:26:11,301 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 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) Word has length 4 [2025-03-04 07:26:11,301 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 07:26:11,306 INFO L225 Difference]: With dead ends: 69 [2025-03-04 07:26:11,309 INFO L226 Difference]: Without dead ends: 67 [2025-03-04 07:26:11,310 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 07:26:11,316 INFO L435 NwaCegarLoop]: 54 mSDtfsCounter, 54 mSDsluCounter, 8 mSDsCounter, 0 mSdLazyCounter, 42 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 57 SdHoareTripleChecker+Valid, 62 SdHoareTripleChecker+Invalid, 49 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 42 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 07:26:11,317 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [57 Valid, 62 Invalid, 49 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 42 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 07:26:11,325 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2025-03-04 07:26:11,340 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 67. [2025-03-04 07:26:11,341 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 67 states, 44 states have (on average 1.6818181818181819) internal successors, (74), 62 states have internal predecessors, (74), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-03-04 07:26:11,345 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 80 transitions. [2025-03-04 07:26:11,347 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 80 transitions. Word has length 4 [2025-03-04 07:26:11,347 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 07:26:11,347 INFO L471 AbstractCegarLoop]: Abstraction has 67 states and 80 transitions. [2025-03-04 07:26:11,348 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 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 07:26:11,348 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 80 transitions. [2025-03-04 07:26:11,348 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2025-03-04 07:26:11,349 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 07:26:11,349 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2025-03-04 07:26:11,349 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-04 07:26:11,349 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr24REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 23 more)] === [2025-03-04 07:26:11,350 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:26:11,351 INFO L85 PathProgramCache]: Analyzing trace with hash 3508351, now seen corresponding path program 1 times [2025-03-04 07:26:11,351 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 07:26:11,351 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [900180534] [2025-03-04 07:26:11,351 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:26:11,351 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 07:26:11,356 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-03-04 07:26:11,361 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-03-04 07:26:11,361 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:26:11,361 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:26:11,448 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 07:26:11,448 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 07:26:11,448 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [900180534] [2025-03-04 07:26:11,448 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [900180534] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 07:26:11,448 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 07:26:11,448 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 07:26:11,448 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [680911705] [2025-03-04 07:26:11,449 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 07:26:11,449 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 07:26:11,449 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 07:26:11,450 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 07:26:11,450 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 07:26:11,450 INFO L87 Difference]: Start difference. First operand 67 states and 80 transitions. Second operand has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 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 07:26:11,529 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 07:26:11,530 INFO L93 Difference]: Finished difference Result 70 states and 83 transitions. [2025-03-04 07:26:11,530 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 07:26:11,530 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 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) Word has length 4 [2025-03-04 07:26:11,530 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 07:26:11,530 INFO L225 Difference]: With dead ends: 70 [2025-03-04 07:26:11,531 INFO L226 Difference]: Without dead ends: 70 [2025-03-04 07:26:11,531 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 07:26:11,531 INFO L435 NwaCegarLoop]: 77 mSDtfsCounter, 1 mSDsluCounter, 38 mSDsCounter, 0 mSdLazyCounter, 44 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 115 SdHoareTripleChecker+Invalid, 45 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 44 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 07:26:11,531 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 115 Invalid, 45 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 44 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 07:26:11,532 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2025-03-04 07:26:11,535 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 69. [2025-03-04 07:26:11,536 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 69 states, 46 states have (on average 1.6521739130434783) internal successors, (76), 64 states have internal predecessors, (76), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-03-04 07:26:11,537 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 82 transitions. [2025-03-04 07:26:11,537 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 82 transitions. Word has length 4 [2025-03-04 07:26:11,537 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 07:26:11,537 INFO L471 AbstractCegarLoop]: Abstraction has 69 states and 82 transitions. [2025-03-04 07:26:11,537 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 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 07:26:11,537 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 82 transitions. [2025-03-04 07:26:11,538 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2025-03-04 07:26:11,538 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 07:26:11,538 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1] [2025-03-04 07:26:11,538 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-04 07:26:11,538 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr24REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 23 more)] === [2025-03-04 07:26:11,538 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:26:11,538 INFO L85 PathProgramCache]: Analyzing trace with hash 1438087536, now seen corresponding path program 1 times [2025-03-04 07:26:11,538 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 07:26:11,538 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [353292061] [2025-03-04 07:26:11,538 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:26:11,539 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 07:26:11,545 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-03-04 07:26:11,551 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-03-04 07:26:11,552 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:26:11,552 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:26:11,690 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 07:26:11,691 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 07:26:11,691 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [353292061] [2025-03-04 07:26:11,691 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [353292061] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 07:26:11,691 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [287776966] [2025-03-04 07:26:11,691 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:26:11,691 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 07:26:11,691 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 07:26:11,694 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 07:26:11,695 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 07:26:11,731 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-03-04 07:26:11,738 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-03-04 07:26:11,738 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:26:11,738 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:26:11,739 INFO L256 TraceCheckSpWp]: Trace formula consists of 51 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-03-04 07:26:11,742 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 07:26:11,788 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2025-03-04 07:26:11,837 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 07:26:11,838 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 07:26:11,892 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 07:26:11,892 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [287776966] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 07:26:11,892 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 07:26:11,893 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 3, 3] total 8 [2025-03-04 07:26:11,893 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1967712903] [2025-03-04 07:26:11,893 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 07:26:11,893 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-04 07:26:11,893 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 07:26:11,893 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-04 07:26:11,894 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2025-03-04 07:26:11,894 INFO L87 Difference]: Start difference. First operand 69 states and 82 transitions. Second operand has 9 states, 8 states have (on average 2.375) internal successors, (19), 9 states have internal predecessors, (19), 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 07:26:12,110 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 07:26:12,110 INFO L93 Difference]: Finished difference Result 101 states and 130 transitions. [2025-03-04 07:26:12,111 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-04 07:26:12,111 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 2.375) internal successors, (19), 9 states have internal predecessors, (19), 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) Word has length 7 [2025-03-04 07:26:12,111 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 07:26:12,112 INFO L225 Difference]: With dead ends: 101 [2025-03-04 07:26:12,112 INFO L226 Difference]: Without dead ends: 101 [2025-03-04 07:26:12,112 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=38, Invalid=72, Unknown=0, NotChecked=0, Total=110 [2025-03-04 07:26:12,113 INFO L435 NwaCegarLoop]: 72 mSDtfsCounter, 55 mSDsluCounter, 138 mSDsCounter, 0 mSdLazyCounter, 252 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 59 SdHoareTripleChecker+Valid, 210 SdHoareTripleChecker+Invalid, 285 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 252 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-04 07:26:12,113 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [59 Valid, 210 Invalid, 285 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 252 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-04 07:26:12,114 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2025-03-04 07:26:12,117 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 101. [2025-03-04 07:26:12,118 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 101 states, 76 states have (on average 1.5526315789473684) internal successors, (118), 93 states have internal predecessors, (118), 6 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2025-03-04 07:26:12,119 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 130 transitions. [2025-03-04 07:26:12,119 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 130 transitions. Word has length 7 [2025-03-04 07:26:12,119 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 07:26:12,119 INFO L471 AbstractCegarLoop]: Abstraction has 101 states and 130 transitions. [2025-03-04 07:26:12,119 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 2.375) internal successors, (19), 9 states have internal predecessors, (19), 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 07:26:12,119 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 130 transitions. [2025-03-04 07:26:12,119 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2025-03-04 07:26:12,119 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 07:26:12,120 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1] [2025-03-04 07:26:12,126 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-03-04 07:26:12,320 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 07:26:12,320 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr17REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 23 more)] === [2025-03-04 07:26:12,324 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:26:12,324 INFO L85 PathProgramCache]: Analyzing trace with hash -1991012462, now seen corresponding path program 1 times [2025-03-04 07:26:12,324 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 07:26:12,324 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1410772751] [2025-03-04 07:26:12,324 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:26:12,324 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 07:26:12,332 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-03-04 07:26:12,337 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-03-04 07:26:12,337 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:26:12,337 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:26:12,385 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2025-03-04 07:26:12,386 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 07:26:12,386 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1410772751] [2025-03-04 07:26:12,386 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1410772751] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 07:26:12,386 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 07:26:12,386 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 07:26:12,387 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [714092813] [2025-03-04 07:26:12,387 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 07:26:12,387 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 07:26:12,387 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 07:26:12,387 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 07:26:12,387 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 07:26:12,387 INFO L87 Difference]: Start difference. First operand 101 states and 130 transitions. Second operand has 3 states, 2 states have (on average 4.5) internal successors, (9), 3 states have internal predecessors, (9), 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 07:26:12,416 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 07:26:12,416 INFO L93 Difference]: Finished difference Result 98 states and 127 transitions. [2025-03-04 07:26:12,416 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 07:26:12,416 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 4.5) internal successors, (9), 3 states have internal predecessors, (9), 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) Word has length 18 [2025-03-04 07:26:12,416 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 07:26:12,417 INFO L225 Difference]: With dead ends: 98 [2025-03-04 07:26:12,417 INFO L226 Difference]: Without dead ends: 98 [2025-03-04 07:26:12,417 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 07:26:12,417 INFO L435 NwaCegarLoop]: 61 mSDtfsCounter, 42 mSDsluCounter, 18 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 44 SdHoareTripleChecker+Valid, 79 SdHoareTripleChecker+Invalid, 29 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 27 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 07:26:12,417 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [44 Valid, 79 Invalid, 29 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 07:26:12,418 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2025-03-04 07:26:12,423 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 98. [2025-03-04 07:26:12,426 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 98 states, 76 states have (on average 1.513157894736842) internal successors, (115), 90 states have internal predecessors, (115), 6 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2025-03-04 07:26:12,428 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 127 transitions. [2025-03-04 07:26:12,428 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 127 transitions. Word has length 18 [2025-03-04 07:26:12,428 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 07:26:12,428 INFO L471 AbstractCegarLoop]: Abstraction has 98 states and 127 transitions. [2025-03-04 07:26:12,428 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 4.5) internal successors, (9), 3 states have internal predecessors, (9), 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 07:26:12,428 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 127 transitions. [2025-03-04 07:26:12,428 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2025-03-04 07:26:12,429 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 07:26:12,429 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1] [2025-03-04 07:26:12,429 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-04 07:26:12,429 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr18REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 23 more)] === [2025-03-04 07:26:12,430 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:26:12,430 INFO L85 PathProgramCache]: Analyzing trace with hash -1991012461, now seen corresponding path program 1 times [2025-03-04 07:26:12,430 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 07:26:12,430 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1256619512] [2025-03-04 07:26:12,430 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:26:12,430 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 07:26:12,440 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-03-04 07:26:12,452 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-03-04 07:26:12,452 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:26:12,452 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:26:12,538 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 07:26:12,538 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 07:26:12,538 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1256619512] [2025-03-04 07:26:12,538 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1256619512] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 07:26:12,538 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1540748644] [2025-03-04 07:26:12,538 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:26:12,539 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 07:26:12,539 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 07:26:12,542 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 07:26:12,543 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 07:26:12,577 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-03-04 07:26:12,588 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-03-04 07:26:12,588 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:26:12,588 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:26:12,589 INFO L256 TraceCheckSpWp]: Trace formula consists of 108 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-04 07:26:12,590 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 07:26:12,621 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 07:26:12,621 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 07:26:12,690 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 07:26:12,690 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1540748644] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 07:26:12,690 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 07:26:12,690 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 13 [2025-03-04 07:26:12,690 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1670439885] [2025-03-04 07:26:12,690 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 07:26:12,691 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-03-04 07:26:12,691 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 07:26:12,691 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-03-04 07:26:12,691 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2025-03-04 07:26:12,692 INFO L87 Difference]: Start difference. First operand 98 states and 127 transitions. Second operand has 13 states, 13 states have (on average 2.769230769230769) internal successors, (36), 13 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 07:26:12,957 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 07:26:12,957 INFO L93 Difference]: Finished difference Result 359 states and 517 transitions. [2025-03-04 07:26:12,958 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-04 07:26:12,958 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 2.769230769230769) internal successors, (36), 13 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2025-03-04 07:26:12,958 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 07:26:12,962 INFO L225 Difference]: With dead ends: 359 [2025-03-04 07:26:12,963 INFO L226 Difference]: Without dead ends: 359 [2025-03-04 07:26:12,963 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2025-03-04 07:26:12,964 INFO L435 NwaCegarLoop]: 68 mSDtfsCounter, 250 mSDsluCounter, 428 mSDsCounter, 0 mSdLazyCounter, 234 mSolverCounterSat, 50 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 280 SdHoareTripleChecker+Valid, 496 SdHoareTripleChecker+Invalid, 284 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 50 IncrementalHoareTripleChecker+Valid, 234 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-04 07:26:12,966 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [280 Valid, 496 Invalid, 284 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [50 Valid, 234 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-04 07:26:12,967 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 359 states. [2025-03-04 07:26:12,978 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 359 to 116. [2025-03-04 07:26:12,978 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 116 states, 94 states have (on average 1.4148936170212767) internal successors, (133), 108 states have internal predecessors, (133), 6 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2025-03-04 07:26:12,979 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116 states to 116 states and 145 transitions. [2025-03-04 07:26:12,979 INFO L78 Accepts]: Start accepts. Automaton has 116 states and 145 transitions. Word has length 18 [2025-03-04 07:26:12,979 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 07:26:12,979 INFO L471 AbstractCegarLoop]: Abstraction has 116 states and 145 transitions. [2025-03-04 07:26:12,980 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 2.769230769230769) internal successors, (36), 13 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 07:26:12,980 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 145 transitions. [2025-03-04 07:26:12,980 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2025-03-04 07:26:12,980 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 07:26:12,980 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 1, 1, 1, 1, 1, 1] [2025-03-04 07:26:12,988 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-03-04 07:26:13,184 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 07:26:13,185 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr18REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 23 more)] === [2025-03-04 07:26:13,185 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:26:13,185 INFO L85 PathProgramCache]: Analyzing trace with hash -788829517, now seen corresponding path program 2 times [2025-03-04 07:26:13,185 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 07:26:13,185 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1880212432] [2025-03-04 07:26:13,186 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 07:26:13,186 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 07:26:13,197 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 36 statements into 2 equivalence classes. [2025-03-04 07:26:13,200 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 6 of 36 statements. [2025-03-04 07:26:13,200 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-04 07:26:13,200 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:26:13,244 INFO L134 CoverageAnalysis]: Checked inductivity of 145 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2025-03-04 07:26:13,244 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 07:26:13,244 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1880212432] [2025-03-04 07:26:13,244 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1880212432] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 07:26:13,244 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 07:26:13,244 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 07:26:13,245 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [168053751] [2025-03-04 07:26:13,245 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 07:26:13,245 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 07:26:13,245 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 07:26:13,245 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 07:26:13,245 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 07:26:13,245 INFO L87 Difference]: Start difference. First operand 116 states and 145 transitions. Second operand has 3 states, 2 states have (on average 4.5) internal successors, (9), 3 states have internal predecessors, (9), 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 07:26:13,284 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 07:26:13,284 INFO L93 Difference]: Finished difference Result 119 states and 148 transitions. [2025-03-04 07:26:13,284 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 07:26:13,285 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 4.5) internal successors, (9), 3 states have internal predecessors, (9), 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) Word has length 36 [2025-03-04 07:26:13,285 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 07:26:13,285 INFO L225 Difference]: With dead ends: 119 [2025-03-04 07:26:13,285 INFO L226 Difference]: Without dead ends: 119 [2025-03-04 07:26:13,285 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 07:26:13,286 INFO L435 NwaCegarLoop]: 73 mSDtfsCounter, 1 mSDsluCounter, 43 mSDsCounter, 0 mSdLazyCounter, 35 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 116 SdHoareTripleChecker+Invalid, 36 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 35 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 07:26:13,286 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 116 Invalid, 36 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 35 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 07:26:13,287 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2025-03-04 07:26:13,289 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 118. [2025-03-04 07:26:13,290 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 118 states, 96 states have (on average 1.40625) internal successors, (135), 110 states have internal predecessors, (135), 6 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2025-03-04 07:26:13,290 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118 states to 118 states and 147 transitions. [2025-03-04 07:26:13,290 INFO L78 Accepts]: Start accepts. Automaton has 118 states and 147 transitions. Word has length 36 [2025-03-04 07:26:13,290 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 07:26:13,290 INFO L471 AbstractCegarLoop]: Abstraction has 118 states and 147 transitions. [2025-03-04 07:26:13,290 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 4.5) internal successors, (9), 3 states have internal predecessors, (9), 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 07:26:13,290 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 147 transitions. [2025-03-04 07:26:13,291 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2025-03-04 07:26:13,291 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 07:26:13,291 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 07:26:13,291 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-04 07:26:13,291 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr20REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 23 more)] === [2025-03-04 07:26:13,291 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:26:13,291 INFO L85 PathProgramCache]: Analyzing trace with hash 1316427371, now seen corresponding path program 1 times [2025-03-04 07:26:13,291 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 07:26:13,292 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1549355792] [2025-03-04 07:26:13,292 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:26:13,292 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 07:26:13,301 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 37 statements into 1 equivalence classes. [2025-03-04 07:26:13,307 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 37 of 37 statements. [2025-03-04 07:26:13,307 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:26:13,307 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:26:13,356 INFO L134 CoverageAnalysis]: Checked inductivity of 145 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2025-03-04 07:26:13,356 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 07:26:13,356 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1549355792] [2025-03-04 07:26:13,356 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1549355792] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 07:26:13,356 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 07:26:13,357 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 07:26:13,357 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1567226093] [2025-03-04 07:26:13,357 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 07:26:13,357 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 07:26:13,357 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 07:26:13,357 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 07:26:13,357 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-04 07:26:13,358 INFO L87 Difference]: Start difference. First operand 118 states and 147 transitions. Second operand has 4 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 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 07:26:13,381 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 07:26:13,381 INFO L93 Difference]: Finished difference Result 107 states and 123 transitions. [2025-03-04 07:26:13,382 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 07:26:13,382 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 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) Word has length 37 [2025-03-04 07:26:13,382 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 07:26:13,382 INFO L225 Difference]: With dead ends: 107 [2025-03-04 07:26:13,383 INFO L226 Difference]: Without dead ends: 107 [2025-03-04 07:26:13,383 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-04 07:26:13,383 INFO L435 NwaCegarLoop]: 58 mSDtfsCounter, 27 mSDsluCounter, 64 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 122 SdHoareTripleChecker+Invalid, 30 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 07:26:13,383 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [27 Valid, 122 Invalid, 30 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 07:26:13,384 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2025-03-04 07:26:13,385 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 101. [2025-03-04 07:26:13,386 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 101 states, 85 states have (on average 1.3647058823529412) internal successors, (116), 97 states have internal predecessors, (116), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-04 07:26:13,386 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 120 transitions. [2025-03-04 07:26:13,386 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 120 transitions. Word has length 37 [2025-03-04 07:26:13,386 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 07:26:13,387 INFO L471 AbstractCegarLoop]: Abstraction has 101 states and 120 transitions. [2025-03-04 07:26:13,387 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 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 07:26:13,387 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 120 transitions. [2025-03-04 07:26:13,388 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2025-03-04 07:26:13,388 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 07:26:13,388 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 2, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 07:26:13,388 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-04 07:26:13,388 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr18REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 23 more)] === [2025-03-04 07:26:13,388 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:26:13,388 INFO L85 PathProgramCache]: Analyzing trace with hash 2040902890, now seen corresponding path program 1 times [2025-03-04 07:26:13,388 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 07:26:13,388 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2052490691] [2025-03-04 07:26:13,388 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:26:13,388 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 07:26:13,399 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 39 statements into 1 equivalence classes. [2025-03-04 07:26:13,406 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 39 of 39 statements. [2025-03-04 07:26:13,407 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:26:13,407 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:26:13,586 INFO L134 CoverageAnalysis]: Checked inductivity of 147 backedges. 0 proven. 145 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-04 07:26:13,586 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 07:26:13,586 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2052490691] [2025-03-04 07:26:13,586 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2052490691] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 07:26:13,586 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [552866887] [2025-03-04 07:26:13,586 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:26:13,586 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 07:26:13,586 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 07:26:13,588 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 07:26:13,589 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 07:26:13,632 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 39 statements into 1 equivalence classes. [2025-03-04 07:26:13,653 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 39 of 39 statements. [2025-03-04 07:26:13,654 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:26:13,654 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:26:13,655 INFO L256 TraceCheckSpWp]: Trace formula consists of 199 conjuncts, 12 conjuncts are in the unsatisfiable core [2025-03-04 07:26:13,656 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 07:26:13,706 INFO L134 CoverageAnalysis]: Checked inductivity of 147 backedges. 0 proven. 145 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-04 07:26:13,706 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 07:26:13,891 INFO L134 CoverageAnalysis]: Checked inductivity of 147 backedges. 0 proven. 145 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-04 07:26:13,891 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [552866887] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 07:26:13,891 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 07:26:13,891 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 13] total 25 [2025-03-04 07:26:13,891 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [739507049] [2025-03-04 07:26:13,891 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 07:26:13,891 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2025-03-04 07:26:13,892 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 07:26:13,892 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2025-03-04 07:26:13,892 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=300, Invalid=300, Unknown=0, NotChecked=0, Total=600 [2025-03-04 07:26:13,892 INFO L87 Difference]: Start difference. First operand 101 states and 120 transitions. Second operand has 25 states, 25 states have (on average 2.96) internal successors, (74), 25 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 07:26:14,229 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 07:26:14,229 INFO L93 Difference]: Finished difference Result 533 states and 772 transitions. [2025-03-04 07:26:14,231 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2025-03-04 07:26:14,231 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 25 states have (on average 2.96) internal successors, (74), 25 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 39 [2025-03-04 07:26:14,231 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 07:26:14,233 INFO L225 Difference]: With dead ends: 533 [2025-03-04 07:26:14,233 INFO L226 Difference]: Without dead ends: 533 [2025-03-04 07:26:14,233 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 89 GetRequests, 66 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=300, Invalid=300, Unknown=0, NotChecked=0, Total=600 [2025-03-04 07:26:14,234 INFO L435 NwaCegarLoop]: 58 mSDtfsCounter, 508 mSDsluCounter, 480 mSDsCounter, 0 mSdLazyCounter, 318 mSolverCounterSat, 112 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 552 SdHoareTripleChecker+Valid, 538 SdHoareTripleChecker+Invalid, 430 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 112 IncrementalHoareTripleChecker+Valid, 318 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-04 07:26:14,234 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [552 Valid, 538 Invalid, 430 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [112 Valid, 318 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-04 07:26:14,237 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 533 states. [2025-03-04 07:26:14,253 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 533 to 137. [2025-03-04 07:26:14,254 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 137 states, 121 states have (on average 1.256198347107438) internal successors, (152), 133 states have internal predecessors, (152), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-04 07:26:14,254 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 137 states to 137 states and 156 transitions. [2025-03-04 07:26:14,254 INFO L78 Accepts]: Start accepts. Automaton has 137 states and 156 transitions. Word has length 39 [2025-03-04 07:26:14,255 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 07:26:14,255 INFO L471 AbstractCegarLoop]: Abstraction has 137 states and 156 transitions. [2025-03-04 07:26:14,255 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 25 states have (on average 2.96) internal successors, (74), 25 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 07:26:14,255 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 156 transitions. [2025-03-04 07:26:14,258 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2025-03-04 07:26:14,258 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 07:26:14,259 INFO L218 NwaCegarLoop]: trace histogram [22, 22, 22, 2, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 07:26:14,265 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 07:26:14,459 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 07:26:14,459 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr18REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 23 more)] === [2025-03-04 07:26:14,460 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:26:14,460 INFO L85 PathProgramCache]: Analyzing trace with hash 50458282, now seen corresponding path program 2 times [2025-03-04 07:26:14,460 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 07:26:14,460 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [306293875] [2025-03-04 07:26:14,460 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 07:26:14,460 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 07:26:14,492 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 75 statements into 2 equivalence classes. [2025-03-04 07:26:14,504 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 75 of 75 statements. [2025-03-04 07:26:14,504 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 07:26:14,505 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:26:14,706 INFO L134 CoverageAnalysis]: Checked inductivity of 717 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 715 trivial. 0 not checked. [2025-03-04 07:26:14,707 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 07:26:14,707 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [306293875] [2025-03-04 07:26:14,707 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [306293875] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 07:26:14,707 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [947270849] [2025-03-04 07:26:14,707 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 07:26:14,707 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 07:26:14,707 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 07:26:14,709 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 07:26:14,711 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 07:26:14,756 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 75 statements into 2 equivalence classes. [2025-03-04 07:26:14,787 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 75 of 75 statements. [2025-03-04 07:26:14,787 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 07:26:14,787 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:26:14,789 INFO L256 TraceCheckSpWp]: Trace formula consists of 355 conjuncts, 24 conjuncts are in the unsatisfiable core [2025-03-04 07:26:14,791 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 07:26:15,121 INFO L134 CoverageAnalysis]: Checked inductivity of 717 backedges. 0 proven. 715 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-04 07:26:15,121 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 07:26:15,762 INFO L134 CoverageAnalysis]: Checked inductivity of 717 backedges. 0 proven. 715 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-04 07:26:15,762 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [947270849] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 07:26:15,762 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 07:26:15,762 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 25, 25] total 51 [2025-03-04 07:26:15,763 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [796305299] [2025-03-04 07:26:15,763 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 07:26:15,763 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 51 states [2025-03-04 07:26:15,763 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 07:26:15,764 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 51 interpolants. [2025-03-04 07:26:15,765 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1137, Invalid=1413, Unknown=0, NotChecked=0, Total=2550 [2025-03-04 07:26:15,765 INFO L87 Difference]: Start difference. First operand 137 states and 156 transitions. Second operand has 51 states, 51 states have (on average 3.0) internal successors, (153), 51 states have internal predecessors, (153), 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 07:26:19,799 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 07:26:19,800 INFO L93 Difference]: Finished difference Result 1482 states and 2197 transitions. [2025-03-04 07:26:19,800 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 143 states. [2025-03-04 07:26:19,801 INFO L78 Accepts]: Start accepts. Automaton has has 51 states, 51 states have (on average 3.0) internal successors, (153), 51 states have internal predecessors, (153), 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) Word has length 75 [2025-03-04 07:26:19,801 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 07:26:19,808 INFO L225 Difference]: With dead ends: 1482 [2025-03-04 07:26:19,808 INFO L226 Difference]: Without dead ends: 1482 [2025-03-04 07:26:19,814 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 244 GetRequests, 103 SyntacticMatches, 0 SemanticMatches, 141 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4786 ImplicationChecksByTransitivity, 3.2s TimeCoverageRelationStatistics Valid=6864, Invalid=13442, Unknown=0, NotChecked=0, Total=20306 [2025-03-04 07:26:19,816 INFO L435 NwaCegarLoop]: 37 mSDtfsCounter, 3751 mSDsluCounter, 461 mSDsCounter, 0 mSdLazyCounter, 782 mSolverCounterSat, 888 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3799 SdHoareTripleChecker+Valid, 498 SdHoareTripleChecker+Invalid, 1670 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 888 IncrementalHoareTripleChecker+Valid, 782 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2025-03-04 07:26:19,816 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3799 Valid, 498 Invalid, 1670 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [888 Valid, 782 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2025-03-04 07:26:19,821 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1482 states. [2025-03-04 07:26:19,853 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1482 to 234. [2025-03-04 07:26:19,854 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 234 states, 220 states have (on average 1.1772727272727272) internal successors, (259), 229 states have internal predecessors, (259), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-03-04 07:26:19,855 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 234 states to 234 states and 265 transitions. [2025-03-04 07:26:19,855 INFO L78 Accepts]: Start accepts. Automaton has 234 states and 265 transitions. Word has length 75 [2025-03-04 07:26:19,855 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 07:26:19,855 INFO L471 AbstractCegarLoop]: Abstraction has 234 states and 265 transitions. [2025-03-04 07:26:19,855 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 51 states, 51 states have (on average 3.0) internal successors, (153), 51 states have internal predecessors, (153), 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 07:26:19,855 INFO L276 IsEmpty]: Start isEmpty. Operand 234 states and 265 transitions. [2025-03-04 07:26:19,857 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2025-03-04 07:26:19,858 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 07:26:19,858 INFO L218 NwaCegarLoop]: trace histogram [46, 46, 46, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 07:26:19,864 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 07:26:20,058 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 07:26:20,058 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 23 more)] === [2025-03-04 07:26:20,059 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:26:20,059 INFO L85 PathProgramCache]: Analyzing trace with hash 1083372976, now seen corresponding path program 1 times [2025-03-04 07:26:20,059 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 07:26:20,059 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [511744438] [2025-03-04 07:26:20,059 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:26:20,059 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 07:26:20,077 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 154 statements into 1 equivalence classes. [2025-03-04 07:26:20,098 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 154 of 154 statements. [2025-03-04 07:26:20,101 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:26:20,101 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:26:20,300 INFO L134 CoverageAnalysis]: Checked inductivity of 3156 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3156 trivial. 0 not checked. [2025-03-04 07:26:20,300 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 07:26:20,300 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [511744438] [2025-03-04 07:26:20,300 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [511744438] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 07:26:20,300 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 07:26:20,300 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 07:26:20,300 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [326109007] [2025-03-04 07:26:20,300 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 07:26:20,301 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 07:26:20,301 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 07:26:20,301 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 07:26:20,301 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 07:26:20,301 INFO L87 Difference]: Start difference. First operand 234 states and 265 transitions. Second operand has 4 states, 4 states have (on average 4.0) internal successors, (16), 4 states have internal predecessors, (16), 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 07:26:20,330 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 07:26:20,330 INFO L93 Difference]: Finished difference Result 232 states and 255 transitions. [2025-03-04 07:26:20,330 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 07:26:20,330 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.0) internal successors, (16), 4 states have internal predecessors, (16), 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) Word has length 154 [2025-03-04 07:26:20,330 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 07:26:20,331 INFO L225 Difference]: With dead ends: 232 [2025-03-04 07:26:20,331 INFO L226 Difference]: Without dead ends: 232 [2025-03-04 07:26:20,331 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-04 07:26:20,332 INFO L435 NwaCegarLoop]: 57 mSDtfsCounter, 9 mSDsluCounter, 94 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 151 SdHoareTripleChecker+Invalid, 28 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 28 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 07:26:20,332 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 151 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 07:26:20,332 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 232 states. [2025-03-04 07:26:20,336 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 232 to 230. [2025-03-04 07:26:20,336 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 230 states, 216 states have (on average 1.1435185185185186) internal successors, (247), 225 states have internal predecessors, (247), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-03-04 07:26:20,337 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 230 states to 230 states and 253 transitions. [2025-03-04 07:26:20,337 INFO L78 Accepts]: Start accepts. Automaton has 230 states and 253 transitions. Word has length 154 [2025-03-04 07:26:20,338 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 07:26:20,338 INFO L471 AbstractCegarLoop]: Abstraction has 230 states and 253 transitions. [2025-03-04 07:26:20,338 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.0) internal successors, (16), 4 states have internal predecessors, (16), 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 07:26:20,338 INFO L276 IsEmpty]: Start isEmpty. Operand 230 states and 253 transitions. [2025-03-04 07:26:20,341 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2025-03-04 07:26:20,341 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 07:26:20,341 INFO L218 NwaCegarLoop]: trace histogram [46, 46, 46, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 07:26:20,341 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-04 07:26:20,341 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 23 more)] === [2025-03-04 07:26:20,342 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:26:20,342 INFO L85 PathProgramCache]: Analyzing trace with hash 502852299, now seen corresponding path program 1 times [2025-03-04 07:26:20,342 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 07:26:20,342 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1033821351] [2025-03-04 07:26:20,342 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:26:20,342 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 07:26:20,359 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 158 statements into 1 equivalence classes. [2025-03-04 07:26:20,373 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 158 of 158 statements. [2025-03-04 07:26:20,374 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:26:20,374 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:26:20,469 INFO L134 CoverageAnalysis]: Checked inductivity of 3156 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3156 trivial. 0 not checked. [2025-03-04 07:26:20,469 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 07:26:20,469 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1033821351] [2025-03-04 07:26:20,469 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1033821351] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 07:26:20,469 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 07:26:20,470 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 07:26:20,470 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [453451557] [2025-03-04 07:26:20,470 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 07:26:20,470 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 07:26:20,470 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 07:26:20,470 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 07:26:20,470 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 07:26:20,471 INFO L87 Difference]: Start difference. First operand 230 states and 253 transitions. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 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 07:26:20,475 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 07:26:20,475 INFO L93 Difference]: Finished difference Result 169 states and 171 transitions. [2025-03-04 07:26:20,475 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 07:26:20,476 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 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) Word has length 158 [2025-03-04 07:26:20,476 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 07:26:20,476 INFO L225 Difference]: With dead ends: 169 [2025-03-04 07:26:20,476 INFO L226 Difference]: Without dead ends: 169 [2025-03-04 07:26:20,477 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 07:26:20,477 INFO L435 NwaCegarLoop]: 20 mSDtfsCounter, 0 mSDsluCounter, 37 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 57 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 07:26:20,477 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 57 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 07:26:20,477 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 169 states. [2025-03-04 07:26:20,479 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 169 to 169. [2025-03-04 07:26:20,479 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 169 states, 168 states have (on average 1.0178571428571428) internal successors, (171), 168 states have internal predecessors, (171), 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 07:26:20,480 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 169 states to 169 states and 171 transitions. [2025-03-04 07:26:20,480 INFO L78 Accepts]: Start accepts. Automaton has 169 states and 171 transitions. Word has length 158 [2025-03-04 07:26:20,480 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 07:26:20,480 INFO L471 AbstractCegarLoop]: Abstraction has 169 states and 171 transitions. [2025-03-04 07:26:20,480 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 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 07:26:20,480 INFO L276 IsEmpty]: Start isEmpty. Operand 169 states and 171 transitions. [2025-03-04 07:26:20,481 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2025-03-04 07:26:20,481 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 07:26:20,482 INFO L218 NwaCegarLoop]: trace histogram [46, 46, 46, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 07:26:20,483 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-04 07:26:20,483 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 23 more)] === [2025-03-04 07:26:20,483 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:26:20,484 INFO L85 PathProgramCache]: Analyzing trace with hash -2012957830, now seen corresponding path program 1 times [2025-03-04 07:26:20,484 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 07:26:20,484 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1066643699] [2025-03-04 07:26:20,484 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:26:20,484 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 07:26:20,504 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 168 statements into 1 equivalence classes. [2025-03-04 07:26:20,546 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 168 of 168 statements. [2025-03-04 07:26:20,547 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:26:20,547 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:26:22,285 INFO L134 CoverageAnalysis]: Checked inductivity of 3166 backedges. 0 proven. 3151 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2025-03-04 07:26:22,285 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 07:26:22,285 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1066643699] [2025-03-04 07:26:22,286 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1066643699] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 07:26:22,286 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [492614320] [2025-03-04 07:26:22,286 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:26:22,286 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 07:26:22,286 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 07:26:22,287 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 07:26:22,288 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 07:26:22,365 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 168 statements into 1 equivalence classes. [2025-03-04 07:26:22,430 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 168 of 168 statements. [2025-03-04 07:26:22,430 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:26:22,430 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:26:22,433 INFO L256 TraceCheckSpWp]: Trace formula consists of 769 conjuncts, 48 conjuncts are in the unsatisfiable core [2025-03-04 07:26:22,440 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 07:26:22,613 INFO L134 CoverageAnalysis]: Checked inductivity of 3166 backedges. 0 proven. 3151 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2025-03-04 07:26:22,613 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 07:26:24,449 INFO L134 CoverageAnalysis]: Checked inductivity of 3166 backedges. 0 proven. 3151 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2025-03-04 07:26:24,450 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [492614320] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 07:26:24,450 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 07:26:24,450 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [49, 49, 49] total 97 [2025-03-04 07:26:24,451 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [650106534] [2025-03-04 07:26:24,451 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 07:26:24,452 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 97 states [2025-03-04 07:26:24,452 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 07:26:24,453 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 97 interpolants. [2025-03-04 07:26:24,454 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=4656, Invalid=4656, Unknown=0, NotChecked=0, Total=9312 [2025-03-04 07:26:24,455 INFO L87 Difference]: Start difference. First operand 169 states and 171 transitions. Second operand has 97 states, 97 states have (on average 3.1030927835051547) internal successors, (301), 97 states have internal predecessors, (301), 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 07:26:24,770 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 07:26:24,770 INFO L93 Difference]: Finished difference Result 313 states and 315 transitions. [2025-03-04 07:26:24,770 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 96 states. [2025-03-04 07:26:24,770 INFO L78 Accepts]: Start accepts. Automaton has has 97 states, 97 states have (on average 3.1030927835051547) internal successors, (301), 97 states have internal predecessors, (301), 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) Word has length 168 [2025-03-04 07:26:24,771 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 07:26:24,772 INFO L225 Difference]: With dead ends: 313 [2025-03-04 07:26:24,772 INFO L226 Difference]: Without dead ends: 313 [2025-03-04 07:26:24,773 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 383 GetRequests, 288 SyntacticMatches, 0 SemanticMatches, 95 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 184 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=4656, Invalid=4656, Unknown=0, NotChecked=0, Total=9312 [2025-03-04 07:26:24,774 INFO L435 NwaCegarLoop]: 16 mSDtfsCounter, 4 mSDsluCounter, 120 mSDsCounter, 0 mSdLazyCounter, 319 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 136 SdHoareTripleChecker+Invalid, 330 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 319 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-04 07:26:24,774 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 136 Invalid, 330 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 319 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-04 07:26:24,775 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 313 states. [2025-03-04 07:26:24,777 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 313 to 313. [2025-03-04 07:26:24,777 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 313 states, 312 states have (on average 1.0096153846153846) internal successors, (315), 312 states have internal predecessors, (315), 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 07:26:24,778 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 313 states to 313 states and 315 transitions. [2025-03-04 07:26:24,778 INFO L78 Accepts]: Start accepts. Automaton has 313 states and 315 transitions. Word has length 168 [2025-03-04 07:26:24,778 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 07:26:24,778 INFO L471 AbstractCegarLoop]: Abstraction has 313 states and 315 transitions. [2025-03-04 07:26:24,779 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 97 states, 97 states have (on average 3.1030927835051547) internal successors, (301), 97 states have internal predecessors, (301), 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 07:26:24,779 INFO L276 IsEmpty]: Start isEmpty. Operand 313 states and 315 transitions. [2025-03-04 07:26:24,780 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 313 [2025-03-04 07:26:24,780 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 07:26:24,781 INFO L218 NwaCegarLoop]: trace histogram [94, 94, 94, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 07:26:24,792 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 07:26:24,981 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,SelfDestructingSolverStorable11 [2025-03-04 07:26:24,981 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 23 more)] === [2025-03-04 07:26:24,985 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:26:24,985 INFO L85 PathProgramCache]: Analyzing trace with hash 993258618, now seen corresponding path program 2 times [2025-03-04 07:26:24,985 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 07:26:24,985 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [801288477] [2025-03-04 07:26:24,985 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 07:26:24,985 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 07:26:25,016 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 312 statements into 2 equivalence classes. [2025-03-04 07:26:25,019 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 8 of 312 statements. [2025-03-04 07:26:25,019 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-04 07:26:25,019 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:26:25,092 INFO L134 CoverageAnalysis]: Checked inductivity of 13222 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 13222 trivial. 0 not checked. [2025-03-04 07:26:25,092 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 07:26:25,092 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [801288477] [2025-03-04 07:26:25,092 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [801288477] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 07:26:25,092 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 07:26:25,092 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 07:26:25,092 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1684989881] [2025-03-04 07:26:25,092 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 07:26:25,093 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 07:26:25,093 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 07:26:25,093 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 07:26:25,093 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-04 07:26:25,093 INFO L87 Difference]: Start difference. First operand 313 states and 315 transitions. Second operand has 5 states, 4 states have (on average 5.5) internal successors, (22), 5 states have internal predecessors, (22), 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 07:26:25,107 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 07:26:25,108 INFO L93 Difference]: Finished difference Result 312 states and 314 transitions. [2025-03-04 07:26:25,108 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 07:26:25,108 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 5.5) internal successors, (22), 5 states have internal predecessors, (22), 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) Word has length 312 [2025-03-04 07:26:25,108 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 07:26:25,108 INFO L225 Difference]: With dead ends: 312 [2025-03-04 07:26:25,108 INFO L226 Difference]: Without dead ends: 0 [2025-03-04 07:26:25,108 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-04 07:26:25,109 INFO L435 NwaCegarLoop]: 15 mSDtfsCounter, 0 mSDsluCounter, 26 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 41 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 07:26:25,109 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 41 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 07:26:25,109 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2025-03-04 07:26:25,109 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2025-03-04 07:26:25,109 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 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 07:26:25,109 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2025-03-04 07:26:25,109 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 312 [2025-03-04 07:26:25,109 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 07:26:25,109 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-03-04 07:26:25,109 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 5.5) internal successors, (22), 5 states have internal predecessors, (22), 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 07:26:25,110 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2025-03-04 07:26:25,110 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2025-03-04 07:26:25,111 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (25 of 26 remaining) [2025-03-04 07:26:25,112 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (24 of 26 remaining) [2025-03-04 07:26:25,112 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (23 of 26 remaining) [2025-03-04 07:26:25,112 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (22 of 26 remaining) [2025-03-04 07:26:25,112 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (21 of 26 remaining) [2025-03-04 07:26:25,112 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (20 of 26 remaining) [2025-03-04 07:26:25,112 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (19 of 26 remaining) [2025-03-04 07:26:25,112 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (18 of 26 remaining) [2025-03-04 07:26:25,112 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (17 of 26 remaining) [2025-03-04 07:26:25,112 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (16 of 26 remaining) [2025-03-04 07:26:25,113 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (15 of 26 remaining) [2025-03-04 07:26:25,113 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (14 of 26 remaining) [2025-03-04 07:26:25,113 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (13 of 26 remaining) [2025-03-04 07:26:25,113 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE (12 of 26 remaining) [2025-03-04 07:26:25,113 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE (11 of 26 remaining) [2025-03-04 07:26:25,113 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr15REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 26 remaining) [2025-03-04 07:26:25,113 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr16REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 26 remaining) [2025-03-04 07:26:25,113 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr17REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 26 remaining) [2025-03-04 07:26:25,113 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr18REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 26 remaining) [2025-03-04 07:26:25,113 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr19REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 26 remaining) [2025-03-04 07:26:25,113 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr20REQUIRES_VIOLATIONMEMORY_DEREFERENCE (5 of 26 remaining) [2025-03-04 07:26:25,113 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr21REQUIRES_VIOLATIONMEMORY_DEREFERENCE (4 of 26 remaining) [2025-03-04 07:26:25,113 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr22REQUIRES_VIOLATIONMEMORY_DEREFERENCE (3 of 26 remaining) [2025-03-04 07:26:25,113 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr23REQUIRES_VIOLATIONMEMORY_DEREFERENCE (2 of 26 remaining) [2025-03-04 07:26:25,114 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr24REQUIRES_VIOLATIONMEMORY_DEREFERENCE (1 of 26 remaining) [2025-03-04 07:26:25,114 INFO L782 garLoopResultBuilder]: Registering result SAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONMEMORY_LEAK (0 of 26 remaining) [2025-03-04 07:26:25,114 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-04 07:26:25,116 INFO L422 BasicCegarLoop]: Path program histogram: [2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 07:26:25,117 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-04 07:26:25,123 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 04.03 07:26:25 BoogieIcfgContainer [2025-03-04 07:26:25,123 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-04 07:26:25,124 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-04 07:26:25,124 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-04 07:26:25,124 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-04 07:26:25,124 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 07:26:10" (3/4) ... [2025-03-04 07:26:25,126 INFO L146 WitnessPrinter]: Generating witness for correct program [2025-03-04 07:26:25,130 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure __VERIFIER_assert [2025-03-04 07:26:25,133 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 19 nodes and edges [2025-03-04 07:26:25,134 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 7 nodes and edges [2025-03-04 07:26:25,135 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2025-03-04 07:26:25,135 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2025-03-04 07:26:25,195 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-03-04 07:26:25,195 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2025-03-04 07:26:25,195 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-04 07:26:25,196 INFO L158 Benchmark]: Toolchain (without parser) took 14975.22ms. Allocated memory was 167.8MB in the beginning and 293.6MB in the end (delta: 125.8MB). Free memory was 132.1MB in the beginning and 126.9MB in the end (delta: 5.2MB). Peak memory consumption was 128.4MB. Max. memory is 16.1GB. [2025-03-04 07:26:25,196 INFO L158 Benchmark]: CDTParser took 0.25ms. Allocated memory is still 201.3MB. Free memory is still 126.9MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-04 07:26:25,197 INFO L158 Benchmark]: CACSL2BoogieTranslator took 183.75ms. Allocated memory is still 167.8MB. Free memory was 132.1MB in the beginning and 120.5MB in the end (delta: 11.7MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-04 07:26:25,197 INFO L158 Benchmark]: Boogie Procedure Inliner took 34.94ms. Allocated memory is still 167.8MB. Free memory was 120.5MB in the beginning and 118.8MB in the end (delta: 1.6MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-04 07:26:25,198 INFO L158 Benchmark]: Boogie Preprocessor took 37.57ms. Allocated memory is still 167.8MB. Free memory was 118.8MB in the beginning and 117.2MB in the end (delta: 1.6MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-04 07:26:25,198 INFO L158 Benchmark]: IcfgBuilder took 468.67ms. Allocated memory is still 167.8MB. Free memory was 117.2MB in the beginning and 96.3MB in the end (delta: 20.9MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-03-04 07:26:25,198 INFO L158 Benchmark]: TraceAbstraction took 14169.82ms. Allocated memory was 167.8MB in the beginning and 293.6MB in the end (delta: 125.8MB). Free memory was 95.5MB in the beginning and 133.4MB in the end (delta: -37.9MB). Peak memory consumption was 86.5MB. Max. memory is 16.1GB. [2025-03-04 07:26:25,198 INFO L158 Benchmark]: Witness Printer took 71.57ms. Allocated memory is still 293.6MB. Free memory was 133.4MB in the beginning and 126.9MB in the end (delta: 6.5MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-04 07:26:25,200 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 126.9MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 183.75ms. Allocated memory is still 167.8MB. Free memory was 132.1MB in the beginning and 120.5MB in the end (delta: 11.7MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 34.94ms. Allocated memory is still 167.8MB. Free memory was 120.5MB in the beginning and 118.8MB in the end (delta: 1.6MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 37.57ms. Allocated memory is still 167.8MB. Free memory was 118.8MB in the beginning and 117.2MB in the end (delta: 1.6MB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 468.67ms. Allocated memory is still 167.8MB. Free memory was 117.2MB in the beginning and 96.3MB in the end (delta: 20.9MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 14169.82ms. Allocated memory was 167.8MB in the beginning and 293.6MB in the end (delta: 125.8MB). Free memory was 95.5MB in the beginning and 133.4MB in the end (delta: -37.9MB). Peak memory consumption was 86.5MB. Max. memory is 16.1GB. * Witness Printer took 71.57ms. Allocated memory is still 293.6MB. Free memory was 133.4MB in the beginning and 126.9MB in the end (delta: 6.5MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 27]: 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 - 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: -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: -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: 12]: all allocated memory was freed For all program executions holds that all allocated memory was freed at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 77 locations, 26 error locations. Started 1 CEGAR loops. OverallTime: 14.1s, OverallIterations: 13, TraceHistogramMax: 94, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 5.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 4833 SdHoareTripleChecker+Valid, 2.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 4702 mSDsluCounter, 2621 SdHoareTripleChecker+Invalid, 1.8s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1955 mSDsCounter, 1110 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2136 IncrementalHoareTripleChecker+Invalid, 3246 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 1110 mSolverCounterUnsat, 666 mSDtfsCounter, 2136 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 802 GetRequests, 509 SyntacticMatches, 0 SemanticMatches, 293 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5033 ImplicationChecksByTransitivity, 5.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=313occurred in iteration=12, InterpolantAutomatonStates: 312, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 13 MinimizatonAttempts, 1897 StatesRemovedByMinimization, 7 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 6.5s InterpolantComputationTime, 1337 NumberOfCodeBlocks, 1003 NumberOfCodeBlocksAsserted, 20 NumberOfCheckSat, 1621 ConstructedInterpolants, 0 QuantifiedInterpolants, 7135 SizeOfPredicates, 0 NumberOfNonLiveVariables, 1482 ConjunctsInSsa, 99 ConjunctsInUnsatCore, 23 InterpolantComputations, 8 PerfectInterpolantSequences, 20616/32008 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 26 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2025-03-04 07:26:25,214 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