./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/termination-crafted/LexIndexValue-Pointer-3.c --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-crafted/LexIndexValue-Pointer-3.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 64bit --witnessprinter.graph.data.programhash 29e5ebbacca85d2fb1b0bd6d164adabb3234eca085536ff1d3458c8110967632 --- Real Ultimate output --- This is Ultimate 0.3.0-?-e2fb8be-m [2025-03-08 23:15:20,942 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-08 23:15:20,988 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-64bit-Automizer_Default.epf [2025-03-08 23:15:20,991 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-08 23:15:20,991 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-08 23:15:21,006 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-08 23:15:21,006 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-08 23:15:21,006 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-08 23:15:21,006 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-08 23:15:21,007 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-08 23:15:21,007 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-08 23:15:21,007 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-08 23:15:21,007 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-08 23:15:21,007 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-08 23:15:21,007 INFO L153 SettingsManager]: * Use SBE=true [2025-03-08 23:15:21,007 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-08 23:15:21,007 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-08 23:15:21,007 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-08 23:15:21,007 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2025-03-08 23:15:21,007 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2025-03-08 23:15:21,008 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2025-03-08 23:15:21,008 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-08 23:15:21,008 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-03-08 23:15:21,008 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-03-08 23:15:21,008 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-08 23:15:21,008 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-08 23:15:21,008 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-08 23:15:21,008 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-08 23:15:21,008 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-08 23:15:21,008 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-08 23:15:21,008 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 23:15:21,008 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-08 23:15:21,008 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-08 23:15:21,008 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-08 23:15:21,008 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-08 23:15:21,008 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-08 23:15:21,009 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-08 23:15:21,009 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-08 23:15:21,009 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-08 23:15:21,009 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 -> 29e5ebbacca85d2fb1b0bd6d164adabb3234eca085536ff1d3458c8110967632 [2025-03-08 23:15:21,233 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-08 23:15:21,241 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-08 23:15:21,243 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-08 23:15:21,244 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-08 23:15:21,244 INFO L274 PluginConnector]: CDTParser initialized [2025-03-08 23:15:21,245 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/termination-crafted/LexIndexValue-Pointer-3.c [2025-03-08 23:15:22,410 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/728fef28f/1140d677f9f048eca7b6d32196a73032/FLAGcb5651b74 [2025-03-08 23:15:22,629 INFO L384 CDTParser]: Found 1 translation units. [2025-03-08 23:15:22,629 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/termination-crafted/LexIndexValue-Pointer-3.c [2025-03-08 23:15:22,634 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/728fef28f/1140d677f9f048eca7b6d32196a73032/FLAGcb5651b74 [2025-03-08 23:15:22,977 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/728fef28f/1140d677f9f048eca7b6d32196a73032 [2025-03-08 23:15:22,979 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-08 23:15:22,981 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-08 23:15:22,982 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-08 23:15:22,982 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-08 23:15:22,985 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-08 23:15:22,986 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 11:15:22" (1/1) ... [2025-03-08 23:15:22,987 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@30c7e046 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 11:15:22, skipping insertion in model container [2025-03-08 23:15:22,987 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 11:15:22" (1/1) ... [2025-03-08 23:15:22,999 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-08 23:15:23,105 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 23:15:23,110 INFO L200 MainTranslator]: Completed pre-run [2025-03-08 23:15:23,122 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 23:15:23,132 INFO L204 MainTranslator]: Completed translation [2025-03-08 23:15:23,133 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 11:15:23 WrapperNode [2025-03-08 23:15:23,133 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-08 23:15:23,134 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-08 23:15:23,134 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-08 23:15:23,134 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-08 23:15:23,139 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 11:15:23" (1/1) ... [2025-03-08 23:15:23,144 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 11:15:23" (1/1) ... [2025-03-08 23:15:23,156 INFO L138 Inliner]: procedures = 10, calls = 8, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 43 [2025-03-08 23:15:23,156 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-08 23:15:23,157 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-08 23:15:23,157 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-08 23:15:23,157 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-08 23:15:23,161 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 11:15:23" (1/1) ... [2025-03-08 23:15:23,162 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 11:15:23" (1/1) ... [2025-03-08 23:15:23,163 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 11:15:23" (1/1) ... [2025-03-08 23:15:23,169 INFO L175 MemorySlicer]: Split 4 memory accesses to 1 slices as follows [4]. 100 percent of accesses are in the largest equivalence class. The 0 initializations are split as follows [0]. The 2 writes are split as follows [2]. [2025-03-08 23:15:23,170 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 11:15:23" (1/1) ... [2025-03-08 23:15:23,170 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 11:15:23" (1/1) ... [2025-03-08 23:15:23,173 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 11:15:23" (1/1) ... [2025-03-08 23:15:23,173 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 11:15:23" (1/1) ... [2025-03-08 23:15:23,174 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 11:15:23" (1/1) ... [2025-03-08 23:15:23,174 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 11:15:23" (1/1) ... [2025-03-08 23:15:23,175 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-08 23:15:23,176 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-08 23:15:23,176 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-08 23:15:23,176 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-08 23:15:23,177 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 11:15:23" (1/1) ... [2025-03-08 23:15:23,180 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 23:15:23,188 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 23:15:23,200 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 23:15:23,203 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 23:15:23,220 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-03-08 23:15:23,220 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-03-08 23:15:23,220 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-08 23:15:23,221 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-08 23:15:23,221 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-03-08 23:15:23,221 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-03-08 23:15:23,265 INFO L256 CfgBuilder]: Building ICFG [2025-03-08 23:15:23,267 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-08 23:15:23,399 INFO L? ?]: Removed 27 outVars from TransFormulas that were not future-live. [2025-03-08 23:15:23,402 INFO L307 CfgBuilder]: Performing block encoding [2025-03-08 23:15:23,411 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-08 23:15:23,412 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-08 23:15:23,412 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 11:15:23 BoogieIcfgContainer [2025-03-08 23:15:23,412 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-08 23:15:23,414 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-08 23:15:23,414 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-08 23:15:23,418 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-08 23:15:23,418 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.03 11:15:22" (1/3) ... [2025-03-08 23:15:23,419 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7e85921f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 11:15:23, skipping insertion in model container [2025-03-08 23:15:23,419 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 11:15:23" (2/3) ... [2025-03-08 23:15:23,419 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7e85921f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 11:15:23, skipping insertion in model container [2025-03-08 23:15:23,420 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 11:15:23" (3/3) ... [2025-03-08 23:15:23,421 INFO L128 eAbstractionObserver]: Analyzing ICFG LexIndexValue-Pointer-3.c [2025-03-08 23:15:23,431 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-08 23:15:23,433 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG LexIndexValue-Pointer-3.c that has 1 procedures, 30 locations, 1 initial locations, 2 loop locations, and 12 error locations. [2025-03-08 23:15:23,470 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-08 23:15:23,482 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;@185b0660, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-08 23:15:23,482 INFO L334 AbstractCegarLoop]: Starting to check reachability of 12 error locations. [2025-03-08 23:15:23,485 INFO L276 IsEmpty]: Start isEmpty. Operand has 30 states, 17 states have (on average 1.9411764705882353) internal successors, (33), 29 states have internal predecessors, (33), 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 23:15:23,489 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2025-03-08 23:15:23,490 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 23:15:23,490 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2025-03-08 23:15:23,491 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 9 more)] === [2025-03-08 23:15:23,494 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 23:15:23,495 INFO L85 PathProgramCache]: Analyzing trace with hash 1969150, now seen corresponding path program 1 times [2025-03-08 23:15:23,500 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 23:15:23,501 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1883964472] [2025-03-08 23:15:23,501 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 23:15:23,501 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 23:15:23,551 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-03-08 23:15:23,562 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-03-08 23:15:23,563 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 23:15:23,563 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 23:15:23,623 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 23:15:23,624 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 23:15:23,624 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1883964472] [2025-03-08 23:15:23,624 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1883964472] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 23:15:23,627 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 23:15:23,627 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-08 23:15:23,628 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1633965492] [2025-03-08 23:15:23,628 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 23:15:23,631 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 23:15:23,632 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 23:15:23,649 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 23:15:23,650 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 23:15:23,651 INFO L87 Difference]: Start difference. First operand has 30 states, 17 states have (on average 1.9411764705882353) internal successors, (33), 29 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 23:15:23,696 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 23:15:23,696 INFO L93 Difference]: Finished difference Result 28 states and 30 transitions. [2025-03-08 23:15:23,697 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 23:15:23,698 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 4 [2025-03-08 23:15:23,698 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 23:15:23,702 INFO L225 Difference]: With dead ends: 28 [2025-03-08 23:15:23,702 INFO L226 Difference]: Without dead ends: 26 [2025-03-08 23:15:23,703 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 23:15:23,705 INFO L435 NwaCegarLoop]: 16 mSDtfsCounter, 21 mSDsluCounter, 1 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 17 SdHoareTripleChecker+Invalid, 21 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 23:15:23,707 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [21 Valid, 17 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 23:15:23,716 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2025-03-08 23:15:23,724 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 26. [2025-03-08 23:15:23,724 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 16 states have (on average 1.75) internal successors, (28), 25 states have internal predecessors, (28), 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 23:15:23,726 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 28 transitions. [2025-03-08 23:15:23,727 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 28 transitions. Word has length 4 [2025-03-08 23:15:23,727 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 23:15:23,727 INFO L471 AbstractCegarLoop]: Abstraction has 26 states and 28 transitions. [2025-03-08 23:15:23,727 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 23:15:23,728 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 28 transitions. [2025-03-08 23:15:23,728 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2025-03-08 23:15:23,728 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 23:15:23,728 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2025-03-08 23:15:23,728 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-08 23:15:23,728 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 9 more)] === [2025-03-08 23:15:23,729 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 23:15:23,729 INFO L85 PathProgramCache]: Analyzing trace with hash 1969151, now seen corresponding path program 1 times [2025-03-08 23:15:23,729 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 23:15:23,729 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1991676002] [2025-03-08 23:15:23,729 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 23:15:23,729 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 23:15:23,734 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-03-08 23:15:23,742 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-03-08 23:15:23,746 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 23:15:23,747 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 23:15:23,852 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 23:15:23,853 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 23:15:23,853 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1991676002] [2025-03-08 23:15:23,853 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1991676002] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 23:15:23,853 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 23:15:23,853 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-08 23:15:23,853 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1159523986] [2025-03-08 23:15:23,853 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 23:15:23,854 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 23:15:23,854 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 23:15:23,855 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 23:15:23,855 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 23:15:23,855 INFO L87 Difference]: Start difference. First operand 26 states and 28 transitions. Second operand has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 23:15:23,882 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 23:15:23,882 INFO L93 Difference]: Finished difference Result 29 states and 31 transitions. [2025-03-08 23:15:23,882 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 23:15:23,882 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 4 [2025-03-08 23:15:23,883 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 23:15:23,883 INFO L225 Difference]: With dead ends: 29 [2025-03-08 23:15:23,883 INFO L226 Difference]: Without dead ends: 29 [2025-03-08 23:15:23,883 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 23:15:23,884 INFO L435 NwaCegarLoop]: 25 mSDtfsCounter, 1 mSDsluCounter, 9 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 34 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 23:15:23,884 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 34 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 23:15:23,884 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2025-03-08 23:15:23,886 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 28. [2025-03-08 23:15:23,886 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 18 states have (on average 1.6666666666666667) internal successors, (30), 27 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 23:15:23,887 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 30 transitions. [2025-03-08 23:15:23,887 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 30 transitions. Word has length 4 [2025-03-08 23:15:23,887 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 23:15:23,887 INFO L471 AbstractCegarLoop]: Abstraction has 28 states and 30 transitions. [2025-03-08 23:15:23,887 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 23:15:23,887 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 30 transitions. [2025-03-08 23:15:23,887 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2025-03-08 23:15:23,888 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 23:15:23,888 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1] [2025-03-08 23:15:23,888 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-08 23:15:23,888 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 9 more)] === [2025-03-08 23:15:23,888 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 23:15:23,889 INFO L85 PathProgramCache]: Analyzing trace with hash -1466596354, now seen corresponding path program 1 times [2025-03-08 23:15:23,889 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 23:15:23,889 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1791268922] [2025-03-08 23:15:23,889 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 23:15:23,889 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 23:15:23,894 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-03-08 23:15:23,898 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-03-08 23:15:23,898 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 23:15:23,899 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 23:15:24,029 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 23:15:24,029 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 23:15:24,029 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1791268922] [2025-03-08 23:15:24,029 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1791268922] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 23:15:24,029 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1932360137] [2025-03-08 23:15:24,029 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 23:15:24,029 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 23:15:24,029 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 23:15:24,031 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 23:15:24,032 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 23:15:24,067 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-03-08 23:15:24,077 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-03-08 23:15:24,077 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 23:15:24,077 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 23:15:24,078 INFO L256 TraceCheckSpWp]: Trace formula consists of 37 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-03-08 23:15:24,082 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 23:15:24,118 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2025-03-08 23:15:24,172 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 23:15:24,173 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 23:15:24,241 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 23:15:24,242 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1932360137] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 23:15:24,242 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 23:15:24,242 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 6 [2025-03-08 23:15:24,242 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [56972468] [2025-03-08 23:15:24,242 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 23:15:24,242 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-08 23:15:24,242 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 23:15:24,243 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-08 23:15:24,243 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2025-03-08 23:15:24,243 INFO L87 Difference]: Start difference. First operand 28 states and 30 transitions. Second operand has 7 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 7 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 23:15:24,317 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 23:15:24,317 INFO L93 Difference]: Finished difference Result 37 states and 41 transitions. [2025-03-08 23:15:24,317 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-08 23:15:24,318 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 7 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2025-03-08 23:15:24,318 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 23:15:24,319 INFO L225 Difference]: With dead ends: 37 [2025-03-08 23:15:24,319 INFO L226 Difference]: Without dead ends: 37 [2025-03-08 23:15:24,319 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=25, Invalid=31, Unknown=0, NotChecked=0, Total=56 [2025-03-08 23:15:24,323 INFO L435 NwaCegarLoop]: 24 mSDtfsCounter, 3 mSDsluCounter, 18 mSDsCounter, 0 mSdLazyCounter, 54 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 42 SdHoareTripleChecker+Invalid, 57 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 54 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 23:15:24,323 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 42 Invalid, 57 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 54 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 23:15:24,323 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2025-03-08 23:15:24,326 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 37. [2025-03-08 23:15:24,327 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 37 states, 27 states have (on average 1.5185185185185186) internal successors, (41), 36 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 23:15:24,328 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 41 transitions. [2025-03-08 23:15:24,328 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 41 transitions. Word has length 7 [2025-03-08 23:15:24,328 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 23:15:24,328 INFO L471 AbstractCegarLoop]: Abstraction has 37 states and 41 transitions. [2025-03-08 23:15:24,329 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 7 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 23:15:24,329 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 41 transitions. [2025-03-08 23:15:24,329 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2025-03-08 23:15:24,329 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 23:15:24,329 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1] [2025-03-08 23:15:24,336 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 23:15:24,534 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 23:15:24,534 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 9 more)] === [2025-03-08 23:15:24,535 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 23:15:24,535 INFO L85 PathProgramCache]: Analyzing trace with hash 1330288381, now seen corresponding path program 1 times [2025-03-08 23:15:24,535 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 23:15:24,535 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [838021412] [2025-03-08 23:15:24,535 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 23:15:24,535 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 23:15:24,539 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-03-08 23:15:24,542 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-03-08 23:15:24,542 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 23:15:24,542 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 23:15:24,576 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-08 23:15:24,576 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 23:15:24,576 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [838021412] [2025-03-08 23:15:24,576 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [838021412] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 23:15:24,576 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 23:15:24,576 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 23:15:24,576 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [866719744] [2025-03-08 23:15:24,577 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 23:15:24,577 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 23:15:24,577 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 23:15:24,577 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 23:15:24,577 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-08 23:15:24,577 INFO L87 Difference]: Start difference. First operand 37 states and 41 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 23:15:24,612 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 23:15:24,613 INFO L93 Difference]: Finished difference Result 34 states and 38 transitions. [2025-03-08 23:15:24,613 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 23:15:24,613 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 10 [2025-03-08 23:15:24,613 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 23:15:24,613 INFO L225 Difference]: With dead ends: 34 [2025-03-08 23:15:24,613 INFO L226 Difference]: Without dead ends: 34 [2025-03-08 23:15:24,614 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 23:15:24,614 INFO L435 NwaCegarLoop]: 10 mSDtfsCounter, 23 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 32 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 14 SdHoareTripleChecker+Invalid, 36 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 32 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 23:15:24,614 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [23 Valid, 14 Invalid, 36 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 32 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 23:15:24,615 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2025-03-08 23:15:24,616 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 34. [2025-03-08 23:15:24,616 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34 states, 27 states have (on average 1.4074074074074074) internal successors, (38), 33 states have internal predecessors, (38), 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 23:15:24,617 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 38 transitions. [2025-03-08 23:15:24,617 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 38 transitions. Word has length 10 [2025-03-08 23:15:24,617 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 23:15:24,617 INFO L471 AbstractCegarLoop]: Abstraction has 34 states and 38 transitions. [2025-03-08 23:15:24,617 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 23:15:24,617 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 38 transitions. [2025-03-08 23:15:24,617 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2025-03-08 23:15:24,617 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 23:15:24,618 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1] [2025-03-08 23:15:24,618 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-08 23:15:24,618 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 9 more)] === [2025-03-08 23:15:24,618 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 23:15:24,618 INFO L85 PathProgramCache]: Analyzing trace with hash 1330288382, now seen corresponding path program 1 times [2025-03-08 23:15:24,618 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 23:15:24,619 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2096369194] [2025-03-08 23:15:24,619 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 23:15:24,619 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 23:15:24,623 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-03-08 23:15:24,628 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-03-08 23:15:24,628 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 23:15:24,628 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 23:15:24,677 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 23:15:24,677 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 23:15:24,677 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2096369194] [2025-03-08 23:15:24,677 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2096369194] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 23:15:24,677 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1619512261] [2025-03-08 23:15:24,677 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 23:15:24,677 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 23:15:24,677 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 23:15:24,679 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 23:15:24,680 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 23:15:24,705 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-03-08 23:15:24,711 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-03-08 23:15:24,711 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 23:15:24,711 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 23:15:24,712 INFO L256 TraceCheckSpWp]: Trace formula consists of 52 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-08 23:15:24,713 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 23:15:24,731 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 23:15:24,731 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 23:15:24,775 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 23:15:24,775 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1619512261] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 23:15:24,775 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 23:15:24,775 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 9 [2025-03-08 23:15:24,776 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1778146643] [2025-03-08 23:15:24,776 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 23:15:24,776 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-08 23:15:24,776 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 23:15:24,776 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-08 23:15:24,776 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2025-03-08 23:15:24,776 INFO L87 Difference]: Start difference. First operand 34 states and 38 transitions. Second operand has 9 states, 9 states have (on average 2.4444444444444446) internal successors, (22), 9 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 23:15:24,808 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 23:15:24,808 INFO L93 Difference]: Finished difference Result 39 states and 42 transitions. [2025-03-08 23:15:24,808 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-08 23:15:24,808 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 2.4444444444444446) internal successors, (22), 9 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 10 [2025-03-08 23:15:24,808 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 23:15:24,808 INFO L225 Difference]: With dead ends: 39 [2025-03-08 23:15:24,808 INFO L226 Difference]: Without dead ends: 39 [2025-03-08 23:15:24,809 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2025-03-08 23:15:24,809 INFO L435 NwaCegarLoop]: 21 mSDtfsCounter, 4 mSDsluCounter, 57 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 78 SdHoareTripleChecker+Invalid, 28 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 23:15:24,809 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 78 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 23:15:24,810 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2025-03-08 23:15:24,812 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 39. [2025-03-08 23:15:24,813 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 39 states, 32 states have (on average 1.3125) internal successors, (42), 38 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 23:15:24,813 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 42 transitions. [2025-03-08 23:15:24,813 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 42 transitions. Word has length 10 [2025-03-08 23:15:24,813 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 23:15:24,813 INFO L471 AbstractCegarLoop]: Abstraction has 39 states and 42 transitions. [2025-03-08 23:15:24,813 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 2.4444444444444446) internal successors, (22), 9 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 23:15:24,813 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 42 transitions. [2025-03-08 23:15:24,813 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2025-03-08 23:15:24,813 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 23:15:24,813 INFO L218 NwaCegarLoop]: trace histogram [5, 4, 4, 1, 1, 1] [2025-03-08 23:15:24,821 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 23:15:25,014 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 23:15:25,014 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 9 more)] === [2025-03-08 23:15:25,014 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 23:15:25,015 INFO L85 PathProgramCache]: Analyzing trace with hash -1618482369, now seen corresponding path program 2 times [2025-03-08 23:15:25,015 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 23:15:25,015 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [870986196] [2025-03-08 23:15:25,015 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-08 23:15:25,015 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 23:15:25,021 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 16 statements into 2 equivalence classes. [2025-03-08 23:15:25,027 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 16 of 16 statements. [2025-03-08 23:15:25,027 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-08 23:15:25,027 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 23:15:25,179 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 9 proven. 17 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 23:15:25,179 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 23:15:25,179 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [870986196] [2025-03-08 23:15:25,179 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [870986196] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 23:15:25,179 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1304474353] [2025-03-08 23:15:25,179 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-08 23:15:25,179 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 23:15:25,180 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 23:15:25,181 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 23:15:25,183 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 23:15:25,207 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 16 statements into 2 equivalence classes. [2025-03-08 23:15:25,217 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 16 of 16 statements. [2025-03-08 23:15:25,217 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-08 23:15:25,218 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 23:15:25,218 INFO L256 TraceCheckSpWp]: Trace formula consists of 76 conjuncts, 11 conjuncts are in the unsatisfiable core [2025-03-08 23:15:25,220 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 23:15:25,231 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2025-03-08 23:15:25,326 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 26 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 23:15:25,327 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 23:15:25,327 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1304474353] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 23:15:25,327 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-08 23:15:25,327 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [7] total 9 [2025-03-08 23:15:25,327 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [197221064] [2025-03-08 23:15:25,327 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 23:15:25,327 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-08 23:15:25,327 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 23:15:25,327 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-08 23:15:25,328 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=55, Unknown=0, NotChecked=0, Total=90 [2025-03-08 23:15:25,328 INFO L87 Difference]: Start difference. First operand 39 states and 42 transitions. Second operand has 8 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 8 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 23:15:25,384 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 23:15:25,384 INFO L93 Difference]: Finished difference Result 38 states and 40 transitions. [2025-03-08 23:15:25,384 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-08 23:15:25,384 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 8 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2025-03-08 23:15:25,384 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 23:15:25,384 INFO L225 Difference]: With dead ends: 38 [2025-03-08 23:15:25,384 INFO L226 Difference]: Without dead ends: 38 [2025-03-08 23:15:25,385 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=35, Invalid=55, Unknown=0, NotChecked=0, Total=90 [2025-03-08 23:15:25,385 INFO L435 NwaCegarLoop]: 20 mSDtfsCounter, 2 mSDsluCounter, 18 mSDsCounter, 0 mSdLazyCounter, 78 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 38 SdHoareTripleChecker+Invalid, 78 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 78 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 23:15:25,385 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 38 Invalid, 78 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 78 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 23:15:25,386 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2025-03-08 23:15:25,387 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 38. [2025-03-08 23:15:25,387 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38 states, 32 states have (on average 1.25) internal successors, (40), 37 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 23:15:25,388 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 40 transitions. [2025-03-08 23:15:25,388 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 40 transitions. Word has length 16 [2025-03-08 23:15:25,388 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 23:15:25,388 INFO L471 AbstractCegarLoop]: Abstraction has 38 states and 40 transitions. [2025-03-08 23:15:25,388 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 8 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 23:15:25,388 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 40 transitions. [2025-03-08 23:15:25,388 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2025-03-08 23:15:25,388 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 23:15:25,388 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 1, 1, 1, 1] [2025-03-08 23:15:25,394 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-03-08 23:15:25,593 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 23:15:25,593 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 9 more)] === [2025-03-08 23:15:25,593 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 23:15:25,593 INFO L85 PathProgramCache]: Analyzing trace with hash -1021311426, now seen corresponding path program 2 times [2025-03-08 23:15:25,593 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 23:15:25,594 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2130515313] [2025-03-08 23:15:25,594 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-08 23:15:25,594 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 23:15:25,601 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 22 statements into 2 equivalence classes. [2025-03-08 23:15:25,603 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 4 of 22 statements. [2025-03-08 23:15:25,603 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-08 23:15:25,603 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 23:15:25,645 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 51 trivial. 0 not checked. [2025-03-08 23:15:25,646 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 23:15:25,646 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2130515313] [2025-03-08 23:15:25,646 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2130515313] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 23:15:25,646 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 23:15:25,646 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 23:15:25,646 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1884500098] [2025-03-08 23:15:25,646 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 23:15:25,646 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 23:15:25,646 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 23:15:25,646 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 23:15:25,646 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-08 23:15:25,647 INFO L87 Difference]: Start difference. First operand 38 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 23:15:25,683 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 23:15:25,684 INFO L93 Difference]: Finished difference Result 44 states and 48 transitions. [2025-03-08 23:15:25,684 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 23:15:25,684 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 22 [2025-03-08 23:15:25,684 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 23:15:25,684 INFO L225 Difference]: With dead ends: 44 [2025-03-08 23:15:25,684 INFO L226 Difference]: Without dead ends: 44 [2025-03-08 23:15:25,685 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 23:15:25,685 INFO L435 NwaCegarLoop]: 11 mSDtfsCounter, 29 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 29 SdHoareTripleChecker+Valid, 23 SdHoareTripleChecker+Invalid, 31 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 28 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 23:15:25,685 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [29 Valid, 23 Invalid, 31 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 23:15:25,686 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2025-03-08 23:15:25,689 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 44. [2025-03-08 23:15:25,689 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 44 states, 39 states have (on average 1.2307692307692308) internal successors, (48), 43 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 23:15:25,689 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 48 transitions. [2025-03-08 23:15:25,689 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 48 transitions. Word has length 22 [2025-03-08 23:15:25,689 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 23:15:25,689 INFO L471 AbstractCegarLoop]: Abstraction has 44 states and 48 transitions. [2025-03-08 23:15:25,689 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 23:15:25,689 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 48 transitions. [2025-03-08 23:15:25,690 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2025-03-08 23:15:25,690 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 23:15:25,690 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 23:15:25,690 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-08 23:15:25,690 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 9 more)] === [2025-03-08 23:15:25,690 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 23:15:25,690 INFO L85 PathProgramCache]: Analyzing trace with hash -340406280, now seen corresponding path program 1 times [2025-03-08 23:15:25,691 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 23:15:25,691 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [748495576] [2025-03-08 23:15:25,691 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 23:15:25,691 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 23:15:25,701 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-03-08 23:15:25,705 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-03-08 23:15:25,705 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 23:15:25,705 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 23:15:25,727 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 51 trivial. 0 not checked. [2025-03-08 23:15:25,727 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 23:15:25,727 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [748495576] [2025-03-08 23:15:25,727 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [748495576] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 23:15:25,727 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 23:15:25,727 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-08 23:15:25,727 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1772007673] [2025-03-08 23:15:25,727 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 23:15:25,727 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 23:15:25,727 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 23:15:25,727 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 23:15:25,728 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 23:15:25,728 INFO L87 Difference]: Start difference. First operand 44 states and 48 transitions. Second operand has 3 states, 2 states have (on average 5.0) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 23:15:25,738 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 23:15:25,739 INFO L93 Difference]: Finished difference Result 43 states and 47 transitions. [2025-03-08 23:15:25,740 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 23:15:25,740 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 5.0) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 25 [2025-03-08 23:15:25,740 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 23:15:25,740 INFO L225 Difference]: With dead ends: 43 [2025-03-08 23:15:25,740 INFO L226 Difference]: Without dead ends: 43 [2025-03-08 23:15:25,740 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 23:15:25,741 INFO L435 NwaCegarLoop]: 16 mSDtfsCounter, 11 mSDsluCounter, 1 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 17 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 23:15:25,741 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 17 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 23:15:25,742 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2025-03-08 23:15:25,746 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 43. [2025-03-08 23:15:25,746 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 43 states, 39 states have (on average 1.205128205128205) internal successors, (47), 42 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 23:15:25,746 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 47 transitions. [2025-03-08 23:15:25,746 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 47 transitions. Word has length 25 [2025-03-08 23:15:25,746 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 23:15:25,746 INFO L471 AbstractCegarLoop]: Abstraction has 43 states and 47 transitions. [2025-03-08 23:15:25,746 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 5.0) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 23:15:25,747 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 47 transitions. [2025-03-08 23:15:25,747 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2025-03-08 23:15:25,747 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 23:15:25,747 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 23:15:25,747 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-08 23:15:25,747 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 9 more)] === [2025-03-08 23:15:25,747 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 23:15:25,747 INFO L85 PathProgramCache]: Analyzing trace with hash -340405238, now seen corresponding path program 1 times [2025-03-08 23:15:25,747 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 23:15:25,747 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [637036280] [2025-03-08 23:15:25,748 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 23:15:25,748 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 23:15:25,756 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-03-08 23:15:25,763 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-03-08 23:15:25,763 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 23:15:25,763 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 23:15:25,830 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 0 proven. 51 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-08 23:15:25,830 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 23:15:25,830 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [637036280] [2025-03-08 23:15:25,830 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [637036280] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 23:15:25,830 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1755843114] [2025-03-08 23:15:25,830 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 23:15:25,830 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 23:15:25,831 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 23:15:25,832 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 23:15:25,834 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 23:15:25,859 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-03-08 23:15:25,871 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-03-08 23:15:25,871 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 23:15:25,871 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 23:15:25,872 INFO L256 TraceCheckSpWp]: Trace formula consists of 121 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-03-08 23:15:25,873 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 23:15:25,914 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 0 proven. 51 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-08 23:15:25,914 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 23:15:26,006 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 0 proven. 51 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-08 23:15:26,006 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1755843114] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 23:15:26,007 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 23:15:26,007 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 17 [2025-03-08 23:15:26,007 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [279464482] [2025-03-08 23:15:26,007 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 23:15:26,007 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2025-03-08 23:15:26,007 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 23:15:26,007 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2025-03-08 23:15:26,007 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=136, Invalid=136, Unknown=0, NotChecked=0, Total=272 [2025-03-08 23:15:26,008 INFO L87 Difference]: Start difference. First operand 43 states and 47 transitions. Second operand has 17 states, 17 states have (on average 2.8823529411764706) internal successors, (49), 17 states have internal predecessors, (49), 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 23:15:26,058 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 23:15:26,058 INFO L93 Difference]: Finished difference Result 67 states and 71 transitions. [2025-03-08 23:15:26,062 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-03-08 23:15:26,062 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 2.8823529411764706) internal successors, (49), 17 states have internal predecessors, (49), 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 23:15:26,062 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 23:15:26,062 INFO L225 Difference]: With dead ends: 67 [2025-03-08 23:15:26,062 INFO L226 Difference]: Without dead ends: 67 [2025-03-08 23:15:26,063 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=136, Invalid=136, Unknown=0, NotChecked=0, Total=272 [2025-03-08 23:15:26,063 INFO L435 NwaCegarLoop]: 19 mSDtfsCounter, 4 mSDsluCounter, 51 mSDsCounter, 0 mSdLazyCounter, 46 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 70 SdHoareTripleChecker+Invalid, 48 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 46 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 23:15:26,063 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 70 Invalid, 48 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 46 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 23:15:26,063 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2025-03-08 23:15:26,065 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 67. [2025-03-08 23:15:26,065 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 67 states, 63 states have (on average 1.126984126984127) internal successors, (71), 66 states have internal predecessors, (71), 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 23:15:26,065 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 71 transitions. [2025-03-08 23:15:26,065 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 71 transitions. Word has length 25 [2025-03-08 23:15:26,065 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 23:15:26,066 INFO L471 AbstractCegarLoop]: Abstraction has 67 states and 71 transitions. [2025-03-08 23:15:26,066 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 2.8823529411764706) internal successors, (49), 17 states have internal predecessors, (49), 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 23:15:26,066 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 71 transitions. [2025-03-08 23:15:26,066 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2025-03-08 23:15:26,066 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 23:15:26,066 INFO L218 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 23:15:26,072 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 23:15:26,268 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 23:15:26,268 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 9 more)] === [2025-03-08 23:15:26,268 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 23:15:26,268 INFO L85 PathProgramCache]: Analyzing trace with hash -60095094, now seen corresponding path program 2 times [2025-03-08 23:15:26,268 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 23:15:26,268 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1619223863] [2025-03-08 23:15:26,268 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-08 23:15:26,268 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 23:15:26,278 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 49 statements into 2 equivalence classes. [2025-03-08 23:15:26,292 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 49 of 49 statements. [2025-03-08 23:15:26,292 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-08 23:15:26,292 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 23:15:26,534 INFO L134 CoverageAnalysis]: Checked inductivity of 288 backedges. 0 proven. 287 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-08 23:15:26,534 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 23:15:26,534 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1619223863] [2025-03-08 23:15:26,534 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1619223863] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 23:15:26,535 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1660996273] [2025-03-08 23:15:26,535 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-08 23:15:26,535 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 23:15:26,535 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 23:15:26,537 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 23:15:26,538 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 23:15:26,577 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 49 statements into 2 equivalence classes. [2025-03-08 23:15:26,603 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 49 of 49 statements. [2025-03-08 23:15:26,604 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-08 23:15:26,604 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 23:15:26,605 INFO L256 TraceCheckSpWp]: Trace formula consists of 225 conjuncts, 16 conjuncts are in the unsatisfiable core [2025-03-08 23:15:26,607 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 23:15:26,665 INFO L134 CoverageAnalysis]: Checked inductivity of 288 backedges. 0 proven. 287 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-08 23:15:26,666 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 23:15:26,986 INFO L134 CoverageAnalysis]: Checked inductivity of 288 backedges. 0 proven. 287 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-08 23:15:26,986 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1660996273] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 23:15:26,986 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 23:15:26,987 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17, 17] total 33 [2025-03-08 23:15:26,987 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [170539157] [2025-03-08 23:15:26,987 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 23:15:26,987 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2025-03-08 23:15:26,988 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 23:15:26,989 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2025-03-08 23:15:26,989 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=528, Invalid=528, Unknown=0, NotChecked=0, Total=1056 [2025-03-08 23:15:26,989 INFO L87 Difference]: Start difference. First operand 67 states and 71 transitions. Second operand has 33 states, 33 states have (on average 2.9393939393939394) internal successors, (97), 33 states have internal predecessors, (97), 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 23:15:27,095 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 23:15:27,096 INFO L93 Difference]: Finished difference Result 115 states and 119 transitions. [2025-03-08 23:15:27,096 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2025-03-08 23:15:27,097 INFO L78 Accepts]: Start accepts. Automaton has has 33 states, 33 states have (on average 2.9393939393939394) internal successors, (97), 33 states have internal predecessors, (97), 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 49 [2025-03-08 23:15:27,097 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 23:15:27,097 INFO L225 Difference]: With dead ends: 115 [2025-03-08 23:15:27,097 INFO L226 Difference]: Without dead ends: 115 [2025-03-08 23:15:27,098 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 113 GetRequests, 82 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=528, Invalid=528, Unknown=0, NotChecked=0, Total=1056 [2025-03-08 23:15:27,098 INFO L435 NwaCegarLoop]: 19 mSDtfsCounter, 4 mSDsluCounter, 102 mSDsCounter, 0 mSdLazyCounter, 97 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 121 SdHoareTripleChecker+Invalid, 99 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 97 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 23:15:27,098 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 121 Invalid, 99 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 97 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 23:15:27,099 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states. [2025-03-08 23:15:27,101 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 115. [2025-03-08 23:15:27,101 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 115 states, 111 states have (on average 1.072072072072072) internal successors, (119), 114 states have internal predecessors, (119), 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 23:15:27,102 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 119 transitions. [2025-03-08 23:15:27,102 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 119 transitions. Word has length 49 [2025-03-08 23:15:27,102 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 23:15:27,102 INFO L471 AbstractCegarLoop]: Abstraction has 115 states and 119 transitions. [2025-03-08 23:15:27,102 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 33 states, 33 states have (on average 2.9393939393939394) internal successors, (97), 33 states have internal predecessors, (97), 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 23:15:27,102 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 119 transitions. [2025-03-08 23:15:27,104 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2025-03-08 23:15:27,104 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 23:15:27,104 INFO L218 NwaCegarLoop]: trace histogram [30, 30, 30, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 23:15:27,110 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2025-03-08 23:15:27,308 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2025-03-08 23:15:27,308 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 9 more)] === [2025-03-08 23:15:27,309 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 23:15:27,309 INFO L85 PathProgramCache]: Analyzing trace with hash -486545270, now seen corresponding path program 3 times [2025-03-08 23:15:27,309 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 23:15:27,309 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [942190079] [2025-03-08 23:15:27,309 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-08 23:15:27,310 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 23:15:27,327 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 97 statements into 31 equivalence classes. [2025-03-08 23:15:27,330 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 10 of 97 statements. [2025-03-08 23:15:27,330 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-03-08 23:15:27,331 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 23:15:27,397 INFO L134 CoverageAnalysis]: Checked inductivity of 1336 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1335 trivial. 0 not checked. [2025-03-08 23:15:27,397 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 23:15:27,397 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [942190079] [2025-03-08 23:15:27,398 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [942190079] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 23:15:27,398 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1838890689] [2025-03-08 23:15:27,398 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-08 23:15:27,398 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 23:15:27,398 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 23:15:27,400 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 23:15:27,401 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-03-08 23:15:27,453 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 97 statements into 31 equivalence classes. [2025-03-08 23:15:27,460 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 10 of 97 statements. [2025-03-08 23:15:27,460 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-03-08 23:15:27,460 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 23:15:27,461 INFO L256 TraceCheckSpWp]: Trace formula consists of 56 conjuncts, 12 conjuncts are in the unsatisfiable core [2025-03-08 23:15:27,463 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 23:15:27,471 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2025-03-08 23:15:27,752 INFO L134 CoverageAnalysis]: Checked inductivity of 1336 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1335 trivial. 0 not checked. [2025-03-08 23:15:27,752 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 23:15:28,117 INFO L134 CoverageAnalysis]: Checked inductivity of 1336 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1335 trivial. 0 not checked. [2025-03-08 23:15:28,117 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1838890689] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 23:15:28,117 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 23:15:28,117 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 13 [2025-03-08 23:15:28,117 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1460895495] [2025-03-08 23:15:28,117 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 23:15:28,118 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-03-08 23:15:28,118 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 23:15:28,118 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-03-08 23:15:28,118 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=130, Unknown=0, NotChecked=0, Total=182 [2025-03-08 23:15:28,118 INFO L87 Difference]: Start difference. First operand 115 states and 119 transitions. Second operand has 14 states, 13 states have (on average 2.1538461538461537) internal successors, (28), 14 states have internal predecessors, (28), 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 23:15:28,202 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 23:15:28,202 INFO L93 Difference]: Finished difference Result 128 states and 136 transitions. [2025-03-08 23:15:28,202 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-08 23:15:28,202 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 2.1538461538461537) internal successors, (28), 14 states have internal predecessors, (28), 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 97 [2025-03-08 23:15:28,203 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 23:15:28,203 INFO L225 Difference]: With dead ends: 128 [2025-03-08 23:15:28,203 INFO L226 Difference]: Without dead ends: 128 [2025-03-08 23:15:28,203 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 201 GetRequests, 185 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=93, Invalid=213, Unknown=0, NotChecked=0, Total=306 [2025-03-08 23:15:28,204 INFO L435 NwaCegarLoop]: 13 mSDtfsCounter, 129 mSDsluCounter, 49 mSDsCounter, 0 mSdLazyCounter, 81 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 129 SdHoareTripleChecker+Valid, 62 SdHoareTripleChecker+Invalid, 89 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 81 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 23:15:28,204 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [129 Valid, 62 Invalid, 89 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 81 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 23:15:28,204 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 128 states. [2025-03-08 23:15:28,207 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 128 to 128. [2025-03-08 23:15:28,207 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 128 states, 126 states have (on average 1.0793650793650793) internal successors, (136), 127 states have internal predecessors, (136), 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 23:15:28,208 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 128 states to 128 states and 136 transitions. [2025-03-08 23:15:28,208 INFO L78 Accepts]: Start accepts. Automaton has 128 states and 136 transitions. Word has length 97 [2025-03-08 23:15:28,208 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 23:15:28,208 INFO L471 AbstractCegarLoop]: Abstraction has 128 states and 136 transitions. [2025-03-08 23:15:28,208 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 2.1538461538461537) internal successors, (28), 14 states have internal predecessors, (28), 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 23:15:28,208 INFO L276 IsEmpty]: Start isEmpty. Operand 128 states and 136 transitions. [2025-03-08 23:15:28,209 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2025-03-08 23:15:28,209 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 23:15:28,209 INFO L218 NwaCegarLoop]: trace histogram [30, 30, 30, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 23:15:28,215 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2025-03-08 23:15:28,410 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 23:15:28,410 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 9 more)] === [2025-03-08 23:15:28,410 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 23:15:28,410 INFO L85 PathProgramCache]: Analyzing trace with hash 580428565, now seen corresponding path program 1 times [2025-03-08 23:15:28,410 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 23:15:28,410 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1951137354] [2025-03-08 23:15:28,411 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 23:15:28,411 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 23:15:28,423 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 99 statements into 1 equivalence classes. [2025-03-08 23:15:28,440 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 99 of 99 statements. [2025-03-08 23:15:28,440 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 23:15:28,440 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 23:15:29,165 INFO L134 CoverageAnalysis]: Checked inductivity of 1335 backedges. 0 proven. 1335 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 23:15:29,165 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 23:15:29,165 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1951137354] [2025-03-08 23:15:29,165 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1951137354] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 23:15:29,165 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [464680206] [2025-03-08 23:15:29,165 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 23:15:29,165 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 23:15:29,166 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 23:15:29,167 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 23:15:29,169 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2025-03-08 23:15:29,221 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 99 statements into 1 equivalence classes. [2025-03-08 23:15:29,255 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 99 of 99 statements. [2025-03-08 23:15:29,255 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 23:15:29,255 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 23:15:29,257 INFO L256 TraceCheckSpWp]: Trace formula consists of 432 conjuncts, 32 conjuncts are in the unsatisfiable core [2025-03-08 23:15:29,259 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 23:15:29,363 INFO L134 CoverageAnalysis]: Checked inductivity of 1335 backedges. 0 proven. 1335 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 23:15:29,363 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 23:15:30,296 INFO L134 CoverageAnalysis]: Checked inductivity of 1335 backedges. 0 proven. 1335 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 23:15:30,297 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [464680206] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 23:15:30,297 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 23:15:30,297 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [33, 33, 33] total 65 [2025-03-08 23:15:30,297 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1897041912] [2025-03-08 23:15:30,297 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 23:15:30,298 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 65 states [2025-03-08 23:15:30,298 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 23:15:30,299 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 65 interpolants. [2025-03-08 23:15:30,302 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=2080, Invalid=2080, Unknown=0, NotChecked=0, Total=4160 [2025-03-08 23:15:30,303 INFO L87 Difference]: Start difference. First operand 128 states and 136 transitions. Second operand has 65 states, 65 states have (on average 3.0) internal successors, (195), 65 states have internal predecessors, (195), 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 23:15:30,495 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 23:15:30,495 INFO L93 Difference]: Finished difference Result 224 states and 232 transitions. [2025-03-08 23:15:30,496 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 64 states. [2025-03-08 23:15:30,496 INFO L78 Accepts]: Start accepts. Automaton has has 65 states, 65 states have (on average 3.0) internal successors, (195), 65 states have internal predecessors, (195), 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 99 [2025-03-08 23:15:30,496 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 23:15:30,497 INFO L225 Difference]: With dead ends: 224 [2025-03-08 23:15:30,497 INFO L226 Difference]: Without dead ends: 224 [2025-03-08 23:15:30,498 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 229 GetRequests, 166 SyntacticMatches, 0 SemanticMatches, 63 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 120 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=2080, Invalid=2080, Unknown=0, NotChecked=0, Total=4160 [2025-03-08 23:15:30,499 INFO L435 NwaCegarLoop]: 17 mSDtfsCounter, 4 mSDsluCounter, 45 mSDsCounter, 0 mSdLazyCounter, 190 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 62 SdHoareTripleChecker+Invalid, 192 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 190 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-08 23:15:30,499 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 62 Invalid, 192 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 190 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-08 23:15:30,499 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 224 states. [2025-03-08 23:15:30,503 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 224 to 224. [2025-03-08 23:15:30,504 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 224 states, 222 states have (on average 1.045045045045045) internal successors, (232), 223 states have internal predecessors, (232), 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 23:15:30,504 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 224 states to 224 states and 232 transitions. [2025-03-08 23:15:30,504 INFO L78 Accepts]: Start accepts. Automaton has 224 states and 232 transitions. Word has length 99 [2025-03-08 23:15:30,504 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 23:15:30,505 INFO L471 AbstractCegarLoop]: Abstraction has 224 states and 232 transitions. [2025-03-08 23:15:30,505 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 65 states, 65 states have (on average 3.0) internal successors, (195), 65 states have internal predecessors, (195), 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 23:15:30,505 INFO L276 IsEmpty]: Start isEmpty. Operand 224 states and 232 transitions. [2025-03-08 23:15:30,506 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 196 [2025-03-08 23:15:30,506 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 23:15:30,506 INFO L218 NwaCegarLoop]: trace histogram [62, 62, 62, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 23:15:30,513 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2025-03-08 23:15:30,707 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 23:15:30,707 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 9 more)] === [2025-03-08 23:15:30,707 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 23:15:30,708 INFO L85 PathProgramCache]: Analyzing trace with hash -661460715, now seen corresponding path program 2 times [2025-03-08 23:15:30,708 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 23:15:30,708 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [310746365] [2025-03-08 23:15:30,708 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-08 23:15:30,708 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 23:15:30,728 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 195 statements into 2 equivalence classes. [2025-03-08 23:15:30,732 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 9 of 195 statements. [2025-03-08 23:15:30,732 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-08 23:15:30,733 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 23:15:30,754 INFO L134 CoverageAnalysis]: Checked inductivity of 5735 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5735 trivial. 0 not checked. [2025-03-08 23:15:30,754 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 23:15:30,755 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [310746365] [2025-03-08 23:15:30,755 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [310746365] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 23:15:30,755 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 23:15:30,755 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 23:15:30,755 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [398441448] [2025-03-08 23:15:30,755 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 23:15:30,755 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 23:15:30,755 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 23:15:30,756 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 23:15:30,756 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-08 23:15:30,756 INFO L87 Difference]: Start difference. First operand 224 states and 232 transitions. Second operand has 4 states, 3 states have (on average 4.0) internal successors, (12), 4 states have internal predecessors, (12), 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 23:15:30,768 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 23:15:30,769 INFO L93 Difference]: Finished difference Result 223 states and 231 transitions. [2025-03-08 23:15:30,769 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 23:15:30,769 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 4.0) internal successors, (12), 4 states have internal predecessors, (12), 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 195 [2025-03-08 23:15:30,769 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 23:15:30,770 INFO L225 Difference]: With dead ends: 223 [2025-03-08 23:15:30,770 INFO L226 Difference]: Without dead ends: 219 [2025-03-08 23:15:30,770 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 23:15:30,771 INFO L435 NwaCegarLoop]: 10 mSDtfsCounter, 8 mSDsluCounter, 8 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 18 SdHoareTripleChecker+Invalid, 21 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 23:15:30,771 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 18 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 23:15:30,771 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 219 states. [2025-03-08 23:15:30,774 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 219 to 219. [2025-03-08 23:15:30,775 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 219 states, 218 states have (on average 1.0275229357798166) internal successors, (224), 218 states have internal predecessors, (224), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 23:15:30,775 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 219 states to 219 states and 224 transitions. [2025-03-08 23:15:30,775 INFO L78 Accepts]: Start accepts. Automaton has 219 states and 224 transitions. Word has length 195 [2025-03-08 23:15:30,776 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 23:15:30,776 INFO L471 AbstractCegarLoop]: Abstraction has 219 states and 224 transitions. [2025-03-08 23:15:30,776 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 4.0) internal successors, (12), 4 states have internal predecessors, (12), 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 23:15:30,776 INFO L276 IsEmpty]: Start isEmpty. Operand 219 states and 224 transitions. [2025-03-08 23:15:30,777 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 203 [2025-03-08 23:15:30,777 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 23:15:30,777 INFO L218 NwaCegarLoop]: trace histogram [62, 62, 62, 4, 4, 4, 1, 1, 1, 1] [2025-03-08 23:15:30,777 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-08 23:15:30,778 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 9 more)] === [2025-03-08 23:15:30,778 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 23:15:30,778 INFO L85 PathProgramCache]: Analyzing trace with hash -1140599618, now seen corresponding path program 4 times [2025-03-08 23:15:30,778 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 23:15:30,778 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1363231488] [2025-03-08 23:15:30,778 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-08 23:15:30,778 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 23:15:30,806 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 202 statements into 2 equivalence classes. [2025-03-08 23:15:30,878 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 202 of 202 statements. [2025-03-08 23:15:30,878 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-03-08 23:15:30,878 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 23:15:33,280 INFO L134 CoverageAnalysis]: Checked inductivity of 5757 backedges. 0 proven. 5735 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2025-03-08 23:15:33,280 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 23:15:33,280 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1363231488] [2025-03-08 23:15:33,280 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1363231488] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 23:15:33,280 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [731659974] [2025-03-08 23:15:33,280 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-08 23:15:33,280 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 23:15:33,280 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 23:15:33,283 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 23:15:33,284 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2025-03-08 23:15:33,362 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 202 statements into 2 equivalence classes. [2025-03-08 23:15:54,138 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 202 of 202 statements. [2025-03-08 23:15:54,138 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-03-08 23:15:54,138 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 23:15:54,157 INFO L256 TraceCheckSpWp]: Trace formula consists of 900 conjuncts, 64 conjuncts are in the unsatisfiable core [2025-03-08 23:15:54,160 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 23:15:54,304 INFO L134 CoverageAnalysis]: Checked inductivity of 5757 backedges. 0 proven. 5735 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2025-03-08 23:15:54,304 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 23:15:57,367 INFO L134 CoverageAnalysis]: Checked inductivity of 5757 backedges. 0 proven. 5735 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2025-03-08 23:15:57,368 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [731659974] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 23:15:57,368 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 23:15:57,368 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [65, 65, 65] total 128 [2025-03-08 23:15:57,368 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1349874180] [2025-03-08 23:15:57,368 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 23:15:57,369 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 128 states [2025-03-08 23:15:57,369 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 23:15:57,371 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 128 interpolants. [2025-03-08 23:15:57,373 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8128, Invalid=8128, Unknown=0, NotChecked=0, Total=16256 [2025-03-08 23:15:57,374 INFO L87 Difference]: Start difference. First operand 219 states and 224 transitions. Second operand has 128 states, 128 states have (on average 2.9765625) internal successors, (381), 128 states have internal predecessors, (381), 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 23:15:57,806 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 23:15:57,806 INFO L93 Difference]: Finished difference Result 411 states and 416 transitions. [2025-03-08 23:15:57,806 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 128 states. [2025-03-08 23:15:57,807 INFO L78 Accepts]: Start accepts. Automaton has has 128 states, 128 states have (on average 2.9765625) internal successors, (381), 128 states have internal predecessors, (381), 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 202 [2025-03-08 23:15:57,807 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 23:15:57,808 INFO L225 Difference]: With dead ends: 411 [2025-03-08 23:15:57,808 INFO L226 Difference]: Without dead ends: 411 [2025-03-08 23:15:57,811 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 467 GetRequests, 341 SyntacticMatches, 0 SemanticMatches, 126 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 4.0s TimeCoverageRelationStatistics Valid=8128, Invalid=8128, Unknown=0, NotChecked=0, Total=16256 [2025-03-08 23:15:57,811 INFO L435 NwaCegarLoop]: 12 mSDtfsCounter, 4 mSDsluCounter, 80 mSDsCounter, 0 mSdLazyCounter, 387 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 92 SdHoareTripleChecker+Invalid, 389 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 387 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-08 23:15:57,812 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 92 Invalid, 389 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 387 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-08 23:15:57,812 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 411 states. [2025-03-08 23:15:57,817 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 411 to 411. [2025-03-08 23:15:57,818 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 411 states, 410 states have (on average 1.0146341463414634) internal successors, (416), 410 states have internal predecessors, (416), 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 23:15:57,819 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 411 states to 411 states and 416 transitions. [2025-03-08 23:15:57,819 INFO L78 Accepts]: Start accepts. Automaton has 411 states and 416 transitions. Word has length 202 [2025-03-08 23:15:57,819 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 23:15:57,819 INFO L471 AbstractCegarLoop]: Abstraction has 411 states and 416 transitions. [2025-03-08 23:15:57,819 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 128 states, 128 states have (on average 2.9765625) internal successors, (381), 128 states have internal predecessors, (381), 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 23:15:57,819 INFO L276 IsEmpty]: Start isEmpty. Operand 411 states and 416 transitions. [2025-03-08 23:15:57,826 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 395 [2025-03-08 23:15:57,827 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 23:15:57,827 INFO L218 NwaCegarLoop]: trace histogram [126, 126, 126, 4, 4, 4, 1, 1, 1, 1] [2025-03-08 23:15:57,858 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2025-03-08 23:15:58,030 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2025-03-08 23:15:58,030 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 9 more)] === [2025-03-08 23:15:58,031 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 23:15:58,031 INFO L85 PathProgramCache]: Analyzing trace with hash 1282525374, now seen corresponding path program 5 times [2025-03-08 23:15:58,031 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 23:15:58,031 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [422783597] [2025-03-08 23:15:58,031 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-08 23:15:58,031 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 23:15:58,074 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 394 statements into 127 equivalence classes. [2025-03-08 23:16:00,005 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 127 check-sat command(s) and asserted 394 of 394 statements. [2025-03-08 23:16:00,006 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 127 check-sat command(s) [2025-03-08 23:16:00,006 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 23:16:07,761 INFO L134 CoverageAnalysis]: Checked inductivity of 23773 backedges. 0 proven. 23751 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2025-03-08 23:16:07,761 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 23:16:07,762 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [422783597] [2025-03-08 23:16:07,762 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [422783597] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 23:16:07,762 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [936902112] [2025-03-08 23:16:07,762 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-08 23:16:07,762 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 23:16:07,762 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 23:16:07,764 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 23:16:07,765 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2025-03-08 23:16:07,895 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 394 statements into 127 equivalence classes.