./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/array-memsafety/cstrcpy-alloca-1.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version e2fb8bed Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../sv-benchmarks/c/array-memsafety/cstrcpy-alloca-1.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 fa78fde783b634840a8dd117d9f71a3fa4064d7e1622444edf74e6b44f549a34 --- Real Ultimate output --- This is Ultimate 0.3.0-?-e2fb8be-m [2025-03-08 22:38:19,613 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-08 22:38:19,669 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2025-03-08 22:38:19,672 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-08 22:38:19,675 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-08 22:38:19,699 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-08 22:38:19,700 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-08 22:38:19,700 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-08 22:38:19,700 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-08 22:38:19,700 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-08 22:38:19,701 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-08 22:38:19,701 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-08 22:38:19,701 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-08 22:38:19,701 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-08 22:38:19,702 INFO L153 SettingsManager]: * Use SBE=true [2025-03-08 22:38:19,702 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-08 22:38:19,702 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-08 22:38:19,702 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-08 22:38:19,702 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-08 22:38:19,702 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-08 22:38:19,702 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2025-03-08 22:38:19,703 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2025-03-08 22:38:19,703 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2025-03-08 22:38:19,703 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-08 22:38:19,703 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-03-08 22:38:19,703 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-03-08 22:38:19,703 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-08 22:38:19,703 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-08 22:38:19,703 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-08 22:38:19,703 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-08 22:38:19,703 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-08 22:38:19,703 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-08 22:38:19,703 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-08 22:38:19,704 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 22:38:19,704 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-08 22:38:19,704 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-08 22:38:19,704 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-08 22:38:19,704 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-08 22:38:19,704 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-08 22:38:19,704 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-08 22:38:19,705 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-08 22:38:19,705 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-08 22:38:19,705 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 -> fa78fde783b634840a8dd117d9f71a3fa4064d7e1622444edf74e6b44f549a34 [2025-03-08 22:38:19,954 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-08 22:38:19,962 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-08 22:38:19,964 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-08 22:38:19,965 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-08 22:38:19,965 INFO L274 PluginConnector]: CDTParser initialized [2025-03-08 22:38:19,966 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/array-memsafety/cstrcpy-alloca-1.i [2025-03-08 22:38:21,114 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b860cb99c/ebba5dfdb94e480aae8903fb60a4a683/FLAG5bbb32df2 [2025-03-08 22:38:21,387 INFO L384 CDTParser]: Found 1 translation units. [2025-03-08 22:38:21,390 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/array-memsafety/cstrcpy-alloca-1.i [2025-03-08 22:38:21,401 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b860cb99c/ebba5dfdb94e480aae8903fb60a4a683/FLAG5bbb32df2 [2025-03-08 22:38:21,677 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b860cb99c/ebba5dfdb94e480aae8903fb60a4a683 [2025-03-08 22:38:21,679 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-08 22:38:21,680 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-08 22:38:21,681 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-08 22:38:21,681 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-08 22:38:21,684 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-08 22:38:21,684 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 10:38:21" (1/1) ... [2025-03-08 22:38:21,685 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4fe8e5a9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:38:21, skipping insertion in model container [2025-03-08 22:38:21,685 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 10:38:21" (1/1) ... [2025-03-08 22:38:21,711 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-08 22:38:21,873 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-03-08 22:38:21,873 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-03-08 22:38:21,875 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 22:38:21,886 INFO L200 MainTranslator]: Completed pre-run [2025-03-08 22:38:21,912 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 22:38:21,929 INFO L204 MainTranslator]: Completed translation [2025-03-08 22:38:21,930 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:38:21 WrapperNode [2025-03-08 22:38:21,931 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-08 22:38:21,932 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-08 22:38:21,932 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-08 22:38:21,932 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-08 22:38:21,936 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:38:21" (1/1) ... [2025-03-08 22:38:21,945 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:38:21" (1/1) ... [2025-03-08 22:38:21,958 INFO L138 Inliner]: procedures = 117, calls = 13, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 67 [2025-03-08 22:38:21,958 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-08 22:38:21,959 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-08 22:38:21,959 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-08 22:38:21,959 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-08 22:38:21,964 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:38:21" (1/1) ... [2025-03-08 22:38:21,964 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:38:21" (1/1) ... [2025-03-08 22:38:21,965 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:38:21" (1/1) ... [2025-03-08 22:38:21,976 INFO L175 MemorySlicer]: Split 4 memory accesses to 2 slices as follows [3, 1]. 75 percent of accesses are in the largest equivalence class. The 0 initializations are split as follows [0, 0]. The 3 writes are split as follows [2, 1]. [2025-03-08 22:38:21,976 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:38:21" (1/1) ... [2025-03-08 22:38:21,976 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:38:21" (1/1) ... [2025-03-08 22:38:21,979 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:38:21" (1/1) ... [2025-03-08 22:38:21,980 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:38:21" (1/1) ... [2025-03-08 22:38:21,982 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:38:21" (1/1) ... [2025-03-08 22:38:21,984 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:38:21" (1/1) ... [2025-03-08 22:38:21,985 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-08 22:38:21,986 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-08 22:38:21,986 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-08 22:38:21,987 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-08 22:38:21,987 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:38:21" (1/1) ... [2025-03-08 22:38:21,994 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 22:38:22,003 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 22:38:22,014 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-08 22:38:22,019 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-08 22:38:22,031 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-03-08 22:38:22,031 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-03-08 22:38:22,031 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-03-08 22:38:22,031 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-03-08 22:38:22,031 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-03-08 22:38:22,031 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-03-08 22:38:22,031 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-08 22:38:22,031 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-08 22:38:22,099 INFO L256 CfgBuilder]: Building ICFG [2025-03-08 22:38:22,101 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-08 22:38:22,233 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L532: call ULTIMATE.dealloc(main_#t~malloc7#1.base, main_#t~malloc7#1.offset);havoc main_#t~malloc7#1.base, main_#t~malloc7#1.offset;call ULTIMATE.dealloc(main_#t~malloc8#1.base, main_#t~malloc8#1.offset);havoc main_#t~malloc8#1.base, main_#t~malloc8#1.offset; [2025-03-08 22:38:22,247 INFO L? ?]: Removed 43 outVars from TransFormulas that were not future-live. [2025-03-08 22:38:22,247 INFO L307 CfgBuilder]: Performing block encoding [2025-03-08 22:38:22,254 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-08 22:38:22,254 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-08 22:38:22,255 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 10:38:22 BoogieIcfgContainer [2025-03-08 22:38:22,255 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-08 22:38:22,257 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-08 22:38:22,257 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-08 22:38:22,261 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-08 22:38:22,262 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.03 10:38:21" (1/3) ... [2025-03-08 22:38:22,262 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@77e11d50 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 10:38:22, skipping insertion in model container [2025-03-08 22:38:22,262 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:38:21" (2/3) ... [2025-03-08 22:38:22,263 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@77e11d50 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 10:38:22, skipping insertion in model container [2025-03-08 22:38:22,263 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 10:38:22" (3/3) ... [2025-03-08 22:38:22,264 INFO L128 eAbstractionObserver]: Analyzing ICFG cstrcpy-alloca-1.i [2025-03-08 22:38:22,276 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-08 22:38:22,278 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG cstrcpy-alloca-1.i that has 1 procedures, 28 locations, 1 initial locations, 2 loop locations, and 9 error locations. [2025-03-08 22:38:22,312 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-08 22:38:22,322 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;@344b9b1b, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-08 22:38:22,323 INFO L334 AbstractCegarLoop]: Starting to check reachability of 9 error locations. [2025-03-08 22:38:22,326 INFO L276 IsEmpty]: Start isEmpty. Operand has 28 states, 18 states have (on average 1.8333333333333333) internal successors, (33), 27 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 22:38:22,330 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2025-03-08 22:38:22,331 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 22:38:22,332 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2025-03-08 22:38:22,332 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 6 more)] === [2025-03-08 22:38:22,336 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:38:22,337 INFO L85 PathProgramCache]: Analyzing trace with hash 1981073570, now seen corresponding path program 1 times [2025-03-08 22:38:22,342 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:38:22,344 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [134869386] [2025-03-08 22:38:22,344 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:38:22,345 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:38:22,405 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-03-08 22:38:22,413 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-03-08 22:38:22,414 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:38:22,414 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:38:22,488 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 22:38:22,489 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 22:38:22,489 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [134869386] [2025-03-08 22:38:22,489 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [134869386] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 22:38:22,490 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 22:38:22,490 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 22:38:22,491 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [112270646] [2025-03-08 22:38:22,491 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 22:38:22,493 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 22:38:22,494 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 22:38:22,510 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 22:38:22,511 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-08 22:38:22,512 INFO L87 Difference]: Start difference. First operand has 28 states, 18 states have (on average 1.8333333333333333) internal successors, (33), 27 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 4 states, 4 states have (on average 1.5) internal successors, (6), 4 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 22:38:22,567 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 22:38:22,569 INFO L93 Difference]: Finished difference Result 29 states and 33 transitions. [2025-03-08 22:38:22,569 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 22:38:22,570 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 1.5) internal successors, (6), 4 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 6 [2025-03-08 22:38:22,571 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 22:38:22,576 INFO L225 Difference]: With dead ends: 29 [2025-03-08 22:38:22,576 INFO L226 Difference]: Without dead ends: 27 [2025-03-08 22:38:22,578 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-08 22:38:22,580 INFO L435 NwaCegarLoop]: 30 mSDtfsCounter, 2 mSDsluCounter, 44 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 74 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 22:38:22,581 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 74 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 22:38:22,590 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2025-03-08 22:38:22,598 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2025-03-08 22:38:22,599 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 18 states have (on average 1.7222222222222223) internal successors, (31), 26 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 22:38:22,602 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 31 transitions. [2025-03-08 22:38:22,603 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 31 transitions. Word has length 6 [2025-03-08 22:38:22,603 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 22:38:22,604 INFO L471 AbstractCegarLoop]: Abstraction has 27 states and 31 transitions. [2025-03-08 22:38:22,604 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 1.5) internal successors, (6), 4 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 22:38:22,604 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 31 transitions. [2025-03-08 22:38:22,604 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2025-03-08 22:38:22,604 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 22:38:22,605 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2025-03-08 22:38:22,605 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-08 22:38:22,605 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 6 more)] === [2025-03-08 22:38:22,606 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:38:22,606 INFO L85 PathProgramCache]: Analyzing trace with hash 1981074531, now seen corresponding path program 1 times [2025-03-08 22:38:22,607 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:38:22,607 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2101212969] [2025-03-08 22:38:22,607 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:38:22,607 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:38:22,613 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-03-08 22:38:22,616 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-03-08 22:38:22,618 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:38:22,618 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:38:22,643 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 22:38:22,643 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 22:38:22,643 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2101212969] [2025-03-08 22:38:22,643 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2101212969] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 22:38:22,643 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 22:38:22,644 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-08 22:38:22,644 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [622990946] [2025-03-08 22:38:22,644 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 22:38:22,644 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 22:38:22,644 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 22:38:22,645 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 22:38:22,645 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 22:38:22,645 INFO L87 Difference]: Start difference. First operand 27 states and 31 transitions. Second operand has 3 states, 2 states have (on average 3.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-08 22:38:22,670 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 22:38:22,671 INFO L93 Difference]: Finished difference Result 28 states and 31 transitions. [2025-03-08 22:38:22,671 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 22:38:22,671 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 3.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 6 [2025-03-08 22:38:22,671 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 22:38:22,672 INFO L225 Difference]: With dead ends: 28 [2025-03-08 22:38:22,672 INFO L226 Difference]: Without dead ends: 27 [2025-03-08 22:38:22,672 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 22:38:22,672 INFO L435 NwaCegarLoop]: 29 mSDtfsCounter, 2 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 41 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 22:38:22,674 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 41 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 22:38:22,674 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2025-03-08 22:38:22,675 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 26. [2025-03-08 22:38:22,676 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 17 states have (on average 1.7058823529411764) internal successors, (29), 25 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 22:38:22,676 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 29 transitions. [2025-03-08 22:38:22,677 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 29 transitions. Word has length 6 [2025-03-08 22:38:22,677 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 22:38:22,677 INFO L471 AbstractCegarLoop]: Abstraction has 26 states and 29 transitions. [2025-03-08 22:38:22,677 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 3.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-08 22:38:22,677 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 29 transitions. [2025-03-08 22:38:22,677 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2025-03-08 22:38:22,677 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 22:38:22,677 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2025-03-08 22:38:22,678 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-08 22:38:22,678 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 6 more)] === [2025-03-08 22:38:22,678 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:38:22,680 INFO L85 PathProgramCache]: Analyzing trace with hash 1283741087, now seen corresponding path program 1 times [2025-03-08 22:38:22,680 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:38:22,681 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2120237211] [2025-03-08 22:38:22,681 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:38:22,681 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:38:22,688 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-03-08 22:38:22,702 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-03-08 22:38:22,702 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:38:22,702 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:38:22,762 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 22:38:22,763 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 22:38:22,763 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2120237211] [2025-03-08 22:38:22,763 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2120237211] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 22:38:22,763 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 22:38:22,763 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-08 22:38:22,763 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [734137758] [2025-03-08 22:38:22,763 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 22:38:22,763 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 22:38:22,764 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 22:38:22,764 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 22:38:22,764 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 22:38:22,764 INFO L87 Difference]: Start difference. First operand 26 states and 29 transitions. Second operand has 3 states, 2 states have (on average 3.5) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 22:38:22,783 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 22:38:22,784 INFO L93 Difference]: Finished difference Result 24 states and 27 transitions. [2025-03-08 22:38:22,784 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 22:38:22,784 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 3.5) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2025-03-08 22:38:22,785 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 22:38:22,785 INFO L225 Difference]: With dead ends: 24 [2025-03-08 22:38:22,785 INFO L226 Difference]: Without dead ends: 24 [2025-03-08 22:38:22,786 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 22:38:22,786 INFO L435 NwaCegarLoop]: 22 mSDtfsCounter, 4 mSDsluCounter, 10 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 32 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 22:38:22,787 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 32 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 22:38:22,787 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2025-03-08 22:38:22,789 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 24. [2025-03-08 22:38:22,790 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24 states, 17 states have (on average 1.588235294117647) internal successors, (27), 23 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 22:38:22,790 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 27 transitions. [2025-03-08 22:38:22,790 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 27 transitions. Word has length 7 [2025-03-08 22:38:22,791 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 22:38:22,791 INFO L471 AbstractCegarLoop]: Abstraction has 24 states and 27 transitions. [2025-03-08 22:38:22,791 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 3.5) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 22:38:22,791 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 27 transitions. [2025-03-08 22:38:22,791 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2025-03-08 22:38:22,791 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 22:38:22,791 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2025-03-08 22:38:22,792 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-08 22:38:22,792 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 6 more)] === [2025-03-08 22:38:22,792 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:38:22,792 INFO L85 PathProgramCache]: Analyzing trace with hash 1283741088, now seen corresponding path program 1 times [2025-03-08 22:38:22,792 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:38:22,792 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1775834936] [2025-03-08 22:38:22,792 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:38:22,792 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:38:22,802 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-03-08 22:38:22,821 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-03-08 22:38:22,822 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:38:22,822 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:38:22,996 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 22:38:22,996 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 22:38:22,996 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1775834936] [2025-03-08 22:38:22,996 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1775834936] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 22:38:22,996 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 22:38:22,996 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 22:38:22,996 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1766310882] [2025-03-08 22:38:22,996 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 22:38:22,996 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 22:38:22,996 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 22:38:22,997 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 22:38:22,997 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-08 22:38:22,997 INFO L87 Difference]: Start difference. First operand 24 states and 27 transitions. Second operand has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 4 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 22:38:23,021 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 22:38:23,021 INFO L93 Difference]: Finished difference Result 30 states and 34 transitions. [2025-03-08 22:38:23,022 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 22:38:23,022 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 4 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2025-03-08 22:38:23,022 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 22:38:23,022 INFO L225 Difference]: With dead ends: 30 [2025-03-08 22:38:23,022 INFO L226 Difference]: Without dead ends: 30 [2025-03-08 22:38:23,023 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-08 22:38:23,023 INFO L435 NwaCegarLoop]: 21 mSDtfsCounter, 7 mSDsluCounter, 19 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 40 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 22:38:23,023 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 40 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 22:38:23,025 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2025-03-08 22:38:23,026 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 29. [2025-03-08 22:38:23,027 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29 states, 22 states have (on average 1.5454545454545454) internal successors, (34), 28 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 22:38:23,027 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 34 transitions. [2025-03-08 22:38:23,028 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 34 transitions. Word has length 7 [2025-03-08 22:38:23,028 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 22:38:23,028 INFO L471 AbstractCegarLoop]: Abstraction has 29 states and 34 transitions. [2025-03-08 22:38:23,028 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 4 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 22:38:23,028 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 34 transitions. [2025-03-08 22:38:23,029 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2025-03-08 22:38:23,029 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 22:38:23,029 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2025-03-08 22:38:23,029 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-08 22:38:23,029 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 6 more)] === [2025-03-08 22:38:23,030 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:38:23,030 INFO L85 PathProgramCache]: Analyzing trace with hash 1283741248, now seen corresponding path program 1 times [2025-03-08 22:38:23,030 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:38:23,030 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [307944262] [2025-03-08 22:38:23,030 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:38:23,030 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:38:23,037 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-03-08 22:38:23,042 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-03-08 22:38:23,045 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:38:23,046 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:38:23,097 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 22:38:23,099 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 22:38:23,099 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [307944262] [2025-03-08 22:38:23,099 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [307944262] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 22:38:23,099 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 22:38:23,099 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 22:38:23,099 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [634898399] [2025-03-08 22:38:23,099 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 22:38:23,100 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 22:38:23,100 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 22:38:23,100 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 22:38:23,100 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-08 22:38:23,100 INFO L87 Difference]: Start difference. First operand 29 states and 34 transitions. Second operand has 4 states, 4 states have (on average 1.75) internal successors, (7), 4 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 22:38:23,116 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 22:38:23,117 INFO L93 Difference]: Finished difference Result 27 states and 30 transitions. [2025-03-08 22:38:23,118 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 22:38:23,118 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 1.75) internal successors, (7), 4 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2025-03-08 22:38:23,118 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 22:38:23,118 INFO L225 Difference]: With dead ends: 27 [2025-03-08 22:38:23,118 INFO L226 Difference]: Without dead ends: 27 [2025-03-08 22:38:23,119 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-08 22:38:23,119 INFO L435 NwaCegarLoop]: 24 mSDtfsCounter, 1 mSDsluCounter, 19 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 43 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 22:38:23,119 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 43 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 22:38:23,120 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2025-03-08 22:38:23,121 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2025-03-08 22:38:23,121 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 20 states have (on average 1.5) internal successors, (30), 26 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 22:38:23,121 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 30 transitions. [2025-03-08 22:38:23,121 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 30 transitions. Word has length 7 [2025-03-08 22:38:23,121 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 22:38:23,121 INFO L471 AbstractCegarLoop]: Abstraction has 27 states and 30 transitions. [2025-03-08 22:38:23,121 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 1.75) internal successors, (7), 4 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 22:38:23,122 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 30 transitions. [2025-03-08 22:38:23,122 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2025-03-08 22:38:23,122 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 22:38:23,122 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2025-03-08 22:38:23,122 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-08 22:38:23,122 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 6 more)] === [2025-03-08 22:38:23,122 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:38:23,122 INFO L85 PathProgramCache]: Analyzing trace with hash 1283770879, now seen corresponding path program 1 times [2025-03-08 22:38:23,122 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:38:23,123 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1744788707] [2025-03-08 22:38:23,123 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:38:23,123 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:38:23,127 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-03-08 22:38:23,130 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-03-08 22:38:23,131 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:38:23,131 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:38:23,245 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 22:38:23,245 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 22:38:23,245 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1744788707] [2025-03-08 22:38:23,245 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1744788707] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 22:38:23,246 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 22:38:23,246 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 22:38:23,246 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [588902586] [2025-03-08 22:38:23,248 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 22:38:23,248 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 22:38:23,248 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 22:38:23,249 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 22:38:23,249 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2025-03-08 22:38:23,249 INFO L87 Difference]: Start difference. First operand 27 states and 30 transitions. Second operand has 5 states, 4 states have (on average 1.75) internal successors, (7), 5 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 22:38:23,283 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 22:38:23,283 INFO L93 Difference]: Finished difference Result 26 states and 29 transitions. [2025-03-08 22:38:23,283 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-08 22:38:23,284 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 1.75) internal successors, (7), 5 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2025-03-08 22:38:23,284 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 22:38:23,284 INFO L225 Difference]: With dead ends: 26 [2025-03-08 22:38:23,284 INFO L226 Difference]: Without dead ends: 26 [2025-03-08 22:38:23,284 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2025-03-08 22:38:23,285 INFO L435 NwaCegarLoop]: 18 mSDtfsCounter, 6 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 45 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 22:38:23,285 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 45 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 22:38:23,285 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2025-03-08 22:38:23,286 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 25. [2025-03-08 22:38:23,286 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25 states, 19 states have (on average 1.4736842105263157) internal successors, (28), 24 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 22:38:23,286 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 28 transitions. [2025-03-08 22:38:23,286 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 28 transitions. Word has length 7 [2025-03-08 22:38:23,287 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 22:38:23,287 INFO L471 AbstractCegarLoop]: Abstraction has 25 states and 28 transitions. [2025-03-08 22:38:23,287 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 1.75) internal successors, (7), 5 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 22:38:23,287 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 28 transitions. [2025-03-08 22:38:23,287 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2025-03-08 22:38:23,287 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 22:38:23,287 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2025-03-08 22:38:23,287 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-08 22:38:23,287 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 6 more)] === [2025-03-08 22:38:23,288 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:38:23,288 INFO L85 PathProgramCache]: Analyzing trace with hash 1283771039, now seen corresponding path program 1 times [2025-03-08 22:38:23,288 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:38:23,288 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1296604599] [2025-03-08 22:38:23,288 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:38:23,288 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:38:23,292 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-03-08 22:38:23,294 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-03-08 22:38:23,294 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:38:23,295 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:38:23,329 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 22:38:23,330 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 22:38:23,330 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1296604599] [2025-03-08 22:38:23,330 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1296604599] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 22:38:23,330 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 22:38:23,330 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 22:38:23,331 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1917392685] [2025-03-08 22:38:23,331 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 22:38:23,331 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 22:38:23,331 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 22:38:23,332 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 22:38:23,332 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-08 22:38:23,332 INFO L87 Difference]: Start difference. First operand 25 states and 28 transitions. Second operand has 4 states, 4 states have (on average 1.75) internal successors, (7), 4 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 22:38:23,349 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 22:38:23,351 INFO L93 Difference]: Finished difference Result 30 states and 34 transitions. [2025-03-08 22:38:23,351 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 22:38:23,351 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 1.75) internal successors, (7), 4 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2025-03-08 22:38:23,351 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 22:38:23,352 INFO L225 Difference]: With dead ends: 30 [2025-03-08 22:38:23,352 INFO L226 Difference]: Without dead ends: 30 [2025-03-08 22:38:23,352 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-08 22:38:23,353 INFO L435 NwaCegarLoop]: 24 mSDtfsCounter, 1 mSDsluCounter, 37 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 61 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 22:38:23,353 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 61 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 22:38:23,353 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2025-03-08 22:38:23,356 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 26. [2025-03-08 22:38:23,357 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 20 states have (on average 1.5) internal successors, (30), 25 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 22:38:23,357 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 30 transitions. [2025-03-08 22:38:23,357 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 30 transitions. Word has length 7 [2025-03-08 22:38:23,357 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 22:38:23,358 INFO L471 AbstractCegarLoop]: Abstraction has 26 states and 30 transitions. [2025-03-08 22:38:23,358 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 1.75) internal successors, (7), 4 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 22:38:23,358 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 30 transitions. [2025-03-08 22:38:23,358 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2025-03-08 22:38:23,358 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 22:38:23,358 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2025-03-08 22:38:23,358 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-08 22:38:23,358 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 6 more)] === [2025-03-08 22:38:23,359 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:38:23,359 INFO L85 PathProgramCache]: Analyzing trace with hash 1284694560, now seen corresponding path program 1 times [2025-03-08 22:38:23,359 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:38:23,359 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [786261757] [2025-03-08 22:38:23,359 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:38:23,359 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:38:23,365 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-03-08 22:38:23,369 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-03-08 22:38:23,370 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:38:23,370 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:38:23,482 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 22:38:23,482 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 22:38:23,482 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [786261757] [2025-03-08 22:38:23,483 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [786261757] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 22:38:23,483 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 22:38:23,483 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 22:38:23,483 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1960014736] [2025-03-08 22:38:23,483 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 22:38:23,483 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 22:38:23,483 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 22:38:23,484 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 22:38:23,484 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-08 22:38:23,484 INFO L87 Difference]: Start difference. First operand 26 states and 30 transitions. Second operand has 5 states, 4 states have (on average 1.75) internal successors, (7), 5 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 22:38:23,531 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 22:38:23,531 INFO L93 Difference]: Finished difference Result 29 states and 34 transitions. [2025-03-08 22:38:23,532 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-08 22:38:23,532 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 1.75) internal successors, (7), 5 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2025-03-08 22:38:23,532 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 22:38:23,532 INFO L225 Difference]: With dead ends: 29 [2025-03-08 22:38:23,532 INFO L226 Difference]: Without dead ends: 29 [2025-03-08 22:38:23,532 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-03-08 22:38:23,533 INFO L435 NwaCegarLoop]: 16 mSDtfsCounter, 12 mSDsluCounter, 23 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 39 SdHoareTripleChecker+Invalid, 40 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 38 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 22:38:23,533 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 39 Invalid, 40 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 22:38:23,533 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2025-03-08 22:38:23,534 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 28. [2025-03-08 22:38:23,534 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 22 states have (on average 1.5) internal successors, (33), 27 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 22:38:23,534 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 33 transitions. [2025-03-08 22:38:23,535 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 33 transitions. Word has length 7 [2025-03-08 22:38:23,535 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 22:38:23,535 INFO L471 AbstractCegarLoop]: Abstraction has 28 states and 33 transitions. [2025-03-08 22:38:23,535 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 1.75) internal successors, (7), 5 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 22:38:23,535 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 33 transitions. [2025-03-08 22:38:23,535 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2025-03-08 22:38:23,535 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 22:38:23,535 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 22:38:23,536 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-08 22:38:23,536 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 6 more)] === [2025-03-08 22:38:23,536 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:38:23,536 INFO L85 PathProgramCache]: Analyzing trace with hash 1541906257, now seen corresponding path program 1 times [2025-03-08 22:38:23,536 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:38:23,536 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [803057758] [2025-03-08 22:38:23,536 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:38:23,537 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:38:23,556 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-03-08 22:38:23,559 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-03-08 22:38:23,560 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:38:23,560 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:38:23,607 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 22:38:23,607 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 22:38:23,607 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [803057758] [2025-03-08 22:38:23,607 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [803057758] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 22:38:23,607 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 22:38:23,607 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 22:38:23,608 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2016201974] [2025-03-08 22:38:23,608 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 22:38:23,608 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 22:38:23,608 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 22:38:23,608 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 22:38:23,608 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-08 22:38:23,608 INFO L87 Difference]: Start difference. First operand 28 states and 33 transitions. Second operand has 5 states, 4 states have (on average 2.5) internal successors, (10), 5 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 22:38:23,652 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 22:38:23,652 INFO L93 Difference]: Finished difference Result 27 states and 32 transitions. [2025-03-08 22:38:23,652 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-08 22:38:23,652 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 2.5) internal successors, (10), 5 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 10 [2025-03-08 22:38:23,653 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 22:38:23,653 INFO L225 Difference]: With dead ends: 27 [2025-03-08 22:38:23,653 INFO L226 Difference]: Without dead ends: 27 [2025-03-08 22:38:23,653 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-08 22:38:23,654 INFO L435 NwaCegarLoop]: 15 mSDtfsCounter, 12 mSDsluCounter, 24 mSDsCounter, 0 mSdLazyCounter, 44 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 39 SdHoareTripleChecker+Invalid, 46 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 44 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 22:38:23,655 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 39 Invalid, 46 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 44 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 22:38:23,655 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2025-03-08 22:38:23,656 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2025-03-08 22:38:23,657 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 22 states have (on average 1.4545454545454546) internal successors, (32), 26 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 22:38:23,658 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 32 transitions. [2025-03-08 22:38:23,658 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 32 transitions. Word has length 10 [2025-03-08 22:38:23,658 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 22:38:23,658 INFO L471 AbstractCegarLoop]: Abstraction has 27 states and 32 transitions. [2025-03-08 22:38:23,658 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 2.5) internal successors, (10), 5 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 22:38:23,658 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 32 transitions. [2025-03-08 22:38:23,658 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2025-03-08 22:38:23,658 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 22:38:23,658 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 22:38:23,658 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-08 22:38:23,658 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 6 more)] === [2025-03-08 22:38:23,659 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:38:23,659 INFO L85 PathProgramCache]: Analyzing trace with hash 1541906258, now seen corresponding path program 1 times [2025-03-08 22:38:23,659 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:38:23,659 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [191125289] [2025-03-08 22:38:23,659 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:38:23,659 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:38:23,666 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-03-08 22:38:23,672 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-03-08 22:38:23,672 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:38:23,672 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:38:23,771 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 22:38:23,771 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 22:38:23,771 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [191125289] [2025-03-08 22:38:23,771 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [191125289] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 22:38:23,771 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 22:38:23,771 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-08 22:38:23,771 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1681785445] [2025-03-08 22:38:23,772 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 22:38:23,772 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-08 22:38:23,772 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 22:38:23,772 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-08 22:38:23,772 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-03-08 22:38:23,772 INFO L87 Difference]: Start difference. First operand 27 states and 32 transitions. Second operand has 7 states, 6 states have (on average 1.6666666666666667) internal successors, (10), 7 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 22:38:23,830 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 22:38:23,831 INFO L93 Difference]: Finished difference Result 30 states and 35 transitions. [2025-03-08 22:38:23,831 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-08 22:38:23,831 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 1.6666666666666667) internal successors, (10), 7 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 10 [2025-03-08 22:38:23,831 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 22:38:23,831 INFO L225 Difference]: With dead ends: 30 [2025-03-08 22:38:23,832 INFO L226 Difference]: Without dead ends: 30 [2025-03-08 22:38:23,832 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2025-03-08 22:38:23,833 INFO L435 NwaCegarLoop]: 16 mSDtfsCounter, 10 mSDsluCounter, 45 mSDsCounter, 0 mSdLazyCounter, 68 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 61 SdHoareTripleChecker+Invalid, 70 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 68 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 22:38:23,833 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 61 Invalid, 70 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 68 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 22:38:23,833 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2025-03-08 22:38:23,834 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 29. [2025-03-08 22:38:23,836 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29 states, 24 states have (on average 1.4166666666666667) internal successors, (34), 28 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 22:38:23,836 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 34 transitions. [2025-03-08 22:38:23,836 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 34 transitions. Word has length 10 [2025-03-08 22:38:23,836 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 22:38:23,836 INFO L471 AbstractCegarLoop]: Abstraction has 29 states and 34 transitions. [2025-03-08 22:38:23,837 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 1.6666666666666667) internal successors, (10), 7 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 22:38:23,837 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 34 transitions. [2025-03-08 22:38:23,837 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2025-03-08 22:38:23,837 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 22:38:23,838 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 22:38:23,838 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-08 22:38:23,838 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 6 more)] === [2025-03-08 22:38:23,838 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:38:23,839 INFO L85 PathProgramCache]: Analyzing trace with hash -117975305, now seen corresponding path program 1 times [2025-03-08 22:38:23,839 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:38:23,839 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [325639597] [2025-03-08 22:38:23,839 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:38:23,839 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:38:23,844 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-03-08 22:38:23,853 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-03-08 22:38:23,853 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:38:23,854 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:38:24,011 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 22:38:24,012 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 22:38:24,012 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [325639597] [2025-03-08 22:38:24,012 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [325639597] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 22:38:24,012 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1696462120] [2025-03-08 22:38:24,012 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:38:24,012 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 22:38:24,012 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 22:38:24,014 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 22:38:24,016 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-08 22:38:24,050 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-03-08 22:38:24,057 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-03-08 22:38:24,058 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:38:24,058 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:38:24,059 INFO L256 TraceCheckSpWp]: Trace formula consists of 62 conjuncts, 15 conjuncts are in the unsatisfiable core [2025-03-08 22:38:24,062 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 22:38:24,124 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2025-03-08 22:38:24,133 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 1 [2025-03-08 22:38:24,241 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 22:38:24,241 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 22:38:24,383 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 22:38:24,384 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1696462120] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 22:38:24,384 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 22:38:24,384 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 13 [2025-03-08 22:38:24,384 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [531454597] [2025-03-08 22:38:24,384 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 22:38:24,385 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-03-08 22:38:24,385 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 22:38:24,385 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-03-08 22:38:24,386 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=136, Unknown=0, NotChecked=0, Total=182 [2025-03-08 22:38:24,386 INFO L87 Difference]: Start difference. First operand 29 states and 34 transitions. Second operand has 14 states, 13 states have (on average 2.1538461538461537) internal successors, (28), 14 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 22:38:24,530 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 22:38:24,530 INFO L93 Difference]: Finished difference Result 30 states and 36 transitions. [2025-03-08 22:38:24,530 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-08 22:38:24,530 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 2.1538461538461537) internal successors, (28), 14 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 10 [2025-03-08 22:38:24,531 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 22:38:24,531 INFO L225 Difference]: With dead ends: 30 [2025-03-08 22:38:24,531 INFO L226 Difference]: Without dead ends: 30 [2025-03-08 22:38:24,531 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 11 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 53 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=88, Invalid=254, Unknown=0, NotChecked=0, Total=342 [2025-03-08 22:38:24,532 INFO L435 NwaCegarLoop]: 14 mSDtfsCounter, 11 mSDsluCounter, 50 mSDsCounter, 0 mSdLazyCounter, 89 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 64 SdHoareTripleChecker+Invalid, 93 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 89 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 22:38:24,532 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 64 Invalid, 93 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 89 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 22:38:24,532 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2025-03-08 22:38:24,533 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 26. [2025-03-08 22:38:24,533 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 22 states have (on average 1.3636363636363635) internal successors, (30), 25 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 22:38:24,534 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 30 transitions. [2025-03-08 22:38:24,534 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 30 transitions. Word has length 10 [2025-03-08 22:38:24,534 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 22:38:24,534 INFO L471 AbstractCegarLoop]: Abstraction has 26 states and 30 transitions. [2025-03-08 22:38:24,534 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 2.1538461538461537) internal successors, (28), 14 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 22:38:24,534 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 30 transitions. [2025-03-08 22:38:24,534 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2025-03-08 22:38:24,534 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 22:38:24,534 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 22:38:24,542 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-03-08 22:38:24,735 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2025-03-08 22:38:24,735 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 6 more)] === [2025-03-08 22:38:24,735 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:38:24,735 INFO L85 PathProgramCache]: Analyzing trace with hash 554453690, now seen corresponding path program 1 times [2025-03-08 22:38:24,735 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:38:24,735 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [587958246] [2025-03-08 22:38:24,735 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:38:24,736 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:38:24,742 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-03-08 22:38:24,749 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-03-08 22:38:24,749 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:38:24,749 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:38:24,832 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 22:38:24,832 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 22:38:24,832 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [587958246] [2025-03-08 22:38:24,833 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [587958246] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 22:38:24,833 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 22:38:24,833 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 22:38:24,833 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [144129185] [2025-03-08 22:38:24,833 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 22:38:24,833 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 22:38:24,833 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 22:38:24,833 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 22:38:24,833 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-08 22:38:24,833 INFO L87 Difference]: Start difference. First operand 26 states and 30 transitions. Second operand has 6 states, 5 states have (on average 2.2) internal successors, (11), 6 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 22:38:24,884 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 22:38:24,884 INFO L93 Difference]: Finished difference Result 25 states and 29 transitions. [2025-03-08 22:38:24,884 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-08 22:38:24,884 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 2.2) internal successors, (11), 6 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2025-03-08 22:38:24,884 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 22:38:24,885 INFO L225 Difference]: With dead ends: 25 [2025-03-08 22:38:24,885 INFO L226 Difference]: Without dead ends: 25 [2025-03-08 22:38:24,885 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2025-03-08 22:38:24,885 INFO L435 NwaCegarLoop]: 15 mSDtfsCounter, 15 mSDsluCounter, 23 mSDsCounter, 0 mSdLazyCounter, 36 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 38 SdHoareTripleChecker+Invalid, 38 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 36 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 22:38:24,885 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 38 Invalid, 38 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 36 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 22:38:24,885 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2025-03-08 22:38:24,886 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 25. [2025-03-08 22:38:24,886 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25 states, 22 states have (on average 1.3181818181818181) internal successors, (29), 24 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 22:38:24,886 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 29 transitions. [2025-03-08 22:38:24,886 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 29 transitions. Word has length 11 [2025-03-08 22:38:24,887 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 22:38:24,887 INFO L471 AbstractCegarLoop]: Abstraction has 25 states and 29 transitions. [2025-03-08 22:38:24,887 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.2) internal successors, (11), 6 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 22:38:24,887 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 29 transitions. [2025-03-08 22:38:24,887 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2025-03-08 22:38:24,887 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 22:38:24,887 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 22:38:24,887 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-08 22:38:24,887 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 6 more)] === [2025-03-08 22:38:24,887 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:38:24,887 INFO L85 PathProgramCache]: Analyzing trace with hash 554453691, now seen corresponding path program 1 times [2025-03-08 22:38:24,889 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:38:24,889 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1375595361] [2025-03-08 22:38:24,889 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:38:24,889 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:38:24,895 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-03-08 22:38:24,901 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-03-08 22:38:24,901 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:38:24,901 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:38:25,023 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 22:38:25,023 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 22:38:25,023 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1375595361] [2025-03-08 22:38:25,023 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1375595361] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 22:38:25,023 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 22:38:25,023 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 22:38:25,023 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [286983257] [2025-03-08 22:38:25,023 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 22:38:25,023 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 22:38:25,023 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 22:38:25,024 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 22:38:25,024 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-08 22:38:25,024 INFO L87 Difference]: Start difference. First operand 25 states and 29 transitions. Second operand has 6 states, 5 states have (on average 2.2) internal successors, (11), 6 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 22:38:25,056 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 22:38:25,056 INFO L93 Difference]: Finished difference Result 32 states and 36 transitions. [2025-03-08 22:38:25,056 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-08 22:38:25,056 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 2.2) internal successors, (11), 6 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2025-03-08 22:38:25,056 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 22:38:25,056 INFO L225 Difference]: With dead ends: 32 [2025-03-08 22:38:25,056 INFO L226 Difference]: Without dead ends: 32 [2025-03-08 22:38:25,056 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-08 22:38:25,057 INFO L435 NwaCegarLoop]: 17 mSDtfsCounter, 1 mSDsluCounter, 51 mSDsCounter, 0 mSdLazyCounter, 46 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 68 SdHoareTripleChecker+Invalid, 46 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 46 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 22:38:25,057 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 68 Invalid, 46 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 46 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 22:38:25,057 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2025-03-08 22:38:25,058 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 32. [2025-03-08 22:38:25,058 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 29 states have (on average 1.2413793103448276) internal successors, (36), 31 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-08 22:38:25,058 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 36 transitions. [2025-03-08 22:38:25,058 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 36 transitions. Word has length 11 [2025-03-08 22:38:25,058 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 22:38:25,058 INFO L471 AbstractCegarLoop]: Abstraction has 32 states and 36 transitions. [2025-03-08 22:38:25,058 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.2) internal successors, (11), 6 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 22:38:25,058 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 36 transitions. [2025-03-08 22:38:25,058 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2025-03-08 22:38:25,058 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 22:38:25,059 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 22:38:25,059 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-08 22:38:25,059 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 6 more)] === [2025-03-08 22:38:25,059 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:38:25,059 INFO L85 PathProgramCache]: Analyzing trace with hash -1253000772, now seen corresponding path program 1 times [2025-03-08 22:38:25,059 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:38:25,059 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1686209567] [2025-03-08 22:38:25,059 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:38:25,059 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:38:25,064 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-03-08 22:38:25,068 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-03-08 22:38:25,068 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:38:25,068 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:38:25,189 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 22:38:25,190 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 22:38:25,190 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1686209567] [2025-03-08 22:38:25,190 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1686209567] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 22:38:25,190 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 22:38:25,190 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-08 22:38:25,190 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [129318027] [2025-03-08 22:38:25,190 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 22:38:25,190 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-08 22:38:25,190 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 22:38:25,191 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-08 22:38:25,191 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-03-08 22:38:25,191 INFO L87 Difference]: Start difference. First operand 32 states and 36 transitions. Second operand has 7 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 7 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 22:38:25,226 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 22:38:25,226 INFO L93 Difference]: Finished difference Result 33 states and 37 transitions. [2025-03-08 22:38:25,226 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-08 22:38:25,226 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 7 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2025-03-08 22:38:25,227 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 22:38:25,227 INFO L225 Difference]: With dead ends: 33 [2025-03-08 22:38:25,227 INFO L226 Difference]: Without dead ends: 33 [2025-03-08 22:38:25,227 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-03-08 22:38:25,227 INFO L435 NwaCegarLoop]: 14 mSDtfsCounter, 5 mSDsluCounter, 39 mSDsCounter, 0 mSdLazyCounter, 51 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 53 SdHoareTripleChecker+Invalid, 53 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 51 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 22:38:25,228 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 53 Invalid, 53 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 51 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 22:38:25,228 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2025-03-08 22:38:25,229 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 26. [2025-03-08 22:38:25,230 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 23 states have (on average 1.3043478260869565) internal successors, (30), 25 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 22:38:25,230 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 30 transitions. [2025-03-08 22:38:25,230 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 30 transitions. Word has length 11 [2025-03-08 22:38:25,231 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 22:38:25,231 INFO L471 AbstractCegarLoop]: Abstraction has 26 states and 30 transitions. [2025-03-08 22:38:25,231 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 7 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 22:38:25,231 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 30 transitions. [2025-03-08 22:38:25,231 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2025-03-08 22:38:25,231 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 22:38:25,232 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 22:38:25,232 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-08 22:38:25,232 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 6 more)] === [2025-03-08 22:38:25,232 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:38:25,233 INFO L85 PathProgramCache]: Analyzing trace with hash -714364211, now seen corresponding path program 1 times [2025-03-08 22:38:25,233 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:38:25,233 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1455742268] [2025-03-08 22:38:25,233 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:38:25,233 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:38:25,251 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-03-08 22:38:25,261 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-03-08 22:38:25,264 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:38:25,264 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:38:25,388 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 22:38:25,388 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 22:38:25,388 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1455742268] [2025-03-08 22:38:25,388 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1455742268] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 22:38:25,388 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 22:38:25,388 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-08 22:38:25,388 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1974951233] [2025-03-08 22:38:25,388 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 22:38:25,389 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-08 22:38:25,389 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 22:38:25,389 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-08 22:38:25,389 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2025-03-08 22:38:25,389 INFO L87 Difference]: Start difference. First operand 26 states and 30 transitions. Second operand has 8 states, 8 states have (on average 1.75) internal successors, (14), 8 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 22:38:25,426 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 22:38:25,426 INFO L93 Difference]: Finished difference Result 34 states and 38 transitions. [2025-03-08 22:38:25,426 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-08 22:38:25,426 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 1.75) internal successors, (14), 8 states have internal predecessors, (14), 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 14 [2025-03-08 22:38:25,426 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 22:38:25,426 INFO L225 Difference]: With dead ends: 34 [2025-03-08 22:38:25,426 INFO L226 Difference]: Without dead ends: 34 [2025-03-08 22:38:25,427 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2025-03-08 22:38:25,427 INFO L435 NwaCegarLoop]: 15 mSDtfsCounter, 0 mSDsluCounter, 61 mSDsCounter, 0 mSdLazyCounter, 62 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 76 SdHoareTripleChecker+Invalid, 62 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 62 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 22:38:25,427 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 76 Invalid, 62 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 62 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 22:38:25,427 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2025-03-08 22:38:25,428 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 34. [2025-03-08 22:38:25,428 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34 states, 31 states have (on average 1.2258064516129032) internal successors, (38), 33 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 22:38:25,429 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 38 transitions. [2025-03-08 22:38:25,429 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 38 transitions. Word has length 14 [2025-03-08 22:38:25,429 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 22:38:25,429 INFO L471 AbstractCegarLoop]: Abstraction has 34 states and 38 transitions. [2025-03-08 22:38:25,429 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 1.75) internal successors, (14), 8 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 22:38:25,429 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 38 transitions. [2025-03-08 22:38:25,429 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2025-03-08 22:38:25,429 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 22:38:25,429 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 22:38:25,429 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-03-08 22:38:25,429 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 6 more)] === [2025-03-08 22:38:25,430 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:38:25,430 INFO L85 PathProgramCache]: Analyzing trace with hash 1783651726, now seen corresponding path program 1 times [2025-03-08 22:38:25,430 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:38:25,430 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [749616088] [2025-03-08 22:38:25,430 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:38:25,430 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:38:25,438 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-03-08 22:38:25,447 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-03-08 22:38:25,448 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:38:25,448 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:38:25,591 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 22:38:25,591 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 22:38:25,591 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [749616088] [2025-03-08 22:38:25,591 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [749616088] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 22:38:25,592 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 22:38:25,592 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-08 22:38:25,592 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2028942473] [2025-03-08 22:38:25,592 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 22:38:25,592 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-08 22:38:25,592 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 22:38:25,592 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-08 22:38:25,593 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2025-03-08 22:38:25,593 INFO L87 Difference]: Start difference. First operand 34 states and 38 transitions. Second operand has 9 states, 9 states have (on average 1.5555555555555556) internal successors, (14), 9 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 22:38:25,636 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 22:38:25,636 INFO L93 Difference]: Finished difference Result 48 states and 52 transitions. [2025-03-08 22:38:25,636 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-08 22:38:25,637 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 1.5555555555555556) internal successors, (14), 9 states have internal predecessors, (14), 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 14 [2025-03-08 22:38:25,637 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 22:38:25,637 INFO L225 Difference]: With dead ends: 48 [2025-03-08 22:38:25,637 INFO L226 Difference]: Without dead ends: 48 [2025-03-08 22:38:25,637 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2025-03-08 22:38:25,638 INFO L435 NwaCegarLoop]: 15 mSDtfsCounter, 1 mSDsluCounter, 72 mSDsCounter, 0 mSdLazyCounter, 74 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 87 SdHoareTripleChecker+Invalid, 75 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 74 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 22:38:25,638 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 87 Invalid, 75 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 74 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 22:38:25,638 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2025-03-08 22:38:25,639 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 32. [2025-03-08 22:38:25,639 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 29 states have (on average 1.2413793103448276) internal successors, (36), 31 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-08 22:38:25,640 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 36 transitions. [2025-03-08 22:38:25,640 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 36 transitions. Word has length 14 [2025-03-08 22:38:25,640 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 22:38:25,640 INFO L471 AbstractCegarLoop]: Abstraction has 32 states and 36 transitions. [2025-03-08 22:38:25,640 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 1.5555555555555556) internal successors, (14), 9 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 22:38:25,640 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 36 transitions. [2025-03-08 22:38:25,640 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2025-03-08 22:38:25,640 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 22:38:25,641 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 22:38:25,641 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-03-08 22:38:25,641 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 6 more)] === [2025-03-08 22:38:25,641 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:38:25,641 INFO L85 PathProgramCache]: Analyzing trace with hash 1912734445, now seen corresponding path program 1 times [2025-03-08 22:38:25,641 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:38:25,641 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1740447879] [2025-03-08 22:38:25,641 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:38:25,641 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:38:25,648 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-03-08 22:38:25,653 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-03-08 22:38:25,653 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:38:25,653 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:38:25,802 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 22:38:25,802 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 22:38:25,802 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1740447879] [2025-03-08 22:38:25,803 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1740447879] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 22:38:25,803 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 22:38:25,803 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-08 22:38:25,803 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1835088738] [2025-03-08 22:38:25,803 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 22:38:25,803 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-08 22:38:25,803 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 22:38:25,804 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-08 22:38:25,804 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2025-03-08 22:38:25,804 INFO L87 Difference]: Start difference. First operand 32 states and 36 transitions. Second operand has 9 states, 9 states have (on average 1.5555555555555556) internal successors, (14), 9 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 22:38:25,856 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 22:38:25,857 INFO L93 Difference]: Finished difference Result 41 states and 46 transitions. [2025-03-08 22:38:25,857 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-08 22:38:25,857 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 1.5555555555555556) internal successors, (14), 9 states have internal predecessors, (14), 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 14 [2025-03-08 22:38:25,857 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 22:38:25,857 INFO L225 Difference]: With dead ends: 41 [2025-03-08 22:38:25,857 INFO L226 Difference]: Without dead ends: 41 [2025-03-08 22:38:25,858 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2025-03-08 22:38:25,858 INFO L435 NwaCegarLoop]: 12 mSDtfsCounter, 7 mSDsluCounter, 59 mSDsCounter, 0 mSdLazyCounter, 85 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 71 SdHoareTripleChecker+Invalid, 86 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 85 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 22:38:25,858 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 71 Invalid, 86 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 85 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 22:38:25,859 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2025-03-08 22:38:25,860 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 33. [2025-03-08 22:38:25,860 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33 states, 30 states have (on average 1.2666666666666666) internal successors, (38), 32 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 22:38:25,860 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 38 transitions. [2025-03-08 22:38:25,860 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 38 transitions. Word has length 14 [2025-03-08 22:38:25,860 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 22:38:25,860 INFO L471 AbstractCegarLoop]: Abstraction has 33 states and 38 transitions. [2025-03-08 22:38:25,860 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 1.5555555555555556) internal successors, (14), 9 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 22:38:25,860 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 38 transitions. [2025-03-08 22:38:25,861 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2025-03-08 22:38:25,861 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 22:38:25,861 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 22:38:25,861 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-03-08 22:38:25,861 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 6 more)] === [2025-03-08 22:38:25,861 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:38:25,862 INFO L85 PathProgramCache]: Analyzing trace with hash -670433228, now seen corresponding path program 1 times [2025-03-08 22:38:25,862 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:38:25,862 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1719118627] [2025-03-08 22:38:25,862 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:38:25,862 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:38:25,869 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-03-08 22:38:25,875 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-03-08 22:38:25,875 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:38:25,876 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:38:25,952 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 22:38:25,952 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 22:38:25,952 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1719118627] [2025-03-08 22:38:25,953 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1719118627] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 22:38:25,953 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 22:38:25,953 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 22:38:25,953 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1688317811] [2025-03-08 22:38:25,953 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 22:38:25,953 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 22:38:25,953 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 22:38:25,953 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 22:38:25,954 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-08 22:38:25,954 INFO L87 Difference]: Start difference. First operand 33 states and 38 transitions. Second operand has 4 states, 3 states have (on average 5.0) internal successors, (15), 4 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-08 22:38:25,966 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 22:38:25,966 INFO L93 Difference]: Finished difference Result 32 states and 37 transitions. [2025-03-08 22:38:25,967 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 22:38:25,967 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 5.0) internal successors, (15), 4 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2025-03-08 22:38:25,967 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 22:38:25,967 INFO L225 Difference]: With dead ends: 32 [2025-03-08 22:38:25,967 INFO L226 Difference]: Without dead ends: 20 [2025-03-08 22:38:25,967 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-08 22:38:25,968 INFO L435 NwaCegarLoop]: 16 mSDtfsCounter, 8 mSDsluCounter, 14 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 30 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 22:38:25,968 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 30 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 22:38:25,968 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2025-03-08 22:38:25,969 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 20. [2025-03-08 22:38:25,969 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20 states, 18 states have (on average 1.1666666666666667) internal successors, (21), 19 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 22:38:25,969 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 21 transitions. [2025-03-08 22:38:25,969 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 21 transitions. Word has length 15 [2025-03-08 22:38:25,969 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 22:38:25,970 INFO L471 AbstractCegarLoop]: Abstraction has 20 states and 21 transitions. [2025-03-08 22:38:25,970 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 5.0) internal successors, (15), 4 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-08 22:38:25,970 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 21 transitions. [2025-03-08 22:38:25,970 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2025-03-08 22:38:25,970 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 22:38:25,970 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 22:38:25,970 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-03-08 22:38:25,970 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 6 more)] === [2025-03-08 22:38:25,971 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:38:25,971 INFO L85 PathProgramCache]: Analyzing trace with hash -1442890186, now seen corresponding path program 1 times [2025-03-08 22:38:25,971 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:38:25,971 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1483070514] [2025-03-08 22:38:25,971 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:38:25,971 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:38:25,978 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-03-08 22:38:25,982 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-03-08 22:38:25,982 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:38:25,982 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:38:26,187 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 22:38:26,187 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 22:38:26,187 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1483070514] [2025-03-08 22:38:26,188 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1483070514] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 22:38:26,188 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1494549940] [2025-03-08 22:38:26,188 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:38:26,188 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 22:38:26,188 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 22:38:26,190 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 22:38:26,191 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-08 22:38:26,234 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-03-08 22:38:26,249 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-03-08 22:38:26,249 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:38:26,249 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:38:26,251 INFO L256 TraceCheckSpWp]: Trace formula consists of 139 conjuncts, 27 conjuncts are in the unsatisfiable core [2025-03-08 22:38:26,253 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 22:38:26,337 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 22:38:26,337 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 22:38:26,449 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 5 treesize of output 3 [2025-03-08 22:38:26,472 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 22:38:26,473 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1494549940] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 22:38:26,473 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 22:38:26,473 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 8] total 19 [2025-03-08 22:38:26,473 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1357845951] [2025-03-08 22:38:26,473 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 22:38:26,473 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2025-03-08 22:38:26,473 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 22:38:26,474 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2025-03-08 22:38:26,474 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=321, Unknown=0, NotChecked=0, Total=380 [2025-03-08 22:38:26,474 INFO L87 Difference]: Start difference. First operand 20 states and 21 transitions. Second operand has 20 states, 19 states have (on average 1.7894736842105263) internal successors, (34), 20 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 22:38:26,610 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 22:38:26,611 INFO L93 Difference]: Finished difference Result 25 states and 26 transitions. [2025-03-08 22:38:26,611 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-08 22:38:26,611 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 19 states have (on average 1.7894736842105263) internal successors, (34), 20 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2025-03-08 22:38:26,611 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 22:38:26,612 INFO L225 Difference]: With dead ends: 25 [2025-03-08 22:38:26,612 INFO L226 Difference]: Without dead ends: 25 [2025-03-08 22:38:26,612 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 21 SyntacticMatches, 2 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 98 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=73, Invalid=389, Unknown=0, NotChecked=0, Total=462 [2025-03-08 22:38:26,612 INFO L435 NwaCegarLoop]: 8 mSDtfsCounter, 5 mSDsluCounter, 62 mSDsCounter, 0 mSdLazyCounter, 212 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 70 SdHoareTripleChecker+Invalid, 214 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 212 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 22:38:26,612 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 70 Invalid, 214 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 212 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 22:38:26,613 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2025-03-08 22:38:26,613 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 23. [2025-03-08 22:38:26,613 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23 states, 21 states have (on average 1.1428571428571428) internal successors, (24), 22 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 22:38:26,614 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 24 transitions. [2025-03-08 22:38:26,614 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 24 transitions. Word has length 17 [2025-03-08 22:38:26,614 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 22:38:26,614 INFO L471 AbstractCegarLoop]: Abstraction has 23 states and 24 transitions. [2025-03-08 22:38:26,614 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 19 states have (on average 1.7894736842105263) internal successors, (34), 20 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 22:38:26,614 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 24 transitions. [2025-03-08 22:38:26,614 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2025-03-08 22:38:26,614 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 22:38:26,614 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 22:38:26,621 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-08 22:38:26,814 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 22:38:26,815 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 6 more)] === [2025-03-08 22:38:26,815 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:38:26,815 INFO L85 PathProgramCache]: Analyzing trace with hash -1779922857, now seen corresponding path program 1 times [2025-03-08 22:38:26,815 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:38:26,815 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1243571682] [2025-03-08 22:38:26,815 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:38:26,815 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:38:26,822 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-03-08 22:38:26,827 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-03-08 22:38:26,827 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:38:26,827 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:38:27,047 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 22:38:27,047 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 22:38:27,047 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1243571682] [2025-03-08 22:38:27,047 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1243571682] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 22:38:27,047 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [787150142] [2025-03-08 22:38:27,047 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:38:27,047 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 22:38:27,047 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 22:38:27,049 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 22:38:27,051 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-03-08 22:38:27,088 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-03-08 22:38:27,102 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-03-08 22:38:27,102 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:38:27,102 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:38:27,103 INFO L256 TraceCheckSpWp]: Trace formula consists of 145 conjuncts, 58 conjuncts are in the unsatisfiable core [2025-03-08 22:38:27,105 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 22:38:27,142 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-08 22:38:27,145 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 22:38:27,147 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-08 22:38:27,424 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 22:38:27,424 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 22:38:27,602 INFO L173 IndexEqualityManager]: detected equality via solver [2025-03-08 22:38:27,638 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 22:38:27,638 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [787150142] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 22:38:27,638 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 22:38:27,638 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 8] total 23 [2025-03-08 22:38:27,638 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [792553151] [2025-03-08 22:38:27,638 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 22:38:27,639 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2025-03-08 22:38:27,639 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 22:38:27,639 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2025-03-08 22:38:27,639 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=80, Invalid=472, Unknown=0, NotChecked=0, Total=552 [2025-03-08 22:38:27,640 INFO L87 Difference]: Start difference. First operand 23 states and 24 transitions. Second operand has 24 states, 23 states have (on average 2.260869565217391) internal successors, (52), 24 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 22:38:27,801 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 22:38:27,801 INFO L93 Difference]: Finished difference Result 26 states and 27 transitions. [2025-03-08 22:38:27,801 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-08 22:38:27,801 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 23 states have (on average 2.260869565217391) internal successors, (52), 24 states have internal predecessors, (52), 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 18 [2025-03-08 22:38:27,801 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 22:38:27,802 INFO L225 Difference]: With dead ends: 26 [2025-03-08 22:38:27,802 INFO L226 Difference]: Without dead ends: 26 [2025-03-08 22:38:27,802 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 125 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=103, Invalid=599, Unknown=0, NotChecked=0, Total=702 [2025-03-08 22:38:27,802 INFO L435 NwaCegarLoop]: 6 mSDtfsCounter, 6 mSDsluCounter, 29 mSDsCounter, 0 mSdLazyCounter, 156 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 35 SdHoareTripleChecker+Invalid, 158 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 156 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 22:38:27,802 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 35 Invalid, 158 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 156 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 22:38:27,803 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2025-03-08 22:38:27,803 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 24. [2025-03-08 22:38:27,803 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24 states, 22 states have (on average 1.1363636363636365) internal successors, (25), 23 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 22:38:27,803 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 25 transitions. [2025-03-08 22:38:27,803 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 25 transitions. Word has length 18 [2025-03-08 22:38:27,803 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 22:38:27,803 INFO L471 AbstractCegarLoop]: Abstraction has 24 states and 25 transitions. [2025-03-08 22:38:27,804 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 23 states have (on average 2.260869565217391) internal successors, (52), 24 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 22:38:27,804 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 25 transitions. [2025-03-08 22:38:27,804 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2025-03-08 22:38:27,804 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 22:38:27,804 INFO L218 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 22:38:27,810 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-03-08 22:38:28,004 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 22:38:28,004 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 6 more)] === [2025-03-08 22:38:28,005 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:38:28,005 INFO L85 PathProgramCache]: Analyzing trace with hash -15648847, now seen corresponding path program 2 times [2025-03-08 22:38:28,005 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:38:28,005 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [745341460] [2025-03-08 22:38:28,005 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-08 22:38:28,005 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:38:28,013 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 21 statements into 2 equivalence classes. [2025-03-08 22:38:28,023 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 21 of 21 statements. [2025-03-08 22:38:28,023 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-08 22:38:28,023 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:38:28,273 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 6 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 22:38:28,273 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 22:38:28,274 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [745341460] [2025-03-08 22:38:28,274 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [745341460] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 22:38:28,274 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1368166100] [2025-03-08 22:38:28,274 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-08 22:38:28,274 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 22:38:28,274 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 22:38:28,276 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 22:38:28,277 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-03-08 22:38:28,321 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 21 statements into 2 equivalence classes. [2025-03-08 22:38:28,341 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 21 of 21 statements. [2025-03-08 22:38:28,341 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-08 22:38:28,341 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:38:28,342 INFO L256 TraceCheckSpWp]: Trace formula consists of 170 conjuncts, 40 conjuncts are in the unsatisfiable core [2025-03-08 22:38:28,345 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 22:38:28,401 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2025-03-08 22:38:28,459 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 4 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 22:38:28,459 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 22:38:28,476 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 13 [2025-03-08 22:38:28,478 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 16 treesize of output 12 [2025-03-08 22:38:28,523 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 4 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 22:38:28,526 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1368166100] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 22:38:28,527 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 22:38:28,527 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 11, 11] total 23 [2025-03-08 22:38:28,527 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1116922053] [2025-03-08 22:38:28,527 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 22:38:28,527 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2025-03-08 22:38:28,527 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 22:38:28,527 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2025-03-08 22:38:28,528 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=443, Unknown=0, NotChecked=0, Total=506 [2025-03-08 22:38:28,528 INFO L87 Difference]: Start difference. First operand 24 states and 25 transitions. Second operand has 23 states, 23 states have (on average 1.6956521739130435) internal successors, (39), 23 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 22:38:28,715 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 22:38:28,715 INFO L93 Difference]: Finished difference Result 39 states and 40 transitions. [2025-03-08 22:38:28,716 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-03-08 22:38:28,716 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 23 states have (on average 1.6956521739130435) internal successors, (39), 23 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 21 [2025-03-08 22:38:28,716 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 22:38:28,716 INFO L225 Difference]: With dead ends: 39 [2025-03-08 22:38:28,716 INFO L226 Difference]: Without dead ends: 29 [2025-03-08 22:38:28,717 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 185 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=119, Invalid=811, Unknown=0, NotChecked=0, Total=930 [2025-03-08 22:38:28,717 INFO L435 NwaCegarLoop]: 8 mSDtfsCounter, 12 mSDsluCounter, 93 mSDsCounter, 0 mSdLazyCounter, 209 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 101 SdHoareTripleChecker+Invalid, 212 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 209 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 22:38:28,717 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 101 Invalid, 212 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 209 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 22:38:28,717 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2025-03-08 22:38:28,718 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 27. [2025-03-08 22:38:28,718 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 25 states have (on average 1.12) internal successors, (28), 26 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 22:38:28,718 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 28 transitions. [2025-03-08 22:38:28,718 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 28 transitions. Word has length 21 [2025-03-08 22:38:28,718 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 22:38:28,718 INFO L471 AbstractCegarLoop]: Abstraction has 27 states and 28 transitions. [2025-03-08 22:38:28,719 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 1.6956521739130435) internal successors, (39), 23 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 22:38:28,719 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 28 transitions. [2025-03-08 22:38:28,720 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2025-03-08 22:38:28,720 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 22:38:28,720 INFO L218 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 22:38:28,726 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2025-03-08 22:38:28,920 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 22:38:28,921 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 6 more)] === [2025-03-08 22:38:28,921 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:38:28,921 INFO L85 PathProgramCache]: Analyzing trace with hash -989763512, now seen corresponding path program 3 times [2025-03-08 22:38:28,921 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:38:28,921 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [109048180] [2025-03-08 22:38:28,921 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-08 22:38:28,921 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:38:28,928 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 24 statements into 3 equivalence classes. [2025-03-08 22:38:28,939 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) and asserted 24 of 24 statements. [2025-03-08 22:38:28,939 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2025-03-08 22:38:28,939 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:38:29,176 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 22:38:29,176 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 22:38:29,176 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [109048180] [2025-03-08 22:38:29,176 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [109048180] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 22:38:29,176 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1176240048] [2025-03-08 22:38:29,176 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-08 22:38:29,176 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 22:38:29,176 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 22:38:29,178 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 22:38:29,179 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-03-08 22:38:29,221 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 24 statements into 3 equivalence classes. [2025-03-08 22:38:29,239 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) and asserted 24 of 24 statements. [2025-03-08 22:38:29,239 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2025-03-08 22:38:29,239 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:38:29,240 INFO L256 TraceCheckSpWp]: Trace formula consists of 183 conjuncts, 34 conjuncts are in the unsatisfiable core [2025-03-08 22:38:29,241 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 22:38:29,377 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 1 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 22:38:29,377 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 22:38:29,525 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-08 22:38:29,562 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 1 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 22:38:29,563 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1176240048] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 22:38:29,563 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 22:38:29,563 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10, 10] total 26 [2025-03-08 22:38:29,564 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1275611004] [2025-03-08 22:38:29,564 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 22:38:29,564 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2025-03-08 22:38:29,564 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 22:38:29,564 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2025-03-08 22:38:29,565 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=96, Invalid=606, Unknown=0, NotChecked=0, Total=702 [2025-03-08 22:38:29,566 INFO L87 Difference]: Start difference. First operand 27 states and 28 transitions. Second operand has 27 states, 26 states have (on average 2.1538461538461537) internal successors, (56), 27 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 22:38:29,739 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 22:38:29,739 INFO L93 Difference]: Finished difference Result 30 states and 31 transitions. [2025-03-08 22:38:29,739 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-08 22:38:29,740 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 26 states have (on average 2.1538461538461537) internal successors, (56), 27 states have internal predecessors, (56), 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 24 [2025-03-08 22:38:29,741 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 22:38:29,741 INFO L225 Difference]: With dead ends: 30 [2025-03-08 22:38:29,741 INFO L226 Difference]: Without dead ends: 30 [2025-03-08 22:38:29,742 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 29 SyntacticMatches, 3 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 186 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=124, Invalid=746, Unknown=0, NotChecked=0, Total=870 [2025-03-08 22:38:29,743 INFO L435 NwaCegarLoop]: 9 mSDtfsCounter, 4 mSDsluCounter, 72 mSDsCounter, 0 mSdLazyCounter, 287 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 81 SdHoareTripleChecker+Invalid, 288 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 287 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 22:38:29,743 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 81 Invalid, 288 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 287 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 22:38:29,743 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2025-03-08 22:38:29,744 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 30. [2025-03-08 22:38:29,744 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 28 states have (on average 1.1071428571428572) internal successors, (31), 29 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 22:38:29,744 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 31 transitions. [2025-03-08 22:38:29,744 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 31 transitions. Word has length 24 [2025-03-08 22:38:29,744 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 22:38:29,744 INFO L471 AbstractCegarLoop]: Abstraction has 30 states and 31 transitions. [2025-03-08 22:38:29,744 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 26 states have (on average 2.1538461538461537) internal successors, (56), 27 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 22:38:29,744 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 31 transitions. [2025-03-08 22:38:29,744 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2025-03-08 22:38:29,744 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 22:38:29,744 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 22:38:29,754 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2025-03-08 22:38:29,946 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,SelfDestructingSolverStorable21 [2025-03-08 22:38:29,946 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 6 more)] === [2025-03-08 22:38:29,947 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:38:29,947 INFO L85 PathProgramCache]: Analyzing trace with hash -617897851, now seen corresponding path program 2 times [2025-03-08 22:38:29,947 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:38:29,947 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [600959935] [2025-03-08 22:38:29,947 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-08 22:38:29,947 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:38:29,954 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 25 statements into 2 equivalence classes. [2025-03-08 22:38:29,961 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 25 of 25 statements. [2025-03-08 22:38:29,961 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-08 22:38:29,961 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:38:30,238 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 22:38:30,238 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 22:38:30,238 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [600959935] [2025-03-08 22:38:30,238 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [600959935] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 22:38:30,238 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [28335747] [2025-03-08 22:38:30,238 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-08 22:38:30,238 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 22:38:30,239 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 22:38:30,240 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 22:38:30,242 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-03-08 22:38:30,288 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 25 statements into 2 equivalence classes. [2025-03-08 22:38:30,316 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 25 of 25 statements. [2025-03-08 22:38:30,316 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-08 22:38:30,316 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:38:30,318 INFO L256 TraceCheckSpWp]: Trace formula consists of 189 conjuncts, 74 conjuncts are in the unsatisfiable core [2025-03-08 22:38:30,320 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 22:38:30,350 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-08 22:38:30,352 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 22:38:30,353 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-08 22:38:30,737 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 22:38:30,737 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 22:38:31,016 INFO L173 IndexEqualityManager]: detected equality via solver [2025-03-08 22:38:31,050 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 22:38:31,050 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [28335747] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 22:38:31,050 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 22:38:31,050 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 12, 12] total 33 [2025-03-08 22:38:31,050 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [227094851] [2025-03-08 22:38:31,050 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 22:38:31,050 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2025-03-08 22:38:31,050 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 22:38:31,051 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2025-03-08 22:38:31,051 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=125, Invalid=997, Unknown=0, NotChecked=0, Total=1122 [2025-03-08 22:38:31,051 INFO L87 Difference]: Start difference. First operand 30 states and 31 transitions. Second operand has 34 states, 33 states have (on average 2.212121212121212) internal successors, (73), 34 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 22:38:31,397 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 22:38:31,397 INFO L93 Difference]: Finished difference Result 36 states and 38 transitions. [2025-03-08 22:38:31,398 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-03-08 22:38:31,398 INFO L78 Accepts]: Start accepts. Automaton has has 34 states, 33 states have (on average 2.212121212121212) internal successors, (73), 34 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 25 [2025-03-08 22:38:31,398 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 22:38:31,398 INFO L225 Difference]: With dead ends: 36 [2025-03-08 22:38:31,398 INFO L226 Difference]: Without dead ends: 36 [2025-03-08 22:38:31,399 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 342 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=172, Invalid=1310, Unknown=0, NotChecked=0, Total=1482 [2025-03-08 22:38:31,399 INFO L435 NwaCegarLoop]: 7 mSDtfsCounter, 14 mSDsluCounter, 76 mSDsCounter, 0 mSdLazyCounter, 438 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 83 SdHoareTripleChecker+Invalid, 442 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 438 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-08 22:38:31,399 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 83 Invalid, 442 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 438 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-08 22:38:31,399 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2025-03-08 22:38:31,400 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 31. [2025-03-08 22:38:31,400 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31 states, 29 states have (on average 1.103448275862069) internal successors, (32), 30 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 22:38:31,400 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 32 transitions. [2025-03-08 22:38:31,400 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 32 transitions. Word has length 25 [2025-03-08 22:38:31,400 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 22:38:31,400 INFO L471 AbstractCegarLoop]: Abstraction has 31 states and 32 transitions. [2025-03-08 22:38:31,400 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 34 states, 33 states have (on average 2.212121212121212) internal successors, (73), 34 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 22:38:31,400 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 32 transitions. [2025-03-08 22:38:31,401 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2025-03-08 22:38:31,401 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 22:38:31,401 INFO L218 NwaCegarLoop]: trace histogram [4, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 22:38:31,408 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2025-03-08 22:38:31,601 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 22:38:31,601 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 6 more)] === [2025-03-08 22:38:31,602 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:38:31,602 INFO L85 PathProgramCache]: Analyzing trace with hash 434899139, now seen corresponding path program 4 times [2025-03-08 22:38:31,602 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:38:31,602 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1548869739] [2025-03-08 22:38:31,602 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-08 22:38:31,602 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:38:31,608 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 28 statements into 2 equivalence classes. [2025-03-08 22:38:31,619 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) and asserted 24 of 28 statements. [2025-03-08 22:38:31,619 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) [2025-03-08 22:38:31,619 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:38:32,454 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 3 proven. 18 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-08 22:38:32,454 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 22:38:32,454 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1548869739] [2025-03-08 22:38:32,454 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1548869739] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 22:38:32,454 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [360355681] [2025-03-08 22:38:32,454 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-08 22:38:32,454 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 22:38:32,454 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 22:38:32,456 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 22:38:32,458 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2025-03-08 22:38:32,506 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 28 statements into 2 equivalence classes. [2025-03-08 22:38:32,525 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) and asserted 24 of 28 statements. [2025-03-08 22:38:32,525 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) [2025-03-08 22:38:32,525 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:38:32,532 INFO L256 TraceCheckSpWp]: Trace formula consists of 170 conjuncts, 53 conjuncts are in the unsatisfiable core [2025-03-08 22:38:32,534 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 22:38:32,548 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 10 [2025-03-08 22:38:33,119 INFO L349 Elim1Store]: treesize reduction 8, result has 75.8 percent of original size [2025-03-08 22:38:33,119 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 40 treesize of output 39 [2025-03-08 22:38:33,173 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 8 proven. 10 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-03-08 22:38:33,173 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 22:38:33,614 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 38 [2025-03-08 22:38:33,620 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 68 treesize of output 58 [2025-03-08 22:38:33,630 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 5 treesize of output 3 [2025-03-08 22:38:33,644 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-03-08 22:38:33,644 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [360355681] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 22:38:33,644 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 22:38:33,644 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 14, 14] total 39 [2025-03-08 22:38:33,644 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1464114316] [2025-03-08 22:38:33,644 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 22:38:33,644 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 40 states [2025-03-08 22:38:33,644 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 22:38:33,645 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2025-03-08 22:38:33,645 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=186, Invalid=1374, Unknown=0, NotChecked=0, Total=1560 [2025-03-08 22:38:33,646 INFO L87 Difference]: Start difference. First operand 31 states and 32 transitions. Second operand has 40 states, 39 states have (on average 1.4871794871794872) internal successors, (58), 40 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 22:38:33,974 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 22:38:33,974 INFO L93 Difference]: Finished difference Result 30 states and 31 transitions. [2025-03-08 22:38:33,974 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2025-03-08 22:38:33,975 INFO L78 Accepts]: Start accepts. Automaton has has 40 states, 39 states have (on average 1.4871794871794872) internal successors, (58), 40 states have internal predecessors, (58), 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 28 [2025-03-08 22:38:33,975 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 22:38:33,975 INFO L225 Difference]: With dead ends: 30 [2025-03-08 22:38:33,975 INFO L226 Difference]: Without dead ends: 30 [2025-03-08 22:38:33,975 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 34 SyntacticMatches, 1 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 515 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=235, Invalid=1571, Unknown=0, NotChecked=0, Total=1806 [2025-03-08 22:38:33,976 INFO L435 NwaCegarLoop]: 4 mSDtfsCounter, 6 mSDsluCounter, 66 mSDsCounter, 0 mSdLazyCounter, 374 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 70 SdHoareTripleChecker+Invalid, 375 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 374 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-08 22:38:33,976 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 70 Invalid, 375 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 374 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-08 22:38:33,976 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2025-03-08 22:38:33,976 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 30. [2025-03-08 22:38:33,977 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 29 states have (on average 1.0689655172413792) internal successors, (31), 29 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 22:38:33,977 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 31 transitions. [2025-03-08 22:38:33,977 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 31 transitions. Word has length 28 [2025-03-08 22:38:33,977 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 22:38:33,977 INFO L471 AbstractCegarLoop]: Abstraction has 30 states and 31 transitions. [2025-03-08 22:38:33,977 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 40 states, 39 states have (on average 1.4871794871794872) internal successors, (58), 40 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 22:38:33,977 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 31 transitions. [2025-03-08 22:38:33,977 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2025-03-08 22:38:33,977 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 22:38:33,977 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 22:38:33,983 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2025-03-08 22:38:34,181 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 22:38:34,181 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 6 more)] === [2025-03-08 22:38:34,181 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:38:34,181 INFO L85 PathProgramCache]: Analyzing trace with hash 596971370, now seen corresponding path program 3 times [2025-03-08 22:38:34,181 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:38:34,181 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2038483307] [2025-03-08 22:38:34,181 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-08 22:38:34,181 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:38:34,187 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 29 statements into 4 equivalence classes. [2025-03-08 22:38:34,199 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) and asserted 29 of 29 statements. [2025-03-08 22:38:34,200 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2025-03-08 22:38:34,200 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:38:34,461 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 13 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 22:38:34,461 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 22:38:34,461 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2038483307] [2025-03-08 22:38:34,462 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2038483307] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 22:38:34,462 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [522603115] [2025-03-08 22:38:34,462 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-08 22:38:34,462 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 22:38:34,462 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 22:38:34,464 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 22:38:34,465 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2025-03-08 22:38:34,513 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 29 statements into 4 equivalence classes. [2025-03-08 22:38:34,541 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) and asserted 29 of 29 statements. [2025-03-08 22:38:34,541 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2025-03-08 22:38:34,541 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:38:34,542 INFO L256 TraceCheckSpWp]: Trace formula consists of 220 conjuncts, 56 conjuncts are in the unsatisfiable core [2025-03-08 22:38:34,544 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 22:38:34,607 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2025-03-08 22:38:34,686 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 3 [2025-03-08 22:38:34,699 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 9 proven. 17 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 22:38:34,699 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 22:38:34,750 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 13 [2025-03-08 22:38:34,752 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 16 treesize of output 12 [2025-03-08 22:38:34,797 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 9 proven. 17 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 22:38:34,797 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [522603115] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 22:38:34,797 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 22:38:34,797 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 13, 13] total 30 [2025-03-08 22:38:34,797 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2029662600] [2025-03-08 22:38:34,797 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 22:38:34,798 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2025-03-08 22:38:34,798 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 22:38:34,798 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2025-03-08 22:38:34,798 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=88, Invalid=782, Unknown=0, NotChecked=0, Total=870 [2025-03-08 22:38:34,798 INFO L87 Difference]: Start difference. First operand 30 states and 31 transitions. Second operand has 30 states, 30 states have (on average 2.0) internal successors, (60), 30 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 22:38:35,152 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 22:38:35,153 INFO L93 Difference]: Finished difference Result 49 states and 50 transitions. [2025-03-08 22:38:35,153 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2025-03-08 22:38:35,153 INFO L78 Accepts]: Start accepts. Automaton has has 30 states, 30 states have (on average 2.0) internal successors, (60), 30 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 29 [2025-03-08 22:38:35,153 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 22:38:35,153 INFO L225 Difference]: With dead ends: 49 [2025-03-08 22:38:35,153 INFO L226 Difference]: Without dead ends: 35 [2025-03-08 22:38:35,154 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 515 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=184, Invalid=1708, Unknown=0, NotChecked=0, Total=1892 [2025-03-08 22:38:35,154 INFO L435 NwaCegarLoop]: 7 mSDtfsCounter, 11 mSDsluCounter, 101 mSDsCounter, 0 mSdLazyCounter, 413 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 108 SdHoareTripleChecker+Invalid, 415 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 413 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-08 22:38:35,154 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 108 Invalid, 415 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 413 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-08 22:38:35,155 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2025-03-08 22:38:35,155 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 33. [2025-03-08 22:38:35,155 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33 states, 32 states have (on average 1.0625) internal successors, (34), 32 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 22:38:35,155 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 34 transitions. [2025-03-08 22:38:35,155 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 34 transitions. Word has length 29 [2025-03-08 22:38:35,155 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 22:38:35,155 INFO L471 AbstractCegarLoop]: Abstraction has 33 states and 34 transitions. [2025-03-08 22:38:35,155 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 30 states have (on average 2.0) internal successors, (60), 30 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 22:38:35,156 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 34 transitions. [2025-03-08 22:38:35,156 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2025-03-08 22:38:35,156 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 22:38:35,156 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 22:38:35,162 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-08 22:38:35,356 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,SelfDestructingSolverStorable24 [2025-03-08 22:38:35,357 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 6 more)] === [2025-03-08 22:38:35,357 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:38:35,357 INFO L85 PathProgramCache]: Analyzing trace with hash 1119009025, now seen corresponding path program 4 times [2025-03-08 22:38:35,357 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:38:35,357 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1274879881] [2025-03-08 22:38:35,357 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-08 22:38:35,357 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:38:35,366 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 32 statements into 2 equivalence classes. [2025-03-08 22:38:35,380 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 32 of 32 statements. [2025-03-08 22:38:35,380 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-03-08 22:38:35,380 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:38:35,773 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 2 proven. 31 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 22:38:35,773 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 22:38:35,773 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1274879881] [2025-03-08 22:38:35,773 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1274879881] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 22:38:35,773 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [487897708] [2025-03-08 22:38:35,773 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-08 22:38:35,773 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 22:38:35,773 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 22:38:35,775 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 22:38:35,776 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2025-03-08 22:38:35,825 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 32 statements into 2 equivalence classes. [2025-03-08 22:38:35,852 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 32 of 32 statements. [2025-03-08 22:38:35,852 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-03-08 22:38:35,852 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:38:35,854 INFO L256 TraceCheckSpWp]: Trace formula consists of 233 conjuncts, 83 conjuncts are in the unsatisfiable core [2025-03-08 22:38:35,856 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 22:38:35,895 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-08 22:38:35,898 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 22:38:35,899 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-08 22:38:36,370 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 5 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 22:38:36,371 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 22:38:36,718 INFO L173 IndexEqualityManager]: detected equality via solver [2025-03-08 22:38:36,756 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 12 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 22:38:36,756 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [487897708] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 22:38:36,756 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 22:38:36,756 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 12, 12] total 37 [2025-03-08 22:38:36,756 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [758654236] [2025-03-08 22:38:36,756 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 22:38:36,756 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 38 states [2025-03-08 22:38:36,756 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 22:38:36,757 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2025-03-08 22:38:36,757 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=146, Invalid=1260, Unknown=0, NotChecked=0, Total=1406 [2025-03-08 22:38:36,757 INFO L87 Difference]: Start difference. First operand 33 states and 34 transitions. Second operand has 38 states, 37 states have (on average 2.5405405405405403) internal successors, (94), 38 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 22:38:37,115 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 22:38:37,115 INFO L93 Difference]: Finished difference Result 37 states and 38 transitions. [2025-03-08 22:38:37,115 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-03-08 22:38:37,116 INFO L78 Accepts]: Start accepts. Automaton has has 38 states, 37 states have (on average 2.5405405405405403) internal successors, (94), 38 states have internal predecessors, (94), 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 32 [2025-03-08 22:38:37,116 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 22:38:37,116 INFO L225 Difference]: With dead ends: 37 [2025-03-08 22:38:37,116 INFO L226 Difference]: Without dead ends: 37 [2025-03-08 22:38:37,117 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 41 SyntacticMatches, 0 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 400 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=222, Invalid=1758, Unknown=0, NotChecked=0, Total=1980 [2025-03-08 22:38:37,117 INFO L435 NwaCegarLoop]: 7 mSDtfsCounter, 6 mSDsluCounter, 74 mSDsCounter, 0 mSdLazyCounter, 449 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 81 SdHoareTripleChecker+Invalid, 451 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 449 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-08 22:38:37,117 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 81 Invalid, 451 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 449 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-08 22:38:37,117 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2025-03-08 22:38:37,118 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 37. [2025-03-08 22:38:37,118 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 37 states, 36 states have (on average 1.0555555555555556) internal successors, (38), 36 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 22:38:37,118 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 38 transitions. [2025-03-08 22:38:37,118 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 38 transitions. Word has length 32 [2025-03-08 22:38:37,118 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 22:38:37,118 INFO L471 AbstractCegarLoop]: Abstraction has 37 states and 38 transitions. [2025-03-08 22:38:37,118 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 38 states, 37 states have (on average 2.5405405405405403) internal successors, (94), 38 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 22:38:37,118 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 38 transitions. [2025-03-08 22:38:37,121 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2025-03-08 22:38:37,121 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 22:38:37,121 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 4, 4, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 22:38:37,131 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-08 22:38:37,326 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,SelfDestructingSolverStorable25 [2025-03-08 22:38:37,326 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 6 more)] === [2025-03-08 22:38:37,326 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:38:37,326 INFO L85 PathProgramCache]: Analyzing trace with hash -928806426, now seen corresponding path program 5 times [2025-03-08 22:38:37,326 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:38:37,326 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2094025662] [2025-03-08 22:38:37,326 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-08 22:38:37,326 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:38:37,332 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 36 statements into 5 equivalence classes. [2025-03-08 22:38:37,341 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 5 check-sat command(s) and asserted 36 of 36 statements. [2025-03-08 22:38:37,341 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 5 check-sat command(s) [2025-03-08 22:38:37,341 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:38:37,644 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 24 proven. 24 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 22:38:37,644 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 22:38:37,644 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2094025662] [2025-03-08 22:38:37,644 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2094025662] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 22:38:37,644 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1672895837] [2025-03-08 22:38:37,644 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-08 22:38:37,644 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 22:38:37,645 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 22:38:37,648 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-08 22:38:37,649 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-08 22:38:37,700 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 36 statements into 5 equivalence classes. [2025-03-08 22:38:37,744 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 5 check-sat command(s) and asserted 36 of 36 statements. [2025-03-08 22:38:37,744 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 5 check-sat command(s) [2025-03-08 22:38:37,744 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:38:37,746 INFO L256 TraceCheckSpWp]: Trace formula consists of 264 conjuncts, 58 conjuncts are in the unsatisfiable core [2025-03-08 22:38:37,748 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 22:38:37,845 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2025-03-08 22:38:37,954 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 12 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 22:38:37,954 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 22:38:37,977 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 13 [2025-03-08 22:38:37,980 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 16 treesize of output 12 [2025-03-08 22:38:38,047 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 12 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 22:38:38,048 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1672895837] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 22:38:38,048 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 22:38:38,048 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 15, 15] total 32 [2025-03-08 22:38:38,048 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1390202237] [2025-03-08 22:38:38,048 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 22:38:38,048 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2025-03-08 22:38:38,048 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 22:38:38,048 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2025-03-08 22:38:38,048 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=82, Invalid=910, Unknown=0, NotChecked=0, Total=992 [2025-03-08 22:38:38,049 INFO L87 Difference]: Start difference. First operand 37 states and 38 transitions. Second operand has 32 states, 32 states have (on average 2.21875) internal successors, (71), 32 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 22:38:38,494 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 22:38:38,495 INFO L93 Difference]: Finished difference Result 60 states and 61 transitions. [2025-03-08 22:38:38,495 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2025-03-08 22:38:38,495 INFO L78 Accepts]: Start accepts. Automaton has has 32 states, 32 states have (on average 2.21875) internal successors, (71), 32 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 36 [2025-03-08 22:38:38,495 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 22:38:38,495 INFO L225 Difference]: With dead ends: 60 [2025-03-08 22:38:38,495 INFO L226 Difference]: Without dead ends: 42 [2025-03-08 22:38:38,496 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 105 GetRequests, 57 SyntacticMatches, 0 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 446 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=209, Invalid=2241, Unknown=0, NotChecked=0, Total=2450 [2025-03-08 22:38:38,496 INFO L435 NwaCegarLoop]: 9 mSDtfsCounter, 18 mSDsluCounter, 152 mSDsCounter, 0 mSdLazyCounter, 624 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 161 SdHoareTripleChecker+Invalid, 632 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 624 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-08 22:38:38,497 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [18 Valid, 161 Invalid, 632 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 624 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-08 22:38:38,497 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2025-03-08 22:38:38,498 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 40. [2025-03-08 22:38:38,498 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 40 states, 39 states have (on average 1.0512820512820513) internal successors, (41), 39 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 22:38:38,498 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 41 transitions. [2025-03-08 22:38:38,498 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 41 transitions. Word has length 36 [2025-03-08 22:38:38,498 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 22:38:38,498 INFO L471 AbstractCegarLoop]: Abstraction has 40 states and 41 transitions. [2025-03-08 22:38:38,498 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 32 states have (on average 2.21875) internal successors, (71), 32 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 22:38:38,498 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 41 transitions. [2025-03-08 22:38:38,498 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2025-03-08 22:38:38,499 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 22:38:38,499 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 22:38:38,505 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Ended with exit code 0 [2025-03-08 22:38:38,699 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable26 [2025-03-08 22:38:38,699 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 6 more)] === [2025-03-08 22:38:38,699 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:38:38,700 INFO L85 PathProgramCache]: Analyzing trace with hash -883476369, now seen corresponding path program 6 times [2025-03-08 22:38:38,700 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:38:38,700 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1227570462] [2025-03-08 22:38:38,700 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-03-08 22:38:38,700 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:38:38,706 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 39 statements into 5 equivalence classes. [2025-03-08 22:38:38,719 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 5 check-sat command(s) and asserted 39 of 39 statements. [2025-03-08 22:38:38,720 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 5 check-sat command(s) [2025-03-08 22:38:38,720 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:38:39,094 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 5 proven. 53 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 22:38:39,094 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 22:38:39,094 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1227570462] [2025-03-08 22:38:39,094 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1227570462] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 22:38:39,094 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [292030048] [2025-03-08 22:38:39,094 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-03-08 22:38:39,094 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 22:38:39,094 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 22:38:39,096 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 22:38:39,097 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2025-03-08 22:38:39,150 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 39 statements into 5 equivalence classes. [2025-03-08 22:38:39,200 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 5 check-sat command(s) and asserted 39 of 39 statements. [2025-03-08 22:38:39,200 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 5 check-sat command(s) [2025-03-08 22:38:39,200 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:38:39,205 INFO L256 TraceCheckSpWp]: Trace formula consists of 277 conjuncts, 95 conjuncts are in the unsatisfiable core [2025-03-08 22:38:39,207 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 22:38:39,234 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2025-03-08 22:38:39,240 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-08 22:38:39,698 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 12 proven. 46 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 22:38:39,698 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 22:38:40,174 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 22 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 22:38:40,174 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [292030048] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 22:38:40,174 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 22:38:40,174 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 14, 14] total 42 [2025-03-08 22:38:40,174 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2004329280] [2025-03-08 22:38:40,174 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 22:38:40,174 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 43 states [2025-03-08 22:38:40,175 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 22:38:40,176 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2025-03-08 22:38:40,177 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=158, Invalid=1648, Unknown=0, NotChecked=0, Total=1806 [2025-03-08 22:38:40,177 INFO L87 Difference]: Start difference. First operand 40 states and 41 transitions. Second operand has 43 states, 42 states have (on average 2.738095238095238) internal successors, (115), 43 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 22:38:40,677 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 22:38:40,677 INFO L93 Difference]: Finished difference Result 45 states and 46 transitions. [2025-03-08 22:38:40,678 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2025-03-08 22:38:40,678 INFO L78 Accepts]: Start accepts. Automaton has has 43 states, 42 states have (on average 2.738095238095238) internal successors, (115), 43 states have internal predecessors, (115), 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 39 [2025-03-08 22:38:40,678 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 22:38:40,678 INFO L225 Difference]: With dead ends: 45 [2025-03-08 22:38:40,678 INFO L226 Difference]: Without dead ends: 45 [2025-03-08 22:38:40,679 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 103 GetRequests, 51 SyntacticMatches, 0 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 563 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=282, Invalid=2580, Unknown=0, NotChecked=0, Total=2862 [2025-03-08 22:38:40,679 INFO L435 NwaCegarLoop]: 8 mSDtfsCounter, 10 mSDsluCounter, 115 mSDsCounter, 0 mSdLazyCounter, 705 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 123 SdHoareTripleChecker+Invalid, 707 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 705 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-08 22:38:40,679 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 123 Invalid, 707 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 705 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-08 22:38:40,679 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2025-03-08 22:38:40,680 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 44. [2025-03-08 22:38:40,680 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 44 states, 43 states have (on average 1.0465116279069768) internal successors, (45), 43 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 22:38:40,680 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 45 transitions. [2025-03-08 22:38:40,680 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 45 transitions. Word has length 39 [2025-03-08 22:38:40,680 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 22:38:40,680 INFO L471 AbstractCegarLoop]: Abstraction has 44 states and 45 transitions. [2025-03-08 22:38:40,681 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 43 states, 42 states have (on average 2.738095238095238) internal successors, (115), 43 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 22:38:40,681 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 45 transitions. [2025-03-08 22:38:40,681 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2025-03-08 22:38:40,681 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 22:38:40,681 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 5, 5, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 22:38:40,693 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2025-03-08 22:38:40,881 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable27 [2025-03-08 22:38:40,881 INFO L396 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 6 more)] === [2025-03-08 22:38:40,882 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:38:40,882 INFO L85 PathProgramCache]: Analyzing trace with hash 1660854868, now seen corresponding path program 7 times [2025-03-08 22:38:40,882 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:38:40,882 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1736084595] [2025-03-08 22:38:40,882 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-03-08 22:38:40,882 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:38:40,889 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 43 statements into 1 equivalence classes. [2025-03-08 22:38:40,899 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 43 of 43 statements. [2025-03-08 22:38:40,899 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:38:40,899 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:38:41,292 INFO L134 CoverageAnalysis]: Checked inductivity of 77 backedges. 41 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 22:38:41,292 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 22:38:41,292 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1736084595] [2025-03-08 22:38:41,292 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1736084595] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 22:38:41,292 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1049383676] [2025-03-08 22:38:41,292 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-03-08 22:38:41,293 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 22:38:41,293 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 22:38:41,295 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 22:38:41,296 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2025-03-08 22:38:41,354 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 43 statements into 1 equivalence classes. [2025-03-08 22:38:41,378 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 43 of 43 statements. [2025-03-08 22:38:41,378 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:38:41,378 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:38:41,379 INFO L256 TraceCheckSpWp]: Trace formula consists of 308 conjuncts, 68 conjuncts are in the unsatisfiable core [2025-03-08 22:38:41,381 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 22:38:41,473 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2025-03-08 22:38:41,623 INFO L134 CoverageAnalysis]: Checked inductivity of 77 backedges. 15 proven. 62 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 22:38:41,623 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 22:38:41,644 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 13 [2025-03-08 22:38:41,646 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 16 treesize of output 12 [2025-03-08 22:38:41,697 INFO L134 CoverageAnalysis]: Checked inductivity of 77 backedges. 15 proven. 62 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 22:38:41,697 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1049383676] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 22:38:41,697 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 22:38:41,697 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 17, 17] total 35 [2025-03-08 22:38:41,697 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1139881186] [2025-03-08 22:38:41,697 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 22:38:41,698 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2025-03-08 22:38:41,698 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 22:38:41,698 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2025-03-08 22:38:41,698 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=90, Invalid=1100, Unknown=0, NotChecked=0, Total=1190 [2025-03-08 22:38:41,698 INFO L87 Difference]: Start difference. First operand 44 states and 45 transitions. Second operand has 35 states, 35 states have (on average 2.4285714285714284) internal successors, (85), 35 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-08 22:38:42,225 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 22:38:42,225 INFO L93 Difference]: Finished difference Result 71 states and 72 transitions. [2025-03-08 22:38:42,226 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2025-03-08 22:38:42,226 INFO L78 Accepts]: Start accepts. Automaton has has 35 states, 35 states have (on average 2.4285714285714284) internal successors, (85), 35 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-08 22:38:42,226 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 22:38:42,226 INFO L225 Difference]: With dead ends: 71 [2025-03-08 22:38:42,227 INFO L226 Difference]: Without dead ends: 49 [2025-03-08 22:38:42,227 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 120 GetRequests, 69 SyntacticMatches, 0 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 454 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=216, Invalid=2540, Unknown=0, NotChecked=0, Total=2756 [2025-03-08 22:38:42,228 INFO L435 NwaCegarLoop]: 10 mSDtfsCounter, 10 mSDsluCounter, 180 mSDsCounter, 0 mSdLazyCounter, 795 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 190 SdHoareTripleChecker+Invalid, 807 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 795 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-08 22:38:42,228 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 190 Invalid, 807 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 795 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-08 22:38:42,228 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2025-03-08 22:38:42,229 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 47. [2025-03-08 22:38:42,229 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 47 states, 46 states have (on average 1.0434782608695652) internal successors, (48), 46 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 22:38:42,229 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 48 transitions. [2025-03-08 22:38:42,229 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 48 transitions. Word has length 43 [2025-03-08 22:38:42,229 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 22:38:42,229 INFO L471 AbstractCegarLoop]: Abstraction has 47 states and 48 transitions. [2025-03-08 22:38:42,229 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 35 states, 35 states have (on average 2.4285714285714284) internal successors, (85), 35 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-08 22:38:42,234 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 48 transitions. [2025-03-08 22:38:42,234 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2025-03-08 22:38:42,234 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 22:38:42,234 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 22:38:42,241 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Ended with exit code 0 [2025-03-08 22:38:42,434 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable28 [2025-03-08 22:38:42,435 INFO L396 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 6 more)] === [2025-03-08 22:38:42,435 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:38:42,435 INFO L85 PathProgramCache]: Analyzing trace with hash 619460523, now seen corresponding path program 8 times [2025-03-08 22:38:42,435 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:38:42,435 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [930504749] [2025-03-08 22:38:42,435 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-08 22:38:42,436 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:38:42,443 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 46 statements into 2 equivalence classes. [2025-03-08 22:38:42,450 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 46 of 46 statements. [2025-03-08 22:38:42,450 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-08 22:38:42,450 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:38:42,907 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 12 proven. 78 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 22:38:42,907 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 22:38:42,907 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [930504749] [2025-03-08 22:38:42,907 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [930504749] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 22:38:42,907 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1346437384] [2025-03-08 22:38:42,907 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-08 22:38:42,907 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 22:38:42,907 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 22:38:42,909 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 22:38:42,909 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2025-03-08 22:38:42,966 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 46 statements into 2 equivalence classes. [2025-03-08 22:38:42,991 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 46 of 46 statements. [2025-03-08 22:38:42,991 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-08 22:38:42,992 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:38:42,993 INFO L256 TraceCheckSpWp]: Trace formula consists of 321 conjuncts, 117 conjuncts are in the unsatisfiable core [2025-03-08 22:38:42,995 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 22:38:43,027 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-08 22:38:43,029 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 22:38:43,031 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-08 22:38:43,747 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 0 proven. 90 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 22:38:43,747 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 22:38:44,286 INFO L173 IndexEqualityManager]: detected equality via solver [2025-03-08 22:38:44,321 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 0 proven. 90 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 22:38:44,321 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1346437384] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 22:38:44,321 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 22:38:44,321 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 19, 19] total 54 [2025-03-08 22:38:44,321 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1811963505] [2025-03-08 22:38:44,321 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 22:38:44,321 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 55 states [2025-03-08 22:38:44,321 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 22:38:44,322 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 55 interpolants. [2025-03-08 22:38:44,322 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=295, Invalid=2675, Unknown=0, NotChecked=0, Total=2970 [2025-03-08 22:38:44,323 INFO L87 Difference]: Start difference. First operand 47 states and 48 transitions. Second operand has 55 states, 54 states have (on average 2.5185185185185186) internal successors, (136), 55 states have internal predecessors, (136), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 22:38:44,924 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 22:38:44,924 INFO L93 Difference]: Finished difference Result 56 states and 58 transitions. [2025-03-08 22:38:44,924 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2025-03-08 22:38:44,924 INFO L78 Accepts]: Start accepts. Automaton has has 55 states, 54 states have (on average 2.5185185185185186) internal successors, (136), 55 states have internal predecessors, (136), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 46 [2025-03-08 22:38:44,924 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 22:38:44,925 INFO L225 Difference]: With dead ends: 56 [2025-03-08 22:38:44,925 INFO L226 Difference]: Without dead ends: 56 [2025-03-08 22:38:44,926 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 118 GetRequests, 55 SyntacticMatches, 0 SemanticMatches, 63 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1175 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=406, Invalid=3754, Unknown=0, NotChecked=0, Total=4160 [2025-03-08 22:38:44,926 INFO L435 NwaCegarLoop]: 9 mSDtfsCounter, 15 mSDsluCounter, 123 mSDsCounter, 0 mSdLazyCounter, 850 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 132 SdHoareTripleChecker+Invalid, 854 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 850 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-08 22:38:44,926 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 132 Invalid, 854 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 850 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-08 22:38:44,927 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2025-03-08 22:38:44,927 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 51. [2025-03-08 22:38:44,927 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 51 states, 50 states have (on average 1.04) internal successors, (52), 50 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 22:38:44,928 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 52 transitions. [2025-03-08 22:38:44,928 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 52 transitions. Word has length 46 [2025-03-08 22:38:44,928 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 22:38:44,928 INFO L471 AbstractCegarLoop]: Abstraction has 51 states and 52 transitions. [2025-03-08 22:38:44,928 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 55 states, 54 states have (on average 2.5185185185185186) internal successors, (136), 55 states have internal predecessors, (136), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 22:38:44,928 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 52 transitions. [2025-03-08 22:38:44,928 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2025-03-08 22:38:44,928 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 22:38:44,929 INFO L218 NwaCegarLoop]: trace histogram [7, 7, 6, 6, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 22:38:44,950 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Ended with exit code 0 [2025-03-08 22:38:45,129 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29,14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 22:38:45,129 INFO L396 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 6 more)] === [2025-03-08 22:38:45,130 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:38:45,130 INFO L85 PathProgramCache]: Analyzing trace with hash -548822128, now seen corresponding path program 9 times [2025-03-08 22:38:45,130 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:38:45,130 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [930080171] [2025-03-08 22:38:45,130 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-08 22:38:45,130 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:38:45,136 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 50 statements into 7 equivalence classes. [2025-03-08 22:38:45,154 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 7 check-sat command(s) and asserted 50 of 50 statements. [2025-03-08 22:38:45,154 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 7 check-sat command(s) [2025-03-08 22:38:45,154 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:38:45,666 INFO L134 CoverageAnalysis]: Checked inductivity of 113 backedges. 61 proven. 52 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 22:38:45,666 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 22:38:45,666 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [930080171] [2025-03-08 22:38:45,666 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [930080171] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 22:38:45,666 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [638844882] [2025-03-08 22:38:45,666 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-08 22:38:45,666 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 22:38:45,666 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 22:38:45,668 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 22:38:45,668 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2025-03-08 22:38:45,726 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 50 statements into 7 equivalence classes. [2025-03-08 22:38:45,844 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 7 check-sat command(s) and asserted 50 of 50 statements. [2025-03-08 22:38:45,844 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 7 check-sat command(s) [2025-03-08 22:38:45,844 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:38:45,847 INFO L256 TraceCheckSpWp]: Trace formula consists of 352 conjuncts, 119 conjuncts are in the unsatisfiable core [2025-03-08 22:38:45,849 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 22:38:46,021 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-03-08 22:38:46,258 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2025-03-08 22:38:46,279 INFO L134 CoverageAnalysis]: Checked inductivity of 113 backedges. 18 proven. 95 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 22:38:46,279 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 22:38:46,487 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 13 [2025-03-08 22:38:46,488 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 16 treesize of output 12 [2025-03-08 22:38:46,695 INFO L134 CoverageAnalysis]: Checked inductivity of 113 backedges. 18 proven. 95 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 22:38:46,695 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [638844882] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 22:38:46,695 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 22:38:46,695 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 19, 19] total 57 [2025-03-08 22:38:46,695 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1399224303] [2025-03-08 22:38:46,695 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 22:38:46,696 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 57 states [2025-03-08 22:38:46,696 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 22:38:46,696 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 57 interpolants. [2025-03-08 22:38:46,697 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=179, Invalid=3013, Unknown=0, NotChecked=0, Total=3192 [2025-03-08 22:38:46,697 INFO L87 Difference]: Start difference. First operand 51 states and 52 transitions. Second operand has 57 states, 57 states have (on average 2.3859649122807016) internal successors, (136), 57 states have internal predecessors, (136), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 22:38:47,763 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 22:38:47,767 INFO L93 Difference]: Finished difference Result 82 states and 83 transitions. [2025-03-08 22:38:47,771 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2025-03-08 22:38:47,772 INFO L78 Accepts]: Start accepts. Automaton has has 57 states, 57 states have (on average 2.3859649122807016) internal successors, (136), 57 states have internal predecessors, (136), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 50 [2025-03-08 22:38:47,772 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 22:38:47,772 INFO L225 Difference]: With dead ends: 82 [2025-03-08 22:38:47,772 INFO L226 Difference]: Without dead ends: 56 [2025-03-08 22:38:47,773 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 147 GetRequests, 67 SyntacticMatches, 0 SemanticMatches, 80 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1324 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=396, Invalid=6246, Unknown=0, NotChecked=0, Total=6642 [2025-03-08 22:38:47,774 INFO L435 NwaCegarLoop]: 11 mSDtfsCounter, 9 mSDsluCounter, 340 mSDsCounter, 0 mSdLazyCounter, 1564 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 351 SdHoareTripleChecker+Invalid, 1577 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 1564 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-08 22:38:47,774 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 351 Invalid, 1577 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 1564 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-08 22:38:47,774 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2025-03-08 22:38:47,775 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 54. [2025-03-08 22:38:47,775 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 54 states, 53 states have (on average 1.0377358490566038) internal successors, (55), 53 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 22:38:47,775 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 55 transitions. [2025-03-08 22:38:47,775 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 55 transitions. Word has length 50 [2025-03-08 22:38:47,775 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 22:38:47,775 INFO L471 AbstractCegarLoop]: Abstraction has 54 states and 55 transitions. [2025-03-08 22:38:47,775 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 57 states, 57 states have (on average 2.3859649122807016) internal successors, (136), 57 states have internal predecessors, (136), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 22:38:47,775 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 55 transitions. [2025-03-08 22:38:47,779 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2025-03-08 22:38:47,780 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 22:38:47,780 INFO L218 NwaCegarLoop]: trace histogram [7, 7, 6, 6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 22:38:47,795 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Ended with exit code 0 [2025-03-08 22:38:47,980 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30,15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 22:38:47,980 INFO L396 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 6 more)] === [2025-03-08 22:38:47,981 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:38:47,981 INFO L85 PathProgramCache]: Analyzing trace with hash -446648743, now seen corresponding path program 10 times [2025-03-08 22:38:47,981 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:38:47,981 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [108527547] [2025-03-08 22:38:47,981 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-08 22:38:47,981 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:38:47,988 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 53 statements into 2 equivalence classes. [2025-03-08 22:38:47,998 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 53 of 53 statements. [2025-03-08 22:38:47,998 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-03-08 22:38:47,998 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:38:48,496 INFO L134 CoverageAnalysis]: Checked inductivity of 129 backedges. 35 proven. 94 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 22:38:48,496 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 22:38:48,496 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [108527547] [2025-03-08 22:38:48,496 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [108527547] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 22:38:48,496 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [159725150] [2025-03-08 22:38:48,496 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-08 22:38:48,496 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 22:38:48,496 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 22:38:48,498 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 22:38:48,499 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2025-03-08 22:38:48,560 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 53 statements into 2 equivalence classes. [2025-03-08 22:38:48,647 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 53 of 53 statements. [2025-03-08 22:38:48,647 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-03-08 22:38:48,647 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:38:48,650 INFO L256 TraceCheckSpWp]: Trace formula consists of 365 conjuncts, 134 conjuncts are in the unsatisfiable core [2025-03-08 22:38:48,652 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 22:38:48,673 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 10 treesize of output 8 [2025-03-08 22:38:48,687 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-08 22:38:49,413 INFO L134 CoverageAnalysis]: Checked inductivity of 129 backedges. 35 proven. 94 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 22:38:49,413 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 22:38:50,003 INFO L173 IndexEqualityManager]: detected equality via solver [2025-03-08 22:38:50,042 INFO L134 CoverageAnalysis]: Checked inductivity of 129 backedges. 51 proven. 78 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 22:38:50,043 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [159725150] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 22:38:50,043 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 22:38:50,043 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 18, 18] total 54 [2025-03-08 22:38:50,043 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [942111499] [2025-03-08 22:38:50,043 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 22:38:50,043 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 55 states [2025-03-08 22:38:50,043 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 22:38:50,044 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 55 interpolants. [2025-03-08 22:38:50,044 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=328, Invalid=2642, Unknown=0, NotChecked=0, Total=2970 [2025-03-08 22:38:50,044 INFO L87 Difference]: Start difference. First operand 54 states and 55 transitions. Second operand has 55 states, 54 states have (on average 2.9074074074074074) internal successors, (157), 55 states have internal predecessors, (157), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 22:38:50,470 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 22:38:50,470 INFO L93 Difference]: Finished difference Result 58 states and 59 transitions. [2025-03-08 22:38:50,470 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2025-03-08 22:38:50,470 INFO L78 Accepts]: Start accepts. Automaton has has 55 states, 54 states have (on average 2.9074074074074074) internal successors, (157), 55 states have internal predecessors, (157), 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 53 [2025-03-08 22:38:50,471 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 22:38:50,471 INFO L225 Difference]: With dead ends: 58 [2025-03-08 22:38:50,471 INFO L226 Difference]: Without dead ends: 58 [2025-03-08 22:38:50,472 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 130 GetRequests, 71 SyntacticMatches, 0 SemanticMatches, 59 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1061 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=403, Invalid=3257, Unknown=0, NotChecked=0, Total=3660 [2025-03-08 22:38:50,472 INFO L435 NwaCegarLoop]: 10 mSDtfsCounter, 2 mSDsluCounter, 114 mSDsCounter, 0 mSdLazyCounter, 844 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 124 SdHoareTripleChecker+Invalid, 844 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 844 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-08 22:38:50,472 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 124 Invalid, 844 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 844 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-08 22:38:50,473 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2025-03-08 22:38:50,474 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 58. [2025-03-08 22:38:50,474 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 58 states, 57 states have (on average 1.0350877192982457) internal successors, (59), 57 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 22:38:50,474 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 59 transitions. [2025-03-08 22:38:50,474 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 59 transitions. Word has length 53 [2025-03-08 22:38:50,475 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 22:38:50,475 INFO L471 AbstractCegarLoop]: Abstraction has 58 states and 59 transitions. [2025-03-08 22:38:50,475 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 55 states, 54 states have (on average 2.9074074074074074) internal successors, (157), 55 states have internal predecessors, (157), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 22:38:50,475 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 59 transitions. [2025-03-08 22:38:50,475 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2025-03-08 22:38:50,475 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 22:38:50,475 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 7, 7, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 22:38:50,482 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Ended with exit code 0 [2025-03-08 22:38:50,676 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31,16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 22:38:50,676 INFO L396 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 6 more)] === [2025-03-08 22:38:50,676 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:38:50,676 INFO L85 PathProgramCache]: Analyzing trace with hash -836299970, now seen corresponding path program 11 times [2025-03-08 22:38:50,676 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:38:50,676 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1702062663] [2025-03-08 22:38:50,676 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-08 22:38:50,676 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:38:50,684 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 57 statements into 8 equivalence classes. [2025-03-08 22:38:50,695 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 8 check-sat command(s) and asserted 57 of 57 statements. [2025-03-08 22:38:50,695 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 8 check-sat command(s) [2025-03-08 22:38:50,695 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:38:51,246 INFO L134 CoverageAnalysis]: Checked inductivity of 156 backedges. 85 proven. 71 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 22:38:51,247 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 22:38:51,247 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1702062663] [2025-03-08 22:38:51,247 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1702062663] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 22:38:51,247 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [119225308] [2025-03-08 22:38:51,247 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-08 22:38:51,247 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 22:38:51,247 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 22:38:51,249 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 22:38:51,249 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2025-03-08 22:38:51,315 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 57 statements into 8 equivalence classes. [2025-03-08 22:38:51,449 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 8 check-sat command(s) and asserted 57 of 57 statements. [2025-03-08 22:38:51,449 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 8 check-sat command(s) [2025-03-08 22:38:51,449 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:38:51,452 INFO L256 TraceCheckSpWp]: Trace formula consists of 396 conjuncts, 92 conjuncts are in the unsatisfiable core [2025-03-08 22:38:51,453 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 22:38:51,619 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2025-03-08 22:38:51,834 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 3 [2025-03-08 22:38:51,855 INFO L134 CoverageAnalysis]: Checked inductivity of 156 backedges. 21 proven. 135 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 22:38:51,855 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 22:38:51,907 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 13 [2025-03-08 22:38:51,909 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 16 treesize of output 12 [2025-03-08 22:38:51,979 INFO L134 CoverageAnalysis]: Checked inductivity of 156 backedges. 21 proven. 135 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 22:38:51,979 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [119225308] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 22:38:51,979 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 22:38:51,980 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 21, 21] total 47 [2025-03-08 22:38:51,980 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1222613184] [2025-03-08 22:38:51,980 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 22:38:51,980 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 47 states [2025-03-08 22:38:51,980 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 22:38:51,980 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2025-03-08 22:38:51,981 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=142, Invalid=2020, Unknown=0, NotChecked=0, Total=2162 [2025-03-08 22:38:51,981 INFO L87 Difference]: Start difference. First operand 58 states and 59 transitions. Second operand has 47 states, 47 states have (on average 2.4468085106382977) internal successors, (115), 47 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 22:38:53,032 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 22:38:53,032 INFO L93 Difference]: Finished difference Result 93 states and 94 transitions. [2025-03-08 22:38:53,032 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2025-03-08 22:38:53,033 INFO L78 Accepts]: Start accepts. Automaton has has 47 states, 47 states have (on average 2.4468085106382977) internal successors, (115), 47 states have internal predecessors, (115), 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 57 [2025-03-08 22:38:53,033 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 22:38:53,033 INFO L225 Difference]: With dead ends: 93 [2025-03-08 22:38:53,033 INFO L226 Difference]: Without dead ends: 63 [2025-03-08 22:38:53,034 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 167 GetRequests, 92 SyntacticMatches, 0 SemanticMatches, 75 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1158 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=411, Invalid=5441, Unknown=0, NotChecked=0, Total=5852 [2025-03-08 22:38:53,034 INFO L435 NwaCegarLoop]: 12 mSDtfsCounter, 12 mSDsluCounter, 299 mSDsCounter, 0 mSdLazyCounter, 1445 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 311 SdHoareTripleChecker+Invalid, 1464 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 1445 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-08 22:38:53,034 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 311 Invalid, 1464 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 1445 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-08 22:38:53,035 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2025-03-08 22:38:53,035 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 61. [2025-03-08 22:38:53,035 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 61 states, 60 states have (on average 1.0333333333333334) internal successors, (62), 60 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-08 22:38:53,036 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 62 transitions. [2025-03-08 22:38:53,036 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 62 transitions. Word has length 57 [2025-03-08 22:38:53,036 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 22:38:53,036 INFO L471 AbstractCegarLoop]: Abstraction has 61 states and 62 transitions. [2025-03-08 22:38:53,036 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 47 states, 47 states have (on average 2.4468085106382977) internal successors, (115), 47 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 22:38:53,036 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 62 transitions. [2025-03-08 22:38:53,036 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2025-03-08 22:38:53,036 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 22:38:53,036 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 7, 7, 7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 22:38:53,043 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Ended with exit code 0 [2025-03-08 22:38:53,241 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable32 [2025-03-08 22:38:53,242 INFO L396 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 6 more)] === [2025-03-08 22:38:53,242 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:38:53,242 INFO L85 PathProgramCache]: Analyzing trace with hash 1807549525, now seen corresponding path program 12 times [2025-03-08 22:38:53,242 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:38:53,242 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1273757286] [2025-03-08 22:38:53,242 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-03-08 22:38:53,242 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:38:53,250 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 60 statements into 8 equivalence classes. [2025-03-08 22:38:53,264 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 8 check-sat command(s) and asserted 60 of 60 statements. [2025-03-08 22:38:53,265 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 8 check-sat command(s) [2025-03-08 22:38:53,265 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:38:53,733 INFO L134 CoverageAnalysis]: Checked inductivity of 175 backedges. 35 proven. 140 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 22:38:53,733 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 22:38:53,733 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1273757286] [2025-03-08 22:38:53,733 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1273757286] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 22:38:53,733 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [823367069] [2025-03-08 22:38:53,733 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-03-08 22:38:53,733 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 22:38:53,733 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 22:38:53,735 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 22:38:53,736 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Waiting until timeout for monitored process [2025-03-08 22:38:53,804 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 60 statements into 8 equivalence classes. [2025-03-08 22:38:54,019 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 8 check-sat command(s) and asserted 60 of 60 statements. [2025-03-08 22:38:54,020 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 8 check-sat command(s) [2025-03-08 22:38:54,020 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:38:54,023 INFO L256 TraceCheckSpWp]: Trace formula consists of 409 conjuncts, 114 conjuncts are in the unsatisfiable core [2025-03-08 22:38:54,025 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 22:38:54,046 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-08 22:38:54,047 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 22:38:54,048 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-08 22:38:54,580 INFO L134 CoverageAnalysis]: Checked inductivity of 175 backedges. 51 proven. 124 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 22:38:54,580 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 22:38:55,193 INFO L173 IndexEqualityManager]: detected equality via solver [2025-03-08 22:38:55,227 INFO L134 CoverageAnalysis]: Checked inductivity of 175 backedges. 70 proven. 105 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 22:38:55,227 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [823367069] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 22:38:55,227 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 22:38:55,227 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 20, 20] total 63 [2025-03-08 22:38:55,227 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2635088] [2025-03-08 22:38:55,227 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 22:38:55,228 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 64 states [2025-03-08 22:38:55,228 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 22:38:55,229 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 64 interpolants. [2025-03-08 22:38:55,230 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=469, Invalid=3563, Unknown=0, NotChecked=0, Total=4032 [2025-03-08 22:38:55,230 INFO L87 Difference]: Start difference. First operand 61 states and 62 transitions. Second operand has 64 states, 63 states have (on average 2.8253968253968256) internal successors, (178), 64 states have internal predecessors, (178), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 22:38:55,870 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 22:38:55,870 INFO L93 Difference]: Finished difference Result 65 states and 66 transitions. [2025-03-08 22:38:55,871 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2025-03-08 22:38:55,871 INFO L78 Accepts]: Start accepts. Automaton has has 64 states, 63 states have (on average 2.8253968253968256) internal successors, (178), 64 states have internal predecessors, (178), 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 60 [2025-03-08 22:38:55,871 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 22:38:55,871 INFO L225 Difference]: With dead ends: 65 [2025-03-08 22:38:55,871 INFO L226 Difference]: Without dead ends: 65 [2025-03-08 22:38:55,872 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 164 GetRequests, 81 SyntacticMatches, 0 SemanticMatches, 83 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2033 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=913, Invalid=6227, Unknown=0, NotChecked=0, Total=7140 [2025-03-08 22:38:55,873 INFO L435 NwaCegarLoop]: 5 mSDtfsCounter, 18 mSDsluCounter, 66 mSDsCounter, 0 mSdLazyCounter, 684 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 71 SdHoareTripleChecker+Invalid, 698 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 684 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-08 22:38:55,873 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [18 Valid, 71 Invalid, 698 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 684 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-08 22:38:55,873 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2025-03-08 22:38:55,873 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 65. [2025-03-08 22:38:55,874 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 65 states, 64 states have (on average 1.03125) internal successors, (66), 64 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-08 22:38:55,874 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 66 transitions. [2025-03-08 22:38:55,874 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 66 transitions. Word has length 60 [2025-03-08 22:38:55,874 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 22:38:55,874 INFO L471 AbstractCegarLoop]: Abstraction has 65 states and 66 transitions. [2025-03-08 22:38:55,874 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 64 states, 63 states have (on average 2.8253968253968256) internal successors, (178), 64 states have internal predecessors, (178), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 22:38:55,874 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 66 transitions. [2025-03-08 22:38:55,874 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2025-03-08 22:38:55,874 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 22:38:55,874 INFO L218 NwaCegarLoop]: trace histogram [9, 9, 8, 8, 7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 22:38:55,883 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Ended with exit code 0 [2025-03-08 22:38:56,075 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33,18 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 22:38:56,075 INFO L396 AbstractCegarLoop]: === Iteration 35 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 6 more)] === [2025-03-08 22:38:56,075 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:38:56,075 INFO L85 PathProgramCache]: Analyzing trace with hash -2110780614, now seen corresponding path program 13 times [2025-03-08 22:38:56,075 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:38:56,076 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2137340113] [2025-03-08 22:38:56,076 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-03-08 22:38:56,076 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:38:56,086 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 64 statements into 1 equivalence classes. [2025-03-08 22:38:56,094 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 64 of 64 statements. [2025-03-08 22:38:56,094 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:38:56,094 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:38:56,673 INFO L134 CoverageAnalysis]: Checked inductivity of 206 backedges. 113 proven. 93 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 22:38:56,674 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 22:38:56,674 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2137340113] [2025-03-08 22:38:56,674 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2137340113] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 22:38:56,674 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1215648566] [2025-03-08 22:38:56,674 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-03-08 22:38:56,674 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 22:38:56,674 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 22:38:56,675 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 22:38:56,676 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Waiting until timeout for monitored process [2025-03-08 22:38:56,755 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 64 statements into 1 equivalence classes. [2025-03-08 22:38:56,788 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 64 of 64 statements. [2025-03-08 22:38:56,788 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:38:56,788 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:38:56,790 INFO L256 TraceCheckSpWp]: Trace formula consists of 440 conjuncts, 102 conjuncts are in the unsatisfiable core [2025-03-08 22:38:56,792 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 22:38:56,958 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2025-03-08 22:38:57,200 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 3 [2025-03-08 22:38:57,224 INFO L134 CoverageAnalysis]: Checked inductivity of 206 backedges. 24 proven. 182 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 22:38:57,224 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 22:38:57,279 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 13 [2025-03-08 22:38:57,280 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 16 treesize of output 12 [2025-03-08 22:38:57,372 INFO L134 CoverageAnalysis]: Checked inductivity of 206 backedges. 24 proven. 182 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 22:38:57,372 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1215648566] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 22:38:57,372 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 22:38:57,372 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 23, 23] total 48 [2025-03-08 22:38:57,372 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [971121296] [2025-03-08 22:38:57,372 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 22:38:57,373 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 48 states [2025-03-08 22:38:57,373 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 22:38:57,374 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2025-03-08 22:38:57,374 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=135, Invalid=2121, Unknown=0, NotChecked=0, Total=2256 [2025-03-08 22:38:57,374 INFO L87 Difference]: Start difference. First operand 65 states and 66 transitions. Second operand has 48 states, 48 states have (on average 2.6875) internal successors, (129), 48 states have internal predecessors, (129), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 22:38:58,523 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 22:38:58,523 INFO L93 Difference]: Finished difference Result 104 states and 105 transitions. [2025-03-08 22:38:58,524 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2025-03-08 22:38:58,524 INFO L78 Accepts]: Start accepts. Automaton has has 48 states, 48 states have (on average 2.6875) internal successors, (129), 48 states have internal predecessors, (129), 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 64 [2025-03-08 22:38:58,524 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 22:38:58,524 INFO L225 Difference]: With dead ends: 104 [2025-03-08 22:38:58,524 INFO L226 Difference]: Without dead ends: 70 [2025-03-08 22:38:58,525 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 177 GetRequests, 104 SyntacticMatches, 0 SemanticMatches, 73 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 920 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=364, Invalid=5186, Unknown=0, NotChecked=0, Total=5550 [2025-03-08 22:38:58,525 INFO L435 NwaCegarLoop]: 13 mSDtfsCounter, 11 mSDsluCounter, 352 mSDsCounter, 0 mSdLazyCounter, 1682 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 365 SdHoareTripleChecker+Invalid, 1702 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 1682 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-08 22:38:58,525 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 365 Invalid, 1702 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 1682 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-08 22:38:58,525 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2025-03-08 22:38:58,526 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 68. [2025-03-08 22:38:58,526 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 68 states, 67 states have (on average 1.0298507462686568) internal successors, (69), 67 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 22:38:58,526 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 69 transitions. [2025-03-08 22:38:58,526 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 69 transitions. Word has length 64 [2025-03-08 22:38:58,526 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 22:38:58,526 INFO L471 AbstractCegarLoop]: Abstraction has 68 states and 69 transitions. [2025-03-08 22:38:58,526 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 48 states, 48 states have (on average 2.6875) internal successors, (129), 48 states have internal predecessors, (129), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 22:38:58,526 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 69 transitions. [2025-03-08 22:38:58,527 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2025-03-08 22:38:58,527 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 22:38:58,527 INFO L218 NwaCegarLoop]: trace histogram [9, 9, 8, 8, 8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 22:38:58,533 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Ended with exit code 0 [2025-03-08 22:38:58,732 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34,19 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 22:38:58,732 INFO L396 AbstractCegarLoop]: === Iteration 36 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 6 more)] === [2025-03-08 22:38:58,732 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:38:58,732 INFO L85 PathProgramCache]: Analyzing trace with hash -1284242877, now seen corresponding path program 14 times [2025-03-08 22:38:58,732 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:38:58,732 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [572349225] [2025-03-08 22:38:58,732 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-08 22:38:58,732 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:38:58,740 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 67 statements into 2 equivalence classes. [2025-03-08 22:38:58,750 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 67 of 67 statements. [2025-03-08 22:38:58,750 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-08 22:38:58,750 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:38:59,404 INFO L134 CoverageAnalysis]: Checked inductivity of 228 backedges. 51 proven. 177 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 22:38:59,404 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 22:38:59,404 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [572349225] [2025-03-08 22:38:59,404 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [572349225] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 22:38:59,404 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [498894392] [2025-03-08 22:38:59,404 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-08 22:38:59,404 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 22:38:59,405 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 22:38:59,406 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 22:38:59,407 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Waiting until timeout for monitored process [2025-03-08 22:38:59,482 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 67 statements into 2 equivalence classes. [2025-03-08 22:38:59,527 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 67 of 67 statements. [2025-03-08 22:38:59,528 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-08 22:38:59,528 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:38:59,532 INFO L256 TraceCheckSpWp]: Trace formula consists of 453 conjuncts, 157 conjuncts are in the unsatisfiable core [2025-03-08 22:38:59,535 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 22:38:59,576 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-08 22:38:59,580 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 22:38:59,582 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-08 22:39:00,648 INFO L134 CoverageAnalysis]: Checked inductivity of 228 backedges. 0 proven. 228 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 22:39:00,648 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 22:39:01,574 INFO L173 IndexEqualityManager]: detected equality via solver [2025-03-08 22:39:01,617 INFO L134 CoverageAnalysis]: Checked inductivity of 228 backedges. 0 proven. 228 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 22:39:01,618 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [498894392] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 22:39:01,618 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 22:39:01,618 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 25, 25] total 72 [2025-03-08 22:39:01,618 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1157478943] [2025-03-08 22:39:01,618 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 22:39:01,618 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 73 states [2025-03-08 22:39:01,618 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 22:39:01,619 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 73 interpolants. [2025-03-08 22:39:01,619 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=484, Invalid=4772, Unknown=0, NotChecked=0, Total=5256 [2025-03-08 22:39:01,619 INFO L87 Difference]: Start difference. First operand 68 states and 69 transitions. Second operand has 73 states, 72 states have (on average 2.763888888888889) internal successors, (199), 73 states have internal predecessors, (199), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 22:39:02,770 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 22:39:02,770 INFO L93 Difference]: Finished difference Result 77 states and 79 transitions. [2025-03-08 22:39:02,770 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2025-03-08 22:39:02,771 INFO L78 Accepts]: Start accepts. Automaton has has 73 states, 72 states have (on average 2.763888888888889) internal successors, (199), 73 states have internal predecessors, (199), 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 67 [2025-03-08 22:39:02,771 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 22:39:02,771 INFO L225 Difference]: With dead ends: 77 [2025-03-08 22:39:02,771 INFO L226 Difference]: Without dead ends: 77 [2025-03-08 22:39:02,771 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 172 GetRequests, 85 SyntacticMatches, 0 SemanticMatches, 87 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2267 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=691, Invalid=7141, Unknown=0, NotChecked=0, Total=7832 [2025-03-08 22:39:02,772 INFO L435 NwaCegarLoop]: 12 mSDtfsCounter, 20 mSDsluCounter, 302 mSDsCounter, 0 mSdLazyCounter, 2042 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 314 SdHoareTripleChecker+Invalid, 2049 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 2042 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-03-08 22:39:02,772 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 314 Invalid, 2049 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 2042 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-03-08 22:39:02,772 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2025-03-08 22:39:02,773 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 72. [2025-03-08 22:39:02,773 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 72 states, 71 states have (on average 1.028169014084507) internal successors, (73), 71 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 22:39:02,773 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 73 transitions. [2025-03-08 22:39:02,773 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 73 transitions. Word has length 67 [2025-03-08 22:39:02,773 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 22:39:02,773 INFO L471 AbstractCegarLoop]: Abstraction has 72 states and 73 transitions. [2025-03-08 22:39:02,773 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 73 states, 72 states have (on average 2.763888888888889) internal successors, (199), 73 states have internal predecessors, (199), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 22:39:02,773 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 73 transitions. [2025-03-08 22:39:02,774 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2025-03-08 22:39:02,774 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 22:39:02,774 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 9, 9, 8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 22:39:02,782 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Ended with exit code 0 [2025-03-08 22:39:02,975 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35,20 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 22:39:02,975 INFO L396 AbstractCegarLoop]: === Iteration 37 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 6 more)] === [2025-03-08 22:39:02,976 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:39:02,976 INFO L85 PathProgramCache]: Analyzing trace with hash -113614296, now seen corresponding path program 15 times [2025-03-08 22:39:02,976 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:39:02,976 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1494364950] [2025-03-08 22:39:02,976 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-08 22:39:02,976 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:39:02,989 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 71 statements into 10 equivalence classes. [2025-03-08 22:39:03,014 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 10 check-sat command(s) and asserted 71 of 71 statements. [2025-03-08 22:39:03,014 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 10 check-sat command(s) [2025-03-08 22:39:03,014 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:39:03,917 INFO L134 CoverageAnalysis]: Checked inductivity of 263 backedges. 145 proven. 118 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 22:39:03,918 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 22:39:03,918 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1494364950] [2025-03-08 22:39:03,918 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1494364950] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 22:39:03,918 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [915755561] [2025-03-08 22:39:03,918 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-08 22:39:03,918 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 22:39:03,918 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 22:39:03,920 INFO L229 MonitoredProcess]: Starting monitored process 21 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 22:39:03,921 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Waiting until timeout for monitored process [2025-03-08 22:39:04,001 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 71 statements into 10 equivalence classes. [2025-03-08 22:39:04,306 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 10 check-sat command(s) and asserted 71 of 71 statements. [2025-03-08 22:39:04,306 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 10 check-sat command(s) [2025-03-08 22:39:04,306 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:39:04,311 INFO L256 TraceCheckSpWp]: Trace formula consists of 484 conjuncts, 156 conjuncts are in the unsatisfiable core [2025-03-08 22:39:04,314 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 22:39:04,597 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-03-08 22:39:05,013 INFO L134 CoverageAnalysis]: Checked inductivity of 263 backedges. 27 proven. 236 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 22:39:05,014 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 22:39:05,372 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 13 [2025-03-08 22:39:05,374 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 16 treesize of output 12 [2025-03-08 22:39:05,770 INFO L134 CoverageAnalysis]: Checked inductivity of 263 backedges. 27 proven. 236 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 22:39:05,770 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [915755561] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 22:39:05,770 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 22:39:05,770 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [33, 25, 25] total 78 [2025-03-08 22:39:05,770 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1843557914] [2025-03-08 22:39:05,770 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 22:39:05,770 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 78 states [2025-03-08 22:39:05,770 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 22:39:05,771 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 78 interpolants. [2025-03-08 22:39:05,771 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=288, Invalid=5718, Unknown=0, NotChecked=0, Total=6006 [2025-03-08 22:39:05,772 INFO L87 Difference]: Start difference. First operand 72 states and 73 transitions. Second operand has 78 states, 78 states have (on average 2.551282051282051) internal successors, (199), 78 states have internal predecessors, (199), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 22:39:07,635 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 22:39:07,636 INFO L93 Difference]: Finished difference Result 115 states and 116 transitions. [2025-03-08 22:39:07,636 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2025-03-08 22:39:07,636 INFO L78 Accepts]: Start accepts. Automaton has has 78 states, 78 states have (on average 2.551282051282051) internal successors, (199), 78 states have internal predecessors, (199), 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 71 [2025-03-08 22:39:07,636 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 22:39:07,636 INFO L225 Difference]: With dead ends: 115 [2025-03-08 22:39:07,637 INFO L226 Difference]: Without dead ends: 77 [2025-03-08 22:39:07,637 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 210 GetRequests, 97 SyntacticMatches, 0 SemanticMatches, 113 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2829 ImplicationChecksByTransitivity, 2.9s TimeCoverageRelationStatistics Valid=681, Invalid=12429, Unknown=0, NotChecked=0, Total=13110 [2025-03-08 22:39:07,638 INFO L435 NwaCegarLoop]: 14 mSDtfsCounter, 12 mSDsluCounter, 481 mSDsCounter, 0 mSdLazyCounter, 2416 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 495 SdHoareTripleChecker+Invalid, 2438 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 2416 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-03-08 22:39:07,638 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 495 Invalid, 2438 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 2416 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-03-08 22:39:07,638 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2025-03-08 22:39:07,639 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 75. [2025-03-08 22:39:07,639 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 75 states, 74 states have (on average 1.027027027027027) internal successors, (76), 74 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 22:39:07,639 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 76 transitions. [2025-03-08 22:39:07,639 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 76 transitions. Word has length 71 [2025-03-08 22:39:07,639 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 22:39:07,639 INFO L471 AbstractCegarLoop]: Abstraction has 75 states and 76 transitions. [2025-03-08 22:39:07,639 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 78 states, 78 states have (on average 2.551282051282051) internal successors, (199), 78 states have internal predecessors, (199), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 22:39:07,639 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 76 transitions. [2025-03-08 22:39:07,639 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2025-03-08 22:39:07,640 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 22:39:07,640 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 9, 9, 9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 22:39:07,648 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Forceful destruction successful, exit code 0 [2025-03-08 22:39:07,844 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable36 [2025-03-08 22:39:07,844 INFO L396 AbstractCegarLoop]: === Iteration 38 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 6 more)] === [2025-03-08 22:39:07,844 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:39:07,844 INFO L85 PathProgramCache]: Analyzing trace with hash 1338842879, now seen corresponding path program 16 times [2025-03-08 22:39:07,844 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:39:07,844 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1444862194] [2025-03-08 22:39:07,844 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-08 22:39:07,845 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:39:07,853 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 74 statements into 2 equivalence classes. [2025-03-08 22:39:07,863 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 74 of 74 statements. [2025-03-08 22:39:07,863 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-03-08 22:39:07,863 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:39:08,567 INFO L134 CoverageAnalysis]: Checked inductivity of 288 backedges. 92 proven. 196 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 22:39:08,568 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 22:39:08,568 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1444862194] [2025-03-08 22:39:08,568 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1444862194] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 22:39:08,568 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2060383958] [2025-03-08 22:39:08,568 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-08 22:39:08,568 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 22:39:08,568 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 22:39:08,569 INFO L229 MonitoredProcess]: Starting monitored process 22 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 22:39:08,570 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Waiting until timeout for monitored process [2025-03-08 22:39:08,655 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 74 statements into 2 equivalence classes. [2025-03-08 22:39:09,110 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 74 of 74 statements. [2025-03-08 22:39:09,110 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-03-08 22:39:09,110 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:39:09,115 INFO L256 TraceCheckSpWp]: Trace formula consists of 497 conjuncts, 161 conjuncts are in the unsatisfiable core [2025-03-08 22:39:09,117 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 22:39:09,152 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-08 22:39:09,155 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 22:39:09,156 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-08 22:39:10,202 INFO L134 CoverageAnalysis]: Checked inductivity of 288 backedges. 92 proven. 196 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 22:39:10,202 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 22:39:11,191 INFO L173 IndexEqualityManager]: detected equality via solver [2025-03-08 22:39:11,237 INFO L134 CoverageAnalysis]: Checked inductivity of 288 backedges. 117 proven. 171 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 22:39:11,237 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2060383958] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 22:39:11,237 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 22:39:11,237 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 24, 24] total 72 [2025-03-08 22:39:11,237 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [498353743] [2025-03-08 22:39:11,237 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 22:39:11,237 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 73 states [2025-03-08 22:39:11,237 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 22:39:11,238 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 73 interpolants. [2025-03-08 22:39:11,238 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=571, Invalid=4685, Unknown=0, NotChecked=0, Total=5256 [2025-03-08 22:39:11,238 INFO L87 Difference]: Start difference. First operand 75 states and 76 transitions. Second operand has 73 states, 72 states have (on average 3.0555555555555554) internal successors, (220), 73 states have internal predecessors, (220), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 22:39:12,041 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 22:39:12,041 INFO L93 Difference]: Finished difference Result 79 states and 80 transitions. [2025-03-08 22:39:12,041 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2025-03-08 22:39:12,042 INFO L78 Accepts]: Start accepts. Automaton has has 73 states, 72 states have (on average 3.0555555555555554) internal successors, (220), 73 states have internal predecessors, (220), 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 74 [2025-03-08 22:39:12,042 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 22:39:12,042 INFO L225 Difference]: With dead ends: 79 [2025-03-08 22:39:12,042 INFO L226 Difference]: Without dead ends: 79 [2025-03-08 22:39:12,042 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 181 GetRequests, 101 SyntacticMatches, 0 SemanticMatches, 80 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2000 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=697, Invalid=5945, Unknown=0, NotChecked=0, Total=6642 [2025-03-08 22:39:12,043 INFO L435 NwaCegarLoop]: 13 mSDtfsCounter, 4 mSDsluCounter, 244 mSDsCounter, 0 mSdLazyCounter, 1714 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 257 SdHoareTripleChecker+Invalid, 1714 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 1714 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-08 22:39:12,043 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 257 Invalid, 1714 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 1714 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-08 22:39:12,043 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2025-03-08 22:39:12,044 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 79. [2025-03-08 22:39:12,044 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 79 states, 78 states have (on average 1.0256410256410255) internal successors, (80), 78 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 22:39:12,044 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 80 transitions. [2025-03-08 22:39:12,044 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 80 transitions. Word has length 74 [2025-03-08 22:39:12,044 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 22:39:12,044 INFO L471 AbstractCegarLoop]: Abstraction has 79 states and 80 transitions. [2025-03-08 22:39:12,044 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 73 states, 72 states have (on average 3.0555555555555554) internal successors, (220), 73 states have internal predecessors, (220), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 22:39:12,044 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 80 transitions. [2025-03-08 22:39:12,044 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2025-03-08 22:39:12,044 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 22:39:12,045 INFO L218 NwaCegarLoop]: trace histogram [11, 11, 10, 10, 9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 22:39:12,053 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Ended with exit code 0 [2025-03-08 22:39:12,245 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 22 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable37 [2025-03-08 22:39:12,245 INFO L396 AbstractCegarLoop]: === Iteration 39 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 6 more)] === [2025-03-08 22:39:12,245 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:39:12,245 INFO L85 PathProgramCache]: Analyzing trace with hash 1442758884, now seen corresponding path program 17 times [2025-03-08 22:39:12,245 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:39:12,245 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1235273123] [2025-03-08 22:39:12,245 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-08 22:39:12,245 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:39:12,254 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 78 statements into 11 equivalence classes. [2025-03-08 22:39:12,272 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 11 check-sat command(s) and asserted 78 of 78 statements. [2025-03-08 22:39:12,272 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 11 check-sat command(s) [2025-03-08 22:39:12,272 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:39:13,067 INFO L134 CoverageAnalysis]: Checked inductivity of 327 backedges. 167 proven. 160 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 22:39:13,067 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 22:39:13,068 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1235273123] [2025-03-08 22:39:13,068 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1235273123] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 22:39:13,068 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [987876567] [2025-03-08 22:39:13,068 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-08 22:39:13,068 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 22:39:13,068 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 22:39:13,069 INFO L229 MonitoredProcess]: Starting monitored process 23 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 22:39:13,070 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Waiting until timeout for monitored process [2025-03-08 22:39:13,157 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 78 statements into 11 equivalence classes. [2025-03-08 22:39:14,230 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 11 check-sat command(s) and asserted 78 of 78 statements. [2025-03-08 22:39:14,230 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 11 check-sat command(s) [2025-03-08 22:39:14,230 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:39:14,237 INFO L256 TraceCheckSpWp]: Trace formula consists of 528 conjuncts, 118 conjuncts are in the unsatisfiable core [2025-03-08 22:39:14,239 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 22:39:14,476 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2025-03-08 22:39:14,839 INFO L134 CoverageAnalysis]: Checked inductivity of 327 backedges. 30 proven. 297 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 22:39:14,839 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 22:39:14,875 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 13 [2025-03-08 22:39:14,876 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 16 treesize of output 12 [2025-03-08 22:39:14,967 INFO L134 CoverageAnalysis]: Checked inductivity of 327 backedges. 30 proven. 297 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 22:39:14,967 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [987876567] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 22:39:14,967 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 22:39:14,967 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [30, 27, 27] total 57 [2025-03-08 22:39:14,967 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [545371259] [2025-03-08 22:39:14,967 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 22:39:14,967 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 57 states [2025-03-08 22:39:14,967 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 22:39:14,968 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 57 interpolants. [2025-03-08 22:39:14,968 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=174, Invalid=3018, Unknown=0, NotChecked=0, Total=3192 [2025-03-08 22:39:14,968 INFO L87 Difference]: Start difference. First operand 79 states and 80 transitions. Second operand has 57 states, 57 states have (on average 2.719298245614035) internal successors, (155), 57 states have internal predecessors, (155), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 22:39:16,676 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 22:39:16,676 INFO L93 Difference]: Finished difference Result 126 states and 127 transitions. [2025-03-08 22:39:16,676 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2025-03-08 22:39:16,676 INFO L78 Accepts]: Start accepts. Automaton has has 57 states, 57 states have (on average 2.719298245614035) internal successors, (155), 57 states have internal predecessors, (155), 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 78 [2025-03-08 22:39:16,676 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 22:39:16,677 INFO L225 Difference]: With dead ends: 126 [2025-03-08 22:39:16,677 INFO L226 Difference]: Without dead ends: 84 [2025-03-08 22:39:16,677 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 226 GetRequests, 129 SyntacticMatches, 0 SemanticMatches, 97 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1888 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=610, Invalid=9092, Unknown=0, NotChecked=0, Total=9702 [2025-03-08 22:39:16,677 INFO L435 NwaCegarLoop]: 15 mSDtfsCounter, 42 mSDsluCounter, 493 mSDsCounter, 0 mSdLazyCounter, 2538 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 42 SdHoareTripleChecker+Valid, 508 SdHoareTripleChecker+Invalid, 2565 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 2538 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-03-08 22:39:16,678 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [42 Valid, 508 Invalid, 2565 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 2538 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-03-08 22:39:16,678 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2025-03-08 22:39:16,678 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 82. [2025-03-08 22:39:16,679 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 82 states, 81 states have (on average 1.0246913580246915) internal successors, (83), 81 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 22:39:16,679 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 83 transitions. [2025-03-08 22:39:16,679 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 83 transitions. Word has length 78 [2025-03-08 22:39:16,679 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 22:39:16,679 INFO L471 AbstractCegarLoop]: Abstraction has 82 states and 83 transitions. [2025-03-08 22:39:16,679 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 57 states, 57 states have (on average 2.719298245614035) internal successors, (155), 57 states have internal predecessors, (155), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 22:39:16,679 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 83 transitions. [2025-03-08 22:39:16,679 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2025-03-08 22:39:16,679 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 22:39:16,679 INFO L218 NwaCegarLoop]: trace histogram [11, 11, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 22:39:16,691 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Ended with exit code 0 [2025-03-08 22:39:16,880 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 23 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable38 [2025-03-08 22:39:16,880 INFO L396 AbstractCegarLoop]: === Iteration 40 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 6 more)] === [2025-03-08 22:39:16,880 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:39:16,880 INFO L85 PathProgramCache]: Analyzing trace with hash 1916613677, now seen corresponding path program 18 times [2025-03-08 22:39:16,880 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:39:16,880 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [643802644] [2025-03-08 22:39:16,880 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-03-08 22:39:16,880 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:39:16,890 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 81 statements into 11 equivalence classes. [2025-03-08 22:39:16,915 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 11 check-sat command(s) and asserted 81 of 81 statements. [2025-03-08 22:39:16,915 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 11 check-sat command(s) [2025-03-08 22:39:16,915 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:39:17,648 INFO L134 CoverageAnalysis]: Checked inductivity of 355 backedges. 92 proven. 263 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 22:39:17,648 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 22:39:17,648 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [643802644] [2025-03-08 22:39:17,648 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [643802644] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 22:39:17,648 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1039223537] [2025-03-08 22:39:17,648 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-03-08 22:39:17,648 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 22:39:17,648 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 22:39:17,650 INFO L229 MonitoredProcess]: Starting monitored process 24 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 22:39:17,651 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Waiting until timeout for monitored process [2025-03-08 22:39:17,743 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 81 statements into 11 equivalence classes. [2025-03-08 22:39:18,972 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 11 check-sat command(s) and asserted 81 of 81 statements. [2025-03-08 22:39:18,972 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 11 check-sat command(s) [2025-03-08 22:39:18,972 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:39:18,979 INFO L256 TraceCheckSpWp]: Trace formula consists of 541 conjuncts, 173 conjuncts are in the unsatisfiable core [2025-03-08 22:39:18,981 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 22:39:19,004 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2025-03-08 22:39:19,010 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-08 22:39:19,992 INFO L134 CoverageAnalysis]: Checked inductivity of 355 backedges. 117 proven. 238 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 22:39:19,993 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 22:39:21,004 INFO L134 CoverageAnalysis]: Checked inductivity of 355 backedges. 145 proven. 210 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 22:39:21,005 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1039223537] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 22:39:21,005 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 22:39:21,005 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [31, 26, 26] total 81 [2025-03-08 22:39:21,005 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1483993066] [2025-03-08 22:39:21,005 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 22:39:21,005 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 82 states [2025-03-08 22:39:21,005 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 22:39:21,006 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 82 interpolants. [2025-03-08 22:39:21,006 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=733, Invalid=5909, Unknown=0, NotChecked=0, Total=6642 [2025-03-08 22:39:21,006 INFO L87 Difference]: Start difference. First operand 82 states and 83 transitions. Second operand has 82 states, 81 states have (on average 2.9753086419753085) internal successors, (241), 82 states have internal predecessors, (241), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 22:39:21,943 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 22:39:21,943 INFO L93 Difference]: Finished difference Result 86 states and 87 transitions. [2025-03-08 22:39:21,943 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2025-03-08 22:39:21,943 INFO L78 Accepts]: Start accepts. Automaton has has 82 states, 81 states have (on average 2.9753086419753085) internal successors, (241), 82 states have internal predecessors, (241), 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 81 [2025-03-08 22:39:21,944 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 22:39:21,944 INFO L225 Difference]: With dead ends: 86 [2025-03-08 22:39:21,944 INFO L226 Difference]: Without dead ends: 86 [2025-03-08 22:39:21,944 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 213 GetRequests, 111 SyntacticMatches, 0 SemanticMatches, 102 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3449 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=1200, Invalid=9512, Unknown=0, NotChecked=0, Total=10712 [2025-03-08 22:39:21,945 INFO L435 NwaCegarLoop]: 14 mSDtfsCounter, 7 mSDsluCounter, 200 mSDsCounter, 0 mSdLazyCounter, 1340 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 214 SdHoareTripleChecker+Invalid, 1341 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 1340 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-08 22:39:21,945 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 214 Invalid, 1341 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 1340 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-08 22:39:21,945 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2025-03-08 22:39:21,946 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 86. [2025-03-08 22:39:21,946 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 86 states, 85 states have (on average 1.0235294117647058) internal successors, (87), 85 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 22:39:21,946 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 87 transitions. [2025-03-08 22:39:21,946 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 87 transitions. Word has length 81 [2025-03-08 22:39:21,946 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 22:39:21,946 INFO L471 AbstractCegarLoop]: Abstraction has 86 states and 87 transitions. [2025-03-08 22:39:21,946 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 82 states, 81 states have (on average 2.9753086419753085) internal successors, (241), 82 states have internal predecessors, (241), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 22:39:21,946 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 87 transitions. [2025-03-08 22:39:21,947 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2025-03-08 22:39:21,947 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 22:39:21,947 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 11, 11, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 22:39:21,956 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Ended with exit code 0 [2025-03-08 22:39:22,147 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable39,24 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 22:39:22,147 INFO L396 AbstractCegarLoop]: === Iteration 41 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 6 more)] === [2025-03-08 22:39:22,148 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:39:22,148 INFO L85 PathProgramCache]: Analyzing trace with hash -354119918, now seen corresponding path program 19 times [2025-03-08 22:39:22,148 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:39:22,148 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [51978842] [2025-03-08 22:39:22,148 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-03-08 22:39:22,148 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:39:22,157 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 85 statements into 1 equivalence classes. [2025-03-08 22:39:22,167 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 85 of 85 statements. [2025-03-08 22:39:22,167 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:39:22,167 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:39:22,990 INFO L134 CoverageAnalysis]: Checked inductivity of 398 backedges. 221 proven. 177 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 22:39:22,990 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 22:39:22,990 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [51978842] [2025-03-08 22:39:22,991 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [51978842] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 22:39:22,991 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1181558087] [2025-03-08 22:39:22,991 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-03-08 22:39:22,991 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 22:39:22,991 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 22:39:22,992 INFO L229 MonitoredProcess]: Starting monitored process 25 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 22:39:22,993 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (25)] Waiting until timeout for monitored process [2025-03-08 22:39:23,092 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 85 statements into 1 equivalence classes. [2025-03-08 22:39:23,140 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 85 of 85 statements. [2025-03-08 22:39:23,140 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:39:23,140 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:39:23,143 INFO L256 TraceCheckSpWp]: Trace formula consists of 572 conjuncts, 128 conjuncts are in the unsatisfiable core [2025-03-08 22:39:23,145 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 22:39:23,419 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2025-03-08 22:39:23,834 INFO L134 CoverageAnalysis]: Checked inductivity of 398 backedges. 33 proven. 365 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 22:39:23,834 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 22:39:23,874 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 13 [2025-03-08 22:39:23,875 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 16 treesize of output 12 [2025-03-08 22:39:23,968 INFO L134 CoverageAnalysis]: Checked inductivity of 398 backedges. 33 proven. 365 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 22:39:23,968 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1181558087] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 22:39:23,968 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 22:39:23,968 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [30, 29, 29] total 59 [2025-03-08 22:39:23,968 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1607030225] [2025-03-08 22:39:23,968 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 22:39:23,968 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 59 states [2025-03-08 22:39:23,968 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 22:39:23,969 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 59 interpolants. [2025-03-08 22:39:23,969 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=183, Invalid=3239, Unknown=0, NotChecked=0, Total=3422 [2025-03-08 22:39:23,969 INFO L87 Difference]: Start difference. First operand 86 states and 87 transitions. Second operand has 59 states, 59 states have (on average 2.864406779661017) internal successors, (169), 59 states have internal predecessors, (169), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 22:39:25,667 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 22:39:25,667 INFO L93 Difference]: Finished difference Result 137 states and 138 transitions. [2025-03-08 22:39:25,667 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2025-03-08 22:39:25,668 INFO L78 Accepts]: Start accepts. Automaton has has 59 states, 59 states have (on average 2.864406779661017) internal successors, (169), 59 states have internal predecessors, (169), 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-08 22:39:25,668 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 22:39:25,668 INFO L225 Difference]: With dead ends: 137 [2025-03-08 22:39:25,668 INFO L226 Difference]: Without dead ends: 91 [2025-03-08 22:39:25,669 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 234 GetRequests, 141 SyntacticMatches, 0 SemanticMatches, 93 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1516 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=540, Invalid=8390, Unknown=0, NotChecked=0, Total=8930 [2025-03-08 22:39:25,669 INFO L435 NwaCegarLoop]: 16 mSDtfsCounter, 16 mSDsluCounter, 552 mSDsCounter, 0 mSdLazyCounter, 2737 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 568 SdHoareTripleChecker+Invalid, 2765 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 2737 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-03-08 22:39:25,669 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 568 Invalid, 2765 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 2737 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-03-08 22:39:25,669 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2025-03-08 22:39:25,670 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 89. [2025-03-08 22:39:25,670 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 89 states, 88 states have (on average 1.0227272727272727) internal successors, (90), 88 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 22:39:25,670 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 90 transitions. [2025-03-08 22:39:25,670 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 90 transitions. Word has length 85 [2025-03-08 22:39:25,670 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 22:39:25,670 INFO L471 AbstractCegarLoop]: Abstraction has 89 states and 90 transitions. [2025-03-08 22:39:25,670 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 59 states, 59 states have (on average 2.864406779661017) internal successors, (169), 59 states have internal predecessors, (169), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 22:39:25,670 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 90 transitions. [2025-03-08 22:39:25,671 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2025-03-08 22:39:25,671 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 22:39:25,671 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 11, 11, 11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 22:39:25,679 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (25)] Ended with exit code 0 [2025-03-08 22:39:25,871 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable40,25 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 22:39:25,871 INFO L396 AbstractCegarLoop]: === Iteration 42 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 6 more)] === [2025-03-08 22:39:25,871 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:39:25,871 INFO L85 PathProgramCache]: Analyzing trace with hash -213612631, now seen corresponding path program 20 times [2025-03-08 22:39:25,872 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:39:25,872 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1034000595] [2025-03-08 22:39:25,872 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-08 22:39:25,872 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:39:25,881 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 88 statements into 2 equivalence classes. [2025-03-08 22:39:25,893 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 88 of 88 statements. [2025-03-08 22:39:25,893 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-08 22:39:25,893 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:39:26,851 INFO L134 CoverageAnalysis]: Checked inductivity of 429 backedges. 117 proven. 312 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 22:39:26,852 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 22:39:26,852 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1034000595] [2025-03-08 22:39:26,852 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1034000595] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 22:39:26,852 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1223738217] [2025-03-08 22:39:26,852 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-08 22:39:26,852 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 22:39:26,852 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 22:39:26,854 INFO L229 MonitoredProcess]: Starting monitored process 26 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 22:39:26,855 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (26)] Waiting until timeout for monitored process [2025-03-08 22:39:26,955 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 88 statements into 2 equivalence classes. [2025-03-08 22:39:27,008 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 88 of 88 statements. [2025-03-08 22:39:27,008 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-08 22:39:27,008 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:39:27,012 INFO L256 TraceCheckSpWp]: Trace formula consists of 585 conjuncts, 201 conjuncts are in the unsatisfiable core [2025-03-08 22:39:27,014 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 22:39:27,045 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-08 22:39:27,047 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 22:39:27,048 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-08 22:39:28,705 INFO L134 CoverageAnalysis]: Checked inductivity of 429 backedges. 0 proven. 429 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 22:39:28,705 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 22:39:30,062 INFO L173 IndexEqualityManager]: detected equality via solver [2025-03-08 22:39:30,113 INFO L134 CoverageAnalysis]: Checked inductivity of 429 backedges. 0 proven. 429 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 22:39:30,114 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1223738217] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 22:39:30,114 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 22:39:30,114 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [30, 31, 31] total 90 [2025-03-08 22:39:30,114 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [684767850] [2025-03-08 22:39:30,114 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 22:39:30,114 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 91 states [2025-03-08 22:39:30,114 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 22:39:30,115 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 91 interpolants. [2025-03-08 22:39:30,115 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=727, Invalid=7463, Unknown=0, NotChecked=0, Total=8190 [2025-03-08 22:39:30,115 INFO L87 Difference]: Start difference. First operand 89 states and 90 transitions. Second operand has 91 states, 90 states have (on average 2.911111111111111) internal successors, (262), 91 states have internal predecessors, (262), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 22:39:31,819 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 22:39:31,819 INFO L93 Difference]: Finished difference Result 98 states and 100 transitions. [2025-03-08 22:39:31,820 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2025-03-08 22:39:31,820 INFO L78 Accepts]: Start accepts. Automaton has has 91 states, 90 states have (on average 2.911111111111111) internal successors, (262), 91 states have internal predecessors, (262), 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 88 [2025-03-08 22:39:31,820 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 22:39:31,820 INFO L225 Difference]: With dead ends: 98 [2025-03-08 22:39:31,820 INFO L226 Difference]: Without dead ends: 98 [2025-03-08 22:39:31,821 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 226 GetRequests, 115 SyntacticMatches, 0 SemanticMatches, 111 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3719 ImplicationChecksByTransitivity, 3.4s TimeCoverageRelationStatistics Valid=1057, Invalid=11599, Unknown=0, NotChecked=0, Total=12656 [2025-03-08 22:39:31,821 INFO L435 NwaCegarLoop]: 15 mSDtfsCounter, 23 mSDsluCounter, 447 mSDsCounter, 0 mSdLazyCounter, 2862 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 462 SdHoareTripleChecker+Invalid, 2872 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 2862 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2025-03-08 22:39:31,821 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [23 Valid, 462 Invalid, 2872 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 2862 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2025-03-08 22:39:31,822 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2025-03-08 22:39:31,822 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 93. [2025-03-08 22:39:31,822 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 93 states, 92 states have (on average 1.0217391304347827) internal successors, (94), 92 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 22:39:31,823 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 94 transitions. [2025-03-08 22:39:31,823 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 94 transitions. Word has length 88 [2025-03-08 22:39:31,823 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 22:39:31,823 INFO L471 AbstractCegarLoop]: Abstraction has 93 states and 94 transitions. [2025-03-08 22:39:31,823 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 91 states, 90 states have (on average 2.911111111111111) internal successors, (262), 91 states have internal predecessors, (262), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 22:39:31,823 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 94 transitions. [2025-03-08 22:39:31,823 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2025-03-08 22:39:31,823 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 22:39:31,823 INFO L218 NwaCegarLoop]: trace histogram [13, 13, 12, 12, 11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 22:39:31,830 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (26)] Ended with exit code 0 [2025-03-08 22:39:32,023 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 26 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable41 [2025-03-08 22:39:32,024 INFO L396 AbstractCegarLoop]: === Iteration 43 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 6 more)] === [2025-03-08 22:39:32,024 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:39:32,024 INFO L85 PathProgramCache]: Analyzing trace with hash 685622414, now seen corresponding path program 21 times [2025-03-08 22:39:32,024 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:39:32,024 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [681626409] [2025-03-08 22:39:32,024 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-08 22:39:32,024 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:39:32,037 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 92 statements into 13 equivalence classes. [2025-03-08 22:39:32,067 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 13 check-sat command(s) and asserted 92 of 92 statements. [2025-03-08 22:39:32,067 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 13 check-sat command(s) [2025-03-08 22:39:32,067 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:39:33,369 INFO L134 CoverageAnalysis]: Checked inductivity of 476 backedges. 265 proven. 211 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 22:39:33,369 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 22:39:33,369 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [681626409] [2025-03-08 22:39:33,369 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [681626409] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 22:39:33,369 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1470220642] [2025-03-08 22:39:33,369 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-08 22:39:33,369 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 22:39:33,369 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 22:39:33,371 INFO L229 MonitoredProcess]: Starting monitored process 27 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 22:39:33,371 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (27)] Waiting until timeout for monitored process [2025-03-08 22:39:33,475 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 92 statements into 13 equivalence classes. [2025-03-08 22:39:35,779 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 13 check-sat command(s) and asserted 92 of 92 statements. [2025-03-08 22:39:35,780 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 13 check-sat command(s) [2025-03-08 22:39:35,780 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:39:35,788 INFO L256 TraceCheckSpWp]: Trace formula consists of 616 conjuncts, 203 conjuncts are in the unsatisfiable core [2025-03-08 22:39:35,790 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 22:39:36,217 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-03-08 22:39:36,832 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2025-03-08 22:39:36,866 INFO L134 CoverageAnalysis]: Checked inductivity of 476 backedges. 36 proven. 440 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 22:39:36,867 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 22:39:37,452 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 13 [2025-03-08 22:39:37,453 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 16 treesize of output 12 [2025-03-08 22:39:38,024 INFO L134 CoverageAnalysis]: Checked inductivity of 476 backedges. 36 proven. 440 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 22:39:38,024 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1470220642] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 22:39:38,024 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 22:39:38,024 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [41, 31, 31] total 98 [2025-03-08 22:39:38,024 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1917142186] [2025-03-08 22:39:38,024 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 22:39:38,024 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 98 states [2025-03-08 22:39:38,024 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 22:39:38,025 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 98 interpolants. [2025-03-08 22:39:38,025 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=408, Invalid=9098, Unknown=0, NotChecked=0, Total=9506 [2025-03-08 22:39:38,025 INFO L87 Difference]: Start difference. First operand 93 states and 94 transitions. Second operand has 98 states, 98 states have (on average 2.673469387755102) internal successors, (262), 98 states have internal predecessors, (262), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 22:39:41,214 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 22:39:41,214 INFO L93 Difference]: Finished difference Result 148 states and 149 transitions. [2025-03-08 22:39:41,214 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2025-03-08 22:39:41,215 INFO L78 Accepts]: Start accepts. Automaton has has 98 states, 98 states have (on average 2.673469387755102) internal successors, (262), 98 states have internal predecessors, (262), 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 92 [2025-03-08 22:39:41,215 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 22:39:41,215 INFO L225 Difference]: With dead ends: 148 [2025-03-08 22:39:41,215 INFO L226 Difference]: Without dead ends: 98 [2025-03-08 22:39:41,216 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 271 GetRequests, 127 SyntacticMatches, 0 SemanticMatches, 144 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4558 ImplicationChecksByTransitivity, 4.5s TimeCoverageRelationStatistics Valid=1000, Invalid=20170, Unknown=0, NotChecked=0, Total=21170 [2025-03-08 22:39:41,216 INFO L435 NwaCegarLoop]: 17 mSDtfsCounter, 17 mSDsluCounter, 777 mSDsCounter, 0 mSdLazyCounter, 4212 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 794 SdHoareTripleChecker+Invalid, 4245 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 4212 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2025-03-08 22:39:41,216 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 794 Invalid, 4245 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 4212 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2025-03-08 22:39:41,217 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2025-03-08 22:39:41,218 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 96. [2025-03-08 22:39:41,218 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 96 states, 95 states have (on average 1.0210526315789474) internal successors, (97), 95 states have internal predecessors, (97), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 22:39:41,218 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 97 transitions. [2025-03-08 22:39:41,218 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 97 transitions. Word has length 92 [2025-03-08 22:39:41,218 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 22:39:41,218 INFO L471 AbstractCegarLoop]: Abstraction has 96 states and 97 transitions. [2025-03-08 22:39:41,218 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 98 states, 98 states have (on average 2.673469387755102) internal successors, (262), 98 states have internal predecessors, (262), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 22:39:41,218 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 97 transitions. [2025-03-08 22:39:41,219 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2025-03-08 22:39:41,219 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 22:39:41,219 INFO L218 NwaCegarLoop]: trace histogram [13, 13, 12, 12, 12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 22:39:41,229 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (27)] Ended with exit code 0 [2025-03-08 22:39:41,419 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 27 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable42 [2025-03-08 22:39:41,419 INFO L396 AbstractCegarLoop]: === Iteration 44 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 6 more)] === [2025-03-08 22:39:41,419 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:39:41,419 INFO L85 PathProgramCache]: Analyzing trace with hash 820528151, now seen corresponding path program 22 times [2025-03-08 22:39:41,419 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:39:41,419 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [739955957] [2025-03-08 22:39:41,420 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-08 22:39:41,420 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:39:41,430 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 95 statements into 2 equivalence classes. [2025-03-08 22:39:41,450 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 95 of 95 statements. [2025-03-08 22:39:41,450 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-03-08 22:39:41,450 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:39:42,957 INFO L134 CoverageAnalysis]: Checked inductivity of 510 backedges. 176 proven. 334 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 22:39:42,957 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 22:39:42,957 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [739955957] [2025-03-08 22:39:42,957 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [739955957] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 22:39:42,957 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1858002362] [2025-03-08 22:39:42,957 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-08 22:39:42,957 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 22:39:42,958 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 22:39:42,959 INFO L229 MonitoredProcess]: Starting monitored process 28 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 22:39:42,960 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (28)] Waiting until timeout for monitored process [2025-03-08 22:39:43,076 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 95 statements into 2 equivalence classes. [2025-03-08 22:39:44,024 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 95 of 95 statements. [2025-03-08 22:39:44,024 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-03-08 22:39:44,024 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:39:44,030 INFO L256 TraceCheckSpWp]: Trace formula consists of 629 conjuncts, 226 conjuncts are in the unsatisfiable core [2025-03-08 22:39:44,034 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 22:39:44,064 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2025-03-08 22:39:44,079 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 22:39:44,081 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-08 22:39:44,084 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 10 treesize of output 8 [2025-03-08 22:39:45,926 INFO L134 CoverageAnalysis]: Checked inductivity of 510 backedges. 0 proven. 510 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 22:39:45,926 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 22:39:47,604 INFO L173 IndexEqualityManager]: detected equality via solver [2025-03-08 22:39:47,676 INFO L134 CoverageAnalysis]: Checked inductivity of 510 backedges. 0 proven. 510 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 22:39:47,677 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1858002362] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 22:39:47,677 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 22:39:47,677 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [34, 32, 32] total 96 [2025-03-08 22:39:47,677 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [112674686] [2025-03-08 22:39:47,677 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 22:39:47,677 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 97 states [2025-03-08 22:39:47,677 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 22:39:47,678 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 97 interpolants. [2025-03-08 22:39:47,678 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=629, Invalid=8683, Unknown=0, NotChecked=0, Total=9312 [2025-03-08 22:39:47,678 INFO L87 Difference]: Start difference. First operand 96 states and 97 transitions. Second operand has 97 states, 96 states have (on average 2.9479166666666665) internal successors, (283), 97 states have internal predecessors, (283), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 22:39:50,005 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 22:39:50,005 INFO L93 Difference]: Finished difference Result 105 states and 107 transitions. [2025-03-08 22:39:50,005 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 57 states. [2025-03-08 22:39:50,005 INFO L78 Accepts]: Start accepts. Automaton has has 97 states, 96 states have (on average 2.9479166666666665) internal successors, (283), 97 states have internal predecessors, (283), 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 95 [2025-03-08 22:39:50,005 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 22:39:50,006 INFO L225 Difference]: With dead ends: 105 [2025-03-08 22:39:50,006 INFO L226 Difference]: Without dead ends: 105 [2025-03-08 22:39:50,006 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 247 GetRequests, 127 SyntacticMatches, 0 SemanticMatches, 120 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4142 ImplicationChecksByTransitivity, 4.2s TimeCoverageRelationStatistics Valid=1015, Invalid=13747, Unknown=0, NotChecked=0, Total=14762 [2025-03-08 22:39:50,007 INFO L435 NwaCegarLoop]: 16 mSDtfsCounter, 24 mSDsluCounter, 634 mSDsCounter, 0 mSdLazyCounter, 4208 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 650 SdHoareTripleChecker+Invalid, 4219 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 4208 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2025-03-08 22:39:50,007 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [24 Valid, 650 Invalid, 4219 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 4208 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2025-03-08 22:39:50,007 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2025-03-08 22:39:50,008 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 100. [2025-03-08 22:39:50,008 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 100 states, 99 states have (on average 1.02020202020202) internal successors, (101), 99 states have internal predecessors, (101), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 22:39:50,008 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 101 transitions. [2025-03-08 22:39:50,008 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 101 transitions. Word has length 95 [2025-03-08 22:39:50,008 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 22:39:50,008 INFO L471 AbstractCegarLoop]: Abstraction has 100 states and 101 transitions. [2025-03-08 22:39:50,008 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 97 states, 96 states have (on average 2.9479166666666665) internal successors, (283), 97 states have internal predecessors, (283), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 22:39:50,008 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 101 transitions. [2025-03-08 22:39:50,009 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2025-03-08 22:39:50,009 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 22:39:50,009 INFO L218 NwaCegarLoop]: trace histogram [14, 14, 13, 13, 12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 22:39:50,018 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (28)] Ended with exit code 0