./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/termination-dietlibc/dirname-2.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version e2fb8bed Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../sv-benchmarks/c/termination-dietlibc/dirname-2.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 64bit --witnessprinter.graph.data.programhash c17dc684f0856c2cb34d9c0f310a5ac71ddc07f596d7c8c46ee2d12464efc754 --- Real Ultimate output --- This is Ultimate 0.3.0-?-e2fb8be-m [2025-03-08 22:41:23,040 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-08 22:41:23,092 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-64bit-Automizer_Default.epf [2025-03-08 22:41:23,095 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-08 22:41:23,096 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-08 22:41:23,110 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-08 22:41:23,110 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-08 22:41:23,110 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-08 22:41:23,111 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-08 22:41:23,111 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-08 22:41:23,112 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-08 22:41:23,112 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-08 22:41:23,112 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-08 22:41:23,112 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-08 22:41:23,113 INFO L153 SettingsManager]: * Use SBE=true [2025-03-08 22:41:23,113 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-08 22:41:23,113 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-08 22:41:23,113 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-08 22:41:23,113 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2025-03-08 22:41:23,113 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2025-03-08 22:41:23,113 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2025-03-08 22:41:23,113 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-08 22:41:23,114 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-03-08 22:41:23,114 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-03-08 22:41:23,114 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-08 22:41:23,114 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-08 22:41:23,114 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-08 22:41:23,114 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-08 22:41:23,114 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-08 22:41:23,114 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-08 22:41:23,114 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 22:41:23,115 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-08 22:41:23,115 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-08 22:41:23,115 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-08 22:41:23,115 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-08 22:41:23,115 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-08 22:41:23,115 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-08 22:41:23,115 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-08 22:41:23,115 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-08 22:41:23,115 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> c17dc684f0856c2cb34d9c0f310a5ac71ddc07f596d7c8c46ee2d12464efc754 [2025-03-08 22:41:23,333 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-08 22:41:23,340 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-08 22:41:23,342 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-08 22:41:23,343 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-08 22:41:23,343 INFO L274 PluginConnector]: CDTParser initialized [2025-03-08 22:41:23,344 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/termination-dietlibc/dirname-2.i [2025-03-08 22:41:24,485 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e756fc19c/f23c9881120e435e8cb0544e88ebeedf/FLAG6db119972 [2025-03-08 22:41:24,733 INFO L384 CDTParser]: Found 1 translation units. [2025-03-08 22:41:24,735 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/termination-dietlibc/dirname-2.i [2025-03-08 22:41:24,747 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e756fc19c/f23c9881120e435e8cb0544e88ebeedf/FLAG6db119972 [2025-03-08 22:41:24,762 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e756fc19c/f23c9881120e435e8cb0544e88ebeedf [2025-03-08 22:41:24,764 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-08 22:41:24,766 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-08 22:41:24,767 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-08 22:41:24,768 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-08 22:41:24,770 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-08 22:41:24,772 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 10:41:24" (1/1) ... [2025-03-08 22:41:24,772 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@43d9bdcc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:41:24, skipping insertion in model container [2025-03-08 22:41:24,773 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 10:41:24" (1/1) ... [2025-03-08 22:41:24,798 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-08 22:41:24,981 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 22:41:24,990 INFO L200 MainTranslator]: Completed pre-run [2025-03-08 22:41:25,016 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 22:41:25,033 INFO L204 MainTranslator]: Completed translation [2025-03-08 22:41:25,034 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:41:25 WrapperNode [2025-03-08 22:41:25,034 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-08 22:41:25,034 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-08 22:41:25,035 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-08 22:41:25,035 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-08 22:41:25,039 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:41:25" (1/1) ... [2025-03-08 22:41:25,049 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:41:25" (1/1) ... [2025-03-08 22:41:25,068 INFO L138 Inliner]: procedures = 114, calls = 16, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 86 [2025-03-08 22:41:25,068 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-08 22:41:25,069 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-08 22:41:25,069 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-08 22:41:25,069 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-08 22:41:25,074 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:41:25" (1/1) ... [2025-03-08 22:41:25,074 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:41:25" (1/1) ... [2025-03-08 22:41:25,079 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:41:25" (1/1) ... [2025-03-08 22:41:25,093 INFO L175 MemorySlicer]: Split 9 memory accesses to 1 slices as follows [9]. 100 percent of accesses are in the largest equivalence class. The 0 initializations are split as follows [0]. The 4 writes are split as follows [4]. [2025-03-08 22:41:25,095 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:41:25" (1/1) ... [2025-03-08 22:41:25,095 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:41:25" (1/1) ... [2025-03-08 22:41:25,103 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:41:25" (1/1) ... [2025-03-08 22:41:25,104 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:41:25" (1/1) ... [2025-03-08 22:41:25,108 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:41:25" (1/1) ... [2025-03-08 22:41:25,109 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:41:25" (1/1) ... [2025-03-08 22:41:25,110 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-08 22:41:25,111 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-08 22:41:25,111 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-08 22:41:25,111 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-08 22:41:25,112 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:41:25" (1/1) ... [2025-03-08 22:41:25,117 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 22:41:25,126 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 22:41:25,139 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:41:25,142 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:41:25,161 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-03-08 22:41:25,161 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-03-08 22:41:25,161 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-03-08 22:41:25,161 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-03-08 22:41:25,161 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-08 22:41:25,161 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-08 22:41:25,229 INFO L256 CfgBuilder]: Building ICFG [2025-03-08 22:41:25,231 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-08 22:41:25,412 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L537: havoc main_#t~ret13#1.base, main_#t~ret13#1.offset;call ULTIMATE.dealloc(main_#t~malloc12#1.base, main_#t~malloc12#1.offset);havoc main_#t~malloc12#1.base, main_#t~malloc12#1.offset; [2025-03-08 22:41:25,422 INFO L? ?]: Removed 67 outVars from TransFormulas that were not future-live. [2025-03-08 22:41:25,422 INFO L307 CfgBuilder]: Performing block encoding [2025-03-08 22:41:25,428 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-08 22:41:25,428 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-08 22:41:25,429 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 10:41:25 BoogieIcfgContainer [2025-03-08 22:41:25,429 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-08 22:41:25,430 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-08 22:41:25,430 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-08 22:41:25,434 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-08 22:41:25,434 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.03 10:41:24" (1/3) ... [2025-03-08 22:41:25,434 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6862ac7b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 10:41:25, skipping insertion in model container [2025-03-08 22:41:25,434 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:41:25" (2/3) ... [2025-03-08 22:41:25,435 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6862ac7b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 10:41:25, skipping insertion in model container [2025-03-08 22:41:25,436 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 10:41:25" (3/3) ... [2025-03-08 22:41:25,436 INFO L128 eAbstractionObserver]: Analyzing ICFG dirname-2.i [2025-03-08 22:41:25,447 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-08 22:41:25,449 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG dirname-2.i that has 1 procedures, 47 locations, 1 initial locations, 4 loop locations, and 19 error locations. [2025-03-08 22:41:25,476 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-08 22:41:25,484 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;@6d6d2388, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-08 22:41:25,484 INFO L334 AbstractCegarLoop]: Starting to check reachability of 19 error locations. [2025-03-08 22:41:25,487 INFO L276 IsEmpty]: Start isEmpty. Operand has 47 states, 27 states have (on average 2.185185185185185) internal successors, (59), 46 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:41:25,491 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2025-03-08 22:41:25,491 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 22:41:25,492 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2025-03-08 22:41:25,492 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 16 more)] === [2025-03-08 22:41:25,496 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:41:25,497 INFO L85 PathProgramCache]: Analyzing trace with hash 3200379, now seen corresponding path program 1 times [2025-03-08 22:41:25,502 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:41:25,502 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1534965996] [2025-03-08 22:41:25,502 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:41:25,503 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:41:25,551 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-03-08 22:41:25,559 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-03-08 22:41:25,560 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:41:25,561 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:41:25,604 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:41:25,604 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 22:41:25,604 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1534965996] [2025-03-08 22:41:25,604 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1534965996] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 22:41:25,606 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 22:41:25,606 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-08 22:41:25,607 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1264134066] [2025-03-08 22:41:25,608 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 22:41:25,610 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 22:41:25,610 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 22:41:25,628 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 22:41:25,629 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 22:41:25,631 INFO L87 Difference]: Start difference. First operand has 47 states, 27 states have (on average 2.185185185185185) internal successors, (59), 46 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) Second operand has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 22:41:25,684 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 22:41:25,685 INFO L93 Difference]: Finished difference Result 48 states and 56 transitions. [2025-03-08 22:41:25,687 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 22:41:25,688 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 4 [2025-03-08 22:41:25,688 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 22:41:25,693 INFO L225 Difference]: With dead ends: 48 [2025-03-08 22:41:25,693 INFO L226 Difference]: Without dead ends: 45 [2025-03-08 22:41:25,695 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:41:25,696 INFO L435 NwaCegarLoop]: 53 mSDtfsCounter, 0 mSDsluCounter, 30 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 83 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 22:41:25,697 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 83 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 22:41:25,705 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2025-03-08 22:41:25,714 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 45. [2025-03-08 22:41:25,716 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 45 states, 26 states have (on average 2.0) internal successors, (52), 44 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:41:25,718 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 52 transitions. [2025-03-08 22:41:25,720 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 52 transitions. Word has length 4 [2025-03-08 22:41:25,720 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 22:41:25,720 INFO L471 AbstractCegarLoop]: Abstraction has 45 states and 52 transitions. [2025-03-08 22:41:25,721 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 22:41:25,721 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 52 transitions. [2025-03-08 22:41:25,722 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2025-03-08 22:41:25,722 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 22:41:25,722 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2025-03-08 22:41:25,722 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-08 22:41:25,723 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr17REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 16 more)] === [2025-03-08 22:41:25,723 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:41:25,723 INFO L85 PathProgramCache]: Analyzing trace with hash 3200506, now seen corresponding path program 1 times [2025-03-08 22:41:25,724 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:41:25,724 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [78058617] [2025-03-08 22:41:25,724 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:41:25,724 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:41:25,730 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-03-08 22:41:25,742 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-03-08 22:41:25,742 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:41:25,742 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:41:25,796 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:41:25,797 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 22:41:25,797 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [78058617] [2025-03-08 22:41:25,797 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [78058617] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 22:41:25,797 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 22:41:25,797 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-08 22:41:25,797 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [798237464] [2025-03-08 22:41:25,797 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 22:41:25,797 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 22:41:25,797 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 22:41:25,798 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 22:41:25,798 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 22:41:25,798 INFO L87 Difference]: Start difference. First operand 45 states and 52 transitions. Second operand has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 22:41:25,834 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 22:41:25,834 INFO L93 Difference]: Finished difference Result 44 states and 51 transitions. [2025-03-08 22:41:25,835 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 22:41:25,835 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 4 [2025-03-08 22:41:25,835 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 22:41:25,835 INFO L225 Difference]: With dead ends: 44 [2025-03-08 22:41:25,835 INFO L226 Difference]: Without dead ends: 44 [2025-03-08 22:41:25,835 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:41:25,836 INFO L435 NwaCegarLoop]: 48 mSDtfsCounter, 1 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 75 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 22:41:25,836 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 75 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 22:41:25,836 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2025-03-08 22:41:25,838 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 44. [2025-03-08 22:41:25,838 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 44 states, 26 states have (on average 1.9615384615384615) internal successors, (51), 43 states have internal predecessors, (51), 0 states have call successors, (0), 0 states 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:41:25,840 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 51 transitions. [2025-03-08 22:41:25,840 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 51 transitions. Word has length 4 [2025-03-08 22:41:25,840 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 22:41:25,840 INFO L471 AbstractCegarLoop]: Abstraction has 44 states and 51 transitions. [2025-03-08 22:41:25,840 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 22:41:25,840 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 51 transitions. [2025-03-08 22:41:25,841 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2025-03-08 22:41:25,841 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 22:41:25,841 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2025-03-08 22:41:25,841 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-08 22:41:25,841 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr18REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 16 more)] === [2025-03-08 22:41:25,843 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:41:25,843 INFO L85 PathProgramCache]: Analyzing trace with hash 3200507, now seen corresponding path program 1 times [2025-03-08 22:41:25,843 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:41:25,843 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1744532258] [2025-03-08 22:41:25,843 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:41:25,843 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:41:25,851 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-03-08 22:41:25,862 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-03-08 22:41:25,862 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:41:25,862 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:41:25,994 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:41:25,996 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 22:41:25,996 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1744532258] [2025-03-08 22:41:25,996 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1744532258] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 22:41:25,996 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 22:41:25,996 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 22:41:25,996 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1287372116] [2025-03-08 22:41:25,996 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 22:41:25,996 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 22:41:25,996 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 22:41:25,997 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 22:41:25,997 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-08 22:41:25,997 INFO L87 Difference]: Start difference. First operand 44 states and 51 transitions. Second operand has 4 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 4 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 22:41:26,034 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 22:41:26,034 INFO L93 Difference]: Finished difference Result 43 states and 50 transitions. [2025-03-08 22:41:26,035 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 22:41:26,035 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 4 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 4 [2025-03-08 22:41:26,035 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 22:41:26,035 INFO L225 Difference]: With dead ends: 43 [2025-03-08 22:41:26,035 INFO L226 Difference]: Without dead ends: 43 [2025-03-08 22:41:26,035 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:41:26,036 INFO L435 NwaCegarLoop]: 48 mSDtfsCounter, 0 mSDsluCounter, 77 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 125 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 22:41:26,036 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 125 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 22:41:26,036 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2025-03-08 22:41:26,037 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 43. [2025-03-08 22:41:26,038 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 43 states, 26 states have (on average 1.9230769230769231) internal successors, (50), 42 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 22:41:26,038 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 50 transitions. [2025-03-08 22:41:26,038 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 50 transitions. Word has length 4 [2025-03-08 22:41:26,038 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 22:41:26,038 INFO L471 AbstractCegarLoop]: Abstraction has 43 states and 50 transitions. [2025-03-08 22:41:26,038 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 4 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 22:41:26,038 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 50 transitions. [2025-03-08 22:41:26,038 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2025-03-08 22:41:26,038 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 22:41:26,040 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 22:41:26,040 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-08 22:41:26,041 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 16 more)] === [2025-03-08 22:41:26,042 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:41:26,042 INFO L85 PathProgramCache]: Analyzing trace with hash 798044788, now seen corresponding path program 1 times [2025-03-08 22:41:26,042 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:41:26,042 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2073451070] [2025-03-08 22:41:26,042 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:41:26,043 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:41:26,051 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-03-08 22:41:26,060 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-03-08 22:41:26,063 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:41:26,063 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:41:26,126 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:41:26,127 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 22:41:26,127 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2073451070] [2025-03-08 22:41:26,127 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2073451070] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 22:41:26,127 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 22:41:26,127 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 22:41:26,127 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1383247230] [2025-03-08 22:41:26,127 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 22:41:26,127 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 22:41:26,127 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 22:41:26,128 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 22:41:26,128 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-08 22:41:26,128 INFO L87 Difference]: Start difference. First operand 43 states and 50 transitions. Second operand has 4 states, 4 states have (on average 2.0) internal successors, (8), 4 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 22:41:26,172 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 22:41:26,172 INFO L93 Difference]: Finished difference Result 44 states and 50 transitions. [2025-03-08 22:41:26,172 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 22:41:26,172 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.0) internal successors, (8), 4 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 8 [2025-03-08 22:41:26,172 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 22:41:26,173 INFO L225 Difference]: With dead ends: 44 [2025-03-08 22:41:26,173 INFO L226 Difference]: Without dead ends: 44 [2025-03-08 22:41:26,173 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:41:26,173 INFO L435 NwaCegarLoop]: 33 mSDtfsCounter, 39 mSDsluCounter, 35 mSDsCounter, 0 mSdLazyCounter, 37 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 39 SdHoareTripleChecker+Valid, 68 SdHoareTripleChecker+Invalid, 37 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 37 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 22:41:26,174 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [39 Valid, 68 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 37 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 22:41:26,174 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2025-03-08 22:41:26,178 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 43. [2025-03-08 22:41:26,178 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 43 states, 26 states have (on average 1.8846153846153846) internal successors, (49), 42 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 22:41:26,179 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 49 transitions. [2025-03-08 22:41:26,180 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 49 transitions. Word has length 8 [2025-03-08 22:41:26,180 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 22:41:26,180 INFO L471 AbstractCegarLoop]: Abstraction has 43 states and 49 transitions. [2025-03-08 22:41:26,180 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.0) internal successors, (8), 4 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 22:41:26,180 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 49 transitions. [2025-03-08 22:41:26,180 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2025-03-08 22:41:26,180 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 22:41:26,180 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 22:41:26,181 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-08 22:41:26,181 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr15REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 16 more)] === [2025-03-08 22:41:26,181 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:41:26,181 INFO L85 PathProgramCache]: Analyzing trace with hash 798047510, now seen corresponding path program 1 times [2025-03-08 22:41:26,181 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:41:26,181 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1203338090] [2025-03-08 22:41:26,181 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:41:26,182 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:41:26,189 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-03-08 22:41:26,195 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-03-08 22:41:26,197 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:41:26,197 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:41:26,265 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:41:26,265 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 22:41:26,265 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1203338090] [2025-03-08 22:41:26,265 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1203338090] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 22:41:26,265 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 22:41:26,266 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 22:41:26,266 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1271285321] [2025-03-08 22:41:26,266 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 22:41:26,266 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 22:41:26,266 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 22:41:26,266 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 22:41:26,266 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-08 22:41:26,267 INFO L87 Difference]: Start difference. First operand 43 states and 49 transitions. Second operand has 5 states, 4 states have (on average 2.0) internal successors, (8), 5 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 22:41:26,354 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 22:41:26,355 INFO L93 Difference]: Finished difference Result 41 states and 47 transitions. [2025-03-08 22:41:26,355 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-08 22:41:26,355 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 2.0) internal successors, (8), 5 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 8 [2025-03-08 22:41:26,355 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 22:41:26,355 INFO L225 Difference]: With dead ends: 41 [2025-03-08 22:41:26,355 INFO L226 Difference]: Without dead ends: 41 [2025-03-08 22:41:26,356 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:41:26,356 INFO L435 NwaCegarLoop]: 14 mSDtfsCounter, 41 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 106 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 41 SdHoareTripleChecker+Valid, 31 SdHoareTripleChecker+Invalid, 110 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 106 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 22:41:26,356 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [41 Valid, 31 Invalid, 110 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 106 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 22:41:26,357 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2025-03-08 22:41:26,359 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 40. [2025-03-08 22:41:26,360 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 40 states, 26 states have (on average 1.7692307692307692) internal successors, (46), 39 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 22:41:26,361 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 46 transitions. [2025-03-08 22:41:26,362 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 46 transitions. Word has length 8 [2025-03-08 22:41:26,362 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 22:41:26,362 INFO L471 AbstractCegarLoop]: Abstraction has 40 states and 46 transitions. [2025-03-08 22:41:26,362 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 2.0) internal successors, (8), 5 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 22:41:26,362 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 46 transitions. [2025-03-08 22:41:26,362 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2025-03-08 22:41:26,362 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 22:41:26,362 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 22:41:26,362 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-08 22:41:26,362 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr16REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 16 more)] === [2025-03-08 22:41:26,363 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:41:26,363 INFO L85 PathProgramCache]: Analyzing trace with hash 798047511, now seen corresponding path program 1 times [2025-03-08 22:41:26,363 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:41:26,363 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1123732456] [2025-03-08 22:41:26,363 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:41:26,363 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:41:26,371 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-03-08 22:41:26,376 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-03-08 22:41:26,376 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:41:26,376 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:41:26,512 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:41:26,512 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 22:41:26,513 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1123732456] [2025-03-08 22:41:26,513 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1123732456] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 22:41:26,513 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 22:41:26,513 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 22:41:26,513 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1611235416] [2025-03-08 22:41:26,513 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 22:41:26,514 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 22:41:26,514 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 22:41:26,514 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 22:41:26,514 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-08 22:41:26,514 INFO L87 Difference]: Start difference. First operand 40 states and 46 transitions. Second operand has 6 states, 5 states have (on average 1.6) internal successors, (8), 6 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 22:41:26,612 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 22:41:26,613 INFO L93 Difference]: Finished difference Result 46 states and 54 transitions. [2025-03-08 22:41:26,613 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-08 22:41:26,613 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 1.6) internal successors, (8), 6 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 8 [2025-03-08 22:41:26,613 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 22:41:26,614 INFO L225 Difference]: With dead ends: 46 [2025-03-08 22:41:26,614 INFO L226 Difference]: Without dead ends: 46 [2025-03-08 22:41:26,614 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2025-03-08 22:41:26,616 INFO L435 NwaCegarLoop]: 15 mSDtfsCounter, 48 mSDsluCounter, 42 mSDsCounter, 0 mSdLazyCounter, 132 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 48 SdHoareTripleChecker+Valid, 57 SdHoareTripleChecker+Invalid, 133 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 132 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 22:41:26,617 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [48 Valid, 57 Invalid, 133 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 132 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 22:41:26,617 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2025-03-08 22:41:26,619 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 43. [2025-03-08 22:41:26,621 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 43 states, 29 states have (on average 1.7241379310344827) internal successors, (50), 42 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 22:41:26,621 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 50 transitions. [2025-03-08 22:41:26,621 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 50 transitions. Word has length 8 [2025-03-08 22:41:26,621 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 22:41:26,621 INFO L471 AbstractCegarLoop]: Abstraction has 43 states and 50 transitions. [2025-03-08 22:41:26,621 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 1.6) internal successors, (8), 6 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 22:41:26,621 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 50 transitions. [2025-03-08 22:41:26,622 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2025-03-08 22:41:26,622 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 22:41:26,622 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 22:41:26,622 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-08 22:41:26,622 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr16REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 16 more)] === [2025-03-08 22:41:26,622 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:41:26,622 INFO L85 PathProgramCache]: Analyzing trace with hash 1542192218, now seen corresponding path program 1 times [2025-03-08 22:41:26,622 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:41:26,622 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2072741845] [2025-03-08 22:41:26,622 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:41:26,622 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:41:26,628 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-03-08 22:41:26,636 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-03-08 22:41:26,636 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:41:26,636 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:41:26,940 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 22:41:26,940 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 22:41:26,940 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2072741845] [2025-03-08 22:41:26,940 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2072741845] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 22:41:26,940 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1017020018] [2025-03-08 22:41:26,941 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:41:26,941 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 22:41:26,941 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 22:41:26,943 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:41:26,945 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:41:26,979 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-03-08 22:41:26,992 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-03-08 22:41:26,992 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:41:26,992 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:41:26,998 INFO L256 TraceCheckSpWp]: Trace formula consists of 84 conjuncts, 29 conjuncts are in the unsatisfiable core [2025-03-08 22:41:27,002 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 22:41:27,053 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:41:27,296 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-08 22:41:27,296 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 18 treesize of output 19 [2025-03-08 22:41:27,353 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 22:41:27,353 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 22:41:27,616 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 11 [2025-03-08 22:41:27,621 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2025-03-08 22:41:27,629 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 20 [2025-03-08 22:41:27,641 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 22:41:27,641 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1017020018] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 22:41:27,641 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 22:41:27,641 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 8, 8] total 19 [2025-03-08 22:41:27,641 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1320089473] [2025-03-08 22:41:27,641 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 22:41:27,641 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2025-03-08 22:41:27,642 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 22:41:27,642 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2025-03-08 22:41:27,642 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=326, Unknown=0, NotChecked=0, Total=380 [2025-03-08 22:41:27,642 INFO L87 Difference]: Start difference. First operand 43 states and 50 transitions. Second operand has 20 states, 19 states have (on average 1.5789473684210527) internal successors, (30), 20 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:41:28,793 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 22:41:28,794 INFO L93 Difference]: Finished difference Result 50 states and 60 transitions. [2025-03-08 22:41:28,794 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-08 22:41:28,794 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 19 states have (on average 1.5789473684210527) internal successors, (30), 20 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) Word has length 12 [2025-03-08 22:41:28,794 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 22:41:28,795 INFO L225 Difference]: With dead ends: 50 [2025-03-08 22:41:28,795 INFO L226 Difference]: Without dead ends: 50 [2025-03-08 22:41:28,795 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 10 SyntacticMatches, 2 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 55 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=110, Invalid=540, Unknown=0, NotChecked=0, Total=650 [2025-03-08 22:41:28,796 INFO L435 NwaCegarLoop]: 17 mSDtfsCounter, 107 mSDsluCounter, 167 mSDsCounter, 0 mSdLazyCounter, 460 mSolverCounterSat, 10 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 107 SdHoareTripleChecker+Valid, 184 SdHoareTripleChecker+Invalid, 471 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 460 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2025-03-08 22:41:28,796 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [107 Valid, 184 Invalid, 471 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 460 Invalid, 1 Unknown, 0 Unchecked, 0.9s Time] [2025-03-08 22:41:28,797 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2025-03-08 22:41:28,799 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 44. [2025-03-08 22:41:28,799 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 44 states, 31 states have (on average 1.6774193548387097) internal successors, (52), 43 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:41:28,799 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 52 transitions. [2025-03-08 22:41:28,799 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 52 transitions. Word has length 12 [2025-03-08 22:41:28,799 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 22:41:28,799 INFO L471 AbstractCegarLoop]: Abstraction has 44 states and 52 transitions. [2025-03-08 22:41:28,799 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 19 states have (on average 1.5789473684210527) internal successors, (30), 20 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:41:28,799 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 52 transitions. [2025-03-08 22:41:28,800 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2025-03-08 22:41:28,800 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 22:41:28,800 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 22:41:28,809 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:41:29,000 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 22:41:29,001 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 16 more)] === [2025-03-08 22:41:29,001 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:41:29,001 INFO L85 PathProgramCache]: Analyzing trace with hash 282931721, now seen corresponding path program 1 times [2025-03-08 22:41:29,001 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:41:29,001 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1826634960] [2025-03-08 22:41:29,001 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:41:29,001 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:41:29,010 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-03-08 22:41:29,013 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-03-08 22:41:29,013 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:41:29,013 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:41:29,066 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:41:29,066 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 22:41:29,066 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1826634960] [2025-03-08 22:41:29,066 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1826634960] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 22:41:29,066 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 22:41:29,066 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-08 22:41:29,066 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1518950452] [2025-03-08 22:41:29,066 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 22:41:29,066 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-08 22:41:29,066 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 22:41:29,067 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-08 22:41:29,067 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2025-03-08 22:41:29,067 INFO L87 Difference]: Start difference. First operand 44 states and 52 transitions. Second operand has 7 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 7 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:41:29,169 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 22:41:29,170 INFO L93 Difference]: Finished difference Result 53 states and 66 transitions. [2025-03-08 22:41:29,170 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-08 22:41:29,170 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 7 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:41:29,170 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 22:41:29,170 INFO L225 Difference]: With dead ends: 53 [2025-03-08 22:41:29,170 INFO L226 Difference]: Without dead ends: 53 [2025-03-08 22:41:29,171 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2025-03-08 22:41:29,171 INFO L435 NwaCegarLoop]: 18 mSDtfsCounter, 20 mSDsluCounter, 34 mSDsCounter, 0 mSdLazyCounter, 195 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 52 SdHoareTripleChecker+Invalid, 202 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 195 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 22:41:29,171 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 52 Invalid, 202 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 195 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 22:41:29,172 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2025-03-08 22:41:29,173 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 52. [2025-03-08 22:41:29,173 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 52 states, 41 states have (on average 1.6097560975609757) internal successors, (66), 51 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:41:29,174 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 66 transitions. [2025-03-08 22:41:29,174 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 66 transitions. Word has length 14 [2025-03-08 22:41:29,174 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 22:41:29,174 INFO L471 AbstractCegarLoop]: Abstraction has 52 states and 66 transitions. [2025-03-08 22:41:29,174 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 7 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:41:29,174 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 66 transitions. [2025-03-08 22:41:29,174 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2025-03-08 22:41:29,174 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 22:41:29,174 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 22:41:29,175 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-08 22:41:29,175 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 16 more)] === [2025-03-08 22:41:29,175 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:41:29,175 INFO L85 PathProgramCache]: Analyzing trace with hash 282931722, now seen corresponding path program 1 times [2025-03-08 22:41:29,175 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:41:29,175 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1438160096] [2025-03-08 22:41:29,175 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:41:29,175 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:41:29,179 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-03-08 22:41:29,183 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-03-08 22:41:29,183 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:41:29,183 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:41:29,230 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:41:29,231 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 22:41:29,231 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1438160096] [2025-03-08 22:41:29,231 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1438160096] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 22:41:29,231 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 22:41:29,231 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-08 22:41:29,231 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [233214632] [2025-03-08 22:41:29,231 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 22:41:29,231 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 22:41:29,231 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 22:41:29,232 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 22:41:29,232 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-08 22:41:29,232 INFO L87 Difference]: Start difference. First operand 52 states and 66 transitions. Second operand has 6 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 6 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:41:29,283 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 22:41:29,283 INFO L93 Difference]: Finished difference Result 54 states and 67 transitions. [2025-03-08 22:41:29,283 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-08 22:41:29,284 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 6 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:41:29,284 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 22:41:29,284 INFO L225 Difference]: With dead ends: 54 [2025-03-08 22:41:29,284 INFO L226 Difference]: Without dead ends: 54 [2025-03-08 22:41:29,284 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2025-03-08 22:41:29,284 INFO L435 NwaCegarLoop]: 39 mSDtfsCounter, 9 mSDsluCounter, 126 mSDsCounter, 0 mSdLazyCounter, 40 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 165 SdHoareTripleChecker+Invalid, 40 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 40 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 22:41:29,284 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 165 Invalid, 40 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 40 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 22:41:29,285 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2025-03-08 22:41:29,286 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 54. [2025-03-08 22:41:29,286 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 54 states, 43 states have (on average 1.558139534883721) internal successors, (67), 53 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 22:41:29,286 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 67 transitions. [2025-03-08 22:41:29,286 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 67 transitions. Word has length 14 [2025-03-08 22:41:29,286 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 22:41:29,286 INFO L471 AbstractCegarLoop]: Abstraction has 54 states and 67 transitions. [2025-03-08 22:41:29,286 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 6 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:41:29,287 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 67 transitions. [2025-03-08 22:41:29,287 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2025-03-08 22:41:29,287 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 22:41:29,287 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 22:41:29,287 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-08 22:41:29,287 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 16 more)] === [2025-03-08 22:41:29,287 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:41:29,287 INFO L85 PathProgramCache]: Analyzing trace with hash 311560872, now seen corresponding path program 1 times [2025-03-08 22:41:29,287 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:41:29,287 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1045668604] [2025-03-08 22:41:29,287 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:41:29,288 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:41:29,292 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-03-08 22:41:29,294 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-03-08 22:41:29,294 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:41:29,294 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:41:29,332 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:41:29,332 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 22:41:29,332 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1045668604] [2025-03-08 22:41:29,332 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1045668604] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 22:41:29,332 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 22:41:29,332 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 22:41:29,332 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1316200463] [2025-03-08 22:41:29,332 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 22:41:29,333 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 22:41:29,333 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 22:41:29,333 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 22:41:29,333 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-08 22:41:29,333 INFO L87 Difference]: Start difference. First operand 54 states and 67 transitions. Second operand has 5 states, 5 states have (on average 2.8) internal successors, (14), 5 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:41:29,356 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 22:41:29,356 INFO L93 Difference]: Finished difference Result 53 states and 63 transitions. [2025-03-08 22:41:29,357 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-08 22:41:29,357 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.8) internal successors, (14), 5 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:41:29,357 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 22:41:29,357 INFO L225 Difference]: With dead ends: 53 [2025-03-08 22:41:29,357 INFO L226 Difference]: Without dead ends: 53 [2025-03-08 22:41:29,357 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-08 22:41:29,358 INFO L435 NwaCegarLoop]: 42 mSDtfsCounter, 2 mSDsluCounter, 103 mSDsCounter, 0 mSdLazyCounter, 31 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 145 SdHoareTripleChecker+Invalid, 31 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 31 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 22:41:29,358 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 145 Invalid, 31 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 31 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 22:41:29,358 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2025-03-08 22:41:29,360 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 52. [2025-03-08 22:41:29,360 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 52 states, 42 states have (on average 1.5) internal successors, (63), 51 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 22:41:29,360 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 63 transitions. [2025-03-08 22:41:29,360 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 63 transitions. Word has length 14 [2025-03-08 22:41:29,360 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 22:41:29,360 INFO L471 AbstractCegarLoop]: Abstraction has 52 states and 63 transitions. [2025-03-08 22:41:29,361 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.8) internal successors, (14), 5 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:41:29,361 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 63 transitions. [2025-03-08 22:41:29,361 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2025-03-08 22:41:29,361 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 22:41:29,361 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 22:41:29,361 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-08 22:41:29,361 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 16 more)] === [2025-03-08 22:41:29,363 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:41:29,363 INFO L85 PathProgramCache]: Analyzing trace with hash 1068450426, now seen corresponding path program 1 times [2025-03-08 22:41:29,363 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:41:29,363 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [813075017] [2025-03-08 22:41:29,363 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:41:29,363 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:41:29,372 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-03-08 22:41:29,381 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-03-08 22:41:29,381 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:41:29,381 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:41:29,426 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:41:29,426 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 22:41:29,426 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [813075017] [2025-03-08 22:41:29,426 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [813075017] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 22:41:29,427 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 22:41:29,427 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 22:41:29,427 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1800092068] [2025-03-08 22:41:29,427 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 22:41:29,427 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 22:41:29,427 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 22:41:29,427 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 22:41:29,427 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-08 22:41:29,428 INFO L87 Difference]: Start difference. First operand 52 states and 63 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:41:29,446 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 22:41:29,446 INFO L93 Difference]: Finished difference Result 51 states and 62 transitions. [2025-03-08 22:41:29,447 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 22:41:29,447 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:41:29,447 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 22:41:29,448 INFO L225 Difference]: With dead ends: 51 [2025-03-08 22:41:29,448 INFO L226 Difference]: Without dead ends: 46 [2025-03-08 22:41:29,448 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:41:29,448 INFO L435 NwaCegarLoop]: 28 mSDtfsCounter, 27 mSDsluCounter, 26 mSDsCounter, 0 mSdLazyCounter, 29 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 54 SdHoareTripleChecker+Invalid, 29 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 29 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 22:41:29,449 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [27 Valid, 54 Invalid, 29 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 29 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 22:41:29,449 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2025-03-08 22:41:29,451 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 46. [2025-03-08 22:41:29,452 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 46 states, 37 states have (on average 1.4324324324324325) internal successors, (53), 45 states have internal predecessors, (53), 0 states have call successors, (0), 0 states 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:41:29,453 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 53 transitions. [2025-03-08 22:41:29,453 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 53 transitions. Word has length 15 [2025-03-08 22:41:29,453 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 22:41:29,453 INFO L471 AbstractCegarLoop]: Abstraction has 46 states and 53 transitions. [2025-03-08 22:41:29,453 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:41:29,453 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 53 transitions. [2025-03-08 22:41:29,453 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2025-03-08 22:41:29,454 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 22:41:29,454 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 22:41:29,454 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-08 22:41:29,454 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr16REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 16 more)] === [2025-03-08 22:41:29,454 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:41:29,454 INFO L85 PathProgramCache]: Analyzing trace with hash 1384079901, now seen corresponding path program 2 times [2025-03-08 22:41:29,454 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:41:29,455 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1146473635] [2025-03-08 22:41:29,455 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-08 22:41:29,455 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:41:29,461 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 16 statements into 2 equivalence classes. [2025-03-08 22:41:29,473 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 16 of 16 statements. [2025-03-08 22:41:29,475 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-08 22:41:29,475 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:41:29,910 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 22:41:29,911 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 22:41:29,911 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1146473635] [2025-03-08 22:41:29,911 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1146473635] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 22:41:29,911 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [880482034] [2025-03-08 22:41:29,911 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-08 22:41:29,911 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 22:41:29,911 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 22:41:29,913 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:41:29,915 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:41:29,952 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 16 statements into 2 equivalence classes. [2025-03-08 22:41:29,966 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 16 of 16 statements. [2025-03-08 22:41:29,967 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-08 22:41:29,967 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:41:29,968 INFO L256 TraceCheckSpWp]: Trace formula consists of 107 conjuncts, 48 conjuncts are in the unsatisfiable core [2025-03-08 22:41:29,970 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 22:41:29,998 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:41:38,962 INFO L349 Elim1Store]: treesize reduction 8, result has 52.9 percent of original size [2025-03-08 22:41:38,962 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 34 treesize of output 19 [2025-03-08 22:41:38,971 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 4 refuted. 2 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 22:41:38,971 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 22:41:39,396 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 17 [2025-03-08 22:41:39,403 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 40 treesize of output 34 [2025-03-08 22:41:39,408 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 67 treesize of output 53 [2025-03-08 22:41:39,446 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 22:41:39,446 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [880482034] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 22:41:39,446 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 22:41:39,446 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 13, 12] total 33 [2025-03-08 22:41:39,446 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1267661365] [2025-03-08 22:41:39,446 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 22:41:39,446 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2025-03-08 22:41:39,447 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 22:41:39,447 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2025-03-08 22:41:39,447 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=119, Invalid=999, Unknown=4, NotChecked=0, Total=1122 [2025-03-08 22:41:39,447 INFO L87 Difference]: Start difference. First operand 46 states and 53 transitions. Second operand has 34 states, 33 states have (on average 1.2727272727272727) internal successors, (42), 34 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 22:41:44,417 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2025-03-08 22:41:49,645 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2025-03-08 22:41:49,853 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 22:41:49,853 INFO L93 Difference]: Finished difference Result 76 states and 93 transitions. [2025-03-08 22:41:49,854 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2025-03-08 22:41:49,854 INFO L78 Accepts]: Start accepts. Automaton has has 34 states, 33 states have (on average 1.2727272727272727) internal successors, (42), 34 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2025-03-08 22:41:49,854 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 22:41:49,855 INFO L225 Difference]: With dead ends: 76 [2025-03-08 22:41:49,855 INFO L226 Difference]: Without dead ends: 76 [2025-03-08 22:41:49,856 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 57 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 650 ImplicationChecksByTransitivity, 11.2s TimeCoverageRelationStatistics Valid=558, Invalid=2858, Unknown=6, NotChecked=0, Total=3422 [2025-03-08 22:41:49,856 INFO L435 NwaCegarLoop]: 8 mSDtfsCounter, 236 mSDsluCounter, 104 mSDsCounter, 0 mSdLazyCounter, 764 mSolverCounterSat, 14 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 8.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 236 SdHoareTripleChecker+Valid, 112 SdHoareTripleChecker+Invalid, 780 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 764 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 8.5s IncrementalHoareTripleChecker+Time [2025-03-08 22:41:49,857 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [236 Valid, 112 Invalid, 780 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 764 Invalid, 2 Unknown, 0 Unchecked, 8.5s Time] [2025-03-08 22:41:49,857 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2025-03-08 22:41:49,859 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 55. [2025-03-08 22:41:49,862 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 55 states, 46 states have (on average 1.4565217391304348) internal successors, (67), 54 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 22:41:49,863 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 67 transitions. [2025-03-08 22:41:49,863 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 67 transitions. Word has length 16 [2025-03-08 22:41:49,863 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 22:41:49,863 INFO L471 AbstractCegarLoop]: Abstraction has 55 states and 67 transitions. [2025-03-08 22:41:49,863 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 34 states, 33 states have (on average 1.2727272727272727) internal successors, (42), 34 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 22:41:49,863 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 67 transitions. [2025-03-08 22:41:49,864 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2025-03-08 22:41:49,864 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 22:41:49,864 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 22:41:49,873 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:41:50,064 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2025-03-08 22:41:50,065 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr16REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 16 more)] === [2025-03-08 22:41:50,065 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:41:50,065 INFO L85 PathProgramCache]: Analyzing trace with hash 1384109692, now seen corresponding path program 1 times [2025-03-08 22:41:50,065 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:41:50,065 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2120121325] [2025-03-08 22:41:50,065 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:41:50,065 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:41:50,069 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-03-08 22:41:50,075 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-03-08 22:41:50,076 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:41:50,076 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:41:50,358 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 22:41:50,359 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 22:41:50,359 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2120121325] [2025-03-08 22:41:50,359 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2120121325] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 22:41:50,359 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [233305820] [2025-03-08 22:41:50,359 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:41:50,359 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 22:41:50,359 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 22:41:50,361 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:41:50,363 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:41:50,395 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-03-08 22:41:50,410 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-03-08 22:41:50,410 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:41:50,410 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:41:50,411 INFO L256 TraceCheckSpWp]: Trace formula consists of 102 conjuncts, 45 conjuncts are in the unsatisfiable core [2025-03-08 22:41:50,413 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 22:41:50,430 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:41:50,964 INFO L349 Elim1Store]: treesize reduction 4, result has 82.6 percent of original size [2025-03-08 22:41:50,964 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 85 treesize of output 52 [2025-03-08 22:41:51,009 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 22:41:51,009 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 22:41:51,597 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 178 treesize of output 156 [2025-03-08 22:41:51,623 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-08 22:41:51,624 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 309 treesize of output 304 [2025-03-08 22:41:51,634 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 96 treesize of output 90 [2025-03-08 22:41:52,053 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 22:41:52,053 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [233305820] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 22:41:52,053 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 22:41:52,053 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 13, 13] total 31 [2025-03-08 22:41:52,055 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1876216831] [2025-03-08 22:41:52,055 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 22:41:52,055 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2025-03-08 22:41:52,055 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 22:41:52,055 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2025-03-08 22:41:52,056 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=135, Invalid=857, Unknown=0, NotChecked=0, Total=992 [2025-03-08 22:41:52,056 INFO L87 Difference]: Start difference. First operand 55 states and 67 transitions. Second operand has 32 states, 31 states have (on average 1.3548387096774193) internal successors, (42), 32 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 22:41:54,258 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 22:41:54,259 INFO L93 Difference]: Finished difference Result 84 states and 101 transitions. [2025-03-08 22:41:54,259 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2025-03-08 22:41:54,259 INFO L78 Accepts]: Start accepts. Automaton has has 32 states, 31 states have (on average 1.3548387096774193) internal successors, (42), 32 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2025-03-08 22:41:54,259 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 22:41:54,259 INFO L225 Difference]: With dead ends: 84 [2025-03-08 22:41:54,259 INFO L226 Difference]: Without dead ends: 84 [2025-03-08 22:41:54,261 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 8 SyntacticMatches, 1 SemanticMatches, 58 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 657 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=686, Invalid=2854, Unknown=0, NotChecked=0, Total=3540 [2025-03-08 22:41:54,261 INFO L435 NwaCegarLoop]: 8 mSDtfsCounter, 236 mSDsluCounter, 100 mSDsCounter, 0 mSdLazyCounter, 747 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 236 SdHoareTripleChecker+Valid, 108 SdHoareTripleChecker+Invalid, 767 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 747 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-08 22:41:54,261 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [236 Valid, 108 Invalid, 767 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 747 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-08 22:41:54,262 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2025-03-08 22:41:54,266 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 60. [2025-03-08 22:41:54,266 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 60 states, 51 states have (on average 1.411764705882353) internal successors, (72), 59 states have internal predecessors, (72), 0 states have call successors, (0), 0 states 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:41:54,266 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 72 transitions. [2025-03-08 22:41:54,266 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 72 transitions. Word has length 16 [2025-03-08 22:41:54,266 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 22:41:54,266 INFO L471 AbstractCegarLoop]: Abstraction has 60 states and 72 transitions. [2025-03-08 22:41:54,266 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 31 states have (on average 1.3548387096774193) internal successors, (42), 32 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 22:41:54,266 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 72 transitions. [2025-03-08 22:41:54,267 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2025-03-08 22:41:54,267 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 22:41:54,267 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:41:54,274 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-03-08 22:41:54,467 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 22:41:54,467 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 16 more)] === [2025-03-08 22:41:54,468 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:41:54,468 INFO L85 PathProgramCache]: Analyzing trace with hash -1310520404, now seen corresponding path program 1 times [2025-03-08 22:41:54,468 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:41:54,468 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1884362561] [2025-03-08 22:41:54,468 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:41:54,468 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:41:54,475 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-03-08 22:41:54,478 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-03-08 22:41:54,479 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:41:54,479 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:41:54,623 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:41:54,623 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 22:41:54,623 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1884362561] [2025-03-08 22:41:54,623 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1884362561] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 22:41:54,623 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1357744595] [2025-03-08 22:41:54,623 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:41:54,623 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 22:41:54,624 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 22:41:54,626 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:41:54,645 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:41:54,686 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-03-08 22:41:54,697 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-03-08 22:41:54,697 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:41:54,697 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:41:54,698 INFO L256 TraceCheckSpWp]: Trace formula consists of 112 conjuncts, 32 conjuncts are in the unsatisfiable core [2025-03-08 22:41:54,700 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 22:41:54,792 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:41:54,792 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 22:41:54,863 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-08 22:41:54,864 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 21 treesize of output 25 [2025-03-08 22:41:54,924 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:41:54,924 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1357744595] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 22:41:54,924 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 22:41:54,924 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 7, 7] total 21 [2025-03-08 22:41:54,924 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2001253758] [2025-03-08 22:41:54,924 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 22:41:54,925 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2025-03-08 22:41:54,925 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 22:41:54,925 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2025-03-08 22:41:54,925 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=395, Unknown=0, NotChecked=0, Total=462 [2025-03-08 22:41:54,925 INFO L87 Difference]: Start difference. First operand 60 states and 72 transitions. Second operand has 22 states, 21 states have (on average 2.142857142857143) internal successors, (45), 22 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:41:55,231 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 22:41:55,231 INFO L93 Difference]: Finished difference Result 89 states and 110 transitions. [2025-03-08 22:41:55,231 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2025-03-08 22:41:55,232 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 21 states have (on average 2.142857142857143) internal successors, (45), 22 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) Word has length 18 [2025-03-08 22:41:55,232 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 22:41:55,232 INFO L225 Difference]: With dead ends: 89 [2025-03-08 22:41:55,232 INFO L226 Difference]: Without dead ends: 89 [2025-03-08 22:41:55,232 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 205 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=198, Invalid=1134, Unknown=0, NotChecked=0, Total=1332 [2025-03-08 22:41:55,233 INFO L435 NwaCegarLoop]: 7 mSDtfsCounter, 115 mSDsluCounter, 60 mSDsCounter, 0 mSdLazyCounter, 374 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 115 SdHoareTripleChecker+Valid, 67 SdHoareTripleChecker+Invalid, 389 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 374 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 22:41:55,233 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [115 Valid, 67 Invalid, 389 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 374 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 22:41:55,233 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2025-03-08 22:41:55,235 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 61. [2025-03-08 22:41:55,235 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 61 states, 53 states have (on average 1.3773584905660377) internal successors, (73), 60 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:41:55,235 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 73 transitions. [2025-03-08 22:41:55,235 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 73 transitions. Word has length 18 [2025-03-08 22:41:55,235 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 22:41:55,235 INFO L471 AbstractCegarLoop]: Abstraction has 61 states and 73 transitions. [2025-03-08 22:41:55,235 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 21 states have (on average 2.142857142857143) internal successors, (45), 22 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:41:55,235 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 73 transitions. [2025-03-08 22:41:55,236 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2025-03-08 22:41:55,236 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 22:41:55,236 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 22:41:55,242 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2025-03-08 22:41:55,436 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 22:41:55,436 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr16REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 16 more)] === [2025-03-08 22:41:55,437 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:41:55,437 INFO L85 PathProgramCache]: Analyzing trace with hash 1766183871, now seen corresponding path program 2 times [2025-03-08 22:41:55,437 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:41:55,437 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [445770383] [2025-03-08 22:41:55,437 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-08 22:41:55,437 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:41:55,444 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 20 statements into 2 equivalence classes. [2025-03-08 22:41:55,452 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 20 of 20 statements. [2025-03-08 22:41:55,453 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-08 22:41:55,453 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:41:55,784 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:41:55,784 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 22:41:55,784 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [445770383] [2025-03-08 22:41:55,784 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [445770383] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 22:41:55,784 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1395623103] [2025-03-08 22:41:55,785 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-08 22:41:55,785 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 22:41:55,785 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 22:41:55,786 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:41:55,788 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:41:55,820 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 20 statements into 2 equivalence classes. [2025-03-08 22:41:55,832 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 20 of 20 statements. [2025-03-08 22:41:55,832 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-08 22:41:55,832 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:41:55,833 INFO L256 TraceCheckSpWp]: Trace formula consists of 125 conjuncts, 53 conjuncts are in the unsatisfiable core [2025-03-08 22:41:55,834 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 22:41:55,853 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:42:10,894 INFO L349 Elim1Store]: treesize reduction 8, result has 68.0 percent of original size [2025-03-08 22:42:10,894 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 47 treesize of output 34 [2025-03-08 22:42:10,930 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 9 refuted. 6 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 22:42:10,930 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 22:42:11,343 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 17 [2025-03-08 22:42:11,349 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 57 treesize of output 49 [2025-03-08 22:42:11,353 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 86 treesize of output 64 [2025-03-08 22:42:11,389 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:42:11,389 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1395623103] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 22:42:11,389 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 22:42:11,389 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14, 14] total 38 [2025-03-08 22:42:11,390 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [414421939] [2025-03-08 22:42:11,390 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 22:42:11,390 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 39 states [2025-03-08 22:42:11,390 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 22:42:11,390 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2025-03-08 22:42:11,391 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=131, Invalid=1344, Unknown=7, NotChecked=0, Total=1482 [2025-03-08 22:42:11,391 INFO L87 Difference]: Start difference. First operand 61 states and 73 transitions. Second operand has 39 states, 38 states have (on average 1.4210526315789473) internal successors, (54), 39 states have internal predecessors, (54), 0 states have call successors, (0), 0 states 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:42:20,594 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2025-03-08 22:42:33,125 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2025-03-08 22:42:45,215 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2025-03-08 22:42:49,688 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2025-03-08 22:42:53,706 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0]