./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 e2fb8bed Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../sv-benchmarks/c/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-?-e2fb8be-m [2025-03-08 22:38:08,855 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-08 22:38:08,910 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2025-03-08 22:38:08,915 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-08 22:38:08,916 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-08 22:38:08,936 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-08 22:38:08,937 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-08 22:38:08,937 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-08 22:38:08,937 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-08 22:38:08,937 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-08 22:38:08,938 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-08 22:38:08,938 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-08 22:38:08,938 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-08 22:38:08,938 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-08 22:38:08,938 INFO L153 SettingsManager]: * Use SBE=true [2025-03-08 22:38:08,938 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-08 22:38:08,938 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-08 22:38:08,938 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-08 22:38:08,938 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-08 22:38:08,939 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-08 22:38:08,939 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2025-03-08 22:38:08,939 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2025-03-08 22:38:08,939 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2025-03-08 22:38:08,939 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-08 22:38:08,939 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-03-08 22:38:08,939 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-03-08 22:38:08,939 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-08 22:38:08,939 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-08 22:38:08,939 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-08 22:38:08,939 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-08 22:38:08,940 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-08 22:38:08,940 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-08 22:38:08,940 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-08 22:38:08,940 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 22:38:08,940 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-08 22:38:08,940 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-08 22:38:08,940 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-08 22:38:08,940 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-08 22:38:08,940 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-08 22:38:08,940 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-08 22:38:08,940 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-08 22:38:08,940 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-08 22:38:08,941 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-08 22:38:09,137 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-08 22:38:09,146 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-08 22:38:09,147 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-08 22:38:09,148 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-08 22:38:09,149 INFO L274 PluginConnector]: CDTParser initialized [2025-03-08 22:38:09,149 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-08 22:38:10,229 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/76331f1fe/a367d5fd3dc342649896b09eda36d16d/FLAG3855625d1 [2025-03-08 22:38:10,458 INFO L384 CDTParser]: Found 1 translation units. [2025-03-08 22:38:10,459 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/array-examples/data_structures_set_multi_proc_trivial_ground.i [2025-03-08 22:38:10,489 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/76331f1fe/a367d5fd3dc342649896b09eda36d16d/FLAG3855625d1 [2025-03-08 22:38:10,793 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/76331f1fe/a367d5fd3dc342649896b09eda36d16d [2025-03-08 22:38:10,795 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-08 22:38:10,796 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-08 22:38:10,797 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-08 22:38:10,797 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-08 22:38:10,800 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-08 22:38:10,801 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 10:38:10" (1/1) ... [2025-03-08 22:38:10,802 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4022b4a6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:38:10, skipping insertion in model container [2025-03-08 22:38:10,802 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 10:38:10" (1/1) ... [2025-03-08 22:38:10,814 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-08 22:38:10,939 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 22:38:10,949 INFO L200 MainTranslator]: Completed pre-run [2025-03-08 22:38:10,964 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 22:38:10,974 INFO L204 MainTranslator]: Completed translation [2025-03-08 22:38:10,975 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:38:10 WrapperNode [2025-03-08 22:38:10,975 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-08 22:38:10,976 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-08 22:38:10,976 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-08 22:38:10,976 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-08 22:38:10,981 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:38:10" (1/1) ... [2025-03-08 22:38:10,991 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:38:10" (1/1) ... [2025-03-08 22:38:11,004 INFO L138 Inliner]: procedures = 18, calls = 30, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 136 [2025-03-08 22:38:11,005 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-08 22:38:11,005 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-08 22:38:11,005 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-08 22:38:11,005 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-08 22:38:11,011 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:38:10" (1/1) ... [2025-03-08 22:38:11,011 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:38:10" (1/1) ... [2025-03-08 22:38:11,012 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:38:10" (1/1) ... [2025-03-08 22:38:11,021 INFO L175 MemorySlicer]: Split 14 memory accesses to 3 slices as follows [2, 9, 3]. 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, 2, 1]. [2025-03-08 22:38:11,021 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:38:10" (1/1) ... [2025-03-08 22:38:11,021 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:38:10" (1/1) ... [2025-03-08 22:38:11,026 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:38:10" (1/1) ... [2025-03-08 22:38:11,027 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:38:10" (1/1) ... [2025-03-08 22:38:11,031 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:38:10" (1/1) ... [2025-03-08 22:38:11,032 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:38:10" (1/1) ... [2025-03-08 22:38:11,033 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-08 22:38:11,034 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-08 22:38:11,034 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-08 22:38:11,034 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-08 22:38:11,035 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:38:10" (1/1) ... [2025-03-08 22:38:11,038 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 22:38:11,047 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 22:38:11,058 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-08 22:38:11,060 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-08 22:38:11,082 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-08 22:38:11,082 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-08 22:38:11,082 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-03-08 22:38:11,082 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-03-08 22:38:11,083 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-03-08 22:38:11,083 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-03-08 22:38:11,083 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-03-08 22:38:11,083 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2025-03-08 22:38:11,083 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-08 22:38:11,084 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-08 22:38:11,084 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-03-08 22:38:11,084 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-03-08 22:38:11,084 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2025-03-08 22:38:11,084 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2025-03-08 22:38:11,084 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2025-03-08 22:38:11,084 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-03-08 22:38:11,146 INFO L256 CfgBuilder]: Building ICFG [2025-03-08 22:38:11,147 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-08 22:38:11,386 INFO L1307 $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-08 22:38:11,416 INFO L? ?]: Removed 84 outVars from TransFormulas that were not future-live. [2025-03-08 22:38:11,416 INFO L307 CfgBuilder]: Performing block encoding [2025-03-08 22:38:11,432 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-08 22:38:11,432 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-08 22:38:11,433 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 10:38:11 BoogieIcfgContainer [2025-03-08 22:38:11,433 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-08 22:38:11,435 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-08 22:38:11,436 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-08 22:38:11,440 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-08 22:38:11,441 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.03 10:38:10" (1/3) ... [2025-03-08 22:38:11,441 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4e51197e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 10:38:11, skipping insertion in model container [2025-03-08 22:38:11,441 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:38:10" (2/3) ... [2025-03-08 22:38:11,441 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4e51197e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 10:38:11, skipping insertion in model container [2025-03-08 22:38:11,441 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 10:38:11" (3/3) ... [2025-03-08 22:38:11,442 INFO L128 eAbstractionObserver]: Analyzing ICFG data_structures_set_multi_proc_trivial_ground.i [2025-03-08 22:38:11,455 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-08 22:38:11,457 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-08 22:38:11,487 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-08 22:38:11,495 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;@72b50eef, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-08 22:38:11,496 INFO L334 AbstractCegarLoop]: Starting to check reachability of 26 error locations. [2025-03-08 22:38:11,498 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-08 22:38:11,501 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2025-03-08 22:38:11,502 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 22:38:11,503 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2025-03-08 22:38:11,503 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-08 22:38:11,508 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:38:11,508 INFO L85 PathProgramCache]: Analyzing trace with hash 3508350, now seen corresponding path program 1 times [2025-03-08 22:38:11,514 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:38:11,515 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [251033425] [2025-03-08 22:38:11,515 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:38:11,516 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:38:11,567 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-03-08 22:38:11,579 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-03-08 22:38:11,580 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:38:11,580 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:38:11,657 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-08 22:38:11,658 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 22:38:11,658 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [251033425] [2025-03-08 22:38:11,658 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [251033425] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 22:38:11,660 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 22:38:11,660 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-08 22:38:11,662 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [236129549] [2025-03-08 22:38:11,662 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 22:38:11,664 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 22:38:11,665 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 22:38:11,684 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 22:38:11,684 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 22:38:11,686 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-08 22:38:11,771 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 22:38:11,772 INFO L93 Difference]: Finished difference Result 69 states and 82 transitions. [2025-03-08 22:38:11,772 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 22:38:11,773 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-08 22:38:11,773 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 22:38:11,777 INFO L225 Difference]: With dead ends: 69 [2025-03-08 22:38:11,777 INFO L226 Difference]: Without dead ends: 67 [2025-03-08 22:38:11,779 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-08 22:38:11,780 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-08 22:38:11,781 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-08 22:38:11,791 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2025-03-08 22:38:11,802 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 67. [2025-03-08 22:38:11,803 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-08 22:38:11,805 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 80 transitions. [2025-03-08 22:38:11,806 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 80 transitions. Word has length 4 [2025-03-08 22:38:11,806 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 22:38:11,806 INFO L471 AbstractCegarLoop]: Abstraction has 67 states and 80 transitions. [2025-03-08 22:38:11,807 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-08 22:38:11,807 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 80 transitions. [2025-03-08 22:38:11,807 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2025-03-08 22:38:11,807 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 22:38:11,807 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2025-03-08 22:38:11,807 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-08 22:38:11,807 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-08 22:38:11,808 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:38:11,808 INFO L85 PathProgramCache]: Analyzing trace with hash 3508351, now seen corresponding path program 1 times [2025-03-08 22:38:11,808 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:38:11,808 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2041757994] [2025-03-08 22:38:11,808 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:38:11,808 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:38:11,812 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-03-08 22:38:11,817 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-03-08 22:38:11,817 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:38:11,817 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:38:11,923 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-08 22:38:11,924 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 22:38:11,924 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2041757994] [2025-03-08 22:38:11,924 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2041757994] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 22:38:11,924 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 22:38:11,924 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-08 22:38:11,924 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1244079540] [2025-03-08 22:38:11,924 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 22:38:11,925 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 22:38:11,925 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 22:38:11,925 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 22:38:11,925 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 22:38:11,926 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-08 22:38:11,986 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 22:38:11,986 INFO L93 Difference]: Finished difference Result 70 states and 83 transitions. [2025-03-08 22:38:11,986 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 22:38:11,986 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-08 22:38:11,986 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 22:38:11,987 INFO L225 Difference]: With dead ends: 70 [2025-03-08 22:38:11,987 INFO L226 Difference]: Without dead ends: 70 [2025-03-08 22:38:11,987 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-08 22:38:11,988 INFO L435 NwaCegarLoop]: 77 mSDtfsCounter, 1 mSDsluCounter, 38 mSDsCounter, 0 mSdLazyCounter, 44 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s 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-08 22:38:11,988 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-08 22:38:11,988 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2025-03-08 22:38:11,995 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 69. [2025-03-08 22:38:11,995 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-08 22:38:11,996 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 82 transitions. [2025-03-08 22:38:11,996 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 82 transitions. Word has length 4 [2025-03-08 22:38:11,996 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 22:38:11,996 INFO L471 AbstractCegarLoop]: Abstraction has 69 states and 82 transitions. [2025-03-08 22:38:11,997 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-08 22:38:11,997 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 82 transitions. [2025-03-08 22:38:11,997 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2025-03-08 22:38:11,997 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 22:38:11,997 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1] [2025-03-08 22:38:11,997 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-08 22:38:11,997 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-08 22:38:11,998 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:38:11,998 INFO L85 PathProgramCache]: Analyzing trace with hash 1438087536, now seen corresponding path program 1 times [2025-03-08 22:38:11,998 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:38:11,998 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1935127447] [2025-03-08 22:38:11,998 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:38:11,998 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:38:12,005 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-03-08 22:38:12,015 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-03-08 22:38:12,015 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:38:12,015 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:38:12,167 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-08 22:38:12,167 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 22:38:12,167 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1935127447] [2025-03-08 22:38:12,167 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1935127447] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 22:38:12,167 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1871653712] [2025-03-08 22:38:12,167 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:38:12,167 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 22:38:12,168 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 22:38:12,173 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-08 22:38:12,174 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-08 22:38:12,214 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-03-08 22:38:12,222 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-03-08 22:38:12,222 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:38:12,222 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:38:12,223 INFO L256 TraceCheckSpWp]: Trace formula consists of 51 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-03-08 22:38:12,226 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 22:38:12,261 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-08 22:38:12,302 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-08 22:38:12,302 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 22:38:12,352 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-08 22:38:12,352 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1871653712] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 22:38:12,352 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 22:38:12,352 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 3, 3] total 8 [2025-03-08 22:38:12,352 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2002381683] [2025-03-08 22:38:12,352 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 22:38:12,352 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-08 22:38:12,352 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 22:38:12,352 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-08 22:38:12,353 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2025-03-08 22:38:12,353 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-08 22:38:12,595 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 22:38:12,595 INFO L93 Difference]: Finished difference Result 101 states and 130 transitions. [2025-03-08 22:38:12,596 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-08 22:38:12,596 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-08 22:38:12,596 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 22:38:12,597 INFO L225 Difference]: With dead ends: 101 [2025-03-08 22:38:12,597 INFO L226 Difference]: Without dead ends: 101 [2025-03-08 22:38:12,597 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-08 22:38:12,598 INFO L435 NwaCegarLoop]: 72 mSDtfsCounter, 55 mSDsluCounter, 138 mSDsCounter, 0 mSdLazyCounter, 252 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s 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-08 22:38:12,598 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-08 22:38:12,598 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2025-03-08 22:38:12,602 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 101. [2025-03-08 22:38:12,603 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-08 22:38:12,603 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 130 transitions. [2025-03-08 22:38:12,603 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 130 transitions. Word has length 7 [2025-03-08 22:38:12,604 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 22:38:12,604 INFO L471 AbstractCegarLoop]: Abstraction has 101 states and 130 transitions. [2025-03-08 22:38:12,604 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-08 22:38:12,604 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 130 transitions. [2025-03-08 22:38:12,604 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2025-03-08 22:38:12,604 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 22:38:12,604 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1] [2025-03-08 22:38:12,613 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-03-08 22:38:12,811 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-08 22:38:12,811 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-08 22:38:12,811 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:38:12,812 INFO L85 PathProgramCache]: Analyzing trace with hash -1991012462, now seen corresponding path program 1 times [2025-03-08 22:38:12,812 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:38:12,812 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1306929679] [2025-03-08 22:38:12,812 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:38:12,812 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:38:12,820 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-03-08 22:38:12,825 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-03-08 22:38:12,825 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:38:12,825 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:38:12,874 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-08 22:38:12,874 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 22:38:12,874 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1306929679] [2025-03-08 22:38:12,874 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1306929679] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 22:38:12,874 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 22:38:12,874 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-08 22:38:12,874 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2068514261] [2025-03-08 22:38:12,874 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 22:38:12,875 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 22:38:12,875 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 22:38:12,875 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 22:38:12,875 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 22:38:12,875 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-08 22:38:12,904 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 22:38:12,905 INFO L93 Difference]: Finished difference Result 98 states and 127 transitions. [2025-03-08 22:38:12,905 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 22:38:12,905 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-08 22:38:12,905 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 22:38:12,906 INFO L225 Difference]: With dead ends: 98 [2025-03-08 22:38:12,906 INFO L226 Difference]: Without dead ends: 98 [2025-03-08 22:38:12,906 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-08 22:38:12,906 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-08 22:38:12,907 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-08 22:38:12,907 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2025-03-08 22:38:12,910 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 98. [2025-03-08 22:38:12,910 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-08 22:38:12,911 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 127 transitions. [2025-03-08 22:38:12,911 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 127 transitions. Word has length 18 [2025-03-08 22:38:12,911 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 22:38:12,911 INFO L471 AbstractCegarLoop]: Abstraction has 98 states and 127 transitions. [2025-03-08 22:38:12,911 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-08 22:38:12,911 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 127 transitions. [2025-03-08 22:38:12,912 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2025-03-08 22:38:12,912 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 22:38:12,912 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1] [2025-03-08 22:38:12,912 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-08 22:38:12,912 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-08 22:38:12,912 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:38:12,912 INFO L85 PathProgramCache]: Analyzing trace with hash -1991012461, now seen corresponding path program 1 times [2025-03-08 22:38:12,912 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:38:12,913 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2069155273] [2025-03-08 22:38:12,913 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:38:12,913 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:38:12,918 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-03-08 22:38:12,924 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-03-08 22:38:12,924 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:38:12,924 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:38:13,013 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-08 22:38:13,013 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 22:38:13,013 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2069155273] [2025-03-08 22:38:13,013 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2069155273] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 22:38:13,013 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [782834714] [2025-03-08 22:38:13,013 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:38:13,013 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 22:38:13,013 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 22:38:13,030 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-08 22:38:13,035 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-08 22:38:13,069 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-03-08 22:38:13,081 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-03-08 22:38:13,081 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:38:13,081 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:38:13,082 INFO L256 TraceCheckSpWp]: Trace formula consists of 108 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-08 22:38:13,083 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 22:38:13,105 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-08 22:38:13,106 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 22:38:13,159 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-08 22:38:13,159 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [782834714] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 22:38:13,159 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 22:38:13,159 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 13 [2025-03-08 22:38:13,160 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [353756023] [2025-03-08 22:38:13,160 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 22:38:13,160 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-03-08 22:38:13,160 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 22:38:13,160 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-03-08 22:38:13,160 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2025-03-08 22:38:13,161 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-08 22:38:13,413 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 22:38:13,413 INFO L93 Difference]: Finished difference Result 359 states and 517 transitions. [2025-03-08 22:38:13,414 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-08 22:38:13,414 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-08 22:38:13,414 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 22:38:13,416 INFO L225 Difference]: With dead ends: 359 [2025-03-08 22:38:13,416 INFO L226 Difference]: Without dead ends: 359 [2025-03-08 22:38:13,416 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-08 22:38:13,416 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-08 22:38:13,416 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-08 22:38:13,417 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 359 states. [2025-03-08 22:38:13,430 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 359 to 116. [2025-03-08 22:38:13,432 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-08 22:38:13,433 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116 states to 116 states and 145 transitions. [2025-03-08 22:38:13,433 INFO L78 Accepts]: Start accepts. Automaton has 116 states and 145 transitions. Word has length 18 [2025-03-08 22:38:13,433 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 22:38:13,433 INFO L471 AbstractCegarLoop]: Abstraction has 116 states and 145 transitions. [2025-03-08 22:38:13,433 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-08 22:38:13,433 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 145 transitions. [2025-03-08 22:38:13,436 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2025-03-08 22:38:13,436 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 22:38:13,436 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 1, 1, 1, 1, 1, 1] [2025-03-08 22:38:13,443 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-03-08 22:38:13,637 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-08 22:38:13,637 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-08 22:38:13,638 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:38:13,638 INFO L85 PathProgramCache]: Analyzing trace with hash -788829517, now seen corresponding path program 2 times [2025-03-08 22:38:13,638 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:38:13,638 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [123639191] [2025-03-08 22:38:13,638 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-08 22:38:13,638 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:38:13,648 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 36 statements into 2 equivalence classes. [2025-03-08 22:38:13,651 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 6 of 36 statements. [2025-03-08 22:38:13,651 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-08 22:38:13,651 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:38:13,690 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-08 22:38:13,690 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 22:38:13,690 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [123639191] [2025-03-08 22:38:13,691 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [123639191] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 22:38:13,691 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 22:38:13,691 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-08 22:38:13,691 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2028204976] [2025-03-08 22:38:13,691 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 22:38:13,691 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 22:38:13,691 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 22:38:13,692 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 22:38:13,692 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 22:38:13,692 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-08 22:38:13,728 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 22:38:13,728 INFO L93 Difference]: Finished difference Result 119 states and 148 transitions. [2025-03-08 22:38:13,728 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 22:38:13,729 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-08 22:38:13,729 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 22:38:13,729 INFO L225 Difference]: With dead ends: 119 [2025-03-08 22:38:13,729 INFO L226 Difference]: Without dead ends: 119 [2025-03-08 22:38:13,730 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-08 22:38:13,730 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-08 22:38:13,730 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-08 22:38:13,731 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2025-03-08 22:38:13,736 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 118. [2025-03-08 22:38:13,736 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-08 22:38:13,737 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118 states to 118 states and 147 transitions. [2025-03-08 22:38:13,737 INFO L78 Accepts]: Start accepts. Automaton has 118 states and 147 transitions. Word has length 36 [2025-03-08 22:38:13,737 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 22:38:13,737 INFO L471 AbstractCegarLoop]: Abstraction has 118 states and 147 transitions. [2025-03-08 22:38:13,737 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-08 22:38:13,737 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 147 transitions. [2025-03-08 22:38:13,738 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2025-03-08 22:38:13,738 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 22:38:13,738 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 22:38:13,738 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-08 22:38:13,739 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-08 22:38:13,739 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:38:13,739 INFO L85 PathProgramCache]: Analyzing trace with hash 1316427371, now seen corresponding path program 1 times [2025-03-08 22:38:13,739 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:38:13,739 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [364328100] [2025-03-08 22:38:13,739 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:38:13,739 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:38:13,751 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 37 statements into 1 equivalence classes. [2025-03-08 22:38:13,764 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 37 of 37 statements. [2025-03-08 22:38:13,768 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:38:13,769 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:38:13,854 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-08 22:38:13,855 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 22:38:13,855 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [364328100] [2025-03-08 22:38:13,855 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [364328100] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 22:38:13,855 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 22:38:13,855 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 22:38:13,855 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1626250531] [2025-03-08 22:38:13,855 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 22:38:13,855 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 22:38:13,856 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 22:38:13,856 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 22:38:13,856 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-08 22:38:13,856 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-08 22:38:13,881 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 22:38:13,881 INFO L93 Difference]: Finished difference Result 107 states and 123 transitions. [2025-03-08 22:38:13,882 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 22:38:13,882 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-08 22:38:13,882 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 22:38:13,882 INFO L225 Difference]: With dead ends: 107 [2025-03-08 22:38:13,883 INFO L226 Difference]: Without dead ends: 107 [2025-03-08 22:38:13,883 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-08 22:38:13,883 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-08 22:38:13,883 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-08 22:38:13,884 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2025-03-08 22:38:13,886 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 101. [2025-03-08 22:38:13,886 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-08 22:38:13,886 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 120 transitions. [2025-03-08 22:38:13,887 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 120 transitions. Word has length 37 [2025-03-08 22:38:13,887 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 22:38:13,887 INFO L471 AbstractCegarLoop]: Abstraction has 101 states and 120 transitions. [2025-03-08 22:38:13,887 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-08 22:38:13,887 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 120 transitions. [2025-03-08 22:38:13,887 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2025-03-08 22:38:13,887 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 22:38:13,888 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 2, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 22:38:13,888 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-08 22:38:13,888 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-08 22:38:13,888 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:38:13,888 INFO L85 PathProgramCache]: Analyzing trace with hash 2040902890, now seen corresponding path program 1 times [2025-03-08 22:38:13,888 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:38:13,888 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1969328622] [2025-03-08 22:38:13,888 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:38:13,889 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:38:13,902 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 39 statements into 1 equivalence classes. [2025-03-08 22:38:13,912 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 39 of 39 statements. [2025-03-08 22:38:13,912 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:38:13,912 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:38:14,063 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-08 22:38:14,063 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 22:38:14,063 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1969328622] [2025-03-08 22:38:14,063 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1969328622] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 22:38:14,063 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1638217461] [2025-03-08 22:38:14,063 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:38:14,063 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 22:38:14,063 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 22:38:14,065 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-08 22:38:14,067 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-08 22:38:14,111 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 39 statements into 1 equivalence classes. [2025-03-08 22:38:14,133 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 39 of 39 statements. [2025-03-08 22:38:14,133 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:38:14,133 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:38:14,134 INFO L256 TraceCheckSpWp]: Trace formula consists of 199 conjuncts, 12 conjuncts are in the unsatisfiable core [2025-03-08 22:38:14,135 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 22:38:14,187 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-08 22:38:14,188 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 22:38:14,403 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-08 22:38:14,403 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1638217461] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 22:38:14,403 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 22:38:14,403 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 13] total 25 [2025-03-08 22:38:14,403 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [343168357] [2025-03-08 22:38:14,403 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 22:38:14,404 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2025-03-08 22:38:14,404 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 22:38:14,404 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2025-03-08 22:38:14,404 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=300, Invalid=300, Unknown=0, NotChecked=0, Total=600 [2025-03-08 22:38:14,405 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-08 22:38:14,802 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 22:38:14,803 INFO L93 Difference]: Finished difference Result 533 states and 772 transitions. [2025-03-08 22:38:14,803 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2025-03-08 22:38:14,803 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-08 22:38:14,804 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 22:38:14,806 INFO L225 Difference]: With dead ends: 533 [2025-03-08 22:38:14,806 INFO L226 Difference]: Without dead ends: 533 [2025-03-08 22:38:14,807 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-08 22:38:14,807 INFO L435 NwaCegarLoop]: 58 mSDtfsCounter, 508 mSDsluCounter, 480 mSDsCounter, 0 mSdLazyCounter, 318 mSolverCounterSat, 112 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s 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-08 22:38:14,807 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-08 22:38:14,808 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 533 states. [2025-03-08 22:38:14,816 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 533 to 137. [2025-03-08 22:38:14,816 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-08 22:38:14,817 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 137 states to 137 states and 156 transitions. [2025-03-08 22:38:14,817 INFO L78 Accepts]: Start accepts. Automaton has 137 states and 156 transitions. Word has length 39 [2025-03-08 22:38:14,817 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 22:38:14,817 INFO L471 AbstractCegarLoop]: Abstraction has 137 states and 156 transitions. [2025-03-08 22:38:14,818 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-08 22:38:14,818 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 156 transitions. [2025-03-08 22:38:14,819 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2025-03-08 22:38:14,819 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 22:38:14,819 INFO L218 NwaCegarLoop]: trace histogram [22, 22, 22, 2, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 22:38:14,829 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-08 22:38:15,019 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-08 22:38:15,020 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-08 22:38:15,020 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:38:15,020 INFO L85 PathProgramCache]: Analyzing trace with hash 50458282, now seen corresponding path program 2 times [2025-03-08 22:38:15,020 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:38:15,020 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1244283271] [2025-03-08 22:38:15,020 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-08 22:38:15,020 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:38:15,041 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 75 statements into 2 equivalence classes. [2025-03-08 22:38:15,057 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 75 of 75 statements. [2025-03-08 22:38:15,057 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-08 22:38:15,058 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:38:15,259 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-08 22:38:15,259 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 22:38:15,260 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1244283271] [2025-03-08 22:38:15,260 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1244283271] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 22:38:15,260 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [961572298] [2025-03-08 22:38:15,260 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-08 22:38:15,260 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 22:38:15,260 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 22:38:15,262 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-08 22:38:15,263 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-08 22:38:15,313 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 75 statements into 2 equivalence classes. [2025-03-08 22:38:15,359 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 75 of 75 statements. [2025-03-08 22:38:15,360 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-08 22:38:15,360 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:38:15,361 INFO L256 TraceCheckSpWp]: Trace formula consists of 355 conjuncts, 24 conjuncts are in the unsatisfiable core [2025-03-08 22:38:15,363 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 22:38:15,683 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-08 22:38:15,684 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 22:38:16,381 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-08 22:38:16,382 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [961572298] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 22:38:16,382 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 22:38:16,382 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 25, 25] total 51 [2025-03-08 22:38:16,382 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [128903293] [2025-03-08 22:38:16,382 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 22:38:16,383 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 51 states [2025-03-08 22:38:16,383 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 22:38:16,384 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 51 interpolants. [2025-03-08 22:38:16,384 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1137, Invalid=1413, Unknown=0, NotChecked=0, Total=2550 [2025-03-08 22:38:16,385 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-08 22:38:20,427 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 22:38:20,427 INFO L93 Difference]: Finished difference Result 1482 states and 2197 transitions. [2025-03-08 22:38:20,428 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 143 states. [2025-03-08 22:38:20,428 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-08 22:38:20,428 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 22:38:20,435 INFO L225 Difference]: With dead ends: 1482 [2025-03-08 22:38:20,435 INFO L226 Difference]: Without dead ends: 1482 [2025-03-08 22:38:20,439 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 244 GetRequests, 103 SyntacticMatches, 0 SemanticMatches, 141 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4786 ImplicationChecksByTransitivity, 3.1s TimeCoverageRelationStatistics Valid=6864, Invalid=13442, Unknown=0, NotChecked=0, Total=20306 [2025-03-08 22:38:20,440 INFO L435 NwaCegarLoop]: 37 mSDtfsCounter, 3751 mSDsluCounter, 461 mSDsCounter, 0 mSdLazyCounter, 782 mSolverCounterSat, 888 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s 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-08 22:38:20,441 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-08 22:38:20,442 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1482 states. [2025-03-08 22:38:20,474 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1482 to 234. [2025-03-08 22:38:20,476 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-08 22:38:20,477 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 234 states to 234 states and 265 transitions. [2025-03-08 22:38:20,477 INFO L78 Accepts]: Start accepts. Automaton has 234 states and 265 transitions. Word has length 75 [2025-03-08 22:38:20,478 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 22:38:20,478 INFO L471 AbstractCegarLoop]: Abstraction has 234 states and 265 transitions. [2025-03-08 22:38:20,478 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-08 22:38:20,478 INFO L276 IsEmpty]: Start isEmpty. Operand 234 states and 265 transitions. [2025-03-08 22:38:20,481 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2025-03-08 22:38:20,481 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 22:38:20,481 INFO L218 NwaCegarLoop]: trace histogram [46, 46, 46, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 22:38:20,488 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-08 22:38:20,683 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-08 22:38:20,683 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-08 22:38:20,687 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:38:20,687 INFO L85 PathProgramCache]: Analyzing trace with hash 1083372976, now seen corresponding path program 1 times [2025-03-08 22:38:20,687 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:38:20,687 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1572158747] [2025-03-08 22:38:20,687 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:38:20,687 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:38:20,713 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 154 statements into 1 equivalence classes. [2025-03-08 22:38:20,733 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 154 of 154 statements. [2025-03-08 22:38:20,733 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:38:20,733 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:38:20,954 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-08 22:38:20,955 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 22:38:20,955 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1572158747] [2025-03-08 22:38:20,955 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1572158747] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 22:38:20,955 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 22:38:20,955 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 22:38:20,955 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1715936584] [2025-03-08 22:38:20,955 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 22:38:20,955 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 22:38:20,956 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 22:38:20,956 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 22:38:20,956 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-08 22:38:20,956 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-08 22:38:20,982 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 22:38:20,982 INFO L93 Difference]: Finished difference Result 232 states and 255 transitions. [2025-03-08 22:38:20,982 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 22:38:20,983 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-08 22:38:20,983 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 22:38:20,984 INFO L225 Difference]: With dead ends: 232 [2025-03-08 22:38:20,984 INFO L226 Difference]: Without dead ends: 232 [2025-03-08 22:38:20,984 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-08 22:38:20,984 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-08 22:38:20,984 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-08 22:38:20,985 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 232 states. [2025-03-08 22:38:20,987 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 232 to 230. [2025-03-08 22:38:20,988 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-08 22:38:20,988 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 230 states to 230 states and 253 transitions. [2025-03-08 22:38:20,989 INFO L78 Accepts]: Start accepts. Automaton has 230 states and 253 transitions. Word has length 154 [2025-03-08 22:38:20,989 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 22:38:20,989 INFO L471 AbstractCegarLoop]: Abstraction has 230 states and 253 transitions. [2025-03-08 22:38:20,989 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-08 22:38:20,989 INFO L276 IsEmpty]: Start isEmpty. Operand 230 states and 253 transitions. [2025-03-08 22:38:20,990 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2025-03-08 22:38:20,990 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 22:38:20,990 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-08 22:38:20,990 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-08 22:38:20,990 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-08 22:38:20,991 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:38:20,991 INFO L85 PathProgramCache]: Analyzing trace with hash 502852299, now seen corresponding path program 1 times [2025-03-08 22:38:20,991 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:38:20,991 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1317645201] [2025-03-08 22:38:20,991 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:38:20,991 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:38:21,014 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 158 statements into 1 equivalence classes. [2025-03-08 22:38:21,034 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 158 of 158 statements. [2025-03-08 22:38:21,035 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:38:21,035 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:38:21,158 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-08 22:38:21,158 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 22:38:21,158 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1317645201] [2025-03-08 22:38:21,158 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1317645201] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 22:38:21,158 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 22:38:21,159 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 22:38:21,159 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1446083756] [2025-03-08 22:38:21,159 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 22:38:21,159 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 22:38:21,159 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 22:38:21,160 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 22:38:21,160 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-08 22:38:21,160 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-08 22:38:21,166 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 22:38:21,166 INFO L93 Difference]: Finished difference Result 169 states and 171 transitions. [2025-03-08 22:38:21,166 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 22:38:21,167 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-08 22:38:21,167 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 22:38:21,167 INFO L225 Difference]: With dead ends: 169 [2025-03-08 22:38:21,168 INFO L226 Difference]: Without dead ends: 169 [2025-03-08 22:38:21,168 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-08 22:38:21,169 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-08 22:38:21,169 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-08 22:38:21,170 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 169 states. [2025-03-08 22:38:21,172 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 169 to 169. [2025-03-08 22:38:21,172 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-08 22:38:21,173 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 169 states to 169 states and 171 transitions. [2025-03-08 22:38:21,173 INFO L78 Accepts]: Start accepts. Automaton has 169 states and 171 transitions. Word has length 158 [2025-03-08 22:38:21,173 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 22:38:21,173 INFO L471 AbstractCegarLoop]: Abstraction has 169 states and 171 transitions. [2025-03-08 22:38:21,173 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-08 22:38:21,173 INFO L276 IsEmpty]: Start isEmpty. Operand 169 states and 171 transitions. [2025-03-08 22:38:21,174 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2025-03-08 22:38:21,174 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 22:38:21,174 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-08 22:38:21,174 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-08 22:38:21,174 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-08 22:38:21,175 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:38:21,175 INFO L85 PathProgramCache]: Analyzing trace with hash -2012957830, now seen corresponding path program 1 times [2025-03-08 22:38:21,175 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:38:21,175 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2086134098] [2025-03-08 22:38:21,175 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:38:21,175 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:38:21,198 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 168 statements into 1 equivalence classes. [2025-03-08 22:38:21,241 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 168 of 168 statements. [2025-03-08 22:38:21,242 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:38:21,242 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:38:22,955 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-08 22:38:22,955 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 22:38:22,955 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2086134098] [2025-03-08 22:38:22,955 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2086134098] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 22:38:22,955 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1175588612] [2025-03-08 22:38:22,955 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:38:22,955 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 22:38:22,955 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 22:38:22,957 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-08 22:38:22,959 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-08 22:38:23,035 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 168 statements into 1 equivalence classes. [2025-03-08 22:38:23,102 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 168 of 168 statements. [2025-03-08 22:38:23,102 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:38:23,102 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:38:23,106 INFO L256 TraceCheckSpWp]: Trace formula consists of 769 conjuncts, 48 conjuncts are in the unsatisfiable core [2025-03-08 22:38:23,110 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 22:38:23,268 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-08 22:38:23,268 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 22:38:25,237 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-08 22:38:25,238 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1175588612] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 22:38:25,238 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 22:38:25,238 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [49, 49, 49] total 97 [2025-03-08 22:38:25,238 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1852291963] [2025-03-08 22:38:25,238 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 22:38:25,239 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 97 states [2025-03-08 22:38:25,239 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 22:38:25,240 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 97 interpolants. [2025-03-08 22:38:25,242 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=4656, Invalid=4656, Unknown=0, NotChecked=0, Total=9312 [2025-03-08 22:38:25,242 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-08 22:38:25,524 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 22:38:25,524 INFO L93 Difference]: Finished difference Result 313 states and 315 transitions. [2025-03-08 22:38:25,525 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 96 states. [2025-03-08 22:38:25,525 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-08 22:38:25,525 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 22:38:25,526 INFO L225 Difference]: With dead ends: 313 [2025-03-08 22:38:25,526 INFO L226 Difference]: Without dead ends: 313 [2025-03-08 22:38:25,528 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 383 GetRequests, 288 SyntacticMatches, 0 SemanticMatches, 95 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 184 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=4656, Invalid=4656, Unknown=0, NotChecked=0, Total=9312 [2025-03-08 22:38:25,528 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-08 22:38:25,528 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-08 22:38:25,529 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 313 states. [2025-03-08 22:38:25,531 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 313 to 313. [2025-03-08 22:38:25,532 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-08 22:38:25,532 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 313 states to 313 states and 315 transitions. [2025-03-08 22:38:25,532 INFO L78 Accepts]: Start accepts. Automaton has 313 states and 315 transitions. Word has length 168 [2025-03-08 22:38:25,532 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 22:38:25,533 INFO L471 AbstractCegarLoop]: Abstraction has 313 states and 315 transitions. [2025-03-08 22:38:25,533 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-08 22:38:25,533 INFO L276 IsEmpty]: Start isEmpty. Operand 313 states and 315 transitions. [2025-03-08 22:38:25,534 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 313 [2025-03-08 22:38:25,535 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 22:38:25,535 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-08 22:38:25,542 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2025-03-08 22:38:25,739 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-08 22:38:25,739 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-08 22:38:25,739 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:38:25,739 INFO L85 PathProgramCache]: Analyzing trace with hash 993258618, now seen corresponding path program 2 times [2025-03-08 22:38:25,740 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:38:25,740 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1024708916] [2025-03-08 22:38:25,740 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-08 22:38:25,740 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:38:25,773 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 312 statements into 2 equivalence classes. [2025-03-08 22:38:25,776 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 8 of 312 statements. [2025-03-08 22:38:25,777 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-08 22:38:25,777 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:38:25,876 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-08 22:38:25,876 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 22:38:25,876 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1024708916] [2025-03-08 22:38:25,876 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1024708916] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 22:38:25,876 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 22:38:25,876 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 22:38:25,877 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [365401623] [2025-03-08 22:38:25,877 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 22:38:25,877 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 22:38:25,877 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 22:38:25,878 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 22:38:25,878 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-08 22:38:25,878 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-08 22:38:25,891 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 22:38:25,892 INFO L93 Difference]: Finished difference Result 312 states and 314 transitions. [2025-03-08 22:38:25,892 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-08 22:38:25,892 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-08 22:38:25,893 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 22:38:25,893 INFO L225 Difference]: With dead ends: 312 [2025-03-08 22:38:25,893 INFO L226 Difference]: Without dead ends: 0 [2025-03-08 22:38:25,893 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-08 22:38:25,894 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-08 22:38:25,894 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-08 22:38:25,895 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2025-03-08 22:38:25,896 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2025-03-08 22:38:25,896 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-08 22:38:25,896 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2025-03-08 22:38:25,896 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 312 [2025-03-08 22:38:25,896 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 22:38:25,896 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-03-08 22:38:25,896 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-08 22:38:25,896 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2025-03-08 22:38:25,896 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2025-03-08 22:38:25,899 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (25 of 26 remaining) [2025-03-08 22:38:25,901 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (24 of 26 remaining) [2025-03-08 22:38:25,901 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (23 of 26 remaining) [2025-03-08 22:38:25,901 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (22 of 26 remaining) [2025-03-08 22:38:25,901 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (21 of 26 remaining) [2025-03-08 22:38:25,901 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (20 of 26 remaining) [2025-03-08 22:38:25,901 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (19 of 26 remaining) [2025-03-08 22:38:25,901 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (18 of 26 remaining) [2025-03-08 22:38:25,902 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (17 of 26 remaining) [2025-03-08 22:38:25,902 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (16 of 26 remaining) [2025-03-08 22:38:25,902 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (15 of 26 remaining) [2025-03-08 22:38:25,902 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (14 of 26 remaining) [2025-03-08 22:38:25,902 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (13 of 26 remaining) [2025-03-08 22:38:25,902 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE (12 of 26 remaining) [2025-03-08 22:38:25,902 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE (11 of 26 remaining) [2025-03-08 22:38:25,902 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr15REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 26 remaining) [2025-03-08 22:38:25,902 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr16REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 26 remaining) [2025-03-08 22:38:25,902 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr17REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 26 remaining) [2025-03-08 22:38:25,902 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr18REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 26 remaining) [2025-03-08 22:38:25,902 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr19REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 26 remaining) [2025-03-08 22:38:25,902 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr20REQUIRES_VIOLATIONMEMORY_DEREFERENCE (5 of 26 remaining) [2025-03-08 22:38:25,902 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr21REQUIRES_VIOLATIONMEMORY_DEREFERENCE (4 of 26 remaining) [2025-03-08 22:38:25,903 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr22REQUIRES_VIOLATIONMEMORY_DEREFERENCE (3 of 26 remaining) [2025-03-08 22:38:25,903 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr23REQUIRES_VIOLATIONMEMORY_DEREFERENCE (2 of 26 remaining) [2025-03-08 22:38:25,903 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr24REQUIRES_VIOLATIONMEMORY_DEREFERENCE (1 of 26 remaining) [2025-03-08 22:38:25,903 INFO L782 garLoopResultBuilder]: Registering result SAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONMEMORY_LEAK (0 of 26 remaining) [2025-03-08 22:38:25,903 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-08 22:38:25,906 INFO L422 BasicCegarLoop]: Path program histogram: [2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 22:38:25,908 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-08 22:38:25,912 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 08.03 10:38:25 BoogieIcfgContainer [2025-03-08 22:38:25,912 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-08 22:38:25,915 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-08 22:38:25,915 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-08 22:38:25,915 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-08 22:38:25,916 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 10:38:11" (3/4) ... [2025-03-08 22:38:25,917 INFO L146 WitnessPrinter]: Generating witness for correct program [2025-03-08 22:38:25,922 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure __VERIFIER_assert [2025-03-08 22:38:25,927 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 19 nodes and edges [2025-03-08 22:38:25,928 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 7 nodes and edges [2025-03-08 22:38:25,929 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2025-03-08 22:38:25,929 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2025-03-08 22:38:26,002 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-03-08 22:38:26,003 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2025-03-08 22:38:26,003 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-08 22:38:26,004 INFO L158 Benchmark]: Toolchain (without parser) took 15207.27ms. Allocated memory was 142.6MB in the beginning and 419.4MB in the end (delta: 276.8MB). Free memory was 110.1MB in the beginning and 381.4MB in the end (delta: -271.3MB). Peak memory consumption was 248.6MB. Max. memory is 16.1GB. [2025-03-08 22:38:26,004 INFO L158 Benchmark]: CDTParser took 0.95ms. Allocated memory is still 201.3MB. Free memory is still 126.1MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-08 22:38:26,004 INFO L158 Benchmark]: CACSL2BoogieTranslator took 177.91ms. Allocated memory is still 142.6MB. Free memory was 110.1MB in the beginning and 98.5MB in the end (delta: 11.6MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-08 22:38:26,004 INFO L158 Benchmark]: Boogie Procedure Inliner took 29.28ms. Allocated memory is still 142.6MB. Free memory was 98.5MB in the beginning and 97.0MB in the end (delta: 1.5MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-08 22:38:26,005 INFO L158 Benchmark]: Boogie Preprocessor took 28.08ms. Allocated memory is still 142.6MB. Free memory was 97.0MB in the beginning and 95.8MB in the end (delta: 1.1MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-08 22:38:26,005 INFO L158 Benchmark]: IcfgBuilder took 398.84ms. Allocated memory is still 142.6MB. Free memory was 94.7MB in the beginning and 74.5MB in the end (delta: 20.2MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-03-08 22:38:26,005 INFO L158 Benchmark]: TraceAbstraction took 14477.33ms. Allocated memory was 142.6MB in the beginning and 419.4MB in the end (delta: 276.8MB). Free memory was 74.5MB in the beginning and 144.0MB in the end (delta: -69.5MB). Peak memory consumption was 206.6MB. Max. memory is 16.1GB. [2025-03-08 22:38:26,006 INFO L158 Benchmark]: Witness Printer took 88.26ms. Allocated memory is still 419.4MB. Free memory was 144.0MB in the beginning and 381.4MB in the end (delta: -237.4MB). Peak memory consumption was 8.5MB. Max. memory is 16.1GB. [2025-03-08 22:38:26,007 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.95ms. Allocated memory is still 201.3MB. Free memory is still 126.1MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 177.91ms. Allocated memory is still 142.6MB. Free memory was 110.1MB in the beginning and 98.5MB in the end (delta: 11.6MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 29.28ms. Allocated memory is still 142.6MB. Free memory was 98.5MB in the beginning and 97.0MB in the end (delta: 1.5MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 28.08ms. Allocated memory is still 142.6MB. Free memory was 97.0MB in the beginning and 95.8MB in the end (delta: 1.1MB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 398.84ms. Allocated memory is still 142.6MB. Free memory was 94.7MB in the beginning and 74.5MB in the end (delta: 20.2MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 14477.33ms. Allocated memory was 142.6MB in the beginning and 419.4MB in the end (delta: 276.8MB). Free memory was 74.5MB in the beginning and 144.0MB in the end (delta: -69.5MB). Peak memory consumption was 206.6MB. Max. memory is 16.1GB. * Witness Printer took 88.26ms. Allocated memory is still 419.4MB. Free memory was 144.0MB in the beginning and 381.4MB in the end (delta: -237.4MB). Peak memory consumption was 8.5MB. 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, 95 edges, 26 error locations. Started 1 CEGAR loops. OverallTime: 14.4s, 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.7s 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-08 22:38:26,020 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE