./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/termination-crafted/NonTermination3-2.c --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 8fc3dc66 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/termination-crafted/NonTermination3-2.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-64bit-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 64bit --witnessprinter.graph.data.programhash a0671ae6ff503095cbeea151b096da898df643465964474a4f3e3c55275f454c --- Real Ultimate output --- This is Ultimate 0.3.0-?-8fc3dc6-m [2025-03-17 12:23:02,818 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-17 12:23:02,874 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-64bit-Automizer_Default.epf [2025-03-17 12:23:02,877 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-17 12:23:02,878 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-17 12:23:02,898 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-17 12:23:02,898 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-17 12:23:02,898 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-17 12:23:02,899 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-17 12:23:02,899 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-17 12:23:02,899 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-17 12:23:02,899 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-17 12:23:02,899 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-17 12:23:02,899 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-17 12:23:02,899 INFO L153 SettingsManager]: * Use SBE=true [2025-03-17 12:23:02,899 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-17 12:23:02,899 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-17 12:23:02,899 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-17 12:23:02,899 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2025-03-17 12:23:02,901 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2025-03-17 12:23:02,901 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2025-03-17 12:23:02,901 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-17 12:23:02,902 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-03-17 12:23:02,902 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-03-17 12:23:02,902 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-17 12:23:02,902 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-17 12:23:02,902 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-17 12:23:02,902 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-17 12:23:02,902 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-17 12:23:02,902 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-17 12:23:02,903 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 12:23:02,903 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-17 12:23:02,903 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-17 12:23:02,903 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-17 12:23:02,903 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-17 12:23:02,903 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-17 12:23:02,903 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-17 12:23:02,903 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-17 12:23:02,903 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-17 12:23:02,903 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 -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> a0671ae6ff503095cbeea151b096da898df643465964474a4f3e3c55275f454c [2025-03-17 12:23:03,141 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-17 12:23:03,150 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-17 12:23:03,152 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-17 12:23:03,153 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-17 12:23:03,153 INFO L274 PluginConnector]: CDTParser initialized [2025-03-17 12:23:03,155 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/termination-crafted/NonTermination3-2.c [2025-03-17 12:23:04,339 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fd32a8d2a/0ee5f96eecb6414382a069ebdb720f32/FLAG1c9c628dc [2025-03-17 12:23:04,526 INFO L384 CDTParser]: Found 1 translation units. [2025-03-17 12:23:04,528 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/termination-crafted/NonTermination3-2.c [2025-03-17 12:23:04,547 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fd32a8d2a/0ee5f96eecb6414382a069ebdb720f32/FLAG1c9c628dc [2025-03-17 12:23:04,913 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fd32a8d2a/0ee5f96eecb6414382a069ebdb720f32 [2025-03-17 12:23:04,915 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-17 12:23:04,916 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-17 12:23:04,917 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-17 12:23:04,917 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-17 12:23:04,920 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-17 12:23:04,921 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 12:23:04" (1/1) ... [2025-03-17 12:23:04,921 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6932d67f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 12:23:04, skipping insertion in model container [2025-03-17 12:23:04,921 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 12:23:04" (1/1) ... [2025-03-17 12:23:04,930 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-17 12:23:05,030 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 12:23:05,034 INFO L200 MainTranslator]: Completed pre-run [2025-03-17 12:23:05,046 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 12:23:05,057 INFO L204 MainTranslator]: Completed translation [2025-03-17 12:23:05,057 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 12:23:05 WrapperNode [2025-03-17 12:23:05,057 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-17 12:23:05,058 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-17 12:23:05,058 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-17 12:23:05,058 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-17 12:23:05,062 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 12:23:05" (1/1) ... [2025-03-17 12:23:05,066 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 12:23:05" (1/1) ... [2025-03-17 12:23:05,076 INFO L138 Inliner]: procedures = 8, calls = 8, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 41 [2025-03-17 12:23:05,077 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-17 12:23:05,078 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-17 12:23:05,078 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-17 12:23:05,078 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-17 12:23:05,083 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 12:23:05" (1/1) ... [2025-03-17 12:23:05,084 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 12:23:05" (1/1) ... [2025-03-17 12:23:05,085 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 12:23:05" (1/1) ... [2025-03-17 12:23:05,095 INFO L175 MemorySlicer]: Split 3 memory accesses to 1 slices as follows [3]. 100 percent of accesses are in the largest equivalence class. The 0 initializations are split as follows [0]. The 2 writes are split as follows [2]. [2025-03-17 12:23:05,096 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 12:23:05" (1/1) ... [2025-03-17 12:23:05,097 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 12:23:05" (1/1) ... [2025-03-17 12:23:05,101 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 12:23:05" (1/1) ... [2025-03-17 12:23:05,102 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 12:23:05" (1/1) ... [2025-03-17 12:23:05,102 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 12:23:05" (1/1) ... [2025-03-17 12:23:05,103 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 12:23:05" (1/1) ... [2025-03-17 12:23:05,103 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-17 12:23:05,104 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-17 12:23:05,104 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-17 12:23:05,104 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-17 12:23:05,105 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 12:23:05" (1/1) ... [2025-03-17 12:23:05,109 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 12:23:05,119 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 12:23:05,134 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-17 12:23:05,137 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-17 12:23:05,155 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-03-17 12:23:05,155 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-17 12:23:05,155 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-17 12:23:05,155 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-03-17 12:23:05,155 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-03-17 12:23:05,155 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-03-17 12:23:05,198 INFO L256 CfgBuilder]: Building ICFG [2025-03-17 12:23:05,200 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-17 12:23:05,300 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L11: call ULTIMATE.dealloc(main_~#a~0#1.base, main_~#a~0#1.offset);havoc main_~#a~0#1.base, main_~#a~0#1.offset; [2025-03-17 12:23:05,305 INFO L? ?]: Removed 20 outVars from TransFormulas that were not future-live. [2025-03-17 12:23:05,306 INFO L307 CfgBuilder]: Performing block encoding [2025-03-17 12:23:05,311 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-17 12:23:05,311 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-17 12:23:05,311 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 12:23:05 BoogieIcfgContainer [2025-03-17 12:23:05,312 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-17 12:23:05,313 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-17 12:23:05,313 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-17 12:23:05,316 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-17 12:23:05,316 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 17.03 12:23:04" (1/3) ... [2025-03-17 12:23:05,316 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@32a18b65 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 12:23:05, skipping insertion in model container [2025-03-17 12:23:05,316 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 12:23:05" (2/3) ... [2025-03-17 12:23:05,317 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@32a18b65 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 12:23:05, skipping insertion in model container [2025-03-17 12:23:05,317 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 12:23:05" (3/3) ... [2025-03-17 12:23:05,317 INFO L128 eAbstractionObserver]: Analyzing ICFG NonTermination3-2.c [2025-03-17 12:23:05,326 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-17 12:23:05,327 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG NonTermination3-2.c that has 1 procedures, 22 locations, 1 initial locations, 2 loop locations, and 7 error locations. [2025-03-17 12:23:05,353 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-17 12:23:05,363 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;@3b0f5f19, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-17 12:23:05,363 INFO L334 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2025-03-17 12:23:05,365 INFO L276 IsEmpty]: Start isEmpty. Operand has 22 states, 14 states have (on average 1.7857142857142858) internal successors, (25), 21 states have internal predecessors, (25), 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-17 12:23:05,368 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2025-03-17 12:23:05,369 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 12:23:05,369 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1] [2025-03-17 12:23:05,370 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 4 more)] === [2025-03-17 12:23:05,373 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 12:23:05,374 INFO L85 PathProgramCache]: Analyzing trace with hash 54582, now seen corresponding path program 1 times [2025-03-17 12:23:05,379 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 12:23:05,380 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1900092556] [2025-03-17 12:23:05,380 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 12:23:05,380 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 12:23:05,422 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-03-17 12:23:05,435 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-03-17 12:23:05,436 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 12:23:05,436 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 12:23:05,535 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-17 12:23:05,535 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 12:23:05,536 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1900092556] [2025-03-17 12:23:05,537 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1900092556] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 12:23:05,537 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 12:23:05,537 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-03-17 12:23:05,538 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [448640910] [2025-03-17 12:23:05,539 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 12:23:05,541 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 12:23:05,542 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 12:23:05,560 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 12:23:05,561 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 12:23:05,564 INFO L87 Difference]: Start difference. First operand has 22 states, 14 states have (on average 1.7857142857142858) internal successors, (25), 21 states have internal predecessors, (25), 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) Second operand has 3 states, 2 states have (on average 1.5) internal successors, (3), 2 states have internal predecessors, (3), 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-17 12:23:05,602 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 12:23:05,603 INFO L93 Difference]: Finished difference Result 19 states and 21 transitions. [2025-03-17 12:23:05,604 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 12:23:05,605 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 2 states have internal predecessors, (3), 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 3 [2025-03-17 12:23:05,605 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 12:23:05,611 INFO L225 Difference]: With dead ends: 19 [2025-03-17 12:23:05,611 INFO L226 Difference]: Without dead ends: 17 [2025-03-17 12:23:05,613 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 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-17 12:23:05,616 INFO L435 NwaCegarLoop]: 14 mSDtfsCounter, 12 mSDsluCounter, 1 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 15 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 12:23:05,618 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 15 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 12:23:05,628 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2025-03-17 12:23:05,636 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 17. [2025-03-17 12:23:05,637 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17 states, 13 states have (on average 1.4615384615384615) internal successors, (19), 16 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-17 12:23:05,639 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 19 transitions. [2025-03-17 12:23:05,642 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 19 transitions. Word has length 3 [2025-03-17 12:23:05,642 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 12:23:05,642 INFO L471 AbstractCegarLoop]: Abstraction has 17 states and 19 transitions. [2025-03-17 12:23:05,643 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 2 states have internal predecessors, (3), 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-17 12:23:05,643 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 19 transitions. [2025-03-17 12:23:05,644 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2025-03-17 12:23:05,644 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 12:23:05,644 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1] [2025-03-17 12:23:05,644 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-17 12:23:05,645 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 4 more)] === [2025-03-17 12:23:05,646 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 12:23:05,646 INFO L85 PathProgramCache]: Analyzing trace with hash 54583, now seen corresponding path program 1 times [2025-03-17 12:23:05,646 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 12:23:05,646 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1961885351] [2025-03-17 12:23:05,646 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 12:23:05,646 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 12:23:05,652 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-03-17 12:23:05,661 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-03-17 12:23:05,662 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 12:23:05,662 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 12:23:05,748 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-17 12:23:05,748 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 12:23:05,748 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1961885351] [2025-03-17 12:23:05,748 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1961885351] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 12:23:05,748 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 12:23:05,748 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-03-17 12:23:05,749 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [126359071] [2025-03-17 12:23:05,749 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 12:23:05,750 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 12:23:05,750 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 12:23:05,750 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 12:23:05,751 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 12:23:05,751 INFO L87 Difference]: Start difference. First operand 17 states and 19 transitions. Second operand has 3 states, 2 states have (on average 1.5) internal successors, (3), 2 states have internal predecessors, (3), 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-17 12:23:05,785 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 12:23:05,785 INFO L93 Difference]: Finished difference Result 20 states and 22 transitions. [2025-03-17 12:23:05,785 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 12:23:05,786 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 2 states have internal predecessors, (3), 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 3 [2025-03-17 12:23:05,786 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 12:23:05,787 INFO L225 Difference]: With dead ends: 20 [2025-03-17 12:23:05,787 INFO L226 Difference]: Without dead ends: 20 [2025-03-17 12:23:05,787 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 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-17 12:23:05,787 INFO L435 NwaCegarLoop]: 16 mSDtfsCounter, 1 mSDsluCounter, 8 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 24 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 12:23:05,788 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 24 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 12:23:05,788 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2025-03-17 12:23:05,789 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 19. [2025-03-17 12:23:05,790 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19 states, 15 states have (on average 1.4) internal successors, (21), 18 states have internal predecessors, (21), 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-17 12:23:05,790 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 21 transitions. [2025-03-17 12:23:05,790 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 21 transitions. Word has length 3 [2025-03-17 12:23:05,790 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 12:23:05,790 INFO L471 AbstractCegarLoop]: Abstraction has 19 states and 21 transitions. [2025-03-17 12:23:05,790 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 2 states have internal predecessors, (3), 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-17 12:23:05,790 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 21 transitions. [2025-03-17 12:23:05,790 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2025-03-17 12:23:05,790 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 12:23:05,791 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1] [2025-03-17 12:23:05,791 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-17 12:23:05,791 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 4 more)] === [2025-03-17 12:23:05,791 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 12:23:05,791 INFO L85 PathProgramCache]: Analyzing trace with hash 1626042558, now seen corresponding path program 1 times [2025-03-17 12:23:05,791 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 12:23:05,791 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1419970709] [2025-03-17 12:23:05,792 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 12:23:05,792 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 12:23:05,801 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-03-17 12:23:05,806 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-03-17 12:23:05,806 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 12:23:05,806 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 12:23:05,949 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-17 12:23:05,950 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 12:23:05,950 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1419970709] [2025-03-17 12:23:05,950 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1419970709] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 12:23:05,950 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [789017978] [2025-03-17 12:23:05,950 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 12:23:05,950 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 12:23:05,950 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 12:23:05,953 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-17 12:23:05,954 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-17 12:23:05,985 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-03-17 12:23:05,990 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-03-17 12:23:05,990 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 12:23:05,990 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 12:23:05,992 INFO L256 TraceCheckSpWp]: Trace formula consists of 39 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-03-17 12:23:05,994 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 12:23:06,038 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-17 12:23:06,101 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-17 12:23:06,102 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 12:23:06,170 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-17 12:23:06,170 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [789017978] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 12:23:06,170 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 12:23:06,170 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [2, 2, 2] total 5 [2025-03-17 12:23:06,170 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2144108100] [2025-03-17 12:23:06,170 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 12:23:06,170 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-17 12:23:06,170 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 12:23:06,171 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-17 12:23:06,171 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2025-03-17 12:23:06,171 INFO L87 Difference]: Start difference. First operand 19 states and 21 transitions. Second operand has 7 states, 6 states have (on average 2.5) internal successors, (15), 6 states have internal predecessors, (15), 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-17 12:23:06,235 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 12:23:06,235 INFO L93 Difference]: Finished difference Result 28 states and 32 transitions. [2025-03-17 12:23:06,236 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-17 12:23:06,236 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 2.5) internal successors, (15), 6 states have internal predecessors, (15), 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 6 [2025-03-17 12:23:06,236 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 12:23:06,237 INFO L225 Difference]: With dead ends: 28 [2025-03-17 12:23:06,237 INFO L226 Difference]: Without dead ends: 28 [2025-03-17 12:23:06,237 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=25, Invalid=31, Unknown=0, NotChecked=0, Total=56 [2025-03-17 12:23:06,238 INFO L435 NwaCegarLoop]: 15 mSDtfsCounter, 3 mSDsluCounter, 16 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 31 SdHoareTripleChecker+Invalid, 41 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 38 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 12:23:06,238 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 31 Invalid, 41 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 12:23:06,238 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2025-03-17 12:23:06,240 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 28. [2025-03-17 12:23:06,240 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 24 states have (on average 1.3333333333333333) internal successors, (32), 27 states have internal predecessors, (32), 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-17 12:23:06,241 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 32 transitions. [2025-03-17 12:23:06,241 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 32 transitions. Word has length 6 [2025-03-17 12:23:06,241 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 12:23:06,241 INFO L471 AbstractCegarLoop]: Abstraction has 28 states and 32 transitions. [2025-03-17 12:23:06,241 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 2.5) internal successors, (15), 6 states have internal predecessors, (15), 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-17 12:23:06,241 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 32 transitions. [2025-03-17 12:23:06,241 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2025-03-17 12:23:06,241 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 12:23:06,241 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1] [2025-03-17 12:23:06,248 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-17 12:23:06,442 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-17 12:23:06,442 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 4 more)] === [2025-03-17 12:23:06,442 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 12:23:06,443 INFO L85 PathProgramCache]: Analyzing trace with hash -626237547, now seen corresponding path program 1 times [2025-03-17 12:23:06,443 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 12:23:06,443 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1171783670] [2025-03-17 12:23:06,443 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 12:23:06,443 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 12:23:06,447 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-03-17 12:23:06,452 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-03-17 12:23:06,452 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 12:23:06,452 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 12:23:06,598 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-03-17 12:23:06,598 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 12:23:06,598 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1171783670] [2025-03-17 12:23:06,598 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1171783670] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 12:23:06,598 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 12:23:06,598 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-17 12:23:06,598 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2004182161] [2025-03-17 12:23:06,598 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 12:23:06,598 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-17 12:23:06,599 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 12:23:06,599 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-17 12:23:06,599 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-17 12:23:06,599 INFO L87 Difference]: Start difference. First operand 28 states and 32 transitions. Second operand has 5 states, 4 states have (on average 2.0) internal successors, (8), 4 states have internal predecessors, (8), 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-17 12:23:06,653 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 12:23:06,653 INFO L93 Difference]: Finished difference Result 28 states and 33 transitions. [2025-03-17 12:23:06,653 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-17 12:23:06,653 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 2.0) internal successors, (8), 4 states have internal predecessors, (8), 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 11 [2025-03-17 12:23:06,653 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 12:23:06,654 INFO L225 Difference]: With dead ends: 28 [2025-03-17 12:23:06,654 INFO L226 Difference]: Without dead ends: 28 [2025-03-17 12:23:06,654 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2025-03-17 12:23:06,654 INFO L435 NwaCegarLoop]: 10 mSDtfsCounter, 13 mSDsluCounter, 9 mSDsCounter, 0 mSdLazyCounter, 31 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 19 SdHoareTripleChecker+Invalid, 33 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 31 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 12:23:06,655 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 19 Invalid, 33 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 31 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 12:23:06,655 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2025-03-17 12:23:06,656 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 26. [2025-03-17 12:23:06,656 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 24 states have (on average 1.25) internal successors, (30), 25 states have internal predecessors, (30), 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-17 12:23:06,657 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 30 transitions. [2025-03-17 12:23:06,657 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 30 transitions. Word has length 11 [2025-03-17 12:23:06,657 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 12:23:06,657 INFO L471 AbstractCegarLoop]: Abstraction has 26 states and 30 transitions. [2025-03-17 12:23:06,657 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 2.0) internal successors, (8), 4 states have internal predecessors, (8), 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-17 12:23:06,657 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 30 transitions. [2025-03-17 12:23:06,657 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2025-03-17 12:23:06,657 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 12:23:06,658 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 12:23:06,658 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-17 12:23:06,658 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 4 more)] === [2025-03-17 12:23:06,658 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 12:23:06,658 INFO L85 PathProgramCache]: Analyzing trace with hash -518835155, now seen corresponding path program 1 times [2025-03-17 12:23:06,658 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 12:23:06,658 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1754612956] [2025-03-17 12:23:06,659 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 12:23:06,659 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 12:23:06,663 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-03-17 12:23:06,666 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-03-17 12:23:06,666 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 12:23:06,666 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 12:23:06,700 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 12:23:06,700 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 12:23:06,700 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1754612956] [2025-03-17 12:23:06,700 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1754612956] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 12:23:06,700 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [981164675] [2025-03-17 12:23:06,700 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 12:23:06,700 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 12:23:06,700 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 12:23:06,702 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-17 12:23:06,703 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-17 12:23:06,730 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-03-17 12:23:06,736 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-03-17 12:23:06,736 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 12:23:06,736 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 12:23:06,737 INFO L256 TraceCheckSpWp]: Trace formula consists of 58 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-17 12:23:06,737 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 12:23:06,759 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 12:23:06,759 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 12:23:06,783 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 12:23:06,783 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [981164675] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 12:23:06,783 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 12:23:06,783 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 8 [2025-03-17 12:23:06,783 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [506912527] [2025-03-17 12:23:06,783 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 12:23:06,783 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-17 12:23:06,783 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 12:23:06,784 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-17 12:23:06,784 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2025-03-17 12:23:06,784 INFO L87 Difference]: Start difference. First operand 26 states and 30 transitions. Second operand has 9 states, 9 states have (on average 2.7777777777777777) internal successors, (25), 8 states have internal predecessors, (25), 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-17 12:23:06,808 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 12:23:06,808 INFO L93 Difference]: Finished difference Result 31 states and 34 transitions. [2025-03-17 12:23:06,809 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-17 12:23:06,810 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 2.7777777777777777) internal successors, (25), 8 states have internal predecessors, (25), 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 13 [2025-03-17 12:23:06,810 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 12:23:06,810 INFO L225 Difference]: With dead ends: 31 [2025-03-17 12:23:06,810 INFO L226 Difference]: Without dead ends: 31 [2025-03-17 12:23:06,810 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2025-03-17 12:23:06,811 INFO L435 NwaCegarLoop]: 13 mSDtfsCounter, 4 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 35 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-17 12:23:06,811 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 35 Invalid, 29 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 12:23:06,811 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2025-03-17 12:23:06,812 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 31. [2025-03-17 12:23:06,812 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31 states, 29 states have (on average 1.1724137931034482) internal successors, (34), 30 states have internal predecessors, (34), 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-17 12:23:06,813 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 34 transitions. [2025-03-17 12:23:06,813 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 34 transitions. Word has length 13 [2025-03-17 12:23:06,813 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 12:23:06,813 INFO L471 AbstractCegarLoop]: Abstraction has 31 states and 34 transitions. [2025-03-17 12:23:06,813 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 2.7777777777777777) internal successors, (25), 8 states have internal predecessors, (25), 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-17 12:23:06,813 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 34 transitions. [2025-03-17 12:23:06,813 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2025-03-17 12:23:06,813 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 12:23:06,813 INFO L218 NwaCegarLoop]: trace histogram [5, 4, 4, 1, 1] [2025-03-17 12:23:06,822 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-03-17 12:23:07,016 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-17 12:23:07,016 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 4 more)] === [2025-03-17 12:23:07,017 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 12:23:07,017 INFO L85 PathProgramCache]: Analyzing trace with hash -877241737, now seen corresponding path program 2 times [2025-03-17 12:23:07,017 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 12:23:07,017 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [339973766] [2025-03-17 12:23:07,017 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-17 12:23:07,017 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 12:23:07,023 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 15 statements into 2 equivalence classes. [2025-03-17 12:23:07,035 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 15 of 15 statements. [2025-03-17 12:23:07,035 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-17 12:23:07,035 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 12:23:07,201 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 9 proven. 17 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 12:23:07,201 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 12:23:07,201 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [339973766] [2025-03-17 12:23:07,201 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [339973766] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 12:23:07,201 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1967062779] [2025-03-17 12:23:07,202 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-17 12:23:07,202 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 12:23:07,202 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 12:23:07,203 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-17 12:23:07,205 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-17 12:23:07,228 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 15 statements into 2 equivalence classes. [2025-03-17 12:23:07,238 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 15 of 15 statements. [2025-03-17 12:23:07,238 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-17 12:23:07,238 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 12:23:07,239 INFO L256 TraceCheckSpWp]: Trace formula consists of 78 conjuncts, 11 conjuncts are in the unsatisfiable core [2025-03-17 12:23:07,241 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 12:23:07,247 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-17 12:23:07,401 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 26 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 12:23:07,402 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 12:23:07,402 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1967062779] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 12:23:07,402 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-17 12:23:07,402 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [6] total 12 [2025-03-17 12:23:07,402 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1121533073] [2025-03-17 12:23:07,402 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 12:23:07,402 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-17 12:23:07,402 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 12:23:07,403 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-17 12:23:07,403 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=121, Unknown=0, NotChecked=0, Total=182 [2025-03-17 12:23:07,403 INFO L87 Difference]: Start difference. First operand 31 states and 34 transitions. Second operand has 8 states, 7 states have (on average 2.142857142857143) internal successors, (15), 7 states have internal predecessors, (15), 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-17 12:23:07,446 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 12:23:07,446 INFO L93 Difference]: Finished difference Result 30 states and 32 transitions. [2025-03-17 12:23:07,447 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-17 12:23:07,447 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 2.142857142857143) internal successors, (15), 7 states have internal predecessors, (15), 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 15 [2025-03-17 12:23:07,447 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 12:23:07,448 INFO L225 Difference]: With dead ends: 30 [2025-03-17 12:23:07,448 INFO L226 Difference]: Without dead ends: 30 [2025-03-17 12:23:07,448 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 55 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=61, Invalid=121, Unknown=0, NotChecked=0, Total=182 [2025-03-17 12:23:07,448 INFO L435 NwaCegarLoop]: 12 mSDtfsCounter, 2 mSDsluCounter, 8 mSDsCounter, 0 mSdLazyCounter, 46 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 20 SdHoareTripleChecker+Invalid, 46 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 46 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 12:23:07,448 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 20 Invalid, 46 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 46 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 12:23:07,449 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2025-03-17 12:23:07,450 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 30. [2025-03-17 12:23:07,450 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 29 states have (on average 1.103448275862069) internal successors, (32), 29 states have internal predecessors, (32), 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-17 12:23:07,453 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 32 transitions. [2025-03-17 12:23:07,454 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 32 transitions. Word has length 15 [2025-03-17 12:23:07,454 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 12:23:07,454 INFO L471 AbstractCegarLoop]: Abstraction has 30 states and 32 transitions. [2025-03-17 12:23:07,454 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 2.142857142857143) internal successors, (15), 7 states have internal predecessors, (15), 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-17 12:23:07,454 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 32 transitions. [2025-03-17 12:23:07,454 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2025-03-17 12:23:07,454 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 12:23:07,454 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 12:23:07,462 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-03-17 12:23:07,655 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 12:23:07,655 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 4 more)] === [2025-03-17 12:23:07,655 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 12:23:07,655 INFO L85 PathProgramCache]: Analyzing trace with hash 1486039405, now seen corresponding path program 2 times [2025-03-17 12:23:07,655 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 12:23:07,655 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1132982396] [2025-03-17 12:23:07,655 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-17 12:23:07,656 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 12:23:07,662 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 25 statements into 2 equivalence classes. [2025-03-17 12:23:07,667 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 7 of 25 statements. [2025-03-17 12:23:07,667 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-17 12:23:07,667 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 12:23:07,701 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 51 trivial. 0 not checked. [2025-03-17 12:23:07,702 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 12:23:07,702 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1132982396] [2025-03-17 12:23:07,702 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1132982396] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 12:23:07,702 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 12:23:07,702 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 12:23:07,702 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1467728226] [2025-03-17 12:23:07,702 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 12:23:07,702 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-17 12:23:07,702 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 12:23:07,702 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 12:23:07,702 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-17 12:23:07,703 INFO L87 Difference]: Start difference. First operand 30 states and 32 transitions. Second operand has 4 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 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-17 12:23:07,711 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 12:23:07,712 INFO L93 Difference]: Finished difference Result 29 states and 31 transitions. [2025-03-17 12:23:07,712 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-17 12:23:07,712 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 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 25 [2025-03-17 12:23:07,712 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 12:23:07,712 INFO L225 Difference]: With dead ends: 29 [2025-03-17 12:23:07,712 INFO L226 Difference]: Without dead ends: 0 [2025-03-17 12:23:07,712 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 0 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-17 12:23:07,713 INFO L435 NwaCegarLoop]: 11 mSDtfsCounter, 6 mSDsluCounter, 10 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 21 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 12:23:07,713 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 21 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 12:23:07,713 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2025-03-17 12:23:07,713 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2025-03-17 12:23:07,713 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-17 12:23:07,713 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2025-03-17 12:23:07,713 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 25 [2025-03-17 12:23:07,713 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 12:23:07,713 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-03-17 12:23:07,713 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 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-17 12:23:07,714 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2025-03-17 12:23:07,714 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2025-03-17 12:23:07,715 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (6 of 7 remaining) [2025-03-17 12:23:07,716 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (5 of 7 remaining) [2025-03-17 12:23:07,716 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (4 of 7 remaining) [2025-03-17 12:23:07,716 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (3 of 7 remaining) [2025-03-17 12:23:07,716 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (2 of 7 remaining) [2025-03-17 12:23:07,716 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (1 of 7 remaining) [2025-03-17 12:23:07,716 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (0 of 7 remaining) [2025-03-17 12:23:07,716 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-17 12:23:07,718 INFO L422 BasicCegarLoop]: Path program histogram: [2, 2, 1, 1, 1] [2025-03-17 12:23:07,720 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-17 12:23:07,722 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 17.03 12:23:07 BoogieIcfgContainer [2025-03-17 12:23:07,722 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-17 12:23:07,722 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-17 12:23:07,725 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-17 12:23:07,726 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-17 12:23:07,726 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 12:23:05" (3/4) ... [2025-03-17 12:23:07,727 INFO L146 WitnessPrinter]: Generating witness for correct program [2025-03-17 12:23:07,733 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 10 nodes and edges [2025-03-17 12:23:07,733 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2025-03-17 12:23:07,733 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2025-03-17 12:23:07,733 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2025-03-17 12:23:07,784 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-03-17 12:23:07,784 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2025-03-17 12:23:07,784 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-17 12:23:07,785 INFO L158 Benchmark]: Toolchain (without parser) took 2869.29ms. Allocated memory is still 167.8MB. Free memory was 134.0MB in the beginning and 114.7MB in the end (delta: 19.2MB). Peak memory consumption was 15.0MB. Max. memory is 16.1GB. [2025-03-17 12:23:07,786 INFO L158 Benchmark]: CDTParser took 0.29ms. Allocated memory is still 209.7MB. Free memory is still 124.8MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-17 12:23:07,786 INFO L158 Benchmark]: CACSL2BoogieTranslator took 140.69ms. Allocated memory is still 167.8MB. Free memory was 133.5MB in the beginning and 123.5MB in the end (delta: 10.0MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-17 12:23:07,786 INFO L158 Benchmark]: Boogie Procedure Inliner took 19.45ms. Allocated memory is still 167.8MB. Free memory was 123.5MB in the beginning and 122.3MB in the end (delta: 1.2MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-17 12:23:07,787 INFO L158 Benchmark]: Boogie Preprocessor took 25.75ms. Allocated memory is still 167.8MB. Free memory was 122.3MB in the beginning and 121.4MB in the end (delta: 878.4kB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-17 12:23:07,788 INFO L158 Benchmark]: IcfgBuilder took 207.81ms. Allocated memory is still 167.8MB. Free memory was 121.0MB in the beginning and 108.9MB in the end (delta: 12.1MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-03-17 12:23:07,788 INFO L158 Benchmark]: TraceAbstraction took 2408.74ms. Allocated memory is still 167.8MB. Free memory was 108.1MB in the beginning and 120.7MB in the end (delta: -12.6MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-17 12:23:07,788 INFO L158 Benchmark]: Witness Printer took 62.43ms. Allocated memory is still 167.8MB. Free memory was 120.7MB in the beginning and 114.7MB in the end (delta: 5.9MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-17 12:23:07,789 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.29ms. Allocated memory is still 209.7MB. Free memory is still 124.8MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 140.69ms. Allocated memory is still 167.8MB. Free memory was 133.5MB in the beginning and 123.5MB in the end (delta: 10.0MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 19.45ms. Allocated memory is still 167.8MB. Free memory was 123.5MB in the beginning and 122.3MB in the end (delta: 1.2MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 25.75ms. Allocated memory is still 167.8MB. Free memory was 122.3MB in the beginning and 121.4MB in the end (delta: 878.4kB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 207.81ms. Allocated memory is still 167.8MB. Free memory was 121.0MB in the beginning and 108.9MB in the end (delta: 12.1MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 2408.74ms. Allocated memory is still 167.8MB. Free memory was 108.1MB in the beginning and 120.7MB in the end (delta: -12.6MB). There was no memory consumed. Max. memory is 16.1GB. * Witness Printer took 62.43ms. Allocated memory is still 167.8MB. Free memory was 120.7MB in the beginning and 114.7MB in the end (delta: 5.9MB). There was no memory consumed. 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: 9]: 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 - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 22 locations, 25 edges, 7 error locations. Started 1 CEGAR loops. OverallTime: 2.4s, OverallIterations: 7, TraceHistogramMax: 6, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 0.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 41 SdHoareTripleChecker+Valid, 0.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 41 mSDsluCounter, 165 SdHoareTripleChecker+Invalid, 0.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 74 mSDsCounter, 10 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 177 IncrementalHoareTripleChecker+Invalid, 187 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 10 mSolverCounterUnsat, 91 mSDtfsCounter, 177 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 70 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 69 ImplicationChecksByTransitivity, 0.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=31occurred in iteration=5, InterpolantAutomatonStates: 37, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 7 MinimizatonAttempts, 3 StatesRemovedByMinimization, 2 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 1.1s InterpolantComputationTime, 110 NumberOfCodeBlocks, 92 NumberOfCodeBlocksAsserted, 12 NumberOfCheckSat, 117 ConstructedInterpolants, 0 QuantifiedInterpolants, 923 SizeOfPredicates, 0 NumberOfNonLiveVariables, 175 ConjunctsInSsa, 24 ConjunctsInUnsatCore, 12 InterpolantComputations, 5 PerfectInterpolantSequences, 91/129 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 7 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2025-03-17 12:23:07,805 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE