./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/array-examples/standard_strcpy_ground-2.i --full-output --architecture 32bit -------------------------------------------------------------------------------- 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/array-examples/standard_strcpy_ground-2.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 1dc3813f801c08c10697b6f3aeaa3afb846521f0bb73d940036cc656d8340c66 --- Real Ultimate output --- This is Ultimate 0.3.0-?-8fc3dc6-m [2025-03-17 11:44:59,377 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-17 11:44:59,440 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2025-03-17 11:44:59,444 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-17 11:44:59,447 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-17 11:44:59,469 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-17 11:44:59,470 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-17 11:44:59,470 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-17 11:44:59,471 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-17 11:44:59,471 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-17 11:44:59,471 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-17 11:44:59,472 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-17 11:44:59,472 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-17 11:44:59,472 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-17 11:44:59,472 INFO L153 SettingsManager]: * Use SBE=true [2025-03-17 11:44:59,473 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-17 11:44:59,473 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-17 11:44:59,473 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-17 11:44:59,473 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-17 11:44:59,473 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-17 11:44:59,473 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2025-03-17 11:44:59,473 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2025-03-17 11:44:59,473 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2025-03-17 11:44:59,473 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-17 11:44:59,473 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-03-17 11:44:59,473 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-03-17 11:44:59,474 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-17 11:44:59,474 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-17 11:44:59,474 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-17 11:44:59,474 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-17 11:44:59,474 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-17 11:44:59,474 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-17 11:44:59,474 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-17 11:44:59,474 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 11:44:59,474 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-17 11:44:59,475 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-17 11:44:59,475 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-17 11:44:59,475 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-17 11:44:59,475 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-17 11:44:59,475 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-17 11:44:59,475 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-17 11:44:59,475 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-17 11:44:59,475 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 1dc3813f801c08c10697b6f3aeaa3afb846521f0bb73d940036cc656d8340c66 [2025-03-17 11:44:59,704 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-17 11:44:59,711 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-17 11:44:59,714 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-17 11:44:59,715 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-17 11:44:59,715 INFO L274 PluginConnector]: CDTParser initialized [2025-03-17 11:44:59,717 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/array-examples/standard_strcpy_ground-2.i [2025-03-17 11:45:00,830 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/21f3a0306/657d3e5a6c1349979e3847f0f02ef4d0/FLAG84eb43cf6 [2025-03-17 11:45:01,037 INFO L384 CDTParser]: Found 1 translation units. [2025-03-17 11:45:01,038 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/array-examples/standard_strcpy_ground-2.i [2025-03-17 11:45:01,043 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/21f3a0306/657d3e5a6c1349979e3847f0f02ef4d0/FLAG84eb43cf6 [2025-03-17 11:45:01,391 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/21f3a0306/657d3e5a6c1349979e3847f0f02ef4d0 [2025-03-17 11:45:01,392 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-17 11:45:01,393 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-17 11:45:01,394 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-17 11:45:01,394 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-17 11:45:01,397 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-17 11:45:01,398 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 11:45:01" (1/1) ... [2025-03-17 11:45:01,399 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5b3dee82 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 11:45:01, skipping insertion in model container [2025-03-17 11:45:01,399 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 11:45:01" (1/1) ... [2025-03-17 11:45:01,410 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-17 11:45:01,524 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 11:45:01,533 INFO L200 MainTranslator]: Completed pre-run [2025-03-17 11:45:01,549 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 11:45:01,561 INFO L204 MainTranslator]: Completed translation [2025-03-17 11:45:01,562 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 11:45:01 WrapperNode [2025-03-17 11:45:01,562 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-17 11:45:01,564 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-17 11:45:01,564 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-17 11:45:01,564 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-17 11:45:01,569 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 11:45:01" (1/1) ... [2025-03-17 11:45:01,575 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 11:45:01" (1/1) ... [2025-03-17 11:45:01,588 INFO L138 Inliner]: procedures = 16, calls = 20, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 59 [2025-03-17 11:45:01,589 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-17 11:45:01,589 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-17 11:45:01,590 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-17 11:45:01,590 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-17 11:45:01,595 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 11:45:01" (1/1) ... [2025-03-17 11:45:01,596 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 11:45:01" (1/1) ... [2025-03-17 11:45:01,597 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 11:45:01" (1/1) ... [2025-03-17 11:45:01,609 INFO L175 MemorySlicer]: Split 8 memory accesses to 3 slices as follows [2, 2, 4]. 50 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0, 0]. The 2 writes are split as follows [0, 1, 1]. [2025-03-17 11:45:01,610 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 11:45:01" (1/1) ... [2025-03-17 11:45:01,610 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 11:45:01" (1/1) ... [2025-03-17 11:45:01,613 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 11:45:01" (1/1) ... [2025-03-17 11:45:01,614 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 11:45:01" (1/1) ... [2025-03-17 11:45:01,615 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 11:45:01" (1/1) ... [2025-03-17 11:45:01,615 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 11:45:01" (1/1) ... [2025-03-17 11:45:01,616 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-17 11:45:01,617 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-17 11:45:01,617 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-17 11:45:01,617 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-17 11:45:01,618 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 11:45:01" (1/1) ... [2025-03-17 11:45:01,622 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 11:45:01,634 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 11:45:01,646 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 11:45:01,649 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 11:45:01,670 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-17 11:45:01,670 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-17 11:45:01,671 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-03-17 11:45:01,671 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-03-17 11:45:01,671 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-03-17 11:45:01,671 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-03-17 11:45:01,671 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-03-17 11:45:01,671 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2025-03-17 11:45:01,671 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-17 11:45:01,671 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-17 11:45:01,671 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-03-17 11:45:01,671 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-03-17 11:45:01,672 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2025-03-17 11:45:01,672 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-03-17 11:45:01,727 INFO L256 CfgBuilder]: Building ICFG [2025-03-17 11:45:01,729 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-17 11:45:01,879 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L17: call ULTIMATE.dealloc(main_~#src~0#1.base, main_~#src~0#1.offset);havoc main_~#src~0#1.base, main_~#src~0#1.offset;call ULTIMATE.dealloc(main_~#dst~0#1.base, main_~#dst~0#1.offset);havoc main_~#dst~0#1.base, main_~#dst~0#1.offset; [2025-03-17 11:45:01,885 INFO L? ?]: Removed 37 outVars from TransFormulas that were not future-live. [2025-03-17 11:45:01,886 INFO L307 CfgBuilder]: Performing block encoding [2025-03-17 11:45:01,893 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-17 11:45:01,893 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-17 11:45:01,893 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 11:45:01 BoogieIcfgContainer [2025-03-17 11:45:01,893 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-17 11:45:01,898 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-17 11:45:01,899 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-17 11:45:01,902 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-17 11:45:01,902 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 17.03 11:45:01" (1/3) ... [2025-03-17 11:45:01,902 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@589b481c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 11:45:01, skipping insertion in model container [2025-03-17 11:45:01,902 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 11:45:01" (2/3) ... [2025-03-17 11:45:01,903 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@589b481c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 11:45:01, skipping insertion in model container [2025-03-17 11:45:01,903 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 11:45:01" (3/3) ... [2025-03-17 11:45:01,904 INFO L128 eAbstractionObserver]: Analyzing ICFG standard_strcpy_ground-2.i [2025-03-17 11:45:01,913 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-17 11:45:01,914 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG standard_strcpy_ground-2.i that has 1 procedures, 36 locations, 1 initial locations, 3 loop locations, and 14 error locations. [2025-03-17 11:45:01,941 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-17 11:45:01,951 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;@7ac5446e, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-17 11:45:01,951 INFO L334 AbstractCegarLoop]: Starting to check reachability of 14 error locations. [2025-03-17 11:45:01,954 INFO L276 IsEmpty]: Start isEmpty. Operand has 36 states, 21 states have (on average 1.9523809523809523) internal successors, (41), 35 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:45:01,957 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2025-03-17 11:45:01,958 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 11:45:01,958 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1] [2025-03-17 11:45:01,958 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 11 more)] === [2025-03-17 11:45:01,961 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:45:01,962 INFO L85 PathProgramCache]: Analyzing trace with hash 70309, now seen corresponding path program 1 times [2025-03-17 11:45:01,966 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:45:01,967 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [292844712] [2025-03-17 11:45:01,967 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:45:01,967 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:45:02,015 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-03-17 11:45:02,028 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-03-17 11:45:02,028 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:45:02,028 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:45:02,112 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 11:45:02,115 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:45:02,115 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [292844712] [2025-03-17 11:45:02,115 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [292844712] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:45:02,116 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:45:02,116 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 11:45:02,117 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [463262107] [2025-03-17 11:45:02,117 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:45:02,120 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 11:45:02,120 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:45:02,137 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 11:45:02,138 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 11:45:02,140 INFO L87 Difference]: Start difference. First operand has 36 states, 21 states have (on average 1.9523809523809523) internal successors, (41), 35 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 3 states have (on average 1.0) internal successors, (3), 2 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:45:02,200 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 11:45:02,201 INFO L93 Difference]: Finished difference Result 61 states and 69 transitions. [2025-03-17 11:45:02,202 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 11:45:02,203 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 1.0) internal successors, (3), 2 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 3 [2025-03-17 11:45:02,204 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 11:45:02,207 INFO L225 Difference]: With dead ends: 61 [2025-03-17 11:45:02,207 INFO L226 Difference]: Without dead ends: 59 [2025-03-17 11:45:02,209 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 11:45:02,211 INFO L435 NwaCegarLoop]: 24 mSDtfsCounter, 25 mSDsluCounter, 21 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 45 SdHoareTripleChecker+Invalid, 28 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 27 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 11:45:02,211 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [25 Valid, 45 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 11:45:02,220 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2025-03-17 11:45:02,228 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 34. [2025-03-17 11:45:02,229 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34 states, 20 states have (on average 1.8) internal successors, (36), 33 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:45:02,231 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 36 transitions. [2025-03-17 11:45:02,232 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 36 transitions. Word has length 3 [2025-03-17 11:45:02,232 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 11:45:02,232 INFO L471 AbstractCegarLoop]: Abstraction has 34 states and 36 transitions. [2025-03-17 11:45:02,232 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 1.0) internal successors, (3), 2 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:45:02,232 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 36 transitions. [2025-03-17 11:45:02,232 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2025-03-17 11:45:02,233 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 11:45:02,233 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1] [2025-03-17 11:45:02,233 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-17 11:45:02,233 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 11 more)] === [2025-03-17 11:45:02,233 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:45:02,233 INFO L85 PathProgramCache]: Analyzing trace with hash 70470, now seen corresponding path program 1 times [2025-03-17 11:45:02,234 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:45:02,234 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [543768885] [2025-03-17 11:45:02,234 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:45:02,234 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:45:02,239 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-03-17 11:45:02,246 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-03-17 11:45:02,247 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:45:02,247 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:45:02,308 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 11:45:02,308 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:45:02,309 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [543768885] [2025-03-17 11:45:02,309 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [543768885] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:45:02,309 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:45:02,309 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-03-17 11:45:02,309 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2088711989] [2025-03-17 11:45:02,309 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:45:02,310 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 11:45:02,310 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:45:02,310 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 11:45:02,310 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 11:45:02,311 INFO L87 Difference]: Start difference. First operand 34 states and 36 transitions. Second operand has 3 states, 2 states have (on average 1.5) internal successors, (3), 2 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:45:02,345 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 11:45:02,345 INFO L93 Difference]: Finished difference Result 30 states and 32 transitions. [2025-03-17 11:45:02,346 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 11:45:02,346 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 2 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 3 [2025-03-17 11:45:02,346 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 11:45:02,346 INFO L225 Difference]: With dead ends: 30 [2025-03-17 11:45:02,347 INFO L226 Difference]: Without dead ends: 30 [2025-03-17 11:45:02,347 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 11:45:02,349 INFO L435 NwaCegarLoop]: 18 mSDtfsCounter, 23 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 18 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 11:45:02,349 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [23 Valid, 18 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 11:45:02,349 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2025-03-17 11:45:02,352 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 30. [2025-03-17 11:45:02,353 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 20 states have (on average 1.6) internal successors, (32), 29 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:45:02,354 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 32 transitions. [2025-03-17 11:45:02,354 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 32 transitions. Word has length 3 [2025-03-17 11:45:02,354 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 11:45:02,354 INFO L471 AbstractCegarLoop]: Abstraction has 30 states and 32 transitions. [2025-03-17 11:45:02,354 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 2 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:45:02,355 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 32 transitions. [2025-03-17 11:45:02,355 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2025-03-17 11:45:02,355 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 11:45:02,355 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1] [2025-03-17 11:45:02,355 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-17 11:45:02,355 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 11 more)] === [2025-03-17 11:45:02,356 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:45:02,356 INFO L85 PathProgramCache]: Analyzing trace with hash 70471, now seen corresponding path program 1 times [2025-03-17 11:45:02,356 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:45:02,356 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [846162792] [2025-03-17 11:45:02,356 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:45:02,356 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:45:02,361 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-03-17 11:45:02,368 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-03-17 11:45:02,370 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:45:02,370 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:45:02,446 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 11:45:02,446 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:45:02,446 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [846162792] [2025-03-17 11:45:02,446 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [846162792] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:45:02,447 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:45:02,447 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-03-17 11:45:02,448 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1350684627] [2025-03-17 11:45:02,448 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:45:02,448 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 11:45:02,448 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:45:02,448 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 11:45:02,449 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 11:45:02,450 INFO L87 Difference]: Start difference. First operand 30 states and 32 transitions. Second operand has 3 states, 2 states have (on average 1.5) internal successors, (3), 2 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:45:02,482 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 11:45:02,482 INFO L93 Difference]: Finished difference Result 32 states and 34 transitions. [2025-03-17 11:45:02,483 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 11:45:02,483 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 2 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 3 [2025-03-17 11:45:02,483 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 11:45:02,483 INFO L225 Difference]: With dead ends: 32 [2025-03-17 11:45:02,483 INFO L226 Difference]: Without dead ends: 32 [2025-03-17 11:45:02,484 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 11:45:02,484 INFO L435 NwaCegarLoop]: 28 mSDtfsCounter, 1 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 40 SdHoareTripleChecker+Invalid, 21 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 11:45:02,484 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 40 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 11:45:02,485 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2025-03-17 11:45:02,486 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 31. [2025-03-17 11:45:02,486 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31 states, 21 states have (on average 1.5714285714285714) internal successors, (33), 30 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:45:02,487 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 33 transitions. [2025-03-17 11:45:02,487 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 33 transitions. Word has length 3 [2025-03-17 11:45:02,487 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 11:45:02,487 INFO L471 AbstractCegarLoop]: Abstraction has 31 states and 33 transitions. [2025-03-17 11:45:02,487 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 2 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:45:02,487 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 33 transitions. [2025-03-17 11:45:02,487 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2025-03-17 11:45:02,487 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 11:45:02,487 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2025-03-17 11:45:02,487 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-17 11:45:02,488 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 11 more)] === [2025-03-17 11:45:02,488 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:45:02,488 INFO L85 PathProgramCache]: Analyzing trace with hash 2099377693, now seen corresponding path program 1 times [2025-03-17 11:45:02,488 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:45:02,488 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [685480536] [2025-03-17 11:45:02,488 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:45:02,489 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:45:02,495 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-03-17 11:45:02,500 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-03-17 11:45:02,500 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:45:02,500 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:45:02,561 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 11:45:02,562 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:45:02,562 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [685480536] [2025-03-17 11:45:02,562 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [685480536] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 11:45:02,562 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1274046382] [2025-03-17 11:45:02,562 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:45:02,562 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 11:45:02,563 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 11:45:02,564 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 11:45:02,570 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 11:45:02,603 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-03-17 11:45:02,614 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-03-17 11:45:02,614 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:45:02,614 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:45:02,617 INFO L256 TraceCheckSpWp]: Trace formula consists of 59 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-17 11:45:02,619 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 11:45:02,646 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 11:45:02,646 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 11:45:02,662 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 11:45:02,663 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1274046382] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 11:45:02,663 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 11:45:02,663 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 6 [2025-03-17 11:45:02,663 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1365836103] [2025-03-17 11:45:02,663 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 11:45:02,664 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-17 11:45:02,664 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:45:02,664 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-17 11:45:02,664 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2025-03-17 11:45:02,664 INFO L87 Difference]: Start difference. First operand 31 states and 33 transitions. Second operand has 7 states, 7 states have (on average 2.142857142857143) internal successors, (15), 6 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:45:02,743 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 11:45:02,745 INFO L93 Difference]: Finished difference Result 115 states and 139 transitions. [2025-03-17 11:45:02,745 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-17 11:45:02,745 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), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 6 [2025-03-17 11:45:02,746 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 11:45:02,747 INFO L225 Difference]: With dead ends: 115 [2025-03-17 11:45:02,748 INFO L226 Difference]: Without dead ends: 115 [2025-03-17 11:45:02,748 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2025-03-17 11:45:02,749 INFO L435 NwaCegarLoop]: 18 mSDtfsCounter, 118 mSDsluCounter, 77 mSDsCounter, 0 mSdLazyCounter, 61 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 118 SdHoareTripleChecker+Valid, 95 SdHoareTripleChecker+Invalid, 69 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 61 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 11:45:02,750 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [118 Valid, 95 Invalid, 69 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 61 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 11:45:02,751 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states. [2025-03-17 11:45:02,755 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 39. [2025-03-17 11:45:02,757 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 39 states, 29 states have (on average 1.4827586206896552) internal successors, (43), 38 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:45:02,757 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 43 transitions. [2025-03-17 11:45:02,757 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 43 transitions. Word has length 6 [2025-03-17 11:45:02,758 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 11:45:02,758 INFO L471 AbstractCegarLoop]: Abstraction has 39 states and 43 transitions. [2025-03-17 11:45:02,758 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), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:45:02,758 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 43 transitions. [2025-03-17 11:45:02,758 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2025-03-17 11:45:02,758 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 11:45:02,758 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1] [2025-03-17 11:45:02,765 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-03-17 11:45:02,958 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 11:45:02,959 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 11 more)] === [2025-03-17 11:45:02,959 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:45:02,959 INFO L85 PathProgramCache]: Analyzing trace with hash 2099377854, now seen corresponding path program 1 times [2025-03-17 11:45:02,959 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:45:02,959 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1791914909] [2025-03-17 11:45:02,959 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:45:02,959 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:45:02,966 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-03-17 11:45:02,977 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-03-17 11:45:02,979 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:45:02,979 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:45:03,090 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 11:45:03,090 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:45:03,090 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1791914909] [2025-03-17 11:45:03,090 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1791914909] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 11:45:03,091 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [772828655] [2025-03-17 11:45:03,091 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:45:03,091 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 11:45:03,091 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 11:45:03,093 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 11:45:03,094 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 11:45:03,119 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-03-17 11:45:03,127 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-03-17 11:45:03,127 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:45:03,127 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:45:03,128 INFO L256 TraceCheckSpWp]: Trace formula consists of 59 conjuncts, 11 conjuncts are in the unsatisfiable core [2025-03-17 11:45:03,129 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 11:45:03,169 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 13 treesize of output 1 [2025-03-17 11:45:03,175 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-17 11:45:03,177 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 5 treesize of output 3 [2025-03-17 11:45:03,222 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 11:45:03,223 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 11:45:03,269 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 11:45:03,270 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [772828655] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 11:45:03,270 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 11:45:03,270 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [2, 2, 2] total 5 [2025-03-17 11:45:03,270 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [869635290] [2025-03-17 11:45:03,270 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 11:45:03,270 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-17 11:45:03,270 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:45:03,271 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-17 11:45:03,271 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2025-03-17 11:45:03,271 INFO L87 Difference]: Start difference. First operand 39 states and 43 transitions. Second operand has 7 states, 6 states have (on average 2.5) internal successors, (15), 6 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:45:03,332 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 11:45:03,332 INFO L93 Difference]: Finished difference Result 39 states and 41 transitions. [2025-03-17 11:45:03,333 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-17 11:45:03,333 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 2.5) internal successors, (15), 6 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 6 [2025-03-17 11:45:03,333 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 11:45:03,333 INFO L225 Difference]: With dead ends: 39 [2025-03-17 11:45:03,333 INFO L226 Difference]: Without dead ends: 39 [2025-03-17 11:45:03,333 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=31, Unknown=0, NotChecked=0, Total=56 [2025-03-17 11:45:03,334 INFO L435 NwaCegarLoop]: 17 mSDtfsCounter, 21 mSDsluCounter, 25 mSDsCounter, 0 mSdLazyCounter, 64 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 42 SdHoareTripleChecker+Invalid, 68 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 64 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 11:45:03,334 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [21 Valid, 42 Invalid, 68 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 64 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 11:45:03,334 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2025-03-17 11:45:03,335 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 39. [2025-03-17 11:45:03,336 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 39 states, 30 states have (on average 1.3666666666666667) internal successors, (41), 38 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:45:03,336 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 41 transitions. [2025-03-17 11:45:03,336 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 41 transitions. Word has length 6 [2025-03-17 11:45:03,336 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 11:45:03,336 INFO L471 AbstractCegarLoop]: Abstraction has 39 states and 41 transitions. [2025-03-17 11:45:03,336 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 2.5) internal successors, (15), 6 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:45:03,336 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 41 transitions. [2025-03-17 11:45:03,336 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2025-03-17 11:45:03,336 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 11:45:03,336 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1] [2025-03-17 11:45:03,343 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 11:45:03,541 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 11:45:03,541 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 11 more)] === [2025-03-17 11:45:03,541 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:45:03,541 INFO L85 PathProgramCache]: Analyzing trace with hash -1435857946, now seen corresponding path program 2 times [2025-03-17 11:45:03,542 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:45:03,542 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1024429625] [2025-03-17 11:45:03,542 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-17 11:45:03,542 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:45:03,549 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 15 statements into 2 equivalence classes. [2025-03-17 11:45:03,553 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 3 of 15 statements. [2025-03-17 11:45:03,553 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-17 11:45:03,553 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:45:03,610 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2025-03-17 11:45:03,610 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:45:03,610 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1024429625] [2025-03-17 11:45:03,610 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1024429625] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:45:03,610 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:45:03,610 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 11:45:03,610 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [219530301] [2025-03-17 11:45:03,611 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:45:03,611 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-17 11:45:03,611 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:45:03,611 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 11:45:03,611 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-17 11:45:03,611 INFO L87 Difference]: Start difference. First operand 39 states and 41 transitions. Second operand has 4 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:45:03,648 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 11:45:03,648 INFO L93 Difference]: Finished difference Result 57 states and 63 transitions. [2025-03-17 11:45:03,649 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-17 11:45:03,650 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2025-03-17 11:45:03,650 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 11:45:03,650 INFO L225 Difference]: With dead ends: 57 [2025-03-17 11:45:03,650 INFO L226 Difference]: Without dead ends: 57 [2025-03-17 11:45:03,650 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-17 11:45:03,651 INFO L435 NwaCegarLoop]: 14 mSDtfsCounter, 42 mSDsluCounter, 13 mSDsCounter, 0 mSdLazyCounter, 36 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 42 SdHoareTripleChecker+Valid, 27 SdHoareTripleChecker+Invalid, 37 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 36 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 11:45:03,651 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [42 Valid, 27 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 36 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 11:45:03,651 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2025-03-17 11:45:03,652 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 40. [2025-03-17 11:45:03,652 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 40 states, 31 states have (on average 1.3548387096774193) internal successors, (42), 39 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:45:03,653 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 42 transitions. [2025-03-17 11:45:03,653 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 42 transitions. Word has length 15 [2025-03-17 11:45:03,653 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 11:45:03,653 INFO L471 AbstractCegarLoop]: Abstraction has 40 states and 42 transitions. [2025-03-17 11:45:03,653 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:45:03,653 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 42 transitions. [2025-03-17 11:45:03,653 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2025-03-17 11:45:03,653 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 11:45:03,653 INFO L218 NwaCegarLoop]: trace histogram [5, 4, 4, 1, 1] [2025-03-17 11:45:03,653 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-17 11:45:03,656 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 11 more)] === [2025-03-17 11:45:03,657 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:45:03,657 INFO L85 PathProgramCache]: Analyzing trace with hash -1435857785, now seen corresponding path program 2 times [2025-03-17 11:45:03,657 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:45:03,657 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [865155934] [2025-03-17 11:45:03,658 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-17 11:45:03,658 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:45:03,679 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 15 statements into 2 equivalence classes. [2025-03-17 11:45:03,694 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 15 of 15 statements. [2025-03-17 11:45:03,694 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-17 11:45:03,695 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:45:03,846 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 26 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 11:45:03,847 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:45:03,847 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [865155934] [2025-03-17 11:45:03,847 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [865155934] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 11:45:03,847 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [794089355] [2025-03-17 11:45:03,847 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-17 11:45:03,847 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 11:45:03,847 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 11:45:03,849 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 11:45:03,851 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 11:45:03,882 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 15 statements into 2 equivalence classes. [2025-03-17 11:45:03,894 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 15 of 15 statements. [2025-03-17 11:45:03,894 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-17 11:45:03,894 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:45:03,895 INFO L256 TraceCheckSpWp]: Trace formula consists of 98 conjuncts, 19 conjuncts are in the unsatisfiable core [2025-03-17 11:45:03,896 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 11:45:03,916 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 13 treesize of output 1 [2025-03-17 11:45:03,920 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-17 11:45:03,921 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 5 treesize of output 3 [2025-03-17 11:45:04,039 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 26 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 11:45:04,039 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 11:45:04,164 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 26 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 11:45:04,164 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [794089355] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 11:45:04,164 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 11:45:04,164 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 14 [2025-03-17 11:45:04,165 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1310273549] [2025-03-17 11:45:04,165 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 11:45:04,165 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2025-03-17 11:45:04,165 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:45:04,165 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2025-03-17 11:45:04,166 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=162, Unknown=0, NotChecked=0, Total=240 [2025-03-17 11:45:04,166 INFO L87 Difference]: Start difference. First operand 40 states and 42 transitions. Second operand has 16 states, 15 states have (on average 2.8) internal successors, (42), 15 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:45:04,348 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 11:45:04,348 INFO L93 Difference]: Finished difference Result 58 states and 65 transitions. [2025-03-17 11:45:04,348 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-17 11:45:04,348 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 15 states have (on average 2.8) internal successors, (42), 15 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2025-03-17 11:45:04,349 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 11:45:04,349 INFO L225 Difference]: With dead ends: 58 [2025-03-17 11:45:04,349 INFO L226 Difference]: Without dead ends: 58 [2025-03-17 11:45:04,349 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 84 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=142, Invalid=238, Unknown=0, NotChecked=0, Total=380 [2025-03-17 11:45:04,350 INFO L435 NwaCegarLoop]: 16 mSDtfsCounter, 25 mSDsluCounter, 61 mSDsCounter, 0 mSdLazyCounter, 195 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 77 SdHoareTripleChecker+Invalid, 199 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 195 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 11:45:04,350 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [25 Valid, 77 Invalid, 199 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 195 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 11:45:04,350 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2025-03-17 11:45:04,353 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 58. [2025-03-17 11:45:04,353 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 58 states, 49 states have (on average 1.3265306122448979) internal successors, (65), 57 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:45:04,354 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 65 transitions. [2025-03-17 11:45:04,354 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 65 transitions. Word has length 15 [2025-03-17 11:45:04,354 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 11:45:04,354 INFO L471 AbstractCegarLoop]: Abstraction has 58 states and 65 transitions. [2025-03-17 11:45:04,354 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 15 states have (on average 2.8) internal successors, (42), 15 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:45:04,354 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 65 transitions. [2025-03-17 11:45:04,358 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2025-03-17 11:45:04,358 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 11:45:04,358 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 1, 1, 1, 1, 1, 1] [2025-03-17 11:45:04,364 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 11:45:04,562 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 11:45:04,562 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 11 more)] === [2025-03-17 11:45:04,563 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:45:04,563 INFO L85 PathProgramCache]: Analyzing trace with hash 1448642912, now seen corresponding path program 1 times [2025-03-17 11:45:04,563 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:45:04,563 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [313952011] [2025-03-17 11:45:04,563 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:45:04,563 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:45:04,569 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 21 statements into 1 equivalence classes. [2025-03-17 11:45:04,573 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 21 of 21 statements. [2025-03-17 11:45:04,573 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:45:04,574 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:45:04,599 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2025-03-17 11:45:04,599 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:45:04,600 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [313952011] [2025-03-17 11:45:04,600 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [313952011] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:45:04,600 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:45:04,600 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-03-17 11:45:04,600 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1939153308] [2025-03-17 11:45:04,600 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:45:04,600 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 11:45:04,600 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:45:04,601 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 11:45:04,601 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 11:45:04,601 INFO L87 Difference]: Start difference. First operand 58 states and 65 transitions. Second operand has 3 states, 2 states have (on average 4.5) internal successors, (9), 2 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:45:04,612 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 11:45:04,612 INFO L93 Difference]: Finished difference Result 56 states and 63 transitions. [2025-03-17 11:45:04,613 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 11:45:04,613 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 4.5) internal successors, (9), 2 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 21 [2025-03-17 11:45:04,613 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 11:45:04,613 INFO L225 Difference]: With dead ends: 56 [2025-03-17 11:45:04,613 INFO L226 Difference]: Without dead ends: 56 [2025-03-17 11:45:04,614 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 11:45:04,614 INFO L435 NwaCegarLoop]: 19 mSDtfsCounter, 16 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 19 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 11:45:04,614 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 19 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 11:45:04,615 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2025-03-17 11:45:04,616 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 56. [2025-03-17 11:45:04,616 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 56 states, 49 states have (on average 1.2857142857142858) internal successors, (63), 55 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:45:04,617 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 63 transitions. [2025-03-17 11:45:04,617 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 63 transitions. Word has length 21 [2025-03-17 11:45:04,617 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 11:45:04,617 INFO L471 AbstractCegarLoop]: Abstraction has 56 states and 63 transitions. [2025-03-17 11:45:04,617 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 4.5) internal successors, (9), 2 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:45:04,617 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 63 transitions. [2025-03-17 11:45:04,617 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2025-03-17 11:45:04,617 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 11:45:04,618 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 1, 1, 1, 1, 1, 1] [2025-03-17 11:45:04,618 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-17 11:45:04,618 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 11 more)] === [2025-03-17 11:45:04,618 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:45:04,618 INFO L85 PathProgramCache]: Analyzing trace with hash 1448642913, now seen corresponding path program 1 times [2025-03-17 11:45:04,618 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:45:04,618 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1855929114] [2025-03-17 11:45:04,618 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:45:04,618 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:45:04,624 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 21 statements into 1 equivalence classes. [2025-03-17 11:45:04,628 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 21 of 21 statements. [2025-03-17 11:45:04,628 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:45:04,628 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:45:04,708 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 0 proven. 35 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 11:45:04,708 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:45:04,708 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1855929114] [2025-03-17 11:45:04,708 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1855929114] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 11:45:04,708 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2142843175] [2025-03-17 11:45:04,709 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:45:04,709 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 11:45:04,709 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 11:45:04,711 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 11:45:04,712 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 11:45:04,752 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 21 statements into 1 equivalence classes. [2025-03-17 11:45:04,766 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 21 of 21 statements. [2025-03-17 11:45:04,766 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:45:04,766 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:45:04,768 INFO L256 TraceCheckSpWp]: Trace formula consists of 124 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-03-17 11:45:04,769 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 11:45:04,800 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 0 proven. 35 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 11:45:04,801 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 11:45:04,876 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 0 proven. 35 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 11:45:04,877 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2142843175] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 11:45:04,877 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 11:45:04,877 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 14 [2025-03-17 11:45:04,877 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1952531787] [2025-03-17 11:45:04,877 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 11:45:04,877 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-03-17 11:45:04,878 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:45:04,878 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-03-17 11:45:04,879 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=105, Invalid=105, Unknown=0, NotChecked=0, Total=210 [2025-03-17 11:45:04,879 INFO L87 Difference]: Start difference. First operand 56 states and 63 transitions. Second operand has 15 states, 15 states have (on average 2.8) internal successors, (42), 14 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:45:05,032 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 11:45:05,032 INFO L93 Difference]: Finished difference Result 264 states and 314 transitions. [2025-03-17 11:45:05,032 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-03-17 11:45:05,033 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 2.8) internal successors, (42), 14 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 21 [2025-03-17 11:45:05,033 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 11:45:05,034 INFO L225 Difference]: With dead ends: 264 [2025-03-17 11:45:05,035 INFO L226 Difference]: Without dead ends: 264 [2025-03-17 11:45:05,035 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=105, Invalid=105, Unknown=0, NotChecked=0, Total=210 [2025-03-17 11:45:05,036 INFO L435 NwaCegarLoop]: 16 mSDtfsCounter, 429 mSDsluCounter, 172 mSDsCounter, 0 mSdLazyCounter, 126 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 429 SdHoareTripleChecker+Valid, 188 SdHoareTripleChecker+Invalid, 153 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 126 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 11:45:05,036 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [429 Valid, 188 Invalid, 153 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 126 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 11:45:05,037 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 264 states. [2025-03-17 11:45:05,041 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 264 to 61. [2025-03-17 11:45:05,042 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 61 states, 54 states have (on average 1.1851851851851851) internal successors, (64), 60 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:45:05,042 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 64 transitions. [2025-03-17 11:45:05,042 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 64 transitions. Word has length 21 [2025-03-17 11:45:05,042 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 11:45:05,042 INFO L471 AbstractCegarLoop]: Abstraction has 61 states and 64 transitions. [2025-03-17 11:45:05,042 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 2.8) internal successors, (42), 14 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:45:05,045 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 64 transitions. [2025-03-17 11:45:05,045 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2025-03-17 11:45:05,046 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 11:45:05,046 INFO L218 NwaCegarLoop]: trace histogram [11, 10, 10, 1, 1] [2025-03-17 11:45:05,053 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 11:45:05,246 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 11:45:05,246 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 11 more)] === [2025-03-17 11:45:05,247 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:45:05,247 INFO L85 PathProgramCache]: Analyzing trace with hash -1953005977, now seen corresponding path program 3 times [2025-03-17 11:45:05,247 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:45:05,247 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [741153443] [2025-03-17 11:45:05,247 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-17 11:45:05,247 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:45:05,256 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 33 statements into 11 equivalence classes. [2025-03-17 11:45:05,260 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 6 of 33 statements. [2025-03-17 11:45:05,261 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-03-17 11:45:05,261 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:45:05,320 INFO L134 CoverageAnalysis]: Checked inductivity of 155 backedges. 19 proven. 10 refuted. 0 times theorem prover too weak. 126 trivial. 0 not checked. [2025-03-17 11:45:05,321 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:45:05,321 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [741153443] [2025-03-17 11:45:05,321 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [741153443] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 11:45:05,321 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [59366790] [2025-03-17 11:45:05,321 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-17 11:45:05,321 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 11:45:05,321 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 11:45:05,323 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 11:45:05,325 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 11:45:05,359 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 33 statements into 11 equivalence classes. [2025-03-17 11:45:05,366 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 6 of 33 statements. [2025-03-17 11:45:05,366 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-03-17 11:45:05,366 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:45:05,367 INFO L256 TraceCheckSpWp]: Trace formula consists of 59 conjuncts, 11 conjuncts are in the unsatisfiable core [2025-03-17 11:45:05,369 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 11:45:05,382 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 13 treesize of output 1 [2025-03-17 11:45:05,384 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-17 11:45:05,386 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 5 treesize of output 3 [2025-03-17 11:45:05,509 INFO L134 CoverageAnalysis]: Checked inductivity of 155 backedges. 29 proven. 0 refuted. 0 times theorem prover too weak. 126 trivial. 0 not checked. [2025-03-17 11:45:05,510 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 11:45:05,510 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [59366790] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:45:05,510 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-17 11:45:05,510 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [3] total 7 [2025-03-17 11:45:05,510 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [967457154] [2025-03-17 11:45:05,511 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:45:05,511 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-17 11:45:05,511 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:45:05,511 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-17 11:45:05,511 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2025-03-17 11:45:05,511 INFO L87 Difference]: Start difference. First operand 61 states and 64 transitions. Second operand has 6 states, 5 states have (on average 1.6) internal successors, (8), 5 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:45:05,563 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 11:45:05,563 INFO L93 Difference]: Finished difference Result 75 states and 81 transitions. [2025-03-17 11:45:05,564 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-17 11:45:05,564 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 1.6) internal successors, (8), 5 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 33 [2025-03-17 11:45:05,564 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 11:45:05,565 INFO L225 Difference]: With dead ends: 75 [2025-03-17 11:45:05,565 INFO L226 Difference]: Without dead ends: 75 [2025-03-17 11:45:05,565 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2025-03-17 11:45:05,565 INFO L435 NwaCegarLoop]: 20 mSDtfsCounter, 35 mSDsluCounter, 29 mSDsCounter, 0 mSdLazyCounter, 74 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 35 SdHoareTripleChecker+Valid, 49 SdHoareTripleChecker+Invalid, 78 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 74 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 11:45:05,565 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [35 Valid, 49 Invalid, 78 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 74 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 11:45:05,566 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2025-03-17 11:45:05,567 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 60. [2025-03-17 11:45:05,567 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 60 states, 54 states have (on average 1.1481481481481481) internal successors, (62), 59 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:45:05,571 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 62 transitions. [2025-03-17 11:45:05,571 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 62 transitions. Word has length 33 [2025-03-17 11:45:05,571 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 11:45:05,571 INFO L471 AbstractCegarLoop]: Abstraction has 60 states and 62 transitions. [2025-03-17 11:45:05,571 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 1.6) internal successors, (8), 5 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:45:05,571 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 62 transitions. [2025-03-17 11:45:05,572 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2025-03-17 11:45:05,572 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 11:45:05,572 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1] [2025-03-17 11:45:05,579 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 11:45:05,773 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2025-03-17 11:45:05,773 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 11 more)] === [2025-03-17 11:45:05,773 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:45:05,774 INFO L85 PathProgramCache]: Analyzing trace with hash 242173752, now seen corresponding path program 2 times [2025-03-17 11:45:05,774 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:45:05,774 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [334176649] [2025-03-17 11:45:05,774 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-17 11:45:05,774 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:45:05,781 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 42 statements into 2 equivalence classes. [2025-03-17 11:45:05,783 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 6 of 42 statements. [2025-03-17 11:45:05,783 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-17 11:45:05,783 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:45:05,818 INFO L134 CoverageAnalysis]: Checked inductivity of 210 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 210 trivial. 0 not checked. [2025-03-17 11:45:05,818 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:45:05,818 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [334176649] [2025-03-17 11:45:05,819 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [334176649] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:45:05,819 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:45:05,819 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 11:45:05,819 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2099416604] [2025-03-17 11:45:05,819 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:45:05,819 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-17 11:45:05,819 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:45:05,819 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 11:45:05,819 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-17 11:45:05,819 INFO L87 Difference]: Start difference. First operand 60 states and 62 transitions. Second operand has 4 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:45:05,849 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 11:45:05,850 INFO L93 Difference]: Finished difference Result 75 states and 80 transitions. [2025-03-17 11:45:05,850 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-17 11:45:05,850 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 42 [2025-03-17 11:45:05,850 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 11:45:05,850 INFO L225 Difference]: With dead ends: 75 [2025-03-17 11:45:05,850 INFO L226 Difference]: Without dead ends: 75 [2025-03-17 11:45:05,851 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-17 11:45:05,851 INFO L435 NwaCegarLoop]: 12 mSDtfsCounter, 34 mSDsluCounter, 11 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 34 SdHoareTripleChecker+Valid, 23 SdHoareTripleChecker+Invalid, 34 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 33 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 11:45:05,851 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [34 Valid, 23 Invalid, 34 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 11:45:05,852 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2025-03-17 11:45:05,853 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 63. [2025-03-17 11:45:05,853 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 63 states, 57 states have (on average 1.1578947368421053) internal successors, (66), 62 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:45:05,856 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 66 transitions. [2025-03-17 11:45:05,856 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 66 transitions. Word has length 42 [2025-03-17 11:45:05,856 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 11:45:05,856 INFO L471 AbstractCegarLoop]: Abstraction has 63 states and 66 transitions. [2025-03-17 11:45:05,857 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:45:05,857 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 66 transitions. [2025-03-17 11:45:05,859 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2025-03-17 11:45:05,859 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 11:45:05,859 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 11:45:05,859 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-17 11:45:05,859 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 11 more)] === [2025-03-17 11:45:05,859 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:45:05,860 INFO L85 PathProgramCache]: Analyzing trace with hash -1082523430, now seen corresponding path program 1 times [2025-03-17 11:45:05,860 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:45:05,860 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [339220809] [2025-03-17 11:45:05,860 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:45:05,860 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:45:05,870 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 43 statements into 1 equivalence classes. [2025-03-17 11:45:05,881 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 43 of 43 statements. [2025-03-17 11:45:05,881 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:45:05,881 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:45:05,948 INFO L134 CoverageAnalysis]: Checked inductivity of 210 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 210 trivial. 0 not checked. [2025-03-17 11:45:05,948 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:45:05,948 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [339220809] [2025-03-17 11:45:05,948 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [339220809] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:45:05,948 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:45:05,949 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-17 11:45:05,949 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1486939820] [2025-03-17 11:45:05,949 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:45:05,949 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-17 11:45:05,949 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:45:05,949 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 11:45:05,949 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-17 11:45:05,950 INFO L87 Difference]: Start difference. First operand 63 states and 66 transitions. Second operand has 4 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:45:05,978 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 11:45:05,978 INFO L93 Difference]: Finished difference Result 66 states and 69 transitions. [2025-03-17 11:45:05,979 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-17 11:45:05,979 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 43 [2025-03-17 11:45:05,979 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 11:45:05,979 INFO L225 Difference]: With dead ends: 66 [2025-03-17 11:45:05,979 INFO L226 Difference]: Without dead ends: 66 [2025-03-17 11:45:05,979 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-17 11:45:05,980 INFO L435 NwaCegarLoop]: 19 mSDtfsCounter, 5 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 41 SdHoareTripleChecker+Invalid, 39 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 38 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 11:45:05,980 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 41 Invalid, 39 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 11:45:05,980 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2025-03-17 11:45:05,982 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 65. [2025-03-17 11:45:05,982 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 65 states, 59 states have (on average 1.152542372881356) internal successors, (68), 64 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:45:05,982 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 68 transitions. [2025-03-17 11:45:05,982 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 68 transitions. Word has length 43 [2025-03-17 11:45:05,982 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 11:45:05,982 INFO L471 AbstractCegarLoop]: Abstraction has 65 states and 68 transitions. [2025-03-17 11:45:05,982 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:45:05,982 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 68 transitions. [2025-03-17 11:45:05,983 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2025-03-17 11:45:05,983 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 11:45:05,983 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 11:45:05,983 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-17 11:45:05,983 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 11 more)] === [2025-03-17 11:45:05,984 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:45:05,984 INFO L85 PathProgramCache]: Analyzing trace with hash -1082523944, now seen corresponding path program 1 times [2025-03-17 11:45:05,984 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:45:05,984 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1247090516] [2025-03-17 11:45:05,984 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:45:05,984 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:45:05,993 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 43 statements into 1 equivalence classes. [2025-03-17 11:45:06,003 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 43 of 43 statements. [2025-03-17 11:45:06,003 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:45:06,003 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:45:06,214 INFO L134 CoverageAnalysis]: Checked inductivity of 210 backedges. 0 proven. 210 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 11:45:06,214 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:45:06,215 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1247090516] [2025-03-17 11:45:06,215 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1247090516] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 11:45:06,215 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1973246257] [2025-03-17 11:45:06,215 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:45:06,215 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 11:45:06,215 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 11:45:06,217 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 11:45:06,218 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 11:45:06,260 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 43 statements into 1 equivalence classes. [2025-03-17 11:45:06,289 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 43 of 43 statements. [2025-03-17 11:45:06,289 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:45:06,289 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:45:06,290 INFO L256 TraceCheckSpWp]: Trace formula consists of 220 conjuncts, 14 conjuncts are in the unsatisfiable core [2025-03-17 11:45:06,292 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 11:45:06,345 INFO L134 CoverageAnalysis]: Checked inductivity of 210 backedges. 0 proven. 210 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 11:45:06,345 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 11:45:06,593 INFO L134 CoverageAnalysis]: Checked inductivity of 210 backedges. 0 proven. 210 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 11:45:06,593 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1973246257] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 11:45:06,593 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 11:45:06,593 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14, 14] total 28 [2025-03-17 11:45:06,593 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1347694535] [2025-03-17 11:45:06,594 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 11:45:06,594 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2025-03-17 11:45:06,594 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:45:06,594 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2025-03-17 11:45:06,595 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=406, Invalid=406, Unknown=0, NotChecked=0, Total=812 [2025-03-17 11:45:06,595 INFO L87 Difference]: Start difference. First operand 65 states and 68 transitions. Second operand has 29 states, 29 states have (on average 2.9310344827586206) internal successors, (85), 28 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:45:06,927 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 11:45:06,928 INFO L93 Difference]: Finished difference Result 533 states and 636 transitions. [2025-03-17 11:45:06,928 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2025-03-17 11:45:06,928 INFO L78 Accepts]: Start accepts. Automaton has has 29 states, 29 states have (on average 2.9310344827586206) internal successors, (85), 28 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 43 [2025-03-17 11:45:06,928 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 11:45:06,930 INFO L225 Difference]: With dead ends: 533 [2025-03-17 11:45:06,930 INFO L226 Difference]: Without dead ends: 533 [2025-03-17 11:45:06,930 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 98 GetRequests, 71 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 48 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=406, Invalid=406, Unknown=0, NotChecked=0, Total=812 [2025-03-17 11:45:06,930 INFO L435 NwaCegarLoop]: 16 mSDtfsCounter, 1490 mSDsluCounter, 342 mSDsCounter, 0 mSdLazyCounter, 229 mSolverCounterSat, 92 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1490 SdHoareTripleChecker+Valid, 358 SdHoareTripleChecker+Invalid, 321 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 92 IncrementalHoareTripleChecker+Valid, 229 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-17 11:45:06,930 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1490 Valid, 358 Invalid, 321 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [92 Valid, 229 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-17 11:45:06,931 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 533 states. [2025-03-17 11:45:06,937 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 533 to 107. [2025-03-17 11:45:06,940 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 107 states, 101 states have (on average 1.0891089108910892) internal successors, (110), 106 states have internal predecessors, (110), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:45:06,941 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 110 transitions. [2025-03-17 11:45:06,941 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 110 transitions. Word has length 43 [2025-03-17 11:45:06,941 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 11:45:06,941 INFO L471 AbstractCegarLoop]: Abstraction has 107 states and 110 transitions. [2025-03-17 11:45:06,941 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 29 states have (on average 2.9310344827586206) internal successors, (85), 28 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:45:06,941 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 110 transitions. [2025-03-17 11:45:06,942 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2025-03-17 11:45:06,944 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 11:45:06,945 INFO L218 NwaCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 11:45:06,951 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2025-03-17 11:45:07,145 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 11:45:07,145 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 11 more)] === [2025-03-17 11:45:07,146 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:45:07,146 INFO L85 PathProgramCache]: Analyzing trace with hash 626938680, now seen corresponding path program 2 times [2025-03-17 11:45:07,146 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:45:07,146 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [805359503] [2025-03-17 11:45:07,146 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-17 11:45:07,146 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:45:07,157 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 85 statements into 2 equivalence classes. [2025-03-17 11:45:07,162 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 7 of 85 statements. [2025-03-17 11:45:07,162 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-17 11:45:07,162 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:45:07,222 INFO L134 CoverageAnalysis]: Checked inductivity of 1001 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1001 trivial. 0 not checked. [2025-03-17 11:45:07,223 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:45:07,223 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [805359503] [2025-03-17 11:45:07,223 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [805359503] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:45:07,223 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:45:07,223 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 11:45:07,223 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1080737831] [2025-03-17 11:45:07,223 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:45:07,223 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-17 11:45:07,223 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:45:07,223 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 11:45:07,223 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-17 11:45:07,224 INFO L87 Difference]: Start difference. First operand 107 states and 110 transitions. Second operand has 4 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:45:07,242 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 11:45:07,242 INFO L93 Difference]: Finished difference Result 106 states and 109 transitions. [2025-03-17 11:45:07,242 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-17 11:45:07,242 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 85 [2025-03-17 11:45:07,243 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 11:45:07,243 INFO L225 Difference]: With dead ends: 106 [2025-03-17 11:45:07,244 INFO L226 Difference]: Without dead ends: 103 [2025-03-17 11:45:07,244 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-17 11:45:07,244 INFO L435 NwaCegarLoop]: 15 mSDtfsCounter, 13 mSDsluCounter, 14 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 29 SdHoareTripleChecker+Invalid, 27 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 27 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 11:45:07,244 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 29 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 11:45:07,245 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2025-03-17 11:45:07,246 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 103. [2025-03-17 11:45:07,246 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 103 states, 98 states have (on average 1.0714285714285714) internal successors, (105), 102 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:45:07,247 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 105 transitions. [2025-03-17 11:45:07,247 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 105 transitions. Word has length 85 [2025-03-17 11:45:07,247 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 11:45:07,247 INFO L471 AbstractCegarLoop]: Abstraction has 103 states and 105 transitions. [2025-03-17 11:45:07,247 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:45:07,247 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 105 transitions. [2025-03-17 11:45:07,248 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2025-03-17 11:45:07,248 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 11:45:07,248 INFO L218 NwaCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 11:45:07,248 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-17 11:45:07,248 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 11 more)] === [2025-03-17 11:45:07,248 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:45:07,248 INFO L85 PathProgramCache]: Analyzing trace with hash -2040493023, now seen corresponding path program 1 times [2025-03-17 11:45:07,248 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:45:07,248 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1782067069] [2025-03-17 11:45:07,249 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:45:07,249 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:45:07,258 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 86 statements into 1 equivalence classes. [2025-03-17 11:45:07,273 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 86 of 86 statements. [2025-03-17 11:45:07,274 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:45:07,274 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:45:07,891 INFO L134 CoverageAnalysis]: Checked inductivity of 1002 backedges. 0 proven. 1001 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-17 11:45:07,891 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:45:07,892 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1782067069] [2025-03-17 11:45:07,892 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1782067069] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 11:45:07,892 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1298477505] [2025-03-17 11:45:07,892 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:45:07,892 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 11:45:07,892 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 11:45:07,894 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 11:45:07,896 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 11:45:07,950 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 86 statements into 1 equivalence classes. [2025-03-17 11:45:07,990 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 86 of 86 statements. [2025-03-17 11:45:07,990 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:45:07,990 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:45:07,992 INFO L256 TraceCheckSpWp]: Trace formula consists of 407 conjuncts, 28 conjuncts are in the unsatisfiable core [2025-03-17 11:45:07,994 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 11:45:08,080 INFO L134 CoverageAnalysis]: Checked inductivity of 1002 backedges. 0 proven. 1001 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-17 11:45:08,080 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 11:45:08,894 INFO L134 CoverageAnalysis]: Checked inductivity of 1002 backedges. 0 proven. 1001 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-17 11:45:08,895 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1298477505] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 11:45:08,895 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 11:45:08,895 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 28, 28] total 56 [2025-03-17 11:45:08,895 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1109689129] [2025-03-17 11:45:08,895 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 11:45:08,895 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 57 states [2025-03-17 11:45:08,895 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:45:08,896 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 57 interpolants. [2025-03-17 11:45:08,897 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1596, Invalid=1596, Unknown=0, NotChecked=0, Total=3192 [2025-03-17 11:45:08,897 INFO L87 Difference]: Start difference. First operand 103 states and 105 transitions. Second operand has 57 states, 57 states have (on average 2.982456140350877) internal successors, (170), 56 states have internal predecessors, (170), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:45:09,879 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 11:45:09,879 INFO L93 Difference]: Finished difference Result 1089 states and 1250 transitions. [2025-03-17 11:45:09,879 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 56 states. [2025-03-17 11:45:09,880 INFO L78 Accepts]: Start accepts. Automaton has has 57 states, 57 states have (on average 2.982456140350877) internal successors, (170), 56 states have internal predecessors, (170), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 86 [2025-03-17 11:45:09,880 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 11:45:09,882 INFO L225 Difference]: With dead ends: 1089 [2025-03-17 11:45:09,883 INFO L226 Difference]: Without dead ends: 1089 [2025-03-17 11:45:09,883 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 198 GetRequests, 143 SyntacticMatches, 0 SemanticMatches, 55 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 104 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=1596, Invalid=1596, Unknown=0, NotChecked=0, Total=3192 [2025-03-17 11:45:09,884 INFO L435 NwaCegarLoop]: 15 mSDtfsCounter, 3612 mSDsluCounter, 715 mSDsCounter, 0 mSdLazyCounter, 456 mSolverCounterSat, 215 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3612 SdHoareTripleChecker+Valid, 730 SdHoareTripleChecker+Invalid, 671 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 215 IncrementalHoareTripleChecker+Valid, 456 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-17 11:45:09,884 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3612 Valid, 730 Invalid, 671 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [215 Valid, 456 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-17 11:45:09,884 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1089 states. [2025-03-17 11:45:09,891 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1089 to 187. [2025-03-17 11:45:09,891 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 187 states, 182 states have (on average 1.0384615384615385) internal successors, (189), 186 states have internal predecessors, (189), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:45:09,892 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 187 states to 187 states and 189 transitions. [2025-03-17 11:45:09,892 INFO L78 Accepts]: Start accepts. Automaton has 187 states and 189 transitions. Word has length 86 [2025-03-17 11:45:09,892 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 11:45:09,892 INFO L471 AbstractCegarLoop]: Abstraction has 187 states and 189 transitions. [2025-03-17 11:45:09,892 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 57 states, 57 states have (on average 2.982456140350877) internal successors, (170), 56 states have internal predecessors, (170), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:45:09,892 INFO L276 IsEmpty]: Start isEmpty. Operand 187 states and 189 transitions. [2025-03-17 11:45:09,896 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 171 [2025-03-17 11:45:09,897 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 11:45:09,897 INFO L218 NwaCegarLoop]: trace histogram [54, 54, 54, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 11:45:09,904 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 11:45:10,098 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 11:45:10,098 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 11 more)] === [2025-03-17 11:45:10,099 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:45:10,099 INFO L85 PathProgramCache]: Analyzing trace with hash -1675074719, now seen corresponding path program 2 times [2025-03-17 11:45:10,099 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:45:10,099 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [786430622] [2025-03-17 11:45:10,099 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-17 11:45:10,100 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:45:10,131 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 170 statements into 2 equivalence classes. [2025-03-17 11:45:10,157 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 170 of 170 statements. [2025-03-17 11:45:10,158 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-17 11:45:10,158 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:45:12,006 INFO L134 CoverageAnalysis]: Checked inductivity of 4348 backedges. 0 proven. 4347 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-17 11:45:12,006 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:45:12,006 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [786430622] [2025-03-17 11:45:12,006 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [786430622] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 11:45:12,006 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [865754248] [2025-03-17 11:45:12,006 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-17 11:45:12,006 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 11:45:12,006 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 11:45:12,009 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 11:45:12,010 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 11:45:12,083 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 170 statements into 2 equivalence classes. [2025-03-17 11:45:12,151 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 170 of 170 statements. [2025-03-17 11:45:12,151 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-17 11:45:12,151 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:45:12,154 INFO L256 TraceCheckSpWp]: Trace formula consists of 771 conjuncts, 56 conjuncts are in the unsatisfiable core [2025-03-17 11:45:12,157 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 11:45:12,319 INFO L134 CoverageAnalysis]: Checked inductivity of 4348 backedges. 0 proven. 4347 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-17 11:45:12,319 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 11:45:14,829 INFO L134 CoverageAnalysis]: Checked inductivity of 4348 backedges. 0 proven. 4347 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-17 11:45:14,830 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [865754248] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 11:45:14,830 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 11:45:14,830 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [56, 56, 56] total 112 [2025-03-17 11:45:14,830 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1432390583] [2025-03-17 11:45:14,830 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 11:45:14,830 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 113 states [2025-03-17 11:45:14,830 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:45:14,832 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 113 interpolants. [2025-03-17 11:45:14,834 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6328, Invalid=6328, Unknown=0, NotChecked=0, Total=12656 [2025-03-17 11:45:14,834 INFO L87 Difference]: Start difference. First operand 187 states and 189 transitions. Second operand has 113 states, 113 states have (on average 2.9911504424778763) internal successors, (338), 112 states have internal predecessors, (338), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:45:21,394 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 11:45:21,394 INFO L93 Difference]: Finished difference Result 2209 states and 2538 transitions. [2025-03-17 11:45:21,394 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 112 states. [2025-03-17 11:45:21,395 INFO L78 Accepts]: Start accepts. Automaton has has 113 states, 113 states have (on average 2.9911504424778763) internal successors, (338), 112 states have internal predecessors, (338), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 170 [2025-03-17 11:45:21,395 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 11:45:21,400 INFO L225 Difference]: With dead ends: 2209 [2025-03-17 11:45:21,400 INFO L226 Difference]: Without dead ends: 2209 [2025-03-17 11:45:21,402 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 394 GetRequests, 283 SyntacticMatches, 0 SemanticMatches, 111 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 216 ImplicationChecksByTransitivity, 3.2s TimeCoverageRelationStatistics Valid=6328, Invalid=6328, Unknown=0, NotChecked=0, Total=12656 [2025-03-17 11:45:21,402 INFO L435 NwaCegarLoop]: 15 mSDtfsCounter, 5744 mSDsluCounter, 1430 mSDsCounter, 0 mSdLazyCounter, 906 mSolverCounterSat, 345 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5744 SdHoareTripleChecker+Valid, 1445 SdHoareTripleChecker+Invalid, 1251 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 345 IncrementalHoareTripleChecker+Valid, 906 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-03-17 11:45:21,403 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5744 Valid, 1445 Invalid, 1251 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [345 Valid, 906 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-03-17 11:45:21,404 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2209 states. [2025-03-17 11:45:21,412 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2209 to 355. [2025-03-17 11:45:21,412 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 355 states, 350 states have (on average 1.02) internal successors, (357), 354 states have internal predecessors, (357), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:45:21,413 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 355 states to 355 states and 357 transitions. [2025-03-17 11:45:21,413 INFO L78 Accepts]: Start accepts. Automaton has 355 states and 357 transitions. Word has length 170 [2025-03-17 11:45:21,414 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 11:45:21,414 INFO L471 AbstractCegarLoop]: Abstraction has 355 states and 357 transitions. [2025-03-17 11:45:21,415 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 113 states, 113 states have (on average 2.9911504424778763) internal successors, (338), 112 states have internal predecessors, (338), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:45:21,415 INFO L276 IsEmpty]: Start isEmpty. Operand 355 states and 357 transitions. [2025-03-17 11:45:21,417 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 339 [2025-03-17 11:45:21,417 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 11:45:21,417 INFO L218 NwaCegarLoop]: trace histogram [110, 110, 110, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 11:45:21,426 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 11:45:21,619 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,SelfDestructingSolverStorable15 [2025-03-17 11:45:21,619 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 11 more)] === [2025-03-17 11:45:21,620 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:45:21,620 INFO L85 PathProgramCache]: Analyzing trace with hash -1447185951, now seen corresponding path program 3 times [2025-03-17 11:45:21,620 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:45:21,620 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1766489982] [2025-03-17 11:45:21,620 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-17 11:45:21,620 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:45:21,667 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 338 statements into 111 equivalence classes. [2025-03-17 11:45:21,672 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 11 of 338 statements. [2025-03-17 11:45:21,672 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-03-17 11:45:21,672 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:45:21,721 INFO L134 CoverageAnalysis]: Checked inductivity of 18096 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 18095 trivial. 0 not checked. [2025-03-17 11:45:21,722 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:45:21,722 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1766489982] [2025-03-17 11:45:21,722 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1766489982] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 11:45:21,722 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [7180116] [2025-03-17 11:45:21,722 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-17 11:45:21,722 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 11:45:21,722 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 11:45:21,725 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 11:45:21,726 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 11:45:21,843 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 338 statements into 111 equivalence classes. [2025-03-17 11:45:21,851 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 11 of 338 statements. [2025-03-17 11:45:21,851 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-03-17 11:45:21,851 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:45:21,852 INFO L256 TraceCheckSpWp]: Trace formula consists of 82 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-03-17 11:45:21,859 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 11:45:22,184 INFO L134 CoverageAnalysis]: Checked inductivity of 18096 backedges. 219 proven. 1 refuted. 0 times theorem prover too weak. 17876 trivial. 0 not checked. [2025-03-17 11:45:22,184 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 11:45:22,262 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 11:45:22,548 INFO L134 CoverageAnalysis]: Checked inductivity of 18096 backedges. 0 proven. 220 refuted. 0 times theorem prover too weak. 17876 trivial. 0 not checked. [2025-03-17 11:45:22,548 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [7180116] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 11:45:22,548 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 11:45:22,548 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 5, 5] total 13 [2025-03-17 11:45:22,548 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [516485652] [2025-03-17 11:45:22,548 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 11:45:22,549 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-03-17 11:45:22,549 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:45:22,549 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-03-17 11:45:22,549 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=132, Unknown=0, NotChecked=0, Total=210 [2025-03-17 11:45:22,549 INFO L87 Difference]: Start difference. First operand 355 states and 357 transitions. Second operand has 15 states, 14 states have (on average 2.642857142857143) internal successors, (37), 14 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:45:22,666 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 11:45:22,666 INFO L93 Difference]: Finished difference Result 390 states and 397 transitions. [2025-03-17 11:45:22,666 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-17 11:45:22,667 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 14 states have (on average 2.642857142857143) internal successors, (37), 14 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 338 [2025-03-17 11:45:22,667 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 11:45:22,668 INFO L225 Difference]: With dead ends: 390 [2025-03-17 11:45:22,668 INFO L226 Difference]: Without dead ends: 390 [2025-03-17 11:45:22,668 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 681 GetRequests, 664 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 79 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=130, Invalid=212, Unknown=0, NotChecked=0, Total=342 [2025-03-17 11:45:22,668 INFO L435 NwaCegarLoop]: 11 mSDtfsCounter, 195 mSDsluCounter, 45 mSDsCounter, 0 mSdLazyCounter, 108 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 195 SdHoareTripleChecker+Valid, 56 SdHoareTripleChecker+Invalid, 135 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 108 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 11:45:22,668 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [195 Valid, 56 Invalid, 135 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 108 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 11:45:22,669 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 390 states. [2025-03-17 11:45:22,674 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 390 to 367. [2025-03-17 11:45:22,674 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 367 states, 362 states have (on average 1.0303867403314917) internal successors, (373), 366 states have internal predecessors, (373), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:45:22,675 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 367 states to 367 states and 373 transitions. [2025-03-17 11:45:22,675 INFO L78 Accepts]: Start accepts. Automaton has 367 states and 373 transitions. Word has length 338 [2025-03-17 11:45:22,675 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 11:45:22,675 INFO L471 AbstractCegarLoop]: Abstraction has 367 states and 373 transitions. [2025-03-17 11:45:22,676 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 14 states have (on average 2.642857142857143) internal successors, (37), 14 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:45:22,676 INFO L276 IsEmpty]: Start isEmpty. Operand 367 states and 373 transitions. [2025-03-17 11:45:22,678 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 342 [2025-03-17 11:45:22,678 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 11:45:22,678 INFO L218 NwaCegarLoop]: trace histogram [110, 110, 110, 2, 2, 2, 1, 1, 1, 1, 1] [2025-03-17 11:45:22,684 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 11:45:22,878 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,SelfDestructingSolverStorable16 [2025-03-17 11:45:22,878 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 11 more)] === [2025-03-17 11:45:22,879 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:45:22,879 INFO L85 PathProgramCache]: Analyzing trace with hash -234979875, now seen corresponding path program 1 times [2025-03-17 11:45:22,879 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:45:22,879 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2113881535] [2025-03-17 11:45:22,879 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:45:22,879 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:45:22,912 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 341 statements into 1 equivalence classes. [2025-03-17 11:45:22,992 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 341 of 341 statements. [2025-03-17 11:45:22,992 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:45:22,992 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:45:28,799 INFO L134 CoverageAnalysis]: Checked inductivity of 18099 backedges. 0 proven. 18095 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-17 11:45:28,799 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:45:28,799 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2113881535] [2025-03-17 11:45:28,799 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2113881535] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 11:45:28,799 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2066124253] [2025-03-17 11:45:28,799 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:45:28,799 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 11:45:28,799 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 11:45:28,801 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 11:45:28,802 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 11:45:28,938 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 341 statements into 1 equivalence classes. [2025-03-17 11:45:29,048 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 341 of 341 statements. [2025-03-17 11:45:29,049 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:45:29,049 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:45:29,056 INFO L256 TraceCheckSpWp]: Trace formula consists of 1512 conjuncts, 112 conjuncts are in the unsatisfiable core [2025-03-17 11:45:29,060 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 11:45:29,347 INFO L134 CoverageAnalysis]: Checked inductivity of 18099 backedges. 0 proven. 18095 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-17 11:45:29,347 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 11:45:38,729 INFO L134 CoverageAnalysis]: Checked inductivity of 18099 backedges. 0 proven. 18095 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-17 11:45:38,730 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2066124253] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 11:45:38,730 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 11:45:38,730 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [112, 112, 112] total 224 [2025-03-17 11:45:38,730 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1318797195] [2025-03-17 11:45:38,730 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 11:45:38,731 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 225 states [2025-03-17 11:45:38,731 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:45:38,734 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 225 interpolants. [2025-03-17 11:45:38,740 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=25200, Invalid=25200, Unknown=0, NotChecked=0, Total=50400 [2025-03-17 11:45:38,740 INFO L87 Difference]: Start difference. First operand 367 states and 373 transitions. Second operand has 225 states, 225 states have (on average 2.9955555555555557) internal successors, (674), 224 states have internal predecessors, (674), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)