./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/termination-15/cstrcspn_diffterm_alloca.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version e2fb8bed Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../sv-benchmarks/c/termination-15/cstrcspn_diffterm_alloca.i -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 6bebda7974b4ee09f480826bc3895f6f62b6e4c0586920bb97da4d140e226dad --- Real Ultimate output --- This is Ultimate 0.3.0-?-e2fb8be-m [2025-03-08 22:43:48,875 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-08 22:43:48,920 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-64bit-Automizer_Default.epf [2025-03-08 22:43:48,924 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-08 22:43:48,924 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-08 22:43:48,939 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-08 22:43:48,939 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-08 22:43:48,939 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-08 22:43:48,940 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-08 22:43:48,941 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-08 22:43:48,941 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-08 22:43:48,941 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-08 22:43:48,942 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-08 22:43:48,942 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-08 22:43:48,942 INFO L153 SettingsManager]: * Use SBE=true [2025-03-08 22:43:48,942 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-08 22:43:48,942 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-08 22:43:48,942 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-08 22:43:48,942 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2025-03-08 22:43:48,942 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2025-03-08 22:43:48,943 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2025-03-08 22:43:48,943 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-08 22:43:48,943 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-03-08 22:43:48,943 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-03-08 22:43:48,943 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-08 22:43:48,943 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-08 22:43:48,943 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-08 22:43:48,943 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-08 22:43:48,943 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-08 22:43:48,943 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-08 22:43:48,943 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 22:43:48,943 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-08 22:43:48,944 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-08 22:43:48,944 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-08 22:43:48,944 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-08 22:43:48,944 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-08 22:43:48,944 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-08 22:43:48,944 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-08 22:43:48,944 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-08 22:43:48,944 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 -> 6bebda7974b4ee09f480826bc3895f6f62b6e4c0586920bb97da4d140e226dad [2025-03-08 22:43:49,179 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-08 22:43:49,185 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-08 22:43:49,187 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-08 22:43:49,188 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-08 22:43:49,188 INFO L274 PluginConnector]: CDTParser initialized [2025-03-08 22:43:49,193 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/termination-15/cstrcspn_diffterm_alloca.i [2025-03-08 22:43:50,317 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/aec9f667c/9d197d742cd7446087843c008ee15184/FLAGb43fcdebe [2025-03-08 22:43:50,589 INFO L384 CDTParser]: Found 1 translation units. [2025-03-08 22:43:50,589 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/termination-15/cstrcspn_diffterm_alloca.i [2025-03-08 22:43:50,600 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/aec9f667c/9d197d742cd7446087843c008ee15184/FLAGb43fcdebe [2025-03-08 22:43:50,881 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/aec9f667c/9d197d742cd7446087843c008ee15184 [2025-03-08 22:43:50,882 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-08 22:43:50,883 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-08 22:43:50,884 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-08 22:43:50,884 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-08 22:43:50,887 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-08 22:43:50,887 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 10:43:50" (1/1) ... [2025-03-08 22:43:50,888 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1b3e12c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:43:50, skipping insertion in model container [2025-03-08 22:43:50,888 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 10:43:50" (1/1) ... [2025-03-08 22:43:50,903 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-08 22:43:51,081 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-03-08 22:43:51,082 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-03-08 22:43:51,084 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 22:43:51,092 INFO L200 MainTranslator]: Completed pre-run [2025-03-08 22:43:51,121 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 22:43:51,143 INFO L204 MainTranslator]: Completed translation [2025-03-08 22:43:51,144 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:43:51 WrapperNode [2025-03-08 22:43:51,144 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-08 22:43:51,145 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-08 22:43:51,145 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-08 22:43:51,145 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-08 22:43:51,149 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:43:51" (1/1) ... [2025-03-08 22:43:51,156 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:43:51" (1/1) ... [2025-03-08 22:43:51,170 INFO L138 Inliner]: procedures = 152, calls = 16, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 79 [2025-03-08 22:43:51,170 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-08 22:43:51,171 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-08 22:43:51,171 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-08 22:43:51,171 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-08 22:43:51,176 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:43:51" (1/1) ... [2025-03-08 22:43:51,176 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:43:51" (1/1) ... [2025-03-08 22:43:51,178 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:43:51" (1/1) ... [2025-03-08 22:43:51,186 INFO L175 MemorySlicer]: Split 7 memory accesses to 2 slices as follows [3, 4]. 57 percent of accesses are in the largest equivalence class. The 0 initializations are split as follows [0, 0]. The 2 writes are split as follows [1, 1]. [2025-03-08 22:43:51,187 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:43:51" (1/1) ... [2025-03-08 22:43:51,187 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:43:51" (1/1) ... [2025-03-08 22:43:51,191 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:43:51" (1/1) ... [2025-03-08 22:43:51,194 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:43:51" (1/1) ... [2025-03-08 22:43:51,195 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:43:51" (1/1) ... [2025-03-08 22:43:51,195 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:43:51" (1/1) ... [2025-03-08 22:43:51,196 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-08 22:43:51,197 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-08 22:43:51,197 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-08 22:43:51,197 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-08 22:43:51,198 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:43:51" (1/1) ... [2025-03-08 22:43:51,201 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 22:43:51,209 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 22:43:51,220 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-08 22:43:51,225 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-08 22:43:51,238 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-03-08 22:43:51,238 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-03-08 22:43:51,238 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-03-08 22:43:51,238 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-03-08 22:43:51,238 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-03-08 22:43:51,238 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-03-08 22:43:51,238 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-08 22:43:51,238 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-08 22:43:51,296 INFO L256 CfgBuilder]: Building ICFG [2025-03-08 22:43:51,297 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-08 22:43:51,457 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L392: havoc main_#t~ret217#1;call ULTIMATE.dealloc(main_#t~malloc215#1.base, main_#t~malloc215#1.offset);havoc main_#t~malloc215#1.base, main_#t~malloc215#1.offset;call ULTIMATE.dealloc(main_#t~malloc216#1.base, main_#t~malloc216#1.offset);havoc main_#t~malloc216#1.base, main_#t~malloc216#1.offset; [2025-03-08 22:43:51,467 INFO L? ?]: Removed 54 outVars from TransFormulas that were not future-live. [2025-03-08 22:43:51,468 INFO L307 CfgBuilder]: Performing block encoding [2025-03-08 22:43:51,474 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-08 22:43:51,474 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-08 22:43:51,475 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 10:43:51 BoogieIcfgContainer [2025-03-08 22:43:51,475 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-08 22:43:51,477 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-08 22:43:51,477 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-08 22:43:51,481 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-08 22:43:51,481 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.03 10:43:50" (1/3) ... [2025-03-08 22:43:51,481 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@24dd8a97 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 10:43:51, skipping insertion in model container [2025-03-08 22:43:51,481 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:43:51" (2/3) ... [2025-03-08 22:43:51,482 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@24dd8a97 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 10:43:51, skipping insertion in model container [2025-03-08 22:43:51,482 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 10:43:51" (3/3) ... [2025-03-08 22:43:51,483 INFO L128 eAbstractionObserver]: Analyzing ICFG cstrcspn_diffterm_alloca.i [2025-03-08 22:43:51,495 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-08 22:43:51,496 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG cstrcspn_diffterm_alloca.i that has 1 procedures, 40 locations, 1 initial locations, 2 loop locations, and 15 error locations. [2025-03-08 22:43:51,523 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-08 22:43:51,531 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;@82c00bd, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-08 22:43:51,531 INFO L334 AbstractCegarLoop]: Starting to check reachability of 15 error locations. [2025-03-08 22:43:51,534 INFO L276 IsEmpty]: Start isEmpty. Operand has 40 states, 24 states have (on average 1.9583333333333333) internal successors, (47), 39 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 22:43:51,537 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2025-03-08 22:43:51,537 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 22:43:51,537 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2025-03-08 22:43:51,538 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 12 more)] === [2025-03-08 22:43:51,541 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:43:51,541 INFO L85 PathProgramCache]: Analyzing trace with hash -1781391427, now seen corresponding path program 1 times [2025-03-08 22:43:51,546 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:43:51,546 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1759116430] [2025-03-08 22:43:51,546 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:43:51,547 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:43:51,600 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-03-08 22:43:51,633 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-03-08 22:43:51,634 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:43:51,635 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:43:51,864 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 22:43:51,866 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 22:43:51,866 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1759116430] [2025-03-08 22:43:51,866 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1759116430] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 22:43:51,867 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 22:43:51,867 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 22:43:51,868 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [871823535] [2025-03-08 22:43:51,868 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 22:43:51,870 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 22:43:51,871 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 22:43:51,886 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 22:43:51,886 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-08 22:43:51,888 INFO L87 Difference]: Start difference. First operand has 40 states, 24 states have (on average 1.9583333333333333) internal successors, (47), 39 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 4 states, 3 states have (on average 2.0) internal successors, (6), 4 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 22:43:51,948 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 22:43:51,949 INFO L93 Difference]: Finished difference Result 44 states and 50 transitions. [2025-03-08 22:43:51,950 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 22:43:51,951 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.0) internal successors, (6), 4 states have internal predecessors, (6), 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-08 22:43:51,951 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 22:43:51,955 INFO L225 Difference]: With dead ends: 44 [2025-03-08 22:43:51,955 INFO L226 Difference]: Without dead ends: 42 [2025-03-08 22:43:51,956 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-08 22:43:51,958 INFO L435 NwaCegarLoop]: 42 mSDtfsCounter, 2 mSDsluCounter, 62 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 104 SdHoareTripleChecker+Invalid, 30 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 30 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 22:43:51,958 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 104 Invalid, 30 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 30 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 22:43:51,967 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2025-03-08 22:43:51,974 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 41. [2025-03-08 22:43:51,975 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 41 states, 26 states have (on average 1.8461538461538463) internal successors, (48), 40 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 22:43:51,993 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 48 transitions. [2025-03-08 22:43:51,994 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 48 transitions. Word has length 6 [2025-03-08 22:43:51,994 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 22:43:51,994 INFO L471 AbstractCegarLoop]: Abstraction has 41 states and 48 transitions. [2025-03-08 22:43:51,994 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.0) internal successors, (6), 4 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 22:43:51,994 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 48 transitions. [2025-03-08 22:43:51,994 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2025-03-08 22:43:51,995 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 22:43:51,995 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2025-03-08 22:43:51,995 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-08 22:43:51,995 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 12 more)] === [2025-03-08 22:43:51,996 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:43:51,996 INFO L85 PathProgramCache]: Analyzing trace with hash -1781391428, now seen corresponding path program 1 times [2025-03-08 22:43:51,996 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:43:51,996 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1398026978] [2025-03-08 22:43:51,996 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:43:51,996 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:43:52,001 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-03-08 22:43:52,009 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-03-08 22:43:52,009 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:43:52,009 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:43:52,253 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 22:43:52,254 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 22:43:52,254 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1398026978] [2025-03-08 22:43:52,254 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1398026978] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 22:43:52,254 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 22:43:52,254 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 22:43:52,254 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1686037401] [2025-03-08 22:43:52,254 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 22:43:52,255 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 22:43:52,255 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 22:43:52,255 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 22:43:52,255 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-08 22:43:52,255 INFO L87 Difference]: Start difference. First operand 41 states and 48 transitions. Second operand has 4 states, 3 states have (on average 2.0) internal successors, (6), 4 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 22:43:52,292 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 22:43:52,292 INFO L93 Difference]: Finished difference Result 40 states and 46 transitions. [2025-03-08 22:43:52,292 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-08 22:43:52,292 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.0) internal successors, (6), 4 states have internal predecessors, (6), 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-08 22:43:52,293 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 22:43:52,293 INFO L225 Difference]: With dead ends: 40 [2025-03-08 22:43:52,293 INFO L226 Difference]: Without dead ends: 40 [2025-03-08 22:43:52,293 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-08 22:43:52,294 INFO L435 NwaCegarLoop]: 36 mSDtfsCounter, 7 mSDsluCounter, 54 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 90 SdHoareTripleChecker+Invalid, 31 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 30 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 22:43:52,294 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 90 Invalid, 31 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 30 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 22:43:52,294 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2025-03-08 22:43:52,296 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 40. [2025-03-08 22:43:52,296 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 40 states, 26 states have (on average 1.7692307692307692) internal successors, (46), 39 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 22:43:52,296 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 46 transitions. [2025-03-08 22:43:52,296 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 46 transitions. Word has length 6 [2025-03-08 22:43:52,297 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 22:43:52,297 INFO L471 AbstractCegarLoop]: Abstraction has 40 states and 46 transitions. [2025-03-08 22:43:52,297 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.0) internal successors, (6), 4 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 22:43:52,297 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 46 transitions. [2025-03-08 22:43:52,297 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2025-03-08 22:43:52,297 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 22:43:52,297 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2025-03-08 22:43:52,297 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-08 22:43:52,297 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 12 more)] === [2025-03-08 22:43:52,298 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:43:52,298 INFO L85 PathProgramCache]: Analyzing trace with hash -1781361636, now seen corresponding path program 1 times [2025-03-08 22:43:52,298 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:43:52,298 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [576560523] [2025-03-08 22:43:52,298 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:43:52,298 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:43:52,302 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-03-08 22:43:52,306 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-03-08 22:43:52,307 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:43:52,307 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:43:52,449 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 22:43:52,450 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 22:43:52,450 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [576560523] [2025-03-08 22:43:52,450 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [576560523] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 22:43:52,450 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 22:43:52,451 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 22:43:52,451 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [367507269] [2025-03-08 22:43:52,451 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 22:43:52,451 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 22:43:52,451 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 22:43:52,451 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 22:43:52,451 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2025-03-08 22:43:52,451 INFO L87 Difference]: Start difference. First operand 40 states and 46 transitions. Second operand has 5 states, 4 states have (on average 1.5) internal successors, (6), 5 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 22:43:52,465 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 22:43:52,465 INFO L93 Difference]: Finished difference Result 39 states and 45 transitions. [2025-03-08 22:43:52,467 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-08 22:43:52,467 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 1.5) internal successors, (6), 5 states have internal predecessors, (6), 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-08 22:43:52,467 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 22:43:52,467 INFO L225 Difference]: With dead ends: 39 [2025-03-08 22:43:52,467 INFO L226 Difference]: Without dead ends: 39 [2025-03-08 22:43:52,467 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2025-03-08 22:43:52,468 INFO L435 NwaCegarLoop]: 37 mSDtfsCounter, 2 mSDsluCounter, 36 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 73 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 22:43:52,468 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 73 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 22:43:52,468 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2025-03-08 22:43:52,469 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 36. [2025-03-08 22:43:52,469 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36 states, 23 states have (on average 1.7826086956521738) internal successors, (41), 35 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 22:43:52,470 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 41 transitions. [2025-03-08 22:43:52,470 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 41 transitions. Word has length 6 [2025-03-08 22:43:52,470 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 22:43:52,470 INFO L471 AbstractCegarLoop]: Abstraction has 36 states and 41 transitions. [2025-03-08 22:43:52,470 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 1.5) internal successors, (6), 5 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 22:43:52,470 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 41 transitions. [2025-03-08 22:43:52,470 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2025-03-08 22:43:52,470 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 22:43:52,470 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2025-03-08 22:43:52,470 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-08 22:43:52,470 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 12 more)] === [2025-03-08 22:43:52,472 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:43:52,472 INFO L85 PathProgramCache]: Analyzing trace with hash 611440593, now seen corresponding path program 1 times [2025-03-08 22:43:52,472 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:43:52,472 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [95798447] [2025-03-08 22:43:52,472 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:43:52,473 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:43:52,478 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-03-08 22:43:52,481 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-03-08 22:43:52,481 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:43:52,481 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:43:52,506 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 22:43:52,506 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 22:43:52,506 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [95798447] [2025-03-08 22:43:52,506 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [95798447] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 22:43:52,506 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 22:43:52,507 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-08 22:43:52,507 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [789793078] [2025-03-08 22:43:52,507 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 22:43:52,507 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 22:43:52,507 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 22:43:52,508 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 22:43:52,508 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 22:43:52,508 INFO L87 Difference]: Start difference. First operand 36 states and 41 transitions. Second operand has 3 states, 2 states have (on average 3.5) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 22:43:52,537 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 22:43:52,537 INFO L93 Difference]: Finished difference Result 35 states and 40 transitions. [2025-03-08 22:43:52,537 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 22:43:52,537 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 3.5) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2025-03-08 22:43:52,539 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 22:43:52,539 INFO L225 Difference]: With dead ends: 35 [2025-03-08 22:43:52,539 INFO L226 Difference]: Without dead ends: 35 [2025-03-08 22:43:52,539 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 22:43:52,540 INFO L435 NwaCegarLoop]: 36 mSDtfsCounter, 1 mSDsluCounter, 21 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 57 SdHoareTripleChecker+Invalid, 20 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 22:43:52,540 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 57 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 22:43:52,540 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2025-03-08 22:43:52,541 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 35. [2025-03-08 22:43:52,541 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35 states, 23 states have (on average 1.7391304347826086) internal successors, (40), 34 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 22:43:52,542 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 40 transitions. [2025-03-08 22:43:52,542 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 40 transitions. Word has length 7 [2025-03-08 22:43:52,542 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 22:43:52,542 INFO L471 AbstractCegarLoop]: Abstraction has 35 states and 40 transitions. [2025-03-08 22:43:52,542 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 3.5) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 22:43:52,542 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 40 transitions. [2025-03-08 22:43:52,542 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2025-03-08 22:43:52,542 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 22:43:52,542 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2025-03-08 22:43:52,542 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-08 22:43:52,543 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 12 more)] === [2025-03-08 22:43:52,543 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:43:52,543 INFO L85 PathProgramCache]: Analyzing trace with hash 611440594, now seen corresponding path program 1 times [2025-03-08 22:43:52,543 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:43:52,543 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1041429931] [2025-03-08 22:43:52,543 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:43:52,544 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:43:52,547 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-03-08 22:43:52,551 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-03-08 22:43:52,552 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:43:52,552 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:43:52,643 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 22:43:52,645 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 22:43:52,645 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1041429931] [2025-03-08 22:43:52,645 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1041429931] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 22:43:52,645 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 22:43:52,645 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 22:43:52,645 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [533496549] [2025-03-08 22:43:52,645 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 22:43:52,645 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 22:43:52,646 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 22:43:52,646 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 22:43:52,646 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-08 22:43:52,646 INFO L87 Difference]: Start difference. First operand 35 states and 40 transitions. Second operand has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 4 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 22:43:52,663 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 22:43:52,664 INFO L93 Difference]: Finished difference Result 38 states and 43 transitions. [2025-03-08 22:43:52,664 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 22:43:52,664 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 4 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2025-03-08 22:43:52,664 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 22:43:52,665 INFO L225 Difference]: With dead ends: 38 [2025-03-08 22:43:52,665 INFO L226 Difference]: Without dead ends: 38 [2025-03-08 22:43:52,665 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-08 22:43:52,666 INFO L435 NwaCegarLoop]: 37 mSDtfsCounter, 0 mSDsluCounter, 34 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 71 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-08 22:43:52,666 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 71 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 22:43:52,667 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2025-03-08 22:43:52,671 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 38. [2025-03-08 22:43:52,671 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38 states, 26 states have (on average 1.6538461538461537) internal successors, (43), 37 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 22:43:52,671 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 43 transitions. [2025-03-08 22:43:52,672 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 43 transitions. Word has length 7 [2025-03-08 22:43:52,672 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 22:43:52,672 INFO L471 AbstractCegarLoop]: Abstraction has 38 states and 43 transitions. [2025-03-08 22:43:52,672 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 4 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 22:43:52,672 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 43 transitions. [2025-03-08 22:43:52,672 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2025-03-08 22:43:52,672 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 22:43:52,672 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2025-03-08 22:43:52,672 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-08 22:43:52,672 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 12 more)] === [2025-03-08 22:43:52,672 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:43:52,672 INFO L85 PathProgramCache]: Analyzing trace with hash 611470385, now seen corresponding path program 1 times [2025-03-08 22:43:52,673 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:43:52,673 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1910753100] [2025-03-08 22:43:52,673 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:43:52,673 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:43:52,678 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-03-08 22:43:52,682 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-03-08 22:43:52,682 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:43:52,682 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:43:52,755 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 22:43:52,756 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 22:43:52,756 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1910753100] [2025-03-08 22:43:52,756 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1910753100] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 22:43:52,756 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 22:43:52,756 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 22:43:52,756 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1113867806] [2025-03-08 22:43:52,756 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 22:43:52,756 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 22:43:52,756 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 22:43:52,757 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 22:43:52,757 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2025-03-08 22:43:52,757 INFO L87 Difference]: Start difference. First operand 38 states and 43 transitions. Second operand has 5 states, 4 states have (on average 1.75) internal successors, (7), 5 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 22:43:52,786 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 22:43:52,786 INFO L93 Difference]: Finished difference Result 37 states and 42 transitions. [2025-03-08 22:43:52,786 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-08 22:43:52,786 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 1.75) internal successors, (7), 5 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2025-03-08 22:43:52,787 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 22:43:52,787 INFO L225 Difference]: With dead ends: 37 [2025-03-08 22:43:52,787 INFO L226 Difference]: Without dead ends: 37 [2025-03-08 22:43:52,787 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2025-03-08 22:43:52,788 INFO L435 NwaCegarLoop]: 34 mSDtfsCounter, 1 mSDsluCounter, 86 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 120 SdHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 22:43:52,789 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 120 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 22:43:52,791 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2025-03-08 22:43:52,792 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 34. [2025-03-08 22:43:52,793 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34 states, 23 states have (on average 1.6956521739130435) internal successors, (39), 33 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 22:43:52,793 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 39 transitions. [2025-03-08 22:43:52,794 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 39 transitions. Word has length 7 [2025-03-08 22:43:52,794 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 22:43:52,794 INFO L471 AbstractCegarLoop]: Abstraction has 34 states and 39 transitions. [2025-03-08 22:43:52,794 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 1.75) internal successors, (7), 5 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 22:43:52,794 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 39 transitions. [2025-03-08 22:43:52,794 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2025-03-08 22:43:52,794 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 22:43:52,794 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 22:43:52,794 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-08 22:43:52,795 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 12 more)] === [2025-03-08 22:43:52,795 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:43:52,795 INFO L85 PathProgramCache]: Analyzing trace with hash -816109299, now seen corresponding path program 1 times [2025-03-08 22:43:52,795 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:43:52,795 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2144411271] [2025-03-08 22:43:52,795 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:43:52,795 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:43:52,802 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-03-08 22:43:52,806 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-03-08 22:43:52,807 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:43:52,807 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:43:52,839 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 22:43:52,839 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 22:43:52,839 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2144411271] [2025-03-08 22:43:52,839 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2144411271] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 22:43:52,839 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 22:43:52,839 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 22:43:52,839 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1677470369] [2025-03-08 22:43:52,839 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 22:43:52,840 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 22:43:52,840 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 22:43:52,840 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 22:43:52,840 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-08 22:43:52,840 INFO L87 Difference]: Start difference. First operand 34 states and 39 transitions. Second operand has 4 states, 3 states have (on average 3.0) internal successors, (9), 4 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 22:43:52,872 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 22:43:52,872 INFO L93 Difference]: Finished difference Result 32 states and 37 transitions. [2025-03-08 22:43:52,872 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 22:43:52,873 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 3.0) internal successors, (9), 4 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2025-03-08 22:43:52,873 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 22:43:52,873 INFO L225 Difference]: With dead ends: 32 [2025-03-08 22:43:52,873 INFO L226 Difference]: Without dead ends: 32 [2025-03-08 22:43:52,873 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-08 22:43:52,874 INFO L435 NwaCegarLoop]: 22 mSDtfsCounter, 22 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 40 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 44 SdHoareTripleChecker+Invalid, 43 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 40 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 22:43:52,875 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [22 Valid, 44 Invalid, 43 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 40 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 22:43:52,875 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2025-03-08 22:43:52,877 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 32. [2025-03-08 22:43:52,878 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 23 states have (on average 1.608695652173913) internal successors, (37), 31 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 22:43:52,878 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 37 transitions. [2025-03-08 22:43:52,878 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 37 transitions. Word has length 9 [2025-03-08 22:43:52,878 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 22:43:52,878 INFO L471 AbstractCegarLoop]: Abstraction has 32 states and 37 transitions. [2025-03-08 22:43:52,878 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 3.0) internal successors, (9), 4 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 22:43:52,878 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 37 transitions. [2025-03-08 22:43:52,878 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2025-03-08 22:43:52,878 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 22:43:52,881 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 22:43:52,881 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-08 22:43:52,881 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 12 more)] === [2025-03-08 22:43:52,881 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:43:52,881 INFO L85 PathProgramCache]: Analyzing trace with hash -816109298, now seen corresponding path program 1 times [2025-03-08 22:43:52,882 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:43:52,882 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1879394002] [2025-03-08 22:43:52,882 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:43:52,882 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:43:52,887 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-03-08 22:43:52,893 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-03-08 22:43:52,893 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:43:52,893 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:43:52,971 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 22:43:52,971 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 22:43:52,971 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1879394002] [2025-03-08 22:43:52,971 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1879394002] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 22:43:52,971 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 22:43:52,971 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 22:43:52,971 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1287689576] [2025-03-08 22:43:52,972 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 22:43:52,972 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 22:43:52,972 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 22:43:52,972 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 22:43:52,972 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-08 22:43:52,972 INFO L87 Difference]: Start difference. First operand 32 states and 37 transitions. Second operand has 6 states, 5 states have (on average 1.8) internal successors, (9), 6 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 22:43:53,029 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 22:43:53,029 INFO L93 Difference]: Finished difference Result 51 states and 60 transitions. [2025-03-08 22:43:53,030 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-08 22:43:53,030 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 1.8) internal successors, (9), 6 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2025-03-08 22:43:53,030 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 22:43:53,031 INFO L225 Difference]: With dead ends: 51 [2025-03-08 22:43:53,032 INFO L226 Difference]: Without dead ends: 51 [2025-03-08 22:43:53,032 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-08 22:43:53,032 INFO L435 NwaCegarLoop]: 22 mSDtfsCounter, 21 mSDsluCounter, 74 mSDsCounter, 0 mSdLazyCounter, 80 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 96 SdHoareTripleChecker+Invalid, 82 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 80 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 22:43:53,033 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [21 Valid, 96 Invalid, 82 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 80 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 22:43:53,033 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2025-03-08 22:43:53,035 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 35. [2025-03-08 22:43:53,037 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35 states, 26 states have (on average 1.5769230769230769) internal successors, (41), 34 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 22:43:53,037 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 41 transitions. [2025-03-08 22:43:53,037 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 41 transitions. Word has length 9 [2025-03-08 22:43:53,037 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 22:43:53,038 INFO L471 AbstractCegarLoop]: Abstraction has 35 states and 41 transitions. [2025-03-08 22:43:53,038 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 1.8) internal successors, (9), 6 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 22:43:53,038 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 41 transitions. [2025-03-08 22:43:53,038 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2025-03-08 22:43:53,038 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 22:43:53,038 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 22:43:53,038 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-08 22:43:53,038 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 12 more)] === [2025-03-08 22:43:53,050 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:43:53,050 INFO L85 PathProgramCache]: Analyzing trace with hash -329762965, now seen corresponding path program 1 times [2025-03-08 22:43:53,050 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:43:53,050 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2081002086] [2025-03-08 22:43:53,050 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:43:53,050 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:43:53,058 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-03-08 22:43:53,064 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-03-08 22:43:53,064 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:43:53,064 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:43:53,172 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 22:43:53,172 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 22:43:53,172 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2081002086] [2025-03-08 22:43:53,173 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2081002086] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 22:43:53,173 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 22:43:53,173 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 22:43:53,173 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [209265875] [2025-03-08 22:43:53,173 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 22:43:53,173 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 22:43:53,173 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 22:43:53,174 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 22:43:53,174 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-08 22:43:53,174 INFO L87 Difference]: Start difference. First operand 35 states and 41 transitions. Second operand has 4 states, 3 states have (on average 4.333333333333333) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 22:43:53,198 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 22:43:53,199 INFO L93 Difference]: Finished difference Result 34 states and 40 transitions. [2025-03-08 22:43:53,199 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 22:43:53,199 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 4.333333333333333) internal successors, (13), 4 states have internal predecessors, (13), 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-08 22:43:53,199 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 22:43:53,199 INFO L225 Difference]: With dead ends: 34 [2025-03-08 22:43:53,199 INFO L226 Difference]: Without dead ends: 31 [2025-03-08 22:43:53,200 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-08 22:43:53,200 INFO L435 NwaCegarLoop]: 24 mSDtfsCounter, 24 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 46 SdHoareTripleChecker+Invalid, 27 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 27 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 22:43:53,200 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [24 Valid, 46 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 22:43:53,201 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2025-03-08 22:43:53,201 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 31. [2025-03-08 22:43:53,201 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31 states, 23 states have (on average 1.5217391304347827) internal successors, (35), 30 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 22:43:53,202 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 35 transitions. [2025-03-08 22:43:53,202 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 35 transitions. Word has length 13 [2025-03-08 22:43:53,202 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 22:43:53,202 INFO L471 AbstractCegarLoop]: Abstraction has 31 states and 35 transitions. [2025-03-08 22:43:53,202 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 4.333333333333333) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 22:43:53,202 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 35 transitions. [2025-03-08 22:43:53,202 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2025-03-08 22:43:53,202 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 22:43:53,203 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 22:43:53,203 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-08 22:43:53,203 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 12 more)] === [2025-03-08 22:43:53,203 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:43:53,203 INFO L85 PathProgramCache]: Analyzing trace with hash -329708317, now seen corresponding path program 1 times [2025-03-08 22:43:53,203 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:43:53,203 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [903564944] [2025-03-08 22:43:53,203 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:43:53,203 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:43:53,209 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-03-08 22:43:53,212 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-03-08 22:43:53,212 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:43:53,212 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:43:53,241 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 22:43:53,241 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 22:43:53,241 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [903564944] [2025-03-08 22:43:53,241 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [903564944] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 22:43:53,242 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 22:43:53,242 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 22:43:53,242 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1503471174] [2025-03-08 22:43:53,242 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 22:43:53,242 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 22:43:53,242 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 22:43:53,242 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 22:43:53,242 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-08 22:43:53,243 INFO L87 Difference]: Start difference. First operand 31 states and 35 transitions. Second operand has 5 states, 4 states have (on average 3.25) internal successors, (13), 5 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 22:43:53,275 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 22:43:53,275 INFO L93 Difference]: Finished difference Result 28 states and 32 transitions. [2025-03-08 22:43:53,276 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-08 22:43:53,276 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 3.25) internal successors, (13), 5 states have internal predecessors, (13), 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-08 22:43:53,276 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 22:43:53,276 INFO L225 Difference]: With dead ends: 28 [2025-03-08 22:43:53,276 INFO L226 Difference]: Without dead ends: 28 [2025-03-08 22:43:53,277 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-08 22:43:53,277 INFO L435 NwaCegarLoop]: 16 mSDtfsCounter, 27 mSDsluCounter, 23 mSDsCounter, 0 mSdLazyCounter, 42 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 39 SdHoareTripleChecker+Invalid, 46 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 42 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 22:43:53,277 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [27 Valid, 39 Invalid, 46 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 42 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 22:43:53,277 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2025-03-08 22:43:53,278 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 28. [2025-03-08 22:43:53,278 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 23 states have (on average 1.391304347826087) 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-08 22:43:53,278 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 32 transitions. [2025-03-08 22:43:53,278 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 32 transitions. Word has length 13 [2025-03-08 22:43:53,278 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 22:43:53,278 INFO L471 AbstractCegarLoop]: Abstraction has 28 states and 32 transitions. [2025-03-08 22:43:53,278 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 3.25) internal successors, (13), 5 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 22:43:53,278 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 32 transitions. [2025-03-08 22:43:53,278 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2025-03-08 22:43:53,279 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 22:43:53,279 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 22:43:53,279 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-08 22:43:53,279 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 12 more)] === [2025-03-08 22:43:53,279 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:43:53,279 INFO L85 PathProgramCache]: Analyzing trace with hash -329708316, now seen corresponding path program 1 times [2025-03-08 22:43:53,279 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:43:53,279 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [787799003] [2025-03-08 22:43:53,279 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:43:53,279 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:43:53,284 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-03-08 22:43:53,291 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-03-08 22:43:53,291 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:43:53,291 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:43:53,418 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 22:43:53,418 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 22:43:53,418 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [787799003] [2025-03-08 22:43:53,418 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [787799003] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 22:43:53,418 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 22:43:53,418 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-08 22:43:53,418 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [126563279] [2025-03-08 22:43:53,418 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 22:43:53,418 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-08 22:43:53,418 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 22:43:53,419 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-08 22:43:53,419 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-03-08 22:43:53,419 INFO L87 Difference]: Start difference. First operand 28 states and 32 transitions. Second operand has 7 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 7 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 22:43:53,480 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 22:43:53,480 INFO L93 Difference]: Finished difference Result 35 states and 41 transitions. [2025-03-08 22:43:53,481 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-08 22:43:53,481 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 7 states have internal predecessors, (13), 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-08 22:43:53,481 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 22:43:53,481 INFO L225 Difference]: With dead ends: 35 [2025-03-08 22:43:53,481 INFO L226 Difference]: Without dead ends: 35 [2025-03-08 22:43:53,482 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2025-03-08 22:43:53,482 INFO L435 NwaCegarLoop]: 13 mSDtfsCounter, 35 mSDsluCounter, 50 mSDsCounter, 0 mSdLazyCounter, 80 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 35 SdHoareTripleChecker+Valid, 63 SdHoareTripleChecker+Invalid, 83 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 80 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 22:43:53,485 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [35 Valid, 63 Invalid, 83 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 80 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 22:43:53,485 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2025-03-08 22:43:53,486 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 35. [2025-03-08 22:43:53,486 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35 states, 30 states have (on average 1.3666666666666667) internal successors, (41), 34 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 22:43:53,486 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 41 transitions. [2025-03-08 22:43:53,486 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 41 transitions. Word has length 13 [2025-03-08 22:43:53,486 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 22:43:53,486 INFO L471 AbstractCegarLoop]: Abstraction has 35 states and 41 transitions. [2025-03-08 22:43:53,486 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 7 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 22:43:53,486 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 41 transitions. [2025-03-08 22:43:53,486 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2025-03-08 22:43:53,487 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 22:43:53,487 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 22:43:53,487 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-08 22:43:53,487 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 12 more)] === [2025-03-08 22:43:53,487 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:43:53,487 INFO L85 PathProgramCache]: Analyzing trace with hash -848329333, now seen corresponding path program 1 times [2025-03-08 22:43:53,487 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:43:53,487 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1348700220] [2025-03-08 22:43:53,487 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:43:53,487 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:43:53,496 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-03-08 22:43:53,498 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-03-08 22:43:53,499 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:43:53,499 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:43:53,517 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 22:43:53,517 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 22:43:53,517 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1348700220] [2025-03-08 22:43:53,517 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1348700220] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 22:43:53,517 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 22:43:53,517 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 22:43:53,518 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [448043543] [2025-03-08 22:43:53,518 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 22:43:53,518 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 22:43:53,518 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 22:43:53,518 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 22:43:53,518 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 22:43:53,518 INFO L87 Difference]: Start difference. First operand 35 states and 41 transitions. Second operand has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 3 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 22:43:53,524 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 22:43:53,525 INFO L93 Difference]: Finished difference Result 37 states and 43 transitions. [2025-03-08 22:43:53,525 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 22:43:53,525 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 3 states have internal predecessors, (17), 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 17 [2025-03-08 22:43:53,525 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 22:43:53,525 INFO L225 Difference]: With dead ends: 37 [2025-03-08 22:43:53,526 INFO L226 Difference]: Without dead ends: 37 [2025-03-08 22:43:53,526 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 22:43:53,526 INFO L435 NwaCegarLoop]: 28 mSDtfsCounter, 0 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 50 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 22:43:53,527 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 50 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 22:43:53,527 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2025-03-08 22:43:53,528 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 37. [2025-03-08 22:43:53,529 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 37 states, 32 states have (on average 1.34375) internal successors, (43), 36 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 22:43:53,529 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 43 transitions. [2025-03-08 22:43:53,529 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 43 transitions. Word has length 17 [2025-03-08 22:43:53,531 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 22:43:53,531 INFO L471 AbstractCegarLoop]: Abstraction has 37 states and 43 transitions. [2025-03-08 22:43:53,531 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 3 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 22:43:53,531 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 43 transitions. [2025-03-08 22:43:53,531 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2025-03-08 22:43:53,531 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 22:43:53,531 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 22:43:53,532 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-08 22:43:53,532 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 12 more)] === [2025-03-08 22:43:53,532 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:43:53,532 INFO L85 PathProgramCache]: Analyzing trace with hash 798425225, now seen corresponding path program 1 times [2025-03-08 22:43:53,532 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:43:53,532 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1689058713] [2025-03-08 22:43:53,532 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:43:53,532 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:43:53,540 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-03-08 22:43:53,551 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-03-08 22:43:53,551 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:43:53,551 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:43:53,664 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-08 22:43:53,664 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 22:43:53,664 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1689058713] [2025-03-08 22:43:53,664 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1689058713] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 22:43:53,664 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 22:43:53,664 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-08 22:43:53,665 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1127116427] [2025-03-08 22:43:53,665 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 22:43:53,665 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-08 22:43:53,665 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 22:43:53,665 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-08 22:43:53,665 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-03-08 22:43:53,665 INFO L87 Difference]: Start difference. First operand 37 states and 43 transitions. Second operand has 7 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 7 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 22:43:53,693 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 22:43:53,693 INFO L93 Difference]: Finished difference Result 44 states and 50 transitions. [2025-03-08 22:43:53,694 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-08 22:43:53,694 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 7 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2025-03-08 22:43:53,694 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 22:43:53,694 INFO L225 Difference]: With dead ends: 44 [2025-03-08 22:43:53,694 INFO L226 Difference]: Without dead ends: 37 [2025-03-08 22:43:53,694 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2025-03-08 22:43:53,695 INFO L435 NwaCegarLoop]: 25 mSDtfsCounter, 2 mSDsluCounter, 112 mSDsCounter, 0 mSdLazyCounter, 36 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 137 SdHoareTripleChecker+Invalid, 36 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 36 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 22:43:53,695 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 137 Invalid, 36 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 36 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 22:43:53,695 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2025-03-08 22:43:53,696 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 37. [2025-03-08 22:43:53,696 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 37 states, 32 states have (on average 1.3125) internal successors, (42), 36 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 22:43:53,696 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 42 transitions. [2025-03-08 22:43:53,697 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 42 transitions. Word has length 19 [2025-03-08 22:43:53,697 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 22:43:53,697 INFO L471 AbstractCegarLoop]: Abstraction has 37 states and 42 transitions. [2025-03-08 22:43:53,697 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 7 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 22:43:53,697 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 42 transitions. [2025-03-08 22:43:53,697 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2025-03-08 22:43:53,697 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 22:43:53,697 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 22:43:53,697 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-08 22:43:53,697 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 12 more)] === [2025-03-08 22:43:53,698 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:43:53,698 INFO L85 PathProgramCache]: Analyzing trace with hash -2143232374, now seen corresponding path program 1 times [2025-03-08 22:43:53,698 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:43:53,698 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [874044817] [2025-03-08 22:43:53,698 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:43:53,698 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:43:53,705 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-03-08 22:43:53,714 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-03-08 22:43:53,714 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:43:53,714 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:43:53,851 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 22:43:53,852 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 22:43:53,852 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [874044817] [2025-03-08 22:43:53,852 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [874044817] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 22:43:53,852 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 22:43:53,852 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-08 22:43:53,852 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [401076672] [2025-03-08 22:43:53,852 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 22:43:53,853 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-08 22:43:53,853 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 22:43:53,853 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-08 22:43:53,854 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2025-03-08 22:43:53,854 INFO L87 Difference]: Start difference. First operand 37 states and 42 transitions. Second operand has 9 states, 9 states have (on average 2.111111111111111) internal successors, (19), 9 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 22:43:53,925 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 22:43:53,926 INFO L93 Difference]: Finished difference Result 56 states and 61 transitions. [2025-03-08 22:43:53,926 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-08 22:43:53,926 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 2.111111111111111) internal successors, (19), 9 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2025-03-08 22:43:53,926 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 22:43:53,927 INFO L225 Difference]: With dead ends: 56 [2025-03-08 22:43:53,927 INFO L226 Difference]: Without dead ends: 56 [2025-03-08 22:43:53,927 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=32, Invalid=100, Unknown=0, NotChecked=0, Total=132 [2025-03-08 22:43:53,927 INFO L435 NwaCegarLoop]: 19 mSDtfsCounter, 17 mSDsluCounter, 119 mSDsCounter, 0 mSdLazyCounter, 84 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 138 SdHoareTripleChecker+Invalid, 85 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 84 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 22:43:53,927 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 138 Invalid, 85 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 84 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 22:43:53,928 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2025-03-08 22:43:53,929 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 54. [2025-03-08 22:43:53,929 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 54 states, 49 states have (on average 1.2448979591836735) internal successors, (61), 53 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 22:43:53,930 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 61 transitions. [2025-03-08 22:43:53,930 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 61 transitions. Word has length 19 [2025-03-08 22:43:53,930 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 22:43:53,930 INFO L471 AbstractCegarLoop]: Abstraction has 54 states and 61 transitions. [2025-03-08 22:43:53,930 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 2.111111111111111) internal successors, (19), 9 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 22:43:53,930 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 61 transitions. [2025-03-08 22:43:53,930 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2025-03-08 22:43:53,930 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 22:43:53,930 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 22:43:53,931 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-08 22:43:53,931 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 12 more)] === [2025-03-08 22:43:53,931 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:43:53,931 INFO L85 PathProgramCache]: Analyzing trace with hash -2142405158, now seen corresponding path program 1 times [2025-03-08 22:43:53,931 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:43:53,931 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [851059348] [2025-03-08 22:43:53,931 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:43:53,931 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:43:53,936 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-03-08 22:43:53,941 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-03-08 22:43:53,941 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:43:53,941 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:43:54,163 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 22:43:54,163 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 22:43:54,163 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [851059348] [2025-03-08 22:43:54,163 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [851059348] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 22:43:54,164 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1400665287] [2025-03-08 22:43:54,164 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:43:54,164 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 22:43:54,164 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 22:43:54,166 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 22:43:54,172 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-08 22:43:54,212 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-03-08 22:43:54,225 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-03-08 22:43:54,226 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:43:54,226 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:43:54,227 INFO L256 TraceCheckSpWp]: Trace formula consists of 120 conjuncts, 38 conjuncts are in the unsatisfiable core [2025-03-08 22:43:54,231 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 22:43:54,278 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 14 treesize of output 10 [2025-03-08 22:43:54,481 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-08 22:43:54,482 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 18 treesize of output 19 [2025-03-08 22:43:54,779 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 22:43:54,780 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 22:43:55,173 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 11 [2025-03-08 22:43:55,179 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 20 [2025-03-08 22:43:55,186 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2025-03-08 22:43:55,197 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 22:43:55,197 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1400665287] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 22:43:55,197 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 22:43:55,197 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 12, 12] total 29 [2025-03-08 22:43:55,197 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [988050700] [2025-03-08 22:43:55,198 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 22:43:55,198 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2025-03-08 22:43:55,198 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 22:43:55,198 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2025-03-08 22:43:55,198 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=112, Invalid=758, Unknown=0, NotChecked=0, Total=870 [2025-03-08 22:43:55,198 INFO L87 Difference]: Start difference. First operand 54 states and 61 transitions. Second operand has 30 states, 29 states have (on average 1.7241379310344827) internal successors, (50), 30 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 22:43:55,678 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 22:43:55,679 INFO L93 Difference]: Finished difference Result 118 states and 133 transitions. [2025-03-08 22:43:55,679 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-03-08 22:43:55,679 INFO L78 Accepts]: Start accepts. Automaton has has 30 states, 29 states have (on average 1.7241379310344827) internal successors, (50), 30 states have internal predecessors, (50), 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 19 [2025-03-08 22:43:55,679 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 22:43:55,680 INFO L225 Difference]: With dead ends: 118 [2025-03-08 22:43:55,680 INFO L226 Difference]: Without dead ends: 118 [2025-03-08 22:43:55,680 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 15 SyntacticMatches, 1 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 288 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=254, Invalid=1152, Unknown=0, NotChecked=0, Total=1406 [2025-03-08 22:43:55,681 INFO L435 NwaCegarLoop]: 17 mSDtfsCounter, 136 mSDsluCounter, 207 mSDsCounter, 0 mSdLazyCounter, 417 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 136 SdHoareTripleChecker+Valid, 224 SdHoareTripleChecker+Invalid, 426 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 417 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-08 22:43:55,681 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [136 Valid, 224 Invalid, 426 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 417 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-08 22:43:55,681 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118 states. [2025-03-08 22:43:55,686 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118 to 80. [2025-03-08 22:43:55,686 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 80 states, 76 states have (on average 1.2236842105263157) internal successors, (93), 79 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 22:43:55,686 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 93 transitions. [2025-03-08 22:43:55,686 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 93 transitions. Word has length 19 [2025-03-08 22:43:55,687 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 22:43:55,687 INFO L471 AbstractCegarLoop]: Abstraction has 80 states and 93 transitions. [2025-03-08 22:43:55,687 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 29 states have (on average 1.7241379310344827) internal successors, (50), 30 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 22:43:55,687 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 93 transitions. [2025-03-08 22:43:55,687 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2025-03-08 22:43:55,687 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 22:43:55,687 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 22:43:55,694 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-03-08 22:43:55,887 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2025-03-08 22:43:55,888 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 12 more)] === [2025-03-08 22:43:55,888 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:43:55,888 INFO L85 PathProgramCache]: Analyzing trace with hash 1641200745, now seen corresponding path program 1 times [2025-03-08 22:43:55,888 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:43:55,888 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1712543992] [2025-03-08 22:43:55,888 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:43:55,888 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:43:55,900 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-03-08 22:43:55,909 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-03-08 22:43:55,910 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:43:55,910 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:43:56,164 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 22:43:56,165 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 22:43:56,165 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1712543992] [2025-03-08 22:43:56,165 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1712543992] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 22:43:56,165 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [637521402] [2025-03-08 22:43:56,165 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:43:56,165 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 22:43:56,165 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 22:43:56,167 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 22:43:56,169 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-08 22:43:56,207 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-03-08 22:43:56,221 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-03-08 22:43:56,221 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:43:56,221 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:43:56,222 INFO L256 TraceCheckSpWp]: Trace formula consists of 122 conjuncts, 33 conjuncts are in the unsatisfiable core [2025-03-08 22:43:56,224 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 22:43:56,249 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 14 treesize of output 10 [2025-03-08 22:43:56,369 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-08 22:43:56,369 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 18 treesize of output 15 [2025-03-08 22:43:56,471 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 22:43:56,471 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 22:43:56,696 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 11 [2025-03-08 22:43:56,698 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 12 [2025-03-08 22:43:56,702 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 17 [2025-03-08 22:43:56,741 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 22:43:56,742 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [637521402] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 22:43:56,742 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 22:43:56,742 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 25 [2025-03-08 22:43:56,742 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [131910811] [2025-03-08 22:43:56,742 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 22:43:56,742 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2025-03-08 22:43:56,742 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 22:43:56,742 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2025-03-08 22:43:56,743 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=90, Invalid=560, Unknown=0, NotChecked=0, Total=650 [2025-03-08 22:43:56,743 INFO L87 Difference]: Start difference. First operand 80 states and 93 transitions. Second operand has 26 states, 25 states have (on average 1.92) internal successors, (48), 26 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 22:43:57,189 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 22:43:57,189 INFO L93 Difference]: Finished difference Result 96 states and 111 transitions. [2025-03-08 22:43:57,189 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-03-08 22:43:57,189 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 25 states have (on average 1.92) internal successors, (48), 26 states have internal predecessors, (48), 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 19 [2025-03-08 22:43:57,189 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 22:43:57,190 INFO L225 Difference]: With dead ends: 96 [2025-03-08 22:43:57,190 INFO L226 Difference]: Without dead ends: 96 [2025-03-08 22:43:57,190 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 21 SyntacticMatches, 1 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 196 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=205, Invalid=1055, Unknown=0, NotChecked=0, Total=1260 [2025-03-08 22:43:57,190 INFO L435 NwaCegarLoop]: 14 mSDtfsCounter, 111 mSDsluCounter, 124 mSDsCounter, 0 mSdLazyCounter, 268 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 111 SdHoareTripleChecker+Valid, 138 SdHoareTripleChecker+Invalid, 277 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 268 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-08 22:43:57,191 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [111 Valid, 138 Invalid, 277 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 268 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-08 22:43:57,191 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2025-03-08 22:43:57,192 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 76. [2025-03-08 22:43:57,193 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 76 states, 74 states have (on average 1.1756756756756757) internal successors, (87), 75 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 22:43:57,193 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 87 transitions. [2025-03-08 22:43:57,193 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 87 transitions. Word has length 19 [2025-03-08 22:43:57,194 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 22:43:57,194 INFO L471 AbstractCegarLoop]: Abstraction has 76 states and 87 transitions. [2025-03-08 22:43:57,194 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 25 states have (on average 1.92) internal successors, (48), 26 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 22:43:57,194 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 87 transitions. [2025-03-08 22:43:57,194 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2025-03-08 22:43:57,194 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 22:43:57,194 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 22:43:57,201 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-03-08 22:43:57,394 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2025-03-08 22:43:57,395 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 12 more)] === [2025-03-08 22:43:57,395 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:43:57,395 INFO L85 PathProgramCache]: Analyzing trace with hash -999409586, now seen corresponding path program 2 times [2025-03-08 22:43:57,395 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:43:57,395 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [497187518] [2025-03-08 22:43:57,395 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-08 22:43:57,395 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:43:57,401 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 25 statements into 2 equivalence classes. [2025-03-08 22:43:57,414 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 25 of 25 statements. [2025-03-08 22:43:57,414 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-08 22:43:57,414 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:43:57,849 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 22:43:57,849 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 22:43:57,849 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [497187518] [2025-03-08 22:43:57,850 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [497187518] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 22:43:57,851 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1768866739] [2025-03-08 22:43:57,851 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-08 22:43:57,851 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 22:43:57,851 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 22:43:57,852 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 22:43:57,853 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-03-08 22:43:57,896 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 25 statements into 2 equivalence classes. [2025-03-08 22:43:57,915 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 25 of 25 statements. [2025-03-08 22:43:57,915 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-08 22:43:57,915 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:43:57,917 INFO L256 TraceCheckSpWp]: Trace formula consists of 146 conjuncts, 49 conjuncts are in the unsatisfiable core [2025-03-08 22:43:57,919 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 22:43:57,955 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 14 treesize of output 10 [2025-03-08 22:44:11,229 INFO L349 Elim1Store]: treesize reduction 8, result has 52.9 percent of original size [2025-03-08 22:44:11,229 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 29 treesize of output 20 [2025-03-08 22:44:11,242 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 1 proven. 4 refuted. 3 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 22:44:11,242 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 22:44:11,690 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 25 [2025-03-08 22:44:11,693 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-08 22:44:11,693 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 29 treesize of output 23 [2025-03-08 22:44:11,697 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 17 [2025-03-08 22:44:11,755 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 22:44:11,755 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1768866739] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 22:44:11,755 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 22:44:11,755 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 15, 14] total 35 [2025-03-08 22:44:11,755 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2007913425] [2025-03-08 22:44:11,755 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 22:44:11,756 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 36 states [2025-03-08 22:44:11,756 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 22:44:11,756 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2025-03-08 22:44:11,756 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=157, Invalid=1100, Unknown=3, NotChecked=0, Total=1260 [2025-03-08 22:44:11,757 INFO L87 Difference]: Start difference. First operand 76 states and 87 transitions. Second operand has 36 states, 35 states have (on average 1.8571428571428572) internal successors, (65), 36 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 22:44:12,854 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 22:44:12,854 INFO L93 Difference]: Finished difference Result 99 states and 113 transitions. [2025-03-08 22:44:12,855 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2025-03-08 22:44:12,855 INFO L78 Accepts]: Start accepts. Automaton has has 36 states, 35 states have (on average 1.8571428571428572) internal successors, (65), 36 states have internal predecessors, (65), 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-08 22:44:12,855 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 22:44:12,855 INFO L225 Difference]: With dead ends: 99 [2025-03-08 22:44:12,855 INFO L226 Difference]: Without dead ends: 99 [2025-03-08 22:44:12,856 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 24 SyntacticMatches, 1 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 434 ImplicationChecksByTransitivity, 14.3s TimeCoverageRelationStatistics Valid=389, Invalid=2158, Unknown=3, NotChecked=0, Total=2550 [2025-03-08 22:44:12,857 INFO L435 NwaCegarLoop]: 13 mSDtfsCounter, 107 mSDsluCounter, 168 mSDsCounter, 0 mSdLazyCounter, 578 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 107 SdHoareTripleChecker+Valid, 181 SdHoareTripleChecker+Invalid, 581 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 578 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-08 22:44:12,857 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [107 Valid, 181 Invalid, 581 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 578 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-08 22:44:12,857 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2025-03-08 22:44:12,859 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 61. [2025-03-08 22:44:12,859 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 61 states, 60 states have (on average 1.1166666666666667) internal successors, (67), 60 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 22:44:12,859 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 67 transitions. [2025-03-08 22:44:12,859 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 67 transitions. Word has length 25 [2025-03-08 22:44:12,859 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 22:44:12,859 INFO L471 AbstractCegarLoop]: Abstraction has 61 states and 67 transitions. [2025-03-08 22:44:12,859 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 36 states, 35 states have (on average 1.8571428571428572) internal successors, (65), 36 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 22:44:12,859 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 67 transitions. [2025-03-08 22:44:12,860 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2025-03-08 22:44:12,860 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 22:44:12,860 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 22:44:12,866 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-03-08 22:44:13,060 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 22:44:13,060 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 12 more)] === [2025-03-08 22:44:13,061 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:44:13,061 INFO L85 PathProgramCache]: Analyzing trace with hash -1963235931, now seen corresponding path program 2 times [2025-03-08 22:44:13,061 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:44:13,061 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [4912328] [2025-03-08 22:44:13,061 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-08 22:44:13,061 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:44:13,066 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 29 statements into 2 equivalence classes. [2025-03-08 22:44:13,077 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 29 of 29 statements. [2025-03-08 22:44:13,077 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-08 22:44:13,077 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:44:13,533 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 22:44:13,533 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 22:44:13,533 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [4912328] [2025-03-08 22:44:13,533 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [4912328] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 22:44:13,533 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [431308838] [2025-03-08 22:44:13,533 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-08 22:44:13,533 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 22:44:13,534 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 22:44:13,536 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 22:44:13,538 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-03-08 22:44:13,577 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 29 statements into 2 equivalence classes. [2025-03-08 22:44:13,594 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 29 of 29 statements. [2025-03-08 22:44:13,595 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-08 22:44:13,595 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:44:13,596 INFO L256 TraceCheckSpWp]: Trace formula consists of 159 conjuncts, 57 conjuncts are in the unsatisfiable core [2025-03-08 22:44:13,598 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 22:44:13,633 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 14 treesize of output 10 [2025-03-08 22:44:14,123 INFO L349 Elim1Store]: treesize reduction 4, result has 76.5 percent of original size [2025-03-08 22:44:14,123 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 28 treesize of output 23 [2025-03-08 22:44:14,455 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 3 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 22:44:14,455 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 22:44:15,153 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 17 [2025-03-08 22:44:15,159 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 25 [2025-03-08 22:44:15,169 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 23 [2025-03-08 22:44:15,217 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 22:44:15,217 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [431308838] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 22:44:15,217 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 22:44:15,217 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 19, 19] total 45 [2025-03-08 22:44:15,217 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1957895843] [2025-03-08 22:44:15,217 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 22:44:15,218 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 46 states [2025-03-08 22:44:15,218 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 22:44:15,218 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2025-03-08 22:44:15,219 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=193, Invalid=1877, Unknown=0, NotChecked=0, Total=2070 [2025-03-08 22:44:15,219 INFO L87 Difference]: Start difference. First operand 61 states and 67 transitions. Second operand has 46 states, 45 states have (on average 1.7777777777777777) internal successors, (80), 46 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 22:44:21,472 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2025-03-08 22:44:21,478 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 22:44:21,479 INFO L93 Difference]: Finished difference Result 115 states and 126 transitions. [2025-03-08 22:44:21,479 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2025-03-08 22:44:21,479 INFO L78 Accepts]: Start accepts. Automaton has has 46 states, 45 states have (on average 1.7777777777777777) internal successors, (80), 46 states have internal predecessors, (80), 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 29 [2025-03-08 22:44:21,479 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 22:44:21,479 INFO L225 Difference]: With dead ends: 115 [2025-03-08 22:44:21,479 INFO L226 Difference]: Without dead ends: 81 [2025-03-08 22:44:21,481 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 99 GetRequests, 22 SyntacticMatches, 1 SemanticMatches, 76 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1183 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=832, Invalid=5174, Unknown=0, NotChecked=0, Total=6006 [2025-03-08 22:44:21,481 INFO L435 NwaCegarLoop]: 10 mSDtfsCounter, 91 mSDsluCounter, 319 mSDsCounter, 0 mSdLazyCounter, 1111 mSolverCounterSat, 6 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 91 SdHoareTripleChecker+Valid, 329 SdHoareTripleChecker+Invalid, 1118 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 1111 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.9s IncrementalHoareTripleChecker+Time [2025-03-08 22:44:21,481 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [91 Valid, 329 Invalid, 1118 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 1111 Invalid, 1 Unknown, 0 Unchecked, 4.9s Time] [2025-03-08 22:44:21,481 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2025-03-08 22:44:21,482 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 38. [2025-03-08 22:44:21,484 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38 states, 37 states have (on average 1.135135135135135) internal successors, (42), 37 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 22:44:21,485 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 42 transitions. [2025-03-08 22:44:21,485 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 42 transitions. Word has length 29 [2025-03-08 22:44:21,485 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 22:44:21,485 INFO L471 AbstractCegarLoop]: Abstraction has 38 states and 42 transitions. [2025-03-08 22:44:21,485 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 46 states, 45 states have (on average 1.7777777777777777) internal successors, (80), 46 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 22:44:21,485 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 42 transitions. [2025-03-08 22:44:21,486 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2025-03-08 22:44:21,486 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 22:44:21,486 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 22:44:21,492 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2025-03-08 22:44:21,686 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2025-03-08 22:44:21,686 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 12 more)] === [2025-03-08 22:44:21,687 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:44:21,687 INFO L85 PathProgramCache]: Analyzing trace with hash -494129470, now seen corresponding path program 1 times [2025-03-08 22:44:21,687 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:44:21,687 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [821462871] [2025-03-08 22:44:21,687 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:44:21,687 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:44:21,693 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 31 statements into 1 equivalence classes. [2025-03-08 22:44:21,699 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 31 of 31 statements. [2025-03-08 22:44:21,699 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:44:21,699 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:44:21,806 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 7 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 22:44:21,806 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 22:44:21,806 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [821462871] [2025-03-08 22:44:21,806 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [821462871] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 22:44:21,806 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [220879765] [2025-03-08 22:44:21,806 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:44:21,807 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 22:44:21,807 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 22:44:21,808 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 22:44:21,811 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-03-08 22:44:21,856 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 31 statements into 1 equivalence classes. [2025-03-08 22:44:21,872 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 31 of 31 statements. [2025-03-08 22:44:21,873 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:44:21,873 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:44:21,874 INFO L256 TraceCheckSpWp]: Trace formula consists of 164 conjuncts, 43 conjuncts are in the unsatisfiable core [2025-03-08 22:44:21,875 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 22:44:21,888 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 14 treesize of output 10 [2025-03-08 22:44:22,368 INFO L349 Elim1Store]: treesize reduction 4, result has 82.6 percent of original size [2025-03-08 22:44:22,369 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 28 treesize of output 29 [2025-03-08 22:44:22,623 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 1 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 22:44:22,623 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 22:44:23,049 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 25 [2025-03-08 22:44:23,053 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2025-03-08 22:44:23,059 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 39 [2025-03-08 22:44:23,075 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 22:44:23,075 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [220879765] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 22:44:23,075 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 22:44:23,076 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 14, 14] total 35 [2025-03-08 22:44:23,076 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [756850453] [2025-03-08 22:44:23,076 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 22:44:23,076 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2025-03-08 22:44:23,076 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 22:44:23,076 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2025-03-08 22:44:23,076 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=124, Invalid=1066, Unknown=0, NotChecked=0, Total=1190 [2025-03-08 22:44:23,077 INFO L87 Difference]: Start difference. First operand 38 states and 42 transitions. Second operand has 35 states, 35 states have (on average 2.4571428571428573) internal successors, (86), 35 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 22:44:25,656 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 22:44:25,657 INFO L93 Difference]: Finished difference Result 142 states and 160 transitions. [2025-03-08 22:44:25,657 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 53 states. [2025-03-08 22:44:25,657 INFO L78 Accepts]: Start accepts. Automaton has has 35 states, 35 states have (on average 2.4571428571428573) internal successors, (86), 35 states have internal predecessors, (86), 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 31 [2025-03-08 22:44:25,658 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 22:44:25,658 INFO L225 Difference]: With dead ends: 142 [2025-03-08 22:44:25,658 INFO L226 Difference]: Without dead ends: 0 [2025-03-08 22:44:25,659 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 115 GetRequests, 35 SyntacticMatches, 2 SemanticMatches, 78 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1220 ImplicationChecksByTransitivity, 2.8s TimeCoverageRelationStatistics Valid=1217, Invalid=5103, Unknown=0, NotChecked=0, Total=6320 [2025-03-08 22:44:25,659 INFO L435 NwaCegarLoop]: 18 mSDtfsCounter, 124 mSDsluCounter, 206 mSDsCounter, 0 mSdLazyCounter, 1122 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 124 SdHoareTripleChecker+Valid, 224 SdHoareTripleChecker+Invalid, 1129 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 1122 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-08 22:44:25,659 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [124 Valid, 224 Invalid, 1129 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 1122 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-08 22:44:25,659 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2025-03-08 22:44:25,659 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2025-03-08 22:44:25,659 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 22:44:25,659 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2025-03-08 22:44:25,659 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 31 [2025-03-08 22:44:25,659 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 22:44:25,659 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-03-08 22:44:25,660 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 35 states, 35 states have (on average 2.4571428571428573) internal successors, (86), 35 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 22:44:25,660 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2025-03-08 22:44:25,660 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2025-03-08 22:44:25,662 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (14 of 15 remaining) [2025-03-08 22:44:25,662 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (13 of 15 remaining) [2025-03-08 22:44:25,662 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (12 of 15 remaining) [2025-03-08 22:44:25,662 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (11 of 15 remaining) [2025-03-08 22:44:25,662 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 15 remaining) [2025-03-08 22:44:25,662 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 15 remaining) [2025-03-08 22:44:25,663 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 15 remaining) [2025-03-08 22:44:25,663 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 15 remaining) [2025-03-08 22:44:25,663 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 15 remaining) [2025-03-08 22:44:25,663 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (5 of 15 remaining) [2025-03-08 22:44:25,663 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (4 of 15 remaining) [2025-03-08 22:44:25,663 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (3 of 15 remaining) [2025-03-08 22:44:25,663 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (2 of 15 remaining) [2025-03-08 22:44:25,663 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE (1 of 15 remaining) [2025-03-08 22:44:25,665 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE (0 of 15 remaining) [2025-03-08 22:44:25,671 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2025-03-08 22:44:25,866 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 22:44:25,868 INFO L422 BasicCegarLoop]: Path program histogram: [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 22:44:25,870 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-08 22:44:25,871 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 08.03 10:44:25 BoogieIcfgContainer [2025-03-08 22:44:25,871 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-08 22:44:25,872 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-08 22:44:25,872 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-08 22:44:25,872 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-08 22:44:25,872 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 10:43:51" (3/4) ... [2025-03-08 22:44:25,873 INFO L146 WitnessPrinter]: Generating witness for correct program [2025-03-08 22:44:25,880 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 12 nodes and edges [2025-03-08 22:44:25,880 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2025-03-08 22:44:25,881 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2025-03-08 22:44:25,881 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2025-03-08 22:44:25,932 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-03-08 22:44:25,932 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2025-03-08 22:44:25,932 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-08 22:44:25,933 INFO L158 Benchmark]: Toolchain (without parser) took 35049.12ms. Allocated memory was 142.6MB in the beginning and 268.4MB in the end (delta: 125.8MB). Free memory was 111.5MB in the beginning and 222.5MB in the end (delta: -111.0MB). Peak memory consumption was 12.4MB. Max. memory is 16.1GB. [2025-03-08 22:44:25,934 INFO L158 Benchmark]: CDTParser took 0.30ms. Allocated memory is still 201.3MB. Free memory is still 124.1MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-08 22:44:25,934 INFO L158 Benchmark]: CACSL2BoogieTranslator took 260.17ms. Allocated memory is still 142.6MB. Free memory was 111.5MB in the beginning and 93.3MB in the end (delta: 18.2MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-03-08 22:44:25,934 INFO L158 Benchmark]: Boogie Procedure Inliner took 25.82ms. Allocated memory is still 142.6MB. Free memory was 92.8MB in the beginning and 91.5MB in the end (delta: 1.3MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-08 22:44:25,934 INFO L158 Benchmark]: Boogie Preprocessor took 25.43ms. Allocated memory is still 142.6MB. Free memory was 91.5MB in the beginning and 89.8MB in the end (delta: 1.7MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-08 22:44:25,935 INFO L158 Benchmark]: IcfgBuilder took 277.98ms. Allocated memory is still 142.6MB. Free memory was 89.8MB in the beginning and 74.2MB in the end (delta: 15.5MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-03-08 22:44:25,935 INFO L158 Benchmark]: TraceAbstraction took 34394.71ms. Allocated memory was 142.6MB in the beginning and 268.4MB in the end (delta: 125.8MB). Free memory was 73.4MB in the beginning and 230.2MB in the end (delta: -156.9MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-08 22:44:25,935 INFO L158 Benchmark]: Witness Printer took 60.19ms. Allocated memory is still 268.4MB. Free memory was 230.2MB in the beginning and 222.5MB in the end (delta: 7.7MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-08 22:44:25,936 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.30ms. Allocated memory is still 201.3MB. Free memory is still 124.1MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 260.17ms. Allocated memory is still 142.6MB. Free memory was 111.5MB in the beginning and 93.3MB in the end (delta: 18.2MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 25.82ms. Allocated memory is still 142.6MB. Free memory was 92.8MB in the beginning and 91.5MB in the end (delta: 1.3MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 25.43ms. Allocated memory is still 142.6MB. Free memory was 91.5MB in the beginning and 89.8MB in the end (delta: 1.7MB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 277.98ms. Allocated memory is still 142.6MB. Free memory was 89.8MB in the beginning and 74.2MB in the end (delta: 15.5MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 34394.71ms. Allocated memory was 142.6MB in the beginning and 268.4MB in the end (delta: 125.8MB). Free memory was 73.4MB in the beginning and 230.2MB in the end (delta: -156.9MB). There was no memory consumed. Max. memory is 16.1GB. * Witness Printer took 60.19ms. Allocated memory is still 268.4MB. Free memory was 230.2MB in the beginning and 222.5MB in the end (delta: 7.7MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 379]: all allocated memory was freed For all program executions holds that all allocated memory was freed at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 40 locations, 47 edges, 15 error locations. Started 1 CEGAR loops. OverallTime: 34.4s, OverallIterations: 19, TraceHistogramMax: 2, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 11.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 1 mSolverCounterUnknown, 730 SdHoareTripleChecker+Valid, 6.7s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 730 mSDsluCounter, 2224 SdHoareTripleChecker+Invalid, 6.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1761 mSDsCounter, 51 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 4012 IncrementalHoareTripleChecker+Invalid, 4064 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 51 mSolverCounterUnsat, 463 mSDtfsCounter, 4012 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 463 GetRequests, 135 SyntacticMatches, 6 SemanticMatches, 322 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3340 ImplicationChecksByTransitivity, 21.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=80occurred in iteration=15, InterpolantAutomatonStates: 221, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 19 MinimizatonAttempts, 164 StatesRemovedByMinimization, 9 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 21.1s InterpolantComputationTime, 397 NumberOfCodeBlocks, 397 NumberOfCodeBlocksAsserted, 28 NumberOfCheckSat, 491 ConstructedInterpolants, 78 QuantifiedInterpolants, 7083 SizeOfPredicates, 53 NumberOfNonLiveVariables, 711 ConjunctsInSsa, 220 ConjunctsInUnsatCore, 29 InterpolantComputations, 14 PerfectInterpolantSequences, 15/105 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 15 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2025-03-08 22:44:25,956 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE