./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/memsafety-broom/sll-fst-shared.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 8fc3dc66 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../sv-benchmarks/c/memsafety-broom/sll-fst-shared.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 64bit --witnessprinter.graph.data.programhash b71f005f6b63440309c4e24d3866ac559942cc4e42efba34dd3f9c28733bd7e5 --- Real Ultimate output --- This is Ultimate 0.3.0-?-8fc3dc6-m [2025-03-17 12:08:19,925 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-17 12:08:19,987 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-64bit-Automizer_Default.epf [2025-03-17 12:08:19,990 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-17 12:08:19,991 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-17 12:08:20,009 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-17 12:08:20,010 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-17 12:08:20,010 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-17 12:08:20,011 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-17 12:08:20,011 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-17 12:08:20,011 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-17 12:08:20,012 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-17 12:08:20,012 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-17 12:08:20,012 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-17 12:08:20,012 INFO L153 SettingsManager]: * Use SBE=true [2025-03-17 12:08:20,012 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-17 12:08:20,012 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-17 12:08:20,012 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-17 12:08:20,012 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2025-03-17 12:08:20,012 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2025-03-17 12:08:20,012 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2025-03-17 12:08:20,012 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-17 12:08:20,012 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-03-17 12:08:20,012 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-03-17 12:08:20,012 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-17 12:08:20,013 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-17 12:08:20,013 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-17 12:08:20,013 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-17 12:08:20,014 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-17 12:08:20,014 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-17 12:08:20,014 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 12:08:20,014 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-17 12:08:20,014 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-17 12:08:20,014 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-17 12:08:20,014 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-17 12:08:20,014 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-17 12:08:20,014 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-17 12:08:20,014 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-17 12:08:20,014 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-17 12:08:20,014 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 -> b71f005f6b63440309c4e24d3866ac559942cc4e42efba34dd3f9c28733bd7e5 [2025-03-17 12:08:20,255 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-17 12:08:20,264 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-17 12:08:20,266 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-17 12:08:20,267 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-17 12:08:20,267 INFO L274 PluginConnector]: CDTParser initialized [2025-03-17 12:08:20,269 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/memsafety-broom/sll-fst-shared.i [2025-03-17 12:08:21,455 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/15f1fb48d/86254cad6bca4344838d94005de3b3a4/FLAG24eba844e [2025-03-17 12:08:21,731 INFO L384 CDTParser]: Found 1 translation units. [2025-03-17 12:08:21,734 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/memsafety-broom/sll-fst-shared.i [2025-03-17 12:08:21,756 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/15f1fb48d/86254cad6bca4344838d94005de3b3a4/FLAG24eba844e [2025-03-17 12:08:22,031 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/15f1fb48d/86254cad6bca4344838d94005de3b3a4 [2025-03-17 12:08:22,033 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-17 12:08:22,034 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-17 12:08:22,035 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-17 12:08:22,035 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-17 12:08:22,038 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-17 12:08:22,038 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 12:08:22" (1/1) ... [2025-03-17 12:08:22,039 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3ba44762 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 12:08:22, skipping insertion in model container [2025-03-17 12:08:22,039 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 12:08:22" (1/1) ... [2025-03-17 12:08:22,066 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-17 12:08:22,270 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 12:08:22,277 INFO L200 MainTranslator]: Completed pre-run [2025-03-17 12:08:22,306 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 12:08:22,324 INFO L204 MainTranslator]: Completed translation [2025-03-17 12:08:22,324 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 12:08:22 WrapperNode [2025-03-17 12:08:22,324 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-17 12:08:22,325 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-17 12:08:22,325 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-17 12:08:22,325 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-17 12:08:22,329 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 12:08:22" (1/1) ... [2025-03-17 12:08:22,339 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 12:08:22" (1/1) ... [2025-03-17 12:08:22,354 INFO L138 Inliner]: procedures = 121, calls = 23, calls flagged for inlining = 6, calls inlined = 6, statements flattened = 67 [2025-03-17 12:08:22,356 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-17 12:08:22,356 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-17 12:08:22,356 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-17 12:08:22,357 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-17 12:08:22,363 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 12:08:22" (1/1) ... [2025-03-17 12:08:22,364 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 12:08:22" (1/1) ... [2025-03-17 12:08:22,368 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 12:08:22" (1/1) ... [2025-03-17 12:08:22,381 INFO L175 MemorySlicer]: Split 11 memory accesses to 1 slices as follows [11]. 100 percent of accesses are in the largest equivalence class. The 0 initializations are split as follows [0]. The 5 writes are split as follows [5]. [2025-03-17 12:08:22,381 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 12:08:22" (1/1) ... [2025-03-17 12:08:22,382 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 12:08:22" (1/1) ... [2025-03-17 12:08:22,387 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 12:08:22" (1/1) ... [2025-03-17 12:08:22,388 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 12:08:22" (1/1) ... [2025-03-17 12:08:22,388 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 12:08:22" (1/1) ... [2025-03-17 12:08:22,389 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 12:08:22" (1/1) ... [2025-03-17 12:08:22,390 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-17 12:08:22,391 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-17 12:08:22,391 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-17 12:08:22,391 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-17 12:08:22,392 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 12:08:22" (1/1) ... [2025-03-17 12:08:22,396 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 12:08:22,405 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 12:08:22,416 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-17 12:08:22,418 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-17 12:08:22,433 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-03-17 12:08:22,433 INFO L130 BoogieDeclarations]: Found specification of procedure alloc_and_zero [2025-03-17 12:08:22,433 INFO L138 BoogieDeclarations]: Found implementation of procedure alloc_and_zero [2025-03-17 12:08:22,433 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-03-17 12:08:22,433 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2025-03-17 12:08:22,433 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2025-03-17 12:08:22,433 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-03-17 12:08:22,433 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-17 12:08:22,433 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-17 12:08:22,505 INFO L256 CfgBuilder]: Building ICFG [2025-03-17 12:08:22,506 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-17 12:08:22,725 INFO L? ?]: Removed 67 outVars from TransFormulas that were not future-live. [2025-03-17 12:08:22,725 INFO L307 CfgBuilder]: Performing block encoding [2025-03-17 12:08:22,738 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-17 12:08:22,738 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-17 12:08:22,739 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 12:08:22 BoogieIcfgContainer [2025-03-17 12:08:22,739 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-17 12:08:22,741 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-17 12:08:22,742 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-17 12:08:22,745 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-17 12:08:22,746 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 17.03 12:08:22" (1/3) ... [2025-03-17 12:08:22,746 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@429a8915 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 12:08:22, skipping insertion in model container [2025-03-17 12:08:22,746 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 12:08:22" (2/3) ... [2025-03-17 12:08:22,747 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@429a8915 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 12:08:22, skipping insertion in model container [2025-03-17 12:08:22,747 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 12:08:22" (3/3) ... [2025-03-17 12:08:22,748 INFO L128 eAbstractionObserver]: Analyzing ICFG sll-fst-shared.i [2025-03-17 12:08:22,759 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-17 12:08:22,761 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG sll-fst-shared.i that has 2 procedures, 70 locations, 1 initial locations, 3 loop locations, and 29 error locations. [2025-03-17 12:08:22,796 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-17 12:08:22,804 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;@5ab79e9f, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-17 12:08:22,805 INFO L334 AbstractCegarLoop]: Starting to check reachability of 29 error locations. [2025-03-17 12:08:22,808 INFO L276 IsEmpty]: Start isEmpty. Operand has 70 states, 37 states have (on average 1.9189189189189189) internal successors, (71), 66 states have internal predecessors, (71), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-17 12:08:22,811 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2025-03-17 12:08:22,812 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 12:08:22,812 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2025-03-17 12:08:22,812 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 26 more)] === [2025-03-17 12:08:22,816 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 12:08:22,816 INFO L85 PathProgramCache]: Analyzing trace with hash 3110883, now seen corresponding path program 1 times [2025-03-17 12:08:22,821 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 12:08:22,822 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [583092095] [2025-03-17 12:08:22,822 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 12:08:22,822 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 12:08:22,882 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-03-17 12:08:22,895 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-03-17 12:08:22,896 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 12:08:22,896 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 12:08:22,983 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 12:08:22,984 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 12:08:22,984 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [583092095] [2025-03-17 12:08:22,984 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [583092095] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 12:08:22,984 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 12:08:22,985 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 12:08:22,985 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1859487735] [2025-03-17 12:08:22,986 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 12:08:22,988 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 12:08:22,988 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 12:08:23,004 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 12:08:23,005 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 12:08:23,006 INFO L87 Difference]: Start difference. First operand has 70 states, 37 states have (on average 1.9189189189189189) internal successors, (71), 66 states have internal predecessors, (71), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 12:08:23,082 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 12:08:23,083 INFO L93 Difference]: Finished difference Result 69 states and 73 transitions. [2025-03-17 12:08:23,084 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 12:08:23,084 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 4 [2025-03-17 12:08:23,085 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 12:08:23,092 INFO L225 Difference]: With dead ends: 69 [2025-03-17 12:08:23,092 INFO L226 Difference]: Without dead ends: 67 [2025-03-17 12:08:23,094 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-17 12:08:23,095 INFO L435 NwaCegarLoop]: 70 mSDtfsCounter, 1 mSDsluCounter, 41 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 111 SdHoareTripleChecker+Invalid, 33 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 33 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 12:08:23,096 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 111 Invalid, 33 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 12:08:23,105 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2025-03-17 12:08:23,119 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 67. [2025-03-17 12:08:23,120 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 67 states, 36 states have (on average 1.8611111111111112) internal successors, (67), 63 states have internal predecessors, (67), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-17 12:08:23,123 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 71 transitions. [2025-03-17 12:08:23,124 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 71 transitions. Word has length 4 [2025-03-17 12:08:23,124 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 12:08:23,124 INFO L471 AbstractCegarLoop]: Abstraction has 67 states and 71 transitions. [2025-03-17 12:08:23,125 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 12:08:23,125 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 71 transitions. [2025-03-17 12:08:23,125 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2025-03-17 12:08:23,125 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 12:08:23,125 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2025-03-17 12:08:23,125 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-17 12:08:23,125 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 26 more)] === [2025-03-17 12:08:23,126 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 12:08:23,126 INFO L85 PathProgramCache]: Analyzing trace with hash 3110884, now seen corresponding path program 1 times [2025-03-17 12:08:23,126 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 12:08:23,126 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [780260253] [2025-03-17 12:08:23,126 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 12:08:23,126 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 12:08:23,132 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-03-17 12:08:23,139 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-03-17 12:08:23,139 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 12:08:23,139 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 12:08:23,202 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 12:08:23,202 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 12:08:23,204 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [780260253] [2025-03-17 12:08:23,204 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [780260253] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 12:08:23,204 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 12:08:23,204 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 12:08:23,204 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1574942469] [2025-03-17 12:08:23,204 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 12:08:23,205 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 12:08:23,205 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 12:08:23,206 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 12:08:23,206 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 12:08:23,221 INFO L87 Difference]: Start difference. First operand 67 states and 71 transitions. Second operand has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 12:08:23,255 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 12:08:23,255 INFO L93 Difference]: Finished difference Result 66 states and 70 transitions. [2025-03-17 12:08:23,256 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 12:08:23,256 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 4 [2025-03-17 12:08:23,256 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 12:08:23,256 INFO L225 Difference]: With dead ends: 66 [2025-03-17 12:08:23,256 INFO L226 Difference]: Without dead ends: 66 [2025-03-17 12:08:23,256 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-17 12:08:23,257 INFO L435 NwaCegarLoop]: 68 mSDtfsCounter, 1 mSDsluCounter, 46 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 114 SdHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 12:08:23,257 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 114 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 12:08:23,258 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2025-03-17 12:08:23,261 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 66. [2025-03-17 12:08:23,262 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 66 states, 36 states have (on average 1.8333333333333333) internal successors, (66), 62 states have internal predecessors, (66), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-17 12:08:23,263 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 70 transitions. [2025-03-17 12:08:23,263 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 70 transitions. Word has length 4 [2025-03-17 12:08:23,264 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 12:08:23,264 INFO L471 AbstractCegarLoop]: Abstraction has 66 states and 70 transitions. [2025-03-17 12:08:23,264 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 12:08:23,264 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 70 transitions. [2025-03-17 12:08:23,265 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2025-03-17 12:08:23,265 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 12:08:23,265 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 12:08:23,265 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-17 12:08:23,265 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr25REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 26 more)] === [2025-03-17 12:08:23,265 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 12:08:23,265 INFO L85 PathProgramCache]: Analyzing trace with hash 1468895523, now seen corresponding path program 1 times [2025-03-17 12:08:23,265 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 12:08:23,265 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1641991639] [2025-03-17 12:08:23,265 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 12:08:23,266 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 12:08:23,278 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-03-17 12:08:23,285 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-03-17 12:08:23,289 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 12:08:23,290 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 12:08:23,335 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 12:08:23,336 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 12:08:23,336 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1641991639] [2025-03-17 12:08:23,336 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1641991639] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 12:08:23,336 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 12:08:23,336 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 12:08:23,336 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [784546237] [2025-03-17 12:08:23,336 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 12:08:23,336 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 12:08:23,336 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 12:08:23,337 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 12:08:23,337 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 12:08:23,337 INFO L87 Difference]: Start difference. First operand 66 states and 70 transitions. Second operand has 3 states, 2 states have (on average 3.5) internal successors, (7), 3 states have internal predecessors, (7), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-17 12:08:23,376 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 12:08:23,376 INFO L93 Difference]: Finished difference Result 69 states and 75 transitions. [2025-03-17 12:08:23,377 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 12:08:23,377 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 3.5) internal successors, (7), 3 states have internal predecessors, (7), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 9 [2025-03-17 12:08:23,377 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 12:08:23,378 INFO L225 Difference]: With dead ends: 69 [2025-03-17 12:08:23,378 INFO L226 Difference]: Without dead ends: 69 [2025-03-17 12:08:23,379 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-17 12:08:23,379 INFO L435 NwaCegarLoop]: 65 mSDtfsCounter, 8 mSDsluCounter, 35 mSDsCounter, 0 mSdLazyCounter, 32 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 100 SdHoareTripleChecker+Invalid, 32 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 32 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 12:08:23,379 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 100 Invalid, 32 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 32 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 12:08:23,380 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2025-03-17 12:08:23,383 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 65. [2025-03-17 12:08:23,383 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 65 states, 36 states have (on average 1.8055555555555556) internal successors, (65), 61 states have internal predecessors, (65), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-17 12:08:23,384 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 69 transitions. [2025-03-17 12:08:23,384 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 69 transitions. Word has length 9 [2025-03-17 12:08:23,384 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 12:08:23,384 INFO L471 AbstractCegarLoop]: Abstraction has 65 states and 69 transitions. [2025-03-17 12:08:23,384 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 3.5) internal successors, (7), 3 states have internal predecessors, (7), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-17 12:08:23,385 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 69 transitions. [2025-03-17 12:08:23,385 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2025-03-17 12:08:23,385 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 12:08:23,385 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 12:08:23,385 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-17 12:08:23,385 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr26REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 26 more)] === [2025-03-17 12:08:23,385 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 12:08:23,385 INFO L85 PathProgramCache]: Analyzing trace with hash 1468895524, now seen corresponding path program 1 times [2025-03-17 12:08:23,385 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 12:08:23,386 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [418432776] [2025-03-17 12:08:23,386 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 12:08:23,386 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 12:08:23,392 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-03-17 12:08:23,396 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-03-17 12:08:23,396 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 12:08:23,397 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 12:08:23,472 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 12:08:23,472 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 12:08:23,472 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [418432776] [2025-03-17 12:08:23,472 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [418432776] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 12:08:23,472 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 12:08:23,472 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 12:08:23,473 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [620080022] [2025-03-17 12:08:23,473 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 12:08:23,473 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 12:08:23,473 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 12:08:23,473 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 12:08:23,473 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 12:08:23,474 INFO L87 Difference]: Start difference. First operand 65 states and 69 transitions. Second operand has 3 states, 2 states have (on average 3.5) internal successors, (7), 3 states have internal predecessors, (7), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-17 12:08:23,527 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 12:08:23,527 INFO L93 Difference]: Finished difference Result 68 states and 74 transitions. [2025-03-17 12:08:23,528 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 12:08:23,529 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 3.5) internal successors, (7), 3 states have internal predecessors, (7), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 9 [2025-03-17 12:08:23,529 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 12:08:23,529 INFO L225 Difference]: With dead ends: 68 [2025-03-17 12:08:23,529 INFO L226 Difference]: Without dead ends: 68 [2025-03-17 12:08:23,529 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-17 12:08:23,530 INFO L435 NwaCegarLoop]: 65 mSDtfsCounter, 8 mSDsluCounter, 40 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 105 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 12:08:23,530 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 105 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 12:08:23,530 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2025-03-17 12:08:23,532 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 64. [2025-03-17 12:08:23,535 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 64 states, 36 states have (on average 1.7777777777777777) internal successors, (64), 60 states have internal predecessors, (64), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-17 12:08:23,537 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 68 transitions. [2025-03-17 12:08:23,539 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 68 transitions. Word has length 9 [2025-03-17 12:08:23,539 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 12:08:23,539 INFO L471 AbstractCegarLoop]: Abstraction has 64 states and 68 transitions. [2025-03-17 12:08:23,540 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 3.5) internal successors, (7), 3 states have internal predecessors, (7), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-17 12:08:23,540 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 68 transitions. [2025-03-17 12:08:23,540 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2025-03-17 12:08:23,540 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 12:08:23,540 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 12:08:23,540 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-17 12:08:23,540 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr24REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 26 more)] === [2025-03-17 12:08:23,541 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 12:08:23,541 INFO L85 PathProgramCache]: Analyzing trace with hash -1435641663, now seen corresponding path program 1 times [2025-03-17 12:08:23,541 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 12:08:23,541 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [151063182] [2025-03-17 12:08:23,541 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 12:08:23,541 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 12:08:23,550 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-03-17 12:08:23,569 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-03-17 12:08:23,569 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 12:08:23,569 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 12:08:23,791 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 12:08:23,791 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 12:08:23,792 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [151063182] [2025-03-17 12:08:23,792 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [151063182] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 12:08:23,792 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 12:08:23,792 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-17 12:08:23,792 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1618780013] [2025-03-17 12:08:23,792 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 12:08:23,792 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-17 12:08:23,792 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 12:08:23,793 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-17 12:08:23,793 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-17 12:08:23,794 INFO L87 Difference]: Start difference. First operand 64 states and 68 transitions. Second operand has 6 states, 5 states have (on average 1.8) internal successors, (9), 5 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-17 12:08:23,918 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 12:08:23,918 INFO L93 Difference]: Finished difference Result 67 states and 73 transitions. [2025-03-17 12:08:23,918 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-17 12:08:23,919 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 1.8) internal successors, (9), 5 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 11 [2025-03-17 12:08:23,919 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 12:08:23,919 INFO L225 Difference]: With dead ends: 67 [2025-03-17 12:08:23,919 INFO L226 Difference]: Without dead ends: 67 [2025-03-17 12:08:23,919 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-17 12:08:23,920 INFO L435 NwaCegarLoop]: 61 mSDtfsCounter, 4 mSDsluCounter, 113 mSDsCounter, 0 mSdLazyCounter, 152 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 174 SdHoareTripleChecker+Invalid, 152 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 152 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 12:08:23,920 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 174 Invalid, 152 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 152 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 12:08:23,921 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2025-03-17 12:08:23,924 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 63. [2025-03-17 12:08:23,925 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 63 states, 36 states have (on average 1.75) internal successors, (63), 59 states have internal predecessors, (63), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-17 12:08:23,926 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 67 transitions. [2025-03-17 12:08:23,927 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 67 transitions. Word has length 11 [2025-03-17 12:08:23,927 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 12:08:23,927 INFO L471 AbstractCegarLoop]: Abstraction has 63 states and 67 transitions. [2025-03-17 12:08:23,927 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 1.8) internal successors, (9), 5 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-17 12:08:23,927 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 67 transitions. [2025-03-17 12:08:23,928 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2025-03-17 12:08:23,928 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 12:08:23,928 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 12:08:23,928 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-17 12:08:23,929 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr23REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 26 more)] === [2025-03-17 12:08:23,929 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 12:08:23,929 INFO L85 PathProgramCache]: Analyzing trace with hash -1435641664, now seen corresponding path program 1 times [2025-03-17 12:08:23,929 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 12:08:23,930 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1835320838] [2025-03-17 12:08:23,930 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 12:08:23,930 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 12:08:23,937 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-03-17 12:08:23,942 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-03-17 12:08:23,943 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 12:08:23,943 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 12:08:24,021 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 12:08:24,021 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 12:08:24,021 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1835320838] [2025-03-17 12:08:24,021 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1835320838] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 12:08:24,021 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 12:08:24,021 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-17 12:08:24,021 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [791742252] [2025-03-17 12:08:24,021 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 12:08:24,022 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-17 12:08:24,022 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 12:08:24,022 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-17 12:08:24,022 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-03-17 12:08:24,022 INFO L87 Difference]: Start difference. First operand 63 states and 67 transitions. Second operand has 7 states, 6 states have (on average 1.5) internal successors, (9), 6 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-17 12:08:24,101 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 12:08:24,102 INFO L93 Difference]: Finished difference Result 64 states and 70 transitions. [2025-03-17 12:08:24,102 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-17 12:08:24,102 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 1.5) internal successors, (9), 6 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 11 [2025-03-17 12:08:24,102 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 12:08:24,103 INFO L225 Difference]: With dead ends: 64 [2025-03-17 12:08:24,103 INFO L226 Difference]: Without dead ends: 64 [2025-03-17 12:08:24,103 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-03-17 12:08:24,103 INFO L435 NwaCegarLoop]: 53 mSDtfsCounter, 20 mSDsluCounter, 123 mSDsCounter, 0 mSdLazyCounter, 128 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 176 SdHoareTripleChecker+Invalid, 133 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 128 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 12:08:24,104 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 176 Invalid, 133 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 128 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 12:08:24,104 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2025-03-17 12:08:24,106 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 60. [2025-03-17 12:08:24,106 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 60 states, 36 states have (on average 1.6666666666666667) internal successors, (60), 56 states have internal predecessors, (60), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-17 12:08:24,106 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 64 transitions. [2025-03-17 12:08:24,106 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 64 transitions. Word has length 11 [2025-03-17 12:08:24,106 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 12:08:24,107 INFO L471 AbstractCegarLoop]: Abstraction has 60 states and 64 transitions. [2025-03-17 12:08:24,107 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 1.5) internal successors, (9), 6 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-17 12:08:24,107 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 64 transitions. [2025-03-17 12:08:24,107 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2025-03-17 12:08:24,107 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 12:08:24,107 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 12:08:24,107 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-17 12:08:24,107 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 26 more)] === [2025-03-17 12:08:24,108 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 12:08:24,108 INFO L85 PathProgramCache]: Analyzing trace with hash -1311786583, now seen corresponding path program 1 times [2025-03-17 12:08:24,108 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 12:08:24,108 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1124054108] [2025-03-17 12:08:24,108 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 12:08:24,108 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 12:08:24,116 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-03-17 12:08:24,119 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-03-17 12:08:24,119 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 12:08:24,119 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 12:08:24,166 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 12:08:24,166 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 12:08:24,166 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1124054108] [2025-03-17 12:08:24,166 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1124054108] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 12:08:24,166 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 12:08:24,166 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-17 12:08:24,166 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1341795618] [2025-03-17 12:08:24,166 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 12:08:24,167 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-17 12:08:24,167 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 12:08:24,167 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-17 12:08:24,167 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-17 12:08:24,167 INFO L87 Difference]: Start difference. First operand 60 states and 64 transitions. Second operand has 5 states, 4 states have (on average 3.5) internal successors, (14), 5 states have internal predecessors, (14), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-17 12:08:24,248 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 12:08:24,248 INFO L93 Difference]: Finished difference Result 80 states and 92 transitions. [2025-03-17 12:08:24,248 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-17 12:08:24,248 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 3.5) internal successors, (14), 5 states have internal predecessors, (14), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 16 [2025-03-17 12:08:24,249 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 12:08:24,249 INFO L225 Difference]: With dead ends: 80 [2025-03-17 12:08:24,249 INFO L226 Difference]: Without dead ends: 80 [2025-03-17 12:08:24,249 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-17 12:08:24,250 INFO L435 NwaCegarLoop]: 46 mSDtfsCounter, 25 mSDsluCounter, 101 mSDsCounter, 0 mSdLazyCounter, 98 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 147 SdHoareTripleChecker+Invalid, 102 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 98 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 12:08:24,250 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [25 Valid, 147 Invalid, 102 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 98 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 12:08:24,250 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2025-03-17 12:08:24,256 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 74. [2025-03-17 12:08:24,256 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 74 states, 50 states have (on average 1.66) internal successors, (83), 69 states have internal predecessors, (83), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-03-17 12:08:24,256 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 89 transitions. [2025-03-17 12:08:24,256 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 89 transitions. Word has length 16 [2025-03-17 12:08:24,256 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 12:08:24,257 INFO L471 AbstractCegarLoop]: Abstraction has 74 states and 89 transitions. [2025-03-17 12:08:24,257 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 3.5) internal successors, (14), 5 states have internal predecessors, (14), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-17 12:08:24,257 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 89 transitions. [2025-03-17 12:08:24,257 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2025-03-17 12:08:24,257 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 12:08:24,257 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 12:08:24,257 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-17 12:08:24,257 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 26 more)] === [2025-03-17 12:08:24,260 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 12:08:24,260 INFO L85 PathProgramCache]: Analyzing trace with hash -1311786582, now seen corresponding path program 1 times [2025-03-17 12:08:24,260 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 12:08:24,260 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [201524068] [2025-03-17 12:08:24,260 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 12:08:24,260 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 12:08:24,270 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-03-17 12:08:24,279 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-03-17 12:08:24,279 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 12:08:24,279 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 12:08:24,436 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 12:08:24,437 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 12:08:24,437 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [201524068] [2025-03-17 12:08:24,437 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [201524068] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 12:08:24,437 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 12:08:24,437 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-17 12:08:24,437 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1745385124] [2025-03-17 12:08:24,438 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 12:08:24,438 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-17 12:08:24,438 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 12:08:24,438 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-17 12:08:24,439 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-03-17 12:08:24,439 INFO L87 Difference]: Start difference. First operand 74 states and 89 transitions. Second operand has 8 states, 7 states have (on average 2.0) internal successors, (14), 7 states have internal predecessors, (14), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-17 12:08:24,535 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 12:08:24,535 INFO L93 Difference]: Finished difference Result 81 states and 95 transitions. [2025-03-17 12:08:24,535 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-17 12:08:24,536 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 2.0) internal successors, (14), 7 states have internal predecessors, (14), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 16 [2025-03-17 12:08:24,536 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 12:08:24,537 INFO L225 Difference]: With dead ends: 81 [2025-03-17 12:08:24,537 INFO L226 Difference]: Without dead ends: 81 [2025-03-17 12:08:24,537 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2025-03-17 12:08:24,537 INFO L435 NwaCegarLoop]: 47 mSDtfsCounter, 14 mSDsluCounter, 248 mSDsCounter, 0 mSdLazyCounter, 136 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 295 SdHoareTripleChecker+Invalid, 138 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 136 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 12:08:24,538 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 295 Invalid, 138 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 136 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 12:08:24,538 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2025-03-17 12:08:24,540 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 79. [2025-03-17 12:08:24,540 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 79 states, 55 states have (on average 1.6181818181818182) internal successors, (89), 74 states have internal predecessors, (89), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-03-17 12:08:24,541 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 95 transitions. [2025-03-17 12:08:24,541 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 95 transitions. Word has length 16 [2025-03-17 12:08:24,541 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 12:08:24,541 INFO L471 AbstractCegarLoop]: Abstraction has 79 states and 95 transitions. [2025-03-17 12:08:24,541 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 2.0) internal successors, (14), 7 states have internal predecessors, (14), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-17 12:08:24,541 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 95 transitions. [2025-03-17 12:08:24,541 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2025-03-17 12:08:24,542 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 12:08:24,542 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 12:08:24,542 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-17 12:08:24,542 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 26 more)] === [2025-03-17 12:08:24,542 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 12:08:24,542 INFO L85 PathProgramCache]: Analyzing trace with hash -2010687310, now seen corresponding path program 1 times [2025-03-17 12:08:24,543 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 12:08:24,543 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1613447298] [2025-03-17 12:08:24,543 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 12:08:24,543 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 12:08:24,554 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-03-17 12:08:24,558 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-03-17 12:08:24,560 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 12:08:24,560 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 12:08:24,620 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 12:08:24,621 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 12:08:24,621 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1613447298] [2025-03-17 12:08:24,621 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1613447298] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 12:08:24,621 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 12:08:24,621 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-17 12:08:24,621 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [382624810] [2025-03-17 12:08:24,621 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 12:08:24,622 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-17 12:08:24,622 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 12:08:24,622 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-17 12:08:24,623 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-03-17 12:08:24,623 INFO L87 Difference]: Start difference. First operand 79 states and 95 transitions. Second operand has 7 states, 7 states have (on average 2.142857142857143) internal successors, (15), 6 states have internal predecessors, (15), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-17 12:08:24,660 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 12:08:24,660 INFO L93 Difference]: Finished difference Result 83 states and 100 transitions. [2025-03-17 12:08:24,660 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-17 12:08:24,661 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.142857142857143) internal successors, (15), 6 states have internal predecessors, (15), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 17 [2025-03-17 12:08:24,661 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 12:08:24,661 INFO L225 Difference]: With dead ends: 83 [2025-03-17 12:08:24,661 INFO L226 Difference]: Without dead ends: 83 [2025-03-17 12:08:24,661 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-03-17 12:08:24,663 INFO L435 NwaCegarLoop]: 56 mSDtfsCounter, 17 mSDsluCounter, 250 mSDsCounter, 0 mSdLazyCounter, 63 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 306 SdHoareTripleChecker+Invalid, 63 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 63 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 12:08:24,664 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [18 Valid, 306 Invalid, 63 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 63 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 12:08:24,664 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2025-03-17 12:08:24,668 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 80. [2025-03-17 12:08:24,672 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 80 states, 56 states have (on average 1.5714285714285714) internal successors, (88), 75 states have internal predecessors, (88), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-03-17 12:08:24,672 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 94 transitions. [2025-03-17 12:08:24,672 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 94 transitions. Word has length 17 [2025-03-17 12:08:24,672 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 12:08:24,672 INFO L471 AbstractCegarLoop]: Abstraction has 80 states and 94 transitions. [2025-03-17 12:08:24,672 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 2.142857142857143) internal successors, (15), 6 states have internal predecessors, (15), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-17 12:08:24,672 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 94 transitions. [2025-03-17 12:08:24,673 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2025-03-17 12:08:24,673 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 12:08:24,673 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 12:08:24,673 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-17 12:08:24,673 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr21REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 26 more)] === [2025-03-17 12:08:24,673 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 12:08:24,673 INFO L85 PathProgramCache]: Analyzing trace with hash 1611085915, now seen corresponding path program 1 times [2025-03-17 12:08:24,674 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 12:08:24,674 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [887029640] [2025-03-17 12:08:24,674 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 12:08:24,674 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 12:08:24,686 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-03-17 12:08:24,693 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-03-17 12:08:24,693 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 12:08:24,693 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 12:08:24,812 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 12:08:24,812 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 12:08:24,812 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [887029640] [2025-03-17 12:08:24,812 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [887029640] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 12:08:24,813 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 12:08:24,813 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-17 12:08:24,813 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [892956007] [2025-03-17 12:08:24,813 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 12:08:24,813 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-17 12:08:24,813 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 12:08:24,813 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-17 12:08:24,814 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-03-17 12:08:24,814 INFO L87 Difference]: Start difference. First operand 80 states and 94 transitions. Second operand has 7 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 6 states have internal predecessors, (16), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-17 12:08:24,922 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 12:08:24,923 INFO L93 Difference]: Finished difference Result 80 states and 93 transitions. [2025-03-17 12:08:24,923 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-17 12:08:24,923 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 6 states have internal predecessors, (16), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 20 [2025-03-17 12:08:24,923 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 12:08:24,924 INFO L225 Difference]: With dead ends: 80 [2025-03-17 12:08:24,924 INFO L226 Difference]: Without dead ends: 80 [2025-03-17 12:08:24,924 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-03-17 12:08:24,924 INFO L435 NwaCegarLoop]: 51 mSDtfsCounter, 8 mSDsluCounter, 88 mSDsCounter, 0 mSdLazyCounter, 99 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 139 SdHoareTripleChecker+Invalid, 107 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 99 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 12:08:24,925 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 139 Invalid, 107 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 99 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 12:08:24,925 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2025-03-17 12:08:24,927 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 80. [2025-03-17 12:08:24,927 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 80 states, 56 states have (on average 1.5535714285714286) internal successors, (87), 75 states have internal predecessors, (87), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-03-17 12:08:24,927 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 93 transitions. [2025-03-17 12:08:24,928 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 93 transitions. Word has length 20 [2025-03-17 12:08:24,928 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 12:08:24,928 INFO L471 AbstractCegarLoop]: Abstraction has 80 states and 93 transitions. [2025-03-17 12:08:24,928 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 6 states have internal predecessors, (16), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-17 12:08:24,928 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 93 transitions. [2025-03-17 12:08:24,928 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2025-03-17 12:08:24,929 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 12:08:24,929 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 12:08:24,929 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-17 12:08:24,929 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr22REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 26 more)] === [2025-03-17 12:08:24,929 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 12:08:24,929 INFO L85 PathProgramCache]: Analyzing trace with hash 1611085916, now seen corresponding path program 1 times [2025-03-17 12:08:24,930 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 12:08:24,930 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1389319967] [2025-03-17 12:08:24,930 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 12:08:24,930 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 12:08:24,938 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-03-17 12:08:24,943 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-03-17 12:08:24,944 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 12:08:24,944 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 12:08:25,131 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 12:08:25,131 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 12:08:25,131 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1389319967] [2025-03-17 12:08:25,131 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1389319967] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 12:08:25,131 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [721785729] [2025-03-17 12:08:25,131 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 12:08:25,131 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 12:08:25,131 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 12:08:25,135 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 12:08:25,137 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-17 12:08:25,186 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-03-17 12:08:25,203 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-03-17 12:08:25,203 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 12:08:25,203 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 12:08:25,205 INFO L256 TraceCheckSpWp]: Trace formula consists of 161 conjuncts, 16 conjuncts are in the unsatisfiable core [2025-03-17 12:08:25,210 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 12:08:25,351 WARN L873 $PredicateComparison]: unable to prove that (exists ((alloc_and_zero_~pi~0.base Int)) (and (= (select |c_old(#valid)| alloc_and_zero_~pi~0.base) 0) (= (store |c_old(#length)| alloc_and_zero_~pi~0.base (select |c_#length| alloc_and_zero_~pi~0.base)) |c_#length|))) is different from true [2025-03-17 12:08:25,398 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-17 12:08:25,404 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2025-03-17 12:08:25,413 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-03-17 12:08:25,414 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2025-03-17 12:08:25,434 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 4 not checked. [2025-03-17 12:08:25,435 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 12:08:25,575 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [721785729] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 12:08:25,575 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-17 12:08:25,575 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9] total 17 [2025-03-17 12:08:25,575 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [525938777] [2025-03-17 12:08:25,575 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-17 12:08:25,575 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2025-03-17 12:08:25,576 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 12:08:25,576 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2025-03-17 12:08:25,576 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=284, Unknown=1, NotChecked=34, Total=380 [2025-03-17 12:08:25,576 INFO L87 Difference]: Start difference. First operand 80 states and 93 transitions. Second operand has 18 states, 17 states have (on average 1.8235294117647058) internal successors, (31), 13 states have internal predecessors, (31), 3 states have call successors, (3), 2 states have call predecessors, (3), 4 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2025-03-17 12:08:25,744 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 12:08:25,744 INFO L93 Difference]: Finished difference Result 82 states and 90 transitions. [2025-03-17 12:08:25,744 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-17 12:08:25,745 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 17 states have (on average 1.8235294117647058) internal successors, (31), 13 states have internal predecessors, (31), 3 states have call successors, (3), 2 states have call predecessors, (3), 4 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) Word has length 20 [2025-03-17 12:08:25,745 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 12:08:25,746 INFO L225 Difference]: With dead ends: 82 [2025-03-17 12:08:25,746 INFO L226 Difference]: Without dead ends: 82 [2025-03-17 12:08:25,746 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 71 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=72, Invalid=351, Unknown=1, NotChecked=38, Total=462 [2025-03-17 12:08:25,747 INFO L435 NwaCegarLoop]: 49 mSDtfsCounter, 21 mSDsluCounter, 432 mSDsCounter, 0 mSdLazyCounter, 191 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 481 SdHoareTripleChecker+Invalid, 272 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 191 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 73 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 12:08:25,747 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [21 Valid, 481 Invalid, 272 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 191 Invalid, 0 Unknown, 73 Unchecked, 0.1s Time] [2025-03-17 12:08:25,748 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2025-03-17 12:08:25,750 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 80. [2025-03-17 12:08:25,753 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 80 states, 56 states have (on average 1.5) internal successors, (84), 75 states have internal predecessors, (84), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-03-17 12:08:25,753 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 90 transitions. [2025-03-17 12:08:25,753 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 90 transitions. Word has length 20 [2025-03-17 12:08:25,753 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 12:08:25,753 INFO L471 AbstractCegarLoop]: Abstraction has 80 states and 90 transitions. [2025-03-17 12:08:25,753 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 17 states have (on average 1.8235294117647058) internal successors, (31), 13 states have internal predecessors, (31), 3 states have call successors, (3), 2 states have call predecessors, (3), 4 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2025-03-17 12:08:25,754 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 90 transitions. [2025-03-17 12:08:25,754 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2025-03-17 12:08:25,754 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 12:08:25,754 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 12:08:25,763 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-03-17 12:08:25,954 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2025-03-17 12:08:25,955 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 26 more)] === [2025-03-17 12:08:25,955 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 12:08:25,955 INFO L85 PathProgramCache]: Analyzing trace with hash -388703527, now seen corresponding path program 1 times [2025-03-17 12:08:25,955 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 12:08:25,955 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1905267986] [2025-03-17 12:08:25,956 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 12:08:25,956 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 12:08:25,968 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 21 statements into 1 equivalence classes. [2025-03-17 12:08:25,974 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 21 of 21 statements. [2025-03-17 12:08:25,974 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 12:08:25,974 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 12:08:26,370 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 12:08:26,371 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 12:08:26,371 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1905267986] [2025-03-17 12:08:26,371 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1905267986] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 12:08:26,371 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [519609795] [2025-03-17 12:08:26,371 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 12:08:26,371 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 12:08:26,371 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 12:08:26,374 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 12:08:26,376 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-17 12:08:26,429 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 21 statements into 1 equivalence classes. [2025-03-17 12:08:26,447 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 21 of 21 statements. [2025-03-17 12:08:26,448 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 12:08:26,448 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 12:08:26,449 INFO L256 TraceCheckSpWp]: Trace formula consists of 153 conjuncts, 53 conjuncts are in the unsatisfiable core [2025-03-17 12:08:26,454 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 12:08:26,461 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 6 treesize of output 5 [2025-03-17 12:08:26,486 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-03-17 12:08:26,496 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-03-17 12:08:26,592 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-03-17 12:08:26,592 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2025-03-17 12:08:26,643 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2025-03-17 12:08:26,651 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2025-03-17 12:08:26,721 INFO L349 Elim1Store]: treesize reduction 21, result has 38.2 percent of original size [2025-03-17 12:08:26,721 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 17 [2025-03-17 12:08:26,736 INFO L349 Elim1Store]: treesize reduction 21, result has 38.2 percent of original size [2025-03-17 12:08:26,736 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 17 [2025-03-17 12:08:26,894 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 12:08:26,894 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 12:08:27,159 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (+ 8 |c_ULTIMATE.start_create_~now~0#1.offset|))) (and (forall ((|ULTIMATE.start_create_~data~0#1.offset| Int) (v_ArrVal_266 (Array Int Int)) (|v_ULTIMATE.start_loop_~x#1.offset_13| Int)) (or (= (select (select (let ((.cse0 (store |c_#memory_$Pointer$#0.offset| |c_ULTIMATE.start_create_~data~0#1.base| v_ArrVal_266))) (store .cse0 |c_ULTIMATE.start_create_~now~0#1.base| (store (select .cse0 |c_ULTIMATE.start_create_~now~0#1.base|) .cse1 |ULTIMATE.start_create_~data~0#1.offset|))) |c_ULTIMATE.start_create_~sll~0#1.base|) |v_ULTIMATE.start_loop_~x#1.offset_13|) 0) (< |v_ULTIMATE.start_loop_~x#1.offset_13| 0) (< |c_ULTIMATE.start_create_~sll~0#1.offset| |v_ULTIMATE.start_loop_~x#1.offset_13|))) (forall ((v_ArrVal_267 Int) (v_ArrVal_265 (Array Int Int)) (|v_ULTIMATE.start_loop_~x#1.offset_13| Int)) (or (= (select (select (let ((.cse2 (store |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_create_~data~0#1.base| v_ArrVal_265))) (store .cse2 |c_ULTIMATE.start_create_~now~0#1.base| (store (select .cse2 |c_ULTIMATE.start_create_~now~0#1.base|) .cse1 v_ArrVal_267))) |c_ULTIMATE.start_create_~sll~0#1.base|) |v_ULTIMATE.start_loop_~x#1.offset_13|) 0) (< |v_ULTIMATE.start_loop_~x#1.offset_13| 0) (< |c_ULTIMATE.start_create_~sll~0#1.offset| |v_ULTIMATE.start_loop_~x#1.offset_13|))))) is different from false [2025-03-17 12:08:27,546 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-17 12:08:27,547 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 18 treesize of output 19 [2025-03-17 12:08:27,554 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-17 12:08:27,555 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 30 treesize of output 30 [2025-03-17 12:08:27,561 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 7 [2025-03-17 12:08:27,593 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-17 12:08:27,593 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 18 treesize of output 19 [2025-03-17 12:08:27,596 INFO L173 IndexEqualityManager]: detected equality via solver [2025-03-17 12:08:27,602 INFO L349 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2025-03-17 12:08:27,602 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 16 treesize of output 11 [2025-03-17 12:08:27,643 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 12:08:27,644 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [519609795] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 12:08:27,644 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 12:08:27,644 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12, 12] total 27 [2025-03-17 12:08:27,644 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1705469597] [2025-03-17 12:08:27,644 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 12:08:27,645 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2025-03-17 12:08:27,645 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 12:08:27,645 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2025-03-17 12:08:27,645 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=77, Invalid=576, Unknown=1, NotChecked=48, Total=702 [2025-03-17 12:08:27,646 INFO L87 Difference]: Start difference. First operand 80 states and 90 transitions. Second operand has 27 states, 27 states have (on average 1.8148148148148149) internal successors, (49), 24 states have internal predecessors, (49), 1 states have call successors, (1), 1 states have call predecessors, (1), 3 states have return successors, (3), 3 states have call predecessors, (3), 1 states have call successors, (3) [2025-03-17 12:08:28,096 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 12:08:28,097 INFO L93 Difference]: Finished difference Result 82 states and 92 transitions. [2025-03-17 12:08:28,097 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-17 12:08:28,097 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 27 states have (on average 1.8148148148148149) internal successors, (49), 24 states have internal predecessors, (49), 1 states have call successors, (1), 1 states have call predecessors, (1), 3 states have return successors, (3), 3 states have call predecessors, (3), 1 states have call successors, (3) Word has length 21 [2025-03-17 12:08:28,098 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 12:08:28,098 INFO L225 Difference]: With dead ends: 82 [2025-03-17 12:08:28,098 INFO L226 Difference]: Without dead ends: 82 [2025-03-17 12:08:28,098 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 27 SyntacticMatches, 1 SemanticMatches, 28 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 148 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=101, Invalid=714, Unknown=1, NotChecked=54, Total=870 [2025-03-17 12:08:28,099 INFO L435 NwaCegarLoop]: 52 mSDtfsCounter, 12 mSDsluCounter, 761 mSDsCounter, 0 mSdLazyCounter, 456 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 813 SdHoareTripleChecker+Invalid, 496 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 456 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 35 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-17 12:08:28,099 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 813 Invalid, 496 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 456 Invalid, 0 Unknown, 35 Unchecked, 0.3s Time] [2025-03-17 12:08:28,099 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2025-03-17 12:08:28,101 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 82. [2025-03-17 12:08:28,101 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 82 states, 58 states have (on average 1.4827586206896552) internal successors, (86), 77 states have internal predecessors, (86), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-03-17 12:08:28,102 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 92 transitions. [2025-03-17 12:08:28,102 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 92 transitions. Word has length 21 [2025-03-17 12:08:28,102 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 12:08:28,102 INFO L471 AbstractCegarLoop]: Abstraction has 82 states and 92 transitions. [2025-03-17 12:08:28,102 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 27 states have (on average 1.8148148148148149) internal successors, (49), 24 states have internal predecessors, (49), 1 states have call successors, (1), 1 states have call predecessors, (1), 3 states have return successors, (3), 3 states have call predecessors, (3), 1 states have call successors, (3) [2025-03-17 12:08:28,103 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 92 transitions. [2025-03-17 12:08:28,105 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2025-03-17 12:08:28,105 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 12:08:28,105 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 12:08:28,112 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-03-17 12:08:28,309 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2025-03-17 12:08:28,309 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr17REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 26 more)] === [2025-03-17 12:08:28,310 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 12:08:28,310 INFO L85 PathProgramCache]: Analyzing trace with hash -399016295, now seen corresponding path program 1 times [2025-03-17 12:08:28,310 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 12:08:28,310 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1986223479] [2025-03-17 12:08:28,310 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 12:08:28,310 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 12:08:28,320 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-03-17 12:08:28,324 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-03-17 12:08:28,325 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 12:08:28,325 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 12:08:28,391 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-17 12:08:28,391 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 12:08:28,391 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1986223479] [2025-03-17 12:08:28,391 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1986223479] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 12:08:28,391 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 12:08:28,391 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-17 12:08:28,391 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1638341849] [2025-03-17 12:08:28,391 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 12:08:28,391 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-17 12:08:28,391 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 12:08:28,392 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-17 12:08:28,392 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-03-17 12:08:28,392 INFO L87 Difference]: Start difference. First operand 82 states and 92 transitions. Second operand has 7 states, 6 states have (on average 3.0) internal successors, (18), 6 states have internal predecessors, (18), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-17 12:08:28,469 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 12:08:28,470 INFO L93 Difference]: Finished difference Result 81 states and 90 transitions. [2025-03-17 12:08:28,470 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-17 12:08:28,470 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 3.0) internal successors, (18), 6 states have internal predecessors, (18), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 23 [2025-03-17 12:08:28,470 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 12:08:28,471 INFO L225 Difference]: With dead ends: 81 [2025-03-17 12:08:28,471 INFO L226 Difference]: Without dead ends: 81 [2025-03-17 12:08:28,471 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2025-03-17 12:08:28,471 INFO L435 NwaCegarLoop]: 54 mSDtfsCounter, 4 mSDsluCounter, 159 mSDsCounter, 0 mSdLazyCounter, 147 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 213 SdHoareTripleChecker+Invalid, 148 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 147 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 12:08:28,471 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 213 Invalid, 148 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 147 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 12:08:28,472 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2025-03-17 12:08:28,473 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 81. [2025-03-17 12:08:28,473 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 81 states, 58 states have (on average 1.4482758620689655) internal successors, (84), 76 states have internal predecessors, (84), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-03-17 12:08:28,473 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 90 transitions. [2025-03-17 12:08:28,473 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 90 transitions. Word has length 23 [2025-03-17 12:08:28,473 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 12:08:28,473 INFO L471 AbstractCegarLoop]: Abstraction has 81 states and 90 transitions. [2025-03-17 12:08:28,477 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 3.0) internal successors, (18), 6 states have internal predecessors, (18), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-17 12:08:28,477 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 90 transitions. [2025-03-17 12:08:28,478 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2025-03-17 12:08:28,478 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 12:08:28,478 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 12:08:28,479 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-17 12:08:28,479 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr18REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 26 more)] === [2025-03-17 12:08:28,479 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 12:08:28,479 INFO L85 PathProgramCache]: Analyzing trace with hash -399016294, now seen corresponding path program 1 times [2025-03-17 12:08:28,479 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 12:08:28,479 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [23987452] [2025-03-17 12:08:28,479 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 12:08:28,479 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 12:08:28,488 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-03-17 12:08:28,493 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-03-17 12:08:28,495 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 12:08:28,495 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 12:08:28,633 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-17 12:08:28,633 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 12:08:28,633 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [23987452] [2025-03-17 12:08:28,633 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [23987452] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 12:08:28,633 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 12:08:28,633 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-17 12:08:28,634 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [604876236] [2025-03-17 12:08:28,634 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 12:08:28,634 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-17 12:08:28,635 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 12:08:28,635 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-17 12:08:28,635 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-03-17 12:08:28,636 INFO L87 Difference]: Start difference. First operand 81 states and 90 transitions. Second operand has 7 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 6 states have internal predecessors, (19), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-17 12:08:28,712 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 12:08:28,712 INFO L93 Difference]: Finished difference Result 80 states and 88 transitions. [2025-03-17 12:08:28,712 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-17 12:08:28,712 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 6 states have internal predecessors, (19), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 23 [2025-03-17 12:08:28,712 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 12:08:28,713 INFO L225 Difference]: With dead ends: 80 [2025-03-17 12:08:28,713 INFO L226 Difference]: Without dead ends: 80 [2025-03-17 12:08:28,713 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2025-03-17 12:08:28,713 INFO L435 NwaCegarLoop]: 54 mSDtfsCounter, 3 mSDsluCounter, 177 mSDsCounter, 0 mSdLazyCounter, 124 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 231 SdHoareTripleChecker+Invalid, 124 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 124 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 12:08:28,714 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 231 Invalid, 124 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 124 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 12:08:28,714 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2025-03-17 12:08:28,715 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 80. [2025-03-17 12:08:28,717 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 80 states, 58 states have (on average 1.4137931034482758) internal successors, (82), 75 states have internal predecessors, (82), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-03-17 12:08:28,717 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 88 transitions. [2025-03-17 12:08:28,717 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 88 transitions. Word has length 23 [2025-03-17 12:08:28,717 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 12:08:28,717 INFO L471 AbstractCegarLoop]: Abstraction has 80 states and 88 transitions. [2025-03-17 12:08:28,717 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 6 states have internal predecessors, (19), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-17 12:08:28,717 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 88 transitions. [2025-03-17 12:08:28,718 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2025-03-17 12:08:28,718 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 12:08:28,718 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 12:08:28,718 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-17 12:08:28,718 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 26 more)] === [2025-03-17 12:08:28,718 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 12:08:28,718 INFO L85 PathProgramCache]: Analyzing trace with hash 835083650, now seen corresponding path program 1 times [2025-03-17 12:08:28,718 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 12:08:28,718 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [376747316] [2025-03-17 12:08:28,718 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 12:08:28,718 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 12:08:28,729 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-03-17 12:08:28,732 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-03-17 12:08:28,732 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 12:08:28,732 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 12:08:28,771 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-17 12:08:28,771 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 12:08:28,771 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [376747316] [2025-03-17 12:08:28,771 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [376747316] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 12:08:28,771 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 12:08:28,771 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-17 12:08:28,772 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1858303135] [2025-03-17 12:08:28,772 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 12:08:28,772 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-17 12:08:28,772 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 12:08:28,772 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-17 12:08:28,772 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-17 12:08:28,772 INFO L87 Difference]: Start difference. First operand 80 states and 88 transitions. Second operand has 6 states, 5 states have (on average 4.0) internal successors, (20), 6 states have internal predecessors, (20), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-17 12:08:28,855 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 12:08:28,855 INFO L93 Difference]: Finished difference Result 92 states and 106 transitions. [2025-03-17 12:08:28,855 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-17 12:08:28,855 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 4.0) internal successors, (20), 6 states have internal predecessors, (20), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 22 [2025-03-17 12:08:28,856 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 12:08:28,856 INFO L225 Difference]: With dead ends: 92 [2025-03-17 12:08:28,856 INFO L226 Difference]: Without dead ends: 92 [2025-03-17 12:08:28,856 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2025-03-17 12:08:28,857 INFO L435 NwaCegarLoop]: 37 mSDtfsCounter, 33 mSDsluCounter, 101 mSDsCounter, 0 mSdLazyCounter, 146 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 33 SdHoareTripleChecker+Valid, 138 SdHoareTripleChecker+Invalid, 152 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 146 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 12:08:28,857 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [33 Valid, 138 Invalid, 152 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 146 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 12:08:28,857 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2025-03-17 12:08:28,859 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 88. [2025-03-17 12:08:28,859 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 88 states, 67 states have (on average 1.462686567164179) internal successors, (98), 83 states have internal predecessors, (98), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-03-17 12:08:28,862 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 104 transitions. [2025-03-17 12:08:28,862 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 104 transitions. Word has length 22 [2025-03-17 12:08:28,862 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 12:08:28,862 INFO L471 AbstractCegarLoop]: Abstraction has 88 states and 104 transitions. [2025-03-17 12:08:28,862 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 4.0) internal successors, (20), 6 states have internal predecessors, (20), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-17 12:08:28,862 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 104 transitions. [2025-03-17 12:08:28,862 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2025-03-17 12:08:28,862 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 12:08:28,862 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 12:08:28,863 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-03-17 12:08:28,863 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 26 more)] === [2025-03-17 12:08:28,863 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 12:08:28,863 INFO L85 PathProgramCache]: Analyzing trace with hash 835083651, now seen corresponding path program 1 times [2025-03-17 12:08:28,863 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 12:08:28,863 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1036468247] [2025-03-17 12:08:28,863 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 12:08:28,863 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 12:08:28,871 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-03-17 12:08:28,874 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-03-17 12:08:28,875 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 12:08:28,875 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 12:08:29,006 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 12:08:29,007 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 12:08:29,007 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1036468247] [2025-03-17 12:08:29,007 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1036468247] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 12:08:29,007 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [307564810] [2025-03-17 12:08:29,007 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 12:08:29,007 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 12:08:29,007 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 12:08:29,009 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 12:08:29,010 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-03-17 12:08:29,059 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-03-17 12:08:29,073 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-03-17 12:08:29,073 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 12:08:29,073 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 12:08:29,074 INFO L256 TraceCheckSpWp]: Trace formula consists of 165 conjuncts, 25 conjuncts are in the unsatisfiable core [2025-03-17 12:08:29,076 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 12:08:29,134 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 12:08:29,134 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 12:08:29,216 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-17 12:08:29,216 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 21 treesize of output 25 [2025-03-17 12:08:29,255 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 12:08:29,256 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [307564810] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 12:08:29,256 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 12:08:29,256 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 5, 5] total 17 [2025-03-17 12:08:29,256 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [194542092] [2025-03-17 12:08:29,256 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 12:08:29,256 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2025-03-17 12:08:29,256 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 12:08:29,256 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2025-03-17 12:08:29,257 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=252, Unknown=0, NotChecked=0, Total=306 [2025-03-17 12:08:29,257 INFO L87 Difference]: Start difference. First operand 88 states and 104 transitions. Second operand has 18 states, 17 states have (on average 2.823529411764706) internal successors, (48), 17 states have internal predecessors, (48), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-17 12:08:29,416 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 12:08:29,417 INFO L93 Difference]: Finished difference Result 98 states and 114 transitions. [2025-03-17 12:08:29,417 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-17 12:08:29,417 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 17 states have (on average 2.823529411764706) internal successors, (48), 17 states have internal predecessors, (48), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 22 [2025-03-17 12:08:29,418 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 12:08:29,419 INFO L225 Difference]: With dead ends: 98 [2025-03-17 12:08:29,419 INFO L226 Difference]: Without dead ends: 98 [2025-03-17 12:08:29,419 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=54, Invalid=252, Unknown=0, NotChecked=0, Total=306 [2025-03-17 12:08:29,419 INFO L435 NwaCegarLoop]: 41 mSDtfsCounter, 48 mSDsluCounter, 363 mSDsCounter, 0 mSdLazyCounter, 346 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 49 SdHoareTripleChecker+Valid, 404 SdHoareTripleChecker+Invalid, 349 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 346 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-17 12:08:29,419 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [49 Valid, 404 Invalid, 349 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 346 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-17 12:08:29,420 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2025-03-17 12:08:29,421 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 96. [2025-03-17 12:08:29,421 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 96 states, 76 states have (on average 1.4210526315789473) internal successors, (108), 91 states have internal predecessors, (108), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-03-17 12:08:29,421 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 114 transitions. [2025-03-17 12:08:29,422 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 114 transitions. Word has length 22 [2025-03-17 12:08:29,422 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 12:08:29,422 INFO L471 AbstractCegarLoop]: Abstraction has 96 states and 114 transitions. [2025-03-17 12:08:29,422 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 17 states have (on average 2.823529411764706) internal successors, (48), 17 states have internal predecessors, (48), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-17 12:08:29,423 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 114 transitions. [2025-03-17 12:08:29,424 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2025-03-17 12:08:29,425 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 12:08:29,425 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 12:08:29,431 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-03-17 12:08:29,625 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 12:08:29,626 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_FREE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 26 more)] === [2025-03-17 12:08:29,626 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 12:08:29,626 INFO L85 PathProgramCache]: Analyzing trace with hash 117789368, now seen corresponding path program 1 times [2025-03-17 12:08:29,626 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 12:08:29,626 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1384471432] [2025-03-17 12:08:29,626 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 12:08:29,626 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 12:08:29,633 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-03-17 12:08:29,637 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-03-17 12:08:29,638 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 12:08:29,638 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 12:08:29,781 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-17 12:08:29,782 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 12:08:29,782 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1384471432] [2025-03-17 12:08:29,782 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1384471432] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 12:08:29,782 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 12:08:29,782 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-17 12:08:29,782 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1884168921] [2025-03-17 12:08:29,782 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 12:08:29,783 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-17 12:08:29,783 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 12:08:29,783 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-17 12:08:29,783 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2025-03-17 12:08:29,783 INFO L87 Difference]: Start difference. First operand 96 states and 114 transitions. Second operand has 10 states, 9 states have (on average 2.3333333333333335) internal successors, (21), 9 states have internal predecessors, (21), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-17 12:08:29,903 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 12:08:29,903 INFO L93 Difference]: Finished difference Result 109 states and 131 transitions. [2025-03-17 12:08:29,903 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-17 12:08:29,904 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 2.3333333333333335) internal successors, (21), 9 states have internal predecessors, (21), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 23 [2025-03-17 12:08:29,904 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 12:08:29,905 INFO L225 Difference]: With dead ends: 109 [2025-03-17 12:08:29,905 INFO L226 Difference]: Without dead ends: 109 [2025-03-17 12:08:29,905 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132 [2025-03-17 12:08:29,905 INFO L435 NwaCegarLoop]: 37 mSDtfsCounter, 20 mSDsluCounter, 273 mSDsCounter, 0 mSdLazyCounter, 211 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 310 SdHoareTripleChecker+Invalid, 212 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 211 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 12:08:29,906 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 310 Invalid, 212 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 211 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 12:08:29,906 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2025-03-17 12:08:29,908 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 99. [2025-03-17 12:08:29,908 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 99 states, 79 states have (on average 1.4177215189873418) internal successors, (112), 94 states have internal predecessors, (112), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-03-17 12:08:29,908 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 118 transitions. [2025-03-17 12:08:29,909 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 118 transitions. Word has length 23 [2025-03-17 12:08:29,909 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 12:08:29,909 INFO L471 AbstractCegarLoop]: Abstraction has 99 states and 118 transitions. [2025-03-17 12:08:29,909 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 2.3333333333333335) internal successors, (21), 9 states have internal predecessors, (21), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-17 12:08:29,909 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 118 transitions. [2025-03-17 12:08:29,909 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2025-03-17 12:08:29,909 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 12:08:29,909 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 12:08:29,910 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-03-17 12:08:29,910 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 26 more)] === [2025-03-17 12:08:29,910 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 12:08:29,910 INFO L85 PathProgramCache]: Analyzing trace with hash 117789753, now seen corresponding path program 1 times [2025-03-17 12:08:29,910 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 12:08:29,910 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [494338729] [2025-03-17 12:08:29,910 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 12:08:29,910 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 12:08:29,916 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-03-17 12:08:29,919 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-03-17 12:08:29,919 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 12:08:29,919 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 12:08:29,971 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-17 12:08:29,971 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 12:08:29,971 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [494338729] [2025-03-17 12:08:29,971 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [494338729] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 12:08:29,971 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 12:08:29,971 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-17 12:08:29,971 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [854316712] [2025-03-17 12:08:29,971 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 12:08:29,972 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-17 12:08:29,972 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 12:08:29,972 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-17 12:08:29,972 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-03-17 12:08:29,972 INFO L87 Difference]: Start difference. First operand 99 states and 118 transitions. Second operand has 8 states, 8 states have (on average 2.625) internal successors, (21), 7 states have internal predecessors, (21), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-17 12:08:30,013 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 12:08:30,013 INFO L93 Difference]: Finished difference Result 99 states and 114 transitions. [2025-03-17 12:08:30,013 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-17 12:08:30,014 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.625) internal successors, (21), 7 states have internal predecessors, (21), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 23 [2025-03-17 12:08:30,014 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 12:08:30,014 INFO L225 Difference]: With dead ends: 99 [2025-03-17 12:08:30,014 INFO L226 Difference]: Without dead ends: 99 [2025-03-17 12:08:30,015 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-03-17 12:08:30,015 INFO L435 NwaCegarLoop]: 44 mSDtfsCounter, 28 mSDsluCounter, 224 mSDsCounter, 0 mSdLazyCounter, 96 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 29 SdHoareTripleChecker+Valid, 268 SdHoareTripleChecker+Invalid, 97 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 96 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 12:08:30,015 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [29 Valid, 268 Invalid, 97 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 96 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 12:08:30,015 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2025-03-17 12:08:30,017 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 97. [2025-03-17 12:08:30,018 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 97 states, 77 states have (on average 1.3636363636363635) internal successors, (105), 92 states have internal predecessors, (105), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-03-17 12:08:30,019 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 111 transitions. [2025-03-17 12:08:30,019 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 111 transitions. Word has length 23 [2025-03-17 12:08:30,019 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 12:08:30,019 INFO L471 AbstractCegarLoop]: Abstraction has 97 states and 111 transitions. [2025-03-17 12:08:30,019 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 2.625) internal successors, (21), 7 states have internal predecessors, (21), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-17 12:08:30,020 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 111 transitions. [2025-03-17 12:08:30,020 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2025-03-17 12:08:30,020 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 12:08:30,020 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 12:08:30,020 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-03-17 12:08:30,020 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_FREE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 26 more)] === [2025-03-17 12:08:30,021 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 12:08:30,021 INFO L85 PathProgramCache]: Analyzing trace with hash -643496896, now seen corresponding path program 1 times [2025-03-17 12:08:30,021 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 12:08:30,021 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1416133770] [2025-03-17 12:08:30,021 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 12:08:30,021 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 12:08:30,027 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-03-17 12:08:30,032 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-03-17 12:08:30,032 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 12:08:30,032 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 12:08:30,206 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-17 12:08:30,206 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 12:08:30,206 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1416133770] [2025-03-17 12:08:30,206 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1416133770] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 12:08:30,206 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 12:08:30,206 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-17 12:08:30,207 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [873808301] [2025-03-17 12:08:30,207 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 12:08:30,207 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-17 12:08:30,207 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 12:08:30,207 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-17 12:08:30,207 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2025-03-17 12:08:30,207 INFO L87 Difference]: Start difference. First operand 97 states and 111 transitions. Second operand has 10 states, 9 states have (on average 2.4444444444444446) internal successors, (22), 9 states have internal predecessors, (22), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-17 12:08:30,349 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 12:08:30,349 INFO L93 Difference]: Finished difference Result 104 states and 119 transitions. [2025-03-17 12:08:30,349 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-17 12:08:30,349 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 2.4444444444444446) internal successors, (22), 9 states have internal predecessors, (22), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 24 [2025-03-17 12:08:30,350 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 12:08:30,350 INFO L225 Difference]: With dead ends: 104 [2025-03-17 12:08:30,351 INFO L226 Difference]: Without dead ends: 104 [2025-03-17 12:08:30,351 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132 [2025-03-17 12:08:30,351 INFO L435 NwaCegarLoop]: 36 mSDtfsCounter, 19 mSDsluCounter, 238 mSDsCounter, 0 mSdLazyCounter, 237 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 274 SdHoareTripleChecker+Invalid, 239 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 237 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 12:08:30,351 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [19 Valid, 274 Invalid, 239 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 237 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 12:08:30,351 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2025-03-17 12:08:30,352 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 98. [2025-03-17 12:08:30,353 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 98 states, 78 states have (on average 1.358974358974359) internal successors, (106), 93 states have internal predecessors, (106), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-03-17 12:08:30,353 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 112 transitions. [2025-03-17 12:08:30,353 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 112 transitions. Word has length 24 [2025-03-17 12:08:30,353 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 12:08:30,353 INFO L471 AbstractCegarLoop]: Abstraction has 98 states and 112 transitions. [2025-03-17 12:08:30,353 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 2.4444444444444446) internal successors, (22), 9 states have internal predecessors, (22), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-17 12:08:30,354 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 112 transitions. [2025-03-17 12:08:30,355 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2025-03-17 12:08:30,355 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 12:08:30,355 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 12:08:30,355 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-03-17 12:08:30,355 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_FREE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 26 more)] === [2025-03-17 12:08:30,356 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 12:08:30,356 INFO L85 PathProgramCache]: Analyzing trace with hash 1526432694, now seen corresponding path program 1 times [2025-03-17 12:08:30,356 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 12:08:30,356 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1227081406] [2025-03-17 12:08:30,356 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 12:08:30,357 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 12:08:30,364 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-03-17 12:08:30,370 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-03-17 12:08:30,370 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 12:08:30,370 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 12:08:30,536 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-17 12:08:30,537 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 12:08:30,537 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1227081406] [2025-03-17 12:08:30,537 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1227081406] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 12:08:30,537 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 12:08:30,537 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-03-17 12:08:30,537 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1207635060] [2025-03-17 12:08:30,537 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 12:08:30,538 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-17 12:08:30,538 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 12:08:30,538 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-17 12:08:30,538 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=90, Unknown=0, NotChecked=0, Total=110 [2025-03-17 12:08:30,538 INFO L87 Difference]: Start difference. First operand 98 states and 112 transitions. Second operand has 11 states, 10 states have (on average 2.3) internal successors, (23), 10 states have internal predecessors, (23), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-17 12:08:30,671 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 12:08:30,671 INFO L93 Difference]: Finished difference Result 99 states and 113 transitions. [2025-03-17 12:08:30,671 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-17 12:08:30,672 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 2.3) internal successors, (23), 10 states have internal predecessors, (23), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 25 [2025-03-17 12:08:30,672 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 12:08:30,672 INFO L225 Difference]: With dead ends: 99 [2025-03-17 12:08:30,672 INFO L226 Difference]: Without dead ends: 99 [2025-03-17 12:08:30,672 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=29, Invalid=127, Unknown=0, NotChecked=0, Total=156 [2025-03-17 12:08:30,673 INFO L435 NwaCegarLoop]: 42 mSDtfsCounter, 13 mSDsluCounter, 292 mSDsCounter, 0 mSdLazyCounter, 232 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 334 SdHoareTripleChecker+Invalid, 234 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 232 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 12:08:30,673 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 334 Invalid, 234 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 232 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 12:08:30,673 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2025-03-17 12:08:30,674 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 99. [2025-03-17 12:08:30,675 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 99 states, 79 states have (on average 1.3544303797468353) internal successors, (107), 94 states have internal predecessors, (107), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-03-17 12:08:30,675 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 113 transitions. [2025-03-17 12:08:30,675 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 113 transitions. Word has length 25 [2025-03-17 12:08:30,675 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 12:08:30,675 INFO L471 AbstractCegarLoop]: Abstraction has 99 states and 113 transitions. [2025-03-17 12:08:30,675 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 2.3) internal successors, (23), 10 states have internal predecessors, (23), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-17 12:08:30,675 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 113 transitions. [2025-03-17 12:08:30,678 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2025-03-17 12:08:30,679 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 12:08:30,679 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 12:08:30,679 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-03-17 12:08:30,679 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 26 more)] === [2025-03-17 12:08:30,680 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 12:08:30,680 INFO L85 PathProgramCache]: Analyzing trace with hash -1976996653, now seen corresponding path program 1 times [2025-03-17 12:08:30,680 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 12:08:30,680 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1600220304] [2025-03-17 12:08:30,680 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 12:08:30,680 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 12:08:30,687 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 27 statements into 1 equivalence classes. [2025-03-17 12:08:30,692 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 27 of 27 statements. [2025-03-17 12:08:30,692 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 12:08:30,692 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 12:08:30,958 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-17 12:08:30,958 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 12:08:30,958 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1600220304] [2025-03-17 12:08:30,958 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1600220304] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 12:08:30,958 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 12:08:30,958 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2025-03-17 12:08:30,958 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1330554046] [2025-03-17 12:08:30,958 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 12:08:30,958 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-03-17 12:08:30,959 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 12:08:30,959 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-03-17 12:08:30,959 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=127, Unknown=0, NotChecked=0, Total=156 [2025-03-17 12:08:30,959 INFO L87 Difference]: Start difference. First operand 99 states and 113 transitions. Second operand has 13 states, 12 states have (on average 2.0833333333333335) internal successors, (25), 12 states have internal predecessors, (25), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-17 12:08:31,116 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 12:08:31,116 INFO L93 Difference]: Finished difference Result 103 states and 117 transitions. [2025-03-17 12:08:31,117 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-17 12:08:31,117 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 2.0833333333333335) internal successors, (25), 12 states have internal predecessors, (25), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 27 [2025-03-17 12:08:31,117 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 12:08:31,117 INFO L225 Difference]: With dead ends: 103 [2025-03-17 12:08:31,117 INFO L226 Difference]: Without dead ends: 103 [2025-03-17 12:08:31,118 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=171, Unknown=0, NotChecked=0, Total=210 [2025-03-17 12:08:31,118 INFO L435 NwaCegarLoop]: 34 mSDtfsCounter, 31 mSDsluCounter, 178 mSDsCounter, 0 mSdLazyCounter, 248 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 212 SdHoareTripleChecker+Invalid, 253 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 248 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 12:08:31,118 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [31 Valid, 212 Invalid, 253 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 248 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 12:08:31,119 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2025-03-17 12:08:31,120 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 101. [2025-03-17 12:08:31,120 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 101 states, 81 states have (on average 1.345679012345679) internal successors, (109), 96 states have internal predecessors, (109), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-03-17 12:08:31,120 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 115 transitions. [2025-03-17 12:08:31,121 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 115 transitions. Word has length 27 [2025-03-17 12:08:31,121 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 12:08:31,121 INFO L471 AbstractCegarLoop]: Abstraction has 101 states and 115 transitions. [2025-03-17 12:08:31,121 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 2.0833333333333335) internal successors, (25), 12 states have internal predecessors, (25), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-17 12:08:31,121 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 115 transitions. [2025-03-17 12:08:31,122 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2025-03-17 12:08:31,122 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 12:08:31,122 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 12:08:31,122 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-03-17 12:08:31,122 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 26 more)] === [2025-03-17 12:08:31,122 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 12:08:31,122 INFO L85 PathProgramCache]: Analyzing trace with hash 1353836468, now seen corresponding path program 1 times [2025-03-17 12:08:31,122 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 12:08:31,122 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1630416585] [2025-03-17 12:08:31,122 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 12:08:31,123 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 12:08:31,135 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 31 statements into 1 equivalence classes. [2025-03-17 12:08:31,142 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 31 of 31 statements. [2025-03-17 12:08:31,144 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 12:08:31,144 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 12:08:31,364 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 1 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 12:08:31,364 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 12:08:31,364 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1630416585] [2025-03-17 12:08:31,364 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1630416585] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 12:08:31,364 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [31953261] [2025-03-17 12:08:31,365 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 12:08:31,365 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 12:08:31,365 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 12:08:31,367 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-17 12:08:31,369 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-17 12:08:31,430 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 31 statements into 1 equivalence classes. [2025-03-17 12:08:31,451 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 31 of 31 statements. [2025-03-17 12:08:31,452 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 12:08:31,452 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 12:08:31,453 INFO L256 TraceCheckSpWp]: Trace formula consists of 236 conjuncts, 48 conjuncts are in the unsatisfiable core [2025-03-17 12:08:31,456 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 12:08:31,594 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-03-17 12:08:31,594 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2025-03-17 12:08:31,601 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2025-03-17 12:08:31,626 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-03-17 12:08:31,663 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 4 [2025-03-17 12:08:31,714 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 1 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 12:08:31,715 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 12:08:31,839 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [31953261] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 12:08:31,840 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-17 12:08:31,840 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 13] total 22 [2025-03-17 12:08:31,840 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1531198589] [2025-03-17 12:08:31,840 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-17 12:08:31,840 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2025-03-17 12:08:31,840 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 12:08:31,841 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2025-03-17 12:08:31,841 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=85, Invalid=565, Unknown=0, NotChecked=0, Total=650 [2025-03-17 12:08:31,841 INFO L87 Difference]: Start difference. First operand 101 states and 115 transitions. Second operand has 23 states, 22 states have (on average 2.3181818181818183) internal successors, (51), 19 states have internal predecessors, (51), 3 states have call successors, (3), 2 states have call predecessors, (3), 4 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2025-03-17 12:08:32,051 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 12:08:32,051 INFO L93 Difference]: Finished difference Result 102 states and 116 transitions. [2025-03-17 12:08:32,053 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-17 12:08:32,054 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 22 states have (on average 2.3181818181818183) internal successors, (51), 19 states have internal predecessors, (51), 3 states have call successors, (3), 2 states have call predecessors, (3), 4 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) Word has length 31 [2025-03-17 12:08:32,054 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 12:08:32,054 INFO L225 Difference]: With dead ends: 102 [2025-03-17 12:08:32,054 INFO L226 Difference]: Without dead ends: 102 [2025-03-17 12:08:32,055 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 167 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=118, Invalid=752, Unknown=0, NotChecked=0, Total=870 [2025-03-17 12:08:32,056 INFO L435 NwaCegarLoop]: 44 mSDtfsCounter, 11 mSDsluCounter, 422 mSDsCounter, 0 mSdLazyCounter, 251 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 466 SdHoareTripleChecker+Invalid, 258 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 251 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 12:08:32,056 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 466 Invalid, 258 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 251 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 12:08:32,056 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2025-03-17 12:08:32,062 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 101. [2025-03-17 12:08:32,062 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 101 states, 81 states have (on average 1.3333333333333333) internal successors, (108), 96 states have internal predecessors, (108), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-03-17 12:08:32,062 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 114 transitions. [2025-03-17 12:08:32,062 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 114 transitions. Word has length 31 [2025-03-17 12:08:32,063 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 12:08:32,063 INFO L471 AbstractCegarLoop]: Abstraction has 101 states and 114 transitions. [2025-03-17 12:08:32,063 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 22 states have (on average 2.3181818181818183) internal successors, (51), 19 states have internal predecessors, (51), 3 states have call successors, (3), 2 states have call predecessors, (3), 4 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2025-03-17 12:08:32,063 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 114 transitions. [2025-03-17 12:08:32,063 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2025-03-17 12:08:32,063 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 12:08:32,063 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 12:08:32,070 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-17 12:08:32,264 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 12:08:32,265 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 26 more)] === [2025-03-17 12:08:32,265 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 12:08:32,265 INFO L85 PathProgramCache]: Analyzing trace with hash 179225564, now seen corresponding path program 1 times [2025-03-17 12:08:32,265 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 12:08:32,265 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1901287082] [2025-03-17 12:08:32,265 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 12:08:32,265 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 12:08:32,272 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 30 statements into 1 equivalence classes. [2025-03-17 12:08:32,276 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 30 of 30 statements. [2025-03-17 12:08:32,279 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 12:08:32,279 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 12:08:32,344 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-17 12:08:32,345 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 12:08:32,345 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1901287082] [2025-03-17 12:08:32,345 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1901287082] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 12:08:32,345 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 12:08:32,345 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-17 12:08:32,345 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [888566526] [2025-03-17 12:08:32,345 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 12:08:32,345 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-17 12:08:32,345 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 12:08:32,346 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-17 12:08:32,346 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-03-17 12:08:32,346 INFO L87 Difference]: Start difference. First operand 101 states and 114 transitions. Second operand has 8 states, 7 states have (on average 4.0) internal successors, (28), 7 states have internal predecessors, (28), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-17 12:08:32,410 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 12:08:32,410 INFO L93 Difference]: Finished difference Result 102 states and 115 transitions. [2025-03-17 12:08:32,410 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-17 12:08:32,410 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 4.0) internal successors, (28), 7 states have internal predecessors, (28), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 30 [2025-03-17 12:08:32,410 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 12:08:32,411 INFO L225 Difference]: With dead ends: 102 [2025-03-17 12:08:32,411 INFO L226 Difference]: Without dead ends: 102 [2025-03-17 12:08:32,411 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-03-17 12:08:32,411 INFO L435 NwaCegarLoop]: 43 mSDtfsCounter, 19 mSDsluCounter, 195 mSDsCounter, 0 mSdLazyCounter, 132 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 238 SdHoareTripleChecker+Invalid, 133 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 132 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 12:08:32,411 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 238 Invalid, 133 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 132 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 12:08:32,412 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2025-03-17 12:08:32,413 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 102. [2025-03-17 12:08:32,413 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 102 states, 82 states have (on average 1.329268292682927) internal successors, (109), 97 states have internal predecessors, (109), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-03-17 12:08:32,417 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 115 transitions. [2025-03-17 12:08:32,418 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 115 transitions. Word has length 30 [2025-03-17 12:08:32,418 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 12:08:32,418 INFO L471 AbstractCegarLoop]: Abstraction has 102 states and 115 transitions. [2025-03-17 12:08:32,418 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 4.0) internal successors, (28), 7 states have internal predecessors, (28), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-17 12:08:32,418 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 115 transitions. [2025-03-17 12:08:32,419 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2025-03-17 12:08:32,419 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 12:08:32,419 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 12:08:32,419 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2025-03-17 12:08:32,419 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr21REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 26 more)] === [2025-03-17 12:08:32,419 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 12:08:32,419 INFO L85 PathProgramCache]: Analyzing trace with hash 1185894757, now seen corresponding path program 1 times [2025-03-17 12:08:32,419 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 12:08:32,419 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [489921811] [2025-03-17 12:08:32,419 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 12:08:32,420 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 12:08:32,429 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 35 statements into 1 equivalence classes. [2025-03-17 12:08:32,437 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 35 of 35 statements. [2025-03-17 12:08:32,438 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 12:08:32,438 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 12:08:32,686 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 10 proven. 5 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-17 12:08:32,687 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 12:08:32,687 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [489921811] [2025-03-17 12:08:32,687 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [489921811] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 12:08:32,687 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [540851200] [2025-03-17 12:08:32,687 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 12:08:32,687 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 12:08:32,687 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 12:08:32,713 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-17 12:08:32,716 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-17 12:08:32,782 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 35 statements into 1 equivalence classes. [2025-03-17 12:08:32,806 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 35 of 35 statements. [2025-03-17 12:08:32,806 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 12:08:32,806 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 12:08:32,812 INFO L256 TraceCheckSpWp]: Trace formula consists of 266 conjuncts, 27 conjuncts are in the unsatisfiable core [2025-03-17 12:08:32,815 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 12:08:32,845 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-03-17 12:08:32,846 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2025-03-17 12:08:32,859 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-03-17 12:08:32,899 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2025-03-17 12:08:32,899 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 34 treesize of output 33 [2025-03-17 12:08:32,910 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2025-03-17 12:08:32,923 WARN L873 $PredicateComparison]: unable to prove that (exists ((alloc_and_zero_~pi~0.base Int)) (and (= (select |c_old(#valid)| alloc_and_zero_~pi~0.base) 0) (= |c_#valid| (store |c_old(#valid)| alloc_and_zero_~pi~0.base (select |c_#valid| alloc_and_zero_~pi~0.base))))) is different from true [2025-03-17 12:08:32,949 INFO L349 Elim1Store]: treesize reduction 20, result has 33.3 percent of original size [2025-03-17 12:08:32,950 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 16 [2025-03-17 12:08:32,951 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 10 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 4 not checked. [2025-03-17 12:08:32,952 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 12:08:32,987 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [540851200] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 12:08:32,988 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-17 12:08:32,988 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 11] total 19 [2025-03-17 12:08:32,988 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [116581849] [2025-03-17 12:08:32,988 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-17 12:08:32,988 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2025-03-17 12:08:32,988 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 12:08:32,989 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2025-03-17 12:08:32,989 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=332, Unknown=1, NotChecked=36, Total=420 [2025-03-17 12:08:32,989 INFO L87 Difference]: Start difference. First operand 102 states and 115 transitions. Second operand has 20 states, 19 states have (on average 2.1052631578947367) internal successors, (40), 17 states have internal predecessors, (40), 2 states have call successors, (2), 2 states have call predecessors, (2), 5 states have return successors, (5), 4 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-17 12:08:33,217 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 12:08:33,218 INFO L93 Difference]: Finished difference Result 101 states and 114 transitions. [2025-03-17 12:08:33,218 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-17 12:08:33,218 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 19 states have (on average 2.1052631578947367) internal successors, (40), 17 states have internal predecessors, (40), 2 states have call successors, (2), 2 states have call predecessors, (2), 5 states have return successors, (5), 4 states have call predecessors, (5), 2 states have call successors, (5) Word has length 35 [2025-03-17 12:08:33,218 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 12:08:33,219 INFO L225 Difference]: With dead ends: 101 [2025-03-17 12:08:33,219 INFO L226 Difference]: Without dead ends: 101 [2025-03-17 12:08:33,219 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 70 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=86, Invalid=517, Unknown=1, NotChecked=46, Total=650 [2025-03-17 12:08:33,220 INFO L435 NwaCegarLoop]: 45 mSDtfsCounter, 7 mSDsluCounter, 391 mSDsCounter, 0 mSdLazyCounter, 321 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 436 SdHoareTripleChecker+Invalid, 378 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 321 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 53 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 12:08:33,220 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 436 Invalid, 378 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 321 Invalid, 0 Unknown, 53 Unchecked, 0.1s Time] [2025-03-17 12:08:33,220 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2025-03-17 12:08:33,223 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 101. [2025-03-17 12:08:33,223 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 101 states, 82 states have (on average 1.3170731707317074) internal successors, (108), 96 states have internal predecessors, (108), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-03-17 12:08:33,223 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 114 transitions. [2025-03-17 12:08:33,223 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 114 transitions. Word has length 35 [2025-03-17 12:08:33,224 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 12:08:33,224 INFO L471 AbstractCegarLoop]: Abstraction has 101 states and 114 transitions. [2025-03-17 12:08:33,224 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 19 states have (on average 2.1052631578947367) internal successors, (40), 17 states have internal predecessors, (40), 2 states have call successors, (2), 2 states have call predecessors, (2), 5 states have return successors, (5), 4 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-17 12:08:33,224 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 114 transitions. [2025-03-17 12:08:33,224 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2025-03-17 12:08:33,224 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 12:08:33,224 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 12:08:33,231 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-17 12:08:33,429 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,SelfDestructingSolverStorable23 [2025-03-17 12:08:33,429 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr22REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 26 more)] === [2025-03-17 12:08:33,429 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 12:08:33,429 INFO L85 PathProgramCache]: Analyzing trace with hash 1185894758, now seen corresponding path program 1 times [2025-03-17 12:08:33,429 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 12:08:33,429 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1510943404] [2025-03-17 12:08:33,429 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 12:08:33,429 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 12:08:33,439 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 35 statements into 1 equivalence classes. [2025-03-17 12:08:33,445 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 35 of 35 statements. [2025-03-17 12:08:33,445 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 12:08:33,445 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 12:08:33,829 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 14 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 12:08:33,829 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 12:08:33,830 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1510943404] [2025-03-17 12:08:33,830 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1510943404] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 12:08:33,830 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1188446719] [2025-03-17 12:08:33,830 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 12:08:33,830 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 12:08:33,830 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 12:08:33,832 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-17 12:08:33,833 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-17 12:08:33,901 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 35 statements into 1 equivalence classes. [2025-03-17 12:08:33,923 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 35 of 35 statements. [2025-03-17 12:08:33,923 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 12:08:33,923 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 12:08:33,930 INFO L256 TraceCheckSpWp]: Trace formula consists of 266 conjuncts, 46 conjuncts are in the unsatisfiable core [2025-03-17 12:08:33,934 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 12:08:33,946 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2025-03-17 12:08:33,998 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-03-17 12:08:33,998 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2025-03-17 12:08:34,022 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-03-17 12:08:34,026 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-03-17 12:08:34,085 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2025-03-17 12:08:34,085 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 59 treesize of output 52 [2025-03-17 12:08:34,089 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 11 [2025-03-17 12:08:34,127 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 18 [2025-03-17 12:08:34,130 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2025-03-17 12:08:34,190 WARN L873 $PredicateComparison]: unable to prove that (exists ((alloc_and_zero_~pi~0.base Int)) (and (= (select |c_old(#valid)| alloc_and_zero_~pi~0.base) 0) (= (store |c_old(#length)| alloc_and_zero_~pi~0.base (select |c_#length| alloc_and_zero_~pi~0.base)) |c_#length|))) is different from true [2025-03-17 12:08:34,226 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-17 12:08:34,226 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 9 [2025-03-17 12:08:34,233 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-03-17 12:08:34,233 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2025-03-17 12:08:34,250 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 14 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 4 not checked. [2025-03-17 12:08:34,251 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 12:08:34,329 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1188446719] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 12:08:34,329 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-17 12:08:34,329 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 14] total 26 [2025-03-17 12:08:34,329 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [427828998] [2025-03-17 12:08:34,329 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-17 12:08:34,330 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2025-03-17 12:08:34,330 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 12:08:34,330 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2025-03-17 12:08:34,330 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=83, Invalid=676, Unknown=1, NotChecked=52, Total=812 [2025-03-17 12:08:34,331 INFO L87 Difference]: Start difference. First operand 101 states and 114 transitions. Second operand has 27 states, 26 states have (on average 1.8076923076923077) internal successors, (47), 21 states have internal predecessors, (47), 4 states have call successors, (4), 3 states have call predecessors, (4), 5 states have return successors, (5), 5 states have call predecessors, (5), 4 states have call successors, (5) [2025-03-17 12:08:34,700 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 12:08:34,700 INFO L93 Difference]: Finished difference Result 98 states and 111 transitions. [2025-03-17 12:08:34,700 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-03-17 12:08:34,701 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 26 states have (on average 1.8076923076923077) internal successors, (47), 21 states have internal predecessors, (47), 4 states have call successors, (4), 3 states have call predecessors, (4), 5 states have return successors, (5), 5 states have call predecessors, (5), 4 states have call successors, (5) Word has length 35 [2025-03-17 12:08:34,701 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 12:08:34,701 INFO L225 Difference]: With dead ends: 98 [2025-03-17 12:08:34,701 INFO L226 Difference]: Without dead ends: 98 [2025-03-17 12:08:34,702 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 185 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=151, Invalid=1042, Unknown=1, NotChecked=66, Total=1260 [2025-03-17 12:08:34,702 INFO L435 NwaCegarLoop]: 52 mSDtfsCounter, 29 mSDsluCounter, 450 mSDsCounter, 0 mSdLazyCounter, 439 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 29 SdHoareTripleChecker+Valid, 502 SdHoareTripleChecker+Invalid, 512 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 439 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 62 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-17 12:08:34,702 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [29 Valid, 502 Invalid, 512 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 439 Invalid, 0 Unknown, 62 Unchecked, 0.2s Time] [2025-03-17 12:08:34,703 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2025-03-17 12:08:34,704 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 98. [2025-03-17 12:08:34,704 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 98 states, 82 states have (on average 1.2804878048780488) internal successors, (105), 93 states have internal predecessors, (105), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-03-17 12:08:34,705 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 111 transitions. [2025-03-17 12:08:34,705 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 111 transitions. Word has length 35 [2025-03-17 12:08:34,705 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 12:08:34,705 INFO L471 AbstractCegarLoop]: Abstraction has 98 states and 111 transitions. [2025-03-17 12:08:34,705 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 26 states have (on average 1.8076923076923077) internal successors, (47), 21 states have internal predecessors, (47), 4 states have call successors, (4), 3 states have call predecessors, (4), 5 states have return successors, (5), 5 states have call predecessors, (5), 4 states have call successors, (5) [2025-03-17 12:08:34,705 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 111 transitions. [2025-03-17 12:08:34,706 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2025-03-17 12:08:34,706 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 12:08:34,706 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 12:08:34,715 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-17 12:08:34,910 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 12:08:34,910 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 26 more)] === [2025-03-17 12:08:34,910 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 12:08:34,910 INFO L85 PathProgramCache]: Analyzing trace with hash 664407660, now seen corresponding path program 1 times [2025-03-17 12:08:34,910 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 12:08:34,910 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1791759784] [2025-03-17 12:08:34,910 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 12:08:34,911 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 12:08:34,918 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 33 statements into 1 equivalence classes. [2025-03-17 12:08:34,921 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 33 of 33 statements. [2025-03-17 12:08:34,921 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 12:08:34,921 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 12:08:35,036 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 12:08:35,036 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 12:08:35,036 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1791759784] [2025-03-17 12:08:35,036 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1791759784] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 12:08:35,036 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1615394200] [2025-03-17 12:08:35,036 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 12:08:35,036 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 12:08:35,037 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 12:08:35,038 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-17 12:08:35,040 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-17 12:08:35,104 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 33 statements into 1 equivalence classes. [2025-03-17 12:08:35,126 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 33 of 33 statements. [2025-03-17 12:08:35,126 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 12:08:35,127 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 12:08:35,128 INFO L256 TraceCheckSpWp]: Trace formula consists of 205 conjuncts, 50 conjuncts are in the unsatisfiable core [2025-03-17 12:08:35,131 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 12:08:35,266 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-17 12:08:35,267 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 15 [2025-03-17 12:08:35,275 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-17 12:08:35,275 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 15 [2025-03-17 12:08:35,335 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 12:08:35,335 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 12:08:35,471 INFO L349 Elim1Store]: treesize reduction 4, result has 63.6 percent of original size [2025-03-17 12:08:35,472 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 24 treesize of output 23 [2025-03-17 12:08:35,478 INFO L349 Elim1Store]: treesize reduction 10, result has 9.1 percent of original size [2025-03-17 12:08:35,478 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 20 treesize of output 12 [2025-03-17 12:08:35,569 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 12:08:35,570 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1615394200] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 12:08:35,570 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 12:08:35,570 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 14, 14] total 24 [2025-03-17 12:08:35,570 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1890890127] [2025-03-17 12:08:35,570 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 12:08:35,570 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2025-03-17 12:08:35,570 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 12:08:35,571 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2025-03-17 12:08:35,571 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=500, Unknown=0, NotChecked=0, Total=552 [2025-03-17 12:08:35,572 INFO L87 Difference]: Start difference. First operand 98 states and 111 transitions. Second operand has 24 states, 24 states have (on average 2.7916666666666665) internal successors, (67), 23 states have internal predecessors, (67), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-17 12:08:35,951 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 12:08:35,952 INFO L93 Difference]: Finished difference Result 125 states and 148 transitions. [2025-03-17 12:08:35,952 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-03-17 12:08:35,952 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 24 states have (on average 2.7916666666666665) internal successors, (67), 23 states have internal predecessors, (67), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 33 [2025-03-17 12:08:35,955 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 12:08:35,956 INFO L225 Difference]: With dead ends: 125 [2025-03-17 12:08:35,956 INFO L226 Difference]: Without dead ends: 125 [2025-03-17 12:08:35,956 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 47 SyntacticMatches, 4 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=100, Invalid=892, Unknown=0, NotChecked=0, Total=992 [2025-03-17 12:08:35,957 INFO L435 NwaCegarLoop]: 32 mSDtfsCounter, 30 mSDsluCounter, 515 mSDsCounter, 0 mSdLazyCounter, 606 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 547 SdHoareTripleChecker+Invalid, 608 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 606 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-17 12:08:35,957 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [31 Valid, 547 Invalid, 608 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 606 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-17 12:08:35,957 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 125 states. [2025-03-17 12:08:35,959 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 125 to 116. [2025-03-17 12:08:35,963 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 116 states, 100 states have (on average 1.3) internal successors, (130), 111 states have internal predecessors, (130), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-03-17 12:08:35,964 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116 states to 116 states and 136 transitions. [2025-03-17 12:08:35,964 INFO L78 Accepts]: Start accepts. Automaton has 116 states and 136 transitions. Word has length 33 [2025-03-17 12:08:35,964 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 12:08:35,964 INFO L471 AbstractCegarLoop]: Abstraction has 116 states and 136 transitions. [2025-03-17 12:08:35,964 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 24 states have (on average 2.7916666666666665) internal successors, (67), 23 states have internal predecessors, (67), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-17 12:08:35,964 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 136 transitions. [2025-03-17 12:08:35,964 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2025-03-17 12:08:35,964 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 12:08:35,964 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 12:08:35,972 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-17 12:08:36,165 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 12:08:36,165 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 26 more)] === [2025-03-17 12:08:36,166 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 12:08:36,166 INFO L85 PathProgramCache]: Analyzing trace with hash 664407309, now seen corresponding path program 1 times [2025-03-17 12:08:36,166 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 12:08:36,166 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [499089254] [2025-03-17 12:08:36,166 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 12:08:36,166 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 12:08:36,173 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 33 statements into 1 equivalence classes. [2025-03-17 12:08:36,181 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 33 of 33 statements. [2025-03-17 12:08:36,182 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 12:08:36,182 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 12:08:36,548 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-17 12:08:36,548 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 12:08:36,548 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [499089254] [2025-03-17 12:08:36,548 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [499089254] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 12:08:36,548 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [482553545] [2025-03-17 12:08:36,548 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 12:08:36,548 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 12:08:36,548 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 12:08:36,550 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-17 12:08:36,552 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-17 12:08:36,619 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 33 statements into 1 equivalence classes. [2025-03-17 12:08:36,638 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 33 of 33 statements. [2025-03-17 12:08:36,638 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 12:08:36,638 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 12:08:36,645 INFO L256 TraceCheckSpWp]: Trace formula consists of 210 conjuncts, 62 conjuncts are in the unsatisfiable core [2025-03-17 12:08:36,647 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 12:08:36,690 INFO L349 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2025-03-17 12:08:36,691 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 20 treesize of output 27 [2025-03-17 12:08:36,730 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-03-17 12:08:36,792 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-17 12:08:36,792 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 21 [2025-03-17 12:08:36,855 INFO L349 Elim1Store]: treesize reduction 28, result has 28.2 percent of original size [2025-03-17 12:08:36,855 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 3 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 31 treesize of output 87 [2025-03-17 12:08:37,008 WARN L873 $PredicateComparison]: unable to prove that (exists ((|v_ULTIMATE.start_destroy_#t~mem13#1.base_11| Int) (v_arrayElimCell_46 Int) (v_DerPreprocessor_1 Int)) (and (= (store (store |c_#valid| |v_ULTIMATE.start_destroy_#t~mem13#1.base_11| 0) |c_ULTIMATE.start_destroy_~l#1.base| 0) |c_ULTIMATE.start_main_old_#valid#1|) (= 0 (select |c_#valid| |v_ULTIMATE.start_destroy_#t~mem13#1.base_11|)) (= v_DerPreprocessor_1 (select (store (store (store |c_#valid| |v_ULTIMATE.start_destroy_#t~mem13#1.base_11| v_DerPreprocessor_1) v_arrayElimCell_46 0) |c_ULTIMATE.start_destroy_~l#1.base| 0) |v_ULTIMATE.start_destroy_#t~mem13#1.base_11|)))) is different from true [2025-03-17 12:08:37,028 INFO L349 Elim1Store]: treesize reduction 28, result has 28.2 percent of original size [2025-03-17 12:08:37,028 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 3 case distinctions, treesize of input 59 treesize of output 75 [2025-03-17 12:08:37,040 WARN L873 $PredicateComparison]: unable to prove that (exists ((|v_ULTIMATE.start_destroy_#t~mem13#1.base_11| Int) (|v_ULTIMATE.start_destroy_~l#1.base_22| Int)) (and (= 0 (select |c_#valid| |v_ULTIMATE.start_destroy_#t~mem13#1.base_11|)) (= (store (store |c_#valid| |v_ULTIMATE.start_destroy_#t~mem13#1.base_11| 0) |v_ULTIMATE.start_destroy_~l#1.base_22| 0) |c_ULTIMATE.start_main_old_#valid#1|) (= (select |c_#valid| |v_ULTIMATE.start_destroy_~l#1.base_22|) 0))) is different from true [2025-03-17 12:08:37,045 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 1 not checked. [2025-03-17 12:08:37,046 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 12:08:37,163 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 44 [2025-03-17 12:08:39,936 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [482553545] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 12:08:39,936 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-17 12:08:39,936 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 14] total 20 [2025-03-17 12:08:39,936 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1051989682] [2025-03-17 12:08:39,936 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-17 12:08:39,937 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2025-03-17 12:08:39,937 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 12:08:39,937 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2025-03-17 12:08:39,937 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=72, Invalid=636, Unknown=2, NotChecked=102, Total=812 [2025-03-17 12:08:39,937 INFO L87 Difference]: Start difference. First operand 116 states and 136 transitions. Second operand has 22 states, 21 states have (on average 2.7142857142857144) internal successors, (57), 19 states have internal predecessors, (57), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-17 12:08:43,941 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2025-03-17 12:08:45,128 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 12:08:45,129 INFO L93 Difference]: Finished difference Result 122 states and 141 transitions. [2025-03-17 12:08:45,129 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-03-17 12:08:45,129 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 21 states have (on average 2.7142857142857144) internal successors, (57), 19 states have internal predecessors, (57), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 33 [2025-03-17 12:08:45,129 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 12:08:45,129 INFO L225 Difference]: With dead ends: 122 [2025-03-17 12:08:45,129 INFO L226 Difference]: Without dead ends: 102 [2025-03-17 12:08:45,130 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 44 SyntacticMatches, 1 SemanticMatches, 35 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 87 ImplicationChecksByTransitivity, 3.3s TimeCoverageRelationStatistics Valid=131, Invalid=1065, Unknown=2, NotChecked=134, Total=1332 [2025-03-17 12:08:45,130 INFO L435 NwaCegarLoop]: 33 mSDtfsCounter, 24 mSDsluCounter, 309 mSDsCounter, 0 mSdLazyCounter, 561 mSolverCounterSat, 5 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 342 SdHoareTripleChecker+Invalid, 720 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 561 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 152 IncrementalHoareTripleChecker+Unchecked, 4.8s IncrementalHoareTripleChecker+Time [2025-03-17 12:08:45,130 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [24 Valid, 342 Invalid, 720 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 561 Invalid, 2 Unknown, 152 Unchecked, 4.8s Time] [2025-03-17 12:08:45,131 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2025-03-17 12:08:45,132 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 102. [2025-03-17 12:08:45,133 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 102 states, 86 states have (on average 1.3372093023255813) internal successors, (115), 97 states have internal predecessors, (115), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-03-17 12:08:45,133 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 121 transitions. [2025-03-17 12:08:45,133 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 121 transitions. Word has length 33 [2025-03-17 12:08:45,133 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 12:08:45,133 INFO L471 AbstractCegarLoop]: Abstraction has 102 states and 121 transitions. [2025-03-17 12:08:45,133 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 21 states have (on average 2.7142857142857144) internal successors, (57), 19 states have internal predecessors, (57), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-17 12:08:45,133 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 121 transitions. [2025-03-17 12:08:45,134 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2025-03-17 12:08:45,134 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 12:08:45,134 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 12:08:45,143 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2025-03-17 12:08:45,338 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,SelfDestructingSolverStorable26 [2025-03-17 12:08:45,338 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 26 more)] === [2025-03-17 12:08:45,338 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 12:08:45,338 INFO L85 PathProgramCache]: Analyzing trace with hash -684727537, now seen corresponding path program 1 times [2025-03-17 12:08:45,338 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 12:08:45,338 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1139272584] [2025-03-17 12:08:45,338 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 12:08:45,338 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 12:08:45,346 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 36 statements into 1 equivalence classes. [2025-03-17 12:08:45,353 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 36 of 36 statements. [2025-03-17 12:08:45,353 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 12:08:45,353 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 12:08:45,596 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 5 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 12:08:45,596 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 12:08:45,596 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1139272584] [2025-03-17 12:08:45,596 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1139272584] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 12:08:45,596 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [147348007] [2025-03-17 12:08:45,596 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 12:08:45,596 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 12:08:45,596 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 12:08:45,598 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-17 12:08:45,600 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-17 12:08:45,674 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 36 statements into 1 equivalence classes. [2025-03-17 12:08:45,696 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 36 of 36 statements. [2025-03-17 12:08:45,696 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 12:08:45,697 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 12:08:45,698 INFO L256 TraceCheckSpWp]: Trace formula consists of 258 conjuncts, 49 conjuncts are in the unsatisfiable core [2025-03-17 12:08:45,701 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 12:08:45,776 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2025-03-17 12:08:45,776 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2025-03-17 12:08:45,811 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-03-17 12:08:45,872 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2025-03-17 12:08:45,872 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 34 treesize of output 33 [2025-03-17 12:08:45,947 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2025-03-17 12:08:46,004 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 5 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 12:08:46,004 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 12:08:46,027 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1042 (Array Int Int))) (= (select |c_#valid| (select (select (store |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_create_#t~mem9#1.base| v_ArrVal_1042) |c_ULTIMATE.start_create_~sll~0#1.base|) |c_ULTIMATE.start_create_~sll~0#1.offset|)) 1)) is different from false [2025-03-17 12:08:46,063 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-17 12:08:46,064 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 20 treesize of output 21 [2025-03-17 12:08:46,070 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-17 12:08:46,071 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 34 treesize of output 37 [2025-03-17 12:08:46,074 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 5 [2025-03-17 12:08:50,235 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [147348007] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 12:08:50,235 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-17 12:08:50,235 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 13] total 24 [2025-03-17 12:08:50,235 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1812933133] [2025-03-17 12:08:50,235 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-17 12:08:50,236 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2025-03-17 12:08:50,236 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 12:08:50,236 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2025-03-17 12:08:50,236 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=93, Invalid=659, Unknown=8, NotChecked=52, Total=812 [2025-03-17 12:08:50,236 INFO L87 Difference]: Start difference. First operand 102 states and 121 transitions. Second operand has 25 states, 24 states have (on average 2.2083333333333335) internal successors, (53), 22 states have internal predecessors, (53), 2 states have call successors, (2), 2 states have call predecessors, (2), 3 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2025-03-17 12:08:50,471 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 12:08:50,471 INFO L93 Difference]: Finished difference Result 106 states and 128 transitions. [2025-03-17 12:08:50,471 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-03-17 12:08:50,471 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 24 states have (on average 2.2083333333333335) internal successors, (53), 22 states have internal predecessors, (53), 2 states have call successors, (2), 2 states have call predecessors, (2), 3 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) Word has length 36 [2025-03-17 12:08:50,471 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 12:08:50,472 INFO L225 Difference]: With dead ends: 106 [2025-03-17 12:08:50,472 INFO L226 Difference]: Without dead ends: 106 [2025-03-17 12:08:50,472 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 41 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 203 ImplicationChecksByTransitivity, 4.4s TimeCoverageRelationStatistics Valid=106, Invalid=702, Unknown=8, NotChecked=54, Total=870 [2025-03-17 12:08:50,472 INFO L435 NwaCegarLoop]: 40 mSDtfsCounter, 7 mSDsluCounter, 347 mSDsCounter, 0 mSdLazyCounter, 431 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 387 SdHoareTripleChecker+Invalid, 436 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 431 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-17 12:08:50,472 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 387 Invalid, 436 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 431 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-17 12:08:50,473 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2025-03-17 12:08:50,474 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 103. [2025-03-17 12:08:50,474 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 103 states, 87 states have (on average 1.3448275862068966) internal successors, (117), 98 states have internal predecessors, (117), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-03-17 12:08:50,477 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 123 transitions. [2025-03-17 12:08:50,477 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 123 transitions. Word has length 36 [2025-03-17 12:08:50,477 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 12:08:50,477 INFO L471 AbstractCegarLoop]: Abstraction has 103 states and 123 transitions. [2025-03-17 12:08:50,477 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 24 states have (on average 2.2083333333333335) internal successors, (53), 22 states have internal predecessors, (53), 2 states have call successors, (2), 2 states have call predecessors, (2), 3 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2025-03-17 12:08:50,477 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 123 transitions. [2025-03-17 12:08:50,477 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2025-03-17 12:08:50,477 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 12:08:50,478 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 12:08:50,484 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2025-03-17 12:08:50,678 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable27 [2025-03-17 12:08:50,678 INFO L396 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 26 more)] === [2025-03-17 12:08:50,679 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 12:08:50,679 INFO L85 PathProgramCache]: Analyzing trace with hash -684727536, now seen corresponding path program 1 times [2025-03-17 12:08:50,679 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 12:08:50,679 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [268323871] [2025-03-17 12:08:50,679 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 12:08:50,679 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 12:08:50,688 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 36 statements into 1 equivalence classes. [2025-03-17 12:08:50,693 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 36 of 36 statements. [2025-03-17 12:08:50,693 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 12:08:50,693 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 12:08:50,991 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 5 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 12:08:50,991 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 12:08:50,991 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [268323871] [2025-03-17 12:08:50,991 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [268323871] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 12:08:50,991 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [753434029] [2025-03-17 12:08:50,991 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 12:08:50,991 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 12:08:50,991 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 12:08:50,993 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 12:08:50,994 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2025-03-17 12:08:51,063 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 36 statements into 1 equivalence classes. [2025-03-17 12:08:51,082 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 36 of 36 statements. [2025-03-17 12:08:51,083 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 12:08:51,083 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 12:08:51,084 INFO L256 TraceCheckSpWp]: Trace formula consists of 258 conjuncts, 53 conjuncts are in the unsatisfiable core [2025-03-17 12:08:51,086 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 12:08:51,156 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-03-17 12:08:51,156 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2025-03-17 12:08:51,187 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-03-17 12:08:51,190 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-03-17 12:08:51,247 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2025-03-17 12:08:51,248 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 56 treesize of output 51 [2025-03-17 12:08:51,252 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 24 [2025-03-17 12:08:51,320 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 19 [2025-03-17 12:08:51,322 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 14 [2025-03-17 12:08:51,363 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 5 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 12:08:51,363 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 12:08:51,472 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-17 12:08:51,473 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 42 treesize of output 46 [2025-03-17 12:08:51,493 WARN L851 $PredicateComparison]: unable to prove that (and (forall ((v_prenex_16 (Array Int Int))) (< (select (select (store |c_#memory_$Pointer$#0.offset| |c_ULTIMATE.start_create_#t~mem9#1.base| v_prenex_16) |c_ULTIMATE.start_create_~sll~0#1.base|) |c_ULTIMATE.start_create_~sll~0#1.offset|) (+ |c_ULTIMATE.start_create_#t~mem9#1.offset| 1))) (forall ((v_ArrVal_1132 (Array Int Int))) (<= 0 (+ 8 (select (select (store |c_#memory_$Pointer$#0.offset| |c_ULTIMATE.start_create_#t~mem9#1.base| v_ArrVal_1132) |c_ULTIMATE.start_create_~sll~0#1.base|) |c_ULTIMATE.start_create_~sll~0#1.offset|)))) (forall ((v_ArrVal_1131 (Array Int Int))) (= |c_ULTIMATE.start_create_#t~mem9#1.base| (select (select (store |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_create_#t~mem9#1.base| v_ArrVal_1131) |c_ULTIMATE.start_create_~sll~0#1.base|) |c_ULTIMATE.start_create_~sll~0#1.offset|)))) is different from false [2025-03-17 12:08:51,503 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_create_~now~0#1.base|) |c_ULTIMATE.start_create_~now~0#1.offset|))) (and (forall ((v_prenex_16 (Array Int Int))) (< (select (select (store |c_#memory_$Pointer$#0.offset| .cse0 v_prenex_16) |c_ULTIMATE.start_create_~sll~0#1.base|) |c_ULTIMATE.start_create_~sll~0#1.offset|) (+ (select (select |c_#memory_$Pointer$#0.offset| |c_ULTIMATE.start_create_~now~0#1.base|) |c_ULTIMATE.start_create_~now~0#1.offset|) 1))) (forall ((v_ArrVal_1132 (Array Int Int))) (<= 0 (+ (select (select (store |c_#memory_$Pointer$#0.offset| .cse0 v_ArrVal_1132) |c_ULTIMATE.start_create_~sll~0#1.base|) |c_ULTIMATE.start_create_~sll~0#1.offset|) 8))) (forall ((v_ArrVal_1131 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$#0.base| .cse0 v_ArrVal_1131) |c_ULTIMATE.start_create_~sll~0#1.base|) |c_ULTIMATE.start_create_~sll~0#1.offset|) .cse0)))) is different from false [2025-03-17 12:08:51,518 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-17 12:08:51,518 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 59 treesize of output 52 [2025-03-17 12:08:51,523 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-17 12:08:51,523 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 45 treesize of output 46 [2025-03-17 12:08:51,530 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-17 12:08:51,530 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 75 treesize of output 66 [2025-03-17 12:08:51,533 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 51 treesize of output 49 [2025-03-17 12:08:51,541 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-17 12:08:51,541 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 70 treesize of output 73 [2025-03-17 12:08:51,545 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 57 treesize of output 55 [2025-03-17 12:08:51,548 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 55 treesize of output 53 [2025-03-17 12:08:51,650 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [753434029] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 12:08:51,650 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-17 12:08:51,650 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 13] total 23 [2025-03-17 12:08:51,650 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1445793550] [2025-03-17 12:08:51,650 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-17 12:08:51,650 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2025-03-17 12:08:51,650 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 12:08:51,651 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2025-03-17 12:08:51,651 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=95, Invalid=781, Unknown=2, NotChecked=114, Total=992 [2025-03-17 12:08:51,651 INFO L87 Difference]: Start difference. First operand 103 states and 123 transitions. Second operand has 24 states, 23 states have (on average 2.3043478260869565) internal successors, (53), 21 states have internal predecessors, (53), 2 states have call successors, (2), 2 states have call predecessors, (2), 3 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2025-03-17 12:08:51,909 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 12:08:51,909 INFO L93 Difference]: Finished difference Result 106 states and 126 transitions. [2025-03-17 12:08:51,909 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-03-17 12:08:51,910 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 23 states have (on average 2.3043478260869565) internal successors, (53), 21 states have internal predecessors, (53), 2 states have call successors, (2), 2 states have call predecessors, (2), 3 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) Word has length 36 [2025-03-17 12:08:51,910 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 12:08:51,910 INFO L225 Difference]: With dead ends: 106 [2025-03-17 12:08:51,910 INFO L226 Difference]: Without dead ends: 106 [2025-03-17 12:08:51,911 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 242 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=133, Invalid=995, Unknown=2, NotChecked=130, Total=1260 [2025-03-17 12:08:51,911 INFO L435 NwaCegarLoop]: 44 mSDtfsCounter, 15 mSDsluCounter, 571 mSDsCounter, 0 mSdLazyCounter, 466 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 615 SdHoareTripleChecker+Invalid, 473 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 466 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-17 12:08:51,911 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 615 Invalid, 473 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 466 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-17 12:08:51,911 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2025-03-17 12:08:51,913 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 105. [2025-03-17 12:08:51,913 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 105 states, 89 states have (on average 1.3258426966292134) internal successors, (118), 100 states have internal predecessors, (118), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-03-17 12:08:51,913 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 124 transitions. [2025-03-17 12:08:51,913 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 124 transitions. Word has length 36 [2025-03-17 12:08:51,913 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 12:08:51,913 INFO L471 AbstractCegarLoop]: Abstraction has 105 states and 124 transitions. [2025-03-17 12:08:51,914 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 23 states have (on average 2.3043478260869565) internal successors, (53), 21 states have internal predecessors, (53), 2 states have call successors, (2), 2 states have call predecessors, (2), 3 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2025-03-17 12:08:51,914 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 124 transitions. [2025-03-17 12:08:51,914 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2025-03-17 12:08:51,914 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 12:08:51,914 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 12:08:51,922 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Ended with exit code 0 [2025-03-17 12:08:52,114 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable28 [2025-03-17 12:08:52,115 INFO L396 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_FREE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 26 more)] === [2025-03-17 12:08:52,115 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 12:08:52,115 INFO L85 PathProgramCache]: Analyzing trace with hash -893442706, now seen corresponding path program 1 times [2025-03-17 12:08:52,115 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 12:08:52,115 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1479700379] [2025-03-17 12:08:52,115 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 12:08:52,115 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 12:08:52,124 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 38 statements into 1 equivalence classes. [2025-03-17 12:08:52,128 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 38 of 38 statements. [2025-03-17 12:08:52,128 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 12:08:52,128 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 12:08:52,341 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 5 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 12:08:52,341 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 12:08:52,341 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1479700379] [2025-03-17 12:08:52,342 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1479700379] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 12:08:52,342 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1251501840] [2025-03-17 12:08:52,342 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 12:08:52,342 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 12:08:52,342 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 12:08:52,343 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 12:08:52,344 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2025-03-17 12:08:52,419 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 38 statements into 1 equivalence classes. [2025-03-17 12:08:52,439 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 38 of 38 statements. [2025-03-17 12:08:52,439 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 12:08:52,439 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 12:08:52,440 INFO L256 TraceCheckSpWp]: Trace formula consists of 278 conjuncts, 58 conjuncts are in the unsatisfiable core [2025-03-17 12:08:52,442 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 12:08:52,575 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-03-17 12:08:52,576 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2025-03-17 12:08:52,606 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-03-17 12:08:52,612 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-03-17 12:08:52,649 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2025-03-17 12:08:52,681 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-17 12:08:52,681 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 34 [2025-03-17 12:08:52,747 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 12 [2025-03-17 12:08:52,775 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 1 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 12:08:52,775 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 12:08:56,893 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 178 treesize of output 170 [2025-03-17 12:08:57,069 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1251501840] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 12:08:57,069 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-17 12:08:57,069 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 17] total 29 [2025-03-17 12:08:57,069 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1295547165] [2025-03-17 12:08:57,069 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-17 12:08:57,070 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2025-03-17 12:08:57,070 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 12:08:57,071 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2025-03-17 12:08:57,071 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=107, Invalid=948, Unknown=1, NotChecked=0, Total=1056 [2025-03-17 12:08:57,071 INFO L87 Difference]: Start difference. First operand 105 states and 124 transitions. Second operand has 29 states, 29 states have (on average 2.206896551724138) internal successors, (64), 25 states have internal predecessors, (64), 3 states have call successors, (3), 2 states have call predecessors, (3), 4 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2025-03-17 12:08:57,411 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 12:08:57,411 INFO L93 Difference]: Finished difference Result 104 states and 123 transitions. [2025-03-17 12:08:57,411 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-03-17 12:08:57,412 INFO L78 Accepts]: Start accepts. Automaton has has 29 states, 29 states have (on average 2.206896551724138) internal successors, (64), 25 states have internal predecessors, (64), 3 states have call successors, (3), 2 states have call predecessors, (3), 4 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) Word has length 38 [2025-03-17 12:08:57,412 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 12:08:57,412 INFO L225 Difference]: With dead ends: 104 [2025-03-17 12:08:57,412 INFO L226 Difference]: Without dead ends: 104 [2025-03-17 12:08:57,413 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 41 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 294 ImplicationChecksByTransitivity, 4.5s TimeCoverageRelationStatistics Valid=147, Invalid=1184, Unknown=1, NotChecked=0, Total=1332 [2025-03-17 12:08:57,413 INFO L435 NwaCegarLoop]: 44 mSDtfsCounter, 18 mSDsluCounter, 773 mSDsCounter, 0 mSdLazyCounter, 442 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 817 SdHoareTripleChecker+Invalid, 448 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 442 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-17 12:08:57,413 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [18 Valid, 817 Invalid, 448 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 442 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-17 12:08:57,414 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2025-03-17 12:08:57,415 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 103. [2025-03-17 12:08:57,415 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 103 states, 87 states have (on average 1.3218390804597702) internal successors, (115), 98 states have internal predecessors, (115), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-03-17 12:08:57,417 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 121 transitions. [2025-03-17 12:08:57,417 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 121 transitions. Word has length 38 [2025-03-17 12:08:57,417 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 12:08:57,417 INFO L471 AbstractCegarLoop]: Abstraction has 103 states and 121 transitions. [2025-03-17 12:08:57,417 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 29 states have (on average 2.206896551724138) internal successors, (64), 25 states have internal predecessors, (64), 3 states have call successors, (3), 2 states have call predecessors, (3), 4 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2025-03-17 12:08:57,417 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 121 transitions. [2025-03-17 12:08:57,418 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2025-03-17 12:08:57,418 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 12:08:57,418 INFO L218 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 12:08:57,424 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Ended with exit code 0 [2025-03-17 12:08:57,618 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29,12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 12:08:57,619 INFO L396 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 26 more)] === [2025-03-17 12:08:57,619 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 12:08:57,619 INFO L85 PathProgramCache]: Analyzing trace with hash -1003183821, now seen corresponding path program 2 times [2025-03-17 12:08:57,619 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 12:08:57,619 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [23679813] [2025-03-17 12:08:57,619 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-17 12:08:57,620 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 12:08:57,628 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 41 statements into 2 equivalence classes. [2025-03-17 12:08:57,637 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 41 of 41 statements. [2025-03-17 12:08:57,637 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-17 12:08:57,637 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 12:08:58,232 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 7 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 12:08:58,232 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 12:08:58,232 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [23679813] [2025-03-17 12:08:58,232 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [23679813] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 12:08:58,232 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [701745328] [2025-03-17 12:08:58,232 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-17 12:08:58,233 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 12:08:58,233 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 12:08:58,235 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 12:08:58,235 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2025-03-17 12:08:58,314 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 41 statements into 2 equivalence classes. [2025-03-17 12:08:58,340 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 41 of 41 statements. [2025-03-17 12:08:58,340 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-17 12:08:58,340 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 12:08:58,342 INFO L256 TraceCheckSpWp]: Trace formula consists of 280 conjuncts, 82 conjuncts are in the unsatisfiable core [2025-03-17 12:08:58,344 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 12:08:58,505 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-03-17 12:08:58,510 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-03-17 12:08:58,558 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-03-17 12:08:58,558 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2025-03-17 12:08:58,623 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2025-03-17 12:08:58,639 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 15 [2025-03-17 12:08:58,772 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-17 12:08:58,774 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-17 12:08:58,779 INFO L349 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2025-03-17 12:08:58,779 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 93 treesize of output 66 [2025-03-17 12:08:58,790 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-17 12:08:58,791 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 25 [2025-03-17 12:08:59,114 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 7 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 12:08:59,114 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 12:09:09,116 INFO L349 Elim1Store]: treesize reduction 511, result has 46.8 percent of original size [2025-03-17 12:09:09,117 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 8 case distinctions, treesize of input 1019 treesize of output 1189 [2025-03-17 12:09:09,683 INFO L349 Elim1Store]: treesize reduction 231, result has 54.1 percent of original size [2025-03-17 12:09:09,684 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 9 new quantified variables, introduced 17 case distinctions, treesize of input 4102 treesize of output 2541 [2025-03-17 12:09:10,150 INFO L349 Elim1Store]: treesize reduction 192, result has 40.9 percent of original size [2025-03-17 12:09:10,150 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 9 new quantified variables, introduced 23 case distinctions, treesize of input 3642 treesize of output 2978 [2025-03-17 12:09:10,433 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-17 12:09:10,434 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 7 new quantified variables, introduced 15 case distinctions, treesize of input 2727 treesize of output 2779 [2025-03-17 12:09:11,065 INFO L349 Elim1Store]: treesize reduction 304, result has 42.1 percent of original size [2025-03-17 12:09:11,066 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 21 case distinctions, treesize of input 2005 treesize of output 2166 [2025-03-17 12:09:11,313 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-17 12:09:11,314 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 2188 treesize of output 2305 [2025-03-17 12:09:14,316 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 4